Skip to main content

CRAM: An Energy Efficient Routing Algorithm for Wireless Sensor Networks

  • Conference paper
Book cover Computer and Information Sciences - ISCIS 2004 (ISCIS 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3280))

Included in the following conference series:

Abstract

Wireless sensor networks (WSNs) can be used widely in the future. One disadvantage of the existing WSNs is the limited supply of energy. In order to postpone sy stem lifetime and enhance energy efficiency, an energy-efficient routing algorithm for WSNs, termed as Clustering Routing Algorithm using Multi-CHs-One-Cluster method (CRAM), is presented in this paper. This algorithm selects Multi-Cluster-Heads (Multi-CHs) in every cluster together as one cluster head to perform data fusion and data transmission to improve energy efficiency and enhance data transmission reliability, since one cluster-head in a cluster may be unreliable and cause energy losing in case of no de failure. Detailed simulations of sensor network environments indicate that CRAM algorithm improves energy efficiency, balances energy consumption of all sensor nodes, enhances data transmission reliability of cluster-head and postpones network system lifetime in comparison to clustering routing algorithm using one-CH-one cluster method.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Weiser, M.: The Computer for the 21st Century. Scientific American (1991)

    Google Scholar 

  2. Zengwei, Z., Zhaohui, W.: A Survey on Pervasive Computing. Computer Science 30(4), 18–22 (2003)

    Google Scholar 

  3. Mainwaring, A., Polastre, J., Szewczyk, R., Culler, D.: Wireless Sensor Networks for Habitat Monitoring. In: ACM WSNA 2002, Atlanta, Georgia (2002)

    Google Scholar 

  4. Johnson, D.B., Maltz, D.A.: Dynamic Source Routing in Ad Hoc Wireless Networking. In: Imielinski, T., Korth, H. (eds.) Mobile Computing, Kluwer Academic Publishing, Dordrecht (1996)

    Google Scholar 

  5. Perkins, C.: Ad Hoc Networking. Addison-Wesley, Reading (2000)

    Google Scholar 

  6. Perkins, C.: Ad Hoc On-Demand Distance Vector (AODV) Routing. IETF MANET, Internet-Draft (December 1997)

    Google Scholar 

  7. Heinzelman, W., Chandrakasan, A., Balakrishnan, H.: An Application-Specific Protocol Architecture for Wireless Microsensor Networks. IEEE Transactions on Wireless Communications 1(4), 660–670 (2002)

    Article  Google Scholar 

  8. Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: A Survey on Sensor Networks. IEEE Communications Magazine 40(8), 102–114 (2002)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zheng, Zw., Wu, Zh., Lin, Hz., Zheng, Kg. (2004). CRAM: An Energy Efficient Routing Algorithm for Wireless Sensor Networks. In: Aykanat, C., Dayar, T., Körpeoğlu, İ. (eds) Computer and Information Sciences - ISCIS 2004. ISCIS 2004. Lecture Notes in Computer Science, vol 3280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30182-0_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30182-0_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23526-2

  • Online ISBN: 978-3-540-30182-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics