Queue length aware power control for delay‐ constrained communication over fading channels

In this paper, we study efficient power control schemes for delay sensitive communication over fading channels. Our objective is to find a power control law that optimizes the link layer performance, specifically, minimizes the packet drop probability, subject to a long‐term average power constraint. We assume the buffer at the transmitter is finite; hence packet drop happens when the buffer is full. The fading channel under our study has a continuous state, e.g., Rayleigh fading. Since the channel state space is continuous, dynamic programming is not applicable for power control. In this paper, we propose a sub‐optimal power control law based on a parametric approach. The proposed power control scheme tries to minimize the packet drop probability by considering the queue length, i.e., reducing the probability of those queue‐length states that will cause full buffer. Simulation results show that our proposed power control scheme reduces the packet drop probability by one or two orders of magnitude, compared to the time domain water filling (TDWF) and the truncated channel inversion (TCI) power control. Copyright © 2010 John Wiley & Sons, Ltd.     

Power control and channel allocation for real‐time applications in cellular networks

The next‐generation packet‐based wireless cellular network will provide real‐time services for delay‐sensitive applications. To make the next‐generation cellular network successful, it is critical that the network utilizes the resource efficiently while satisfying quality of service (QoS) requirements of real‐time users. In this paper, we consider the problem of power control and dynamic channel allocation for the downlink of a multi‐channel, multi‐user wireless cellular network. We assume that the transmitter (the base‐station) has the perfect knowledge of the channel gain. At each transmission slot, a scheduler allots the transmission power and channel access for all the users based on the instantaneous channel gains and QoS requirements of users. We propose three schemes for power control and dynamic channel allocation, which utilize multi‐user diversity and frequency diversity. Our results show that compared to the benchmark scheme, which does not utilize multi‐user diversity and power control, our proposed schemes substantially reduce the resource usage while explicitly guaranteeing the users' QoS requirements. Copyright © 2007 John Wiley & Sons, Ltd.     

Power control for delay constrained multi‐channel communications using outdated CSI

In this paper, we study the power allocation scheme for a single user, multi‐channel system, e.g., orthogonal frequency‐division multiplexing (OFDM) systems, under time‐variant wireless fading channels. We assume the receiver feeds back perfectly estimated channel state information (CSI) to the transmitter after a processing delay. The objective of the power allocation is to maximize throughput subject to quality‐of‐service (QoS) constraint. The QoS measure of our consideration is a triplet of data rate, delay, and delay bound violation probability. A two‐step sub‐optimal power allocation scheme is proposed to address the impact of outdated CSI. In the first step, the total transmission power that can be used within one block is determined according to the summation of the channel gains of all the channels. In the second step, the total transmission power is allocated among all the channels. The proposed power control scheme is less sensitive to the feedback delay. Compared to the optimal power allocation scheme designed for the perfect CSI scenario, it has lower computational complexity while achieving comparable capacity. Copyright © 2010 John Wiley & Sons, Ltd.     

Downlink media streaming with wireless fountain coding in wireline‐cum‐WiFi networks

This paper addresses the problem of streaming packetized media data in a combined wireline/802.11 network. Since the wireless channel is normally the bottleneck for media streaming in such a network, we propose that wireless fountain coding (WFC) be used over the wireless downlink in order to efficiently utilize the wireless bandwidth and exploit the broadcast nature of the channel. Forward error correction (FEC) is also used to combat errors at the application‐layer. We analytically obtain the moment generating function (MGF) for the wireless link‐layer delay incurred by WFC. With the MGF, the expected value of this wireless link‐layer delay is found and used by the access point (AP), who has no knowledge of the buffer contents of wireless receivers, to make a coding‐based decision. We then derive the end‐to‐end packet loss/late probability based on the MGF. We develop an integrated ns‐3/EvalVid simulator to evaluate our proposed system and compare it with the traditional 802.11e scheme which is without WFC capability but equipped with application‐ and link‐layer retransmission mechanisms. Through extensive simulations of video streaming, we show that streaming with WFC is able to support more concurrent video flows compared to the traditional scheme. When the deadlines imposed on video packets are relatively stringent, streaming with WFC also shows superior performance in terms of packet loss/late probability, video distortion, and video frame delay, over the traditional scheme. Copyright © 2011 John Wiley & Sons, Ltd.     

Utility‐optimal cross‐layer resource allocation in distributed wireless cooperative networks

In this paper, we propose a distributed cross‐layer resource allocation algorithm for wireless cooperative networks based on a network utility maximization framework. The algorithm provides solutions to relay selections, flow pass probabilities, transmit rate, and power levels jointly with optimal congestion control and power control through balancing link and physical layers such that the network‐wide utility is optimized. Via dual decomposition and subgradient method, we solve the utility‐optimal resource allocation problem by subproblems in different layers of the protocol stack. Furthermore, by introducing a concept of pseudochannel gain, we model both the primal direct logical link and its corresponding cooperative transmission link as a single virtual direct logical link to simplify our network utility framework. Eventually, the algorithm determines its primal resource allocation levels by employing reverse‐engineering of the pseudochannel gain model. Numerical experiments show that the convergence of the proposed algorithm can be obtained and the performance of the optimized network can be improved significantly. Copyright © 2012 John Wiley & Sons, Ltd.     

A novel low‐complexity transmission power adaptation in MC‐CDMA systems with a‐MRC receiver over Nakagami‐m fading channels

In this paper, we propose a novel low‐complexity transmission power adaptation with good bit error rate (BER) performance for multicarrier code‐division multiple‐access (MC‐CDMA) systems over Nakagami‐m fading channels. We first propose a new receiver called ath‐order‐maximal‐ratio‐combining (a‐MRC) receiver with which the receiver power gain for the nth subcarrier is the ath (a?1) power of the corresponding channel gain. Incorporating the a‐MRC receiver, we then propose a new transmission power adaptation scheme where the transmission power is allocated over all the N subcarriers according to the subchannel gains and the transmitter adapts its power to maintain a constant signal‐to‐interference‐plus‐noise (SINR) at the receiver. The proposed scheme has a significant performance gain over the nonadaptive transmission scheme over both independent and correlated fading channels. Moreover, the proposed scheme keeps good BER performance while it is much simpler than the previous power control/adaptation schemes. Copyright © 2008 John Wiley & Sons, Ltd.     

Performance analysis of prioritized parallel transmission MAC protocol in all‐IP wireless WAN

Prioritized parallel transmission MAC (PPTM) protocol is proposed for all‐IP wireless wide area network (WAN). In this paper, we analyse its performance and compare it with modified channel load sensing protocol (MCLSP). We model PPTM as a non‐preemptive priority queueing system and obtain a close form of transmission time delay for each priority class, throughput of the scheme, and number of packets in the queue in the Poisson arrival case. We find that PPTM achieves less transmission time delay than MCLSP does for high priority data. Hence, the overall performance of the system using PPTM is significantly improved. We verify the conclusions with simulation via a simplified all‐IP wireless WAN. Copyright © 2006 John Wiley & Sons, Ltd.     

QoS‐aware routing and power control algorithm for multimedia service over multi‐hop mobile ad hoc network

This paper presents a QoS (quality of service) aware routing and power control algorithm consuming low transmission power for multimedia service over mobile ad hoc network. Generally, multimedia services need stringent QoS over the network. However, it is not easy to guarantee the QoS over mobile ad hoc network since its network resources are very limited and time‐varying. Furthermore, only a limited amount of power is available at mobile nodes, which makes the problem more challenging. We propose an effective routing and power control algorithm for multimedia services that satisfies end‐to‐end delay constraint with low transmission power consumption. The proposed algorithm supports the required bandwidth by controlling each link channel quality over route in a tolerable range. In addition, a simple but effective route maintenance mechanism is implemented to avoid link failures that may significantly degrade streaming video quality. Finally, performance comparison with existing algorithms is presented in respect to traditional routing performance metrics, and an achievable video quality comparison is provided to demonstrate the superiority of the proposed algorithm for multimedia services over mobile ad hoc network. Copyright © 2010 John Wiley & Sons, Ltd.     

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.     

Sub‐Nyquist rate ADC sampling‐based compressive channel estimation

To realize high‐speed communication, broadband transmission has become an indispensable technique in the next‐generation wireless communication systems. Broadband channel is often characterized by the sparse multipath channel model, and significant taps are widely separated in time, and thereby, a large delay spread exists. Accurate channel state information is required for coherent detection. Traditionally, accurate channel estimation can be achieved by sampling the received signal with large delay spread by analog‐to‐digital converter (ADC) at Nyquist rate and then estimate all of channel taps. However, as the transmission bandwidth increases, the demands of the Nyquist sampling rate already exceed the capabilities of current ADC. In addition, the high‐speed ADC is very expensive for ordinary wireless communication. In this paper, we present a novel receiver, which utilizes a sub‐Nyquist ADC that samples at much lower rate than the Nyquist one. On the basis of the sampling scheme, we propose a compressive channel estimation method using Dantzig selector algorithm. By comparing with the traditional least square channel estimation, our proposed method not only achieves robust channel estimation but also reduces the cost because low‐speed ADC is much cheaper than high‐speed one. Computer simulations confirm the effectiveness of our proposed method. Copyright © 2013 John Wiley & Sons, Ltd.     

