Load-balancing clusters in wireless ad hoc networks
By Alan D. Amis, Ravi Prakash. Proceedings 3rd IEEE Symposium on Application-Specific Systems and Software Engineering Technology, 2000
308 citations recorded by the source corpus.
View Paper: https://www.semanticscholar.org/paper/22d14ef15da8567d46355bcb4d43c20412280670
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Ping Ding
- JoAnne Holliday
- Jose Joaquin Garcia-Luna-Aceves
- Lichun Bao
- Sajal K. Das
- Aslihan Karas Celik
- Yang Wang
- Mainak Chatterjee
Citations in the corpus
- Distributed Energy-Efficient Hierarchical Clustering for Wireless Sensor Networks (2005, methodology): “In [10], the authors propose two load balancing heuristics for mobile ad hoc networks, where one is similar to LCA and the other is degree-based algorithm.”
- Topology management in ad hoc networks (2003, methodology): “The simulations favored Load balance, because it assumes that all nodes start with the same energy level [2], which is the setup of the simulations.”
- Survey of Clustering Schemes in Mobile Ad hoc Networks (2014, background): “Load Balancing Clustering [13-14], which believe that there is an optimum number of mobile nodes that a cluster can handle.”
- 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.”
- A polynomial‐time approximation scheme for the minimum‐connected dominating set in ad hoc wireless networks (2003, unknown): “” To overcome or at least alleviate these problems, virtual backbone-based routing strategy is introduced [2][6][16]).”
- WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks (2002, background): “Therefore, it is not desirable to have any clusterhead overly loaded while some others are lightly loaded [1].”
- Geometric spanners for wireless ad hoc networks (2002, background): “Many algorithms for clustering have been proposed in the literature [20], [28], [21], [22], [23], [7], [27], [24], [15], [32], [33], [8].”