{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T00:04:58Z","timestamp":1758758698446,"version":"3.44.0"},"reference-count":39,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T00:00:00Z","timestamp":1732233600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["High-Confidence Computing"],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1016\/j.hcc.2024.100293","type":"journal-article","created":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T12:47:37Z","timestamp":1732798057000},"page":"100293","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Connectivity maintenance against link uncertainty and heterogeneity in adversarial networks"],"prefix":"10.1016","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3206-6912","authenticated-orcid":false,"given":"Jianzhi","family":"Tang","sequence":"first","affiliation":[]},{"given":"Luoyi","family":"Fu","sequence":"additional","affiliation":[]},{"given":"Lei","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Xinbing","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Chenghu","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/j.hcc.2024.100293_b1","doi-asserted-by":"crossref","first-page":"1833","DOI":"10.1109\/JSAC.2021.3071852","article-title":"The impact of multi-connectivity and handover constraints on millimeter wave and terahertz cellular networks","volume":"39","author":"\u00d6zko\u00e7","year":"2021","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"3","key":"10.1016\/j.hcc.2024.100293_b2","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1109\/TKDE.2018.2879658","article-title":"Dynamic connection-based social group recommendation","volume":"32","author":"Qin","year":"2018","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.hcc.2024.100293_b3","article-title":"Meta computing","author":"Cheng","year":"2023","journal-title":"IEEE Netw."},{"key":"10.1016\/j.hcc.2024.100293_b4","article-title":"BLOWN: A blockchain protocol for single-hop wireless networks under adversarial SINR","author":"Xu","year":"2022","journal-title":"IEEE Trans. Mob. Comput."},{"issue":"10","key":"10.1016\/j.hcc.2024.100293_b5","doi-asserted-by":"crossref","first-page":"6915","DOI":"10.1109\/TWC.2021.3078639","article-title":"wChain: A fast fault-tolerant blockchain protocol for multihop wireless networks","volume":"20","author":"Xu","year":"2021","journal-title":"IEEE Trans. Wireless Commun."},{"key":"10.1016\/j.hcc.2024.100293_b6","series-title":"2022 IEEE 42nd International Conference on Distributed Computing Systems","first-page":"492","article-title":"Curb: Trusted and scalable software-defined network control plane for edge computing","author":"Xu","year":"2022"},{"key":"10.1016\/j.hcc.2024.100293_b7","series-title":"2015 IEEE Conference on Computer Communications","first-page":"2380","article-title":"Assessing attack vulnerability in networks with uncertainty","author":"Dinh","year":"2015"},{"key":"10.1016\/j.hcc.2024.100293_b8","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1016\/j.physa.2015.12.058","article-title":"Targeted attack on networks coupled by connectivity and dependency links","volume":"450","author":"Du","year":"2016","journal-title":"Physica A"},{"issue":"1","key":"10.1016\/j.hcc.2024.100293_b9","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1109\/JIOT.2017.2786546","article-title":"Dynamic connectivity game for adversarial internet of battlefield things systems","volume":"5","author":"Abuzainab","year":"2018","journal-title":"IEEE Internet Things J."},{"issue":"1","key":"10.1016\/j.hcc.2024.100293_b10","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1109\/TCNS.2020.3016839","article-title":"Dynamic resilient network games with applications to multiagent consensus","volume":"8","author":"Nugraha","year":"2020","journal-title":"IEEE Trans. Control Netw. Syst."},{"key":"10.1016\/j.hcc.2024.100293_b11","doi-asserted-by":"crossref","DOI":"10.1016\/j.physa.2019.122759","article-title":"Edge attack strategies in interdependent scale-free networks","volume":"540","author":"Hao","year":"2020","journal-title":"Physica A"},{"issue":"2","key":"10.1016\/j.hcc.2024.100293_b12","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1017\/S0963548306007681","article-title":"Adversarial deletion in a scale-free random graph process","volume":"16","author":"Flaxman","year":"2007","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/j.hcc.2024.100293_b13","series-title":"2022 IEEE Conference on Computer Communications","first-page":"1399","article-title":"Connectivity maintenance in uncertain networks under adversarial attack","author":"Tang","year":"2022"},{"issue":"4","key":"10.1016\/j.hcc.2024.100293_b14","doi-asserted-by":"crossref","first-page":"896","DOI":"10.1109\/TMC.2018.2849416","article-title":"Learning-based outdoor localization exploiting crowd-labeled WiFi hotspots","volume":"18","author":"Wang","year":"2018","journal-title":"IEEE Trans. Mob. Comput."},{"issue":"3","key":"10.1016\/j.hcc.2024.100293_b15","first-page":"626","article-title":"Snapshot and continuous data collection in probabilistic wireless sensor networks","volume":"13","author":"Ji","year":"2013","journal-title":"IEEE Trans. Mob. Comput."},{"issue":"6","key":"10.1016\/j.hcc.2024.100293_b16","doi-asserted-by":"crossref","first-page":"3237","DOI":"10.1109\/TNET.2017.2725905","article-title":"Determining source\u2013destination connectivity in uncertain networks: Modeling and solutions","volume":"25","author":"Fu","year":"2017","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"2","key":"10.1016\/j.hcc.2024.100293_b17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3127876","article-title":"De-anonymizing clustered social networks by percolation graph matching","volume":"12","author":"Chiasserini","year":"2018","journal-title":"ACM Trans. Knowl. Discov. Data (TKDD)"},{"key":"10.1016\/j.hcc.2024.100293_b18","doi-asserted-by":"crossref","DOI":"10.1109\/TKDE.2021.3094549","article-title":"Efficient top-k vulnerable nodes detection in uncertain graphs","author":"Cheng","year":"2021","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"7","key":"10.1016\/j.hcc.2024.100293_b19","doi-asserted-by":"crossref","first-page":"1188","DOI":"10.14778\/3450980.3450988","article-title":"Shortest paths and centrality in uncertain networks","volume":"14","author":"Saha","year":"2021","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.hcc.2024.100293_b20","doi-asserted-by":"crossref","DOI":"10.1109\/TKDE.2022.3152502","article-title":"Aligning dynamic social networks: An optimization over dynamic graph autoencoder","author":"Sun","year":"2022","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"10","key":"10.1016\/j.hcc.2024.100293_b21","doi-asserted-by":"crossref","first-page":"2278","DOI":"10.1109\/TMC.2019.2927335","article-title":"Coverage optimization with a dynamic network of drone relays","volume":"19","author":"Arribas","year":"2019","journal-title":"IEEE Trans. Mob. Comput."},{"key":"10.1016\/j.hcc.2024.100293_b22","article-title":"Distributed robust optimization algorithms over uncertain network graphs","author":"Wu","year":"2020","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.hcc.2024.100293_b23","doi-asserted-by":"crossref","DOI":"10.1109\/TMC.2021.3110235","article-title":"Efficient resource scheduling for interference alleviation in dynamic coexisting WBANs","author":"Fan","year":"2021","journal-title":"IEEE Trans. Mob. Comput."},{"issue":"3","key":"10.1016\/j.hcc.2024.100293_b24","doi-asserted-by":"crossref","first-page":"1269","DOI":"10.1109\/TNET.2020.2979522","article-title":"Connectivity maintenance in mobile networks","volume":"28","author":"Ding","year":"2020","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"1","key":"10.1016\/j.hcc.2024.100293_b25","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/TNET.2021.3104356","article-title":"A coverage-aware distributed k-connectivity maintenance algorithm for arbitrarily large k in mobile sensor networks","volume":"30","author":"Akram","year":"2021","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"4","key":"10.1016\/j.hcc.2024.100293_b26","doi-asserted-by":"crossref","first-page":"2334","DOI":"10.1214\/22-AOS2191","article-title":"Random graph asymptotics for treatment effect estimation under network interference","volume":"50","author":"Li","year":"2022","journal-title":"Ann. Statist."},{"issue":"6","key":"10.1016\/j.hcc.2024.100293_b27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3369782","article-title":"Random graph modeling: A survey of the concepts","volume":"52","author":"Drobyshevskiy","year":"2019","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"16","key":"10.1016\/j.hcc.2024.100293_b28","doi-asserted-by":"crossref","first-page":"4406","DOI":"10.1109\/TSP.2017.2706186","article-title":"Filtering random graph processes over random time-varying graphs","volume":"65","author":"Isufi","year":"2017","journal-title":"IEEE Trans. Signal Process."},{"issue":"11","key":"10.1016\/j.hcc.2024.100293_b29","first-page":"2078","article-title":"Conditional reliability in uncertain graphs","volume":"30","author":"Khan","year":"2018","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.hcc.2024.100293_b30","article-title":"Tracing truth and rumor diffusions over mobile social networks: Who are the initiators","author":"Qu","year":"2021","journal-title":"IEEE Trans. Mob. Comput."},{"issue":"5","key":"10.1016\/j.hcc.2024.100293_b31","doi-asserted-by":"crossref","first-page":"1105","DOI":"10.1109\/TPDS.2018.2874659","article-title":"HSDC: A highly scalable data center network architecture for greater incremental scalability","volume":"30","author":"Zhang","year":"2018","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"10.1016\/j.hcc.2024.100293_b32","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1109\/TIT.2016.2623317","article-title":"Distributed multicast tree construction in wireless sensor networks","volume":"63","author":"Gong","year":"2016","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"10.1016\/j.hcc.2024.100293_b33","doi-asserted-by":"crossref","first-page":"2607","DOI":"10.1109\/TNET.2015.2476506","article-title":"Capacity of P2P on-demand streaming with simple, robust, and decentralized control","volume":"24","author":"Zhao","year":"2015","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"3","key":"10.1016\/j.hcc.2024.100293_b34","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1109\/TR.1986.4335422","article-title":"Computational complexity of network reliability analysis: An overview","volume":"35","author":"Ball","year":"1986","journal-title":"IEEE Trans. Reliab."},{"year":"2015","series-title":"Applied Dynamic Programming","author":"Bellman","key":"10.1016\/j.hcc.2024.100293_b35"},{"key":"10.1016\/j.hcc.2024.100293_b36","first-page":"427","article-title":"Adaptive submodularity: Theory and applications in active learning and stochastic optimization","volume":"42","author":"Golovin","year":"2011","journal-title":"J. Artificial Intelligence Res."},{"key":"10.1016\/j.hcc.2024.100293_b37","first-page":"548","article-title":"Learning to discover social circles in ego networks","volume":"vol. 2012","author":"McAuley","year":"2012"},{"issue":"1","key":"10.1016\/j.hcc.2024.100293_b38","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/1217299.1217301","article-title":"Graph evolution: Densification and shrinking diameters","volume":"1","author":"Leskovec","year":"2007","journal-title":"ACM Trans. Knowl. Discov. Data (TKDD)"},{"issue":"7","key":"10.1016\/j.hcc.2024.100293_b39","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1002\/asi.20591","article-title":"The link-prediction problem for social networks","volume":"58","author":"Liben-Nowell","year":"2007","journal-title":"J. Am. Soc. Inf. Sci. Technol."}],"container-title":["High-Confidence Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2667295224000965?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2667295224000965?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T04:27:23Z","timestamp":1758688043000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2667295224000965"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["S2667295224000965"],"URL":"https:\/\/doi.org\/10.1016\/j.hcc.2024.100293","relation":{},"ISSN":["2667-2952"],"issn-type":[{"type":"print","value":"2667-2952"}],"subject":[],"published":{"date-parts":[[2025,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Connectivity maintenance against link uncertainty and heterogeneity in adversarial networks","name":"articletitle","label":"Article Title"},{"value":"High-Confidence Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.hcc.2024.100293","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2024 The Author(s). Published by Elsevier B.V. on behalf of Shandong University.","name":"copyright","label":"Copyright"}],"article-number":"100293"}}