Fast Algorithms and Performance Bounds for Sum Rate Maximization in Wireless Networks

In this paper, we consider a wireless network where interference is treated as noise, and we study the nonconvex problem of sum rate maximization by power control. We focus on finding approximately optimal solutions that can be efficiently computed to this NP-hard problem by studying the solutions t...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE/ACM transactions on networking Vol. 21; no. 3; pp. 706 - 719
Main Authors:	Chee Wei Tan, Mung Chiang, Srikant, R.
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.06.2013 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Approximation algorithms Approximation methods Distributed optimization duality Interference Iterative methods nonnegative matrix theory Operations research Optimization Power control Studies Vectors Wireless networks
ISSN:	1063-6692, 1558-2566
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	In this paper, we consider a wireless network where interference is treated as noise, and we study the nonconvex problem of sum rate maximization by power control. We focus on finding approximately optimal solutions that can be efficiently computed to this NP-hard problem by studying the solutions to two related problems, the sum rate maximization using a signal-to-interference-plus-noise ratio ( SINR ) approximation and the max-min weighted SINR optimization. We show that these two problems are intimately connected, can be solved efficiently by algorithms with fast convergence and minimal parameter configuration, and can yield high-quality approximately optimal solutions to sum rate maximization in the low interference regime. As an application of these results, we analyze the connection-level stability of cross-layer utility maximization in the wireless network, where users arrive and depart randomly and are subject to congestion control, and the queue service rates at all the links are determined by the sum rate maximization problem. In particular, we determine the stability region when all the links solve the max-min weighted SINR problem, using instantaneous queue sizes as weights.
AbstractList	In this paper, we consider a wireless network where interference is treated as noise, and we study the nonconvex problem of sum rate maximization by power control. We focus on finding approximately optimal solutions that can be efficiently computed to this NP-hard problem by studying the solutions to two related problems, the sum rate maximization using a signal-to-interference-plus-noise ratio ( SINR ) approximation and the max-min weighted SINR optimization. We show that these two problems are intimately connected, can be solved efficiently by algorithms with fast convergence and minimal parameter configuration, and can yield high-quality approximately optimal solutions to sum rate maximization in the low interference regime. As an application of these results, we analyze the connection-level stability of cross-layer utility maximization in the wireless network, where users arrive and depart randomly and are subject to congestion control, and the queue service rates at all the links are determined by the sum rate maximization problem. In particular, we determine the stability region when all the links solve the max-min weighted SINR problem, using instantaneous queue sizes as weights. In this paper, we consider a wireless network where interference is treated as noise, and we study the nonconvex problem of sum rate maximization by power control. We focus on finding approximately optimal solutions that can be efficiently computed to this NP-hard problem by studying the solutions to two related problems, the sum rate maximization using a signal-to-interference-plus-noise ratio ([Formula Omitted]) approximation and the max-min weighted [Formula Omitted] optimization. We show that these two problems are intimately connected, can be solved efficiently by algorithms with fast convergence and minimal parameter configuration, and can yield high-quality approximately optimal solutions to sum rate maximization in the low interference regime. As an application of these results, we analyze the connection-level stability of cross-layer utility maximization in the wireless network, where users arrive and depart randomly and are subject to congestion control, and the queue service rates at all the links are determined by the sum rate maximization problem. In particular, we determine the stability region when all the links solve the max-min weighted [Formula Omitted] problem, using instantaneous queue sizes as weights.
Author	Srikant, R. Chee Wei Tan Mung Chiang
Author_xml	– sequence: 1 surname: Chee Wei Tan fullname: Chee Wei Tan email: cheewtan@cityu.edu.hk organization: Dept. of Comput. Sci., City Univ. of Hong Kong, Hong Kong, China – sequence: 2 surname: Mung Chiang fullname: Mung Chiang email: chiangm@princeton.edu organization: Dept. of Electr. Eng., Princeton Univ., Princeton, NJ, USA – sequence: 3 givenname: R. surname: Srikant fullname: Srikant, R. email: rsrikant@illinois.edu organization: Dept. of Electr. & Comput. Eng., Univ. of Illinois at Urbana-Champaign, Urbana, IL, USA
BookMark	eNp9kMlOwzAURSNUJNrCByA2llineIidZFmqMkilIChiGbnJM7gkcbEdMXw9Lq1YsGD1Bt37hjOIeq1pIYqOCR4RgvOzxXy6GFFM6IhSgmmC96I-4TyLKReiF3IsWCxETg-igXMrjAnDVPSjxwvpPBrXz8Zq_9I4JNsK3YFVxjayLQGdm66tHAo1eugadC89oBv5oRv9Jb02LdItetIWanAOzcG_G_vqDqN9JWsHR7s4DHumi8lVPLu9vJ6MZ3HJeO5jwAoqnnOZlEkKIASvYJklbMkJ5IplqlS4WqrwATBQNK0kD_2SJynJQeYpG0an27lra946cL5Ymc62YWVBWIoZIwnLgirdqkprnLOgilL7n-O9lbouCC42DIsNw2LDsNgxDE7yx7m2upH281_PydajAeBXLyhPOc7ZNx3ef8k
CODEN	IEANEP
CitedBy_id	crossref_primary_10_1109_TNET_2017_2648878 crossref_primary_10_1109_JSAC_2014_2361079 crossref_primary_10_1109_TCOMM_2016_2623719 crossref_primary_10_1109_ACCESS_2020_2988042 crossref_primary_10_1109_TVT_2023_3319696 crossref_primary_10_1016_j_phycom_2021_101311 crossref_primary_10_1109_LSP_2017_2715501 crossref_primary_10_1109_LCOMM_2017_2774259 crossref_primary_10_1109_TVT_2019_2919289 crossref_primary_10_1109_TMC_2017_2698469 crossref_primary_10_1049_iet_com_2019_0665 crossref_primary_10_1109_TCOMM_2021_3087620 crossref_primary_10_1109_TNET_2019_2943561 crossref_primary_10_1109_TCOMM_2021_3102623 crossref_primary_10_1109_TVT_2018_2864704 crossref_primary_10_1109_TNET_2015_2404932 crossref_primary_10_1109_ACCESS_2023_3340250 crossref_primary_10_1109_JIOT_2019_2954604 crossref_primary_10_1109_TWC_2016_2604802 crossref_primary_10_1109_TWC_2023_3249165 crossref_primary_10_1109_TIT_2015_2408342 crossref_primary_10_1109_TCYB_2015_2489702 crossref_primary_10_1109_ACCESS_2019_2944457 crossref_primary_10_1109_ACCESS_2015_2464352 crossref_primary_10_1109_ACCESS_2021_3061711 crossref_primary_10_3390_electronics7110274 crossref_primary_10_1049_iet_com_2015_0812 crossref_primary_10_1109_TVT_2017_2768574 crossref_primary_10_1186_1687_1499_2013_268 crossref_primary_10_1371_journal_pone_0329674 crossref_primary_10_1109_TCOMM_2019_2943158 crossref_primary_10_1109_ACCESS_2017_2780818 crossref_primary_10_1016_j_comcom_2018_07_018 crossref_primary_10_1109_ACCESS_2019_2912633 crossref_primary_10_1109_TCOMM_2014_012614_130953 crossref_primary_10_1002_ett_3428 crossref_primary_10_1016_j_adhoc_2025_103986 crossref_primary_10_1049_iet_spr_2018_5135 crossref_primary_10_1109_TIT_2016_2615183 crossref_primary_10_1109_JIOT_2022_3169276 crossref_primary_10_1016_j_phycom_2018_04_009 crossref_primary_10_1109_TWC_2014_022014_122024 crossref_primary_10_1109_TWC_2013_020714_130980 crossref_primary_10_1109_JSAC_2014_140324 crossref_primary_10_1016_j_phycom_2019_100853 crossref_primary_10_1109_COMST_2016_2618870 crossref_primary_10_1080_00207217_2019_1582705 crossref_primary_10_1109_TVT_2015_2462117 crossref_primary_10_1109_TW_2013_081413_121418 crossref_primary_10_3390_fi17060255 crossref_primary_10_1109_TIT_2021_3064925 crossref_primary_10_1109_LCOMM_2018_2808182 crossref_primary_10_1109_TWC_2016_2627045 crossref_primary_10_1109_TAC_2021_3077516 crossref_primary_10_1109_JIOT_2018_2853661 crossref_primary_10_1109_TCOMM_2016_2549535 crossref_primary_10_1109_TIT_2016_2582818
Cites_doi	10.1016/S0362-546X(01)00281-4 10.1109/TIT.2008.920213 10.1109/49.414651 10.1109/TWC.2007.05960 10.1007/b98874 10.1109/JSAC.2006.879347 10.1017/CBO9780511804441 10.1016/j.laa.2005.02.036 10.1109/TIT.2010.2046232 10.1109/JSAC.2006.879361 10.1109/JPROC.2007.907125 10.1109/TSP.2011.2165065 10.1109/TNET.2006.890108 10.1109/JSTSP.2007.914876 10.1561/1300000009 10.1109/25.260747 10.1109/CISS.2006.286519 10.1215/S0012-7094-75-04244-1 10.1109/INFCOM.2009.5062050 10.1109/TNET.2006.872546 10.1109/JSAC.2006.879351 10.1109/JSAC.2004.837347(410) 23 10.1109/TIT.2011.2168897 10.1109/TIT.2006.890791 10.1109/JSAC.2011.110214 10.1109/TNET.2009.2030681 10.1109/25.155977 10.1109/90.811451
ContentType	Journal Article
Copyright	Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jun 2013
Copyright_xml	– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jun 2013
DBID	97E RIA RIE AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D
DOI	10.1109/TNET.2012.2210240
DatabaseName	IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional
DatabaseTitle	CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional
DatabaseTitleList	Technology Research Database
Database_xml	– sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering
EISSN	1558-2566
EndPage	719
ExternalDocumentID	3001842421 10_1109_TNET_2012_2210240 6257509
Genre	orig-research
GroupedDBID	-DZ -~X .DC 0R~ 29I 4.4 5GY 5VS 6IK 85S 8US 97E 9M8 AAJGR AAKMM AALFJ AARMG AASAJ AAWTH AAWTV ABAZT ABPPZ ABQJQ ABVLG ACGFS ACGOD ACIWK ACM ADBCU ADL AEBYY AEFXT AEJOY AENSD AETEA AETIX AFWIH AFWXC AGQYO AGSQL AHBIQ AI. AIBXA AIKLT AKJIK AKQYR AKRVB ALLEH ALMA_UNASSIGNED_HOLDINGS ATWAV BDXCO BEFXN BFFAM BGNUA BKEBE BPEOZ CCLIF CS3 D0L EBS EJD FEDTE GUFHI HF~ HGAVV HZ~ H~9 I07 ICLAB IEDLZ IES IFIPE IFJZH IPLJI JAVBF LAI LHSKQ M43 MVM O9- OCL P1C P2P PQQKQ RIA RIE RNS ROL TN5 UPT UQL VH1 XOL YR2 ZCA AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D
ID	FETCH-LOGICAL-c359t-e0fed595a4c47ee665deb843b51e9f38fcf0dbf566e3ef27da5e9fc54719ea973
IEDL.DBID	RIE
ISICitedReferencesCount	76
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000320605900003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1063-6692
IngestDate	Sun Nov 09 06:38:49 EST 2025 Tue Nov 18 19:58:24 EST 2025 Sat Nov 29 03:05:17 EST 2025 Tue Aug 26 16:47:26 EDT 2025
IsPeerReviewed	true
IsScholarly	true
Issue	3
Language	English
License	https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c359t-e0fed595a4c47ee665deb843b51e9f38fcf0dbf566e3ef27da5e9fc54719ea973
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
PQID	1370331438
PQPubID	32020
PageCount	14
ParticipantIDs	crossref_primary_10_1109_TNET_2012_2210240 crossref_citationtrail_10_1109_TNET_2012_2210240 ieee_primary_6257509 proquest_journals_1370331438
PublicationCentury	2000
PublicationDate	2013-06-01
PublicationDateYYYYMMDD	2013-06-01
PublicationDate_xml	– month: 06 year: 2013 text: 2013-06-01 day: 01
PublicationDecade	2010
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	IEEE/ACM transactions on networking
PublicationTitleAbbrev	TNET
PublicationYear	2013
Publisher	IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml	– name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References	ref13 ref12 ref15 ref14 ref31 ref30 bertsekas (ref23) 2003 ref11 ref32 ref10 seneta (ref33) 2006 ref2 ref1 ref17 ref16 wong (ref27) 1954 ref18 berman (ref19) 1979 luo (ref9) 2008; 2 ref24 ref26 ref25 ref20 ref22 ref21 ref28 ref29 ref8 ref4 ref3 ref6 ref5 charafeddine (ref7) 2007
References_xml	– ident: ref32 doi: 10.1016/S0362-546X(01)00281-4 – ident: ref15 doi: 10.1109/TIT.2008.920213 – ident: ref21 doi: 10.1109/49.414651 – ident: ref3 doi: 10.1109/TWC.2007.05960 – ident: ref29 doi: 10.1007/b98874 – ident: ref6 doi: 10.1109/JSAC.2006.879347 – ident: ref22 doi: 10.1017/CBO9780511804441 – ident: ref31 doi: 10.1016/j.laa.2005.02.036 – ident: ref11 doi: 10.1109/TIT.2010.2046232 – ident: ref16 doi: 10.1109/JSAC.2006.879361 – ident: ref5 doi: 10.1109/JPROC.2007.907125 – ident: ref26 doi: 10.1109/TSP.2011.2165065 – ident: ref10 doi: 10.1109/TNET.2006.890108 – volume: 2 start-page: 57 year: 2008 ident: ref9 article-title: Dynamic spectrum management: Complexity and duality publication-title: IEEE J Sel Topics Signal Proc doi: 10.1109/JSTSP.2007.914876 – ident: ref2 doi: 10.1561/1300000009 – ident: ref25 doi: 10.1109/25.260747 – year: 2007 ident: ref7 article-title: Rate region frontiers for <tex Notation="TeX">$n$</tex>-user interference channel with interference as noise publication-title: Proc 45th Allerton – ident: ref4 doi: 10.1109/CISS.2006.286519 – ident: ref30 doi: 10.1215/S0012-7094-75-04244-1 – year: 1979 ident: ref19 publication-title: Nonnegative Matrices in the Mathematical Sciences – start-page: 283 year: 1954 ident: ref27 publication-title: Chapter in Economic Activity Analysis – ident: ref1 doi: 10.1109/INFCOM.2009.5062050 – ident: ref14 doi: 10.1109/TNET.2006.872546 – ident: ref13 doi: 10.1109/JSAC.2006.879351 – year: 2006 ident: ref33 publication-title: Nonnegative matrices and Markov chains – ident: ref8 doi: 10.1109/JSAC.2004.837347(410) 23 – ident: ref18 doi: 10.1109/TIT.2011.2168897 – ident: ref20 doi: 10.1109/TIT.2006.890791 – ident: ref12 doi: 10.1109/JSAC.2011.110214 – ident: ref17 doi: 10.1109/TNET.2009.2030681 – ident: ref24 doi: 10.1109/25.155977 – ident: ref28 doi: 10.1109/90.811451 – year: 2003 ident: ref23 publication-title: Nonlinear Programming
SSID	ssj0013026
Score	2.3869236
Snippet	In this paper, we consider a wireless network where interference is treated as noise, and we study the nonconvex problem of sum rate maximization by power...
SourceID	proquest crossref ieee
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	706
SubjectTerms	Algorithms Approximation algorithms Approximation methods Distributed optimization duality Interference Iterative methods nonnegative matrix theory Operations research Optimization Power control Studies Vectors Wireless networks
Title	Fast Algorithms and Performance Bounds for Sum Rate Maximization in Wireless Networks
URI	https://ieeexplore.ieee.org/document/6257509 https://www.proquest.com/docview/1370331438
Volume	21
WOSCitedRecordID	wos000320605900003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1558-2566 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0013026 issn: 1063-6692 databaseCode: RIE dateStart: 19930101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NS8MwFA_b8KAHv6Y4nZKDJ7Fb2qRpc5zi8GIZOmG3kqUvOtg6WTvxzzdpuw9QBG9tySvlvfR95H38ELpmHHTCQ-VIRpnDlNGDElToWF-bBoEmNNEF2EQQReFoJAY1dLvuhQGAovgMOvayyOUnc7W0R2VdQ28NXB3Vg4CXvVqbjAEpoNVMhEMdzoVXZTBdIrrD6GFoi7i8jmcDHHvOsWWDClCVH5q4MC_9g_992CHar9xI3CvlfoRqkB6jva3hgk302pdZjnvTt7mJ_99nGZZpggebPgF8ZxGVMmzu8ctyhp-N14mf5NdkVrVm4kmKbXHs1ChDHJXl4tmJee_D8P7RqUAUHEV9kTtANCS-8CVTLADg3E9gHDI69l0QmoZaaZKMtfHqgIL2gkT65rnyjdESIEVAT1EjnadwhrBxDqXLJQULbjR2tXA1C63LqTgAAdZCZMXWWFUTxi3QxTQuIg0iYiuJ2EoiriTRQjdrko9yvMZfi5uW9euFFddbqL2SXVz9gFnsUqPKqMV2P_-d6gLteiWyhUPcNmrkiyVcoh31mU-yxVWxt74ByGvMMA
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEB58gXrwLVar7sGTGN1kN489qlQUNRSt0FvYbma10KbSpOLPdzeJVVAEb0nYCWFmM4-dxwdwxAPUaRApR3LGHa6MHpSoIsf62iwMNWWpLsEmwjiOul3RnoGTaS8MIpbFZ3hqL8tcfjpSE3tUdmborYGbhXmfc49W3VpfOQNagquZGIc5QSC8OofpUnHWiVsdW8blnXo2xLEnHd-sUAmr8kMXlwbmavV_n7YGK7UjSc4rya_DDGYbsPxtvOAmPF3JvCDng-fRuF-8DHMis5S0vzoFyIXFVMqJuSePkyF5MH4nuZfv_WHdnEn6GbHlsQOjDklcFYznW-a9rc7ltVPDKDiK-aJwkGpMfeFLrniIGAR-ir2Is57votAs0krTtKeNX4cMtRem0jfPlW_MlkApQrYNc9kowx0gxj2UbiAZWnijnquFq3lknU4VIFLkDaCfbE1UPWPcQl0MkjLWoCKxkkisJJJaEg04npK8VgM2_lq8aVk_XVhzvQHNT9kl9S-YJy4zyoxZdPfd36kOYfG6c3-X3N3Et3uw5FU4Fw51mzBXjCe4Dwvqrejn44Nyn30AkRbPdw
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Fast+Algorithms+and+Performance+Bounds+for+Sum+Rate+Maximization+in+Wireless+Networks&rft.jtitle=IEEE%2FACM+transactions+on+networking&rft.au=Tan%2C+Chee+Wei&rft.au=Chiang%2C+Mung&rft.au=Srikant%2C+R&rft.date=2013-06-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=1063-6692&rft.eissn=1558-2566&rft.volume=21&rft.issue=3&rft.spage=706&rft_id=info:doi/10.1109%2FTNET.2012.2210240&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=3001842421
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1063-6692&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1063-6692&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1063-6692&client=summon