Name
Abstract | ||
|---|---|---|
Many works on restoring WSN connectivity pursue complete recovery of the original connectivity. Doing so would inevitably incur high time complexity and large number of restoration nodes. However, for many applications, 100% recovery of the original connectivity is not necessary. We propose a scheme for deploying restoration sensors for a disconnected WSN to reconnect the network, achieving remarkable restored connectivity while keeping the number of restoration nodes at a low level. Since an accurate, optimal solution to the problem is NP-hard, we resort to tackling the problem in a greedy and heuristic manner. Analysis and performance evaluation via simulation show that the proposed scheme can restore the network's connectivity to a very good level with relatively low cost in terms of algorithm time and restoration nodes needed. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/ICOIN.2015.7057859 | ICOIN |
Keywords | Field | DocType |
greedy manner,np-hard,time complexity,cost-effective scheme,wireless sensor network,computational complexity,greedy algorithms,wsn connectivity restoration,restoration sensor deployment,performance evaluation,wireless sensor networks,sensor placement,heuristic manner,computer science,sensors,computational modeling,base stations | Key distribution in wireless sensor networks,Base station,Heuristic,Computer science,Computer network,Time complexity,Wireless sensor network,Distributed computing | Conference |
Citations | PageRank | References |
1 | 0.35 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dajin Wang | 1 | 393 | 33.15 |
| Juncheng Jia | 2 | 6 | 2.45 |
| Liwei Lin | 3 | 122 | 28.76 |