A destination-based approach for cut detection in wireless sensor networks
Academic Article
Overview
Research
Identity
Additional Document Info
Other
View All
Overview
abstract
Wireless sensor networks often suffer from disrupted connectivity caused by its numerous aspects such as limited battery power of a node and unattended operation vulnerable to hostile tampering. The disruption of connectivity, often referred to as network cut, leads to ill-informed routing decisions, data loss and waste of energy. A number of protocols have been proposed to efficiently detect network cuts; they focus solely on a cut that disconnects nodes from the base station. However, a cut detection scheme is truly useful when a cut is defined with respect to multiple destinations (i.e. target nodes), rather than a single base station. Thus, we extend the existing notion of cut detection, and propose an algorithm that enables sensor nodes to autonomously monitor the connectivity to multiple target nodes. We introduce a novel reactive cut detection solution, the point-to-point cut detection, where given any pair of source and destination, a source is able to locally determine whether the destination is reachable or not. Furthermore, we propose a lightweight proactive cut detection algorithm specifically designed for a network scenario with a small set of target destinations. We prove the effectiveness of the proposed algorithms through extensive simulations; specifically, in our network configurations, proposed cut detection algorithms achieve more than an order of magnitude improvement in energy consumption, when coupled with an underlying routing protocol. 2013 Copyright Taylor and Francis Group, LLC.
