Distributed algorithms for barrier coverage using relocatable sensors

No abstract is available for this paper.

• Publication year

  2013

• Venue

  Distributed computing

• Publication date

  2013-07-22

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/s00446-016-0267-x
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Circle Formation by Asynchronous Transparent Fat Robots

  2013cited by this paper
• Distributed Computing by Oblivious Mobile Robots

  2012cited by this paper
• Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain

  2012cited by this paper
• Minimizing the number of sensors moved on line barriers

  2011cited by this paper
• Multi-Round Sensor Deployment for Guaranteed Barrier Coverage

  2010cited by this paper
• On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment

  2010cited by this paper
• On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment

  2009cited by this paper
• Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region

  2008cited by this paper
• Barrier Coverage with Mobile Sensors

  2008cited by this paper
• Reliable density estimates for coverage and connectivity in thin strips of finite length

  2007cited by this paper
• Gathering few fat mobile robots in the plane

  2006cited by this paper
• Local Algorithms for Autonomous Robot Systems

  2006cited by this paper
• Distributed Algorithms for Autonomous Mobile Robots

  2006cited by this paper
• Barrier coverage with wireless sensors

  2005cited by this paper
• Eventually consistent compasses for robust gathering of asynchronous mobile robots with limited visibility

  2005cited by this paper
• On k-coverage in a mostly sleeping sensor network

  2004cited by this paper
• The Coverage Problem in a Wireless Sensor Network

  2003cited by this paper
• Coverage problems in wireless ad-hoc sensor networks

  2001cited by this paper
• Gathering of Asynchronous Oblivious Robots with Limited Visibility

  2001cited by this paper
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns

  1999cited by this paper
• Formation and agreement problems for synchronous mobile robots with limited visibility

  1995cited by this paper
• Interaction and intelligent behavior

  1994cited by this paper

• AutoBar: Automatic Barrier Coverage Formation for Danger Keep Out Applications in Smart City

  2023cites this paper
• Echo Location Based Bat Algorithm for Energy Efficient WSN Routing

  2022cites this paper
• On synchronization and orientation in distributed barrier coverage with relocatable sensors

  2021cites this paper
• Can a Skywalker Localize the Midpoint of a Rope?

  2021cites this paper
• On the Energy in Displacement of Random Sensors for Connectivity and Interference

  2020cites this paper
• Online Sequential DV-Hop Localization Algorithm for Wireless Sensor Networks

  2020cites this paper
• Analysis of the Threshold for the Displacement to the Power of Random Sensors

  2018cites this paper
• Temporal Vertex Cover with a Sliding Time Window

  2018influential citation
• On the Maximum Movement of Random Sensors for Coverage and Interference on a Line

  2018cites this paper
• Multi-robot Distributed Cooperative Monitoring of Mobile Targets

  2018cites this paper
• On the maximum movement to the power of random sensors for coverage and interference

  2018cites this paper
• Analysis of the Threshold for Energy Consumption in Displacement of Random Sensors

  2018cites this paper
• Self-stabilizing Localization of the Middle Point of a Line Segment by an Oblivious Robot with Limited Visibility

  2017influential citation
• Stabilization, Safety, and Security of Distributed Systems

  2017influential citation
• Minimizing mobile sensor movements to form a line K-coverage

  2017cites this paper
• Weak Coverage of a Rectangular Barrier

  2017cites this paper
• A study of sensor movement and selection strategies for strong barrier coverage

  2017cites this paper
• Can Walker Localize The Middle Point of A Line-segment?.

  2017influential citation
• A survey on barrier coverage with sensors

  2016cites this paper
• Unified View of Graph Searching and LDFS-Based Certifying Algorithms

  2016cites this paper
• Uniform Covering of Rings and Lines by Memoryless Mobile Sensors

  2016cites this paper
• Non-linear barrier coverage using mobile wireless sensors

  2016cites this paper
• On the Displacement for Covering a Square with Randomly Placed Sensors

  2015cites this paper
• Efficient Line K-Coverage Algorithms in Mobile Sensor Network

  2015cites this paper
• On the Displacement for Covering a $d-$dimensional Cube with Randomly Placed Sensors

  2015cites this paper
• Optimized barrier location for barrier coverage in mobile sensor networks

  2015cites this paper
• Minimizing Total Sensor Movement for Barrier Coverage by Non-uniform Sensors on a Line

  2015cites this paper
• BARRIER COVERAGE WITH WIRELESS SENSOR NETWORKS

  2014cites this paper
• Optimal online and offline algorithms for robot-assisted restoration of barrier coverage

  2014cites this paper
• Minimal Patching Barrier Healing Strategy for barrier coverage in hybrid WSNs

  2014cites this paper
• Distributed Barrier Coverage with Relocatable Sensors

  2014cites this paper