{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T17:58:29Z","timestamp":1772042309918,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2023,3,21]],"date-time":"2023-03-21T00:00:00Z","timestamp":1679356800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,21]],"date-time":"2023-03-21T00:00:00Z","timestamp":1679356800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61862003"],"award-info":[{"award-number":["61862003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Natural Science Foundation of the Guangxi Zhuang Autonomous Region of China","award":["2018GXNSFDA281052"],"award-info":[{"award-number":["2018GXNSFDA281052"]}]},{"name":"Interdisciplinary Scientific Research Foundation of Guangxi University","award":["2022JCC015"],"award-info":[{"award-number":["2022JCC015"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s11227-023-05180-9","type":"journal-article","created":{"date-parts":[[2023,3,21]],"date-time":"2023-03-21T15:06:39Z","timestamp":1679411199000},"page":"13050-13074","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Construction of node- and link-fault-tolerant virtual backbones in wireless networks"],"prefix":"10.1007","volume":"79","author":[{"given":"Jiarong","family":"Liang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weijian","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaojiang","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,21]]},"reference":[{"key":"5180_CR1","doi-asserted-by":"crossref","unstructured":"Mostafaei H, Montieri A, Persico V (2016) An efficient partial coverage algorithm for wireless sensor networks. In: Proceedings - IEEE Symposium on Computers and Communication, pp 501\u2013506","DOI":"10.1109\/ISCC.2016.7543788"},{"issue":"6","key":"5180_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3236623","volume":"23","author":"A Chopra","year":"2018","unstructured":"Chopra A, Aydin H, Rafatirad S (2018) Optimal allocation of computation and communication in an IoT network. ACM Trans Des Autom Electron Syst 23(6):1\u201322","journal-title":"ACM Trans Des Autom Electron Syst"},{"issue":"4","key":"5180_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2890501","volume":"21","author":"S Narayanaswamy","year":"2016","unstructured":"Narayanaswamy S, Schlueter S, Steinhorst S, Lukasiewycz M, Chakraborty S, Hoster HE (2016) On battery recovery effect in wireless sensor nodes. ACM Trans Des Autom Electron Syst 21(4):1\u201328","journal-title":"ACM Trans Des Autom Electron Syst"},{"issue":"4","key":"5180_CR4","doi-asserted-by":"publisher","first-page":"2115","DOI":"10.1109\/TGCN.2022.3175035","volume":"6","author":"CR Chowdhury","year":"2022","unstructured":"Chowdhury CR, Mandal C, Misra S (2022) Sustainable maintenance of connected dominating set by solar energy harvesting for IoT networks. IEEE Trans Green Commun Netw 6(4):2115\u20132127","journal-title":"IEEE Trans Green Commun Netw"},{"issue":"8","key":"5180_CR5","doi-asserted-by":"publisher","first-page":"2922","DOI":"10.1109\/TMC.2020.3048960","volume":"21","author":"W Zhang","year":"2021","unstructured":"Zhang W, Liang J, Liang X (2021) On the computation of virtual backbones with fault tolerance in heterogeneous wireless sensor networks. IEEE Trans Mob Comput 21(8):2922\u20132938","journal-title":"IEEE Trans Mob Comput"},{"issue":"1","key":"5180_CR6","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1109\/TNET.2019.2963361","volume":"28","author":"T Fukunaga","year":"2020","unstructured":"Fukunaga T (2020) Adaptive algorithm for finding connected dominating sets in uncertain graphs. IEEE\/ACM Trans Netw 28(1):387\u2013398","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"3","key":"5180_CR7","doi-asserted-by":"publisher","first-page":"2651","DOI":"10.1109\/TNSE.2021.3103873","volume":"8","author":"B Wang","year":"2021","unstructured":"Wang B, Sun Y, Do-Duy T, Garcia-Palacios E, Duong TQ (2021) Adaptive d-hop connected dominating set in highly dynamic flying Ad-Hoc networks. IEEE Trans Netw Sci Eng 8(3):2651\u20132664","journal-title":"IEEE Trans Netw Sci Eng"},{"issue":"49","key":"5180_CR8","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00453-007-9015-8","volume":"1","author":"S Guha","year":"2007","unstructured":"Guha S, Khuller S (2007) Approximation algorithms for connected dominating sets. Algorithmica 1(49):79\u201379","journal-title":"Algorithmica"},{"issue":"4","key":"5180_CR9","doi-asserted-by":"publisher","first-page":"1000","DOI":"10.1007\/s00453-011-9512-7","volume":"61","author":"M Li","year":"2011","unstructured":"Li M, Wan PJ, Yao F (2011) Tighter approximation bounds for minimum CDS in unit disk graphs. Algorithmica 61(4):1000\u20131021","journal-title":"Algorithmica"},{"key":"5180_CR10","doi-asserted-by":"crossref","unstructured":"Wan PJ, Wang L, Yao F (2008) Two-phased approximation algorithms for minimum CDS in wireless ad hoc networks. In: Proceedings- The 28th International Conference on Distributed Computing Systems, pp 337\u2013344","DOI":"10.1109\/ICDCS.2008.15"},{"key":"5180_CR11","doi-asserted-by":"crossref","unstructured":"Alzoubi KM, Wan PJ, Frieder O (2002) New distributed algorithm for connected dominating set in wireless ad hoc networks. In: Proceedings of the 35th Annual Hawaii International Conference on System Sciences, pp 3849\u20133855","DOI":"10.1109\/HICSS.2002.994519"},{"issue":"4","key":"5180_CR12","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.1007\/s10878-013-9690-0","volume":"30","author":"YL Du","year":"2015","unstructured":"Du YL, Du HW (2015) A new bound on maximum independent set and minimum connected dominating set in unit disk graphs. J Comb Optim 30(4):1173\u20131179","journal-title":"J Comb Optim"},{"key":"5180_CR13","doi-asserted-by":"publisher","first-page":"6197","DOI":"10.1007\/s11277-017-4473-z","volume":"96","author":"C Sivaraj","year":"2017","unstructured":"Sivaraj C, Alphonse PJA, Janakiraman TN (2017) Independent neighbour set based clustering algorithm for routing in wireless sensor networks. Wirel Pers Commun 96:6197\u20136219","journal-title":"Wirel Pers Commun"},{"issue":"8","key":"5180_CR14","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1002\/wcm.356","volume":"5","author":"Y Li","year":"2005","unstructured":"Li Y, Thai MT, Wang F, Yi CW, Wan PJ, Du DZ (2005) On greedy construction of connected dominating sets in wireless networks. Wirel Commun Mob Comput 5(8):927\u2013932","journal-title":"Wirel Commun Mob Comput"},{"issue":"6","key":"5180_CR15","doi-asserted-by":"publisher","first-page":"1511","DOI":"10.1007\/s00453-022-00935-x","volume":"84","author":"Z Nutov","year":"2022","unstructured":"Nutov Z (2022) Approximating k-connected m-dominating sets. Algorithmica 84(6):1511\u20131525","journal-title":"Algorithmica"},{"issue":"4","key":"5180_CR16","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1002\/net.10097","volume":"42","author":"X Cheng","year":"2003","unstructured":"Cheng X, Huang X, Li D, Wu W, Du DZ (2003) A polynomial-time approximation scheme for the minimum-connected dominating set in Ad Hoc wireless networks. Networks 42(4):202\u2013208","journal-title":"Networks"},{"issue":"1\u20133","key":"5180_CR17","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.tcs.2007.05.025","volume":"385","author":"MT Thai","year":"2007","unstructured":"Thai MT, Zhang N, Tiwari R, Xu X (2007) On approximation algorithms of k-connected m-dominating sets in disk graphs. Theor Comput Sci 385(1\u20133):49\u201359","journal-title":"Theor Comput Sci"},{"issue":"1","key":"5180_CR18","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1109\/TNET.2017.2780262","volume":"26","author":"B Liu","year":"2018","unstructured":"Liu B, Wang W, Kim D, Li Y, Kwon SS, Jiang Y (2018) On practical construction of quality fault-Tolerant virtual backbone in homogeneous wireless networks. IEEE\/ACM Trans Netw 26(1):412\u2013421","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"6","key":"5180_CR19","doi-asserted-by":"publisher","first-page":"3487","DOI":"10.1109\/TNET.2017.2740328","volume":"25","author":"J Zhou","year":"2017","unstructured":"Zhou J, Zhang Z, Shao T, Xiao H et al (2017) Fault-tolerant virtual backbone in heterogeneous wireless sensor network. IEEE\/ACM Trans Netw 25(6):3487\u20133499","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"1\u20133","key":"5180_CR20","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.tcs.2004.08.013","volume":"329","author":"L Ruan","year":"2004","unstructured":"Ruan L, Du H, Jia X, Wu W, Li Y, Ko KI (2004) A greedy approximation for minimum connected dominating sets. Theor Comput Sci 329(1\u20133):325\u2013330","journal-title":"Theor Comput Sci"},{"key":"5180_CR21","first-page":"167","volume":"8","author":"DZ Du","year":"2008","unstructured":"Du DZ, Graham RL, Pardalos PM, Wan PJ, Wu W, Zhao W (2008) Analysis of greedy approximations with nonsubmodular potential functions. Proc Annu ACM-SIAM Symp Discret Algorithms 8:167\u2013175","journal-title":"Proc Annu ACM-SIAM Symp Discret Algorithms"},{"issue":"1","key":"5180_CR22","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/s10878-014-9720-6","volume":"31","author":"Y Shi","year":"2016","unstructured":"Shi Y, Zhang Y, Zhang Z, Wu W (2016) A greedy algorithm for the minimum 2-connected m-fold dominating set problem. J Comb Optim 31(1):136\u2013151","journal-title":"J Comb Optim"},{"issue":"7","key":"5180_CR23","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1016\/j.jpdc.2005.12.010","volume":"66","author":"F Dai","year":"2006","unstructured":"Dai F, Wu J (2006) On constructing k-connected k-dominating set in wireless ad hoc and sensor networks. J Parallel Distrib Comput 66(7):947\u2013958","journal-title":"J Parallel Distrib Comput"},{"issue":"2","key":"5180_CR24","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s10878-007-9124-y","volume":"16","author":"W Shang","year":"2008","unstructured":"Shang W, Yao F, Wan P, Hu X (2008) On minimum m-connected k-dominating set problem in unit disc graphs. J Comb Optim 16(2):99\u2013106","journal-title":"J Comb Optim"},{"issue":"1","key":"5180_CR25","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/s10878-013-9638-4","volume":"28","author":"J Zhou","year":"2014","unstructured":"Zhou J, Zhang Z, Wu W, Xing K (2014) A greedy algorithm for the fault-tolerant connected dominating set in a general graph. J Comb Optim 28(1):310\u2013319","journal-title":"J Comb Optim"},{"issue":"1","key":"5180_CR26","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1109\/TNET.2016.2561901","volume":"25","author":"W Wang","year":"2017","unstructured":"Wang W, Liu B, Kim D, Li D, Wang J, Gao W (2017) A new constant factor approximation to construct highly fault-tolerant connected dominating set in unit disk graph. IEEE\/ACM Trans Netw 25(1):18\u201328","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"2","key":"5180_CR27","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1109\/TNET.2016.2607723","volume":"25","author":"Y Shi","year":"2017","unstructured":"Shi Y, Zhang Z, Mo Y, Du DZ (2017) Approximation algorithm for minimum weight fault-tolerant virtual backbone in unit disk graphs. IEEE\/ACM Trans Netw 25(2):925\u2013933","journal-title":"IEEE\/ACM Trans Netw"},{"key":"5180_CR28","first-page":"226","volume":"2017","author":"K Tao","year":"2018","unstructured":"Tao K, Sun X, Zhang K, Liu X (2018) Distributed construction of fault-tolerance virtual backbone network for UAV cluster network. Proc EAI Int Conf Adv Hybrid Inf Process Harbin China 2017:226\u2013233","journal-title":"Proc EAI Int Conf Adv Hybrid Inf Process Harbin China"},{"issue":"8","key":"5180_CR29","doi-asserted-by":"publisher","first-page":"1919","DOI":"10.3390\/s19081919","volume":"19","author":"X Sun","year":"2019","unstructured":"Sun X, Yang Y, Ma M (2019) Minimum connected dominating set algorithms for Ad Hoc sensor networks. Sensors 19(8):1919\u20131934","journal-title":"Sensors"},{"issue":"1","key":"5180_CR30","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1109\/TCOMM.2020.3030930","volume":"69","author":"X Liang","year":"2021","unstructured":"Liang X, Liang J, Zhang W (2021) Constructing d-robust connected dominating sets in wireless sensor networks with unstable transmission ranges. IEEE Trans Commun 69(1):398\u2013415","journal-title":"IEEE Trans Commun"},{"key":"5180_CR31","doi-asserted-by":"publisher","DOI":"10.1155\/2021\/5977781","author":"X Liang","year":"2021","unstructured":"Liang X, Liang J, Zhang W (2021) Construction of quality virtual backbones with link fault tolerance in wireless sensor networks. Wirel Commun Mob Comput. https:\/\/doi.org\/10.1155\/2021\/5977781","journal-title":"Wirel Commun Mob Comput"},{"issue":"5","key":"5180_CR32","doi-asserted-by":"publisher","first-page":"2690","DOI":"10.1109\/TNET.2015.2475335","volume":"24","author":"B Liu","year":"2016","unstructured":"Liu B, Wang W, Kim D, Li D, Wang J, Tokuta AO, Jiang Y (2016) On approximating minimum 3-connected $$m$$-dominating set problem in unit disk graph. IEEE\/ACM Trans Netw 24(5):2690\u20132701","journal-title":"IEEE\/ACM Trans Netw"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05180-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-023-05180-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05180-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T14:06:10Z","timestamp":1687269970000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-023-05180-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,21]]},"references-count":32,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["5180"],"URL":"https:\/\/doi.org\/10.1007\/s11227-023-05180-9","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,21]]},"assertion":[{"value":"7 March 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there is no conflict of interest regarding the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This paper does not involve any animal or human studies.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}