Computational aspects of optimal schedules with power control and multiple bitrates selection in multihop wireless networks

A significant amount of research on optimal scheduling has focused on the case where links can transmit with only a single bit-rate and a single transmission power. This paper develops techniques to accommodate multiple bit-rates and multiple transmission powers as well as a continuum of transmission powers. Optimizing over a large number of bit-rates and transmission powers typically increases the computed throughput at the expense of increasing the computation time. This paper examines the trade-off between computed throughput and computation time, with emphasis on the case when the relationship between bit-rate and SINR is the same as it is for 802.11a/g. One finding of this paper is a progression of Pareto optimal schemes that increases the computed capacity. A second finding is that optimizing over two transmission powers and two or three bit-rates achieves nearly the same throughput as optimizing over a continuum of transmission powers and all supported bit-rates. However, optimizing over a continuum of transmission powers and all supported bit-rates is far more computationally complex than optimizing over two transmission powers and a few bit-rates.

[1]  Matt W. Mutka,et al.  QoS-aware fair rate allocation in wireless mesh networks , 2008, Comput. Commun..

[2]  Lijun Chen,et al.  Joint congestion control and media access control design for ad hoc wireless networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[3]  Tomio Hirata,et al.  Approximation Algorithms for the Weighted Independent Set Problem , 2005, WG.

[4]  Jean C. Walrand,et al.  Fair end-to-end window-based congestion control , 2000, TNET.

[5]  Vikas Kawadia,et al.  Power control and clustering in ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[6]  Magnús M. Halldórsson,et al.  Approximations of Independent Sets in Graphs , 1998, APPROX.

[7]  Roy D. Yates,et al.  Integrated power control and base station assignment , 1995 .

[8]  Brahim Bensaou,et al.  Fair bandwidth sharing algorithms based on game theory frameworks for wireless ad-hoc networks , 2004, IEEE INFOCOM 2004.

[9]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[10]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[11]  Dongwoo Kim,et al.  Rate-regulated power control for supporting flexible transmission in future CDMA mobile networks , 1999, IEEE J. Sel. Areas Commun..

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

[13]  J. Neter,et al.  Applied Linear Regression Models , 1983 .

[14]  Peng Wang,et al.  Communication models for throughput optimization in mesh networks , 2008, PE-WASUN '08.

[15]  Tomio Hirata,et al.  Approximation algorithms for the weighted independent set problem in sparse graphs , 2009, Discret. Appl. Math..

[16]  Rudolf Mathar,et al.  Power control, capacity, and duality of uplink and downlink in cellular CDMA systems , 2004, IEEE Transactions on Communications.

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

[18]  Steven H. Low,et al.  A duality model of TCP and queue management algorithms , 2003, TNET.

[19]  Mung Chiang.  Balancing transport and physical Layers in wireless multihop networks: jointly optimal congestion control and power control , 2005 .

[20]  Paolo Santi,et al.  Computationally efficient scheduling with the physical interference model for throughput improvement in wireless mesh networks , 2006, MobiCom '06.

[21]  Murali S. Kodialam,et al.  Two-phase routing, scheduling and power control for wireless mesh networks with variable traffic , 2007, SIGMETRICS '07.

[22]  Tomomi Matsui,et al.  Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs , 1998, JCDCG.

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

[24]  A. Subramanian,et al.  Joint rate and power control algorithms for wireless networks , 2005, IEEE Transactions on Signal Processing.

[25]  Peng Wang,et al.  On the practical complexity of solving the maximum weighted independent set problem for optimal scheduling in wireless networks , 2008, WICON.

[26]  Jean-Yves Le Boudec,et al.  When Power Adaptation is Useless or Harmful , 2004 .

[27]  Hao Yang,et al.  A Power Control MAC Protocol for Ad hoc Networks , 2008, MobiMedia.

[28]  Koichi Yamazaki,et al.  A note on greedy algorithms for the maximum weighted independent set problem , 2003, Discret. Appl. Math..

[29]  Marwan Krunz,et al.  POWMAC: a single-channel power-control protocol for throughput enhancement in wireless ad hoc networks , 2005, IEEE Journal on Selected Areas in Communications.

[30]  Ness B. Shroff,et al.  The impact of imperfect scheduling on cross-Layer congestion control in wireless networks , 2006, IEEE/ACM Transactions on Networking.

[31]  Peng Wang,et al.  Practical Computation of Optimal Schedules in Multihop Wireless Networks , 2011, IEEE/ACM Transactions on Networking.

[32]  Peng Wang,et al.  Throughput optimization of urban wireless mesh networks , 2009 .

[33]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[34]  P. R. Kumar,et al.  Power Control in Ad-Hoc Networks: Theory, Architecture, Algorithm and Implementation of the COMPOW Protocol , 2002 .

[35]  Johan Håstad,et al.  Clique is hard to approximate within n/sup 1-/spl epsiv// , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

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

[37]  Lars Engebretsen,et al.  Clique Is Hard To Approximate Within , 2000 .

[38]  Anders Hansson,et al.  Comparison between graph-based and interference-based STDMA scheduling , 2001, MobiHoc '01.

[39]  Tamer A. ElBatt,et al.  Joint scheduling and power control for wireless ad hoc networks , 2002, IEEE Transactions on Wireless Communications.

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

[41]  George J. Minty,et al.  On maximal independent sets of vertices in claw-free graphs , 1980, J. Comb. Theory, Ser. B.

[42]  Stephan Bohacek,et al.  Realistic propagation simulation of urban mesh networks , 2007, Comput. Networks.

[43]  Stephen J. Wright,et al.  Numerical Optimization , 2018, Fundamental Statistical Inference.

[44]  Peng Wang,et al.  Toward Tractable Computation of the Capacity of Multi-Hop Wireless Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[45]  Dimitri P. Bertsekas,et al.  Distributed power control algorithms for wireless networks , 2001, IEEE Trans. Veh. Technol..

[46]  Rene L. Cruz,et al.  Optimal routing, link scheduling and power control in multihop wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[47]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[48]  Lili Qiu,et al.  Impact of Interference on Multi-Hop Wireless Network Performance , 2003, MobiCom '03.

[49]  Gabriel Valiente,et al.  A New Simple Algorithm for the Maximum-Weight Independent Set Problem on Circle Graphs , 2003, ISAAC.

[50]  Sang Wu Kim,et al.  Combined rate and power adaptation in DS/CDMA communications over Nakagami fading channels , 2000, IEEE Trans. Commun..

[51]  Jang-Ping Sheu,et al.  An optimal time algorithm for finding a maximum weight independent set in a tree , 1988 .

[52]  Ness B. Shroff,et al.  A utility-based power-control scheme in wireless cellular systems , 2003, TNET.

[53]  Vadim V. Lozin,et al.  Augmenting graphs for independent sets , 2004, Discret. Appl. Math..