{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:21:29Z","timestamp":1740133289685,"version":"3.37.3"},"reference-count":22,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2010,8,1]],"date-time":"2010-08-01T00:00:00Z","timestamp":1280620800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["DAAD19-03-1-0229"],"award-info":[{"award-number":["DAAD19-03-1-0229"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCR-0313183"],"award-info":[{"award-number":["CCR-0313183"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2010,8]]},"abstract":"<jats:p>The maximum differential backlog (MDB), or &amp;#x201C;backpressure&amp;#x201D; control policy of Tassiulas and Ephremides has been shown to adaptively maximize the stable throughput of multihop wireless networks with random traffic arrivals and queueing. The practical implementation of the MDB policy in wireless networks with mutually interfering links, however, requires the development of distributed optimization algorithms. Within the context of code-division multiple-access (CDMA)-based multihop wireless networks, we develop a set of node-based scaled gradient projection power control algorithms which solves the MDB optimization problem based on the high-signal-to-interference-plus-noise ratio (SINR) approximation of link capacities using low communication overhead. We investigate the impact of the high-SINR approximation and the nonnegligible convergence time required by the power control algorithms on the throughput region achievable by the iterative MDB policy. We show that the policy can achieve at least the stability region induced by the high-SINR capacity region.<\/jats:p>","DOI":"10.1109\/tnet.2009.2035919","type":"journal-article","created":{"date-parts":[[2009,12,2]],"date-time":"2009-12-02T21:00:17Z","timestamp":1259787617000},"page":"1054-1066","source":"Crossref","is-referenced-by-count":16,"title":["Throughput Optimal Distributed Power Control of Stochastic Wireless Networks"],"prefix":"10.1109","volume":"18","author":[{"given":"Yufang","family":"Xi","sequence":"first","affiliation":[]},{"given":"Edmund M.","family":"Yeh","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1140277.1140283"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498460"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1497924"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/WIOPT.2006.1666478"},{"journal-title":"Fundamentals of Wireless Communication","year":"2004","author":"tse","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2003.1204141"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354673"},{"journal-title":"Distributed resource allocation in communication networks","year":"2008","author":"xi","key":"ref17"},{"journal-title":"Nonlinear Programming","year":"1999","author":"bertsekas","key":"ref18"},{"key":"ref19","article-title":"tradeoffs in delay guarantees and computation complexity for <formula formulatype=\"inline\"><tex notation=\"tex\">$n \\times n$<\/tex><\/formula> packet switches","author":"neely","year":"2002","journal-title":"Proc Conf Inf Sci Syst"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498459"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2004.837349"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.913537"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.665071"},{"key":"ref8","first-page":"5342","article-title":"regulated maximal matching: a distributed scheduling algorithm for multi-hop wireless networks with node-exclusive spectrum sharing","author":"wu","year":"2005","journal-title":"Proc IEEE Conf Dec Contr"},{"key":"ref7","article-title":"queue-length stability of maximal greedy schedules in wireless networks","author":"wu","year":"2006","journal-title":"Proc Workshop Inf Theory Appl"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1208724"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/9.182479"},{"key":"ref9","first-page":"1","article-title":"joint asynchronous congestion control and distributed scheduling for multi-hop wireless networks","author":"bui","year":"2006","journal-title":"Proc IEEE InfoCom"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.2307\/1427922"},{"journal-title":"Convexity","year":"1977","author":"eggleston","key":"ref22"},{"journal-title":"Applied Probability and Queues","year":"1987","author":"asmussen","key":"ref21"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/iel5\/90\/5550304\/05342466.pdf?arnumber=5342466","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/90\/5550304\/05342466.pdf?arnumber=5342466","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T01:00:35Z","timestamp":1633914035000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5342466\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,8]]}},"URL":"https:\/\/doi.org\/10.1109\/tnet.2009.2035919","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"type":"print","value":"1063-6692"},{"type":"electronic","value":"1558-2566"}],"subject":[],"published":{"date-parts":[[2010,8]]}}}