Study of Routing Algorithms Considering Real Time Restrictions Using a Connectivity Function
The paper focuses on the study of a mobile distributed system that is characterized by frequently changing topology. The routing algorithms [4,5,1] for such a system should be, in general, fully adaptive. Additionally, it is important to know the state of the task scheduler of each node in order to determine whether it acts as a router. Traditionally, existing routing algorithms [3,2] resort to the path discovery process for each modification in topology.
KeywordsAdjacency Matrix Transitory State Connectivity Function Data Package Mobile Wireless Network
- 1.Jacquet, P., Mühlethaler, P., Clausen, T., Laouiti, A., Qayyum, A., Viennot, L.: Optimized link state routing protocol for ad hoc networks. In: Proc. IEEE INMIC 2001, pp. 62–68. IEEE, New York (2001)Google Scholar
- 2.Liu, Z., Kim, J., Lee, B., Kim, C.: A routing protocol based on adjacency matrix in ad hoc mobile networks. In: Proc. 7th Int. Conf. on Advanced Language Processing and Web Information Technology, pp. 430–436. IEEE Computer Soc., Los Alamitos (2008)Google Scholar
- 3.Medhi, D., Ramasamy, K.: Network Routing: Algorithms, Protocols, and Architectures. Morgan Kaufmann, San Francisco (2007)Google Scholar
- 4.Park, V.D., Corson, M.S.: A highly adaptive distributed routing algorithm for mobile wireless networks. In: Proc. IEEE INFOCOM 1997, vol. 3, pp. 1405–1413. IEEE Computer Soc., Los Alamitos (1997)Google Scholar
- 5.Perkins, C., Royer, E.: Ad-hoc on-demand distance vector routing. In: Proc. of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, pp. 90–100. IEEE Computer Soc., Los Alamitos (1999)Google Scholar