A Novel Approach to Find an Optimal Path in MANET Using Reverse Reactive Routing Algorithm

2013 ◽  
pp. 567-574
Author(s):  
Bhabani S. Gouda ◽  
Ashish K. Dass ◽  
K. Lakshmi Narayana
Keyword(s):  
Routing Algorithm ◽  
Optimal Path ◽  
Novel Approach ◽  
Reactive Routing

A Novel Routing Network Algorithm Via Neutrosphic Fuzzy Set Approach

2021 ◽  
pp. 9-22
Author(s):  
S.Krishna Prabha ◽  
◽  
Broumi said ◽  
Selçuk Topal ◽  
◽  
...  
Keyword(s):  
Public Transportation ◽  
Routing Algorithm ◽  
Optimal Path ◽  
Routing Algorithms ◽  
Network Data ◽  
Main Function ◽  
Network Nodes ◽  
Web Interfaces ◽  
Telephone Networks ◽  
Set Up

Routers steer and bid network data, through packets that hold a variety of categories of data such as records, messages, and effortless broadcasts like web interfaces. The procedure of choosing a passageway for traffic in a network or between several networks is called routing. Starting from telephone networks to public transportation the principles of routing are applied. Routing is the higher-level decision-making that directs network packets from their source en route for their destination through intermediate network nodes by specific packet forwarding mechanisms. The main function of the router is to set up optimized paths among the different nodes in the network. An efficient novel routing algorithm is proposed with the utilization of neutrosophic fuzzy logic in this work addition to many routing algorithms for finding the optimal path in the literature. In this approach, each router makes its own routing decision in the halting time. Various concepts like routing procedures, most expected vector, most expected object, and list of estimated delays are explained.

An Optimal Routing Algorithm for Internet of Things Enabling Technologies

2017 ◽  
Vol 4 (3) ◽  
pp. 1-16 ◽  
Author(s):  
Amol V. Dhumane ◽  
Rajesh S. Prasad ◽  
Jayashree R. Prasad
Keyword(s):  
Genetic Algorithm ◽  
Internet Of Things ◽  
Energy Cost ◽  
High Reliability ◽  
Routing Algorithm ◽  
Optimal Path ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Trust Level ◽  
Enabling Technologies

In Internet of things and its relevant technologies the routing of data plays one of the major roles. In this paper, a routing algorithm is presented for the networks consisting of smart objects, so that the Internet of Things and its enabling technologies can provide high reliability while the transmitting the data. The proposed technique executes in two stages. In first stage, the sensor nodes are clustered and an optimal cluster head is selected by using k-means clustering algorithm. The clustering is performed based on energy of sensor nodes. Then the energy cost of the cluster head and the trust level of the sensor nodes are determined. At second stage, an optimal path will be selected by using the Genetic Algorithm (GA). The genetic algorithm is based on the energy cost at cluster head, trust level at sensor nodes and path length. The resultant optimal path provides high reliability, better speed and more lifetimes.

scholarly journals PHANOTATE: a novel approach to gene identification in phage genomes

2019 ◽  
Vol 35 (22) ◽  
pp. 4537-4542 ◽  
Author(s):  
Katelyn McNair ◽  
Carol Zhou ◽  
Elizabeth A Dinsdale ◽  
Brian Souza ◽  
Robert A Edwards
Keyword(s):  
Gene Prediction ◽  
Optimal Path ◽  
Genome Structure ◽  
Weighted Graph ◽  
Open Reading Frames ◽  
Supplementary Information ◽  
Functional Protein ◽  
Protein Database ◽  
Protein Coding ◽  
Novel Approach

Abstract Motivation Currently there are no tools specifically designed for annotating genes in phages. Several tools are available that have been adapted to run on phage genomes, but due to their underlying design, they are unable to capture the full complexity of phage genomes. Phages have adapted their genomes to be extremely compact, having adjacent genes that overlap and genes completely inside of other longer genes. This non-delineated genome structure makes it difficult for gene prediction using the currently available gene annotators. Here we present PHANOTATE, a novel method for gene calling specifically designed for phage genomes. Although the compact nature of genes in phages is a problem for current gene annotators, we exploit this property by treating a phage genome as a network of paths: where open reading frames are favorable, and overlaps and gaps are less favorable, but still possible. We represent this network of connections as a weighted graph, and use dynamic programing to find the optimal path. Results We compare PHANOTATE to other gene callers by annotating a set of 2133 complete phage genomes from GenBank, using PHANOTATE and the three most popular gene callers. We found that the four programs agree on 82% of the total predicted genes, with PHANOTATE predicting more genes than the other three. We searched for these extra genes in both GenBank’s non-redundant protein database and all of the metagenomes in the sequence read archive, and found that they are present at levels that suggest that these are functional protein-coding genes. Availability and implementation https://github.com/deprekate/PHANOTATE Supplementary information Supplementary data are available at Bioinformatics online.

