{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T05:57:59Z","timestamp":1730267879573,"version":"3.28.0"},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1109\/infcom.2013.6567097","type":"proceedings-article","created":{"date-parts":[[2013,8,1]],"date-time":"2013-08-01T20:12:57Z","timestamp":1375387977000},"page":"2868-2876","source":"Crossref","is-referenced-by-count":2,"title":["Stability analyses of static greedy link schedulings in MC-MR wireless networks"],"prefix":"10.1109","author":[{"given":"Peng-Jun","family":"Wan","sequence":"first","affiliation":[]},{"given":"Zhiguo","family":"Wan","sequence":"additional","affiliation":[]},{"given":"Zhu","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Xiao-Hua","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Shaojie","family":"Tang","sequence":"additional","affiliation":[]},{"given":"Xiaohua","family":"Jia","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.176"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935051"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1145\/2248371.2248381"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935308"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935215"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/9.182479"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/1530748.1530761"},{"key":"11","first-page":"1","article-title":"Ergodicity, continuity and analyticity of countable Markov chains","volume":"39","author":"malyshev","year":"1981","journal-title":"Trans Moscow Math Soc"},{"journal-title":"Basic Principles and Applications of Probability Theory","year":"2005","author":"skorokhod","key":"12"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6567014"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1177004828"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2007.1061"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.913537"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.918109"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.872546"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/1530748.1530771"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.165"},{"key":"5","article-title":"Performance limits of greedy maximal matching in multi-hop wireless networks","author":"joo","year":"2007","journal-title":"Proc IEEE CDC'07"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1239\/aap\/1151337082"},{"key":"9","first-page":"1118","article-title":"Scheduling and Routing Algorithm for Multi-Channel Ad-hoc Wireless Networks","author":"lin","year":"2009","journal-title":"Proc IEEE InfoCom"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/1530748.1530758"}],"event":{"name":"IEEE INFOCOM 2013 - IEEE Conference on Computer Communications","start":{"date-parts":[[2013,4,14]]},"location":"Turin, Italy","end":{"date-parts":[[2013,4,19]]}},"container-title":["2013 Proceedings IEEE INFOCOM"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6556116\/6566708\/06567097.pdf?arnumber=6567097","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T03:03:38Z","timestamp":1490238218000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6567097\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/infcom.2013.6567097","relation":{},"subject":[],"published":{"date-parts":[[2013,4]]}}}