Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM (JACM)
An expander-based approach to geometric optimization
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Designing localized algorithms for barrier coverage
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Barrier coverage with wireless sensors
Wireless Networks
Theoretical Computer Science
Optimal movement of mobile sensors for barrier coverage of a planar region
Theoretical Computer Science
Energy-efficient deployment of Intelligent Mobile sensor networks
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
| Hi-index | 0.00 |
Monitoring and surveillance are important aspects in modern wireless sensor networks. In applications of wireless sensor networks, it often asks for the sensors to quickly move from the interior of a specified region to the region's perimeter, so as to form a barrier coverage of the region. The region is usually given as a simple polygon or even a circle. In comparison with the traditional concept of full area coverage, barrier coverage requires fewer sensors for detecting intruders, and can thus be considered as a good approximation of full area coverage. In this paper, we present an O(n2.5 log n) time algorithm for moving n sensors to the perimeter of the given circle such that the new positions of sensors form a regular n-gon and the maximum of the distances travelled by mobile sensors is minimized. This greatly improves upon the previous time bound O(n3.5 log n). Also, we describe an O(n4) time algorithm for moving n sensors, whose initial positions are on the perimeter of the circle, to form a regular n-gon such that the sum of the travelled distances is minimized. This solves an open problem posed in [2]. Moreover, our algorithms are simpler and have more explicit geometric flavor.