A Simple and Cost-Effective Scheme to Deploy Connection-Restoring Nodes for Disconnected WSNs
Document Type
Conference Proceeding
Publication Date
4-22-2011
Abstract
We propose a simple scheme for computing the locations of restoration sensors for a disconnected WSN to recover the network's connectivity to a certain level, while keeping the number of restoration nodes as few as possible. Since an accurate, optimal solution to the problem is NP-hard, we resort to tackling the problem in a greedy and heuristic manner. We just deploy enough new nodes to establish k disjoint paths between disconnected components, where k is the network's original connectivity. That is, the scheme just grants the minimally necessary condition for restoring k-connectivity. The extremely time-consuming task of making sure the result is indeed a k-connected network will not be carried out. Empirical study has been conducted to evaluate the effectiveness of the proposed approach.
DOI
10.1109/ICCSP.2011.5739282
Montclair State University Digital Commons Citation
Wang, Dajin; Lin, Liwei; Xu, Li; and Wang, Bingtuan, "A Simple and Cost-Effective Scheme to Deploy Connection-Restoring Nodes for Disconnected WSNs" (2011). Department of Computer Science Faculty Scholarship and Creative Works. 68.
https://digitalcommons.montclair.edu/compusci-facpubs/68