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.

scholarly journals Enhanced Routing Algorithm Based on Reinforcement Machine Learning—A Case of VoIP Service

Sensors ◽  
2021 ◽  
Vol 21 (2) ◽  
pp. 504
Author(s):  
Davi Ribeiro Militani ◽  
Hermes Pimenta de Moraes ◽  
Renata Lopes Rosa ◽  
Lunchakorn Wuttisittikulkij ◽  
Miguel Arjona Ramírez ◽  
...  
Keyword(s):  
Machine Learning ◽  
Network Performance ◽  
Routing Algorithm ◽  
Variable Number ◽  
Performance Comparison ◽  
Routing Algorithms ◽  
Network Data ◽  
Dynamic Adjustment ◽  
Network Parameters ◽  
Control Message

The routing algorithm is one of the main factors that directly impact on network performance. However, conventional routing algorithms do not consider the network data history, for instances, overloaded paths or equipment faults. It is expected that routing algorithms based on machine learning present advantages using that network data. Nevertheless, in a routing algorithm based on reinforcement learning (RL) technique, additional control message headers could be required. In this context, this research presents an enhanced routing protocol based on RL, named e-RLRP, in which the overhead is reduced. Specifically, a dynamic adjustment in the Hello message interval is implemented to compensate the overhead generated by the use of RL. Different network scenarios with variable number of nodes, routes, traffic flows and degree of mobility are implemented, in which network parameters, such as packet loss, delay, throughput and overhead are obtained. Additionally, a Voice-over-IP (VoIP) communication scenario is implemented, in which the E-model algorithm is used to predict the communication quality. For performance comparison, the OLSR, BATMAN and RLRP protocols are used. Experimental results show that the e-RLRP reduces network overhead compared to RLRP, and overcomes in most cases all of these protocols, considering both network parameters and VoIP quality.

scholarly journals Software Defined Network of Video Surveillance System Based on Enhanced Routing Algorithms

2020 ◽  
Vol 17 (1(Suppl.)) ◽  
pp. 0391
Author(s):  
Mustafa I. Salman et al.
Keyword(s):  
Video Surveillance ◽  
Surveillance System ◽  
New Technology ◽  
Routing Algorithm ◽  
Optimal Path ◽  
Routing Algorithms ◽  
Path Selection ◽  
Video Surveillance System ◽  
Software Defined Network ◽  
Dijkstra Algorithm

Software Defined Network (SDN) is a new technology that separate the ‎control plane from the data plane. SDN provides a choice in automation and ‎programmability faster than traditional network. It supports the ‎Quality of Service (QoS) for video surveillance application. One of most ‎significant issues in video surveillance is how to find the best path for routing the packets ‎between the source (IP cameras) and destination (monitoring center). The ‎video surveillance system requires fast transmission and reliable delivery ‎and high QoS. To improve the QoS and to achieve the optimal path, the ‎SDN architecture is used in this paper. In addition, different routing algorithms are ‎used with different steps. First, we evaluate the video transmission over the SDN with ‎Bellman Ford algorithm. Then, because the limitation of Bellman ford ‎algorithm, the Dijkstra algorithm is used to change the path when a congestion occurs. Furthermore, the Dijkstra algorithm is used with two ‎controllers to reduce the time consumed by the SDN controller. ‎ POX and Pyretic SDN controllers are used such that POX controller is ‎responsible for the network monitoring, while Pyretic controller is responsible for the ‎routing algorithm and path selection. Finally, a modified Dijkstra algorithm is further proposed and evaluated with two ‎controllers to enhance the performance.  The results show that the modified Dijkstra algorithm outperformed the other approaches in the aspect of QoS parameters.

scholarly journals Antnet: A Robust Routing Algorithm for Data Networks

1970 ◽  
Vol 5 (1) ◽  
Author(s):  
Shariq Haseeb Khairul Azami Sidek Ahmad Faris Ismail, Lai W.K. ◽  
Aw Yit Mei
Keyword(s):  
Mobile Agents ◽  
Routing Algorithm ◽  
Routing Algorithms ◽  
Convergence Time ◽  
Data Networks ◽  
Successful Implementation ◽  
Link State ◽  
Performance Matrix ◽  
Telecommunications Network ◽  
Routing Tables

