Energy Efficient Monitoring in Sensor Networks

No abstract is available for this paper.

• Publication year

  2008

• Venue

  Algorithmica

• Publication date

  2008-04-07

• Fields of study

  Mathematics, Computer Science, Engineering, Environmental Science

• Identifiers
  DOI 10.1007/s00453-010-9407-z
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• ENERGY EFFICIENT COVERAGE PROBLEMS IN WIRELESS Ad Hoc SENSOR NETWORKS

  2011cited by this paper
• Coloring Geometric Range Spaces

  2009cited by this paper
• Optimal approximation for the submodular welfare problem in the value oracle model

  2008cited by this paper
• Maximizing Lifetime of Sensor Surveillance Systems

  2007cited by this paper
• On maximizing welfare when utility functions are subadditive

  2006cited by this paper
• Restricted strip covering and the sensor cover problem

  2006cited by this paper
• Energy-efficient target coverage in wireless sensor networks

  2005cited by this paper
• Delay efficient sleep scheduling in wireless sensor networks

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

  2004cited by this paper
• Network coverage using low duty-cycled sensors: random & coordinated sleep algorithms

  2004cited by this paper
• A simple algorithm for edge-coloring bipartite multigraphs

  2003cited by this paper
• Query Processing in Sensor Networks

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

  2003influential reference
• Integrated coverage and connectivity configuration in wireless sensor networks

  2003cited by this paper
• Wireless sensor networks for habitat monitoring

  2002cited by this paper
• Wireless sensor networks: a survey

  2002cited by this paper
• Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet

  2002cited by this paper
• Habitat monitoring: application driver for wireless communications technology

  2001cited by this paper
• Some optimal inapproximability results

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

  2001influential reference
• Directed diffusion: a scalable and robust communication paradigm for sensor networks

  2000cited by this paper
• A discrete-time battery model for high-level power estimation

  2000cited by this paper
• System architecture directions for networked sensors

  2000cited by this paper
• Approximating the domatic number

  2000cited by this paper
• Improved approximation algorithms for MAXk-CUT and MAX BISECTION

  1995influential reference
• .879-approximation algorithms for MAX CUT and MAX 2SAT

  1994cited by this paper
• Node-and edge-deletion NP-complete problems

  1978cited by this paper
• Proceedings of the 5th Symposium on Operating Systems Design and Implementation Tag: a Tiny Aggregation Service for Ad-hoc Sensor Networks

  year unknowncited by this paper

• Fixed Set Search Applied to the Max-Cut Problem

  2024cites this paper
• Approximation Algorithms for Geometric Clustering and Touring Problems

  2018influential citation
• Energy Efficient Fault Tolerant Coverage in Wireless Sensor Networks

  2017cites this paper
• Improved Energy-Efficient Target Coverage in Wireless Sensor Networks

  2017cites this paper
• Bayesian aggregation of evidence for detection and characterization of patterns in multiple noisy observations

  2016cites this paper
• Scheduling Resource-Bounded Monitoring Devices for Event Detection and Isolation in Networks

  2016cites this paper
• Performance Comparison of Routing Protocols in Bipartite Wireless Sensor Network

  2015cites this paper
• Game-Theoretic Based Distributed Scheduling Algorithms for Minimum Coverage Breach in Directional Sensor Networks

  2014cites this paper
• Hybrid Algorithms for Scheduling Sensors for Guarding Polygonal Domains

  2014cites this paper
• Parameterized complexity of Max-lifetime Target Coverage in wireless sensor networks

  2014cites this paper
• Redundancy Model and Boundary Effects Based Coverage-Enhancing Algorithm for 3D Underwater Sensor Networks

  2014cites this paper
• International Journal of Advance Research in Computer Science and Management Studies

  2014cites this paper
• A classification of solutions for the energy limitation in Wireless Sensor Networks

  2013cites this paper
• MATHEMATICAL ENGINEERING TECHNICAL REPORTS Valuated Matroid-Based Algorithm for Submodular Welfare Problem

  2013cites this paper
• Broadcasting, coverage, energy efficiency and network capacity in wireless networks

  2013cites this paper
• Probabilistic filters: A stream protocol for continuous probabilistic queries

  2013cites this paper
• Maximizing the Life Time of Wireless Sensor Networks: A Survey with a possible solution to further enhance the life time of WSNs

  2013cites this paper
• A low coverage first classifying algorithm for wireless sensor networks

  2011cites this paper
• Geometric Hitting Sets and Their Variants

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

  2011cites this paper
• Simultaneous Optimization of Sensor Placements and Balanced Schedules

  2011cites this paper
• Coverage Lifetime Maximization

  2010cites this paper
• Evaluating Continuous Probabilistic Queries Over Imprecise Sensor Data

  2010cites this paper
• Weighted geometric set cover via quasi-uniform sampling

  2010cites this paper
• Clusters and covers: geometric set cover algorithms

  2010cites this paper
• Optimal Value of Information in Graphical Models

  2009cites this paper
• Large Monitoring Systems: Data Analysis, Design and Deployment

  2009cites this paper
• Simultaneous placement and scheduling of sensors

  2009cites this paper
• Optimizing sensing: theory and applications

  2008cites this paper
• The geometric Set k-cover problem through the prism of polychromatic colorings of range spaces and planar graphs

  year unknowncites this paper