On optimal connectivity restoration in segmented sensor networks
Abstract
This paper investigates the optimal connectivity restoration in segmented sensor networks, where mobile/relay nodes are optimally placed to form "bridges" among segments, such that both the average path length from nodes to the sink and the number of mobile nodes used are minimized. We formulate the optimal connectivity restoration as a multi-objective optimization problem and develop centralized and distributed algorithms for solving it. Given global network topology information, our centralized algorithm (i.e., Cut Restoration Genetic Algorithm or CR-GA) produces a Pareto Optimal set consisting of multiple non-dominated solutions. For scenarios where the global network topology is unknown (e.g., due to unexpected network segmentation) we develop a Distributed Connectivity Restoration algorithm (i.e., DCR). DCR restores network connectivity with lower overhead (when compared with CR-GA), at the cost of a suboptimal solution (i.e., the average path length and/or number of mobiles used). Through theoretical analysis, we prove that the worst case performance of DCR is bounded. We also show the effectiveness of our solutions through extensive simulations and a proof-of-concept system implementation and evaluation. © Springer-Verlag 2013.
Publication Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Recommended Citation
Won, M., Stoleru, R., Chenji, H., & Zhang, W. (2013). On optimal connectivity restoration in segmented sensor networks. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7772 LNCS, 131-148. https://doi.org/10.1007/978-3-642-36672-7_9
