Skip to main content
Log in

Distributed algorithms for barrier coverage using relocatable sensors

  • Published:
Distributed Computing Aims and scope Submit manuscript

Abstract

We study the barrier coverage problem using relocatable sensor nodes. We assume each sensor can sense an intruder or event inside its sensing range. Sensors are initially located at arbitrary positions on the barrier and can move along the barrier. The goal is to find final positions for sensors so that the entire barrier is covered. In recent years, the problem has been studied extensively in the centralized setting. In this paper, we study a barrier coverage problem in the distributed and discrete setting. We assume that we have n identical sensors located at grid positions on the barrier, and that each sensor repeatedly executes a Look-Compute-Move cycle: based on what it sees in its vicinity, it makes a decision on where to move, and moves to its next position. We make two strong but realistic restrictions on the capabilities of sensors: they have a constant visibility range and can move only a constant distance in every cycle. In this model, we give the first two distributed algorithms that achieve barrier coverage for a line segment barrier when there are enough nodes in the network to cover the entire barrier. Our algorithms are synchronous, and local in the sense that sensors make their decisions independently based only on what they see within their constant visibility range. One of our algorithms is oblivious whereas the other uses two bits of memory at each sensor to store the type of move made in the previous step. We show that our oblivious algorithm terminates within \(\varTheta (n^2)\) steps with the barrier fully covered, while the constant-memory algorithm is shown to take \(\varTheta (n)\) steps to terminate in the worst case. Since any algorithm in which a sensor can only move a constant distance in one step requires \(\varOmega (n)\) steps on some inputs, our second algorithm is asymptotically optimal.

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

Access this article

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

References

  1. Ando, H., Suzuki, I., Yamashita, M.: Formation and agreement problems for synchronous mobile robots with limited visibility. In: Proceedings of IEEE international symposium on intelligent control, pp. 453–460 (1995)

  2. Balister, P., Bollobas, B., Sarkar, A., Kumar, S.: Reliable density estimates for coverage and connectivity in thin strips of finite length. In: Proceedings of MobiCom’07, pp. 75–86 (2007)

  3. Bhattacharya, B., Burmester, M., Hu, Y., Kranakis, E., Shi, Q., Wiese, A.: Optimal movement of mobile sensors for barrier coverage of a planar region. Theor. Comput. Sci. 410(52), 5515–5528 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chen, D.Z., Gu, Y., Li, J., Wang, H.: Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain. In: Proceedings of SWAT’12, pp. 177–188 (2012)

  5. Cohen, R., Peleg, D.: Local algorithms for autonomous robots systems. In: Proceedings of SIROCCO’06, LNCS v. 4056, pp. 29–43 (2006)

  6. Czyzowicz, J., Gasieniec, L., Pelc, A.: Gathering few fat mobile robots in the plane. Theor. Comput. Sci. 410(6–7), 481–499 (2009)

    Article  MathSciNet  MATH  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: Proceedings of ADHOC-NOW, LNCS v. 5793, pp. 194–212 (2009)

  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: Proceedings of ADHOC-NOW, LNCS v. 6288, pp. 29–42 (2010)

  9. Datta, S., Dutta, A., Chaudhuri, S.C., Mukhopadhyaya, K.: Circle formation by asynchronous transparent fat robots. In: Proceedings of ICDCIT’13, pp. 195–207 (2013)

  10. Flocchini, P., Prencipe, G., Santoro, N.: Distributed Computing by Oblivious Mobile Robots: Synthesis Lectures on Distributed Computing Theory. Morgan and Claypool Publishers, San Rafael (2012)

    MATH  Google Scholar 

  11. Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of asynchronous mobile robots with limited visibility. In: Proceedings of STACS’01, LNCS v. 2010, pp. 247–258 (2001)

  12. Huang, C.F., Tseng, Y.C.: The coverage problem in a wireless sensor network. In: Proceedings of WSNA’03, pp. 115–121 (2003)

  13. Kumar, S., Lai, T.H., Arora, A.: Barrier coverage with wireless sensors. In: Proceedings of MobiCom’05, pp. 284–298 (2005)

  14. Kumar, S., Lai, T.H., Balogh, J.: On \(k\)-coverage in a mostly sleeping sensor network. In: Proceedings of MobiCom’04, pp. 144–158 (2004)

  15. Matarić, M.: Interaction and intelligent behavior. PhD thesis, MIT (1994)

  16. Meguerdichian, S., Koushanfar, F., Potkonjak, M., Srivastava, M.B.: Coverage problems in wireless ad-hoc sensor networks. In: Proceedings of IEEE INFOCOM’01, pp. 1380–1387 (2001)

  17. Mehrandish, M., Narayanan, L., Opatrny, J.: Minimizing the number of sensors moved on line barriers. In: Proceedings of IEEE WCNC’11, pp. 1464–1469 (2011)

  18. Prencipe, G., Santoro, N.: Distributed algorithms for autonomous mobile robots. In: Proceedings 5th IFIP international conference on theoretical computer science (TCS’06), vol 209, pp. 47–62 (2006)

  19. Shen, C., Cheng, W., Liao, X., Peng, S.: Barrier coverage with mobile sensors. In: Proceedings of I-SPAN’08, pp. 99–104 (2008)

  20. Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots: formation of geometric patterns. SIAM J. Comput. 28(4), 1347–1363 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  21. Yan, G., Qiao, D.: Multi-round sensor deployment for guaranteed barrier coverage. In: Proceedings of IEEE INFOCOM’10, pp. 2462–2470 (2010)

Download references

Acknowledgments

The authors thank the anonymous referees for providing us with many useful suggestions that improved the paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mohsen Eftekhari.

Additional information

An abbreviated version of this paper is published in the proceedings of the ACM Symposium on Principles of Distributed Computing (PODC 2013), July 22–24, Montreal, Canada.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Eftekhari, M., Kranakis, E., Krizanc, D. et al. Distributed algorithms for barrier coverage using relocatable sensors. Distrib. Comput. 29, 361–376 (2016). https://doi.org/10.1007/s00446-016-0267-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-016-0267-x

Keywords

Navigation