{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:01Z","timestamp":1761611281911},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2011,6,1]],"date-time":"2011-06-01T00:00:00Z","timestamp":1306886400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1109\/tit.2011.2133130","type":"journal-article","created":{"date-parts":[[2011,5,25]],"date-time":"2011-05-25T17:48:10Z","timestamp":1306345690000},"page":"3644-3676","source":"Crossref","is-referenced-by-count":10,"title":["Asynchronous CSMA Policies in Multihop Wireless Networks With Primary Interference Constraints"],"prefix":"10.1109","volume":"57","author":[{"given":"Peter","family":"Marbach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atilla","family":"Eryilmaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Asu","family":"Ozdaglar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.879365"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/9.182479"},{"key":"ref33","author":"shah","year":"2008","journal-title":"Reversible Networks Distributed Optimization and Network Scheduling What do They Have in Common?"},{"key":"ref32","article-title":"Stable algorithms for input queued switches","author":"shah","year":"2001","journal-title":"Proc Allerton Conf Control Communications and Computing"},{"key":"ref31","first-page":"910","article-title":"Link scheduling in polynomial time","volume":"32","author":"sasaki","year":"1988","journal-title":"IEEE Trans Inf Theory"},{"key":"ref30","author":"sanghavi","year":"2006","journal-title":"Distributed link scheduling with constant overhead"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.665071"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/18.568722"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1239\/jap\/1214950349"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1090\/trans2\/207\/12"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1117\/12.434468"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2004.842226"},{"key":"ref40","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 Decision and Control"},{"key":"ref12","author":"gallager","year":"1995","journal-title":"Discrete Stochastic Processes"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2003.810496"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.191"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.825799"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2006.286657"},{"key":"ref17","article-title":"Bounds on the accuracy of the reduced-load blocking formula for some simple circuit-switched networks","author":"hajek","year":"1990","journal-title":"Proc Int Conf New Trends in Communication Control and Signal Processing"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797741"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.165"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1987.1096769"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2008.4558579"},{"key":"ref3","author":"bertsekas","year":"1990","journal-title":"Data Networks"},{"key":"ref27","author":"ni","year":"2009","journal-title":"Distributed CSMA\/CA Algorithms for Achieving Maximum Throughput in Wireless Networks"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.210"},{"key":"ref5","author":"bordenave","year":"2008","journal-title":"Performance of Random Medium AccessAn Asymptotic Approach"},{"key":"ref29","author":"rajagopalan","year":"2008","journal-title":"Aloha That Works"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.65"},{"key":"ref7","article-title":"Throughput guarantees through maximal scheduling in wireless networks","author":"chaporkar","year":"2005","journal-title":"Proc Allerton Conf Control Communications and Computing"},{"key":"ref2","author":"bertsekas","year":"1995","journal-title":"Nonlinear Programming"},{"key":"ref9","article-title":"Distributed cross-layer algorithms for the optimal control of multi-hop wireless networks","author":"eryilmaz","year":"2008","journal-title":"IEEE\/ACM Trans Netw"},{"key":"ref1","author":"andrews","year":"2000","journal-title":"Scheduling in a Queueing System with Asynchronously Varying Service Rates"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1177005872"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2004.1428895"},{"key":"ref21","article-title":"The impact of imperfect scheduling on cross-layer rate control in multihop wireless networks","author":"lin","year":"2005","journal-title":"Proc IEEE InfoCom"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2007.1061"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2006.286387"},{"key":"ref41","article-title":"Bounds on the capacity region of multi-hop wireless networks under distributedgreedy scheduling","author":"wu","year":"2006","journal-title":"Proc IEEE InfoCom"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.273"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1208724"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1140277.1140283"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5773004\/05773039.pdf?arnumber=5773039","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,23]],"date-time":"2021-12-23T14:05:15Z","timestamp":1640268315000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5773039\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6]]},"references-count":42,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2011.2133130","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6]]}}}