Hybrid channel gain prioritized access‐aware cell association with interference mitigation in LTE‐Advanced HetNets

LTE‐Advanced heterogeneous networks deployment is meant to address the increasing demand for quality of service, high data rates and coverage extension. Load balancing is among the primary challenges, especially when the user equipments (UEs) associate with diverse transmission power network tiers using received signal strength. The low‐power network tier's spectrum will be underutilized, and UEs associated with them will be inflicted by interference from the high‐power network tier. The proposed hybrid channel gain prioritized access (HCGPA)‐aware cell association scheme stresses the importance of combined metrics with interference mitigation to simultaneously achieve load balancing and enhance performance among the network tiers. The high‐priority UEs associate with the tier that gives the maximum channel gain being higher than a given threshold. While the low‐priority UEs association is based on the maximum joint metrics (channel gain, channel access probabilities of low‐priority UEs and high‐priority UEs). The HCGPA scheme has 1.72 times the number of UEs connected to low‐power networks, 8% better load balancing fairness, compared with the conventional reference signal receive power and RSRP + 6 dB bias cell associations. Although the susceptibility of HCGPA to interference led to the poor signal to interference to noise ratio (SINR) performance of the cell‐edge UEs, the cell‐centre UEs exhibited the best spectral efficiency performance. Copyright © 2016 John Wiley & Sons, Ltd.     

Throughput and resource optimization for adaptive coding‐based random access networks with correlated sources

Modern wireless communication networks frequently have lower application throughput due to higher number of collisions and subsequent retransmission of data packets. Moreover, these networks are characterized by restricted computational capacity due to limited node‐battery power. These challenges can be assessed for deploying fast, reliable network design with resource‐restrained operation by means of concurrent optimization of multiple performance parameters across different layers of the conventional protocol stack. This optimization can be efficiently accomplished via cross‐layer design with the aid of network coding technique and optimal allocation of limited resources to wireless links. In this paper, we evaluate and analyze intersession coding across several source–destination pairs in random access ad hoc networks with inherent power scarcity and variable capacity links. The proposed work addresses the problem of joint optimal coding, rate control, power control, contention, and flow control schemes for multi‐hop heterogeneous networks with correlated sources. For this, we employ cross‐layer design for multiple unicast sessions in the system with network coding and bandwidth constraints. This model is elucidated for global optimal solution using CVX software through disciplined convex programming technique to find the improved throughput and power allocation. Simulation results show that the proposed model effectively incorporates throughput and link power management while satisfying flow conservation, bit error rate, data compression, power outage, and capacity constraints of the challenged wireless networks. Finally, we compare our model with three previous algorithms to demonstrate its efficacy and superiority in terms of various performance metrics such as transmission success probability, throughput, power efficiency, and delay.     

Delay analysis of selective-repeat ARQ with applications to link adaptation in wireless packet data systems

Radio link control (RLC) protocols are typically employed for reliable in-sequence delivery of service data units (SDUs) in wireless packet data systems. The RLC layer segments packets obtained from the upper layer (referred to as SDUs) into smaller RLC transmission units (or blocks) and uses selective-repeat automatic repeat request (SR-ARQ) for error recovery of RLC blocks. In earlier work, SR-ARQ performance is typically characterized in terms of the long-term throughput or in-sequence delivery delay of RLC blocks. The SDU delivery delay which is a more meaningful measure of RLC performance (in terms of the service provided to a higher layer, e.g., transmission control protocol) has not been quantified. In this paper, we analyze the SDU delivery delay of SR-ARQ as a function of the SDU size and the channel coding scheme employed. Closed-form delay expressions as well as approximations are provided. The analysis is verified through enhanced general packet radio service RLC simulations. Based on the analysis, we propose that link adaptation be backlog dependent in order to reduce the SDU delivery delay at the RLC layer.     

Performance modeling and optimization of multiple‐objective cross‐layer design in multi‐flow ad‐hoc networks

