Skip to main content

An Energy Efficient Connected Coverage Protocol in Wireless Sensor Networks

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4505))

Abstract

The connected coverage is one of the most important problems in Wireless Sensor Networks. However, most existing approaches to connected coverage require knowledge of accurate location information. This paper solves a challenging problem: without accurate location information, how to schedule sensor nodes to save energy and meet both constraints of sensing area coverage and network connectivity. Our solution is based on the theoretical analysis of the sensing area coverage property of minimal dominating set. We establish the relationship between point coverage and area coverage, and derive the upper and lower bound that point coverage is equivalent to area coverage in random geometric graphs. Based on the analytical results and the existing algorithms which construct the connected dominating set, an Energy Efficient Connected Coverage Protocol (EECCP) is proposed. Extensive simulation studies show that the proposed connected coverage protocol can effectively maintain both high quality sensing coverage and connectivity for a long time.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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. Akyildiz, F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless sensor networks: a survey. Computer Networks 38(4), 393–422 (2002)

    Article  Google Scholar 

  2. Stojmenovic, I.: Position based routing in ad hoc networks. IEEE Communications Magazine 40(7), 128–134 (2002)

    Article  Google Scholar 

  3. Wan, P.J., Alzoubi, K.M., Frieder, O.: Distributed construction of connected dominating set in wireless ad hoc networks. In: Proc. of IEEE INFOCOM, pp. 1597–1604 (2002)

    Google Scholar 

  4. Alzoubi, K.M., Wan, P.J., Frieder, O.: Message-optimal connected dominating sets in mobile ad hoc networks. In: Proc. of the ACM Int’l Symp. on MobiHoc, pp. 157–164 (2002)

    Google Scholar 

  5. Chen, Y., Liestman, A.: Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks. In: Proc. of the ACM Int’l Symp. on MobiHoc, pp. 165–172 (2002)

    Google Scholar 

  6. Wu, J., Dai, F.: Broadcasting in ad hoc networks based on self-pruning. In: Proc. of IEEE INFOCOM 2003, San Francisco, pp. 2240–2250 (2003)

    Google Scholar 

  7. Dai, F., Wu, J.: An extended localized algorithm for connected dominating set formation in ad hoc wireless networks. IEEE Transaction on Parallel and Distributed Systems 15(10), 908–920 (2004)

    Article  Google Scholar 

  8. Cardei, M., Wu, J.: Energy-efficient coverage problems in wireless ad-hoc sensor networks. Computer communication 29, 413–420 (2006)

    Article  Google Scholar 

  9. Shakkottai, S., Srikant, R., Shroff, N.: Unreliable sensor grids: coverage, connectivity and diameter. In: Proc. of IEEE INFOCOM (2003)

    Google Scholar 

  10. Zhang, H., Hou, J.C.: Maintaining sensing coverage and connectivity in large sensor networks. Ad Hoc & Wireless Networks 1(1), 89–124 (2005)

    Google Scholar 

  11. 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 ACM Int’l Conf. on Embedded Networked Sensor Systems (SenSys), pp. 28–39 (2003)

    Google Scholar 

  12. Chen, B., Jamieson, K., Balakrishnan, H., Morris, R.: SPAN: An energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks. In: Proceedings of the 7th ACM Int’l Conf. on Mobile Computing and Networking (MobiCom), pp. 85–96 (2001)

    Google Scholar 

  13. Carle, J., Gallais, A., Simplot-Ryl, D.: Preserving area coverage in wireless sensor networks by using surface coverage relay dominating sets. In: Proc. of the 10th IEEE Symp. on Computers and Communications (ISCC), pp. 347–352 (2005)

    Google Scholar 

  14. Gupta, H., Das, S.R., Gu, Q.: Connected sensor cover: Self-Organization of sensor networks for efficient query execution. In: Proc. of the ACM Int’l Symp. on MobiHoc, pp. 189–200 (2003)

    Google Scholar 

  15. Zhou, Z., Das, S.R., Gupta, H.: Fault tolerant connected sensor cover with variable sensing and transmission ranges. In: Proc. of 2nd Annual IEEE Communications Society Conf. on Sensor and Ad Hoc Communications and Networks (SECON), pp. 594–604 (2005)

    Google Scholar 

  16. Cheng, H.-L., Edelsbrunner, H.: Area and Perimeter Derivatives of a Union of Disks. In: Klein, R., Six, H.-W., Wegner, L. (eds.) Computer Science in Perspective. LNCS, vol. 2598, pp. 88–97. Springer, Heidelberg (2003)

    Google Scholar 

  17. Liu, B., Towsley, D.: A study of the coverage of large-scale sensor networks. In: Proc. of the first IEEE Int’l Conf. on Mobile Ad hoc and Sensor Systems (MASS), pp. 475–483 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Guozhu Dong Xuemin Lin Wei Wang Yun Yang Jeffrey Xu Yu

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Mao, Y., Xu, Z., Liang, Y. (2007). An Energy Efficient Connected Coverage Protocol in Wireless Sensor Networks. In: Dong, G., Lin, X., Wang, W., Yang, Y., Yu, J.X. (eds) Advances in Data and Web Management. APWeb WAIM 2007 2007. Lecture Notes in Computer Science, vol 4505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72524-4_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72524-4_41

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-72524-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics