Asynchronous CSMA Policies in Multihop Wireless Networks With Primary Interference Constraints

• Published in: IEEE transactions on information theory Vol. 57; no. 6; pp. 3644 - 3676
• Main Authors: Marbach, P, Eryilmaz, A, Ozdaglar, A
• Format: Journal Article
• Language: English
• Published: New York, NY IEEE 01.06.2011; Institute of Electrical and Electronics Engineers; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Applied sciences; Approximation; Approximation methods; Asymptotic capacity region of wireless networks; Asymptotic methods; carrier-sense multiple access; Code Division Multiple Access; Data transmission; Delay; Exact sciences and technology; fixed-point approximation; Information theory; Information, signal and communications theory; Interference; Multiaccess communication; Numerical analysis; Sensors; Spread spectrum communication; Studies; Switching and signalling; Systems, networks and services of telecommunications; Telecommunications; Telecommunications and information theory; throughput-optimal scheduling; Transmission and modulation (techniques and equipments); Wireless networks; Packet switching; carrier-sense multiple access; throughput-optimal scheduling; Wireless telecommunication; Transfer characteristic; Information rate; Scheduling; Information transmission; Case study; Carrier sense multiple access; Multihop network; Wireless network; fixed-point approximation; Optimal planning; Asymptotic capacity region of wireless networks; Fixed point
• ISSN: 0018-9448; 1557-9654
• DOI: 10.1109/TIT.2011.2133130

We analyze asynchronous carrier sense multiple access (CSMA) policies for scheduling packet transmissions in multihop wireless networks subject to collisions under primary interference constraints. While the (asymptotic) achievable rate region of CSMA policies for single-hop networks has been well-known, their analysis for general multihop networks has been an open problem due to the complexity of complex interactions among coupled interference constraints. Our work resolves this problem for networks with primary interference constraints by introducing a novel fixed-point formulation that approximates the link service rates of CSMA policies. This formulation allows us to derive an explicit characterization of the achievable rate region of CSMA policies for a limiting regime of large networks with a small sensing period. Our analysis also reveals the rate at which CSMA achievable rate region approaches the asymptotic capacity region of such networks. Moreover, our approach enables the computation of approximate CSMA link transmission attempt probabilities to support any given arrival vector within the achievable rate region. As part of our analysis, we show that both of these approximations become (asymptotically) accurate for large networks with a small sensing period. Our numerical case studies further suggest that these approximations are accurate even for moderately sized networks.