Computation Performance Optimization Technique of Shortest Path Routing Algorithm in Networks Using Out-degree

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.

Download Full-text

A Novel Shortest Path Routing Algorithm for Wireless Data Collection in Transportation Networks

2019 4th International Conference on Computer Science and Engineering (UBMK) ◽

10.1109/ubmk.2019.8907167 ◽

2019 ◽

Cited By ~ 2

Author(s):

Izzet Fatih Senturk ◽

Gaoussou Youssouf Kebe

Keyword(s):

Data Collection ◽

Shortest Path ◽

Transportation Networks ◽

Routing Algorithm ◽

Wireless Data ◽

Shortest Path Routing ◽

Wireless Data Collection

Download Full-text

An oblivious shortest-path routing algorithm for fully connected cubic networks

Journal of Parallel and Distributed Computing ◽

10.1016/j.jpdc.2006.03.008 ◽

2006 ◽

Vol 66 (10) ◽

pp. 1294-1303 ◽

Cited By ~ 6

Author(s):

Xiaofan Yang ◽

Graham M. Megson ◽

David J. Evans

Keyword(s):

Shortest Path ◽

Routing Algorithm ◽

Shortest Path Routing ◽

Fully Connected

Download Full-text

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

International Journal of Engineering & Technology ◽

10.14419/ijet.v7i3.10.15630 ◽

2018 ◽

Vol 7 (3.10) ◽

pp. 59 ◽

Cited By ~ 1

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.

Download Full-text

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

Journal of Computational and Theoretical Nanoscience ◽

10.1166/jctn.2020.8975 ◽

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.

Download Full-text