Abstract
We show the implementation and the simulation results of a hierarchical, cluster based routing protocol for mobile ad hoc networks using Parallel Virtual Machine (PVM). The network represented by a graph is partitioned into clusters by a graph partitioning algorithm and the shortest routes are first calculated locally in each cluster in the first srep. The simplified network which consists only of the nodes that have connections to other clusters called the neighbor nodes is then formed and the shortest routes are calculated for this simple network as the second step. A complete route between the two nodes of different clusters is formed by the union of intra-cluster and inter-cluster routes. We show the implementation results using PVM where a workstation represents a cluster and each node is a PVM process. The results obtained support the theoretical considerations where the efficiency increases by the number of clusters in use.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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)
Erciyes, K., Marshall, G.: 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.) ICCSA 2004. LNCS, vol. 3045, pp. 528–537. Springer, Heidelberg (2004)
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
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Marshall, G., Erciyes, K. (2005). Implementation of a Cluster Based Routing Protocol for Mobile Networks. In: Sunderam, V.S., van Albada, G.D., Sloot, P.M.A., Dongarra, J.J. (eds) Computational Science – ICCS 2005. ICCS 2005. Lecture Notes in Computer Science, vol 3514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11428831_48
Download citation
DOI: https://doi.org/10.1007/11428831_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26032-5
Online ISBN: 978-3-540-32111-8
eBook Packages: Computer ScienceComputer Science (R0)