{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T20:35:54Z","timestamp":1768422954322,"version":"3.49.0"},"reference-count":13,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1109\/globecom38437.2019.9014326","type":"proceedings-article","created":{"date-parts":[[2020,2,28]],"date-time":"2020-02-28T09:59:24Z","timestamp":1582883964000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Channel Hopping for Blind Rendezvous in Multi-Radio Cognitive Radio Networks"],"prefix":"10.1109","author":[{"given":"Xuesong Jonathan","family":"Tan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongjun","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2017.2726352"},{"key":"ref11","first-page":"371","article-title":"Nearly optimal asynchronous blind rendezvous algorithm for cognitive radio networks","author":"gu","year":"0","journal-title":"Proc IEEE SECON"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2453403"},{"key":"ref13","author":"engel","year":"1998","journal-title":"Problem -Solving Strategies for Writers"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2015.2510359"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2014.2366746"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2018.8422506"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2018.2790408"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.110403"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2009.090109"},{"key":"ref2","first-page":"1","article-title":"Adjustable rendezvous in multi-radio cognitive radio networks","author":"yu","year":"0","journal-title":"Proc IEEE Globecom"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2641798.2641827"},{"key":"ref9","first-page":"100","article-title":"Two new quorum based algorithms for distributed mutual exclusion","author":"luk","year":"0","journal-title":"Proc ICDCS"}],"event":{"name":"GLOBECOM 2019 - 2019 IEEE Global Communications Conference","location":"Waikoloa, HI, USA","start":{"date-parts":[[2019,12,9]]},"end":{"date-parts":[[2019,12,13]]}},"container-title":["2019 IEEE Global Communications Conference (GLOBECOM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8968653\/9013108\/09014326.pdf?arnumber=9014326","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,17]],"date-time":"2022-07-17T21:55:07Z","timestamp":1658094907000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9014326\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/globecom38437.2019.9014326","relation":{},"subject":[],"published":{"date-parts":[[2019,12]]}}}