Distributed Cross-Layer Algorithms for the Optimal Control of Multihop Wireless Networks

In this paper, we provide and study a general framework that facilitates the development of distributed mechanisms to achieve full utilization of multihop wireless networks. In particular, we describe a generic randomized routing, scheduling, and flow control scheme that allows for a set of imperfections in the operation of the randomized scheduler to account for potential errors in its operation. These imperfections enable the design of a large class of low-complexity and distributed implementations for different interference models. We study the effect of such imperfections on the stability and fairness characteristics of the system and explicitly characterize the degree of fairness achieved as a function of the level of imperfections. Our results reveal the relative importance of different types of errors on the overall system performance and provide valuable insight to the design of distributed controllers with favorable fairness characteristics. In the second part of the paper, 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 centralized throughput-optimal algorithms developed for such a model relies on the solution to an NP-hard problem at every decision. This results in a polynomial complexity cross-layer algorithm that achieves throughput optimality and fair allocation of network resources among the users. We further show that our algorithmic approach enables us to efficiently approximate the capacity region of a multihop wireless network.

[1]  John N. Tsitsiklis,et al.  Hardness of Low Delay Network Scheduling , 2011, IEEE Transactions on Information Theory.

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

[3]  Nick McKeown,et al.  Analysis of scheduling algorithms that provide 100% throughput in input-queued switches , 2001 .

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

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

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

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

[8]  Paolo Giaccone,et al.  Randomized scheduling algorithms for high-aggregate bandwidth switches , 2003, IEEE J. Sel. Areas Commun..

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

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

[11]  Devavrat Shah,et al.  Iterative Scheduling Algorithms , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[12]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

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

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

[15]  Devavrat Shah,et al.  Computing separable functions via gossip , 2005, PODC '06.

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

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

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

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

[20]  Eytan Modiano,et al.  Imperfect randomized algorithms for the optimal control of wireless networks , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

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

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

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

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

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

[26]  Devavrat Shah,et al.  Optimal Scheduling Algorithms for Input-Queued Switches , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

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

[28]  Atilla Eryilmaz,et al.  Stable scheduling policies for fading wireless channels , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

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

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

[31]  Kyomin Jung,et al.  Low Delay Scheduling in Wireless Network , 2007, 2007 IEEE International Symposium on Information Theory.

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

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

[34]  ModianoEytan,et al.  Fairness and optimal stochastic control for heterogeneous networks , 2008 .

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

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

[37]  Decision Systems.,et al.  Some complexity results about packet radio networks , 1983 .

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

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

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

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

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

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

[44]  Marco Ajmone Marsan,et al.  On the stability of input-buffer cell switches with speed-up , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

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

[46]  Upendra Dave,et al.  Applied Probability and Queues , 1987 .

[47]  Balaji Prabhakar,et al.  The throughput of data switches with and without speedup , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[48]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

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

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