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
Capacity of Ad Hoc wireless networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Enhancing TCP fairness in ad hoc wireless networks using neighborhood RED
Proceedings of the 9th annual international conference on Mobile computing and networking
Impact of interference on multi-hop wireless network performance
Proceedings of the 9th annual international conference on Mobile computing and networking
TCP over multihop 802.11 networks: issues and performance enhancement
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Measurement driven deployment of a two-tier urban mesh access network
Proceedings of the 4th international conference on Mobile systems, applications and services
Maximizing throughput in wireless networks via gossiping
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
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
Network adiabatic theorem: an efficient randomized protocol for contention resolution
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
In defense of wireless carrier sense
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
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 analysis of the IEEE 802.11 distributed coordination function
IEEE Journal on Selected Areas in Communications
Performance Preserving Topological Downscaling of Internet-Like Networks
IEEE Journal on Selected Areas in Communications
Neighborhood-centric congestion control for multihop wireless mesh networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
This paper establishes that random access scheduling schemes, and more specifically CSMA-CA, yield 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 that grossly underutilize the available capacity that random access provides. To establish our thesis, we first compare the achievable rate region of CSMA-CA and optimal in a number of carefully constructed multihop topologies and find that CSMA-CA is always within 48% of the optimal. Motivated by this result, we next characterize the worst-case performance of CSMA-CA in neighborhood topologies representing the congested regions of larger multihop topologies by deriving the neighborhood topology that yields the worst-case throughput ratio for CSMA-CA and find that in neighborhood topologies with less than 20 edges: 1) CSMA-CA is never worse than 16% of the optimal when ignoring physical-layer constraints; and 2) 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.