In this paper we propose a novel method of using Genetic Algorithms (GAs) to solve the dynamic shortest path discovery and routing in MANETs. MANETs is one of the faster growing new-generation wireless networks. The tentative results indicate that this GA based algorithm can quick adapt to ...
Mohd Nayeem ShahResearch and ReviewsM. N. Shah, "Implementation of Graph Theory in Computer Networking To Find an Efficiect Routing Algorithm," International Journal of Innovative Research in Computer and Communication Engineering, vol. 4, no. 1, pp. 12-20, 2016...
The application of neural networks to the optimum routing problem in packet-switched computer networks, where the goal is to minimize the network-wide average time delay, is addressed. Under appropriate assumptions, the optimum routing algorithm relies heavily on shortest path computations that have to...
Routing is a process of selecting path in a network along which the packets are sending over the network traffic. There are many routing algorithms which are used to determine the path, load, and distance over the network traffic. In this paper, a routing algorithm is taken as a tool for...
Popular routing protocols, such as RIP, RIPv2, and OSPF, use either a distance-vector or link-state routing algorithm to determine reachability. In a distance-vector routing algorithm each router maintains the “distance” (a metric to weight each hop, or connection between routers) between ...
The main constraint of wireless sensor networks (WSNs) is the limited and generally irreplaceable power source of the sensor nodes. Therefore, designing energy saving routing algorithm is one of the most focused research issues. In this paper, we propose an energy aware routing algorithm for cluste...
In this paper, we present an integer programming algorithm for the minimum congestion unsplittable shortest path routing problem, which arises in the operational planning of such networks. Given a capacitated directed graph and a set of communication demands, the goal is to find routing lengths that...
networks with varying degrees of parameter sharing. In either case, estimating the gating network parameters is complicated by the discrete gate decisions and the competing goals of maximizing accuracy and minimizing cost. To learn the gating network we introduce a two stage training algorithm that ...
routing algorithm is responsible for selecting the best path to access a node. In “distance vector routing protocol” this is calculated based on the distance to a remote network. Number of routers to a remote network from a router is called the number of hops to the remote location. ...
Zahra sadat Ghandriz and Pand Esmaeil Zeinali Kh.,"A New Routing Algorithm for a Three-Stage Clos Interconnection Networks", IJCSI International Journal of Computer Science Issues, Vol. 8, Issue 5, No 2, September 2011Ghandriz, Zahra and Esmaeil Khasraghi, "A New Routing Algorithm for a...