Distributed Computing

, Volume 29, Issue 5, pp 361–376

Distributed algorithms for barrier coverage using relocatable sensors

  • Mohsen Eftekhari
  • Evangelos Kranakis
  • Danny Krizanc
  • Oscar Morales-Ponce
  • Lata Narayanan
  • Jaroslav Opatrny
  • Sunil Shende
Article

DOI: 10.1007/s00446-016-0267-x

Cite this article as:
Eftekhari, M., Kranakis, E., Krizanc, D. et al. Distrib. Comput. (2016) 29: 361. doi:10.1007/s00446-016-0267-x

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.

Keywords

Barrier coverage Wireless relocatable sensors Autonomous mobile robots Optimal algorithms Distributed algorithms 

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  • Mohsen Eftekhari
    • 1
  • Evangelos Kranakis
    • 2
  • Danny Krizanc
    • 3
  • Oscar Morales-Ponce
    • 4
  • Lata Narayanan
    • 1
  • Jaroslav Opatrny
    • 1
  • Sunil Shende
    • 5
  1. 1.Department Computer Science and Software EngineeringConcordia UniversityMontrealCanada
  2. 2.School of Computer ScienceCarleton UniversityOttawaCanada
  3. 3.Department of Mathematics and Computer ScienceWesleyan UniversityMiddletownUSA
  4. 4.Department of Computer ScienceChalmers University of TechnologyGothenburgSweden
  5. 5.Department of Computer ScienceRutgers UniversityCamdenUSA

Personalised recommendations