{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T14:54:40Z","timestamp":1761663280107,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1109\/infocom.2014.6848199","type":"proceedings-article","created":{"date-parts":[[2014,7,29]],"date-time":"2014-07-29T11:18:13Z","timestamp":1406632693000},"page":"2526-2534","source":"Crossref","is-referenced-by-count":6,"title":["Optimal CSMA-based wireless communication with worst-case delay and non-uniform sizes"],"prefix":"10.1109","author":[{"given":"Hongxing","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nitin","family":"Vaidya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/9.182479"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503219"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033988"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462229"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1145\/1811039.1811093"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.2200\/S00271ED1V01Y201006CNT007"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5934971"},{"journal-title":"Maximizing utility via random access without message passing","year":"2008","author":"liu","key":"11"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935124"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2010.5454123"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935185"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6567067"},{"key":"10","doi-asserted-by":"crossref","first-page":"1452","DOI":"10.1109\/JSAC.2006.879351","article-title":"A tutorial on cross-layer optimization in wireless networks","volume":"24","author":"lin","year":"2006","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284006"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284005"},{"key":"5","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1109\/TNET.2009.2035046","article-title":"A distributed csma algorithm for throughput and utility maximization in wireless networks","volume":"18","author":"jiang","year":"2010","journal-title":"ACM\/IEEE Transactions on Networking"},{"journal-title":"Convergence Analysis of a Distributed CSMA Algorithm for Maximal Throughput in a General Class of Networks","year":"2008","author":"jiang","key":"4"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848199"},{"key":"8","article-title":"A fast-csma algorithm for deadline-constrained scheduling over wireless fading channels","author":"li","year":"2011","journal-title":"Proc of RAWNET'11"}],"event":{"name":"IEEE INFOCOM 2014 - IEEE Conference on Computer Communications","start":{"date-parts":[[2014,4,27]]},"location":"Toronto, ON, Canada","end":{"date-parts":[[2014,5,2]]}},"container-title":["IEEE INFOCOM 2014 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6839150\/6847911\/06848199.pdf?arnumber=6848199","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T13:29:46Z","timestamp":1498138186000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6848199\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/infocom.2014.6848199","relation":{},"subject":[],"published":{"date-parts":[[2014,4]]}}}