In ad‐hoc wireless networks, to achieve good performance, multiple parameters need to be optimized jointly. However, existing literature lacks a design framework that investigates the synchronic impact of several parameters on overall system performance. Among several design parameters, energy conservation, end‐to‐end delay minimization, and improved throughput are considered most important for efficient operation of these networks. In this paper, we propose a novel scheme for multiple‐objective cross‐layer optimization capable of optimizing all these performance objectives simultaneously for reliable, energy‐efficient, and timely transmission of continuous media information across the network. The three global criteria considered for optimization are incorporated in a single programming problem via linear scalarization. Besides, we employ standard convex optimization method and Lagrangian technique to solve the proposed problem to seek optimality. Extensive simulation results are generated accounting for several topologies with multiple concurrent flows in the network. These results are used to validate the analytical results and demonstrate the efficiency of the proposed optimization model. Efficiency of the model is verified by finding the set of Pareto‐optimal solutions plotted in three‐dimensional objective space. These solution points constituting the Pareto front are used as the best possible balance points among maximum throughput, maximum residual energy, and least network delay. Finally, to emphasize the effectiveness and supremacy of our proposed multiple‐objective cross‐layer design scheme, we compare it with the conventional multiple‐objective genetic algorithm. Simulation results demonstrate that our method provides significant performance gain over the genetic algorithm approach in terms of the above specified three objectives.     

A novel self‐adaptive transmission scheme over an IEEE 802.11 WLAN for supporting multi‐service

The IEEE 802.11 wireless local area network (WLAN) media access control (MAC) specification is a hybrid protocol of random access and polling when both distributed coordination function (DCF) and point coordination function (PCF) are used. Data traffic is transmitted with the DCF, while voice transmission is carried out with the PCF. Based on the performance analysis of the MAC protocol for integrated data and voice transmission by simulation, this paper puts forward a self‐adaptive transmission scheme to support multi‐service over the IEEE 802.11 WLAN. The simulation results show that, on the premise of satisfying the maximum allowable delay of packet voice, the self‐adaptive transmission scheme can improve the data traffic performance and increase the WLAN capacity through dynamic and appropriate adjustment of the protocol parameters. Especially, voice traffic is sensitive to delay jitter, and the self‐adaptive scheme can effectively decrease it. Finally, it is worth noting that the adaptive scheme is easy to be realized, whereas no change in the MAC protocol is needed. Copyright © 2006 John Wiley & Sons, Ltd.     

Real‐time performance evaluation of asynchronous time division traffic‐aware and delay‐tolerant scheme in ad hoc sensor networks

Wireless infrastructureless networks demand high resource availability with respect to the progressively decreasing energy consumption. A variety of new applications with different service requirements demand fairness to the service provision and classification, and reliability in an end‐to‐end manner. High‐priority packets are delivered within a hard time delay bound whereas improper power management in wireless networks can substantially degrade the throughput and increase the overall energy consumed. In this work a new scheme is being proposed and evaluated in real time using a state‐based layered oriented architecture for energy conservation (EC). The proposed scheme uses the node's self‐tuning scheme, where each node is assigned with a dissimilar sleep and wake time, based on traffic that is destined for each node. This approach is based on stream's characteristics with respect to different caching behavioral and storage‐capacity characteristics, and considers a model concerning the layered connectivity characteristics for enabling the EC mechanism. EC characteristics are modeled and through the designed tiered architecture the estimated metrics of the scheme can be bounded and tuned into certain regulated values. The real‐time evaluation results were extracted by using dynamically moving and statically located sensor nodes. A performance comparison is done with respect to different data traffic priority classifications following a real‐time asymmetrical transmission channel. Results have shown the scheme's efficiency in conserving energy while the topology configuration changes with time. Copyright © 2009 John Wiley & Sons, Ltd.     

DynaChannAl: dynamic channel allocation with minimal end‐to‐end delay for two‐tier wireless sensor networks

With recent advances in wireless networking and in low‐power sensor technology, wireless sensor networks (WSNs) have taken significant roles in various applications. Whereas some WSNs only require minimal bandwidth, newer applications operate with a noticeably larger amount of data. One way to deal with these applications is to maximize the available capacity by utilizing multiple wireless channels. We propose DynaChannAl, a distributed dynamic wireless channel allocation algorithm that effectively distributes nodes to multiple wireless channels in WSNs. Specifically, DynaChannAl targets applications where mobile nodes connect to preexisting wireless backbones and takes the expected end‐to‐end queuing delay as its core metric. We used the link quality indicator values provided by 802.15.4 radios to whitelist high‐quality links and evaluate these links with the aggregated queuing latency, making it useful for applications that require minimal end‐to‐end delay (i.e., health care). DynaChannAl is a lightweight and adoptable scheme that can be incorporated easily with predeveloped systems. As the first study to consider end‐to‐end latency as the core metric for channel allocation in WSNs, we evaluate DynaChannAl on a 45 node test bed and show that DynaChannAl successfully distributes source nodes to different channels and enables them to select channels and links that minimizes the end‐to‐end latency. Copyright © 2012 John Wiley & Sons, Ltd.     

