WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
By Mainak Chatterjee, Sajal K. Das, Damla Turgut. Cluster Computing, 2002
1,510 citations recorded by the source corpus.
Subfields: Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/5be5d6c22cacf36792254d1a167c111b6b0e9903
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
- Ossama Younis
- Sonia Fahmy
- Stanislava Soro
- Wendi Rabiner Heinzelman
- Huan Qi
- Weiqun Li
- Ying-Hsiang Liao
- Ping Ding
Citations in the corpus
- Power control and clustering in ad hoc networks (2003, methodology): “The leader election, or the cluster set up phase, uses heuristics like node addresses, node degrees, transmission power, mobility, or more sophisticated node weights combining the above attributes, as in WCA [17], and in DCA [18].”
- HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks (2004, methodology): “DCA [16] and WCA [17] are examples of such”
- Load-Balanced Clustering Algorithm With Distributed Self-Organization for Wireless Sensor Networks (2013, methodology): “The cluster structure changes in each round in LEACH, HEED and WCA; nevertheless, DSBCA maintains relatively stable clustering structure in which switching of cluster head often occurs in the same cluster.”
- Connectivity Based k-Hop Clustering in Wireless Networks (2002, methodology): “Chatterjee et al. [ 8 ] described a clustering algorithm based on the scheme by Lin and Gerla [24], with weight (used to decide clusterheads) defined as a combination of a few metrics.”
- New Multi-Hop Clustering Algorithm for Vehicular Ad Hoc Networks (2019, background): “Among them, the most representative cluster head selection mechanism has the minimum ID algorithm [11], the highest node degree algorithm [12] and the weight-based WCA algorithm [13].”
- Distributed clustering in ad-hoc sensor networks: a hybrid, energy-efficient approach (2004, background): “DCA [19] and WCA [20] are examples of such weight-based clustering.”
- 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].”
- Distributed Energy-Efficient Hierarchical Clustering for Wireless Sensor Networks (2005, methodology): “WCA also restricts the number of nodes in a cluster so that the performance of the MAC protocol is not degraded.”
- Routing in Flying Ad Hoc Networks: A Comprehensive Survey (2020, methodology): “In the clustering process, a node-weight heuristic algorithm [129] is used to select the cluster head by considering the connectivity degree, relative speed, residual energy, and weapon and equipment of the UAVs.”
- A survey on clustering algorithms for wireless sensor networks (2007, neutral): “Although many clustering algorithms have been proposed in the literature for ad-hoc networks [11–15], the objective was mainly to generate stable clusters in environments with mobile nodes.”
- An energy efficient hierarchical clustering algorithm for wireless sensor networks (2003, background): “An ad-hoc wireless network of large numbers of such inexpensive but less reliable and accurate sensors can be used in a wide variety of commercial and military applications.”
- Cluster head election techniques for coverage preservation in wireless sensor networks (2009, methodology): “Our approach for cluster-based network organization is based on a set of coverage-aware cost metrics that favor nodes deployed in densely populated network areas as better candidates for cluster head nodes, active sensor nodes and routers.”
- Mobile ad hoc networking: imperatives and challenges (2003, neutral): “[56] M.”