Successful implementation and operation of a network largely depends on the routing algorithm in use. To date, several routing algorithms are in use but the problem with these algorithms is that they are either not adaptive or not robust enough, thus limiting the proper use of bandwidth.  AntNet is an innovative algorithm that may be used for data networks. It is a combination of both static and dynamic routing algorithms. In this algorithm, a group of mobile agents (compared to real ants) form paths between source and destination nodes. They explore the network continuously and exchange obtained information indirectly, in order to update the routing tables at different nodes. Our version of AntNet (hereinafter referred to as AntNet2.0) has been improved to overcome the problems with other algorithms. This paper compares the performance of AntNet2.0 against two other commercially popular algorithms, viz. link state routing algorithm and distant vector routing algorithm. The performance matrix used to compare the algorithms is based on average throughput, packet loss, packet drop and end-to-end delay. Convergence time for this algorithm on a nation-wide telecommunications network will also be discussed. Conclusions and areas of further work will also be presented in lucid manner, so that it may be transformed into real practice in the future.Key Words: mobile agents, swarm intelligence, networks and constant bit rate

INVESTIGATING A WIRELESS SENSOR NETWORK OPTIMAL LIFETIME SOLUTION FOR LINEAR TOPOLOGIES

2006 ◽  
Vol 07 (01) ◽  
pp. 91-99 ◽  
Author(s):  
Keith Hellman ◽  
Michael Colagrosso
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Nearest Neighbor ◽  
Analytic Solution ◽  
Routing Algorithm ◽  
Optimal Solution ◽  
Routing Algorithms ◽  
Wireless Sensor ◽  
Global Knowledge ◽  
Alternative Solutions

We investigate a known optimal lifetime solution for a linear wireless sensor network through simulation, and propose alternative solutions where a known optimal solution does not exist. The network is heterogeneous in the sensors' energy distribution and also in the amount of data each sensor must communicate. As a basis for comparison, we analyze the lifetime of a network using a simple, nearest-neighbor routing algorithm, and an analytic solution to the optimal lifetime of networks meeting certain constraints. Alternative solutions considered range from those requiring global knowledge of the network to solutions using only next-neighbor knowledge. We compare the performance of all the routing algorithms in simulation.

Comparative Performance Analysis of 
Selected Routing Algorithms by Load Variation of 2-Dimensional Mesh Topology Based 
Network-On-Chip

2021 ◽  
Vol 20 (3) ◽  
pp. 1-6
Author(s):  
Mohammed Shaba Saliu ◽  
Muyideen Omuya Momoh ◽  
Pascal Uchenna Chinedu ◽  
Wilson Nwankwo ◽  
Aliu Daniel
Keyword(s):  
Routing Algorithm ◽  
Adaptive Routing ◽  
Injection Rate ◽  
Network On Chip ◽  
Routing Algorithms ◽  
Comparative Performance ◽  
Traffic Pattern ◽  
Mesh Topology ◽  
Similar Vein ◽  
On Chip

Network-on-Chip (NoC) has been proposed as a viable solution to the communication challenges on System-on-Chips (SoCs). As the communication paradigm of SoC, NoCs performance depends mainly on the type of routing algorithm chosen. In this paper different categories of routing algorithms were compared. These include XY routing, OE turn model adaptive routing, DyAD routing and Age-Aware adaptive routing.  By varying the load at different Packet Injection Rate (PIR) under random traffic pattern, comparison was conducted using a 4 × 4 mesh topology. The Noxim simulator, a cycle accurate systemC based simulator was employed. The packets were modeled as a Poisson distribution; first-in-first-out (FIFO) input buffer channel with a depth of five (5) flits and a flit size of 32 bits; and a packet size of 3 flits respectively. The simulation time was 10,000 cycles. The findings showed that the XY routing algorithm performed better when the PIR is low.  In a similar vein, the DyAD routing and Age-aware algorithms performed better when the load i.e. PIR is high.

Neurosurgery planning based on automated image recognition and optimal path design

