{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T00:58:42Z","timestamp":1648688322139},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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. Commun."],"published-print":{"date-parts":[[2017]]},"DOI":"10.1109\/tcomm.2017.2724028","type":"journal-article","created":{"date-parts":[[2017,7,7]],"date-time":"2017-07-07T18:30:16Z","timestamp":1499452216000},"page":"1-1","source":"Crossref","is-referenced-by-count":3,"title":["Semi-Distributed Spectrum Access to Enhance Throughput for Underlay Device-to-Device Communications"],"prefix":"10.1109","author":[{"given":"Jinhyun","family":"Park","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jae Hong","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2014.7037027"},{"key":"ref30","author":"zhang","year":"1999","journal-title":"State-space Search Algorithms Complexity Extensions and Applications"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2016.2547862"},{"key":"ref11","first-page":"134","article-title":"Joint scheduling and resource allocation for device-to-device underlay communication","author":"wang","year":"2013","journal-title":"Proc IEEE WCNC"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"1481","DOI":"10.1109\/TNET.2008.2010857","article-title":"Performance of random access scheduling schemes in multi-hop wireless networks","volume":"17","author":"joo","year":"2009","journal-title":"IEEE\/ACM Trans Netw"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2006.286601"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.2328102"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2012.011513.120063"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2015.2408326"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2014.6807945"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2015.7127505"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2014.6884139"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2008.919617"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2014.6815897"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.9734\/BJMCS\/2014\/6317"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2016.7432168"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2014.2360202"},{"key":"ref29","author":"hromkovi?","year":"2001","journal-title":"Algorithmics for Hard Problems Introduction to Combinatorial Optimization Randomization Approximation and Heuristics"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107478732"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"2752","DOI":"10.1109\/TWC.2011.060811.102120","article-title":"Resource sharing optimization for device-to-device communication underlaying cellular networks","volume":"10","author":"yu","year":"2011","journal-title":"IEEE Trans Wireless Commun"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2014.2340879"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2014.6882301"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.071013.120787"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2014.6807946"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/0471791571"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2014.2387342"},{"key":"ref21","author":"gradshteyn","year":"2007","journal-title":"Table of Integrals Series and Products"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0139-z"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2009.2014384"},{"key":"ref26","first-page":"129","article-title":"On a local search algorithm for the capacitated max-k-cut problem","volume":"41","author":"wu","year":"2014","journal-title":"Kuwait Journal of Science"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/WSWAN.2015.7210302"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/5497975\/07971976.pdf?arnumber=7971976","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:22:13Z","timestamp":1642004533000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7971976\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/tcomm.2017.2724028","relation":{},"ISSN":["0090-6778"],"issn-type":[{"value":"0090-6778","type":"print"}],"subject":[],"published":{"date-parts":[[2017]]}}}