Detecting selfish configurations in 802.11 WLANs

Lately, there has been an increase in the number of IEEE 802.11 devices that provide users with the ability to modify the MAC parameters or do not conform to the standard specification. This increases the risk of having a WLAN with selfish stations that, through the CSMA/CA parameters, obtain a larger share of the resources at the expense of well-behaved users. In this letter we propose a mechanism to detect these selfish stations that, unlike previous approaches, is not based on heuristics nor makes any assumption about radio conditions.     

The IEEE 802.11 Distributed Coordination Function in Small-Scale Ad-Hoc Wireless LANs

The IEEE 802.11 standards for wireless local area networks define how the stations of an ad-hoc wireless network coordinate in order to share the medium efficiently. This work investigates the performance of such a network by considering the two different access mechanisms proposed in these standards. The IEEE 802.11 access mechanisms are based on the carrier sense multiple access with collision avoidance (CSMA/CA) protocol using a binary slotted exponential backoff mechanism. The basic CSMA/CA mechanism uses an acknowledgment message at the end of each transmitted packet, whereas the request to send/clear to send (RTS/CTS) CSMA/CA mechanism also uses a RTS/CTS message exchange before transmitting a packet. In this work, we analyze these two access mechanisms in terms of throughput and delay. Extensive numerical results are presented to highlight the characteristics of each access mechanism and to define the dependence of each mechanism on the backoff procedure parameters.     

EBA: an enhancement of the IEEE 802.11 DCF via distributed reservation

The IEEE 802.11 standard for wireless local area networks (WLANs) employs a medium access control (MAC), called distributed coordination function (DCF), which is based on carrier sense multiple access with collision avoidance (CSMA/CA). The collision avoidance mechanism utilizes the random backoff prior to each frame transmission attempt. The random nature of the backoff reduces the collision probability, but cannot completely eliminate collisions. It is known that the throughput performance of the 802.11 WLAN is significantly compromised as the number of stations increases. In this paper, we propose a novel distributed reservation-based MAC protocol, called early backoff announcement (EBA), which is backward compatible with the legacy DCF. Under EBA, a station announces its future backoff information in terms of the number of backoff slots via the MAC header of its frame being transmitted. All the stations receiving the information avoid collisions by excluding the same backoff duration when selecting their future backoff value. Through extensive simulations, EBA is found to achieve a significant increase in the throughput performance as well as a higher degree of fairness compared to the 802.11 DCF.     

Robust Detection of Selfish Misbehavior in Wireless Networks

The CSMA/CA protocols are designed under the assumption that all participant nodes would abide to the protocol rules. This is of particular importance in distributed protocols such as the IEEE 802.11 distributed coordinating function (DCF), in which nodes control their own backoff parameters. In this work, we propose a method to detect selfish misbehaving terminals that may deliberately modify its backoff window to gain unfair access to the network resources. We develop nonparametric batch and sequential detectors based on the Kolmogorov-Smirnov (K-S) statistics that do not require any modification on the existing CSMA/CA protocols, and we apply it to detect misbehaviors in an IEEE 802.11 DCF network using the ns-2 simulator. We compare the performance of the proposed detectors with the optimum detectors with perfect information about the misbehavior strategy, for both the batch case (based on the Neyman-Pearson test), and the sequential case (based on Wald's sequential probability ratio test). We show that the proposed nonparametric detectors have a performance comparable to the optimum detectors for the majority of misbehaviors (the more severe) without any knowledge of the misbehavior strategies.     

Dynamic tuning of the IEEE 802.11 protocol to achieve a theoreticalthroughput limit

In wireless LANs (WLANs), the medium access control (MAC) protocol is the main element that determines the efficiency in sharing the limited communication bandwidth of the wireless channel. In this paper we focus on the efficiency of the IEEE 802.11 standard for WLANs. Specifically, we analytically derive the average size of the contention window that maximizes the throughput, hereafter theoretical throughput limit, and we show that: 1) depending on the network configuration, the standard can operate very far from the theoretical throughput limit; and 2) an appropriate tuning of the backoff algorithm can drive the IEEE 802.11 protocol close to the theoretical throughput limit. Hence we propose a distributed algorithm that enables each station to tune its backoff algorithm at run-time. The performances of the IEEE 802.11 protocol, enhanced with our algorithm, are extensively investigated by simulation. Specifically, we investigate the sensitiveness of our algorithm to some network configuration parameters (number of active stations, presence of hidden terminals). Our results indicate that the capacity of the enhanced protocol is very close to the theoretical upper bound in all the configurations analyzed     

Selfish MAC layer misbehavior in wireless networks

