Towards utility-optimal random access without message passing

It has been recently suggested by Jiang and Walrand that adaptive carrier sense multiple access (CSMA) can achieve optimal utility without any message passing in wireless networks. In this paper, after a survey of recent work on random access, a generalization of this algorithm is considered. In the continuous-time model, a proof is presented of the convergence of these adaptive CSMA algorithms to be arbitrarily close to utility optimality, without assuming that the network dynamics converge to an equilibrium in between consecutive CSMA parameter updates. In the more realistic, slotted-time model, the impact of collisions on the utility achieved is characterized, and the tradeoff between optimality and short-term fairness is quantified. Copyright © 2009 John Wiley & Sons, Ltd. This paper shows how random access without message passing can approach utility optimality via adaptive CSMA. After a survey of recent work on distributed scheduling, a utility-optimal CSMA is considered, together with a proof of its convergence in a continuous-time model without assuming timescale separation. The impact of collisions is studied in the more realistic slotted-time model, together with the tradeoff between optimality and short-term fairness.

[1]  Junshan Zhang,et al.  Delay and effective throughput of wireless scheduling in heavy traffic regimes: vacation model for complexity , 2009, MobiHoc '09.

[2]  Eytan Modiano,et al.  Maximizing throughput in wireless networks via gossiping , 2006, SIGMETRICS '06/Performance '06.

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

[4]  Jian Ni,et al.  Distributed CSMA/CA algorithms for achieving maximum throughput in wireless networks , 2009, 2009 Information Theory and Applications Workshop.

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

[6]  Alexandre Proutière,et al.  Complexity in wireless scheduling: impact and tradeoffs , 2008, MobiHoc '08.

[7]  R. Srikant,et al.  Fair Resource Allocation in Wireless Networks Using Queue-Length-Based Scheduling and Congestion Control , 2005, IEEE/ACM Transactions on Networking.

[8]  Frank Kelly,et al.  Reversibility and Stochastic Networks , 1979 .

[9]  Eytan Modiano,et al.  Fairness and optimal stochastic control for heterogeneous networks , 2005, INFOCOM.

[10]  Soung Chang Liew,et al.  Improving Throughput and Fairness by Reducing Exposed and Hidden Nodes in 802.11 Networks , 2008, IEEE Transactions on Mobile Computing.

[11]  Saikat Ray,et al.  Arbitrary Throughput Versus Complexity Tradeoffs in Wireless Networks Using Graph Partitioning , 2008, IEEE Transactions on Automatic Control.

[12]  A. Robert Calderbank,et al.  Jointly optimal congestion and contention control based on network utility maximization , 2006, IEEE Communications Letters.

[13]  R. Srikant,et al.  Distributed Link Scheduling With Constant Overhead , 2006, IEEE/ACM Transactions on Networking.

[14]  H. Vincent Poor,et al.  Queue Back-Pressure Random Access in Multihop Wireless Networks: Optimality and Stability , 2009, IEEE Transactions on Information Theory.

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

[16]  Leandros Tassiulas,et al.  Achieving proportional fairness using local information in Aloha networks , 2004, IEEE Transactions on Automatic Control.

[17]  Vincent W. S. Wong,et al.  Utility-optimal random access: Reduced complexity, fast convergence, and robust performance , 2009, IEEE Transactions on Wireless Communications.

[18]  Mung Chiang,et al.  Wireless Scheduling Algorithms with O(1) Overhead for M-Hop Interference Model , 2008, 2008 IEEE International Conference on Communications.

[19]  Alexandre Proutière,et al.  Performance of random medium access control, an asymptotic approach , 2008, SIGMETRICS '08.

[20]  Frank Kelly,et al.  Stochastic Models of Computer Communication Systems , 1985 .

[21]  A. Eryilmaz,et al.  A backlog-based CSMA mechanism to achieve fairness and throughput-optimality in multihop wireless networks , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[22]  Jinsung Lee,et al.  Implementing utility-optimal CSMA , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[23]  Devavrat Shah,et al.  Network adiabatic theorem: an efficient randomized protocol for contention resolution , 2009, SIGMETRICS '09.

[24]  宮沢 政清,et al.  P. Bremaud 著, Markov Chains, (Gibbs fields, Monte Carlo simulation and Queues), Springer-Verlag, 1999年 , 2000 .

[25]  Vivek S. Borkar,et al.  Stochastic approximation with 'controlled Markov' noise , 2006, Systems & control letters (Print).

[26]  A. Robert Calderbank,et al.  Utility-optimal random-access control , 2007, IEEE Transactions on Wireless Communications.

[27]  Alexandre Proutière,et al.  Throughput of random access without message passing , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

[28]  V. Borkar.  Stochastic Approximation: A Dynamical Systems Viewpoint , 2008 .

[29]  M. Chiang,et al.  Next-Generation Internet Architectures and Protocols: Stochastic network utility maximization and wireless scheduling , 2008 .

[30]  Leandros Tassiulas,et al.  Linear complexity algorithms for maximum throughput in radio networks and input queued switches , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[31]  Devavrat Shah,et al.  Distributed algorithm and reversible network , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

[32]  M. Benaïm.  A Dynamical System Approach to Stochastic Approximations , 1996 .

[33]  R. Srikant,et al.  Low-Complexity Distributed Scheduling Algorithms for Wireless Networks , 2007, INFOCOM.

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

[35]  Jian Ni,et al.  Q-CSMA: Queue-Length Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks , 2010, INFOCOM 2010.

[36]  Harold J. Kushner,et al.  Stochastic Approximation Algorithms and Applications , 1997, Applications of Mathematics.

[37]  A. Robert Calderbank,et al.  Reverse-Engineering MAC: A Non-Cooperative Game Model , 2007, IEEE Journal on Selected Areas in Communications.

[38]  Eytan Modiano,et al.  Polynomial Complexity Algorithms for Full Utilization of Multi-Hop Wireless Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[39]  Ness B. Shroff,et al.  Performance of Random Access Scheduling Schemes in Multi-hop Wireless Networks , 2006 .

[40]  Bruce E. Hajek,et al.  Cooling Schedules for Optimal Annealing , 1988, Math. Oper. Res..

[41]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[42]  Mung Chiang,et al.  Cross-Layer Congestion Control, Routing and Scheduling Design in Ad Hoc Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[43]  Alexander L. Stolyar,et al.  Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm , 2005, Queueing Syst. Theory Appl..

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

[45]  Koushik Kar,et al.  Cross-layer rate control for end-to-end proportional fairness in wireless networks with random access , 2005, MobiHoc '05.

[46]  Alexander L. Stolyar.  Dynamic Distributed Scheduling in Random Access Networks , 2005 .

[47]  Prasanna Chaporkar,et al.  Throughput Guarantees Through Maximal Scheduling in Wireless Networks , 2008 .

[48]  Vincent W. S. Wong,et al.  Utility-optimal random access without message passing , 2009, IEEE Transactions on Wireless Communications.