Weighted sum-rate maximization for MISO downlink cellular networks via branch and bound

The problem of weighted sum-rate maximization (WSRMax) in multicell downlink multi-input single-output (MISO) systems is considered. The problem is known to be NP-hard. We propose a solution method, based on branch and bound technique, which solves globally the nonconvex WSRMax problem with an optimality certificate. Specifically, the algorithm computes a sequence of asymptotically tight upper and lower bounds and it terminates when the difference between the upper and lower bound is smaller than a pre-specified tolerance. Novel bounding techniques via conic optimization are introduced and their efficiency is demonstrated via numerical simulations. The proposed method can be used to provide performance benchmarks by back-substituting it into many existing network design problems which relies on solving WSRMax problem. The method proposed here is not restricted to WSRMax; it can also be used to maximize any system performance metric that can be expressed as a Lipschitz continuous and increasing function of signal-to-interference-plus-noise ratio.

[1]  Zhi-Quan Luo,et al.  Dynamic Spectrum Management: Complexity and Duality , 2008, IEEE Journal of Selected Topics in Signal Processing.

[2]  Ness B. Shroff,et al.  On the Complexity of Scheduling in Wireless Networks , 2010, EURASIP J. Wirel. Commun. Netw..

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

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

[5]  Marian Codreanu,et al.  Multidimensional adaptive radio links for broadband communications , 2007 .

[6]  Matti Latva-aho,et al.  Weighted sum-rate maximization for a set of interfering links via branch and bound , 2010, 2010 Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers.

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

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

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

[10]  Anthony Ephremides,et al.  Wireless networking , 1997, Proceedings Second IEEE Symposium on Computer and Communications.

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

[12]  Eytan Modiano,et al.  Power allocation and routing in multibeam satellites with time-varying channels , 2003, TNET.

[13]  Ami Wiesel,et al.  Linear precoding via conic optimization for fixed MIMO receivers , 2006, IEEE Transactions on Signal Processing.

[14]  Stephen P. Boyd,et al.  Branch and Bound Methods , 1987 .

[15]  Stephen P. Boyd,et al.  Branch and bound algorithm for computing the minimum stability degree of parameter-dependent linear systems , 1991, International Journal of Robust and Nonlinear Control.

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