Low area field-programmable gate array implementation of PRESENT image encryption with key rotation and substitution

Lightweight ciphers are increasingly employed in cryptography because of the high demand for secure data transmission in wireless sensor network, embedded devices, and Internet of Things. The PRESENT algorithm as an ultra-lightweight block cipher provides better solution for secure hardware cryptography with low power consumption and minimum resource. This study generates the key using key rotation and substitution method, which contains key rotation, key switching, and binary-coded decimal-based key generation used in image encryption. The key rotation and substitution-based PRESENT architecture is proposed to increase security level for data stream and randomness in cipher through providing high resistance to attacks. Lookup table is used to design the key scheduling module, thus reducing the area of architecture. Field-programmable gate array (FPGA) performances are evaluated for the proposed and conventional methods. In Virtex 6 device, the proposed key rotation and substitution PRESENT architecture occupied 72 lookup tables, 65 flip flops, and 35 slices which are comparably less to the existing architecture.     

End-to-end loss differentiation for video streaming with wireless link errors

Video delivery in heterogeneous wired/wireless networks is challenging, since link errors commonly degrade throughput performance, smoothness, and eventually impair the playback quality. We present an end-to-end Loss Differentiation Mechanism (LDA) which effectively decouples congestion from wireless loss in order to abolish the damage of error-induced multiplicative decrease on flow throughput and smoothness. The proposed LDA relies on Round Trip Time measurements to estimate the queuing delay and determine the appropriate error-recovery strategy. This mechanism can be easily adapted and incorporated into existing Additive Increase Multiplicative Decrease (AIMD) protocols, enabling them to utilize the available resources more efficiently. In this context, we incorporate the LDA into AIMD-based Scalable Streaming Video Protocol (SSVP), an end-to-end TCP-friendly protocol optimized for video streaming applications. Based on simulation results, we show that the combined approach provides the desired functionality to bind operationally wired and wireless links, within the framework of bandwidth efficiency, smoothness, and fairness.     

Designing multihop wireless backhaul networks with delay guarantees

As wireless access technologies improve in data rates, the problem focus is shifting towards providing adequate backhaul from the wireless access points to the Internet. Existing wired backhaul technologies such as copper wires running at DSL, T1, or T3 speeds can be expensive to install or lease, and are becoming a performance bottleneck as wireless access speeds increase. Longhaul, non-line-of-sight wireless technologies such as WiMAX (802.16) hold the promise of enabling a high speed wireless backhaul as a cost-effective alternative. However, the biggest challenge in building a wireless backhaul is achieving guaranteed performance (throughput and delay) that is typically provided by a wired backhaul. This paper explores the problem of efficiently designing a multihop wireless backhaul to connect multiple wireless access points to a wired gateway. In particular, we provide a generalized link activation framework for scheduling packets over this wireless backhaul, such that any existing wireline scheduling policy can be implemented locally at each node of the wireless backhaul. We also present techniques for determining good interference-free routes within our scheduling framework, given the link rates and cross-link interference information. When a multihop wireline scheduler with worst case delay bounds (such as WFQ or Coordinated EDF) is implemented over the wireless backhaul, we show that our scheduling and routing framework guarantees approximately twice the delay of the corresponding wireline topology. Finally, we present simulation results to demonstrate the low delays achieved using our framework.     

Stream-based cipher feedback mode in wireless error channel

Block ciphers encrypt a fixed size block of plaintext at a time to produce a block of ciphertext. Stream ciphers encrypt stream data, such as voice or Telnet traffic, one bit or more bits at a time. The cipher feedback mode is a stream cipher implemented by a block cipher via multiple stages, and in each stage one bit or a number of bits of plaintext are encrypted at a time. In this paper, we study error performance of the stream-based cipher feedback mode in an unreliable wireless channel in terms of throughput. We model performance of the cipher feedback mode in terms of the probability that part of or the whole ciphertext can not be successfully decrypted, and the throughput by adopting the cipher feedback mode. We explicitly derive the optimal number of stages in the cipher feedback mode to achieve the optimal throughput, given an error rate in a wireless network. We also prove that for the cipher feedback mode, the whole ciphertext is successfully decrypted if and only if the whole ciphertext is successfully transmitted.     

Empirical evaluation of receiver‐based TCP delay control in CDMA2000 networks

Wide‐area broadband wireless technologies such as CDMA2000 often suffer from variable transfer rate and long latency. In particular, TCP window‐based rate control causes excessive buffering at the base station because of the lower transfer rate of the wireless link than that of the wired backhaul link. This performance characteristic of TCP further increases the end‐to‐end delay, and additional resources are required at the base station. This paper presents a practical mechanism to control the end‐to‐end TCP delay for CDMA2000 networks (or other similar wireless technologies). The key idea is to reduce and stabilize RTT (round‐trip time) by dynamically controlling the TCP advertised window size, based on a runtime measurement of the wireless channel condition at the mobile station. The proposed system has been implemented by modifying the Linux protocol stack. The experiment results, conducted on a commercial CDMA2000 1x network, show that the proposed scheme greatly reduces the TCP delay in non‐congested networks, while not sacrificing the TCP throughput in congested networks. Copyright © 2006 John Wiley & Sons, Ltd.     

