A unified framework for cluster manager election and clustering mechanism in mobile ad hoc networks

In Mobile Ad-hoc NETwork (MANET), every node could become active dynamically. Therefore, those nodes will affect the stability of network topology because of clustering and de-clustering, and continuously make reconfiguration for the groups of network, all that will influence the overall function of network. How to choose a cluster manager to keep the stability of network topology is an important issue. In this paper, a mechanism for the designation of clustering and cluster manager is given by MANET. The mechanism is named as Unified Framework Clustering Mechanism (UFCM for short), which is a kind of processing mechanism under consideration in multi-network service, such as processing mode of initial state in the network system, processing mode of access of nodes in the group, and the processing mode concerned on failing to manage the group because the cluster manager is erroneous. Beyond that, we also propose a backup manager to take the work of the cluster manager when the cluster manager fails.

[1]  Mario Gerla,et al.  Multicluster, mobile, multimedia radio network , 1995, Wirel. Networks.

[2]  XULi,et al.  An Improved Weighted Clustering Algorithm in MANET , 2004 .

[3]  Mario Gerla,et al.  Adaptive Clustering for Mobile Wireless Networks , 1997, IEEE J. Sel. Areas Commun..

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

[5]  Stefano Basagni,et al.  Distributed clustering for ad hoc networks , 1999, Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99).

[6]  Imrich Chlamtac,et al.  A new approach to the design and analysis of peer‐to‐peer mobile networks , 1999, Wirel. Networks.

[7]  Taieb Znati,et al.  A mobility-based framework for adaptive clustering in wireless ad hoc networks , 1999, IEEE J. Sel. Areas Commun..

[8]  Anthony Ephremides,et al.  The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm , 1981, IEEE Trans. Commun..

[9]  Wang Jin.  An Improved Weighted Clustering Algorithm in MANET , 2004 .

[10]  Julio Solano-González,et al.  Connectivity Based k-Hop Clustering in Wireless Networks , 2003, Telecommun. Syst..

[11]  Vaduvur Bharghavan,et al.  Routing in ad-hoc networks using minimum connected dominating sets , 1997, Proceedings of ICC'97 - International Conference on Communications.

[12]  Ivan Marsic,et al.  Hierarchical routing overhead in mobile ad hoc networks , 2004, IEEE Transactions on Mobile Computing.

[13]  Aravind Srinivasan,et al.  Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons , 2003, J. Comput. Syst. Sci..

[14]  Jie Wu,et al.  A Dominating-Set-Based Routing Scheme in Ad Hoc Wireless Networks , 2001, Telecommun. Syst..

[15]  R. Rajaraman,et al.  An efficient distributed algorithm for constructing small dominating sets , 2002 .

[16]  Barry M. Leiner,et al.  Goals and challenges of the DARPA GloMo program [global mobile information systems] , 1996, IEEE Wirel. Commun..

[17]  Bo Li,et al.  A unified framework for resource discovery and QoS-aware provider selection in ad hoc networks , 2002, MOCO.