Transport capacity of distributed wireless CSMA networks

Publication Type:
Journal Article
IEEE Transactions on Wireless Communications, 2014, 13 (10), pp. 5635 - 5647
Issue Date:
Filename Description Size
Thumbnail06819068.pdfPublished Version721.09 kB
Adobe PDF
Full metadata record
© 2014 IEEE. In this paper, we study the transport capacity of large multi-hop wireless CSMA networks. Different from previous studies that rely on the use of a centralized scheduling algorithm and/or a centralized routing algorithm to achieve the optimal capacity scaling law, we show that the optimal capacity scaling law can be achieved using entirely distributed routing and scheduling algorithms. Specifically, we consider a network with nodes Poissonly distributed with unit intensity on a √n x √n Bn ⊂ double-struck R2. Furthermore, each node chooses its destination randomly and independently and transmits following a CSMA protocol. By resorting to the percolation theory and by carefully tuning the three controllable parameters in CSMA protocols, i.e., transmission power, carrier-sensing threshold, and countdown timer, we show that a throughput of Θ (1/ √n) is achievable in distributed CSMA networks. Furthermore, we derive the pre-constant preceding the order of the transport capacity by giving an upper and a lower bound of the transport capacity. The tightness of the bounds is validated using simulations.
Please use this identifier to cite or link to this item: