Improved approximation algorithms for connected sensor cover
Purchase on Springer.com
$39.95 / €34.95 / £29.95*
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.
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.
- Z. Abrams, A. Goel and S. Plotkin, Set k-cover algorithms for energy efficient monitoring in wireless sensor networks, in Proc. of Third International Symposium on Information Processing in Sensor Networks (IPSN) (2004).
- I. F. Akyildiz, W. Su, Y. Sankarasubramaniam and E. Cayirci, Wireless sensor networks: A survey, Computer Networks (March 2002).
- P. Berman, G. Calinescu, C. Shah and A. Zelikovsky, Power efficient monitoring management in sensor networks, in IEEE Wireless Communication and Networking Conference (WCNC’04), Atlanta, (March 2004).
- B. Badrinath, M. Srivastava, K. Mills, J.S Holtz and K. Sollins, Editors, Special issue on smart spaces and environments, in IEEE Personal Communications (2000).
- B. Ben-Moshe, M. J. Katz and M. Segal, Obnoxious facility location: Complete service with minimal harm, International Journal of Computational Geometry and Applications 10 (2000) 581–592. CrossRef
- H. Brönnimann and M. T. Goodrich, Almost optimal set covers in finite VC-dimension, Discrete and Computational Geometry 14 (1995) 463–479.
- P. Bose, A. Maheshwari, P Morin and J. Morrison, The grid placement problem, in Proceedings of the 7th Annual Workshop on Algorithms and Data Structures, Vol. 2125 of LNCS (2001) pp. 180–191.
- A. Cerpa and D. Estrin, ASCENT: Adaptive self-configuring sensor networks topologies, in Proc. of INFOCOM ’02, New York, NY, USA, (June 2002).
- K. Chakrabarty, S.S. Iyengar, H. Qi and E. Cho, Grid coverage for surveillance and target location in distributed sensor networks, IEEE Transactions on Computers 51(12) (December 2002) 1448–1453. CrossRef
- B. Chen, K. Jamieson, H. Balakrishnan and R. Morris, Span: An energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks, in ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom 2001), Rome, Italy (July 2001).
- B. Clark, C. Colbourn and D. Johnson, Unit Disk Graphs, Discrete Mathematics 86 (1990) 165–177. CrossRef
- S.S. Dhillon and K. Chakrabarty, Sensor placement for effective coverage and surveillance in distributed sensor networks, in Proc. of IEEE Wireless Communications and Networking Conference (2003) pp. 1609–1614.
- D. Estrin, R. Govindan and J. Heidemann, Editors, special issue on embedding the internet, Communications of the ACM, 43 (2000).
- M. Franceschetti, M. Cook and J. Bruck, A geometric theorem for approximate disk covering algorithms, Technical Report ETR035, Caltech University (January 2001).
- S. Funke, A. Kesselman, U. Meyer and M. Segal, A simple improved distributed algorithm for minimum cds in unit disk graphs, in IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2005), to appear.
- S. Guha and S. Khuller, Improved methods for approximating node weighted steiner trees and connected dominating sets, Inf. Comput., 150(1) (1999) 57–74. CrossRef
- H. Gupta, S.R. Das and Quinyi Gu, Connected sensor cover: Self-organization of sensor networks for efficient query execution, in Proc. of MobiHoc 03, Annapolis, Maryland (June 2003).
- D.S. Hochbaum and W. Maas, Approximation schemes for covering and packing problems in image processing and vlsi, J. ACM 32 (1985) 130–136.
- H. Huang, A. Richa and M. Segal, Dynamic coverage and related problems in ad hoc sensor networks, ACM Mobile Networks and Applications: Special Issue on Algorithmic Solutions for Wireless, Mobile, Ad Hoc and Sensor Networks (2003).
- D.S. Johnson, Approximation algorithms for combinatorial problems, J. Comput. System Sci. 9 (1974) 256–278. CrossRef
- D.T. Lee, M. Sarrafzadeh and Y.F. Wu, Minimum cut for circular-arc graphs, SIAM J. Computing 19(6) (1990) 1041–1050. CrossRef
- A. Mainwaring, J. Polastre, R. Szewczyk and D. Culler, Wireless sensor networks for habitat monitoring, in First ACM International Workshop on Wireless Workshop in Wireless Sensor Networks and Applications (August 2002).
- S. Masuda and K. Nakajima, An optimal algorithm for finding a maximum independent set of a circular-arc graph, SIAM Journal on Computing, 17(1) (1988) 41–52. CrossRef
- J. Matousek, R. Seidel and E. Welzl, How to net a lot with little: Small ε-nets for disks and halfspaces, in Proc. of 6th Annu. ACM Sympos. Comput. Geom. (1990) pp. 16–22.
- S. Meguerdichian and M. Potkonjak, Low power 0/1 coverage and scheduling techniques in sensor networks, UCLA Technical Report 030001 (January 2003).
- S. Slijepcevic and M. Potkonjak, Power efficient organization of wireless sensor networks, in Proc. of IEEE International Conference on Communications (ICC) (2001) pp. 472–476.
- D. Tian and N.D. Georganas, A coverage-preserved node scheduling scheme for large wireless sensornetworks, in Proc. of First International Workshop on Wireless Sensor Networks and Applications, Atlanta, USA (September 2002).
- P.J. Wan, K. Alzoubi and O. Frieder, Distributed construction of connected dominating set in wireless ad hoc networks, in Proc. of INFOCOM 2002.
- X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless and C.D. Gill, Integrated coverage and connectivity configuration in wireless sensor networks, in Proc. of SenSys ’03.
- Y. Xu, J. Heidemann, and D. Estrin, Geography-informed energy conservation for ad hoc routing, in ACM/IEEE International Conference on Mobile Computing and Networking (Proc. of MobiCom 2001), Rome, Italy, (July 2001).
- F. Ye, G. Zhong, S. Lu and L. Zhang, Peas: A robust energy conserving protocol for long-lived sensor networks, in Proc. of The 23nd International Conference on Distributed Computing Systems (ICDCS) (2003).
- H. Zhang and J.C. Hou, Maintaining sensing coverage and connectivity in large sensor networks, Technical Report UIUC (2003) UIUCDCS-R-2003–2351.
- Improved approximation algorithms for connected sensor cover
Volume 13, Issue 2 , pp 153-164
- Cover Date
- Print ISSN
- Online ISSN
- Kluwer Academic Publishers
- Additional Links
- Approximation algorithms
- Sensing connected coverage
- Industry Sectors
- Author Affiliations
- 1. Max Planck Institut fur Informatik, Saarbrucken, Germany
- 2. Dipartimento di Scienze dell’Informazione, Universita di Roma La Sapienza, Italy
- 3. Computer Engineering an Networks Laboratory, ETH Zurich, 8092, Zurich, Switzerland
- 4. Project Mascotte, INRIA, Sophia Antipolis, 06902, France
- 5. Communication Systems Engineering Dept., Ben-Gurion University of the Negev, Beer-Sheva, Israel