Maximizing the sum rate in symmetric networks of interfering links under flat power constraints

Nasreen Badruddin*, Sibi Raj Bhaskaran, Jamie Evans, Stephen Hanly

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

4 Citations (Scopus)

Abstract

We consider the power control problem of maximizing the sum rate of a symmetric network of interfering links in Gaussian noise. We consider a static network: there is no time-varying fading and the power allocation is also mandated to be time and frequency flat. All transmitters have a maximum allowable average transmit power, the same for all transmitters. We solve this nonconvex problem by identifying some underlying convex structure, and show that the solution is either one link blasting at full power, or all links blasting at full power. We provide a characterization of the solution in terms of the level of cross-gain between the interfering links. There is a phase transition between these two states, as the cross-gain traverses a threshold.

Original languageEnglish
Title of host publication46th Annual Allerton Conference on Communication, Control, and Computing
Place of PublicationPiscataway, NJ
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages46-53
Number of pages8
ISBN (Electronic)9781424429264
ISBN (Print)9781424429264
DOIs
Publication statusPublished - 2008
Externally publishedYes
Event46th Annual Allerton Conference on Communication, Control, and Computing - Monticello, IL, United States
Duration: 24 Sept 200826 Sept 2008

Other

Other46th Annual Allerton Conference on Communication, Control, and Computing
Country/TerritoryUnited States
CityMonticello, IL
Period24/09/0826/09/08

Fingerprint

Dive into the research topics of 'Maximizing the sum rate in symmetric networks of interfering links under flat power constraints'. Together they form a unique fingerprint.

Cite this