Sentry selection in sensor networks: theory and algorithms

No abstract is available for this paper.

• Publication year

  2017

• Venue

  Int. J. Sens. Networks

• Publication date

  Unknown publication date

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1504/IJSNET.2015.10001255
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Unsplittable Coverings in the Plane

  2013cited by this paper
• Toward Adaptive Sleep Schedules for Balancing Energy Consumption in Wireless Sensor Networks

  2012cited by this paper
• Sentry Selection in Wireless Networks

  2010cited by this paper
• Coverage and Detection of a Randomized Scheduling Algorithm in Wireless Sensor Networks

  2010cited by this paper
• An Adaptive Partitioning Scheme for Sleep Scheduling and Topology Control in Wireless Sensor Networks

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

  2007cited by this paper
• Decomposition of multiple coverings into many parts

  2007cited by this paper
• Toward Quasiregular Sensor Networks: Topology Control Algorithms for Improved Energy Efficiency

  2006cited by this paper
• Indecomposable Coverings

  2005cited by this paper
• Dynamic node activation in networks of rechargeable sensors

  2005cited by this paper
• Continuum percolation with steps in the square or the disc

  2005cited by this paper
• On the Coverage and Detectability of Large-scale Wireless Sensor Networks

  2003influential reference
• Sentry-Based Power Management in Wireless Sensor Networks

  2003cited by this paper
• Set k-cover algorithms for energy efficient monitoring in wireless sensor networks

  2003cited by this paper
• A coverage-preserving node scheduling scheme for large wireless sensor networks

  2002cited by this paper
• Power efficient organization of wireless sensor networks

  2001cited by this paper
• Decomposition problems for multiple coverings with unit balls, manuscript.

  1988cited by this paper
• Random coverings in several dimensions

  1986cited by this paper
• On the Coverage of $k$-Dimensional Space by $k$-Dimensional Spheres

  1985cited by this paper
• The probability of covering a sphere with N circular caps

  1965cited by this paper
• Random circles on a sphere

  1962cited by this paper
• Transactions on Computers

  year unknowncited by this paper

• Modeling of Intelligent Sensor Duty Cycling for Smart Home Automation

  2022cites this paper
• An Energy Efficient Sensor Duty Cycling for Smart Home Networks

  2021cites this paper
• Coverage probability in wireless networks with determinantal scheduling

  2020cites this paper
• Randomized detection and detection capacity of multidetector networks

  2017cites this paper