New Algorithms for Barrier Coverage with Mobile Sensors
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(n 2.5 logn) 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(n 3.5 logn). Also, we describe an O(n 4) 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 . Moreover, our algorithms are simpler and have more explicit geometric flavor.
KeywordsSensor Node Distance Function Wireless Sensor Network Binary Search Equal Distance
Unable to display preview. Download preview PDF.
- 1.Akyildiz, I., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless Sensor Networks: A Survey. Computer Networks (Elsevier) Journal, 393–422 (March 2002)Google Scholar
- 3.Chen, A., Kumar, S., Lai, T.H.: Designing localized algorithms for barrier coverage. In: Proc. 13th ACM Int. Conf. on Mobile Computing and Networking, pp. 63–73 (2007)Google Scholar
- 8.Hu, S.S.: ’Virtual Fence’ along border to be delayed, Washington Post (February 28, 2008)Google Scholar
- 9.Katz, M.J., Sharir, M.: An expander-based approach to geometric optimization. In: Proc. 10th ACM Symp. on Computational Geometry, pp. 198–207 (1993)Google Scholar