{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T23:01:58Z","timestamp":1705014118769},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2016,4,1]],"date-time":"2016-04-01T00:00:00Z","timestamp":1459468800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"National Nature Science Foundation of China (NSFC)","award":["61401249","61322111","61321061"],"award-info":[{"award-number":["61401249","61322111","61321061"]}]},{"name":"Doctoral Program of Higher Education (SRFDP)","award":["20130002120001"],"award-info":[{"award-number":["20130002120001"]}]},{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"crossref","award":["2013CB336600"],"award-info":[{"award-number":["2013CB336600"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Wireless Commun."],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1109\/twc.2015.2512984","type":"journal-article","created":{"date-parts":[[2015,12,29]],"date-time":"2015-12-29T23:19:23Z","timestamp":1451431163000},"page":"2925-2939","source":"Crossref","is-referenced-by-count":9,"title":["Distributed WRBG Matching Approach for Multiflow Two-Way D2D Networks"],"prefix":"10.1109","volume":"15","author":[{"given":"Bo","family":"Bai","sequence":"first","affiliation":[]},{"given":"Wei","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Khaled B.","family":"Letaief","sequence":"additional","affiliation":[]},{"given":"Zhigang","family":"Cao","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813498"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/18.720551"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139030687"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2007.070213"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.04.080478"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.22"},{"key":"ref35","author":"lov\u00e1sz","year":"1986","journal-title":"Matching Theory"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2014.2363092"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2014.2360202"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2012.2237557"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2010.05.090102"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2011.071111.100199"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2011.102011.100277"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2013.061713.121956"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2014.6952079"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/MAPE.2013.6689974"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.923722"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1002\/0471200697"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2008.5074679"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807213"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-8193-5"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.071013.120787"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2010.02.090336"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2011.100611.101684"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2012.6163598"},{"key":"ref7","first-page":"140","article-title":"Interference-aware graph based resource sharing for device-to-device communications underlaying cellular networks","author":"zhang","year":"0","journal-title":"Proc IEEE Wireless Commun Netw Conf"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2014.2319555"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2012.6503671"},{"key":"ref1","article-title":"Feasibility study for proximity services (ProSe)","year":"2013"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2227454"},{"key":"ref22","year":"2009"},{"key":"ref21","article-title":"Evolved universal terrestrial radio access: Physical channels and modulation (R9)","year":"2009"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/BF01192719"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.915695"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548303005819"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1214\/ECP.v14-1475","article-title":"An easy proof of the $\\zeta$ (2)\ufffdlimit in the random assignment problem","volume":"14","author":"w\u00e4stlund","year":"2009","journal-title":"Electron Commun Probab"}],"container-title":["IEEE Transactions on Wireless Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7693\/7448989\/7368206.pdf?arnumber=7368206","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T02:34:20Z","timestamp":1633919660000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7368206\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4]]},"references-count":37,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/twc.2015.2512984","relation":{},"ISSN":["1536-1276"],"issn-type":[{"value":"1536-1276","type":"print"}],"subject":[],"published":{"date-parts":[[2016,4]]}}}