The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Differentiated surveillance for sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Self-configuring localization systems: Design and Experimental Evaluation
ACM Transactions on Embedded Computing Systems (TECS)
ICWMC '07 Proceedings of the Third International Conference on Wireless and Mobile Communications
Energy-Efficient Multihop Polling in Clusters of Two-Layered Heterogeneous Sensor Networks
IEEE Transactions on Computers
Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network
IEEE Transactions on Mobile Computing
| Hi-index | 0.00 |
We focus on the coverage problem in the mobile sensor network, where each node is capable of movement. Most of the prior schemes pursue coverage by uniformizing the node density or internodal distance over the area of interest. In this paper, we first argue that the uniformizing schemes are inefficient to achieve the multi-level coverage due to the phenomenon we call geometric anomaly, and that the anomaly can be solved by layering. Then, we design a distributed layering scheme, where the layers are built by nodes' local decision and the imbalance of the layer size is minimized by regrouping. Simulation results show that our scheme achieves the required multilevel coverage with a significantly reduced number of nodes.