On perimeter coverage in wireless sensor networks with minimum cost

Abstract

One of the major applications of sensor networks is tracking and surveillance. Very often, a single sensor is sufficient to monitor a single target. However, when the object is very large, several sensors have to work together to monitor the object continuously. In this paper, we study how to identify a set of sensors that can cover the perimeter of a large target with the minimum cost. We develop a novel distributed algorithm that requires fewer messages than existing mechanisms. Our algorithm can be extended to solve the problem when the sensor range is adjustable. We provide a formal proof of correctness and convergence time analysis of our algorithm. We further demonstrate the performance through extensive simulations. © 2011 Inderscience Enterprises Ltd.