DMCA
IEEE/ACM TRANSACTIONS ON NETWORKING 1 On the Efficiency of CSMA-CA scheduling in Wireless Multi-hop Networks
BibTeX
@MISC{Jindal_ieee/acmtransactions,
author = {Apoorva Jindal and Konstantinos Psounis and Senior Member},
title = {IEEE/ACM TRANSACTIONS ON NETWORKING 1 On the Efficiency of CSMA-CA scheduling in Wireless Multi-hop Networks},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract—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 first compare the achievable rate region of CSMA-CA and optimal in a number of carefully constructed multi-hop 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 multi-hop topologies by deriving the neighborhood topology which yields the worst case throughput ratio for CSMA-CA, and find that in multi-hop topologies with neighborhoods of less than 20 edges: (i) CSMA-CA is never worse than 16 % of the optimal when ignoring physical layer constraints, and (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. Index Terms—CSMA-CA, Wireless Multi-hop Networks, Optimality. I.
Keyphrases
wireless multi-hop network multi-hop topology csma-ca scheduling ieee acm transaction networking random access optimal scheduler worst-case performance realistic topology good performance distributed approximation wireless multihop network csma-ca performs geometric constraint neighborhood topology physical layer case bound available capacity greedy maximal scheduling achievable rate region index term csma-ca rate allocation mechanism physical layer constraint
