Data networks (2nd ed.)
Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic
ACM SIGCOMM Computer Communication Review
Randomized algorithms
Impact of interference on multi-hop wireless network performance
Proceedings of the 9th annual international conference on Mobile computing and networking
On the complexity of scheduling in wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Distributed link scheduling with constant overhead
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
The achievable rate region of 802.11-scheduled multihop networks
IEEE/ACM Transactions on Networking (TON)
Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
IEEE Transactions on Information Theory
Performance Preserving Topological Downscaling of Internet-Like Networks
IEEE Journal on Selected Areas in Communications
Simple yet efficient, transparent airtime allocation for TCP in wireless mesh networks
Proceedings of the 6th International COnference
| Hi-index | 0.00 |
This paper formally establishes that random access scheduling schemes, and, more specifically CSMA-CA, yields exceptionally good performance in the context of wireless multihop networks. While it is believed that CSMA-CA performs significantly worse than optimal, this belief is usually based on experiments that use rate allocation mechanisms which grossly underutilize the available capacity that random access provides. To establish our thesis we compare the max-min rate allocation achieved by CSMA-CA and optimal in multi-hop topologies and find that: (i) CSMA-CA is never worse than 16% of the optimal when ignoring physical layer constraints, (ii) in any realistic topology with geometric constraints due to the physical layer, CSMA-CA is never worse than 30% of the optimal. Considering that maximal scheduling achieves much lower bounds than the above, and greedy maximal scheduling, which is one of the best known distributed approximation of an optimal scheduler, achieves similar worst case bounds, CSMA-CA is surprisingly efficient.