scholarly journals A Quantum Ant Colony Multi-Objective Routing Algorithm in WSN and Its Application in a Manufacturing Environment

Sensors ◽  
2019 ◽  
Vol 19 (15) ◽  
pp. 3334 ◽  
Author(s):  
Fei Li ◽  
Min Liu ◽  
Gaowei Xu
Keyword(s):  
Simulation Analysis ◽  
Fitness Function ◽  
Routing Algorithm ◽  
Optimal Path ◽  
Ant Colony ◽  
Local Optimum ◽  
Manufacturing Environment ◽  
Multi Objective ◽  
Search Path ◽  
Manufacturing Environments

In many complex manufacturing environments, the running equipment must be monitored by Wireless Sensor Networks (WSNs), which not only requires WSNs to have long service lifetimes, but also to achieve rapid and high-quality transmission of equipment monitoring data to monitoring centers. Traditional routing algorithms in WSNs, such as Basic Ant-Based Routing (BABR) only require the single shortest path, and the BABR algorithm converges slowly, easily falling into a local optimum and leading to premature stagnation of the algorithm. A new WSN routing algorithm, named the Quantum Ant Colony Multi-Objective Routing (QACMOR) can be used for monitoring in such manufacturing environments by introducing quantum computation and a multi-objective fitness function into the routing research algorithm. Concretely, quantum bits are used to represent the node pheromone, and quantum gates are rotated to update the pheromone of the search path. The factors of energy consumption, transmission delay, and network load-balancing degree of the nodes in the search path act as fitness functions to determine the optimal path. Here, a simulation analysis and actual manufacturing environment verify the QACMOR’s improvement in performance.

scholarly journals PSO based path planner of an autonomous mobile robot

2012 ◽  
Vol 2 (2) ◽  
Author(s):  
B. Deepak ◽  
Dayal Parhi
Keyword(s):  
Mobile Robot ◽  
Robot Navigation ◽  
Fitness Function ◽  
Optimal Path ◽  
Mobile Robot Navigation ◽  
Autonomous Mobile Robot ◽  
Swarm Optimization ◽  
Novel Approach ◽  
Fitness Value ◽  
Path Planner

AbstractA novel approach based on particle swarm optimization has been presented in this paper for solving mobile robot navigation task. The proposed technique tries to optimize the path generated by an intelligent mobile robot from its source position to destination position in its work space. For solving this problem, a new fitness function has been modelled, which satisfies the obstacle avoidance and optimal path traversal conditions. From the obtained fitness values of each particle in the swarm, the robot moves towards the particle which is having optimal fitness value. Simulation results are provided to validate the feasibility of the developed methodology in various unknown environments.

A New Fault Tolerant Routing Algorithm for Networks on Chip

2019 ◽  
Vol 10 (3) ◽  
pp. 68-85
Author(s):  
Chakib Nehnouh ◽  
Mohamed Senouci
Keyword(s):  
Network Architecture ◽  
Fault Tolerant ◽  
Routing Algorithm ◽  
Transient Faults ◽  
Networks On Chip ◽  
Congestion Detection ◽  
Novel Approach ◽  
On Chip ◽  
Detection Mechanisms ◽  
Correct Data

To provide correct data transmission and to handle the communication requirements, the routing algorithm should find a new path to steer packets from the source to the destination in a faulty network. Many solutions have been proposed to overcome faults in network-on-chips (NoCs). This article introduces a new fault-tolerant routing algorithm, to tolerate permanent and transient faults in NoCs. This solution called DINRA can satisfy simultaneously congestion avoidance and fault tolerance. In this work, a novel approach inspired by Catnap is proposed for NoCs using local and global congestion detection mechanisms with a hierarchical sub-network architecture. The evaluation (on reliability, latency and throughput) shows the effectiveness of this approach to improve the NoC performances compared to state of art. In addition, with the test module and fault register integrated in the basic architecture, the routers are able to detect faults dynamically and re-route packets to fault-free and congestion-free zones.

ON–OFF: a reactive routing algorithm for dynamic thermal management in 3D NoCs

2018 ◽  
Vol 13 (1) ◽  
pp. 11-19 ◽  
Author(s):  
Ebadollah Taheri ◽  
Karim Mohammadi ◽  
Ahmad Patooghy
Keyword(s):  
Thermal Management ◽  
Routing Algorithm ◽  
Dynamic Thermal Management ◽  
Reactive Routing

A New Reactive Routing Algorithm to Improve Capacity and Average End-to-End Delay in MANETs

2014 ◽  
Vol 40 (2) ◽  
pp. 487-499 ◽  
Author(s):  
Elahe Ataee Bojd ◽  
Neda Moghim ◽  
Faria Nassiri-Mofakham ◽  
Naser Movahedinia
Keyword(s):  
Routing Algorithm ◽  
End To End Delay ◽  
Reactive Routing ◽  
End To End
Sign in / Sign up

Export Citation Format

Share Document