Angle Based Double Boundary Detection in Wireless Sensor Networks
Shailendra Shukla, Rajiv Misra · Journal of Networks · 2014
Abstract — Wireless Sensor Networks(WSN) have given a new approach for applications such as surveillance, tracking and monitoring. Such applications requires perimeter nodes to remain vigilant for event detect like objects entering and leaving the area under surveillance. Nodes performing surveillance of target area are called boundary nodes. Due to active participation in surveillance they suffers from a quicker energy exhaustion, results to a shorter lifetime. None of the reported works on boundary detection algorithms has considered the problem of maximizing the lifetime of boundary. In this paper, we have considered this problem and developed a distributed boundary detection algorithm for extending the lifetime of boundary nodes in sensor networks. The salient features of our proposed algorithm are firstly it relies on 1-hop neighbour information, secondly it produces less network overhead and lastly our algorithm is useful in enhancing the lifetime of boundary nodes. The complexity of our algorithm is O ( n k) time and O(kδ3) messages. Where n is the number of nodes, δ is the number of neighbour and k is the number of nodes simultaneously executing local computation. Simulation is conducted on randomly deployed wireless sensor networks. Results shows that, our proposed algorithm not only detects boundary nodes and holes accurately but also increases the lifetime of network boundary by 2.5 times. Index Terms — Wireless Sensor network, Boundary Nodes. I.