A simple and cost-effective scheme to deploy connection-restoring nodes for disconnected WSNs

Dajin Wang, Liwei Lin, Li Xu, Bingtuan Wang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationICCSP 2011 - 2011 International Conference on Communications and Signal Processing
Pages117-121
Number of pages5
DOIs
StatePublished - 2011
Event2011 International Conference on Communications and Signal Processing, ICCSP 2011 - Kerala, India
Duration: 10 Feb 201112 Feb 2011

Publication series

NameICCSP 2011 - 2011 International Conference on Communications and Signal Processing

Other

Other2011 International Conference on Communications and Signal Processing, ICCSP 2011
Country/TerritoryIndia
CityKerala
Period10/02/1112/02/11

Fingerprint

Dive into the research topics of 'A simple and cost-effective scheme to deploy connection-restoring nodes for disconnected WSNs'. Together they form a unique fingerprint.

Cite this