A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks

In multihop wireless networks, designing distributed scheduling algorithms to achieve the maximal throughput is a challenging problem because of the complex interference constraints among different links. Traditional maximal-weight scheduling (MWS), although throughput-optimal, is difficult to implement in distributed networks. On the other hand, a distributed greedy protocol similar to IEEE 802.11 does not guarantee the maximal throughput. In this paper, we introduce an adaptive carrier sense multiple access (CSMA) scheduling algorithm that can achieve the maximal throughput distributively. Some of the major advantages of the algorithm are that it applies to a very general interference model and that it is simple, distributed, and asynchronous. Furthermore, the algorithm is combined with congestion control to achieve the optimal utility and fairness of competing flows. Simulations verify the effectiveness of the algorithm. Also, the adaptive CSMA scheduling is a modular MAC-layer algorithm that can be combined with various protocols in the transport layer and network layer. Finally, the paper explores some implementation issues in the setting of 802.11 networks.

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

[2]  Peter Whittle,et al.  Systems in stochastic equilibrium , 1986 .

[3]  Basil S. Maglaris,et al.  Throughput Analysis in Multihop CSMA Packet Radio Networks , 1987, IEEE Trans. Commun..

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

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

[6]  Jean C. Walrand,et al.  Achieving 100% throughput in an input-queued switch , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[7]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

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

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

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

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

[13]  R. Srikant,et al.  Scheduling Efficiency of Distributed Greedy Scheduling Algorithms in Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

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

[15]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[16]  P. Gupta,et al.  Optimal Throughput Allocation in General Random-Access Networks , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[17]  R. Srikant,et al.  A tutorial on cross-layer optimization in wireless networks , 2006, IEEE Journal on Selected Areas in Communications.

[18]  E. Yeh,et al.  Throughput Optimal Distributed Control of Stochastic Wireless Networks , 2006, 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks.

[19]  J. Walrand,et al.  Sufficient conditions for stability of longest-queue-first scheduling: second-order properties using fluid limits , 2006, Advances in Applied Probability.

[20]  Michael J. Neely,et al.  Cross-layer adaptive control for wireless mesh networks , 2007, Ad Hoc Networks.

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

[22]  H. Robbins.  A Stochastic Approximation Method , 1951 .

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

[24]  Asuman E. Ozdaglar,et al.  Achievable rate region of CSMA schedulers in wireless networks with primary interference constraints , 2007, 2007 46th IEEE Conference on Decision and Control.

[25]  A Distributed Algorithm for Maximal Throughput and Optimal Fairness in Wireless Networks with a General Interference Model , 2008 .

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

[27]  A distributed CSMA algorithm for throughput and utility maximization in wireless networks , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[28]  Junshan Zhang,et al.  The Impact of Stochastic Noisy Feedback on Distributed Network Utility Maximization , 2008, IEEE Trans. Inf. Theory.

[29]  Patrick Thiran,et al.  Border Effects, Fairness, and Phase Transition in Large Wireless Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

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

[31]  Koushik Kar,et al.  Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks , 2008, IEEE Transactions on Information Theory.

[32]  Eytan Modiano,et al.  Multihop Local Pooling for Distributed Throughput Maximization in Wireless Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[33]  Injong Rhee,et al.  DiffQ: Differential Backlog Congestion Control for Wireless Multi-hop Networks , 2008, 2008 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[34]  Michael I. Jordan,et al.  Graphical Models, Exponential Families, and Variational Inference , 2008, Found. Trends Mach. Learn..

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

[36]  Harish Viswanathan,et al.  Dynamic Algorithms for Multicast With Intra-Session Network Coding , 2009, IEEE Transactions on Information Theory.

[37]  Alexander L. Stolyar,et al.  Novel Architectures and Algorithms for Delay Reduction in Back-Pressure Scheduling and Routing , 2009, IEEE INFOCOM 2009.

[38]  Jean Walrand,et al.  Approaching throughput-optimality in a distributed CSMA algorithm: collisions and stability , 2009, MobiHoc S3 '09.

[39]  Ness B. Shroff,et al.  Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multihop Wireless Networks , 2008, IEEE/ACM Transactions on Networking.

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

[41]  Ness B. Shroff,et al.  Understanding the capacity region of the Greedy maximal scheduling algorithm in multihop wireless networks , 2009, TNET.

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

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

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

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

[46]  J. Walrand,et al.  Approaching Throughput-optimality in a Distributed CSMA Algorithm with Contention Resolution , 2009 .

[47]  Edmund M. Yeh,et al.  Throughput Optimal Distributed Power Control of Stochastic Wireless Networks , 2010, IEEE/ACM Transactions on Networking.

[48]  Jian Ni,et al.  Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks , 2011, TNET.

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