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

  title={An Energy-Efficient K-Hop Clustering Framework for Wireless Sensor Networks},
  author={Quanbin Chen and Jian Ma and Yanmin Zhu and Dian Zhang and Lionel M. Ni},
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… CONTINUE READING
Highly Cited
This paper has 18 citations. REVIEW CITATIONS
8 Citations
13 References
Similar Papers


Publications citing this paper.
Showing 1-8 of 8 extracted citations


Publications referenced by this paper.
Showing 1-10 of 13 references

and D . Turgut , " WCA : A Weighted Clustering Algorithm for Mobile Ad hoc Networks

  • S. Das Chatterjee
  • Journal of Cluster Computing , Special issue on…
  • 2003

Wireless Sensor Networks for Habitat Monitoring,

  • A. Mainwaring, J. Polastre, R. Szewczyk, D. Culler
  • in ACM International Workshop on Wireless Sensor…
  • 2002
1 Excerpt

Corson, "A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks,

  • M.S.V.D. Park
  • 1997
1 Excerpt

Similar Papers

Loading similar papers…