Design and Simulation of a Distributed Dynamic Clustering Algorithm for Multimode Routing in Wireless Ad Hoc Networks

This article presents analysis of the design and simulation of a new class of environmentally aware clustering algorithms for wireless ad hoc networks. The clustering algorithm establishes an adaptive self-organizing arrangement that enables multimode routing strategies. Multimode operation is needed to enhance scalability and robustness. In the present case, clustering is based on a criterion that enforces an upper bound on the probability of path failure within a cluster over time. The result is an adaptive hybrid routing strategy that dynamically balances routing overhead against routing optimality. The clustering algorithm unifies the routing strategies according to localized and time-varying mobility characteristics. A simulation model was developed to validate the effectiveness of the clustering algorithm and demonstrate the multimode routing behavior. Results show that the algorithm adapts effectively to node mobility and achieves relatively consistent overhead regardless of network size and mobility.