Energy Efficient Monitoring in Sensor Networks

DOI10.1007/978-3-540-78773-0_38zbMATH Open1136.68323OpenAlexW2704408510MaRDI QIDQ5458549FDOQ5458549

Mohammed Toossi, Azarakhsh Malekian, Samir Khuller, Amol Deshpande

Publication date: 15 April 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.157.4203

Recommendations

• Energy efficient monitoring in sensor networks
• Designing \(k\)-coverage schedules in wireless sensor networks
• Set it and forget it: approximating the set once strip cover problem
• ``Green barrier coverage with mobile sensors
• Covering a planar region by randomly distributed sensors

Mathematics Subject Classification ID

Approximation algorithms (68W25) Network design and communication in computer systems (68M10)

Cites Work

• Some optimal inapproximability results
• Node-and edge-deletion NP-complete problems
• Improved approximation algorithms for MAX \(k\)-CUT and MAX BISECTION
• Approximating theDomatic Number
• .878-approximation algorithms for MAX CUT and MAX 2SAT
• A simple algorithm for edge-coloring bipartite multigraphs

Cited In (6)

• Efficient point coverage in wireless sensor networks
• Energy efficient monitoring in sensor networks
• A fast localized algorithm for scheduling sensors
• Valuated matroid-based algorithm for submodular welfare problem
• Title not available (Why is that?)
• Designing \(k\)-coverage schedules in wireless sensor networks

This page was built for publication: Energy Efficient Monitoring in Sensor Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458549)