Polynomial Complexity Algorithms for Full Utilization of Multi-Hop Wireless Networks

In this paper, we provide and study a general framework that allows the development of distributed mechanisms to achieve full utilization of multi-hop wireless networks. In particular, we describe a generic randomized routing, scheduling and flow control scheme that is applicable to a large class of interference models, and that allows for the development of distributed algorithms which maximize network throughput and utilization. In particular, we focus on a specific interference model, namely the secondary interference model, and develop distributed algorithms with polynomial communication and computation complexity in the network size. This is an important result given that earlier throughput-optimal algorithms developed for such a model relies on the solution to an NP-hard problem. This results in a polynomial complexity cross-layer algorithm that achieves throughput optimality and fair allocation of network resources amongst the users. We further show that our algorithmic approach enables us to efficiently approximate the capacity region of a multi-hop wireless network.

[1]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[2]  Erdal Arikan,et al.  Some complexity results about packet radio networks , 1983, IEEE Trans. Inf. Theory.

[3]  Bruce E. Hajek,et al.  Link scheduling in polynomial time , 1988, IEEE Trans. Inf. Theory.

[4]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[5]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1990, 29th IEEE Conference on Decision and Control.

[6]  Richard L. Tweedie,et al.  Markov Chains and Stochastic Stability , 1993, Communications and Control Engineering Series.

[7]  Bruce S. Davie,et al.  Computer Networks: A Systems Approach , 1996 .

[8]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[9]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[10]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[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]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

[13]  Catherine Rosenberg,et al.  A game theoretic framework for bandwidth allocation and pricing in broadband networks , 2000, TNET.

[14]  Alexander L. Stolyar,et al.  Scheduling for multiple flows sharing a time-varying channel: the exponential rule , 2000 .

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

[16]  Rayadurgam Srikant,et al.  The Mathematics of Internet Congestion Control , 2003 .

[17]  Philip A. Whiting,et al.  SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES , 2004, Probability in the Engineering and Informational Sciences.

[18]  Xiaojun Lin,et al.  Joint rate control and scheduling in multihop wireless networks , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[19]  Rayadurgam Srikant,et al.  The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications) , 2004 .

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

[21]  R. Srikant,et al.  Stable scheduling policies for fading wireless channels , 2005, IEEE/ACM Transactions on Networking.

[22]  R. Srikant,et al.  Regulated Maximal Matching: A Distributed Scheduling Algorithm for Multi-Hop Wireless Networks With Node-Exclusive Spectrum Sharing , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[23]  Atilla Eryilmaz,et al.  Efficient and Fair Scheduling for Wireless Networks , 2005 .

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

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

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

[27]  R. Srikant,et al.  Resource Allocation in Multi-hop Wireless Networks , 2006, 2006 International Zurich Seminar on Communications.

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

[29]  R. Srikant,et al.  Joint Asynchronous Congestion Control and Distributed Scheduling for Multi-Hop Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[30]  E. Modiano,et al.  Randomized Algorithms for Throughput-Optimality and Fairness in Wireless Networks , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

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

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

[33]  R. Srikant,et al.  Fair resource allocation in wireless networks using queue-length-based scheduling and congestion control , 2007, TNET.

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

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

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

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

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