Adaptive backoff scheme for ad hoc networks based on IEEE 802.11

The performance of backoff scheme plays an important role in designing efficient Medium Access Protocols for ad hoc networks. In this paper, we propose an adaptive backoff scheme and evaluate the performance of the proposed scheme for ad hoc networks. The backoff mechanism devised by us grants a node access to the channel based on its probability of collision for a transmitted frame in comparison to the nodes in the two‐hop contention area. We use both an analytical model and simulation experiments to evaluate the performance of our adaptive backoff mechanism in an ad hoc network. The results show that our protocol exhibits a significant improvement in power saving, end‐to‐end goodput, packet delivery ratio, and hop‐put, compared with the existing IEEE 802.11 DCF. Copyright © 2010 John Wiley & Sons, Ltd.     

Does the IEEE 802.11 MAC protocol work well in multihop wireless adhoc networks?

The IEEE 802.11 MAC protocol is the standard for wireless LANs; it is widely used in testbeds and simulations for wireless multihop ad hoc networks. However, this protocol was not designed for multihop networks. Although it can support some ad hoc network architecture, it is not intended to support the wireless mobile ad hoc network, in which multihop connectivity is one of the most prominent features. In this article we focus on the following question: can the IEEE 802.11 MAC protocol function well in multihop networks? By presenting several serious problems encountered in an IEEE 802.11-based multihop network and revealing the in-depth cause of these problems, we conclude that the current version of this wireless LAN protocol does not function well in multihop ad hoc networks. We thus doubt whether the WaveLAN-based system is workable as a mobile ad hoc testbed     

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.     

Improving Transport Layer Performance in Multihop Ad Hoc Networks by Exploiting MAC Layer Information

The traditional TCP congestion control mechanism encounters a number of new problems and suffers a poor performance when the IEEE 802.11 MAC protocol is used in multihop ad hoc networks. Many of the problems result from medium contention at the MAC layer. In this paper, we first illustrate that severe medium contention and congestion are intimately coupled, and TCP's congestion control algorithm becomes too coarse in its granularity, causing throughput instability and excessively long delay. Further, we illustrate TCP's severe unfairness problem due to the medium contention and the tradeoff between aggregate throughput and fairness. Then, based on the novel use of channel busyness ratio, a more accurate metric to characterize the network utilization and congestion status, we propose a new wireless congestion control protocol (WCCP) to efficiently and fairly support the transport service in multihop ad hoc networks. In this protocol, each forwarding node along a traffic flow exercises the inter-node and intra-node fair resource allocation and determines the MAC layer feedback accordingly. The end-to-end feedback, which is ultimately determined by the bottleneck node along the flow, is carried back to the source to control its sending rate. Extensive simulations show that WCCP significantly outperforms traditional TCP in terms of channel utilization, delay, and fairness, and eliminates the starvation problem     

Mobility impact in IEEE 802.11p infrastructureless vehicular networks

Vehicular ad hoc networks (VANETs) are an extreme case of mobile ad hoc networks (MANETs). High speed and frequent network topology changes are the main characteristics of vehicular networks. These characteristics lead to special issues and challenges in the network design, especially at the medium access control (MAC) layer. In this paper, we provide a comprehensive evaluation of mobility impact on the IEEE 802.11p MAC performance. The study evaluates basic performance metrics such as packet delivery ratio, throughput, and delay. An unfairness problem due to the relative speed is identified for both broadcast and unicast scenarios. We propose two dynamic contention window mechanisms to alleviate network performance degradation due to high mobility. The first scheme provides dynamic level of service priority via adaptation to the number of neighboring nodes, while the second scheme provides service priority based on node relative speed. Extensive simulation results demonstrate a significant impact of mobility on the IEEE 802.11p MAC performance, the unfairness problem in the vehicle-to-vehicle (V2V) communications, and the effectiveness of the proposed MAC schemes.     

Distributed Flow Control and Medium Access in Multihop Ad Hoc Networks

Recent studies have shown that the performance of wireless multihop ad hoc networks is very poor. In this paper, we first demonstrate that one important reason of the poor performance is the close coupling between medium contention and network congestion. Therefore, we present a framework of distributed flow control and medium access control to address both medium contention and network congestion. The proposed scheme utilizes the MAC layer control frames to efficiently conduct the network layer's flow control function and only allows the upstream nodes to forward enough packets to make it possible for the downstream nodes to fully utilize the shared channel but never introduce severe MAC collisions and network congestion. Extensive simulations illustrate that the proposed scheme well controls congestion and greatly alleviates medium collisions. It achieves up to 12 times the end-to-end throughput of IEEE 802.11, maintains a short delay and a low control overhead, and improves the fairness regardless of the hop count and the traffic load     

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.     

Performance evaluation of multihop ad hoc WLANs

Ongoing technological advances in portable devices, coupled with the need for continuous connectivity while mobile, have made ad hoc networks a compelling research and development topic, particularly in a challenging multimedia multihop scenario. The ability of IEEE 802.11's ad hoc mode of operation, as a dominating wireless local area network (WLAN) protocol, to serve multihop networks requires thorough investigation. In this article, through considering crucial real-life physical phenomena and avoiding as many confining assumptions as possible, system performance measures such as delay and packet failure rate are evaluated. As a result, the importance of adequate selection of the system parameters toward performance improvement is underscored. Moreover, the simulation results imply that by complementing through priority provisions, coordination, route reservation, clustering, and optimum channel coding considerations, the IEEE 802.11 medium access control (MAC) protocol can survive in a multihop scenario. The custom simulation environment developed features modularity, comprising traffic generator, mobility, wireless channel, and IEEE 802.11 protocol modules, and is capable of accommodating many more of the physical phenomena involved.     

Local data control and admission control for QoS support in wireless ad hoc networks

Wireless ad hoc networks consist of nodes having a self-centrically broadcasting nature of communication. To provide quality of service (QoS) for ad hoc networks, many issues are involved, including routing, medium-access control (MAC), resource reservation, mobility management, etc. Carefully designed distributed medium-access techniques must be used for channel resources, so that mechanisms are needed to efficiently recover from inevitable frame collisions. For ad hoc wireless networks with a contention-based distributed MAC layer, QoS support and guarantee become extremely challenging. In this paper, we address this challenging issue. We first consider MAC and resource-reservation aspects for QoS support in one-hop ad hoc wireless networks. We propose two local data-control schemes and an admission-control scheme for ad hoc networks with the IEEE 802.11e MAC standard. In the proposed fully distributed local data control schemes, each node maps the measured traffic-load condition into backoff parameters locally and dynamically. In the proposed distributed admission-control scheme, based on measurements, each node makes decisions on the acceptances/rejections of flows by themselves, without the presence of access points. The proposed mechanisms are evaluated via extensive simulations. Studies show that, with the proposed schemes, QoS can be guaranteed under a clear channel condition while maintaining a good utilization. Discussions on applying the proposed schemes into multihop ad hoc networks are also included.     

基于Ad hoc网络的新EDCA参数调整方案

IEEE802.11e标准中业务优先级不同的AC（access category）是通过设置不同的竞争窗口最大、最小值CWmax,CWmin和仲裁帧间隔值来体现的,如高优先级AC设置小的CWmin,CWmax和AIFS值.研究表明,EDCA对每个AC指定的默认参数值只适用于中等负载、节点数目少的网络场景,并不适用于负载较重、节点数目较多且链路动态变化的Ad hoc网络环境.提出了一种根据网络状况动态调整IEEE 802.11e EDCA的QoS参数的新方案I-ED-CA,该方案根据网络状态调整竞争窗口CW,并通过修改退避计数器值调整AIFS参数,使I-EDCA适合动态变化的Ad hoc网络环境,采用NS2仿真软件对EDCA改进协议I-EDCA进行仿真.仿真结果表明,随着网络中负载的增加,I-EDCA的吞吐量表现平稳,而EDCA吞吐量是下降的.另外,在业务公平性方面,对优先级不同的业务I-EDCA比EDCA的表现更公平.     

IEEE 802.11在无线自组网中的应用研究

深入分析了IEEE 802.11 DCF机制应用于无线自组网存在的固有缺陷及潜在原因,并阐明了数据流竞争、物理层机制对MAC协议性能的影响。IEEE 802.11 DCF是针对全连通adhoc网络结构设计的,分析表明,要在实际的多跳无线自组网中应用还存在很多问题需要解决。在此基础上提出了将IEEE 802.11有效应用于多跳无线自组网的进一步研究方向。     

A Clock Synchronization Algorithm for Multihop Wireless Ad Hoc Networks

In multihop wireless ad hoc networks, it is important that all mobile hosts are synchronized. Synchronization is necessary for power management and for frequency hopping spread spectrum (FHSS) operations. IEEE 802.11 standards specify a clock synchronization protocol but this protocol suffers from the scalability problem due to its inefficiency contention mechanism. In this paper, we propose an automatic self-time-correcting procedure (ASP) to achieve clock synchronization in a multihop environment. Our ASP has two features. First, a faster host has higher priority to send its timing information out than a slower one. Second, after collecting enough timing information, a slower host can synchronize to the faster one by self-correcting its timer periodically (which makes it becoming a faster host). Simulation results show that our ASP decreases 60% the average maximum clock drift as compared to the IEEE 802.11 and reduces 99% the number of asynchronism in a large-scale multihop wireless ad hoc networks.     

Medium access control with coordinated adaptive sleeping for wireless sensor networks

This paper proposes S-MAC, a medium access control (MAC) protocol designed for wireless sensor networks. Wireless sensor networks use battery-operated computing and sensing devices. A network of these devices will collaborate for a common application such as environmental monitoring. We expect sensor networks to be deployed in an ad hoc fashion, with nodes remaining largely inactive for long time, but becoming suddenly active when something is detected. These characteristics of sensor networks and applications motivate a MAC that is different from traditional wireless MACs such as IEEE 802.11 in several ways: energy conservation and self-configuration are primary goals, while per-node fairness and latency are less important. S-MAC uses a few novel techniques to reduce energy consumption and support self-configuration. It enables low-duty-cycle operation in a multihop network. Nodes form virtual clusters based on common sleep schedules to reduce control overhead and enable traffic-adaptive wake-up. S-MAC uses in-channel signaling to avoid overhearing unnecessary traffic. Finally, S-MAC applies message passing to reduce contention latency for applications that require in-network data processing. The paper presents measurement results of S-MAC performance on a sample sensor node, the UC Berkeley Mote, and reveals fundamental tradeoffs on energy, latency and throughput. Results show that S-MAC obtains significant energy savings compared with an 802.11-like MAC without sleeping.     

A fuzzy logic cooperative MAC for MANET

In both wireless local area networks（WLAN） and mobile ad hoc networks（MANET）, the 1EEE 802.11e medium access control （MAC） protocol is proposed for an effective quality of service （QoS） solution. A number of studies have been done to enhance the performance of 802.11e in MANET by independently adjusting contention window （CW） size of each access category （AC） in every node. However, without the cooperation between the high priority flows and lower priority flows, the QoS goal of high priority flows cannot achieve effectively. In this article, a fuzzy logic based cooperative MAC protocol （FLCMAC） is proposed to cooperate amongst network flows and dynamically adjust access probability of each low priority flow affecting the high priority flows to satisfy their QoS requirement. The simulation results indicate that compared to the enhanced distributed channel access （EDCA） scheme of 802.11e, the FLCMAC consistently excels, in terms of throughput and delay under moderate and heavy background traffic both in single-hop and multi-hop scenarios.     

Improving throughput through dynamically tuning contention window size in dense wireless network

With the boom of wireless devices, the number of wireless users under wireless local area networks (WLANs) has increased dramatically. However, the standard backoff mechanism in IEEE 802.11 adopts fixed initial contention window (CW) size without considering changes of network load, which leads to a high collision probability and low channel utilization in bursty arrivals. In this paper, a novel CW dynamic adjustment scheme is proposed to achieve high throughput performance in dense user environment. In the proposed scheme, the initial CW size is dynamically adjusted to optimum according to the measured packet collision probability. Simulation results show that the proposed scheme can significantly improve the throughput performance.     

