Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain

  • Danny Z. Chen
  • Yan Gu
  • Jian Li
  • Haitao Wang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7357)

Abstract

In this paper, we study the problem of moving n sensors on a line to form a barrier coverage of a specified segment of the line such that the maximum moving distance of the sensors is minimized. Previously, it was an open question whether this problem on sensors with arbitrary sensing ranges is solvable in polynomial time. We settle this open question positively by giving an O(n2lognloglogn) time algorithm. Further, if all sensors have the same-size sensing range, we give an O(nlogn) time algorithm, which improves the previous best O(n2) time solution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Akyildiz, I., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless sensor networks: A survey. Computer Networks 38(4), 393–422 (2002)CrossRefGoogle Scholar
  2. 2.
    Bhattacharya, B., Burmester, B., Hu, Y., Kranakis, E., Shi, Q., Wiese, A.: Optimal movement of mobile sensors for barrier coverage of a planar region. Theoretical Computer Science 410(52), 5515–5528 (2009)MathSciNetMATHCrossRefGoogle Scholar
  3. 3.
    Chen, A., Kumar, S., Lai, T.: Designing localized algorithms for barrier coverage. In: Proc. of the 13th Annual ACM International Conference on Mobile Computing and Networking, pp. 63–73 (2007)Google Scholar
  4. 4.
    Chen, D., Tan, X., Wang, H., Wu, G.: Optimal point movement for covering circular regions. arXiv:1107.1012v1 (2011)Google Scholar
  5. 5.
    Chen, D., Wang, C., Wang, H.: Representing a functional curve by curves with fewer peaks. Discrete and Computational Geometry (DCG) 46(2), 334–360 (2011)MATHCrossRefGoogle Scholar
  6. 6.
    Cole, R.: Slowing down sorting networks to obtain faster sorting algorithms. Journal of the ACM 34(1), 200–208 (1987)CrossRefGoogle Scholar
  7. 7.
    Czyzowicz, J., Kranakis, E., Krizanc, D., Lambadaris, I., Narayanan, L., Opatrny, J., Stacho, L., Urrutia, J., Yazdani, M.: On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment. In: Ruiz, P.M., Garcia-Luna-Aceves, J.J. (eds.) ADHOC-NOW 2009. LNCS, vol. 5793, pp. 194–212. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  8. 8.
    Czyzowicz, J., Kranakis, E., Krizanc, D., Lambadaris, I., Narayanan, L., Opatrny, J., Stacho, L., Urrutia, J., Yazdani, M.: On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment. In: Nikolaidis, I., Wu, K. (eds.) ADHOC-NOW 2010. LNCS, vol. 6288, pp. 29–42. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  9. 9.
    van Emde Boas, P., Kaas, R., Zijlstra, E.: Design and implementation of an efficient priority queue. Theory of Computing Systems 10(1), 99–127 (1977)MATHGoogle Scholar
  10. 10.
    Hu, S.: ‘Virtual Fence’ along border to be delayed. Washington Post (February 28, 2008)Google Scholar
  11. 11.
    Kumar, S., Lai, T., Arora, A.: Barrier coverage with wireless sensors. Wireless Networks 13(6), 817–834 (2007)CrossRefGoogle Scholar
  12. 12.
    Li, M., Sun, X., Zhao, Y.: Minimum-Cost Linear Coverage by Sensors with Adjustable Ranges. In: Cheng, Y., Eun, D.Y., Qin, Z., Song, M., Xing, K. (eds.) WASA 2011. LNCS, vol. 6843, pp. 25–35. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  13. 13.
    Li, X., Frey, H., Santoro, N., Stojmenovic, I.: Localized sensor self-deployment with coverage guarantee. ACM SIGMOBILE Mobile Computing and Communications Review 12(2), 50–52 (2008)CrossRefGoogle Scholar
  14. 14.
    Megiddo, N.: Applying parallel computation algorithms in the design of serial algorithms. Journal of the ACM 30(4), 852–865 (1983)MathSciNetMATHCrossRefGoogle Scholar
  15. 15.
    Mehrandish, M., Narayanan, L., Opatrny, J.: Minimizing the number of sensors moved on line barriers. In: Proc. of IEEE Wireless Communications and Networking Conference (WCNC), pp. 653–658 (2011)Google Scholar
  16. 16.
    Tan, X., Wu, G.: New Algorithms for Barrier Coverage with Mobile Sensors. In: Lee, D.-T., Chen, D.Z., Ying, S. (eds.) FAW 2010. LNCS, vol. 6213, pp. 327–338. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  17. 17.
    Yang, S., Li, M., Wu, J.: Scan-based movement-assisted sensor deployment methods in wireless sensor networks. IEEE Trans. Parallel Distrib. Syst. 18(8), 1108–1121 (2007)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Zou, Y., Chakrabarty, K.: A distributed coverage and connectivity-centric technique for selecting active nodes in wireless sensor networks. IEEE Trans. Comput. 54(8), 978–991 (2005)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Danny Z. Chen
    • 1
  • Yan Gu
    • 2
  • Jian Li
    • 3
  • Haitao Wang
    • 1
  1. 1.Department of Computer Science and EngineeringUniversity of Notre DameNotre DameUSA
  2. 2.Department of Computer Science and TechnologyTsinghua UniversityBeijingChina
  3. 3.Institute for Interdisciplinary Information Sciences (IIIS)Tsinghua UniversityBeijingChina

Personalised recommendations