Convergence and tradeoff of utility-optimal CSMA

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, 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 arbitrarily close to utility optimality, without assuming that the network dynamics freeze while the CSMA parameters are updated. In the more realistic, slotted-time model, the impact of collisions on the utility achieved is characterized, and the tradeoff between

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

[2]  François Baccelli,et al.  Elements Of Queueing Theory , 1994 .

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

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

[5]  A. Robert Calderbank,et al.  Utility-Optimal Medium Access Control: Reverse and Forward Engineering , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

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

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

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

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

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

[11]  Jean C. Walrand,et al.  A Distributed Algorithm for Optimal Throughput and Fairness in Wireless Networks with a General Interference Model , 2008 .

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

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

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

[15]  Jiaping Liu,et al.  Maximizing Utility via Random Access without Message Passing , 2008 .

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

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

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

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

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

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

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

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

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

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

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

[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]  R. Srikant,et al.  Distributed Link Scheduling With Constant Overhead , 2006, IEEE/ACM Transactions on Networking.

[30]  Abhinav Gupta,et al.  Low-complexity distributed scheduling algorithms for wireless networks , 2009 .

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

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

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

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

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

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

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

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

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

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