Provided by: University of Veszprem
Date Added: May 2012
Maximizing the sum rate of a wireless network with multiple interfering links is an important and challenging problem in communication systems. This difficult non-convex problem has been approached from both an algorithmic perspective to achieve global optimality (e.g., using d.c. programming) and a relaxation perspective to obtain approximate solutions (e.g., high signal-to-noise-ratio approximation, binary power control, network symmetry, game-theoretic reformulation, etc.). It is generally agreed that the global algorithms suffer from scalability issues and are more appropriate for problems of small instances; and the solutions obtained based on maximizing the instantaneous performance are most likely suboptimal in practical fading wireless networks.