An Analysis of the Back-Off Mechanism Used in IEEE 802.11 Networks
ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
Carrier sense multiple access with enhanced collision avoidance: a performance analysis
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
A new mechanism to detect selfish behavior in IEEE 802.11 ad hoc networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
On scaling the IEEE 802.11 to facilitate scalable wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Dynamic parameter adjustment in CSMA/ECA
MACOM'10 Proceedings of the Third international conference on Multiple access communications
Latency minimized probabilistic CSMA/CA
Proceedings of the 6th ACM workshop on Wireless multimedia networking and computing
Computers and Electrical Engineering
Mathematical and Computer Modelling: An International Journal
International Journal of Communication Systems
Semi-random backoff: towards resource reservation for channel access in wireless LANs
IEEE/ACM Transactions on Networking (TON)
Kalman Filtering: Estimate of the numbers of active queues in an 802.11e EDCA WLAN
Computer Communications
A Beacon-Based Collision-Free Channel Access Scheme for IEEE 802.11 WLANs
Wireless Personal Communications: An International Journal
| Hi-index | 0.02 |
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.