Skip to main content

An Energy-Efficient K-Hop Clustering Framework for Wireless Sensor Networks

  • Conference paper
Wireless Sensor Networks (EWSN 2007)

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

Included in the following conference series:

Abstract

Many applications in wireless sensor networks (WSNs) benefit significantly from organizing nodes into groups, called clusters, because data aggregation and data filtering applied in each cluster can greatly help to reduce traffic. The size of a cluster is measured by the hop distance from the farthest node to the cluster head. Rather than 1-hop clustering, K-hop clustering is preferred by many energy-constrained applications. However, existing solutions fail to distribute clusters evenly across the sensing field, which may lead to unbalanced energy consumption and network inefficiency. Moreover, they incur high communication overhead. We propose an Evenly Distributed Clustering (EDC) algorithm. Constrained by the maximum cluster size K, EDC distributes clusters uniformly, and minimizes the number of clusters. By introducing a relative synchronization technique, EDC converges fast with low communication overhead. It also helps to improve the successful transmission rate from nodes to their cluster heads. The simulation results indicate that EDC outperforms other existing algorithms.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Mainwaring, A., Polastre, J., Szewczyk, R., Culler, D.: Wireless Sensor Networks for Habitat Monitoring. In: ACM International Workshop on Wireless Sensor Networks and Applications (WSNA), ACM Press, New York (2002)

    Google Scholar 

  2. Woo, A., Tong, T., Culler, D.: Taming the Underlying Challenges of Reliable Multihop Routing in Sensor Networks. SenSys (2003)

    Google Scholar 

  3. Amis, A.D., Prakash, R., Vuong, T.H., Huynh, D.T.: Max-Min D-Cluster Formation in Wireless Ad Hoc Networks. INFOCOM (2000)

    Google Scholar 

  4. Park, V.D., Corson, M.S., Highly, A.: Adaptive Distributed Routing Algorithm for Mobile Wireless Networks. INFOCOM (1997)

    Google Scholar 

  5. Perkins, C.E., Bhagwat, P.: Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers. SIGCOMM (1994)

    Google Scholar 

  6. Bandyopadhyay, S., Coyle, E.J.: An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks. INFOCOM (2003)

    Google Scholar 

  7. Chatterjee, M., Das, S., Turgut, D.: WCA: A Weighted Clustering Algorithm for Mobile Ad hoc Networks. Journal of Cluster Computing, Special issue on Mobile Ad hoc Networking 5, 193–204 (2002)

    Google Scholar 

  8. Baker, D., Ephremides, A.: The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm. IEEE Transactions on Communications 29, 1694–1701 (1981)

    Article  Google Scholar 

  9. Ephremides, A., Wieselthier, J.E., Baker, D.: A Design Concept for Reliable Mobile Radio Networks with Frequency Hopping Signaling. Proceeding of IEEE 75(1), 56–73 (1987)

    Article  Google Scholar 

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

    Article  Google Scholar 

  11. Parekh, A.: Selecting Routers in Ad-hoc Wireless Networks. SBT/IEEE International Telecommunications Symposium (1994)

    Google Scholar 

  12. Cerpa, A., Estrin, D.: ASCENT: Addaptive Self-Configuring sEnsor Networks Topologies. INFOCOM (2002)

    Google Scholar 

  13. Chen, B., Jamieson, K., Balakrishnan, H., Morris, R.: Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks. MobiCom (2000)

    Google Scholar 

  14. Xu, Y., Heidemann, J., Estrin, D.: Geography-informed Energy Conservation for Ad Hoc Routing. MobiCom (2001)

    Google Scholar 

  15. Wu, J., Dai, F., Distributed, A.: Formation of a Virtual Backbone in Ad Hoc Networks using Adjustable Transmission Ranges. ICDCS (2004)

    Google Scholar 

  16. Dai, F., Wu, J.: On Constructing k-Connected k-Dominating Set in Wireless Networks. IPDPS (2005)

    Google Scholar 

  17. Ma, J., Gao, M., Zhang, Q., Ni, L.M., Zhu, W.: Localized Low-Power Topology Control Algorithms in IEEE 802.15.4-based Sensor Networks. ICDCS (2005)

    Google Scholar 

  18. Levis, P., Madden, S., Gay, D., Polastre, J., Szewczyk, R., Woo, A., Brewer, E., Culler, D.: The Emergence of Networking Abstractions and Techniques in TinyOS. NSDI (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Koen Langendoen Thiemo Voigt

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Chen, Q., Ma, J., Zhu, Y., Zhang, D., Ni, L.M. (2007). An Energy-Efficient K-Hop Clustering Framework for Wireless Sensor Networks. In: Langendoen, K., Voigt, T. (eds) Wireless Sensor Networks. EWSN 2007. Lecture Notes in Computer Science, vol 4373. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69830-2_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-69830-2_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-69829-6

  • Online ISBN: 978-3-540-69830-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics