Removing redundant TCP functionalities in wired‐cum‐wireless networks with IEEE 802.11e HCCA support

The TCP was originally designed for wired networks, assuming transmission errors were negligible. Actually, any acknowledgment time‐out unconditionally triggers the congestion control mechanism, even in wireless networks in which this assumption is not valid. Consequently, in wireless networks, TCP performance significantly degrades. To avoid this degradation, this paper proposes the so‐called split TCP and UDP. In this approach, the access point splits the TCP connection and uses a customized and lighter transport protocol for the wireless segment. It takes advantage of the IEEE 802.11e Hybrid Coordination Function Controlled Channel Access (HCCA) mechanisms to remove redundant TCP functionalities. Specifically, the HCCA scheduler allows disabling of the congestion control in the wireless link. Similarly, the IEEE 802.11e error control service makes possible to eliminate TCP acknowledgments, therefore reducing the TCP protocol overhead. Finally, the usage of an HCCA scheduler permits providing fairness among the different data flows. The proposed split scheme is evaluated via extensive simulations. Results show that split TCP and User Datagram Protocol outperforms the analyzed TCP flavors—specifically designed for wireless environments—and the split TCP solution, achieving up to 95% of end‐user throughput gain. Furthermore, the proposed solution is TCP friendly because TCP flows are not degraded by the presence of flows by using this approach. Copyright © 2013 John Wiley & Sons, Ltd.     

Cross-layer TCP with bitmap error recovery scheme in wireless ad hoc networks

Current TCP is not able to distinguish corruption losses from packet loss events. Hence, high transmission errors and varying inherent latency within a wireless network would cause seriously adverse effects to TCP performance. To improve TCP in IEEE 802.11 multi-hop ad hoc wireless networks, this study proposes an error recovery mechanism based on coordination of TCP and IEEE 802.11 MAC protocols. The simulation results confirm that the proposed error recovery approach could provide a more efficient solution for frequent transmission losses, and enable TCP to distinguish between congestion errors and transmission errors, and thus, to respond with proper remedial actions.     

A cross-layer congestion and contention window control scheme for TCP performance improvement in wireless LANs

Neither the current TCP protocol nor the standard backoff algorithm of IEEE 802.11 protocol is able to distinguish corruption loss from congestion or collision loss. Hence, high transmission errors and a varying latency inherent in wireless channel would have a seriously adverse effect on the performance of TCP. In this paper, we propose a novel and pragmatic cross-layer approach with joint congestion and contention window control scheme to improve the performance of TCP in IEEE 802.11 wireless environments. In addition to theoretical analysis, simulations are conducted to evaluate the proposed scheme. As it turns out, our design indeed provides a more efficient solution for frequent transmission loss and enables TCP to distinguish between congestion loses and transmission errors, thus to take proper remedial actions.     

基于无线连接的TCP/IP性能研究

TCP/IP是Internet的主要技术,也希望能在无线连接中很好地应用,通过一种模拟系统研究了基于IEEE802.11无线介质访问控制协议的TCP/IP的性能.     

Saturation throughput analysis of multi‐rate IEEE 802.11 wireless networks

IEEE 802.11 protocol supports adaptive rate mechanism, which selects the transmission rate according to the condition of the wireless channel, to enhance the system performance. Thus, research of multi‐rate IEEE 802.11 medium access control (MAC) performance has become one of the hot research topics. In this paper, we study the performance of multi‐rate IEEE 802.11 MAC over a Gaussian channel. An accurate analytical model is presented to compute the system saturation throughput. We validate our model in both single‐rate and multi‐rate networks through various simulations. The results show that our model is accurate and channel error has a significant impact on system performance. In addition, our numerical results show that the performance of single‐rate IEEE 802.11 DCF with basic access method is better than that with RTS/CTS mechanism in a high‐rate and high‐load network and vice versa. In a multi‐rate network, the performance of IEEE 802.11 DCF with RTS/CTS mechanism is better than that with basic access method in a congested and error‐prone wireless environment. Copyright © 2008 John Wiley & Sons, Ltd.     

Analytical modeling of bidirectional multi‐channel IEEE 802.11 MAC protocols

This paper presents an analytical approach to model the bi‐directional multi‐channel IEEE 802.11 MAC protocols (Bi‐MCMAC) for ad hoc networks. Extensive simulation work has been done for the performance evaluation of IEEE 802.11 MAC protocols. Since simulation has several limitations, this work is primarily based on the analytical approach. The objective of this paper is to show analytically the performance advantages of Bi‐MCMAC protocol over the classical IEEE 802.11 MAC protocol. The distributed coordination function (DCF) mode of medium access control (MAC) is considered in the modeling. Two different channel scheduling strategies, namely, random channel selection and fastest channel first selection strategy are also presented in the presence of multiple channels with different transmission rates. M/G/1 queue is used to model the protocols, and stochastic reward nets (SRNs) are employed as a modeling technique as it readily captures the synchronization between events in the DCF mode of access. The average system throughput, mean delay, and server utilization of each MAC protocol are evaluated using the SRN formalism. We also validate our analytical model by comparison with simulation results. The results obtained through the analytical modeling approach illustrate the performance advantages of Bi‐MCMAC protocols with the fastest channel first scheduling strategy over the classical IEEE 802.11 protocol for TCP traffic in wireless ad hoc networks. Copyright © 2010 John Wiley & Sons, Ltd.     

Performance evaluation of TCP algorithms in multi‐hop wireless packet networks

Wireless packet ad hoc networks are characterized by multi‐hop wireless connectivity and limited bandwidth competed among neighboring nodes. In this paper, we investigate and evaluate the performance of several prevalent TCP algorithms in this kind of network over the wireless LAN standard IEEE 802.11 MAC layer. After extensively comparing the existing TCP versions (including Tahoe, Reno, New Reno, Sack and Vegas) in simulations, we show that, in most cases, the Vegas version works best. We reveal the reason why other TCP versions perform worse than Vegas and show a method to avoid this by tuning a TCP parameter— maximum window size. Furthermore, we investigate the performance of these TCP algorithms when they run with the delayed acknowledgment (DA) option defined in IETF RFC 1122, which allows the TCP receiver to transmit an ACK for every two incoming packets. We show that the TCP connection can gain 15 to 32 per cent good‐put improvement by using the DA option. For all the TCP versions investigated in this work, the simulation results show that with the maximum window size set at approximately 4, TCP connections perform best and then all these TCP variants differ little in performance. Copyright © 2001 John Wiley & Sons, Ltd.     

Performance analysis of the IEEE 802.11e wireless networks with TCP ACK prioritization

With the advent of multimedia over wireless local area networks, the IEEE 802.11e standard was proposed to incorporate Quality of Service (QoS). It has been found that the throughput of Transmission Control Protocol (TCP) is less than that of User Datagram Protocol (UDP) in the IEEE 802.11e. This is because the TCP acknowledgment packets are queued up at the access points. In this paper, two types of TCP acknowledgment prioritizing schemes are proposed. The proposed schemes improve the overall throughput of TCP while maintaining the QoS requirements. We also analyze the problem of starvation of lower priority traffic and its effects on the performance of lower priority TCP traffic. The proposed dynamic scheme of TCP acknowledgment prioritization aims at improving the throughput of the lower priority TCP traffic under heavy network load while maintaining the QoS requirements of the higher priority traffic. The schemes have been verified through extensive simulation.     

Improving protocol capacity for UDP/TCP traffic with model-based frame scheduling in IEEE 802.11-operated WLANs

In this paper, we develop a model-based frame scheduling scheme, called MFS, to enhance the capacity of IEEE 802.11-operated wireless local area networks (WLANs) for both transmission control protocol (TCP) and user datagram protocol (UDP) traffic. In MFS each node estimates the current network status by keeping track of the number of collisions it encounters between its two consecutive successful frame transmissions, and computes accordingly the current network utilization. The result is then used to determine a scheduling delay to be introduced before a node attempts to transmit its pending frame. MFS does not require any change in IEEE 802.11, but instead lays a thin layer between the LL and medium access control (MAC) layers. In order to accurately calculate the current utilization in WLANs, we develop an analytical model that characterizes data transmission activities in IEEE 802.11-operated WLANs with/without the request to send/clear to send (RTS/CTS) mechanism, and validate the model with ns-2 simulation. All the control overhead incurred in the physical and MAC layers, as well as system parameters specified in IEEE 802.11, are figured in. We conduct a comprehensive simulation study to evaluate MFS in perspective of the number of collisions, achievable throughput, intertransmission delay, and fairness in the cases of TCP and UDP traffic. The simulation results indicate that the performance improvement with respect to the protocol capacity in a WLAN of up to 300 nodes is 1) as high as 20% with the RTS/CTS and 70% without the RTS/CTS in the case of UDP traffic and 2) as high as 10% with the RTS/CTS and 40% without the RTS/CTS in the case of TCP traffic. Moreover, the intertransmission delay in MFS is smaller and exhibits less variation than that in IEEE 802.11; the fairness among wireless nodes in MFS is better than, or equal to, that in IEEE 802.11.     

Cross-Layer Interaction of TCP and Ad Hoc Routing Protocols in Multihop IEEE 802.11 Networks

In this research, we first investigate the cross-layer interaction between TCP and routing protocols in the IEEE 802.11 ad hoc network. On-demand ad hoc routing protocols respond to network events such as channel noise, mobility, and congestion in the same manner, which, in association with TCP, deteriorates the quality of an existing end-to-end connection. The poor end-to-end connectivity deteriorates TCP's performance in turn. Based on the well-known TCP-friendly equation, we conduct a quantitative study on the TCP operation range using static routing and long-lived TCP flows and show that the additive-increase, multiplicative-decrease (AIMD) behavior of the TCP window mechanism is aggressive for a typical multihop IEEE 802.11 network with a low-bandwidth-delay product. Then, to address these problems, we propose two complementary mechanisms, that is, the TCP fractional window increment (FeW) scheme and the Route-failure notification using BUIk-losS Trigger (ROBUST) policy. The TCP FeW scheme is a preventive solution used to reduce the congestion-driven wireless link loss. The ROBUST policy is a corrective solution that enables on-demand routing protocols to suppress overreactions induced by the aggressive TCP behavior. It is shown by computer simulation that these two mechanisms result in a significant improvement of TCP throughput without modifying the basic TCP window or the wireless MAC mechanisms.     

Modelling of wireless TCP for short‐lived flows

The transmission control protocol (TCP) is one of the most important Internet protocols. It provides reliable transport services between two end‐hosts. Since TCP performance affects overall network performance, many studies have been done to model TCP performance in the steady state. However, recent researches have shown that most TCP flows are short‐lived. Therefore, it is more meaningful to model TCP performance in relation to the initial stage of short‐lived flows. In addition, the next‐generation Internet will be an unified all‐IP network that includes both wireless and wired networks integrated together. In short, modelling short‐lived TCP flows in wireless networks constitutes an important axis of research. In this paper, we propose simple wireless TCP models for short‐lived flows that extend the existing analytical model proposed in [IEEE Commun. Lett. 2002; 6 (2):85–88]. In terms of wireless TCP, we categorized wireless TCP schemes into three types: end‐to‐end scheme, split connection scheme, and local retransmission scheme, which is similar to the classification proposed in [IEEE/ACM Trans. Networking 1997; 756–769]. To validate the proposed models, we performed ns‐2 simulations. The average differences between the session completion time calculated using the proposed model and the simulation result for three schemes are less than 9, 16, and 7 ms, respectively. Consequently, the proposed model provides a satisfactory means of modelling the TCP performance of short‐lived wireless TCP flows. Copyright © 2005 John Wiley & Sons, Ltd.     

Game theory models for IEEE 802.11 DCF in wireless ad hoc networks

Because wireless nodes decide their channel accesses independently in the IEEE 802.11-based ad hoc networks, and the channel access of a node has an influence on those of its neighboring nodes, game theory naturally becomes a useful and powerful tool to research this kind of network. In this article a game model is proposed to interpret the IEEE 802.11 distributed coordination function mechanism. In addition, by designing a simple Nash equilibrium backoff strategy, we present a fairness game model. Our simulation results show that the new backoff strategy can improve TCP performance almost perfectly.     

Personal Area Networks: Bluetooth or IEEE 802.11?

Interconnecting all our electronic devices we carry around, such as cellular phones, PDAs, and laptops, with wireless links requires a cheap, low-power radio technology that still delivers good performance. In this context, the Bluetooth wireless technology was developed to meet the requirements introduced by these personal area networks (PANs). However, today we see a widespread deployment of wireless local area network (WLAN) radios (primarily IEEE 802.11b) also in small devices, such as PDAs. This paper will compare the PAN capabilities of a Bluetooth-based system with an IEEE 802.11b-based system. In order to focus the comparison on link and networking functionality, the IEEE 802.11b radio is assumed to be operating at the same power level as the Bluetooth radio (i.e., assuming a 0 dBm radio). Results are obtained by means of simulations in which throughput and delay are measured for multihop and overlaid PANs. Estimations on power usage are also given in the simulations. The results indicate that as the number of PANs increases, the Bluetooth-based PANs basically maintain the same bandwidth per PAN, while the corresponding IEEE 802.11-based PANs suffer significantly from the increased co-channel interference. However, for cases with a few co-channel-interfering PANs (2-3 PANs hosting about 10-15 nodes), the IEEE 802.11b-based PANs offer a higher bandwidth per user than the corresponding Bluetooth PANs, which corresponds to the difference in link bandwidth between the two systems. At high interference levels, the Bluetooth PAN offers a higher capacity than the IEEE 802.11 PAN. The latter also shows unfairness among TCP connections in the PAN at high loads. The energy efficiency, defined as successfully transmitted bits per energy unit, decreases sharply for IEEE 802.11 with increased number of PANs, while Bluetooth maintains a constant level. Packet delays are also shown to be more stable for the Bluetooth PAN than for the IEEE 802.11 PAN as the number of PANs increases.     

Vertical optimization of data transmission for mobile wireless terminals

A major problem for TCP connections over wireless links is that errors introduced by the wireless channel interfere with the TCP protocol, leading to reduced data rates and power wastage. Based on accurate simulations for the TCP and IEEE 802.11 MAC protocols, we discuss recipes to optimize transmission. It is argued that the best approach is to restrict modifications to the mobile device. While this requires separate solutions for the uplink and downlink, the results of optimization are then available when roaming into any WLAN obeying the relevant MAC protocol. Simulation results show that the combination of specific strategies with a vertical interaction between the protocol layers can lead to the required improvements, giving a promising approach to enhance the performance of wireless mobile terminals.     

Cross-Layer Enhancement to Support TCP-Based Traffics in WLANs

Widespread deployment of wireless local area networks and a gradual increase in streaming applications have brought about a demand for improved quality of service (QoS) in wireless networks. However, increasing user datagram protocol based high priority multimedia traffic and the class differentiation introduced in QoS protocols, has resulted into transmission control protocol (TCP) starvation and increased spurious timeouts. While today’s Internet traffic is still dominated by TCP based applications, the negative effects of IEEE 802.11e enhanced distributed coordination function (EDCF) scheme on TCP performance in the presence of high priority traffic have not been extensively explored. In this paper, the performance of TCP in 802.11e WLAN competing with high priority traffic is examined. The prioritised adaptive enhanced scheme (PAD_EDCF) is proposed. The proposed scheme gives priority to TCP control packets in order to improve the low traffic transmission flow and acquires additional capability of adjusting the MAC parameters based on the traffic load condition. Simulation results demonstrate that the proposed scheme significantly improves TCP performances in terms of traffic efficiency, throughput and reduces delay.     

A survey of QoS enhancements for IEEE 802.11 wireless LAN

Quality‐of‐service (QoS) is a key problem of today's IP networks. Many frameworks (IntServ, DiffServ, MPLS etc.) have been proposed to provide service differentiation in the Internet. At the same time, the Internet is becoming more and more heterogeneous due to the recent explosion of wireless networks. In wireless environments, bandwidth is scarce and channel conditions are time‐varying and sometimes highly lossy. Many previous research works show that what works well in a wired network cannot be directly applied in the wireless environment. Although IEEE 802.11 wireless LAN (WLAN) is the most widely used IEEE 802.11 wireless LAN (WLAN) standard today, it cannot provide QoS support for the increasing number of multimedia applications. Thus, a large number of 802.11 QoS enhancement schemes have been proposed, each one focusing on a particular mode. This paper summarizes all these schemes and presents a survey of current research activities. First, we analyze the QoS limitations of IEEE 802.11 wireless MAC layers. Then, different QoS enhancement techniques proposed for 802.11 WLAN are described and classified along with their advantages/drawbacks. Finally, the upcoming IEEE 802.11e QoS enhancement standard is introduced and studied in detail. Copyright © 2004 John Wiley & Sons, Ltd.     

A fragment‐based retransmission scheme with quality‐of‐service considerations for wireless networks

