Dynamic Clustering Based Hybrid Routing Protocol for Mobile Ad Hoc Networks

Routing in mobile ad hoc network must be efficient and resource-saving. Mobility causes frequent changes in the topology, which leads to inappropriate routing. One way to reduce traffic is to divide the network into clusters. Also, there should be a well-defined interconnection technique that guarantees optimized and stable network connectivity. Routing based on clustering provides an efficient source routing. In this paper, we propose an improved dynamic clustering based hybrid routing protocol which uses distributed spanning tree scheme for clustering that models the network and perform hybrid routing within the network. The proposed algorithms for clustering and routing have been compared with the existing scheme and results in the routing overhead reduction with optimized modelling of the network.