MACAW: a media access protocol for wireless LAN's
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Dynamic tuning of the IEEE 802.11 protocol to achieve a theoretical throughput limit
IEEE/ACM Transactions on Networking (TON)
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Capture Effect with Diversity in IEEE 802.11b DCF
ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
A scalable model for channel access protocols in multihop ad hoc networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Sniffing Out the Correct Physical Layer Capture Model in 802.11b
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Maximizing throughput in wireless networks via gossiping
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Throughput analysis of IEEE802.11 multi-hop ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Performance of random medium access control, an asymptotic approach
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Performance analysis of IEEE 802.11 in multi-hop wireless networks
MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks
Power levels and packet lengths in random multiple access
IEEE Transactions on Information Theory
Performance analysis of the IEEE 802.11 distributed coordination function
IEEE Journal on Selected Areas in Communications
IEEE 802.11 protocol: design and performance evaluation of an adaptive backoff mechanism
IEEE Journal on Selected Areas in Communications
On the fairness of large CSMA networks
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Spatial fairness in wireless multi-access networks
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Stochastic Geometry and Wireless Networks: Volume II Applications
Foundations and Trends® in Networking
Optimal tradeoff between exposed and hidden nodes in large wireless networks
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Graph-based approach for enhancing capacity and fairness in wireless mesh networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
On the validity of IEEE 802.11 MAC modeling hypotheses
IEEE/ACM Transactions on Networking (TON)
Comparing slotted and continuous CSMA: throughputs and fairness
ACM SIGMETRICS Performance Evaluation Review - Special Issue on IFIP PERFORMANCE 2011- 29th International Symposium on Computer Performance, Modeling, Measurement and Evaluation
Achieving target throughputs in random-access networks
Performance Evaluation
Spatial fairness in linear random-access networks
Performance Evaluation
On deadlocks and fairness in self-organizing resource-flow systems
ARCS'10 Proceedings of the 23rd international conference on Architecture of Computing Systems
Performance analysis and comparison of burst transmission schemes in unsaturated 802.11e WLANs
Wireless Communications & Mobile Computing
Balancing lifetime and classification accuracy of wireless sensor networks
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
| Hi-index | 754.84 |
Decentralized medium access control schemes for wireless networks based on CSMA/CA, such as the IEEE 802.11 protocol, are known to be unfair. In multihop networks, they can even favor some links to such an extent that the others suffer from virtually complete starvation. This observation has been reported in quite a few works, but the factors causing it are still not well understood. We find that the capture effect and the relative values of the receive and carrier sensing ranges play a crucial role in the performance of these protocols. Using a simple Markovian model, we show that an idealized CSMA/CA protocol suffers from starvation when the receiving and sensing ranges are equal, but quite surprisingly that this unfairness is reduced or even disappears when these two ranges are sufficiently different. We also show that starvation has a positive counterpart, namely organization. When its access intensity is large the protocol organizes the transmissions in space in such a way that it maximizes the number of concurrent successful transmissions. We obtain exact formulæ for the so-called spatial reuse of the protocol on large line networks.