Skip to main content
SpringerLink
Log in
Book cover

International Conference on Distributed Computing in Sensor Systems

DCOSS 2005: Distributed Computing in Sensor Systems pp 340–353Cite as

A Distributed Greedy Algorithm for Connected Sensor Cover in Dense Sensor Networks

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3560))

Abstract

Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy in dense networks, and by scheduling nodes efficiently, minimum battery drainage is possible. In this paper, we focus on the problem of Minimum Connected Sensor Cover (MCSC), an NP-hard problem, and describe a distributed greedy algorithm to generate sub-optimal connected sensor covers for homogeneous dense static sensor networks. Our greedy algorithm is based on the notions of maximal independent sets on random geometric graphs, and on the structure of Voronoi diagram. We provide complexity analysis and bounds on the cardinalities of maximal independent sets (MIS) for our problem scenario, and derive an analytical expression for the size of the sub-optimal minimum connected sensor cover. We verify the bounds on the MIS using simulation.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Di Tian, Georganas, N.D.: A coverage-preserving node scheduling scheme for large wireless sensor networks. In: Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications - WSNA 2002, Atlanta, Georgia, USA, September 2002, pp. 32–41 (2002)

    Google Scholar 

  2. Gao, Y., Wu, K., Li, F.: Analysis on the redundancy of wireless sensor networks. In: Proceedings of the 2nd ACM International Conference on Wireless Sensor Networks and Applications - WSNA 2003, San Diego, California, USA, pp. 108–114. ACM Press, New York (2003)

    Chapter  Google Scholar 

  3. Huang, C.-F., Tseng, Y.-C.: The coverage problem in a wireless sensor network. In: Proceedings of the 2nd ACM International Conference on Wireless Sensor Networks and Applications - WSNA 2003, San Diego, CA, September 2003, pp. 115–121 (2003)

    Google Scholar 

  4. Wang, X., Xing, G., Zhang, Y., Lu, C., Pless, R., Gill, C.: Integrated coverage and connectivity configuration in wireless sensor networks. In: Proceedings of the 1st International Conference on Embedded Networked Sensor Systems - Sensys 2003, Los Angeles, CA, November 2003, pp. 28–39 (2003)

    Google Scholar 

  5. Zhang, H., Hou, J.C.: Maintaining sensing coverage and connectivity in large sensor networks. In: Proceedings of the International Workshop on Theoretical and Algorithmic Aspects of Sensor, Ad hoc Wireless and Peer-to-Peer Networks - AlgoSensors 2004, Florida, USA (February 2004)

    Google Scholar 

  6. Ghosh, A., Das, S.K.: Coverage and Connectivity Issues in Wireless Sensor Networks: Wireless, Mobile and Sensor Networks. John Wiley & Sons, Chichester (2005)

    Google Scholar 

  7. Anil Kumar, V.S., Arya, S., Ramesh, H.: Hardness of set cover with intersection 1. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 624–635. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  8. Gupta, H., Das, S.R., Gu, Q.: Connected sensor cover: self-organization of sensor networks for efficient query execution. In: Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking & Computing - MobiHoc 2003, Annapolis, Maryland, USA, pp. 189–200. ACM Press, New York (2003)

    Chapter  Google Scholar 

  9. Zhou, Z., Das, S., Gupta, H.: Variable radii connected sensor cover in sensor networks. In: Proceedings of the 1st IEEE International Conference on Sensor and Ad Hoc Communications and Networks - SECON 2004, Santa Clara, California, USA, October 2004, pp. 387–396 (2004)

    Google Scholar 

  10. Funke, S., Kesselman, A., Lotker, Z., Segal, M.: Improved approximation algorithms for connected sensor cover. In: Proceedings of 3rd International Conference on Ad Hoc Networks & Wireless ADHOC-NOW 2004, pp. 56–69 (2004)

    Google Scholar 

  11. Patwari, N., Hero III, A.O.: Using proximity and quantized rss for sensor localization in wireless networks. In: Proceedings of the 2nd ACM International Conference on Wireless Sensor Networks and Applications - WSNA 2003, San Diego, CA, September 2003, pp. 20–29 (2003)

    Google Scholar 

  12. Garey, M.R., Johnson, D.S.: Computers and Intractability, a Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1991)

    Google Scholar 

  13. Aurenhammer, F.: Voronoi diagrams a survey of a fundamental geometric data structure. ACM Computing Surveys 23, 345–405 (1991)

    Article  Google Scholar 

  14. Goldberg, M.K., Hollinger, D., Magdon-Ismail, M.: Experimental evaluation of the greedy and random algorithms for finding independent sets in random graphs. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol. 3503, pp. 513–523. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  15. Ghosh, A.: Estimating coverage holes and enhancing coverage in mixed sensor networks. In: Proceedings of the 29th Annual IEEE Conference on Local Computer Networks. LCN 2004, Tampa, Florida, November 2004, pp. 68–76 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center for Research in Wireless Mobility and Networking (CReWMaN), Department of Computer Science and Engineering, The University of Texas at Arlington, Arlington, TX, 76019

    Amitabha Ghosh & Sajal K. Das

Authors
  1. Amitabha Ghosh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sajal K. Das
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering, University of Southern California, 90089-2562, Los Angeles, CA, USA

    Viktor K. Prasanna

  2. Department of Computer Science, Louisiana State University, Baton Rouge, USA

    Sitharama S. Iyengar

  3. Department of Computer Engineering and Informatics, University of Patras, 26500, Rio, Patras, Greece

    Paul G. Spirakis

  4. School of Engineering and Applied Sciences, Harvard University, 02138, Cambridge, MA, USA

    Matt Welsh

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ghosh, A., Das, S.K. (2005). A Distributed Greedy Algorithm for Connected Sensor Cover in Dense Sensor Networks. In: Prasanna, V.K., Iyengar, S.S., Spirakis, P.G., Welsh, M. (eds) Distributed Computing in Sensor Systems. DCOSS 2005. Lecture Notes in Computer Science, vol 3560. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11502593_26

Download citation

  • DOI: https://doi.org/10.1007/11502593_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26422-4

  • Online ISBN: 978-3-540-31671-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation