Joint sensing duty cycle scheduling for heterogeneous coverage guarantee

No abstract is available for this paper.

• Publication year

  2017

• Venue

  IEEE Conference on Computer Communications

• Publication date

  2017-05-01

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1109/INFOCOM.2017.8056961
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Approximation Algorithms

  2021cited by this paper
• Joint sensor duty cycle scheduling with coverage guarantee

  2016cited by this paper
• Approximate Clustering via Metric Partitioning

  2015cited by this paper
• A PTAS for the Weighted Unit Disk Cover Problem

  2015cited by this paper
• Near-Linear Algorithms for Geometric Hitting Sets and Set Covers

  2014cited by this paper
• Connected wireless camera network deployment with visibility coverage

  2014cited by this paper
• Energy-Efficient Broadcast Scheduling with Minimum Latency for Low-Duty-Cycle Wireless Sensor Networks

  2013cited by this paper
• A constant-factor approximation for multi-covering with disks

  2013cited by this paper
• Coverage algorithms for visual sensor networks

  2013cited by this paper
• A note on multicovering with disks

  2013cited by this paper
• Weighted geometric set multi-cover via quasi-uniform sampling

  2012cited by this paper
• Collaborative sensor scheduling for space situational awareness

  2012cited by this paper
• Optimal Distributed Blanket Coverage Self-Deployment of Mobile Wireless Sensor Networks

  2012cited by this paper
• Dynamic Duty-Cycle Scheduling Schemes for Energy-Harvesting Wireless Sensor Networks

  2012cited by this paper
• Unit Disk Cover Problem

  2012cited by this paper
• On full-view coverage in camera sensor networks

  2011cited by this paper
• Multi Cover of a Polygon Minimizing the Sum of Areas

  2011cited by this paper
• Coverage problems in sensor networks: A survey

  2011cited by this paper
• Duty cycle scheduling in dynamic sensor networks for controlling event detection probabilities

  2011cited by this paper
• Camera Scheduling and Energy Allocation for Lifetime Maximization in User-Centric Visual Sensor Networks

  2010cited by this paper
• On the set multi-cover problem in geometric settings

  2009cited by this paper
• Barrier Coverage of Line-Based Deployed Wireless Sensor Networks

  2009cited by this paper
• QoS-aware target coverage in wireless sensor networks

  2009cited by this paper
• Dynamic scheduling of cover-sets in randomly deployed Wireless Video Sensor Networks for surveillance applications

  2009cited by this paper
• A Threshold of ln(n) for approximating set cover

  2009cited by this paper
• Coverage and connectivity issues in wireless sensor networks: A survey

  2008cited by this paper
• Binary integer programming formulation and heuristics for differentiated coverage in heterogeneous sensor networks

  2008cited by this paper
• Deploying Four-Connectivity and Full-Coverage Wireless Sensor Networks

  2008cited by this paper
• Et al

  2008cited by this paper
• Approximate Initialization of Camera Sensor Networks

  2007cited by this paper
• Effective Sensor Scheduling Schemes in a Sensor Network by Employing Feedback in the Communication Loop

  2007cited by this paper
• A Survey of Energy-Efficient Scheduling Mechanisms in Sensor Networks

  2006cited by this paper
• Adaptive Duty Cycling for Energy Harvesting Systems

  2006cited by this paper
• Generalized Pinwheel Problem

  2005cited by this paper
• Connected K-coverage problem in sensor networks

  2004cited by this paper
• Energy-efficient surveillance system using wireless sensor networks

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

  2003cited by this paper
• Low Power 0 / 1 Coverage and Scheduling Techniques in Sensor Networks

  2003cited by this paper
• Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks

  2002cited by this paper
• Analysis of the greedy approach in problems of maximum k‐coverage

  1998cited by this paper
• Almost optimal set covers in finite VC-dimension

  1995cited by this paper
• Art gallery theorems and algorithms

  1987cited by this paper
• An analysis of approximations for maximizing submodular set functions—I

  1978cited by this paper

• Patrol Security Game: Defending Against Adversary with Freedom in Attack Timing, Location, and Duration

  2024cites this paper
• On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem

  2022cites this paper
• Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency

  2020cites this paper
• Patrol Scheduling Against Adversaries with Varying Attack Durations

  2019cites this paper
• Reliable Communication and Latency Bound Generation in Wireless Cyber-Physical Systems

  2019cites this paper