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.

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

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

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

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

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

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

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

[8]  R. Srikant,et al.  Low-Complexity Distributed Scheduling Algorithms for Wireless Networks , 2009, IEEE/ACM Transactions on Networking.

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

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

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

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

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

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

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

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

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

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

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

[20]  Carlos S. Kubrusly,et al.  Stochastic approximation algorithms and applications , 1973, CDC 1973.

[21]  John Odentrantz,et al.  Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues , 2000, Technometrics.

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

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

[24]  V. Wong.  For Peer Review Utility-Optimal Random Access : Optimal Performance Without Frequent Explicit Message Passing , 2007 .

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

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

[27]  Ness B. Shroff,et al.  Performance of Random Access Scheduling Schemes in Multi-Hop Wireless Networks , 2006, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

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

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

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

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

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

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

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

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

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

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

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

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

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