Utility Bounds of Joint Congestion and Medium Access Control for CSMA based Wireless Networks

In this paper, we study the problem of network utility maximization in a CSMA based multi-hop wireless network. Existing work in this aspect typically adopted continuous time Markov model for performance modelling, which fails to consider the channel conflict impact in actual CSMA networks. To maximize the utility of a CSMA based wireless network with channel conflict, in this paper, we first model its weighted network capacity (i.e., network capacity weighted by link queue length) and then propose a distributed link scheduling algorithm, called CSMA based Maximal-Weight Scheduling (C-MWS), to maximize the weighted network capacity. We derive the upper and lower bounds of network utility based on C-MWS. The derived bounds can help us to tune the C-MWS parameters for C-MWS to work in a distributed wireless network. Simulation results show that the joint optimization based on C-MWS can achieve near-optimal network utility when appropriate algorithm parameters are chosen and also show that the derived utility upper bound is very tight.

[1]  Ness B. Shroff,et al.  Distributed Link Scheduling Under SINR Model in Multihop Wireless Networks , 2014, IEEE/ACM Transactions on Networking.

[2]  Jinwoo Shin,et al.  Distributed learning for utility maximization over CSMA-based wireless multihop networks , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[3]  Fernando Paganini,et al.  Network Resource Allocation for Users With Multiple Connections: Fairness and Stability , 2014, IEEE/ACM Transactions on Networking.

[4]  Jinwoo Shin,et al.  CSMA over time-varying channels: optimality, uniqueness and limited backoff rate , 2013, MobiHoc '13.

[5]  Shengli Zhang,et al.  Throughput analysis of CSMA wireless networks with finite offered-load , 2013, 2013 IEEE International Conference on Communications (ICC).

[6]  Mihail L. Sichitiu,et al.  IEEE 802.11 Saturation Throughput Analysis in the Presence of Hidden Terminals , 2012, IEEE/ACM Transactions on Networking.

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

[8]  Jian Ni,et al.  Q-CSMA: Queue-Length-Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks , 2009, IEEE/ACM Transactions on Networking.

[9]  Warren E. Dixon,et al.  Throughput Maximization in CSMA Networks with Collisions and Hidden Terminals , 2012 .

[10]  Nikolaos M. Freris,et al.  Performance bounds for CSMA-based medium access control , 2011, IEEE Conference on Decision and Control and European Control Conference.

[11]  Roberto Cominetti,et al.  Network congestion control with Markovian multipath routing , 2011, International Conference on NETwork Games, Control and Optimization (NetGCooP 2011).

[12]  Peng Wang,et al.  Practical Computation of Optimal Schedules in Multihop Wireless Networks , 2011, IEEE/ACM Transactions on Networking.

[13]  Jean C. Walrand,et al.  Approaching Throughput-Optimality in Distributed CSMA Scheduling Algorithms With Collisions , 2010, IEEE/ACM Transactions on Networking.

[14]  J. Walrand,et al.  A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks , 2010, IEEE/ACM Transactions on Networking.

[15]  Jean C. Walrand,et al.  Convergence and stability of a distributed CSMA algorithm for maximal network throughput , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[16]  H. Vincent Poor,et al.  Convergence and tradeoff of utility-optimal CSMA , 2009, 2009 Sixth International Conference on Broadband Communications, Networks, and Systems.

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

[18]  R. Srikant,et al.  On the Connection-Level Stability of Congestion-Controlled Communication Networks , 2008, IEEE Transactions on Information Theory.

[19]  E. Modiano,et al.  Fairness and Optimal Stochastic Control for Heterogeneous Networks , 2005, IEEE/ACM Transactions on Networking.

[20]  A. Robert Calderbank,et al.  Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures , 2007, Proceedings of the IEEE.

[21]  Koushik Kar,et al.  Cross-layer rate optimization for proportional fairness in multihop wireless networks with random access , 2006, IEEE Journal on Selected Areas in Communications.

[22]  R. Srikant,et al.  Joint congestion control, routing, and MAC for stability and fairness in wireless networks , 2006, IEEE Journal on Selected Areas in Communications.

[23]  A. Robert Calderbank,et al.  Jointly Optimal Congestion and Medium Access Control in Ad Hoc Wireless Networks , 2006, 2006 IEEE 63rd Vehicular Technology Conference.

[24]  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..

[25]  A. Girotra,et al.  Performance Analysis of the IEEE 802 . 11 Distributed Coordination Function , 2005 .

[26]  Eytan Modiano,et al.  Dynamic power allocation and routing for time varying wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[27]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

[28]  Anthony Unwin,et al.  Reversibility and Stochastic Networks , 1980 .