Fault-Tolerant relay deployment based on length-constrained connectivity and rerouting centrality in wireless sensor networks

Authors:
Lanny Sitanayah;Kenneth N. Brown;Cormac J. Sreenan
Affiliations:
Mobile & Internet Systems Laboratory (MISL), University College Cork, Ireland;Cork Constraint Computation Centre (4C), Department of Computer Science, University College Cork, Ireland;Mobile & Internet Systems Laboratory (MISL), University College Cork, Ireland
Venue:
EWSN'12 Proceedings of the 9th European conference on Wireless Sensor Networks
Year:
2012

Citing 8
Cited 0

Survivable Networks: Algorithms for Diverse Routing

Survivable Networks: Algorithms for Diverse Routing
Optimal Physical Diversity Algorithms and Survivable Networks

ISCC '97 Proceedings of the 2nd IEEE Symposium on Computers and Communications (ISCC '97)
Deploying sensor networks with guaranteed capacity and fault tolerance

Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Fault-tolerant deployment with k-connectivity and partial k-connectivity in sensor networks

Wireless Communications & Mobile Computing
Collection tree protocol

Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems
Fault-Tolerant Relay Node Placement in Heterogeneous Wireless Sensor Networks

IEEE Transactions on Mobile Computing
Sensor placement for lifetime maximization in monitoring oil pipelines

Proceedings of the 1st ACM/IEEE International Conference on Cyber-Physical Systems
Overlay routing under geographically correlated failures in distributed event-based systems

OTM'10 Proceedings of the 2010 international conference on On the move to meaningful internet systems: Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

Wireless Sensor Networks (WSNs) are prone to failures. To be robust to failures, the network topology should provide alternative routes to the sinks so when failures occur the routing protocol can still offer reliable delivery. We define l-CRC, a new centrality index which measures a node's importance to connectivity and efficient delivery in the network. We then use this centrality index to concentrate on the most important nodes, providing alternative paths around the nodes with high centrality. Varying l-CRC allows us to trade off cost for robustness. We introduce GRASP-ABP, a local search algorithm for initial robust topology design. We evaluate the algorithm empirically in terms of the number of additional nodes it suggests and its runtime. We then evaluate the robustness of the designs against node failures in simulation, and we demonstrate that the centrality-based GRASP-ABP's designs are able to offer reliable delivery, comparable to competitor algorithms, but with fewer additional relays and faster runtime.