A member-limited clustering algorithm for mobile Ad Hoc networks
Kuang Xiao · Dalian Ligong Daxue xuebao · 2003
Many mobile ad hoc applications depend upon hierarchical structure. Clustering is a most popular method to impose a hierarchical structure in the ad hoc networks. However, a clusterhead may not be able to handle a large number of nodes due to resource limitations even if these nodes are its immediate neighbors and lie well within its transmission range. A novel member-limited clustering algorithm named CMLA is proposed. Three member choosing policies that can be used in CMLA are discussed. Simulation results verify the high efficiency of the CMLA with minimum weight first member choosing policy.