Wireless medium access control (MAC) protocols such as IEEE 802.11 use distributed contention resolution mechanisms for sharing the wireless channel. In this environment, selfish hosts that fail to adhere to the MAC protocol may obtain an unfair throughput share. For example, IEEE 802.11 requires hosts competing for access to the channel to wait for a "backoff" interval, randomly selected from a specified range/before initiating a transmission. Selfish hosts may wait for smaller backoff intervals than well-behaved hosts, thereby obtaining an unfair advantage. We present modifications to the IEEE 802.11 protocol to simplify detection of such selfish hosts and analyze the optimality of the chosen strategy. We also present a penalty scheme for punishing selfish misbehavior. We develop two misbehavior models to capture the behavior of misbehaving hosts. Simulation results under these misbehavior models indicate that our detection and penalty schemes are successful in handling MAC layer misbehavior.     

A Beacon-Based Collision-Free Channel Access Scheme for IEEE 802.11 WLANs

In IEEE 802.11 based WLAN standard, distributed coordination function is the fundamental medium access control (MAC) technique. It employs a CSMA/CA with random binary exponential backoff algorithm and provides contention-based distributed channel access for stations to share the wireless medium. However, performance of this mechanism drops dramatically due to random structure of the backoff process, high collision probability and frame errors. That is why development of an efficient MAC protocol, providing both high throughput for data traffic and quality of service (QoS) support for real-time applications, has become a major focus in WLAN research. In this paper, we propose an adaptive beacon-based collision-free MAC adaptation. The proposed scheme makes use of beacon frames sent periodically by access point, lets stations enter the collision-free state and reduces the number of idle slots regardless of the number of stations and their traffic load (saturated or unsaturated) on the medium. Simulation results indicate that the proposed scheme dramatically enhances the overall throughput and supports QoS by reducing the delay, delay variation and dropping probability of frames.     

IEEE802.11无线局域网中一种支持业务区分的回退算法

支持QoS的MAC机制是WLAN支持QoS的关键所在.我们已经给出了一种低分组碰撞概率的MAC层回退机制——RWBO+BEB.该文进一步讨论如何让RWBO+BEB支持业务区分的问题.首先提出了一个Markov链模型,分析如何根据无线终端的带宽比率设置最小竞争窗口,然后给出了一种新的支持业务区分的回退算法——DS-RWBO,仿真结果表明,DS-RWBO能根据局域网中每个终端的带宽比率分配无线信道的带宽资源.     

Using Incompletely Cooperative Game Theory in Wireless Mesh Networks

Recently, game theory has become a useful and powerful tool in research on wireless mesh networks. In this article the authors present a novel concept of incompletely cooperative game theory and use it to improve the performance of MAC protocols in WMNs. In this game, first, each node estimates the current game state (e.g., the number of competing nodes). Second, the node adjusts its equilibrium strategy by tuning its local contention parameters (e.g., the minimum contention window) to the estimated game state. Finally, the game is repeated several times to get the optimal performance. To use the game effectively in WMNs, the authors present a hybrid CSMA/CA protocol by integrating a proposed virtual CSMA/CA and the standard CSMA/CA protocol. When a node has no packet to send, it contends for the channel in virtual CSMA/CA mode. In this way the node can estimate the game state and obtain the optimal strategy. When a node has packets to send, it contends for the channel in standard CSMA/CA mode with the optimal strategy obtained in virtual CSMA/CA mode, switching smoothly from virtual to standard CSMA/CA mode. At the same time, the node keeps adjusting its strategy to the variable game state. In addition, the authors propose a simplified game-theoretic MAC protocol (G-CSMA/CA) by designing an auto degressive backoff mechanism based on the incompletely cooperative game. G-CSMA/CA can easily be implemented in mesh nodes. Finally, simulation results show that the incompletely cooperative game can increase system throughput, decrease delay, jitter, and packet loss rate, and support the game effectively.     

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.     

Sticky CSMA/CA: Implicit synchronization and real-time QoS in mesh networks

