{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T19:30:54Z","timestamp":1777404654310,"version":"3.51.4"},"reference-count":51,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2018,2,1]],"date-time":"2018-02-01T00:00:00Z","timestamp":1517443200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,2,1]],"date-time":"2018-02-01T00:00:00Z","timestamp":1517443200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,2,1]],"date-time":"2018-02-01T00:00:00Z","timestamp":1517443200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,2,1]],"date-time":"2018-02-01T00:00:00Z","timestamp":1517443200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11471005"],"award-info":[{"award-number":["11471005"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"U.S. National Science Foundation","doi-asserted-by":"publisher","award":["HRD-1345219"],"award-info":[{"award-number":["HRD-1345219"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1109\/tnet.2017.2780262","type":"journal-article","created":{"date-parts":[[2017,12,22]],"date-time":"2017-12-22T19:52:25Z","timestamp":1513972345000},"page":"412-421","source":"Crossref","is-referenced-by-count":17,"title":["On Practical Construction of Quality Fault-Tolerant Virtual Backbone in Homogeneous Wireless Networks"],"prefix":"10.1109","volume":"26","author":[{"given":"Bei","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4845-9369","authenticated-orcid":false,"given":"Donghyun","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingshu","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3216-5702","authenticated-orcid":false,"given":"Sung-Sik","family":"Kwon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5541-1136","authenticated-orcid":false,"given":"Yaolin","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","author":"west","year":"2001","journal-title":"Introduction to Graph Theory"},{"key":"ref38","doi-asserted-by":"crossref","DOI":"10.3138\/9781487584863","author":"tutte","year":"1966","journal-title":"Connectivity in Graphs"},{"key":"ref33","author":"diestel","year":"2005","journal-title":"Graph Theory"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1167935.1167941"},{"key":"ref31","first-page":"797","article-title":"Energy efficient distributed connected dominating sets construction in wireless sensor networks","author":"zeng","year":"2006","journal-title":"Proc Int Wireless Commun Mobile Comput Conf (IWCMC)"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICCIMA.2005.33"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2009.051053"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-014-9720-6"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-007-9124-y"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.05.025"},{"key":"ref28","article-title":"Localized Construction of Connected Dominating Set in Wireless Networks","author":"li","year":"2004","journal-title":"NSF International Workshop on Theoretical Aspects of Wireless Ad Hoc Sensor and Peerto- Peer Networks (TAWN04)"},{"key":"ref27","first-page":"60","article-title":"A reliable virtual backbone scheme in mobile ad-hoc networks","author":"min","year":"2004","journal-title":"Proc IEEE Int Conf Mobile Ad Hoc Sensor Syst (MASS)"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1002\/wcm.378"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/WASA.2007.8"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2014.10.013"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/313239.313261"},{"key":"ref22","first-page":"251","article-title":"Connected domination in multihop ad hoc wireless networks","author":"cardei","year":"2002","journal-title":"Proc Int Conf Comput Inf Sci"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2007.1034"},{"key":"ref24","first-page":"1597","article-title":"Distributed construction of connected dominating set in wireless ad hoc networks","author":"wan","year":"2002","journal-title":"Proc 21st Annu Joint Conf IEEE Comput Commun Soc (INFOCOM)"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2005.302"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.08.013"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/HICSS.2002.994519"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830917500306"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830917500537"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2561901"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462105"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2007.4454774"},{"key":"ref12","author":"fukunaga","year":"2015","journal-title":"Constant-approximation algorithms for highly connected multi-dominating sets in unit disk graphs"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2390176.2390177"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2002.1024422"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/AINA.2005.67"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/313451.313525"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1987.13705"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009201"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1997.605303"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2008.74"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88582-5_52"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218561"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"1108","DOI":"10.1109\/TMC.2010.55","article-title":"A better approximation algorithm for computing connected dominating sets in unit ball graphs","volume":"9","author":"kim","year":"2010","journal-title":"IEEE Trans Mobile Comput"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2607723"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524456"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830917500240"},{"key":"ref9","first-page":"925","article-title":"On approximating minimum 3-connected m-dominating set problem in unit disk graph","volume":"25","author":"liu","year":"2017","journal-title":"IEEE\/ACM Trans Netw"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830917500069"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCN.2016.7568483"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830917500239"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830917500185"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2227791"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/1374618.1374631"},{"key":"ref44","first-page":"411","article-title":"On the number of minimum size separating vertex sets in a graph and how to find all of them","author":"kanevsky","year":"1990","journal-title":"Proc Annu ACM-SIAM Symp Discrete Algorithm"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(92)90284-M"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/90\/8291715\/8237185-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/8291715\/08237185.pdf?arnumber=8237185","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:49:13Z","timestamp":1649443753000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8237185\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2]]},"references-count":51,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2017.2780262","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"value":"1063-6692","type":"print"},{"value":"1558-2566","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2]]}}}