Connectivity Based k-Hop Clustering in Wireless Networks

By Geng Chen, F. G. Nocetti, Julio Solano-González, Ivan Stojmenovic. Proceedings of the Annual Hawaii International Conference on System Sciences, 2002

419 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/1988399cd5f41a92cde1523ed58146fd329e5ad4

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Shio Kumar Singh
2. M. Singh
3. D. Singh
4. Asst. Professor

Citations in the corpus

• A survey on clustering algorithms for wireless sensor networks (2007, neutral): “K-hop clustering is K-dominat-ing set problem [41–43].”
• A Survey of Energy-Efficient Hierarchical Cluster-Based Routing in Wireless Sensor (2010, background): “A variety of protocols were proposed for prolonging the life of WSN and for routing the correct data to the base station [2], [3], [7], [8], [10], [11], [12], [14], [15], [16], [17], [18], [20], [21], [24], [25], [26].”