Exposure in wireless Ad-Hoc sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Sensor deployment and target localization in distributed sensor networks
ACM Transactions on Embedded Computing Systems (TECS)
Purposeful Mobility for Relaying and Surveillance in Mobile Ad Hoc Sensor Networks
IEEE Transactions on Mobile Computing
On k-coverage in a mostly sleeping sensor network
Proceedings of the 10th annual international conference on Mobile computing and networking
Methods for Scalable Self-Assembly of Ad Hoc Wireless Sensor Networks
IEEE Transactions on Mobile Computing
Worst and Best-Case Coverage in 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
Deploying sensor networks with guaranteed capacity and fault tolerance
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
IEEE Transactions on Computers
Integrated coverage and connectivity configuration for energy conservation in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Barrier coverage with wireless sensors
Proceedings of the 11th annual international conference on Mobile computing and networking
Deploying wireless sensors to achieve both coverage and connectivity
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Connected sensor cover: self-organization of sensor networks for efficient query execution
IEEE/ACM Transactions on Networking (TON)
Random Coverage with Guaranteed Connectivity: Joint Scheduling for Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Stochastic coverage in heterogeneous sensor networks
ACM Transactions on Sensor Networks (TOSN)
Relay Node Placement in Wireless Sensor Networks
IEEE Transactions on Computers
Distributed protocols for ensuring both coverage and connectivity of a wireless sensor network
ACM Transactions on Sensor Networks (TOSN)
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
Promoting Heterogeneity, Mobility, and Energy-Aware Voronoi Diagram in Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
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
Distance based decision fusion in a distributed wireless sensor network
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Constrained relay node placement in wireless sensor networks: formulation and approximations
IEEE/ACM Transactions on Networking (TON)
Analysis of target detection performance for wireless sensor networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Energy-efficient deployment of Intelligent Mobile sensor networks
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
IEEE Transactions on Mobile Computing
Proceedings of the first ACM international workshop on Mission-oriented wireless sensor networking
Computer Networks: The International Journal of Computer and Telecommunications Networking
A fuzzy k-coverage approach for RFID network planning using plant growth simulation algorithm
Journal of Network and Computer Applications
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 type of network, there are multiple missions (or monitoring tasks) to be accomplished, each of which has different requirements, particularly, in terms of coverage. In this paper, we consider the problem of k-coverage in mission-oriented mobile WSNs which we divide into two sub-problems, 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 small 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. Specifically, we propose centralized and distributed approaches to solve the k-coverage problem in mission-oriented mobile WSNs. Our solution to the sensor placement problem is based on Helly's Theorem and the geometric analysis of the Reuleaux triangle. First, we consider a deterministic (or disk) sensing model, where the sensing range is modeled as a disk. Then, based on the above analysis, we address the k-coverage problem using a more realistic sensing model, known as probabilistic sensing model. The latter reflects the stochastic nature of the characteristics of the sensors, namely sensing and communication ranges. Our centralized and distributed protocols enable the sensors to move toward a region of interest and k-cover it with a small number of sensors. Our experiments show a good match between simulation and analytical results. In particular, 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 k-cover a region of interest in the field and their total energy consumption due to communication, sensing, and mobility for the correct operation of the protocol.