VLC-WiFi异构网络QoS感知的跨层动态资源分配

VLC-Wi Fi异构网络已经成为广受欢迎的短距离无线通信方式之一。然而,有限的频谱资源导致VLC-Wi Fi异构网络容量难以满足井喷式增长的用户数据带宽需求。该文结合物理层的动态链路传输性能以及媒体访问控制层的队列缓冲延迟性能,定义链路传输性能和链路服务质量(QoS)感知等级评估公式,根据用户数据包QoS需求,设计QoS感知的跨层动态资源分配(QoS-CLDRA)方法,并引入非正交多址接入的用户匹配与功率分配策略,进一步提升系统的吞吐量。仿真结果表明：所提方法能够有效提升系统吞吐量和降低缓冲队列长度。     

A cross‐layer information centric‐relay transmission strategy for MIMO–OFDMA multicellular networks

Power control has been a standard issue in modern wireless communications. As a result, several cooperative schemes have been developed towards reducing the downlink transmission power. One possible approach is the use of relays that forward information from the base station (BS) to the mobile stations (MSs). However, up to now, the proposed relaying schemes are focusing solely on channel characteristics. In this work, a novel, content‐aware relaying scheme is introduced, where the MSs can act as active relays based on their requested content and channel quality. Content awareness is achieved with a cross‐layer algorithm, which considers an information‐centric networking layer. The performance of the proposed approach has been evaluated considering a multiple input multiple output (MIMO) cellular configuration with one tier of cells around the central cell, where the downlink transmission power (in terms of mean values) has been compared to the typical non‐content‐aware case. For this reason, a hybrid system—link level simulator has been developed that executes independent Monte Carlo (MC) simulations in parallel. Moreover, the orthogonal frequency division multiple access (OFDMA) physical layer protocol has been employed as well, in order to comply with fourth generation standards. The derived results indicate that, compared to the non‐content‐aware case, the proposed relay transmission algorithm can provide up to 7/17% transmission power gain in medium or highly loaded networks (i.e., 10% and 40% blocking probabilities, respectively) in a symmetric 2 × 2 MIMO configuration (i.e., equal number of transmit and receive antennas). Moreover, compared to the case where no relay transmission is supported, then the aforementioned gain can reach up to 20%. Finally, the proposed algorithm can provide up to 25% reduction on the overall transmission delay from the relay node to the destination compared to the non‐content‐aware case. Copyright © 2014 John Wiley & Sons, Ltd.     

Cross‐layer bandwidth and power allocation for a two‐hop link in wireless mesh network

In this paper, a cross‐layer analytical framework is proposed to analyze the throughput and packet delay of a two‐hop wireless link in wireless mesh network (WMN). It considers the adaptive modulation and coding (AMC) process in physical layer and the traffic queuing process in upper layers, taking into account the traffic distribution changes at the output node of each link due to the AMC process therein. Firstly, we model the wireless fading channel and the corresponding AMC process as a finite state Markov chain (FSMC) serving system. Then, a method is proposed to calculate the steady‐state output traffic of each node. Based on this, we derive a modified queuing FSMC model for the relay to gateway link, which consists of a relayed non‐Poisson traffic and an originated Poisson traffic, thus to evaluate the throughput at the mesh gateway. This analytical framework is verified by numerical simulations, and is easy to extend to multi‐hop links. Furthermore, based on the above proposed cross‐layer framework, we consider the problem of optimal power and bandwidth allocation for QoS‐guaranteed services in a two‐hop wireless link, where the total power and bandwidth resources are both sum‐constrained. Secondly, the practical optimal power allocation algorithm and optimal bandwidth allocation algorithm are presented separately. Then, the problem of joint power and bandwidth allocation is analyzed and an iterative algorithm is proposed to solve the problem in a simple way. Finally, numerical simulations are given to evaluate their performances. Copyright © 2008 John Wiley & Sons, Ltd.