Skip to main content

Employing Energy-Efficient Patterns for Coverage Problem to Extend the Network Lifetime

  • Conference paper
Computational Science and Its Applications - ICCSA 2011 (ICCSA 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6785))

Included in the following conference series:

  • 1314 Accesses

Abstract

The coverage problem is a fundamental issue in wireless sensor networks. It has attracted considerable attention recently. Most node scheduling patterns utilize the adjustable range of sensors to minimize the sensing energy consumption, and thus extend the network lifetime. However, a large source of the consumption of the sensor communication energy is not strictly taken into account. In this paper, we introduce two energy-efficient patterns that are used to minimize the communication energy consumption of a sensor network, and simultaneously, maintain a high degree of coverage. Moreover, the proposed patterns have a structure that is easy to design and apply to practical applications. Calculations and extensive simulation are conducted to evaluate the efficiency of the new patterns compared to existing ones in terms of various performance metrics.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: A survey on sensor networks. IEEE Communications Magazine 40, 102–114 (2002)

    Article  Google Scholar 

  2. Bai, X., Xuan, D., Yun, Z., Lai, T.H., Jia, W.: Complete optimal deployment patterns for full-coverage and k-connectivity (k ≤ 6) wireless sensor networks. In: Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 401–410 (2008)

    Google Scholar 

  3. Cardei, M., Wu, J., Lu, M.: Improving network lifetime using sensors with adjustable sensing ranges. International Journal of Sensor Networks 1, 41–49 (2006)

    Article  Google Scholar 

  4. Cardei, M., Wu, J.: Energy-efficient Coverage Problems in Wireless Ad-hoc Sensor Networks. International Journal of Computer Communications, 413–420 (2006)

    Google Scholar 

  5. Fan, G.J., Jin, S., Cheng, S.: An Approach to Finding Weak Regions for Wireless Sensor Networks with Arbitrary Sensing Areas. In: Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 445–446 (2008)

    Google Scholar 

  6. Huang, C.F., Tseng, Y.C., Lo, L.C.: Coverage and Connectivity in Three-Dimensional Underwater Sensor Networks. Wireless Communication and Mobile Computing 8(8), 995–1009 (2008)

    Article  Google Scholar 

  7. Meguerdichian, S., Koushanfar, F., Potkonjak, M., Srivastava, M.B.: Coverage problems in wireless ad-hoc sensor networks. In: Proceedings of the 20th IEEE INFOCOM, pp. 1380–1387 (2001)

    Google Scholar 

  8. Porta, L., IIIangasekare, T., Loden, P., Han, Q., Jayasumana, A.: Continuous Plume Monitoring Using Wireless Sensors: Proof of Concept in Intermediate Scale Tank. Journal of Environment Engineering 135(9), 831–838 (2009)

    Article  Google Scholar 

  9. Raghunathan, V., Schurgers, C., Park, S., Srivastava, M.B.: Energy-Aware Wireless Microsensor Networks. IEEE Signal Processing Magazine 19, 40–50 (2002)

    Article  Google Scholar 

  10. Song, W., Huang, R., Shirazi, B., LaHusen, R.: TreeMAC: localized TDMA MAC protocol for real-time high-date-rate sensor networks. In: Proceeding of the IEEE Internation Conference on Pervasive Computing and Communications, pp. 750–765 (2009)

    Google Scholar 

  11. Wang, W., Srinivasan, V., Wang, B., Chua, K.C.: Coverage for target localization in wireless sensor networks. IEEE Transactions on Wireless Communications 7(3), 667–676 (2008)

    Article  Google Scholar 

  12. Wu, J., Yang, S.: Energy-efficient node scheduling models in sensor networks with adjustable ranges. International Journal of Foundations of Computer Science 16, 3–17 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  13. Yang, G., Qiao, D.: Multi-Round Sensor Deployment for Guaranteed Barrier Coverage. In: Proceedings of the 30th IEEE INFOCOM, pp. 2462–2470 (2010)

    Google Scholar 

  14. Zalyubovskiy, V., Erzin, A., Astrakov, S., Choo, H.: Energy-efficient Area Coverage by Sensors with Adjustable Ranges. Sensors Journal 9, 2446–2460 (2009)

    Article  Google Scholar 

  15. Zhang, H., Hou, J.C.: Maintaining Sensing Coverage and Connectivity in Large Sensor Networks. International Journal of Ad Hoc and Sensor Wireless Networks, 89–124 (2005)

    Google Scholar 

  16. Zhou, Z., Das, S.R., Gupta, H.: Variable radii connected sensor cover in sensor networks. ACM Transaction on Sensor Networks 5(1) (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dao, M.T.Q., Nguyen, N.D., Zalyubovskiy, V., Choo, H. (2011). Employing Energy-Efficient Patterns for Coverage Problem to Extend the Network Lifetime. In: Murgante, B., Gervasi, O., Iglesias, A., Taniar, D., Apduhan, B.O. (eds) Computational Science and Its Applications - ICCSA 2011. ICCSA 2011. Lecture Notes in Computer Science, vol 6785. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21898-9_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21898-9_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21897-2

  • Online ISBN: 978-3-642-21898-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics