{"title":"利用遍历树构建基于节点对选择的可靠物联网网络","authors":"Yongqin Zhu, Bojiang Xie","doi":"10.1002/cpe.70131","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>It is a popular practice to enhance the process of integrating new links for the purpose of strengthening IoT network resilience, as measured by traditional indicators like connectivity. Nevertheless, even in relatively small-scale networks, attempting to connect the two parts of every intended separation by adding every potential link proves to be unfeasible. Since the quantity of potential links to be taken into account will be far greater than the existing links. In practical applications, hasty methods usually lead to very unsatisfactory outcomes. We have devised a simplified approach for representing all relevant divisions. This approach relies on defining the relationship between trimmed structures and divisions. Subsequently, it can identify the nearly optimal set of cuts that encompass all recognized divisions. Consequently, this allows us to determine the optimal set of links to improve connectivity. In tests on benchmark network models, the results demonstrated that this method can attain significant improvements comparable to the optimal method. Notably, the processing time can be decreased by up to a million times in contrast to the ideal strategy, with only a slight increment in the number of added links. When contrasted with commonly used rule-of-thumb methods, which are largely ineffective in safeguarding these systems, the proposed method yields nearly flawless results in large networks.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 15-17","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2025-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Leveraging Traversal Tree for Node Pair Selection-Based Reliable IoT Network Construction\",\"authors\":\"Yongqin Zhu, Bojiang Xie\",\"doi\":\"10.1002/cpe.70131\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>\\n \\n <p>It is a popular practice to enhance the process of integrating new links for the purpose of strengthening IoT network resilience, as measured by traditional indicators like connectivity. Nevertheless, even in relatively small-scale networks, attempting to connect the two parts of every intended separation by adding every potential link proves to be unfeasible. Since the quantity of potential links to be taken into account will be far greater than the existing links. In practical applications, hasty methods usually lead to very unsatisfactory outcomes. We have devised a simplified approach for representing all relevant divisions. This approach relies on defining the relationship between trimmed structures and divisions. Subsequently, it can identify the nearly optimal set of cuts that encompass all recognized divisions. Consequently, this allows us to determine the optimal set of links to improve connectivity. In tests on benchmark network models, the results demonstrated that this method can attain significant improvements comparable to the optimal method. Notably, the processing time can be decreased by up to a million times in contrast to the ideal strategy, with only a slight increment in the number of added links. When contrasted with commonly used rule-of-thumb methods, which are largely ineffective in safeguarding these systems, the proposed method yields nearly flawless results in large networks.</p>\\n </div>\",\"PeriodicalId\":55214,\"journal\":{\"name\":\"Concurrency and Computation-Practice & Experience\",\"volume\":\"37 15-17\",\"pages\":\"\"},\"PeriodicalIF\":1.5000,\"publicationDate\":\"2025-06-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Concurrency and Computation-Practice & Experience\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/cpe.70131\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.70131","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
Leveraging Traversal Tree for Node Pair Selection-Based Reliable IoT Network Construction
It is a popular practice to enhance the process of integrating new links for the purpose of strengthening IoT network resilience, as measured by traditional indicators like connectivity. Nevertheless, even in relatively small-scale networks, attempting to connect the two parts of every intended separation by adding every potential link proves to be unfeasible. Since the quantity of potential links to be taken into account will be far greater than the existing links. In practical applications, hasty methods usually lead to very unsatisfactory outcomes. We have devised a simplified approach for representing all relevant divisions. This approach relies on defining the relationship between trimmed structures and divisions. Subsequently, it can identify the nearly optimal set of cuts that encompass all recognized divisions. Consequently, this allows us to determine the optimal set of links to improve connectivity. In tests on benchmark network models, the results demonstrated that this method can attain significant improvements comparable to the optimal method. Notably, the processing time can be decreased by up to a million times in contrast to the ideal strategy, with only a slight increment in the number of added links. When contrasted with commonly used rule-of-thumb methods, which are largely ineffective in safeguarding these systems, the proposed method yields nearly flawless results in large networks.
期刊介绍:
Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of:
Parallel and distributed computing;
High-performance computing;
Computational and data science;
Artificial intelligence and machine learning;
Big data applications, algorithms, and systems;
Network science;
Ontologies and semantics;
Security and privacy;
Cloud/edge/fog computing;
Green computing; and
Quantum computing.