shortest-cost routing algorithm
A New Approach For Solving Dynamic Shortest Path Routing Problem In MANET Using Swarm Intelligence Algorithm
... Genetic Algorithm (GA), Particle Swarm Optimization (PSO) and Artificial Bee Colony (ABC) to be specific Dynamic Shortest Path Routing Problem utilizing Genetic Algorithm (GA- DSPRP), Dynamic ...
8
Online Full Text
... (WS) algorithm, where we explored it using different routing metrics (delay, hops, and hop-normalized) ...their cost metric to the QoS based routing protocol ...WS algorithm will select ...
6
Volume 2, Issue 3, March 2013 Page 176
... power-aware routing in show that such a routing algorithm reduces the cost/packet of routing packets by 5-30% over shortest hop routing and even reduces the energy ...
11
A reduced uncertainty hybrid evolutionary algorithm for solving dynamic shortest path routing problem
... the algorithm itself, ...estimated cost of its edges to the ...estimated shortest path lengths (costs) in the subpopulation 1, subpopulation 2, subpopulation 3, and subpopulation 4 are symbolized as ...
39
A Novel NAN based SPRA in WSN for Critical Information of Military Application
... incremental algorithm for weight decrease and insert operations that work also in the concurrent case, within the same bounds, that is ...this algorithm has been shown to be also experimentally fast ...new ...
5
EFFICIENT COST-EFFECTIVE RESOURCE IN RESILIENT OVERLAY ROUTING RELAY NODE NETWORKS
... overlay routing [3]. In the shortest-path routing across over the Internet BGP-based routing example, this question is mapped with the minimum number of relay nodes that are needed in order to ...
6
Quality of Services Multicast Routing by Using Intelligent Algorithm
... The algorithm is given in a general form, and relies on the ...This algorithm realizes the routing with two parts. First, shortest path in minimum cost for the constrained delay ...
5
Vol. 2, Issue 3 (July - Sept. 2015) ISSN : 2394-6814 (Print)
... overlay routing over the actual physical infrastructure, one needs to deploy and manage overlay nodes that will have the new extra ...nonnegligible cost both in terms of capital and operating ...the ...
5
Lucrative Reserve Allotment of Superimpose Steering Spread Knobs
... overlay routing over the actual physical infrastructure, one needs to deploy and manage overlay nodes that will have the new extra ...negligible cost both in terms of capital and operating ...the ...
8
Network Routing Protocol using Genetic Algorithms
... Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1959 [1] is a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative ...
5
Efficient Cluster Elimination Protocol (ECEP) for Ad Hoc Networks
... the routing path and the whole set up of the nodal structure enters in to the dead state ...the shortest paths as performance metric suffer from performance degradation as the network traffic increases ...
5
VPN STIPULATION BASED VIBRANT DEVELOPMENT
... their shortest path thus minimizing the packet loss and delay compared to the existing static ...VPN routing. For example: (1) The problem of fitting failure of lowest cost path and restoration ...
7
Fuzzy Logic Based Routing Algorithm for Wireless Sensor Networks to Enhance the Network Lifetime
... the shortest path routing algorithm with the low ...communication cost. DEFL algorithm assigns cost values based on energy in the network links and it make use of the ...
8
An Effective Routing Algorithm with Chaotic Neurodynamics for Optimizing Communication Networks
... the routing algorithm [1,30] shows high performance for the communication ...chaotic routing algo- rithm [14-19] is also enhanced if the node obtains not only the shortest distance information ...
9
Shortest Path Finding Using a Star Algorithm and Minimum weight Node First Principle
... search algorithm it is possible to find the shortest path from one point to another on a map (while respecting fields that may not be walkable or that may slow down the ...Dijkstra’s algorithm ...
5
An Efficient and Scalable Multi-Path Dynamic Routing for Computing and Constrained Mobile Ad-hoc Network Environment
... based shortest path and moreover they routes may be static routing or dynamic ...source shortest path static/dynamic ...source shortest is all packets are travelled using single path, route ...
6
Intrusion Detection in Mobile Adhoc Network
... the routing misbehavior in MANETs (Mobile Ad Hoc Networks). Commonly routing protocols for MANETs are designed based on the assumption that all participating nodes are fully ...such routing ...
8
Reliable Routing Scheme for VANETs in City Environment
... As routing plays very important role in VANET applications because it has to handle efficiently rapid topology ...recent routing protocols are very useful in city environment but they cause end to end delay ...
5
Energy Conserving Delay Conscious Lifetime Enhancing Data Aggregation Protocol for Heterogeneous Wireless Networks
... energy consumption by nodes, number of dead nodes and number of alive nodes. It was clearly evident from the results that distributed EDCL is more efficient algorithm compared to centralized EDCL. Hence we see ...
6
An Analysis of Foraging and Echolocation Behavior of Swarm Intelligence Algorithms in Optimization: ACO, BCO and BA
... based algorithm that are equipped for delivering minimal effort, quick, and strong answers for some complex ...Optimization algorithm is used for finding the shortest path in the network ...
27