Analysis of Shortest Path Routing for Large Multi-Hop Wireless Networks

2018 ◽  
Vol 7 (3.10) ◽  
pp. 59 ◽  
Author(s):  
Ms S.Girija ◽  
Mrs S.Kayathri ◽  
Ms S.Meena
Keyword(s):  
Wireless Networks ◽  
Shortest Path ◽  
Routing Algorithm ◽  
Concurrent System ◽  
Shortest Path Routing ◽  
Straight Line ◽  
The Cost

In the concurrent system, each node avails as a packet over the network depends on the length of the node. The length of the node generated through straight line routing algorithm. The cost of routing depends on the shortest path routing algorithm. The shortest path is determined by the cost of a distance from one node to another over the network. The capacity of a network is balanced and maintained by the straight routing. The traffic and cost is balanced over the network by using the algorithms.   

A Recursive Shortest Path Routing Algorithm With Application for Wireless Sensor Network Localization

2016 ◽  
Vol 16 (11) ◽  
pp. 4631-4637 ◽  
Author(s):  
Juan Cota-Ruiz ◽  
Pablo Rivas-Perea ◽  
Ernesto Sifuentes ◽  
Rafael Gonzalez-Landaeta
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Shortest Path ◽  
Routing Algorithm ◽  
Wireless Sensor ◽  
Sensor Network Localization ◽  
Shortest Path Routing ◽  
Network Localization

OPTIMUM CONGESTED ROUTING STRATEGY ON TWISTED CUBES

2000 ◽  
Vol 01 (02) ◽  
pp. 115-134 ◽  
Author(s):  
TSENG-KUEI LI ◽  
JIMMY J. M. TAN ◽  
LIH-HSING HSU ◽  
TING-YI SUNG
Keyword(s):  
Shortest Path ◽  
Time Complexity ◽  
Interconnection Network ◽  
Routing Algorithm ◽  
Optimum Time ◽  
Shortest Path Routing ◽  
Routing Strategy ◽  
Bisection Width ◽  
Twisted Cube ◽  
Twisted Cubes

Given a shortest path routing algorithm of an interconnection network, the edge congestion is one of the important factors to evaluate the performance of this algorithm. In this paper, we consider the twisted cube, a variation of the hypercube with some better properties, and review the existing shortest path routing algorithm8. We find that its edge congestion under the routing algorithm is high. Then, we propose a new shortest path routing algorithm and show that our algorithm has optimum time complexity O(n) and optimum edge congestion 2n. Moreover, we calculate the bisection width of the twisted cube of dimension n.

Design of High Speed Reconfigurable Distributed Life Time Efficient Routing Algorithm in Wireless Sensor Network

2020 ◽  
Vol 17 (9) ◽  
pp. 3860-3866
Author(s):  
M. L. Umashankar ◽  
S. Mallikarjunaswamy ◽  
M. V. Ramakrishna
Keyword(s):  
Shortest Path ◽  
High Speed ◽  
Routing Algorithm ◽  
Shortest Paths ◽  
Life Time ◽  
Wireless Sensor ◽  
Signal Interference ◽  
Energy Efficient Routing ◽  
Shortest Path Routing ◽  
Routing Techniques

Designing an energy-efficient routing makes the Wireless Sensor Networks (WSN) more effective and attractive for different applications. The WSN communication system power consumption mainly depends on three aspects such as routing cost computation, signal interference, and routing distance. All three factors are equally important in order to improve the network performance. The system reliability and deployment cost depends on the energy efficiency of the WSN. The energy related cost assignment and shortest paths identification are used in existing routing techniques. In the existing routing techniques maximum achievable lifetime and optimal link cost are low. Hence greatest possible performance can be achieved in distributed routing algorithm by finding shortest path. Maximum lifetime and best cost link can be generally obtained using distributed shortest path routing algorithm. In this paper high speed reconfigurable distributed Lifetime-Efficient Routing algorithm is designed to provide route selection outline with low complexity and obtain better performance compared to existing routing algorithm.

Self-adaptive multi-purpose Grey Wolf optimization for efficient routing of wireless ad hoc networks

2018 ◽  
Vol 09 (05) ◽  
pp. 1850036
Author(s):  
Sandeep Raskar ◽  
Kamatchi Iyer
Keyword(s):  
Wireless Ad Hoc Networks ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Network Routing ◽  
Grey Wolf Optimizer ◽  
Grey Wolf ◽  
Least Cost Path ◽  
Shortest Path Routing ◽  
Hoc Networks ◽  
The Cost

One of the well-known issues in the field of network routing is the Shortest Path Routing (SPR). The objective is to find the least-cost path with minimum delay and link breaks. Even though there are many algorithms to solve SPR, the cost, as well as link breaks, are indeed more thought-provoking in the real-time application. This paper intends to develop a routing approach that solves the challenges like route establishment and route recovery. The selection of the optimal route is done by adopting a generalized multi-purpose optimization algorithm named Grey Wolf Optimizer. Along with this, this paper adopts Neural Network (NN) to predict the node movements in the ad hoc network. The proposed routing algorithm is compared to the conventional approaches, and the significance of the approach is described clearly.

Sign in / Sign up

Export Citation Format

Share Document