On the capacity of wireless CSMA/CA multihop networks

Due to a poor understanding of the interactions among transmitters, wireless multihop networks have commonly been stigmatized as unpredictable in nature. Even elementary questions regarding the throughput limitations of these networks cannot be answered in general. In this paper we investigate the behavior of wireless multihop networks using carrier sense multiple access with collision avoidance (CSMA/CA). Our goal is to understand how the transmissions of a particular node affect the medium access, and ultimately the throughput, of other nodes in the network. We introduce a theory which accurately models the behavior of these networks and show that, contrary to popular belief, their performance is easily predictable and can be described by a system of equations. Using the proposed theory, we provide the analytical expressions necessary to fully characterize the capacity region of any wireless CSMA/CA multihop network. We show that this region is nonconvex in general and entirely agnostic to the probability distributions of all network parameters, depending only on their expected values.

[1]  Otto Carlos Muniz Bandeira Duarte,et al.  A routing protocol suitable for backhaul access in wireless mesh networks , 2012, Comput. Networks.

[2]  Soung Chang Liew,et al.  Back-of-the-Envelope Computation of Throughput Distributions in CSMA Wireless Networks , 2007, 2009 IEEE International Conference on Communications.

[3]  Konstantinos Psounis,et al.  The achievable rate region of 802.11-scheduled multihop networks , 2009, TNET.

[4]  Basil S. Maglaris,et al.  Throughput Analysis in Multihop CSMA Packet Radio Networks , 1987, IEEE Trans. Commun..

[5]  Soung Chang Liew,et al.  Removing hidden nodes in IEEE 802.11 wireless networks , 2005, VTC-2005-Fall. 2005 IEEE 62nd Vehicular Technology Conference, 2005..

[6]  Soung Chang Liew,et al.  Throughput Analysis of IEEE802.11 Multi-Hop Ad Hoc Networks , 2007, IEEE/ACM Transactions on Networking.

[7]  Patrick Thiran,et al.  Self-Organization Properties of CSMA/CA Systems and Their Consequences on Fairness , 2009, IEEE Transactions on Information Theory.

[8]  Koushik Kar,et al.  Throughput modelling and fairness issues in CSMA/CA based ad-hoc networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[9]  Michele Garetto,et al.  Modeling per-flow throughput and capturing starvation in CSMA multi-hop wireless networks , 2008, TNET.

[10]  Yan Gao,et al.  Determining the end-to-end throughput capacity in multi-hop networks: methodology and applications , 2006, SIGMETRICS '06/Performance '06.

[11]  L. Kleinrock,et al.  Packet Switching in Radio Channels: Part I - Carrier Sense Multiple-Access Modes and Their Throughput-Delay Characteristics , 1975, IEEE Transactions on Communications.

[12]  Edward W. Knightly,et al.  Closed-form throughput expressions for CSMA networks with collisions and hidden terminals , 2012, 2012 Proceedings IEEE INFOCOM.

[13]  J. J. Garcia-Luna-Aceves,et al.  A scalable model for channel access protocols in multihop ad hoc networks , 2004, MobiCom '04.

[14]  Fouad A. Tobagi,et al.  Towards Performance Modeling of IEEE 802.11 Based Wireless Networks: A Unified Framework and Its Applications , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[15]  Hongqiang Zhai,et al.  How well can the IEEE 802.11 wireless LAN support quality of service? , 2005, IEEE Transactions on Wireless Communications.