A New MAC Scheme Supporting Voice/Data Traffic in Wireless Ad Hoc Networks

In wireless ad hoc networks, in addition to the well-known hidden terminal and exposed terminal problems, the location-dependent contention may cause serious unfairness and priority reversal problems. These problems can severely degrade network performance. To the best of our knowledge, so far there is no comprehensive study to fully address all these problems. In this paper, a new busy-tone based medium access control (MAC) scheme supporting voice/data traffic is proposed to address these problems. Via two separated narrow-band busy-tone channels with different carrier sense ranges, the proposed scheme completely resolves the hidden terminal and exposed terminal problems. Furthermore, with the use of transmitter busy-tones in the node backoff procedure, the proposed scheme ensures guaranteed priority access for delay-sensitive voice traffic over data traffic. The priority is also independent of the user locations, thus solving the priority reversal problem. The fairness performance for data traffic in a non-fully-connected environment is also greatly improved (as compared with the popular IEEE 802.11e MAC scheme) without the need for extra information exchanges among the nodes.     

A backoff algorithm based on self-adaptive contention window update factor for IEEE 802.11 DCF

The binary exponential backoff (BEB) mechanism is applied to the packet retransmission in lots of wireless network protocols including IEEE 802.11 and 802.15.4. In distributed dynamic network environments, the fixed contention window (CW) updating factor of BEB mechanism can’t adapt to the variety of network size properly, resulting in serious collisions. To solve this problem, this paper proposes a backoff algorithm based on self-adaptive contention window update factor for IEEE 802.11 DCF. In WLANs, this proposed backoff algorithm can greatly enhance the throughput by setting the optimal CW updating factor according to the theoretical analysis. When the number of active nodes varies, an intelligent scheme can adaptively adjust the CW updating factor to achieve the maximal throughput during run time. As a result, it effectively reduces the number of collisions, improves the channel utilization and retains the advantages of the binary exponential back-off algorithm, such as simplicity and zero cost. In IEEE 802.11 distributed coordination function (DCF) protocol, the numerical analysis of physical layer parameters show that the new backoff algorithm performance is much better than BEB, MIMD and MMS algorithm.     

IEEE 802.11移动自组织网络节点竞争窗口长度的概率分布

 在基于IEEE 802.11的移动自组织网络中,MAC(Medium Access Control)层提供了DCF(Distributed Coordinate Function)以控制节点对无线信道的争用.DCF包括了BEB (Binary Exponential Backoff)算法.该文对BEB的重要参数——竞争窗口CW(Contention Window)进行研究,通过随机建模,导出了竞争窗口长度的概率分布,并进行数值分析.研究结果可应用于IEEE 802.11移动自组织网络.     

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.     

Design and performance of an enhanced IEEE 802.11 MAC protocol for multihop coverage extension

Ad hoc communication is gaining popularity, not only for pure ad hoc communication networks but also as a viable solution for coverage extension in wireless networks. Especially for upcoming WLAN hotspots, this is an interesting option to decrease installation costs. In this article we introduce a new MAC protocol that needs only marginal changes to the standard and enables efficient multihop networking. We advocate the use of multiple IEEE 802.11 channels, where one channel is reserved as a common signalling channel for the task of assigning the others (data channels) among wireless terminals. The proposed MAC protocols are based on a four-way handshake over the common signalling channel, while data transmission occurs on a dedicated channel. We propose a further optimization applying multiple wireless network interface cards. This improvement in performance comes at the price of a slightly more complex hardware. Two different simulation models are implemented to investigate our approach. The first model investigates the MAC protocol and its improvements, while the second model analyzes the multihop performance in terms of delivery ratio and transmission delay. BY means of numerous simulations we present the performance of our MAC approach in comparison with two standard approaches in terms of bandwidth, packet delivery, and transmission delay. For our performance evaluation we apply the IEEE 802.11a technology, but we note that our approach can also be used for IEEE 802.11b.