Integrated link adaptation and power control to improve error and throughput performance in broadband wireless packet networks

In this paper, we prove that the problem of maximizing data throughput by adaptive modulation and power control while meeting packet error requirements is NP-complete. A heuristic algorithm for integrated link adaptation and power control is, thus, proposed to achieve specified error rates and to improve overall throughput for real-time applications in broadband wireless packet networks. The algorithm divides terminals into groups according to their signal path gains and periodically adapts transmissions based on the required error rates, actual error statistics, and average transmission power of each terminal group. Transmission power is adjusted by an enhanced Kalman-filter method to ensure successful reception. Extensive simulation results reveal that the algorithm consistently delivers the specified error performance and attempts to maximize network throughput for a wide range of parameter settings.     

Link adaptation and power control for streaming services in EGPRSwireless networks

Using the MPEG-4 advanced audio coder (AAC) music as an example of streaming applications, we investigate the improvement of error performance for the streaming service by link adaptation and power control techniques in an enhanced general packet radio services (EGPRS) cellular network. A low packet error rate and variability are essential in providing a short error-burst length so that error concealment techniques can be effectively applied to music packets. We study the effects of a combined link adaptation and power control scheme (referred to as the error-based scheme) for achieving a target error rate and reducing error variability. By simulation, we compare the error performance of the error-based scheme at both the EGPRS block and AAC frame level with another adaptation algorithm (referred to as the throughput-based scheme) with a goal of maximizing overall network throughput. It is found that when offered with a similar traffic load, the former scheme can provide noticeable improvement of music quality over the throughput-based scheme. To achieve a similar AAC frame error rate, our results also show that the error-based scheme can increase the link throughput over the throughput-based scheme by 66.7% in one of our examples. These results reveal that by aiming at required error targets and thus reducing error variability, the error-based scheme for link adaptation and power control are helpful in improving quality and capacity for streaming applications     

自适应Turbo-QAM编码调制及其在 平坦Nakagami衰落信道的吞吐量性能

本文提出了一种通用的自适应编码调制系统吞吐量性能分析方法.基于各固定编码调制方式的误码率(BER)性能,使每种编码调制方案对应于一个信道平均信噪比(SNR)范围,再应用拉格朗日函数法得到使自适应编码调制系统吞吐量性能最大的信噪比转换门限,可得到系统的平均吞吐量性能.数值分析结果表明,相对于自适应M进制正交幅度调制(MQAM),自适应Turbo编码MQAM系统吞吐量性能有显著提高,并且该性能受瞬时误码率要求的影响较小.Nakagami信道中,在相同平均信道信噪比条件下,随着m的增大,系统吞吐量性能提高缓慢.     

IEEE 802.11n: Joint modulation‐coding and guard interval adaptation scheme for throughput enhancement

IEEE 802.11n is a high‐speed wireless broadband local area networking standard. IEEE 802.11n‐based devices are using some kind of adaptive modulation‐coding (AMC) scheme to adjust its transmission rate according to the radio channel condition. In these devices, however, the concept of guard interval adaptation is not been considered. Normally, orthogonal frequency division multiplexing (OFDM) technology‐based systems are using the guard interval much greater than the length of the channel impulse response. However, many previous works have shown that the choice of the larger guard interval is inefficient in terms of achievable throughput. IEEE802.11n supports using two guard intervals (short = 400 ns or long = 800 ns). Indeed, the shorter guard interval evidently results in intersymbol interference (ISI) and intercarrier interference (ICI), but the gain offered by shortened guard interval may exceed the loss caused by interference. In this paper, we propose a novel but simple solution for the guard interval adaptation joint with an adaptive modulation‐coding scheme to optimize the throughput performance of a wireless local area network (WLAN) system. This paper aims to analyze the effect of joint adaptive modulation‐coding and the guard interval (JAMCGI) algorithm on the WLAN system under bit‐error‐rate (BER) constraints. Simulation results and their analysis show a significant increase in the throughput performance of the WLAN system with our proposed algorithm.     

Corruption‐aware adaptive increase and adaptive decrease algorithm for TCP error and congestion controls in wireless networks

The conventional TCP tends to suffer from performance degradation due to packet corruptions in the wireless lossy channels, since any corruption event is regarded as an indication of network congestion. This paper proposes a TCP error and congestion control scheme using corruption‐aware adaptive increase and adaptive decrease algorithm to improve TCP performance over wireless networks. In the proposed scheme, the available network bandwidth is estimated based on the amount of the received integral data as well as the received corrupted data. The slow start threshold is updated only when a lost but not corrupted segment is detected by sender, since the corrupted packets still arrive at the TCP receiver. In the proposed scheme, the duplicated ACKs are processed differently by sender depending on whether there are any lost but not corrupted segments at present. Simulation results show that the proposed scheme could significantly improve TCP throughput over the heterogeneous wired and wireless networks with a high bit error rate, compared with the existing TCP and its variants. Copyright © 2008 John Wiley & Sons, Ltd.     

