{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T21:16:17Z","timestamp":1768338977181,"version":"3.49.0"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2012,8,1]],"date-time":"2012-08-01T00:00:00Z","timestamp":1343779200000},"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\/ACM Trans. Networking"],"published-print":{"date-parts":[[2012,8]]},"DOI":"10.1109\/tnet.2011.2172953","type":"journal-article","created":{"date-parts":[[2011,11,3]],"date-time":"2011-11-03T13:46:08Z","timestamp":1320327968000},"page":"1112-1124","source":"Crossref","is-referenced-by-count":9,"title":["Exploring the Throughput Boundaries of Randomized Schedulers in Wireless Networks"],"prefix":"10.1109","volume":"20","author":[{"given":"Bin","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atilla","family":"Eryilmaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2011.58"},{"key":"ref11","first-page":"415","article-title":"A fast-csma algorithm for deadline-constrained scheduling over wireless fading channels","author":"li","year":"2011","journal-title":"Proc RAWNET\/WNC3"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935086"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498460"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2007.4434819"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2133130"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.2200\/S00271ED1V01Y201006CNT007"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1208724"},{"key":"ref19","first-page":"250","article-title":"Distributed CSMA\/CA algorithms for achieving maximum throughput in wireless networks","author":"ni","year":"2009","journal-title":"Proceedings of IEEE IT"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2004.842226"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/18.212277"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2009.2030681"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2010.5717965"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1561\/1300000001"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2009.2026276"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797741"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.913537"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2004.835596"},{"key":"ref1","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.1109\/CISS.2008.4558577"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1145\/1269899.1254920","article-title":"Distributed link scheduling with constant overhead","author":"sanghavi","year":"2007","journal-title":"Proc ACM SIGMETRICS"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1555349.1555365"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1090\/trans2\/207\/12","volume":"207","author":"shakkottai","year":"2002","journal-title":"American Mathematical Society Translations"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/18.21215"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/9.182479"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.665071"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/90\/6268389\/06068266.pdf?arnumber=6068266","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:52:18Z","timestamp":1633909938000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6068266\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8]]},"references-count":27,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2011.2172953","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"value":"1063-6692","type":"print"},{"value":"1558-2566","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8]]}}}