Optimal max-min fairness rate control in wireless networks: Perron-Frobenius characterization and algorithms

Rate adaptation and power control are two key resource allocation mechanisms in multiuser wireless networks. In the presence of interference, how do we jointly optimize end-to-end source rates and link powers to achieve weighted max-min rate fairness for all sources in the network? This optimization problem is hard to solve as physical layer link rate functions are nonlinear, nonconvex, and coupled in the transmit powers. We show that the weighted max-min rate fairness problem can, in fact, be decoupled into separate fairness problems for flow rate and power control. For a large class of physical layer link rate functions, we characterize the optimal solution analytically by a nonlinear Perron-Frobenius theory (through solving a conditional eigenvalue problem) that captures the interaction of multiuser interference. We give an iterative algorithm to compute the optimal flow rate that converges geometrically fast without any parameter configuration. Numerical results show that our iterative algorithm is computationally fast for both the Shannon capacity, CDMA, and piecewise linear link rate functions.

[1]  Jean-Yves Le Boudec,et al.  Rate performance objectives of multihop wireless networks , 2004, IEEE INFOCOM 2004.

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

[3]  Seong-Jun Oh,et al.  Optimal resource allocation for data service in CDMA reverse link , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[4]  E. Seneta.  Non-negative Matrices and Markov Chains , 2008 .

[5]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[6]  Daniel Pérez Palomar,et al.  Power Control By Geometric Programming , 2007, IEEE Transactions on Wireless Communications.

[7]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[8]  Valerie Isham,et al.  Non‐Negative Matrices and Markov Chains , 1983 .

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

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

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

[12]  Ramesh Govindan,et al.  Interference-aware fair rate control in wireless sensor networks , 2006, SIGCOMM 2006.

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

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

[15]  U. Krause.  Concave Perron–Frobenius Theory and applications , 2001 .

[16]  Candice King,et al.  Fundamentals of wireless communications , 2013, 2013 IEEE Rural Electric Power Conference (REPC).

[17]  Leandros Tassiulas,et al.  Maxmin fair scheduling in wireless networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[18]  Nicholas F. Maxemchuk,et al.  Scalable max-min fairness in wireless ad hoc networks , 2011, Ad Hoc Networks.

[19]  Peter Marbach,et al.  Priority service and max-min fairness , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[20]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[21]  R. Nussbaum.  Hilbert's Projective Metric and Iterated Nonlinear Maps , 1988 .