Skip to main content
SpringerLink
Log in

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

  • Conference paper
Algorithm Theory – SWAT 2012 (SWAT 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7357))

Included in the following conference series:

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(n 2lognloglogn) 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(n 2) time solution.

Chen and Wang’s research was supported in part by NSF under Grant CCF-0916606. Li’s research was supported in part by the National Basic Research Program of China Grant 2011CBA00300, 2011CBA00301, the National Natural Science Foundation of China Grant 61033001, 61061130540, 61073174.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Akyildiz, I., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless sensor networks: A survey. Computer Networks 38(4), 393–422 (2002)

    Article  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  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. Chen, D., Tan, X., Wang, H., Wu, G.: Optimal point movement for covering circular regions. arXiv:1107.1012v1 (2011)

    Google Scholar 

  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)

    Article  MATH  Google Scholar 

  6. Cole, R.: Slowing down sorting networks to obtain faster sorting algorithms. Journal of the ACM 34(1), 200–208 (1987)

    Article  Google Scholar 

  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)

    Chapter  Google Scholar 

  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)

    Chapter  Google Scholar 

  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)

    MATH  Google Scholar 

  10. Hu, S.: ‘Virtual Fence’ along border to be delayed. Washington Post (February 28, 2008)

    Google Scholar 

  11. Kumar, S., Lai, T., Arora, A.: Barrier coverage with wireless sensors. Wireless Networks 13(6), 817–834 (2007)

    Article  Google Scholar 

  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)

    Chapter  Google Scholar 

  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)

    Article  Google Scholar 

  14. Megiddo, N.: Applying parallel computation algorithms in the design of serial algorithms. Journal of the ACM 30(4), 852–865 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  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. 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)

    Chapter  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  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)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN, 46556, USA

    Danny Z. Chen & Haitao Wang

  2. Department of Computer Science and Technology, Tsinghua University, Beijing, 100084, China

    Yan Gu

  3. Institute for Interdisciplinary Information Sciences (IIIS), Tsinghua University, Beijing, 100084, China

    Jian Li

Authors
  1. Danny Z. Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yan Gu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jian Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Haitao Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Informatics, University of Bergen, Postboks 7800, 5020, Bergen, Norway

    Fedor V. Fomin

  2. Department of Information and Computer Science, Aalto University, PO Box 15400, 00076, Aalto, Finland

    Petteri Kaski

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, D.Z., Gu, Y., Li, J., Wang, H. (2012). Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain. In: Fomin, F.V., Kaski, P. (eds) Algorithm Theory – SWAT 2012. SWAT 2012. Lecture Notes in Computer Science, vol 7357. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31155-0_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31155-0_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31154-3

  • Online ISBN: 978-3-642-31155-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation