A cluster-based approach for routing in dynamic networks
ACM SIGCOMM Computer Communication Review
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
Cluster Computing
Distributed Clustering for Ad Hoc Networks
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
A Mobility Based Metric for Clustering in Mobile Ad Hoc Networks
ICDCSW '01 Proceedings of the 21st International Conference on Distributed Computing Systems
Design and Performance of a Distributed Dynamic Clustering Algorithm for Ad-Hoc Networks
SS '01 Proceedings of the 34th Annual Simulation Symposium (SS01)
A survey of clustering schemes for mobile ad hoc networks
IEEE Communications Surveys & Tutorials
Adaptive clustering for mobile wireless networks
IEEE Journal on Selected Areas in Communications
Construction of virtual backbone on growth-bounded graph with variable transmission range
WSEAS Transactions on Computers
| Hi-index | 0.00 |
Mobile ad hoc network (MANET) is the network that has no fundamental structure and of which the communication node of system is connected and organized with distributed protocols. Group communication is the major mode of communication in MANET. Many mobile ad hoc network applications depend upon hierarchical structure. Clustering is the most popular method to impose a hierarchical structure in the ad hoc networks. This paper aimed at clustering algorithm performance analysis in group communication application. Based on analyzing the characteristics of the mobility module and typical clustering algorithms, six major one-hop clustering algorithms are compared and evaluated using group mobility module RPGM in the paper. Limitation of current clustering algorithms in group mobility module is pointed out and the implications on clustering algorithm in group communication application are discussed in the end. The results show that the performance of MACA is much higher than that of other algorithms.