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

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 allow...

詳細記述

保存先:
書誌詳細
主要な著者: Badruddin , Nasreen, Bhaskaran, S.R., Evans, Jamie, Hanly, Stephen
フォーマット: Conference or Workshop Item
出版事項: 2008
主題:
オンライン・アクセス:http://ieeexplore.ieee.org/search/srchabstract.jsp?tp=&arnumber=4797534
http://eprints.utp.edu.my/4424/
タグ: タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
id my.utp.eprints.4424
record_format eprints
spelling my.utp.eprints.44242011-03-18T01:48:46Z Maximizing the sum rate in symmetric networks of interfering links under flat power constraints Badruddin , Nasreen Bhaskaran, S.R. Evans, Jamie Hanly, Stephen TK Electrical engineering. Electronics Nuclear engineering 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. 2008-09-26 Conference or Workshop Item PeerReviewed http://ieeexplore.ieee.org/search/srchabstract.jsp?tp=&arnumber=4797534 Badruddin , Nasreen and Bhaskaran, S.R. and Evans, Jamie and Hanly, Stephen (2008) Maximizing the sum rate in symmetric networks of interfering links under flat power constraints. In: 46th Annual Allerton Conference on Communication, Control, and Computing, 2008 , 23 - 26 Sept 2010, Urbana-Champaign, Illinois, USA. http://eprints.utp.edu.my/4424/
institution Universiti Teknologi Petronas
building UTP Resource Centre
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Petronas
content_source UTP Institutional Repository
url_provider http://eprints.utp.edu.my/
topic TK Electrical engineering. Electronics Nuclear engineering
spellingShingle TK Electrical engineering. Electronics Nuclear engineering
Badruddin , Nasreen
Bhaskaran, S.R.
Evans, Jamie
Hanly, Stephen
Maximizing the sum rate in symmetric networks of interfering links under flat power constraints
description 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.
format Conference or Workshop Item
author Badruddin , Nasreen
Bhaskaran, S.R.
Evans, Jamie
Hanly, Stephen
author_facet Badruddin , Nasreen
Bhaskaran, S.R.
Evans, Jamie
Hanly, Stephen
author_sort Badruddin , Nasreen
title Maximizing the sum rate in symmetric networks of interfering links under flat power constraints
title_short Maximizing the sum rate in symmetric networks of interfering links under flat power constraints
title_full Maximizing the sum rate in symmetric networks of interfering links under flat power constraints
title_fullStr Maximizing the sum rate in symmetric networks of interfering links under flat power constraints
title_full_unstemmed Maximizing the sum rate in symmetric networks of interfering links under flat power constraints
title_sort maximizing the sum rate in symmetric networks of interfering links under flat power constraints
publishDate 2008
url http://ieeexplore.ieee.org/search/srchabstract.jsp?tp=&arnumber=4797534
http://eprints.utp.edu.my/4424/
_version_ 1738655339239178240
score 13.251813