In order to satisfy quality‐of‐service requirements for real‐time multimedia applications over wireless networks, IEEE 802.11e has been proposed to enhance wireless‐access functionalities. In IEEE 802.11e, collisions occur frequently as the system load becomes heavy, and then, the latency for successfully transmitting data is lengthened seriously because of contention, handshaking, and backoff overheads for collision avoidance. In this paper, we propose a fragment‐based retransmission (FBR) scheme with quality‐of‐service considerations for IEEE 802.11e‐based wireless local area networks. Our FBR can be used in all proposed fragmentation‐based schemes and greatly decrease redundant transmission overheads. By utilizing FBR, the retransmission delay will be significantly improved to conform strict time requirements for real‐time multimedia applications. We develop an analytical model and a simulation model to investigate the performance of FBR. The capability of the proposed scheme is evaluated by a series of simulations, for which we have encouraging results. Copyright © 2011 John Wiley & Sons, Ltd.     

Achieving performance enhancement in IEEE 802.11 WLANs by using the DIDD backoff mechanism

Wireless local area networks (WLANs) based on the IEEE 802.11 standards have been widely implemented mainly because of their easy deployment and low cost. The IEEE 802.11 collision avoidance procedures utilize the binary exponential backoff (BEB) scheme that reduces the collision probability by doubling the contention window after a packet collision. In this paper, we propose an easy‐to‐implement and effective contention window‐resetting scheme, called double increment double decrement (DIDD), in order to enhance the performance of IEEE 802.11 WLANs. DIDD is simple, fully compatible with IEEE 802.11 and does not require any estimation of the number of contending wireless stations. We develop an alternative mathematical analysis for the proposed DIDD scheme that is based on elementary conditional probability arguments rather than bi‐dimensional Markov chains that have been extensively utilized in the literature. We carry out a detailed performance study and we identify the improvement of DIDD comparing to the legacy BEB for both basic access and request‐to‐send/clear‐to‐send (RTS/CTS) medium access mechanisms. Copyright © 2006 John Wiley & Sons, Ltd.     

Analysis of Cross-Layer Interaction in Multirate 802.11 WLANs

Recent works in empirical 802.11 wireless LAN performance evaluation have shown that cross-layer interactions in WLANs can be subtle, sometimes leading to unexpected results. Two such instances are: (i) significant throughput degradation resulting from automatic rate fallback (ARF) having difficulty distinguishing collision from channel noise, and (ii) scalable TCP over DCF performance that is able to mitigate the negative performance effect of ARF by curbing multiple access contention even when the number of stations is large. In this paper, we present a framework for analyzing complex cross-layer interactions in 802.11 WLANs, with the aim of providing effective tools for understanding and improving WLAN performance. We focus on cross-layer interactions between ARF, DCF, and TCP, where ARF adjusts coding at the physical layer, DCF mediates link layer multiple access control, and TCP performs end-to-end transport. We advance station-centric Markov chain models of ARF, ARF-DCF with and without RTS/CTS, and TCP over DCF that may be viewed as multi-protocol extensions of Bianchi's IEEE 802.11 model. We show that despite significant increase in complexity the analysis framework leads to tractable and accurate performance predictions. Our results complement empirical and simulation-based findings, demonstrating the versatility and efficacy of station-centric Markov chain analysis for capturing cross-layer WLAN dynamics.     

Advanced IEEE 802.11ax TCP aware scheduling under unreliable channels

In this paper, we suggest advanced IEEE 802.11ax (WiFi) TCP‐aware scheduling strategies for optimizing the TCP Goodput AP operation under transmission of unidirectional TCP traffic to downloading stations. Our scheduling strategies optimize the TCP Goodput performance using the capability for Multi User transmissions over the Uplink, first introduced in IEEE 802.11ax, together with Multi User transmissions over the Downlink. The scheduling strategies are based on Transmission Opportunities (TXOP), and we suggest three scheduling strategies determining the TXOP formation parameters. In one of the strategies, one can control the achieved TCP Goodput vs the delay. We also assume saturated TCP transmission queues. We show that with minimal TCP Goodput degradation, one can avoid considerable delays: It turns out that for TCP Data segments of 1460 bytes, achieving optimal TCP Goodput requires TXOPs of 25 ms, while if one loses only 5% of the optimal Goodput, TXOPs can be of only 3 ms. For TCP Data segments of 256 bytes, the TXOPs are of 13 and 5 ms, respectively.