A Stable Clustering Algorithm for Highly Mobile Ad Hoc Networks

The dynamic topology of ad hoc networks is an important issue on which a lot of research is carried out. Because of higher speeds of movement and networks of larger scale, the algorithms of auto-organization and clustering may be inefficient. Therefore, we propose a fully distributed clustering algorithm for mobile ad hoc networks in which the nodes can move at higher speeds. The main objectives of this algorithm consists in reducing the reconstruction of the topology and stabilizing it as a long time as possible. This clustering algorithm can be used by several routing algorithms for ad hoc networks. Under proper simulations, we show that optimal cluster head characteristics: connectivity, energy and mobility, lead to a stable topology in terms of reconfiguration frequency.