Improved approximation algorithms for connected sensor cover

Authors:
Stefan Funke;Alex Kesselman;Fabian Kuhn;Zvi Lotker;Michael Segal
Affiliations:
Max Planck Institut fur Informatik, Saarbrucken, Germany;Max Planck Institut fur Informatik, Saarbrucken, Germany and Dipartimento di Scienze dell'Informazione at Universita di Roma La Sapienza, Italy;Computer Engineering an Networks Laboratory, ETH Zurich, Zurich, Switzerland;Project Mascotte, INRIA, Sophia Antipolis, France;Communication Systems Engineering Dept., Ben-Gurion University of the Negev, Beer-Sheva, Israel
Venue:
Wireless Networks
Year:
2007

Citing 17
Cited 8

An optimal algorithm for finding a maximum independent set of a circular-arc graph

SIAM Journal on Computing
Minimum cuts for circular-arc graphs

SIAM Journal on Computing
How to net a lot with little: small &egr;-nets for disks and halfspaces

SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Unit disk graphs

Discrete Mathematics - Topics on domination
Approximation schemes for covering and packing problems in image processing and VLSI

Journal of the ACM (JACM)
Improved methods for approximating node weighted Steiner trees and connected dominating sets

Information and Computation
Embedding the Internet: introduction

Communications of the ACM
Geography-informed energy conservation for Ad Hoc routing

Proceedings of the 7th annual international conference on Mobile computing and networking
Span: An energy-efficient coordination algorithm for topology maintenance in Ad Hoc wireless networks

Proceedings of the 7th annual international conference on Mobile computing and networking
A coverage-preserving node scheduling scheme for large wireless sensor networks

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Wireless sensor networks for habitat monitoring

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks

IEEE Transactions on Computers
Connected sensor cover: self-organization of sensor networks for efficient query execution

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Integrated coverage and connectivity configuration in wireless sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
Set k-cover algorithms for energy efficient monitoring in wireless sensor networks

Proceedings of the 3rd international symposium on Information processing in sensor networks

Review: Coverage and connectivity issues in wireless sensor networks: A survey

Pervasive and Mobile Computing
Q-Coverage Problem in Wireless Sensor Networks

ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Surveillance with wireless sensor networks in obstruction: Breach paths as watershed contours

Computer Networks: The International Journal of Computer and Telecommunications Networking
Hybrid genetic algorithm using a forward encoding scheme for lifetime maximization of wireless sensor networks

IEEE Transactions on Evolutionary Computation - Special issue on preference-based multiobjective evolutionary algorithms
Coverage problems in sensor networks: A survey

ACM Computing Surveys (CSUR)
A family of simple distributed minimum connected dominating set-based topology construction algorithms

Journal of Network and Computer Applications
More is more: The benefits of denser sensor deployment

ACM Transactions on Sensor Networks (TOSN)
Sensor activation and radius adaptation (SARA) in heterogeneous sensor networks

ACM Transactions on Sensor Networks (TOSN)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Wireless sensor networks have recently posed many new system building challenges. One of the main problems is energy conservation since most of the sensors are devices with limited battery life and it is infeasible to replenish energy via replacing batteries. An effective approach for energy conservation is scheduling sleep intervals for some sensors, while the remaining sensors stay active providing continuous service. In this paper we consider the problem of selecting a set of active sensors of minimum cardinality so that sensing coverage and network connectivity are maintained. We show that the greedy algorithm that provides complete coverage has an approximation factor no better than Ω(log n), where n is the number of sensor nodes. Then we present algorithms that provide approximate coverage while the number of nodes selected is a constant factor far from the optimal solution. Finally, we show how to connect a set of sensors that already provides coverage.