Parallel circle-cover algorithms
Information Processing Letters
An optimal parallel algorithm for the minimum circle-cover problem
Information Processing Letters
Parallel algorithms on circular-arc graphs
Computational Geometry: Theory and Applications
Connecting the Physical World with Pervasive Networks
IEEE Pervasive Computing
Connected sensor cover: self-organization of sensor networks for efficient query execution
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Simulating the power consumption of large-scale sensor network applications
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Connected sensor cover: self-organization of sensor networks for efficient query execution
IEEE/ACM Transactions on Networking (TON)
Maximum Lifetime of Sensor Networks with Adjustable Sensing Range
SNPD-SAWN '06 Proceedings of the Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing
Energy Efficient Fractional Coverage Schemes for Low Cost Wireless Sensor Networks
ICDCSW '06 Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems
The coverage problem in a wireless sensor network
Mobile Networks and Applications
Energy Efficient Coverage with Variable Sensing Radii in Wireless Sensor Networks
WIMOB '07 Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications
Improving network lifetime using sensors with adjustable sensing ranges
International Journal of Sensor Networks
Wireless sensor networks scheduling for full angle coverage
Multidimensional Systems and Signal Processing
On perimeter coverage in wireless sensor networks
IEEE Transactions on Wireless Communications
| Hi-index | 0.00 |
One of the major applications of sensor networks is tracking and surveillance. Very often, a single sensor is sufficient to monitor a single target. However, when the object is very large, several sensors have to work together to monitor the object continuously. In this paper, we study how to identify a set of sensors that can cover the perimeter of a large target with the minimum cost. We develop a novel distributed algorithm that requires fewer messages than existing mechanisms. Our algorithm can be extended to solve the problem when the sensor range is adjustable. We provide a formal proof of correctness and convergence time analysis of our algorithm. We further demonstrate the performance through extensive simulations.