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
THE ALOHA SYSTEM: another alternative for computer communications
AFIPS '70 (Fall) Proceedings of the November 17-19, 1970, fall joint computer conference
Network adiabatic theorem: an efficient randomized protocol for contention resolution
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Optimizing 802.11 wireless mesh networks based on physical carrier sensing
IEEE/ACM Transactions on Networking (TON)
Spatial fairness in wireless multi-access networks
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Self-organization properties of CSMA/CA systems and their consequences on fairness
IEEE Transactions on Information Theory
Blocking probability and channel assignment in wireless networks
IEEE Transactions on Wireless Communications
Spatial fairness in linear random-access networks
Performance Evaluation
Hi-index | 0.00 |
Wireless networks equipped with the CSMA protocol are subject to collisions due to interference. For a given interference range we investigate the tradeoff between collisions (hidden nodes) and unused capacity (exposed nodes). We show that the sensing range that maximizes throughput critically depends on the activation rate of nodes. For infinite line networks, we prove the existence of a threshold: When the activation rate is below this threshold the optimal sensing range is small (to maximize spatial reuse). When the activation rate is above the threshold the optimal sensing range is just large enough to preclude all collisions. Simulations suggest that this threshold policy extends to more complex linear and non-linear topologies.