A Cluster Based Hierarchical Routing Protocol for Mobile Networks

We propose a hierarchical, cluster based semi-distributed routing protocol for a mobile ad hoc network. The network graph is partitioned into clusters using heuristics and the shortest routes are first calculated locally in each cluster in the first phase. The network is then simplified to consist only of the nodes that have connections to other clusters called the neighbor nodes and the shortest routes are calculated for this simple network in the second. A complete route between two nodes of different clusters is formed by the union of intra-cluster and inter-cluster routes. We show that this method has better performance with respect to the other methods of calculation of all-pairs shortest paths in a mobile network. . . .

• Type: Conference
• Year: 2004
• Where: ICCSA
• Authors: Kayhan Erciyes, Geoffrey Marshall
• Keywords: Applied Computing, ICCSA 2004, Mobile Ad Hoc Network, Semi-distributed Routing Protocol, Shortest Routes