A Novel Multimedia Streaming Scheme for N-Screen Services in Wireless USB Networks

Ultra wideband (UWB) technology has emerged as a solution for the wireless interface between medical sensors and a personal server in future telemedicine systems. Wireless universal serial bus (USB) is the USB technology merged with UWB technology. Wireless USB can be applied to wireless personal area network applications as well as personal area network applications like wired USB. In case of n-screen service applications, data traffics must broadcast to the adjacent devices However, the current wireless USB is designed to support the communication through the point-to-point connection between the host and the device only. This policy increases delay and energy consumption of wireless host and devices significantly. Therefore, in this paper, we propose a novel multimedia streaming scheme for n-screen service in wireless USB networks. The simulation results show that proposed protocol can enhance the throughput and delay performance and improve energy efficiency by minimizing the multimedia data delivery process.     

A Novelistic GSA and CSA Based Optimization for Energy-Efficient Routing Using Multiple Sinks in HWSNs Under Critical Scenarios

Asynchronous transfer mode (ATM) tends to be the most mature infrastructure to serve the imminent media broadband networks and is intended to eliminate network latency and improve traffic output versatility. In Weighted Round Robin (WRR) scheme, the main cause of concern is the delay that is being caused by high volumes of workloads at the wireless source nodes. In this paper, proposed an efficient intelligent time slice based round Robin scheduling algorithm for ATM with the use of integrated speed bit protocol (ISBP). The intelligent time slice offers priority, the blast of the CPU, and the time meaning transfer. The speed bit manager is maintained by the ISBP that contains prioritized objects. Then the intelligent time slice is done to generate the quantum time value. The purpose of this paper to enhance network performance in ATM networks by improving the throughput and average end-to-end delay. The new proposed scheme also offers a significant reduction in the average end-to-end delay when compared to the existing WRR scheme.

     

Performance Evaluation of Wireless Controller Area Network (WCAN) Using Token Frame Scheme

In this paper, a proposed new wireless protocol so-called wireless controller area network is introduced. WCAN is an adaptation of its wired cousin, controller area network protocol. The proposed WCAN uses token frame scheme in providing channel access to nodes in the system. This token frame method follows the example used in wireless token ring protocol which is a wireless network protocol that reduces the number of retransmissions as a result of collisions. This scheme based on CAN protocol allows nodes to share a common broadcast channel by taking turns in transmitting upon receiving the token frame that circulates around the network for a specified amount of time. The token frame allows nodes to access the network one at a time, giving ‘fair’ chance to all nodes instead of competing against one another. This method provides high throughput in a bounded latency environment. The proposed WCAN protocol has been developed and simulated by means of QualNet simulator. The performances of this proposed protocol are evaluated from the perspective of throughput, end-to-end delay and packet delivery ratio, and are compared against the IEEE 802.11 protocol. Simulation results show that the proposed WCAN outperforms IEEE 802.11 based protocol by 62.5 % in terms of throughput with increasing network size. Also, it shows an improvement of 6 % compared to IEEE 802.11 standard at a higher data interval rate.     

A General Combinatorial Ant System-based Distributed Routing Algorithm for Communication Networks

In this paper, a general Combinatorial Ant System-based distributed routing algorithm modeled like a dynamic combinatorial optimization problem is presented. In the proposed algorithm, the solution space of the dynamic combinatorial optimization problem is mapped into the space where the ants will walk, and the transition probability and the pheromone update formula of the Ant System is defined according to the objective function of the communication problem. The general nature of the approach allows for the optimization of the routing function to be applied in different types of networks just changing the performance criteria to be optimized. In fact, we test and compare the performance of our routing algorithm against well-known routing schemes for wired and wireless networks, and show its superior performance in terms throughput, delay and energy efficiency.     

Adaptive and reliable video transmission over UMTS for enhanced performance

This paper proposes a mechanism for the congestion control for video transmission over universal mobile telecommunications system (UMTS). Our scheme is applied when the mobile user experiences real‐time multimedia content and adopts the theory of a widely accepted rate control method in wired networks, namely equation‐based rate control. In this approach, the transmission rate of the multimedia data is determined as a function of the packet loss rate, the round trip time and the packet size and the server explicitly adjusts its sending rate as a function of these parameters. Furthermore, we examine the performance of the UMTS for real‐time video transmission using real‐time protocols. Through a number of experiments, we measure performance parameters such as end‐to‐end delay, delay in radio access network, delay jitter and throughput in the wireless link. Copyright © 2006 John Wiley & Sons, Ltd.     

