Leveraging Traversal Tree for Node Pair Selection‐Based Reliable IoT Network Construction
ABSTRACT 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.
Authors
- Bo Xie (ORCID: https://orcid.org/0000-0002-6016-6008)
- Yongqin Zhu
Institutions
- Shanghai Jiao Tong University (CN)
- Jiaozuo University (CN)
Publication Details
- Journal
- Concurrency and Computation Practice and Experience
- Published
- 2025-06-07
- DOI
- https://doi.org/10.1002/cpe.70131
- Primary Topic
- Smart Grid Security and Resilience
- Type
- article
- Field-Weighted Citation Impact
- 0.00