New Algorithms for Barrier Coverage with Mobile Sensors

  • Xuehou Tan
  • Gangshan Wu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6213)


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 [2]. Moreover, our algorithms are simpler and have more explicit geometric flavor.


Sensor Node Distance Function Wireless Sensor Network Binary Search Equal Distance 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Akyildiz, I., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless Sensor Networks: A Survey. Computer Networks (Elsevier) Journal, 393–422 (March 2002)Google Scholar
  2. 2.
    Bhattacharya, B., Burmester, M., Hu, Y., Kranakis, E., Shi, Q., Wiese, A.: Optimal movement of mobile sensors for barrier coverage of a planar region. Theoretical Computer Science 410, 5515–5528 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 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
  4. 4.
    Cole, R.: Slowing down sorting networks to obtain faster algorithms. Journal of the ACM 34(1), 200–208 (1987)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Défago, X., Souissi, S.: Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity. Theoretic Computer Science 396, 97–112 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Hopcroft, J.E., Karp, R.M.: An n 2.5 algorithm for maximum matching in bipartite graphs. SIAM J. Comput. 2(4), 225–231 (1973)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Heo, N., Varshney, P.K.: Energy-efficient deployment of intelligent mobile sensor networks. IEEE Trans. Systems, Man and Cybernetics, Part A 35(1), 78–92 (2005)CrossRefGoogle Scholar
  8. 8.
    Hu, S.S.: ’Virtual Fence’ along border to be delayed, Washington Post (February 28, 2008)Google Scholar
  9. 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
  10. 10.
    Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Research Logistics Quarterly 2, 83–97 (1955)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Kumar, S., Lai, T.H., Arora, A.: Barrier coverage with wireless sensors. Wireless Networks 13(6), 817–834 (2007)CrossRefGoogle Scholar
  12. 12.
    Megiddo, N.: Applying parallel computation algorithms in design of serial algorithms. Journal of the ACM 30(4), 852–865 (1983)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Xuehou Tan
    • 1
  • Gangshan Wu
    • 2
  1. 1.Tokai UniversityHiratsukaJapan
  2. 2.State Key Lab. for Novel Software TechnologyNanjing UniversityChina

Personalised recommendations