Stochastic k-Coverage in Wireless Sensor Networks
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
A distributed self-deployment algorithm for the coverage of mobile wireless sensor networks
IEEE Communications Letters
Topography-aware sensor deployment optimization with CMA-ES
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
On Adaptive Density Deployment to Mitigate the Sink-Hole Problem in Mobile Sensor Networks
Mobile Networks and Applications
A cellular learning automata-based deployment strategy for mobile wireless sensor networks
Journal of Parallel and Distributed Computing
A moving algorithm for non-uniform deployment in mobile sensor networks
International Journal of Autonomous and Adaptive Communications Systems
Review: From wireless sensor networks towards cyber physical systems
Pervasive and Mobile Computing
Mission-oriented k-coverage in mobile wireless sensor networks
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
On the problem of k-coverage in mission-oriented mobile wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
More is more: The benefits of denser sensor deployment
ACM Transactions on Sensor Networks (TOSN)
An efficient sleep protocol for lifetime enhancement in multi covered and multi connected WSNs
Proceedings of the International Conference on Advances in Computing, Communications and Informatics
Design of wireless sensor networks for mobile target detection
IEEE/ACM Transactions on Networking (TON)
Cellular automaton based motion planning algorithms for mobile sensor networks
TPNC'12 Proceedings of the First international conference on Theory and Practice of Natural Computing
Adaptive k-coverage contour evaluation and deployment in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
ACM Transactions on Sensor Networks (TOSN)
A fuzzy k-coverage approach for RFID network planning using plant growth simulation algorithm
Journal of Network and Computer Applications
Energy-aware sensor node relocation in mobile sensor networks
Ad Hoc Networks
| Hi-index | 0.00 |
One of the research issues in wireless sensor networks (WSNs) is how to efficiently deploy sensors to cover an area. In this paper, we solve the k-coverage sensor deployment problem to achieve multi-level coverage of an area I. We consider two sub-problems: k-coverage placement and distributed dispatch problems. The placement problem asks how to determine the minimum number of sensors required and their locations in I to guarantee that I is k-covered and the network is connected; the dispatch problem asks how to schedule mobile sensors to move to the designated locations according to the result computed by the placement strategy such that the energy consumption due to movement is minimized. Our solutions to the placement problem consider both the binary and probabilistic sensing models, and allow an arbitrary relationship between the communication distance and sensing distance of sensors. For the dispatch problem, we propose a competition-based and a pattern-based schemes. The former allows mobile sensors to bid for their closest locations, while the latter allows sensors to derive the target locations on their own. Our proposed schemes are efficient in terms of the number of sensors required and are distributed in nature. Simulation results are presented to verify their effectiveness.