Fast approximation algorithms for a nonconvex covering problem
Journal of Algorithms
Approximation schemes for covering and packing problems in image processing and VLSI
Journal of the ACM (JACM)
Computational geometry in C (2nd ed.)
Computational geometry in C (2nd ed.)
PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Understanding packet delivery performance in dense wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
A New Formulation and Resolution Method for the p-Center Problem
INFORMS Journal on Computing
On k-coverage in a mostly sleeping sensor network
Proceedings of the 10th annual international conference on Mobile computing and networking
The coverage problem in a wireless sensor network
Mobile Networks and Applications
On solving coverage problems in a wireless sensor network using voronoi diagrams
WINE'05 Proceedings of the First international conference on Internet and Network Economics
| Hi-index | 0.00 |
Coverage problem which is one of the challenging problems in facility location studies, is NP-hard. In this paper, we focus on a constrained version of coverage problem in which a set of demand points and some constrained regions are given and the goal is to find a minimum number of sensors which covers all demand points. A heuristic approach is presented to solve this problem by using the Voronoi diagram and p-center problem's solution. The proposed algorithm is relatively time-saving and is compared with alternative solutions. The results are discussed, and concluding remarks and future work are given.