Improvement of Transmission Control Protocol for High Bandwidth Applications

Transmission control protocol (TCP) is the widely and dominantly used protocol in today’s internet. A very recent implementation of congestion control algorithm is BBR by Google. Bottleneck bandwidth and round-trip time (BBR) is a congestion control algorithm which is created with the aim of increasing throughput and reducing delay. The congestion control protocols mentioned previously try to determine congestion limits by filling router queues. BBR drains the router queues at the bottleneck by sending exactly at the bottleneck link rate. This is done by the BBR through pacing rate which infers the delivery rate of the receiver and uses this as the estimated bottleneck bandwidth. But when the data rate is high, in the startup phase itself pipe becomes full and leads to some degradation in the Access Point of wireless environments by inducing losses specific to this environment. So the current pacing rate is not suitable for producing higher throughputs. Therefore, in the proposed system named R-BBR, this startup gain should be lower than the current startup gain which eventually would reduce pacing rate to reduce queue pressure in the sink node during the startup phase. The startup phase of BBR is modified to solve the problem of pipe full under high data rate. R-BBR has been evaluated over a wide range of wired as well as wireless networks by varying different factors like startup gain, congestion window, and pacing rate. It is inferred that R-BBR performs better than BBR with significant performance improvement.

     

Performance Modelling of TCP Enhancements in Terrestrial–Satellite Hybrid Networks

In this paper, we focus on the performance of TCP enhancements for a hybrid terrestrial–satellite network. While a large body of literature exists regarding modeling TCP performance for the wired Internet, and recently over a single-hop wireless link, the literature is very sparse on TCP analysis over a hybrid wired–wireless (multi-hop) path. We seek to make a contribution to this problem (where the wireless segment is a satellite uplink) by deriving analytical estimates of TCP throughput for two widely deployed approaches: TCP splitting and E2E (End-to-End) TCP with link layer support as a function of key parameters such as terrestrial/satellite propagation delay, segment loss rate and buffer size. Our analysis is supported by simulations; throughput comparisons indicate superiority of TCP splitting over E2E scheme in most cases. However, in situations where end-to-end delay is dominated by terrestrial portion and buffering is very limited at intermediate node, E2E achieves higher throughput than TCP splitting.     

有线无线融合的卫星时间敏感网络流调度研究

随着空间通信任务日趋复杂化,尤其是对时间敏感的需求不断提升,一方面要求星内系统的高带宽、可靠性和实时性;另一方面星间无线链路也应具备低时延和高可靠性.但由于卫星内部有线链路与星间无线链路差异大,业务数据经过有线和无线链路联合传输时,容易引发节点拥塞,而无法保障时敏业务的时延有界需求.为了提升数据在空间网络传输的实时性,...     

ARC: the analytical rate control scheme for real-time traffic in wireless networks

Next-generation wireless Internet (NGWI) is expected to provide a wide range of services including real-time multimedia to mobile users. However, the real-time multimedia traffic transport requires rate control deployment to protect shared Internet from unfairness and further congestion collapse. The transmission rate control method must also achieve high throughput and satisfy multimedia requirements such as delay or jitter bound. However, the existing solutions are mostly for the wired Internet, and hence, they do not address the challenges in the wireless environments which are characterized by high bit error rates. In this paper, a new analytical rate control (ARC) protocol for real-time multimedia traffic over wireless networks is presented. It is intended to achieve high throughput and multimedia support for real-time traffic flows while preserving fairness to the TCP sources sharing the same wired link resources. Based on the end-to-end path model, the desired behavior of a TCP source over lossy links is captured via renewal theory. The resulting asymptotic throughput equation is designated as the driving equation for the proposed rate control method. Performance evaluation via simulation experiments reveals that ARC achieves high throughput and meets multimedia traffic expectations without violating good citizenship rules for the shared Internet.     

RF transceiver and transmission line behavioral modeling in VHDL-AMS for wired RFNoC

Despite the exceptional progress of MPSoC architectures, on chip communication networks remain a lock for the evolution of their performances due to the power consumption and the delay in data carrying. In this context, the wired radio frequency (RF) network on chip (RFNoC) has emerged. In this paper, we developed a library of RF component models in VHDL-AMS for time domain simulation. This library includes mainly the transmission line (TL) and the RF transceiver components such as the low noise amplifier (LNA), the mixer and the local oscillator (LO). The models consider the conventional parameters describing their performances including the non-linearities, the noise and the bandwidth of the LNA and the mixer. Leakages between ports are also considered for the mixer. The LO model considers the traditional parameters, more importantly its phase noise. The originality of the TL model is the modeling of the skin effect on a wide frequency range for time domain simulations. All the models are validated. Global simulations are performed to demonstrate the interest to accurately model the components of the RFNoC. The developed library is used here for wired RFNoC, however it can be used for all other wired and wireless RF communication system.     

WLAN security processor

A novel wireless local area network (WLAN) security processor is described in this paper. It is designed to offload security encapsulation processing from the host microprocessor in an IEEE 802.11i compliant medium access control layer to a programmable hardware accelerator. The unique design, which comprises dedicated cryptographic instructions and hardware coprocessors, is capable of performing wired equivalent privacy, temporal key integrity protocol, counter mode with cipher block chaining message authentication code protocol, and wireless robust authentication protocol. Existing solutions to wireless security have been implemented on hardware devices and target specific WLAN protocols whereas the programmable security processor proposed in this paper provides support for all WLAN protocols and thus, can offer backwards compatibility as well as future upgrade ability as standards evolve. It provides this additional functionality while still achieving equivalent throughput rates to existing architectures.     

End-to-End Performance Improvement of the Wireless Channel for Video Transmission

Real time video transmission in wireless environment considers various parameters of wireless channel like information rate, error resiliency, security, end-to-end latency, quality of service etc. The available internet protocols are transmission control protocol and user datagram protocol (UDP). But most of the real-time applications uses UDP as their transport protocol. UDP is a fast protocol suitable for delay sensitive applications like video and audio transmission as it does not provide flow control or error recovery and does not require connection management. Due to the tremendous growth in wired and wireless real-time applications, some improvements should be made in the existing systems or protocols. Various techniques to improve end-to-end performance of system for real time video transmission over wireless channel are available in literature. Authors claim that the solution suggested in the paper provide more reliability in wireless video transmission. In the proposed solution, adaptive redundant packets are added in every block (or datagram) transmitted in order to achieve a desired recovery rate at the receiver. The suggested method dose not use any retransmission mechanism. The network simulator NS-2 is used to evaluate the method and the simulation results indicate that the proposed method can guarantee satisfied end-to-end performance by increased packet delivery ratio, reduced end-to-end delay and hence increased network throughput for video transmission in wireless network.     

Modeling TCP Veno Throughput over Wired/Wireless Networks

This letter develops a simple analytic approach to model the throughput for a bulk transfer of TCP Veno flow. Both simulation and live Internet experiment results demonstrate that such an equation is able to accurately predict TCP Veno throughput over LAN as well as WAN scenarios, with wired links and/or wireless links embedded.     

On Joint MAC and Network Coding in Wireless Ad Hoc Networks

This paper addresses network coding in wireless networks in conjunction with medium access control (MAC). It is known that coding over wired networks enables connections with rates that cannot be achieved by routing. However, the properties of wireless networks (e.g., omnidirectional transmissions, destructive interference, single transceiver per node, finite energy) modify the formulation of time-varying network coding in a way that reflects strong interactions with underlying MAC protocols and deviates from the classical approach used in wired network coding. To perform network coding over conflict-free transmission schedules, predetermined network realizations are separately activated by a time-division mechanism and the content of network flows is derived through network coding to optimize performance measures such as achievable throughput and energy costs. A systematic method is presented to construct linear wireless network codes and interactions with MAC schedules are discussed under wireless assumptions. Network coding is also extended to operate with arbitrary (random or scheduled access based) MAC protocols. Alternatively, conflict-free transmission schedules are jointly constructed with network codes by decomposing wireless networks into subtrees and employing graph coloring on simplified subtree graphs. Finally, network coding and plain routing are compared in terms of throughput, energy and delay performance under different MAC solutions.     

GI/Geom/1 queue based on communication model for mesh networks

In mesh networks architecture, it should be permitted to visit the mobile client points. Whereas in mesh networks environment, the main throughput flows usually communicate with the conventional wired network. The so‐called gateway nodes can link directly to traditional Ethernet, depending on these mesh nodes, and can obtain access to data sources that are related to the Ethernet. In wireless mesh networks (WMNs), the quantities of gateways are limited. The packet‐processing ability of settled wireless nodes is limited. Consequently, throughput loads of mesh nodes highly affect the network performance. In this paper, we propose a queuing system that relied on traffic model for WMNs. On the basis of the intelligent adaptivenes, the model considers the influences of interference. Using this intelligent model, service stations with boundless capacity are defined as between gateway and common nodes based on the largest hop count from the gateways, whereas the other nodes are modeled as service stations with certain capacity. Afterwards, we analyze the network throughput, mean packet loss ratio, and packet delay on each hop node with the adaptive model proposed. Simulations show that the intelligent and adaptive model presented is precise in modeling the features of traffic loads in WMNs. Copyright © 2013 John Wiley & Sons, Ltd.