A clustering scheme for hierarchical control in multi-hop wireless networks

By Suman Banerjee, Samir Khuller. Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213), 2001

645 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/bd0f0c0251b48a82997fc88e5a8475d3d2608d81

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

Citations in the corpus

Distributed clustering in ad-hoc sensor networks: a hybrid, energy-efficient approach (2004, background): “5) Cluster heads are well-distributed over the sensor ﬁeld.”
Trust-based security for wireless ad hoc and sensor networks (2007, background): “Clustering is an effective approach to improving network scalability and throughput, and it has been studied by a number of researchers [5,6,15,25].”
Clustering in sensor networks: A literature survey (2014, methodology): “Discussion: As reviewed, most of recent clustering algorithms are deterministic (Ma et al., 2011; Wei, 2011; Kim et al., 2008a; Ran et al., 2010; Lee and Cheng, 2012b; Taheri et al., 2012; Mhemed et al., 2012; Anno et al., 2007; Siew et al., 2011; Tashtoush and Okour, 2008; Kulkarni and Venayagamoor”
HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks (2004, methodology): “In [13], the authors propose using a spanning tree (or BFS tree) to produce clusters with some desirable properties.”
Node clustering in wireless sensor networks: recent developments and deployment challenges (2006, background): “Banerjee et al. [10] proposed a centralized technique that does not require knowledge of node locations.”
A survey on clustering algorithms for wireless sensor networks (2007, methodology): “Like [37], the clustering process is recursively repeated at the level of CHs to form an additional tier.”
Connectivity Based k-Hop Clustering in Wireless Networks (2002, background): “A breadth first search based clustering scheme where CHs are not directly linked to each node within their clusters, and each cluster size is between k and 2k, is given in [BK].”