We propose a novel approach to QoS for real-time traffic over wireless mesh networks, in which application layer characteristics are exploited or shaped in the design of medium access control. Specifically, we consider the problem of efficiently supporting a mix of Voice over IP (VoIP) and delay-insensitive traffic, assuming a narrowband physical layer with CSMA/CA capabilities. The VoIP call carrying capacity of wireless mesh networks based on classical CSMA/CA (e.g., the IEEE 802.11 standard) is low compared to the raw available bandwidth, due to lack of bandwidth and delay guarantees. Time Division Multiplexing (TDM) could potentially provide such guarantees, but it requires fine-grained network-wide synchronization and scheduling, which are difficult to implement. In this paper, we introduce Sticky CSMA/CA, a new medium access mechanism that provides TDM-like performance to real-time flows without requiring explicit synchronization. We exploit the natural periodicity of VoIP flows to obtain implicit synchronization and multiplexing gains. Nodes monitor the medium using the standard CSMA/CA mechanism, except that they remember the recent history of activity in the medium. A newly arriving VoIP flow uses this information to grab the medium at the first available opportunity, and then sticks to a periodic schedule, providing delay and bandwidth guarantees. Delay-insensitive traffic fills the gaps left by the real-time flows using novel contention mechanisms to ensure efficient use of the leftover bandwidth. Large gains over IEEE 802.11 networks are demonstrated in terms of increased voice call carrying capacity (more than 100% in some cases). We briefly discuss extensions of these ideas to a broader class of real-time applications, in which artificially imposing periodicity (or some other form of regularity) at the application layer can lead to significant enhancements of QoS due to improved medium access.     

IEEE 802.11 protocol: design and performance evaluation of anadaptive backoff mechanism

In WLANs, the medium access control (MAC) protocol is the main element that determines the efficiency of sharing the limited communication bandwidth of the wireless channel. The fraction of channel bandwidth used by successfully transmitted messages gives a good indication of the protocol efficiency, and its maximum value is referred to as protocol capacity. In a previous paper we have derived the theoretical limit of the IEEE 802.11 MAC protocol capacity. In addition, we showed that if a station has an exact knowledge of the network status, it is possible to tune its backoff algorithm to achieve a protocol capacity very close to its theoretical bound. Unfortunately, in a real case, a station does not have an exact knowledge of the network and load configurations (i.e., number of active stations and length of the message transmitted on the channel) but it can only estimate it. In this work we analytically study the performance of the IEEE 802.11 protocol with a dynamically tuned backoff based on the estimation of the network status. Results obtained indicate that under stationary traffic and network configurations (i.e., constant average message length and fixed number of active stations), the capacity of the enhanced protocol approaches the theoretical limits in all the configurations analyzed. In addition, by exploiting the analytical model, we investigate the protocol performance in transient conditions (i.e., when the number of active stations sharply changes)     

IEEE 802.11-saturation throughput analysis

To satisfy the emerging need of wireless data communications, the IEEE is currently standardizing the 802.11 protocol for wireless local area networks. This standard adopts a CSMA/CA medium access control protocol with exponential backoff. We present a simple analytical model to compute the saturation throughput performance in the presence of a finite number of terminals and in the assumption of ideal channel conditions. The model applies to both basic and request-to-send/clear-to-send (RTS/CTS) access mechanisms. Comparison with simulation results shows that the model is extremely accurate in predicting the system throughput     

Adaptive Optimization of IEEE 802.11 DCF Based on Bayesian Estimation of the Number of Competing Terminals

The performance of the Distributed Coordination Function (DCF) of the IEEE 802.11 protocol has been shown to heavily depend on the number of terminals accessing the distributed medium. The DCF uses a carrier sense multiple access scheme with collision avoidance (CSMA/CA), where the backoff parameters are fixed and determined by the standard. While those parameters were chosen to provide a good protocol performance, they fail to provide an optimum utilization of the channel in many scenarios. In particular, under heavy load scenarios, the utilization of the medium can drop tenfold. Most of the optimization mechanisms proposed in the literature are based on adapting the DCF backoff parameters to the estimate of the number of competing terminals in the network. However, existing estimation algorithms are either inaccurate or too complex. In this paper, we propose an enhanced version of the IEEE 802.11 DCF that employs an adaptive estimator of the number of competing terminals based on sequential Monte Carlo methods. The algorithm uses a Bayesian approach, optimizing the backoff parameters of the DCF based on the predictive distribution of the number of competing terminals. We show that our algorithm is simple yet highly accurate even at small time scales. We implement our proposed new DCF in the ns-2 simulator and show that it outperforms existing methods. We also show that its accuracy can be used to improve the results of the protocol even when the terminals are not in saturation mode. Moreover, we show that there exists a Nash equilibrium strategy that prevents rogue terminals from changing their parameters for their own benefit, making the algorithm safely applicable in a complete distributed fashion.     

An Improvement of Slotted CSMA/CA Algorithm in IEEE 802.15.4 Medium Access Layer

The standard of IEEE 802.15.4 is able to achieve low-power transmissions in low-rate and short-distance wireless personal area networks. It employs the slotted carrier sense multiple access with collision avoidance (CSMA/CA) for the contention mechanism. The blind backoff process in the slotted CSMA/CA will cause lower channel utilization. Sensor node performs backoff process immediately when the clear channel assessment (CCA) detecting busy channel. It may neglect the implicit information of CCA failed detection and further cause the redundant senses. This paper proposes an additional carrier sensing (ACS) algorithm based on IEEE 802.15.4 to enhance the carrier sensing mechanisms in original slotted CSMA/CA. An analytic model is developed to evaluate the performance of ACS algorithm. The analytical and simulation results demonstrate that the proposed scheme significantly improves the throughput, average medium access control delay and power consumption of CCA detecting.     

