Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
A Bidding Protocol for Deploying Mobile Sensors
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
Algebraic Optimization of Data Delivery Patterns in Mobile Sensor Networks
DEXA '04 Proceedings of the Database and Expert Systems Applications, 15th International Workshop
Energy Efficient Organization of Mobile Sensor Networks
ICPPW '04 Proceedings of the 2004 International Conference on Parallel Processing Workshops
A Mobile Sensor Network Using Autonomously Controlled Animals
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
The coverage problem in a wireless sensor network
Mobile Networks and Applications
IEEE Communications Magazine
| Hi-index | 0.00 |
The coverage problem, being one of fundamental problems in wireless sensor networks, has been received lots of attention. To preserve the coverage of network, some researches suggest moving redundant mobile sensor nodes to uncovered areas for mitigating the problem. Most of previous approaches require location information of sensor nodes to calculate and determine redundant nodes, to detect uncovered areas, and to move those nodes to their pre-determined areas. However, to acquire location information will increase the cost of hardware for deployment, extra computation and communication delay, and additional message overhead and power consumption. In some cases, it becomes difficult to acquire location information. In this work, without exploiting any location and distance information, six distributed algorithms are devised for mitigating the un-coverage problem. The first three distributed algorithms including the neighborhood density detecting algorithm, the random walk algorithm, and the dripping rain algorithm detect uncovered areas, redundant mobile sensor nodes, and direct them to move to cover the uncovered areas, only basing on the number of neighbors of each node and consuming little extra control packets. The expected number of required neighbors and the probability of an arbitrary node being a redundant node are derived theoretically. Moreover, based on the obtained formula, the last three randomized algorithms are developed by modifying the first three algorithms. Simulation results demonstrate that the proposed coverage algorithms can achieve at most 90% coverage rate in a GPS-less sensor network.