Name
Abstract | ||
|---|---|---|
Relay node placement can be an effective mean for boosting the performance of a Wireless Sensor Network (WSN) in terms of several metrics such as network connectivity, network lifetime and fault tolerance. In this paper, we consider the problem of deploying relay nodes (RNs) in a WSN to ensure network connectivity. We propose a novel heuristic to find a minimum number of RNs together with their locations needed in order to repair a disconnected network with a grid topology. We first determine the optimal solution for connecting a set of four disconnected nodes and then, by applying our heuristic, we ensure connectivity between these sets via steinerized edges. The runtime complexity of the proposed heuristic is quasilinear in the number of nodes, which is lower than competitive approaches. In addition to that, our heuristic can achieve network connectivity using 32% less of RNs. The performances of the proposed heuristic are validated through simulations. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/WD.2019.8734234 | 2019 Wireless Days (WD) |
Keywords | Field | DocType |
Wireless sensor networks,Topology,Steiner trees,Relays,Monitoring,Computer science,Fault tolerance | Heuristic,Steiner tree problem,Computer science,Computer network,Fault tolerance,Node deployment,Boosting (machine learning),Wireless sensor network,Relay,Grid | Conference |
ISSN | ISBN | Citations |
2156-9711 | 978-1-7281-0117-0 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Khadidja Tisseli | 1 | 0 | 0.34 |
| Chafika Benzaid | 2 | 54 | 13.06 |
| Noureddine Lasla | 3 | 125 | 11.42 |
| Nadjib Badache | 4 | 612 | 60.98 |