Achievable rate region of CSMA schedulers in wireless networks with primary interference constraints

We consider Carrier Sense Multiple Access (CSMA) schedulers for wireless networks. For networks where all nodes are within transmission range of each other, it has been shown that such schedulers achieve the network capacity in the limiting region of large networks with a small sensing delay. However the design and analysis of CSMA schedulers for general networks has been an open problem due to the complexity of the interaction among coupled interference constraints. For networks with primary interference constraints, we introduce a tractable analysis of such CSMA schedulers based on a fixed point approximation. We then use the approximation to characterize the achievable rate region of static CSMA schedulers. We show that the approximation is asymptotically accurate for the limiting regime of large networks with a small sensing delay, and that in this case the achievable rate region of CSMA converges to the capacity region.

[1]  Xiaojun Lin,et al.  Constant-Time Distributed Scheduling Policies for Ad Hoc Wireless Networks , 2006, CDC.

[2]  Ness B. Shroff,et al.  On the Complexity of Scheduling in Wireless Networks , 2006, MobiCom '06.

[3]  S. Zachary,et al.  Loss networks , 2009, 0903.0640.

[4]  Xiaojun Lin,et al.  Constant-Time Distributed Scheduling Policies for Ad Hoc Wireless Networks , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[5]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[6]  David McDonald.  Elements of applied probability for engineering, mathematics and systems science , 2004 .

[7]  Leandros Tassiulas,et al.  Maxmin fair scheduling in wireless networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[8]  Ness B. Shroff,et al.  The impact of imperfect scheduling on cross-layer rate control in wireless networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[9]  Bruce Hajek,et al.  Bounds on the Accuracy of the Reduced-Load Blocking Formula in Some Simple Circuit-Switched Networks , 2006 .

[10]  R. Srikant,et al.  Joint Asynchronous Congestion Control and Distributed Scheduling for Multi-Hop Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[11]  Patrick Thiran,et al.  A Packing Approach to Compare Slotted and Non-Slotted Medium Access Control , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[12]  Xiaojun Lin,et al.  The Impact of Imperfect Scheduling on Cross-Layer Rate Control in Multihop Wireless Networks , 2022 .

[13]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[14]  R. Srikant,et al.  Regulated Maximal Matching: A Distributed Scheduling Algorithm for Multi-Hop Wireless Networks With Node-Exclusive Spectrum Sharing , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[15]  P. Marbach,et al.  Active Queue Management and Scheduling for Wireless Networks: The Single-Cell Case , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[16]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1990, 29th IEEE Conference on Decision and Control.