Sensor coverage in wireless ad hoc sensor networks

Abstract
We present our solutions to the general sensor coverage problem in wireless ad hoc sensor networks, where the sensors are heterogeneous in terms of sensing, communication and motion capabilities. We propose an integrated framework to accommodate such heterogeneity, in which sensors are logically organised into different tiers. We then address, for each given set of heterogeneous sensors, how the coverage problem can be solved. We first present our Sensing Neighbour Acquiring Protocol (SNAP) which renders correct neighbour information necessary for coverage algorithms. Then we provide our insights on coverage and the necessary and sufficient conditions for the coverage degree determination in a target area. Such theoretical results lead to our general and efficient coverage determination algorithm. Further, we prove that by using SNAP, coverage implies network connectivity. Without assuming uniform sensing ranges, our protocol, algorithm and theoretical results are generally applicable in a wide range of sensor network applications.

This publication has 0 references indexed in Scilit: