A Hierarchical Algorithm for Mobile Ad-Hoc Networks

For mobile ad hoc networks, hierarchical algorithm can reduce communication relay and enhance the QoS of MANETs. In this paper, A hierarchical algorithm-FGM algorithm is proposed. This algorithm based on dynamic node’s Multi-feature fusion and Gibbs Random Field—Maximum a Posterior. The simulation results verify the effectiveness of the algorithm.

[1]  Prithwish Basu,et al.  A mobility based metric for clustering in mobile ad hoc networks , 2001, Proceedings 21st International Conference on Distributed Computing Systems Workshops.

[2]  Winston Khoon Guan Seah,et al.  Mobility-based d-hop clustering algorithm for mobile ad hoc networks , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[3]  Yan Zhang,et al.  A distributed group mobility adaptive clustering algorithm for mobile ad hoc networks , 2009, Comput. Commun..

[4]  Sajal K. Das,et al.  WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks , 2002, Cluster Computing.

[5]  Sajal K. Das,et al.  An on-demand weighted clustering algorithm (WCA) for ad hoc networks , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[6]  Yi Xu,et al.  Topology Stability Analysis and Its Application in Hierarchical Mobile Ad Hoc Networks , 2009, IEEE Transactions on Vehicular Technology.

[7]  Winston Khoon Guan Seah,et al.  Performance analysis of mobility-based d-hop (MobDHop) clustering algorithm for mobile ad hoc networks , 2006, Comput. Networks.

[8]  Elijah Blessing Rajsingh,et al.  Relative Weight Based Clustering in Mobile Ad Hoc Networks , 2009, 2009 11th International Conference on Computer Modelling and Simulation.