The Impact of Channel Feedback on Opportunistic Relay Selection for Hybrid-ARQ in Wireless Networks

This paper presents a decentralized relay selection protocol for a dense wireless network and describes channel feedback strategies that improve its performance. The proposed selection protocol supports hybrid automatic repeat request transmission where relays forward parity information to the destination in the event of a decoding error. Channel feedback is employed for refining the relay selection process and to select an appropriate transmission mode in a proposed adaptive modulation transmission framework. An approximation of the throughput of the proposed adaptive modulation strategy is presented, and the dependence of the throughput on system parameters such as the relay contention probability and the adaptive modulation switching point is illustrated via maximization of this approximation. Simulations show that the throughput of the proposed selection strategy is comparable with that yielded by a centralized selection approach that relies on geographic information.      

The impact of multihop wireless channel on TCP performance

This paper studies TCP performance in a stationary multihop wireless network using IEEE 802.11 for channel access control. We first show that, given a specific network topology and flow patterns, there exists an optimal window size W* at which TCP achieves the highest throughput via maximum spatial reuse of the shared wireless channel. However, TCP grows its window size much larger than W* leading to throughput reduction. We then explain the TCP throughput decrease using our observations and analysis of the packet loss in an overloaded multihop wireless network. We find out that the network overload is typically first signified by packet drops due to wireless link-layer contention, rather than buffer overflow-induced losses observed in the wired Internet. As the offered load increases, the probability of packet drops due to link contention also increases, and eventually saturates. Unfortunately the link-layer drop probability is insufficient to keep the TCP window size around W'*. We model and analyze the link contention behavior, based on which we propose link RED that fine-tunes the link-layer packet dropping probability to stabilize the TCP window size around W*. We further devise adaptive pacing to better coordinate channel access along the packet forwarding path. Our simulations demonstrate 5 to 30 percent improvement of TCP throughput using the proposed two techniques.     

AEETC—adaptive energy-efficient timing control in wireless networks with network coding

Energy is a scarce resource in wireless networks. Network coding has been proposed recently as a means to reduce the number of transmissions and energy consumption. In this paper, we introduce timing control into network coding to further enhance its performance. It is found that when bandwidth is sufficient, the extra delay introduced by waiting for additional data to perform network coding will increase the number of codings without affecting system throughput. Both delay and throughput suffers when bandwidth is insufficient. An adaptive energy-efficient timing control algorithm called AEETC is proposed which can automatically adjust local node’s transmission behavior on the basis of the network traffic conditions. Simulation results demonstrate that AEETC increases network coding by 7% to 60% for light network load and is able to provide good performance in terms of delay, throughput and the number of successful codings.     

Adaptive Load-Aware Congestion Control Protocol for Wireless Sensor Networks

Congestion control in wireless sensor networks (WSNs) is crucial. In this article, we discuss congestion control and the adaptive load-aware problem for sensor nodes in WSNs. When the traffic load of a specific node exceeds its the available capacity of the node, a congestion problem occurs because of buffer memory overflow. Congestion may cause serious problems such as packet loss, the consumption of power, and low network throughput for sensor nodes. To address these problems, we propose a distributed congestion control protocol called adaptive load-aware congestion control protocol (ALACCP). The protocol can adaptively allocate the appropriate forwarding rate for jammed sensor nodes to mitigate the congestion load. Through the buffer management mechanism, the congestion index of neighboring sensor nodes, and an adjustment of the adaptive forwarding rate, the degree of congestion is alleviated markedly. The performance in allocating the forwarding rate effectively to neighboring sensor nodes also improves. The ALACCP can avoid packet loss because of traffic congestion, reduce the power consumption of nodes, and improve the network throughput. Simulation results revealed that the proposed ALACCP can effectively improve network performance and maintain the fairness of networks.     

无线/有线网络中基于自适应丢包区分的TCP改进

分析指出BQM方法无法适应网络状态的变化，提出了A_BQM（adaptive bias queue management）方法，其关键思想是根据网络事件动态调节模式匹配参数，使得算法在瓶颈拥塞和误码错误增加的情况下，依然能够保持有效性。实验表明A_BQM方法在不同的网络状态下都具有比较高的丢包区分准确率，可以自适应网络状态的变化。相对BQM方法，A_BQM方法在网络吞吐量、公平性、传输延迟抖动等方面都有明显提高。     

基于模糊逻辑的无线网络流量自适应控制

