This chapter proposes a scenario-based and diameter-bounded algorithm for cluster formation and management in mobile ad hoc networks (MANETs). A (k, r) -Dominating Set is used for the selection of clusterheads and gateway nodes depending on the topology of the network. Here k is the minimum number of clusterheads per node in the network and r is the maximum number of hops between the node and the clusterhead. The non-clusterhead node selects the most qualified dominating node as its clusterhead from among the k dominating nodes. The quality of the clusterhead is a function of various metrics, which include connectivity, stability and residual battery power. The long-term service as a clusterhead depletes its energy, causing it to drop out of the network. Similarly, the clusterhead with relatively high mobility than its neighbors leads to frequent clusterhead election process. This perturbs the stability of the network and can adversely affect the network performance. Load balancing among the clusterheads and correct positioning of the clusterhead in a cluster are vital to increase the lifespan of a network. The proposed centralized algorithm periodically calculates the quality of all dominating nodes in the network and if it goes below the threshold level it resigns the job as the clusterhead and sends this message to all other members in the cluster. Since these nodes have k dominating nodes within the r -hop distance, it can choose the current best-qualified node as its clusterhead. Simulation experiments are conducted to evaluate the performance of the algorithm in terms of the number of elements in the (k, r)-DS, the load balancing factor, the number of re-affiliations per unit time and the number of dominating set updates per unit time. The results establish the potential of this algorithm for use in MANETs.
Honey bee algorithm–based efficient cluster formation and optimization scheme in mobile ad hoc networks