2021 ◽  
Vol 69 (8) ◽  
pp. 708-721
Author(s):  
Annika Hackenberg ◽  
Karl Worthmann ◽  
Torben Pätz ◽  
Dörthe Keiner ◽  
Joachim Oertel ◽  
...  
Keyword(s):  
Optimal Path ◽  
Planning Problem ◽  
Simulation And Optimization ◽  
Ellipsoidal Approximations ◽  
Set Up ◽  
The Brain ◽  
Path Planning Problem ◽  
Automated Image Recognition ◽  
Modelling Simulation

Abstract Stereotactic neurosurgery requires a careful planning of cannulae paths to spare eloquent areas of the brain that, if damaged, will result in loss of essential neurological function such as sensory processing, linguistic ability, vision, or motor function. We present an approach based on modelling, simulation, and optimization to set up a computational assistant tool. Thereby, we focus on the modeling of the brain topology, where we construct ellipsoidal approximations of voxel clouds based on processed MRI data. The outcome is integrated in a path-planning problem either via constraints or by penalization terms in the objective function. The surgical planning problem with obstacle avoidance is solved for different types of stereotactic cannulae using numerical simulations. We illustrate our method with a case study using real MRI data.

Cluster-Based Online Routing Protocols for Ad Hoc Network

2014 ◽  
Vol 9 (4) ◽  
pp. 54-66
Author(s):  
Alaa E. Abdallah ◽  
Mohammad Bsoul ◽  
Emad E. Abdallah ◽  
Ibrahim Al–Oqily ◽  
George Kao
Keyword(s):  
Ad Hoc ◽  
Dominating Set ◽  
Routing Algorithm ◽  
Routing Algorithms ◽  
Greedy Routing ◽  
Mobile Nodes ◽  
3D Space ◽  
Geographical Position ◽  
2D Space ◽  
New Algorithms

In geographical routing algorithms, mobile nodes rely on geographical position to make routing judgments. Researchers frequently discuss such routing algorithms in (2D) space. However, in reality, mobile nodes spread in (3D) space. In this paper the authors present four new 3D geographical-based routing algorithms Cylinder, Greedy-Cylinder, Cluster-Cylinder, and Greedy-cluster-Cylinder. In Cylinder routing, the nodes are locally projected on the inner surface of a cylinder, perimeter routing is executed after that. Greedy-Cylinder starts with Greedy routing algorithm until a local minimum is reached. The algorithm then switches to Cylinder routing. Cluster-Cylinder elects a dominating set for all nodes and then uses this set for projection and routing. The fourth algorithm Greedy-cluster-Cylinder is a combination between Greedy-Cylinder and Cluster-Cylinder. The authors evaluate their new algorithms and compare them with many classical known algorithms. The simulation outcomes show the substantial enhancement in delivery rate over other algorithms.

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.

Distributed Data Management of Daily Car Pooling Problems

2011 ◽  
pp. 408-412
Author(s):  
Roberto Wolfler Calvo ◽  
Fabio de Luigi ◽  
Palle Haastrup ◽  
Vittorio Maniezzo
Keyword(s):  
Public Transportation ◽  
Urban Areas ◽  
Transportation Systems ◽  
Transfer Velocity ◽  
Public And Private ◽  
Transportation Demand ◽  
Freight Transportation Demand ◽  
Set Up ◽  
Public Transportation Systems

The increased human mobility, combined with high use of private cars, increases the load on the environment and raises issues about the quality of life. The use of private cars lends to high levels of air pollution in cities, parking problems, noise pollution, congestion, and the resulting low transfer velocity (and, thus, inefficiency in the use of public resources). Public transportation service is often incapable of effectively servicing non-urban areas, where cost-effective transportation systems cannot be set up. Based on investigations during the last years, problems related to traffic have been among those most commonly mentioned as distressing, while public transportation systems inherently are incapable of facing the different transportation needs arising in modern societies. A solution to the problem of the increased passenger and freight transportation demand could be obtained by increasing both the efficiency and the quality of public transportation systems, and by the development of systems that could provide alternative solutions in terms of flexibility and costs between the public and private ones. This is the rationale behind so-called Innovative Transport Systems (ITS) (Colorni et al., 1999), like car pooling, car sharing, dial-a-ride, park-and-ride, card car, park pricing, and road pricing, which are characterized by the exploitation of innovative organizational elements and by a large flexibility in their management (e.g., traffic restrictions and fares can vary according with the time of day).

Sign in / Sign up

Export Citation Format

Share Document