文章在分析现有提高无线TCP性能方案的基础上，提出一种新的流量控制方法，即基于显式窗口反馈的无线网络流量控制方案。在Snoop中引入有线网络的显示窗口自适应（EWA）算法，通过对BS共享缓存的实时监测，应用模糊控制算法预测当前拥塞窗口（cwnd）的大小，并显式反馈给发送端，使TCP的发送窗口能快速响应网络负荷状况的变化．避免分组的丢失。仿真结果表明．该方法增强了网络对拥塞的自适应性以及对无线信道差错的实时处理能力．提高了网络的吞吐量。     

Performance of the EY-NPMA Protocol

The throughput of the Elimination Yield Non-pre-emptive Priority Multiple Access (EY-NPMA) protocol, which has been chosen as the medium access control (MAC) protocol for HIPERLAN, is simulated. Connection between users is based on a statistical model of path loss with power law against distance and 6 dB log-normal shadowing. It is shown that the throughput performance of the EY-NPMA protocol in networks of moderate size and with small proportion of hidden nodes is satisfactory. For a fully connected network, the throughput reaches 0.85 at an offered traffic of 1 and remains at this level. The maximum throughput reduces gradually when the number of hidden node pairs in the network is increased. With 11% of hidden nodes in the network the peak throughput falls to 0.6.     

一种适合数据链的TOP拥塞控制策略

传统因特网传输控制协议（TCP）主要针对有线网络设计，无法应对数据链网络中突发干扰、高误码率、拓扑高动态变化引起的拥塞和吞吐率下降等问题。提出一种适合数据链网络的拥塞控制策略，利用主动探测结果来设定拥塞窗口大小，采用反馈机制进行动态拥塞控制，通过网关节点的缓存和转发来实现快速重传。仿真结果表明，与典型拥塞控制机制相比，提出的策略可明显改善数据链网络的传输性能。     

Performance enhancement of adaptive orthogonal modulation in wireless CDMA systems

Recent research in wireless code-division multiple-access systems has shown that adaptive rate/power control can considerably increase network throughput relative to systems that use only power or rate control. In this paper, we consider joint power/rate optimization in the context of orthogonal modulation (OM) and investigate the additional performance gains achieved through adaptation of the OM order. We show that such adaptation can significantly increase network throughput, while simultaneously reducing the per-bit energy consumption relative to fixed-order modulation systems. The optimization is carried out under two different objective functions: minimizing the maximum service time and maximizing the sum of user rates. For the first objective function, we prove that the optimization problem can be formulated as a generalized geometric program (GGP). We then show how this GGP can be transformed into a nonlinear convex program, which can be solved optimally and efficiently. For the second objective function, we obtain a lower bound on the performance gain of adaptive OM (AOM) over fixed-modulation systems. Numerical results indicate that relative to an optimal joint rate/power control fixed-order modulation scheme, the proposed AOM scheme achieves significant throughput and energy gains.     

Improving TCP performance over networks with wireless components using ‘probing devices’

TCP error control mechanism lacks the ability to detect with precision the nature of potential errors during communication. It is only capable of detecting the results of the errors, namely that segments are dropped. As a result, the protocol lacks the ability to implement an appropriate error recovery strategy cognizant of current network conditions and responsive to the distinctive error characteristics of the communication channel. TCP sender always calls for the sending window to shrink. We show that probing mechanisms could enhance the error detection capabilities of the protocol. TCP could then flexibly adjust its window in a manner that permits the available bandwidth to be exploited without violating the requirements of stability, efficiency and fairness that need to be guaranteed during congestion. Our experiments have three distinct goals: First, to demonstrate the potential contribution of probing mechanisms. A simple probing mechanism and an immediate recovery strategy are grafted into TCP‐Tahoe and TCP‐Reno. We show that, this way, standard TCP can improve its performance without requiring any further change. Second, to study the performance of adaptive strategies. An adaptive TCP with probing is used, that is responsive to the detected error conditions by alternating slow start, fast recovery and immediate recovery. An adaptive error recovery strategy can yield better performance. Third, to study the design limitations of the probing device itself. The aggressive or conservative nature of the probing mechanisms themselves can determine the aggressive or conservative behaviour of the protocol and exploit accordingly the energy/throughput trade‐off. Copyright © 2002 John Wiley & Sons, Ltd.     

Throughput Analysis of IEEE802.11 Multi-Hop Ad Hoc Networks

In multi-hop ad hoc networks, stations may pump more traffic into the networks than can be supported, resulting in high packet-loss rate, re-routing instability and unfairness problems. This paper shows that controlling the offered load at the sources can eliminate these problems. To verify the simulation results, we set up a real 6-node multi-hop network. The experimental measurements confirm the existence of the optimal offered load. In addition, we provide an analysis to estimate the optimal offered load that maximizes the throughput of a multi-hop traffic flow. We believe this is a first paper in the literature to provide a quantitative analysis (as opposed to simulation) for the impact of hidden nodes and signal capture on sustainable throughput. The analysis is based on the observation that a large-scale 802.11 network with hidden nodes is a network in which the carrier-sensing capability breaks down partially. Its performance is therefore somewhere between that of a carrier-sensing network and that of an Aloha network. Indeed, our analytical closed-form solution has the appearance of the throughput equation of the Aloha network. Our approach allows one to identify whether the performance of an 802.11 network is hidden-node limited or spatial-reuse limited     

Adaptive Spatial Filtering for an FH/SSMA Packet Radio Network with Packet Combining

In this paper, packet throughput is analyzed and simulated for a show FH/SSMA packet radio network with adaptive antenna array and packet combining in a Rayleigh fading channel with shadowing. The packet throughput is defined as the average number of captured packets per slot. To enhance the throughput performance, an adaptive spatial filtering through adaptive antenna array and a packet combining scheme are employed. As a random access protocol, slotted ALOHA is considered, and synchronous memoryless hopping patterns are assumed. A packet consists of codewords from an (n, k) RS (Reed-Solomon) code. The tap weights of an adaptive processor is updated by RLS (recursive-least-square) algorithm. From the simulation results, it is shown that a pre-processing by adaptive antenna array and a post-processing by packet combining are very effective to improve reception performance of an FH/SSMA network.     

Adaptive cross-layer protection strategies for robust scalable video transmission over 802.11 WLANs

Robust streaming of video over 802.11 wireless local area networks poses many challenges, including coping with bandwidth variations, data losses, and heterogeneity of the receivers. Currently, each network layer (including physical layer, media access control (MAC), transport, and application layers) provides a separate solution to these challenges by providing its own optimized adaptation and protection mechanisms. However, this layered strategy does not always result in an optimal overall performance for the transmission of video. Moreover, certain protection strategies can be implemented simultaneously in several layers and, hence, the optimal choices from the application and complexity perspective need to be identified. In this paper, we evaluate different error control and adaptation mechanisms available in the different layers for robust transmission of video, namely MAC retransmission strategy, application-layer forward error correction, bandwidth-adaptive compression using scalable coding, and adaptive packetization strategies. Subsequently, we propose a novel adaptive cross-layer protection strategy for enhancing the robustness and efficiency of scalable video transmission by performing tradeoffs between throughput, reliability, and delay depending on the channel conditions and application requirements. The results obtained using the proposed adaptive cross-layer protection strategies show a significantly improved visual performance for the transmitted video over a variety of channel conditions.     

An efficient ATM network switch scheduling

The problem of allocating network resources to application sessions backlogged at an individual switch has a great impact on the end-to-end delay and throughput guarantees offered by the network. There exists a class of algorithms based on weighted fair queueing (WFQ) for scheduling packets which are work-conserving and they guarantee fairness to the backlogged sessions. These algorithms also apply to ATM networks with a packet equal to a single cell or an ATM block (of fixed size). Bursts are groups of varying numbers of cells. We generalize WFQ to schedule bursts. Our motivation is to derive an adaptive algorithm which generalizes the (fixed size) packet level to a varying size packet level. The new algorithm enhances the performance of the switch service for many important applications. The proposed scheme maintains the work-conserving property, and also provides throughput and fairness guarantees. The worst-case delay bound is also given. We use simulation to study the performance characteristics of our algorithm. Our results demonstrate the efficiency of the new algorithm.     

Surveillance strategies for a class of adaptive-routing algorithmsin circuit-switched DNHR communications networks: a simulationstudy

A large, circuit-switched, communications network engineered for historical traffic patterns using dynamic nonhierarchical routing (DNHR) is considered. During overloads, the offered traffic many not follow the historical patterns. In such situations, it is possible to increase network throughput by augmenting the routing tables in near-realtime to utilize instantaneous spare capacity. The surveillance strategy determines how often network data is collected and how frequently additional paths are added to the routing tables. Six surveillance strategies for adaptive routing are examined: (1) 2.5-min surveillance interval; (2) 5-min surveillance interval; (3) 10-min surveillance interval; (4) 15-min surveillance interval; (5) modify the routing every other 5 min; and (6) modify the routing every 5 min with a fixed 10-min lag before the routing tables are changed. Simulation is used to compare the network performance to the baseline performance without adaptive routing for each of the strategies. It is found that the more adaptive strategies, (1), (2), and (6), perform better during periods with variable traffic, and that the less adaptive strategies perform better during periods with stable traffic. During heavy overloads, almost as important as the surveillance strategy is the number of problems, overflowing node pairs, and the algorithm attempts to relieve