Abstract
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...
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Busch, C., et al.: Analysis of Link Reversal Routing Algorithms for Mobile Ad hoc Networks. In: Proc. of the 15th ACM Symp. on Parallel Alg. and Arch., pp. 210–219 (2003)
Dijkstra, E.W.: A Note on Two Problems in Connection with Graphs. Numerische Math. 1, 69–271 (1959)
Fernandess, Y., Malki, D.: K-clustering in Wireless Ad hoc Networks. In: Proc. of the second ACM Int. Workshop on Principles of Mobile Computing, pp. 31–37 (2002)
Floyd, R.W.: Algorithm 97 (Shortest path). CACM 5(6), 345 (1962)
Haas, Z.J., Pearlman, M.R.: The Zone Routing Protocol (ZRP) for Ad hoc Networks. Internet Draft, Internet Engineering Task Force (1997)
Karypis, G., Kumar, V.: Multilevel k-way Partitioning scheme for Irregular Graphs. Journal of Parallel and Distributed Computing 48, 96–129 (1998)
Kernighan, B., Lin, S.: An Effective Heuristic Procedure for Partitioning Graphs. The Bell System Technical Journal, 291–308 (1970)
Krishna, P., et al.: A Cluster-based Approach for Routing in Dynamic Networks. ACM SIGCOMM Comp. Comm. Rev. 27(2), 49–64 (1997)
Park, V.D., Corson, M.S.: A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks. In: Proc. IEEE INFOCOM, vol. 3, pp. 1405–1413 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Erciyes, K., Marshall, G. (2004). A Cluster Based Hierarchical Routing Protocol for Mobile Networks. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds) Computational Science and Its Applications – ICCSA 2004. ICCSA 2004. Lecture Notes in Computer Science, vol 3045. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24767-8_55
Download citation
DOI: https://doi.org/10.1007/978-3-540-24767-8_55
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22057-2
Online ISBN: 978-3-540-24767-8
eBook Packages: Springer Book Archive