Accessibility navigation


Energy-aware distributed routing algorithm to tolerate network failure in wireless sensor networks

Chanak, P., Banerjee, I. and Sherratt, R. S. (2017) Energy-aware distributed routing algorithm to tolerate network failure in wireless sensor networks. Ad Hoc Networks Journal, 56. pp. 158-172. ISSN 1570-8705

[img]
Preview
Text - Accepted Version
· Available under License Creative Commons Attribution Non-commercial No Derivatives.
· Please see our End User Agreement before downloading.

1MB

It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.

To link to this item DOI: 10.1016/j.adhoc.2016.12.006

Abstract/Summary

Wireless Sensor Networks are prone to link/node failures due to various environmental hazards such as interference and internal faults in deployed sensor nodes. Such failures can result in a disconnection in part of the network and the sensed data being unable to obtain a route to the sink(s), i.e. a network failure. Network failures potentially degrade the Quality of Service (QoS) of Wireless Sensor Networks (WSNs). It is very difficult to monitor network failures using a manual operator in a harsh or hostile environment. In such environments, communication links can easy fail because of node unequal energy depletion and hardware failure or invasion. Thus it is desirable that deployed sensor nodes are capable of overcoming network failures. In this paper, we consider the problem of tolerating network failures seen by deployed sensor nodes in a WSN. We first propose a novel clustering algorithm for WSNs, termed Distributed Energy Efficient Heterogeneous Clustering (DEEHC) that selects cluster heads according to the residual energy of deployed sensor nodes with the aid of a secondary timer. During the clustering phase, each sensor node finds k-vertex disjoint paths to cluster heads depending on the energy level of its neighbor sensor nodes. We then present a k-Vertex Disjoint Path Routing (kVDPR) algorithm where each cluster head finds k-vertex disjoint paths to the base station and relays their aggregate data to the base station. Furthermore, we also propose a novel Route Maintenance Mechanism (RMM) that can repair k-vertex disjoint paths throughout the monitoring session. The resulting WSNs become tolerant to k-1 failures in the worst case. The proposed scheme has been extensively tested using various network scenarios and compared to the existing state of the art approaches to show the effectiveness of the proposed scheme.

Item Type:Article
Refereed:Yes
Divisions:Faculty of Life Sciences > School of Biological Sciences > Biomedical Sciences
Faculty of Life Sciences > School of Biological Sciences > Department of Bio-Engineering
ID Code:68404
Publisher:Elsevier

Downloads

Downloads per month over past year

University Staff: Request a correction | Centaur Editors: Update this record

Page navigation