A new adaptive receiver-initiated scheme for mitigating starvation in wireless networks

Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) has been adopted by the IEEE 802.11 standard and provides good performance when all transmitters are within the range of each other. Unfortunately, in multi-hop topologies, the asymmetric view of the channel state leads to a throughput distribution where a few flows may capture all the available bandwidth while many other flows get very low throughput and sometime meet starvation. To address this problem, in this paper we describe a solution called Carrier Sense Multiple Access with Collision Avoidance by Receiver Detection (CSMA/CARD) which makes use of collisions sensed by a receiver at the physical layer to help the handshake mechanism and mitigate the effect of such problem. More specifically, we propose a mechanism based on historical observations, where collisions can be used by the receiver to predict whether some sender attempted to initiate a transmission. The receiver then reacts accordingly by participating itself in a handshake sequence. We show some interesting results, obtained through analysis and simulations, when the CSMA/CARD is compared to the IEEE 802.11 protocol.     

Integration of IEEE 802.11 WLANs with IEEE 802.16-based multihop infrastructure mesh/relay networks: A game-theoretic approach to radio resource management

One of the promising applications of IEEE 802.16 (WiMAX)-based wireless mesh/relay networks is to provide infrastructure/backhaul support for IEEE 802.11-based mobile hotspots. In this article we present an architecture for integrating IEEE 802.11 WLANs with IEEE 802.16-based multihop wireless mesh infrastructure to relay WLAN traffic to the Internet. The major research issues in this integrated architecture are outlined and related work is reviewed. A game-theoretic model is developed for radio resource management in this integrated network architecture. In particular, a multiplayer bargaining game formulation is used for fair bandwidth allocation and optimal admission control of different types of connections (e.g., WLAN connections, relay connections, and connections from standalone subscriber stations) in an IEEE 802.16 base station/mesh router. Both connection-level and inconnection-level performances for this bandwidth management and admission control framework are presented     

A novel hidden station detection mechanism in IEEE 802.11 WLAN

The popular IEEE 802.11 wireless local area network (WLAN) is based on a carrier sense multiple access with collision avoidance (CSMA/CA), where a station listens to the medium before transmission in order to avoid collision. If there exist stations which can not hear each other, i.e., hidden stations, the potential collision probability increases, thus dramatically degrading the network throughput. The RTS/CTS (request-to-send/clear-to-send) frame exchange is a solution for the hidden station problem, but the RTS/CTS exchange itself consumes the network resources by transmitting the control frames. In order to maximize the network throughput, we need to use the RTS/CTS exchange adaptively only when hidden stations exist in the network. In this letter, a simple but very effective hidden station detection mechanism is proposed. Once a station detects the hidden stations via the proposed detection mechanism, it can trigger the usage of the RTS/CTS exchange. The simulation results demonstrate that the proposed mechanism can provide the maximum system throughput performance.     

Optimal Constant-Window Backoff Scheme for IEEE 802.11 DCF in Single-Hop Wireless Networks Under Finite Load Conditions

Existing backoff scheme’s optimization of IEEE 802.11 DCF MAC protocol consider only saturated networks or asymptotic conditions. In real situations, traffic is bursty or streamed at low rates so that stations do not operate usually in saturated regime. In this work, we propose and analyze a backoff enhancement for IEEE 802.11 DCF that requires information only about the network size and that is quasi-optimal under all traffic loads. We first analyze the performance of DCF multiple access scheme under general load conditions in single-hop configuration and we provide an accurate delay statistics model that consider the self-loop probability in every backoff state. We prove then the short-term unfairness of the binary exponential backoff used in IEEE 802.11 by defining channel capture probability as fairness metric. Motivated by the results on fairness, we introduce the constant-window backoff scheme and we compare its performance to IEEE 802.11 DCF with Binary exponential backoff. The quasi-optimality of the proposed scheme is proved analytically and numerical results show that it increases, both the throughput and fairness, of IEEE 802.11 DCF while remaining insensitive to traffic intensity. The analysis is then extended to consider the finite queuing capacity at nodes buffers using results from the delay analysis. NS2 simulations validate the obtained results. Institut Eurecom’s research is partially supported by its industrial members: BMW Group Research & Technology—BMW Group Company, Bouygues Telecom, Cisco Systems, France Telecom , Hitachi Europe, SFR, Sharp, STMicroelectronics, Swisscom, Thales.