Journals Proceedings

Abstract

The field of Networks has gained an important part of the interest of researchers and has become very popular in the last few years. The network must operate without fixed infrastructure and can survive rapid changes in the topology. It can be studied formally as a graph in which the set of edges varies in time. I propose a new adaptive and dynamic routing algorithm for networks inspired by the genetic algorithm (GAR) in combination with network delay analysis. Using GAR we can find, if not the shortest, at least a very good path between the source and the destination. There are several algorithms for the shortest path (SP) problem: one of them is the Dijkstra algorithm. Since these algorithms can solve SP problems in polynomial time, they are efficient in fixed infrastructure wireless or wired networks. However, they exhibit unacceptably high computational complexity for real-time communications involving rapidly changing network topologies. It is anticipated that genetic algorithm GA can efficiently and dynamically give consistent better solutions regardless of: The network topology, The change in the network, removing any node, or link from the network, The volume of the network (if there are many paths).