PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Purposeful Mobility for Relaying and Surveillance in Mobile Ad Hoc Sensor Networks
IEEE Transactions on Mobile Computing
Mobility improves coverage of sensor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Movement-assisted sensor redeployment scheme for network lifetime increase
Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network
IEEE Transactions on Mobile Computing
Distributed Deployment Schemes for Mobile Wireless Sensor Networks to Ensure Multilevel Coverage
IEEE Transactions on Parallel and Distributed Systems
ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
Energy-efficient deployment of Intelligent Mobile sensor networks
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Data Collection in Wireless Sensor Networks with Mobile Elements: A Survey
ACM Transactions on Sensor Networks (TOSN)
Proceedings of the first ACM international workshop on Mission-oriented wireless sensor networking
Hi-index | 0.00 |
The problem of sensor deployment to achieve k-coverage of a field, where every point is covered by at least k sensors, is very critical in the design of energy-efficient wireless sensor networks (WSNs). It becomes more challenging in mission-oriented WSNs, where sensors have to move in order to k-cover a region of interest in the field. In this paper, we consider the problem of k-coverage in mission-oriented mobile WSNs which we divide into two subproblems, namely sensor placement and sensor selection. The sensor placement problem is to identify a subset of sensors and their locations in a region of interest so it is k-covered with a minimum number of sensors. The sensor selection problem is to determine which sensors should move to the above-computed locations in the region while minimizing the total energy consumption due to sensor mobility and communication. Simulation results show that our solution to the k-coverage problem in mission-oriented mobile WSNs outperforms an existing one in terms of the number of sensors needed to achieve k-coverage of a region of interest in the field as well as their total energy consumption.