Coverage Strategies in Wireless Sensor Networks

Abstract

An energy efficient cover of a region using Wireless Sensor Networks (WSNs) is addressed in this paper. Sensor nodes in a WSN are characterized by limited power and computational capabilities, and are expected to function for extended periods of time with minimal human intervention. The life span of such networks depends on the efficient use of the available power for sensing and communication. In this paper, the coverage problem in a three dimensional space is rigorously analyzed and the minimum number of sensor nodes and their placement for complete coverage is determined. Also, given a random distribution of sensor nodes, the problem of selecting a minimum subset of sensor nodes for complete coverage is addressed. A computationally efficient algorithm is developed and implemented in a distributed fashion. Numerical simulations show that the optimized sensor network has better energy efficiency compared to the standard random deployment of sensor nodes. It is demonstrated that the optimized WSN continues to offer better coverage of the region even when the sensor nodes start to fail over time. A localized “self healing” algorithm is implemented that wakes up the inactive neighbors of a failing sensor node. Using the “flooding algorithm” for querying the network, it is shown that the optimized WSN with integrated self healing far outweighs the performance that is obtained by standard random deployment. For the first time, a “measure of optimality” is defined that will enable the comparison of different implementations of a WSN from an energy efficiency stand point.