To see the other types of publications on this topic, follow the link: Bellman-Ford routing algorithm.
Journal articles on the topic 'Bellman-Ford routing algorithm'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 48 journal articles for your research on the topic 'Bellman-Ford routing algorithm.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
1
Saxena, Mohit Chandra, Munish Sabharwal, and Preeti Bajaj. "An Optimised Shortest Path Algorithm for Network Rotuting & SDN." International Journal on Recent and Innovation Trends in Computing and Communication 11, no. 8s (2023): 20–31. http://dx.doi.org/10.17762/ijritcc.v11i8s.7172.
Full textAbstract:
Network routing algorithms form the backbone of data transmission in modern network architectures, with implications for efficiency, speed, and reliability. This research aims to critically investigate and compare three prominent routing algorithms: Bellman-Ford, Shortest Path Faster Algorithm (SPFA), and our novel improved variant of Bellman-Ford, the Space-efficient Cost-Balancing Bellman-Ford (SCBF). We evaluate the performance of these algorithms in terms of time and space complexity, memory utilization, and routing efficacy, within a simulated network environment. Our results indicate that while Bellman-Ford provides consistent performance, both SPFA and SCBF present improvements in specific scenarios with the SCBF showing notable enhancements in space efficiency. The innovative SCBF algorithm provides competitive performance and greater space efficiency, potentially making it a valuable contribution to the development of network routing protocols. Further research is encouraged to optimize and evaluate these algorithms in real-world network conditions. This study underscores the continuous need for algorithmic innovation in response to evolving network demands.
2
Motghare, Preshit, Gaurav Ulekar, Sudarshan Biradar, and Prof Dipti Pandit. "Hybrid Algorithm Combining Bellman-Ford, Dijkstra, and Machine Learning for Dynamic Network Routing." International Journal for Research in Applied Science and Engineering Technology 12, no. 11 (2024): 2368–77. https://doi.org/10.22214/ijraset.2024.65581.
Full textAbstract:
Abstract: Optimizing routing in dynamic networks has emerged as an increasingly important problem today with re- duced latency, guaranteed connectivity and efficient data trans- fer under a variety of changing conditions. Among the more well known shortest path algorithms those of Bellman-Ford and Dijkstra’s have very notable advantages and disadvantages themselves; while Bellman-Ford has provisions against negative weighted edges and pays a penalty in computation, Dijkstra’s algorithm cannot work with negative weighted edges but is highly efficient. It introduces a new hybrid routing algorithm that makes intelligent choices between the classical Bellman-Ford and Dijk- stra’s using machine learning techniques. This model, through historical analysis of data on traffic data and network metrics, predicts the level of congestion and identifies that algorithm which is most efficient in the selection of a call for routing. It switches over to Bellman-Ford if congestion expectation is high or if it contains negative weights, whereas under stable network conditions, it employs Dijkstra’s due to its efficiency. Preliminary experiments reveal that this adaptive strategy optimizes both computation overhead and route selection accuracy in large scale dynamic networking environments. Our results indicate improvements in routing efficiency in complex networks based on predictive analytics from established algorithms
3
Ghimire, Roshani, and Ram Kumar Basnet. "Shortest Path Routing Performance Evaluation over SDN Environment." December 2023 5, no. 4 (2023): 405–22. http://dx.doi.org/10.36548/jei.2023.4.004.
Full textAbstract:
Static routing has a manual configuration setup system, and the scope of static routing in an SDN network is just for small networks. The solution to this problem rises up with the new technology defined as software-defined networking (SDN) based on shortest path first dynamic routing. SDN has the facility of a centralized controller that smooth the controls and routes computation over a data packet. The performance analysis of SDN networks that have SDN switches connected to the network based on the shortest path first protocol are simulated on Mininet. The POX controller with Mininet programming feature for creating smart topologies was chosen. In this research, the SDN network using Dijkstra’s algorithm, Bellman-Ford algorithm, extended Dijkstra’s algorithm and Floyd Warshall Algorithm were implemented. The quality factors of SDN created by using four algorithms are measured in terms of delay, jitter, latency, packet loss, transmit, received, throughput, and bandwidth based on experimental results and European Telecommunications Standards Institute (ETSI) data. The performance parameters of SDN network topology created using Dijkstra’s, bellman ford, extended Dijkstra’s, and Floyd Warshall algorithms were compared and the experimental results showed that Bellman-Ford algorithm is better in terms of performance parameters than the other three algorithms.
4
Sulaiman, Oris Krianto, Amir Mahmud Siregar, Khairuddin Nasution, and Tasliyah Haramaini. "Bellman Ford algorithm - in Routing Information Protocol (RIP)." Journal of Physics: Conference Series 1007 (April 2018): 012009. http://dx.doi.org/10.1088/1742-6596/1007/1/012009.
Full text
5
Cholla, Dr Raman. "Optimizing the Bellman-Ford Algorithm Using GPU Parallelization." INTERNATIONAL JOURNAL OF SCIENTIFIC RESEARCH IN ENGINEERING AND MANAGEMENT 09, no. 05 (2025): 1–9. https://doi.org/10.55041/ijsrem47660.
Full textAbstract:
ABSTRACT The Bellman-Ford algorithm's temporal complexity of O(VE) renders it ineffective for big and dense networks, which is a serious computational disadvantage. The need for effective algorithms that can handle large-scale graph structures has increased due to the modern digital landscape's rapid data expansion. The Single Source Shortest Path (SSSP) problem, which entails determining the shortest pathways from a single source vertex to every other vertex in a graph, is one of the most basic and extensively researched topics in graph theory. Numerous real-world applications, including biological network modelling, social media analysis, telecommunications routing, and navigation systems, are based on this issue. The Bellman-Ford algorithm stands out among the other algorithms created to address the SSSP problem because it can handle networks with negative weight edges and detect negative weight cycles, two features that more effective algorithms like Dijkstra's do not allow. Our project investigates using Graphics Processing Units (GPUs) to parallelise the Bellman-Ford algorithm in order to get around this restriction. With thousands of cores, GPUs are made for extremely parallel calculations and provide significant speedups over conventional CPU-based processing for jobs that can be divided into discrete, independent work units. We developed a GPUaccelerated version of the Bellman-Ford algorithm by utilising NVIDIA's parallel computing platform, CUDA (Compute Unified Device Architecture). Keywords Computer Unified Device Architecture (CUDA), Graphics Processing Units (GPUs), and the Single Source Shortest Path (SSSP) problem.
6
Kumar Rao, Kavikondala Praveen, and Tamilarasan Senthil Murugan. "An Efficient Routing Algorithm for Software Defined Networking using Bellman Ford Algorithm." International Journal of Online and Biomedical Engineering (iJOE) 15, no. 14 (2019): 87. http://dx.doi.org/10.3991/ijoe.v15i14.11546.
Full textAbstract:
<p class="0abstract">Software-Defined Networking (SDN) is the developing technology and has the advantages of handling dynamic nodes in the network with improved performance. SDN has the problem of allocating the resources to the user with high latency and this affects the overall system performance. To solve this problem, the routing method based on Bellman Ford Algorithm (BFA) is proposed in the SDN. The Bellman-Ford has less computation time in identifying the shortest path in the nodes of SDN graph. The BFA is applied to identify the optimal path for the nodes to the user with low latency. The BFA is compared with Dijikstra’s algorithm to analyze its performance. The experimental outcome shows that the BFA has lower latency compared to the Dijkstra's algorithm. The lower computation time is achieved due to BFA has a lower magnitude time in vertices and edges compared Dijkstra's algorithm. The Dijkstra’s algorithm has the latency of 10.8 ms, while proposed BFA has the latency of 2.97ms.</p>
7
Shen, Xue Zhen, and Xin Guo Tang. "Dynamic Routing Algorithm Based on HIP Multicast Model." Advanced Materials Research 424-425 (January 2012): 607–11. http://dx.doi.org/10.4028/www.scientific.net/amr.424-425.607.
Full textAbstract:
A HIP multicast mode; based dynamic multicast routing algorithm (HIPDMR) was brought out and network model was established to describe and simplify problem to be researched. HIPDMR used Bellman-Ford as routing search algorithm, which can determine dynamic multicast routing with minimum hop number and overhead while meet constraints of bandwidth, delay, jitter and packet loss rate. Simulation experiments result show that HIPDMR can build dynamic multicast routing under constraints of multiple QoS comparing with algorithms that not considering QoS assuming network node output link capacity be equal
8
Chertkov, Alexandr A., Yaroslav N. Kask, and Ludmila B. Ochina. "STREAMING NETWORK ROUTING BASED ON BELLMAN-FORD ALGORITHM MODIFICATION." Vestnik Gosudarstvennogo universiteta morskogo i rechnogo flota imeni admirala S. O. Makarova 14, no. 4 (2022): 615–27. http://dx.doi.org/10.21821/2309-5180-2022-14-4-615-627.
Full textAbstract:
The operational task of automating the construction and routing of the network model with the known coordinates of the conditional goals set for a group of vessels to achieve them in the minimum time is solved; it makes it possible to obtain the reserves of running time necessary for saving fuel and energy, taking into account the load, the cost of cargo, transportation costs, logistics characteristics, etc. It is emphasized that in stormy weather conditions and vessel management in situations related to schedule correction, flexible operational decisions of dispatching services, made on the basis of numerical optimization methods using modern computing environments, are necessary. In this regard, the method of dynamic programming, implemented using the Bellman-Ford routing algorithm, which is supplemented by a recursive step-by-step optimization procedure that removes the limitation of the algorithm in the presence of inversely oriented edges with negative weights in the graph, is discussed in the paper. In the presence of negative weights, there are conditions for the appearance of a negative cycle in the graph, in which the practical implementation of the Bellman-Ford algorithm will become impossible due to an endless cycle of relaxations (attenuation) of the vertices weights included in this cycle. Hence, at a limited period of time for weighing all vertices (passes on all edges), the algorithm can give a knowingly false result. The proposed procedure for modifying the well-known Bellman-Ford algorithm eliminates this limitation and allows it to be used not only for estimating the shortest paths in a network containing arcs with negative weights, but also to detect negative cycles in it. The modified Bellman-Ford algorithm is implemented as a program compiled in MATLAB codes, and it is demonstrated by the example of automated construction and calculation of a network model containing both positive and negative edges (flows), using a recursive procedure of step-by-step optimization. It is shown that the proposed model, unlike the known models, eliminates the limitations caused by the presence of negative cycles in the network model, which makes it possible to automate the search for the shortest paths to conditional goals by the functional means of the MATLAB environment. The constructed computer model is simple and compact. The proposed algorithm and the recursive procedure are recommended for finding energy-efficient solutions for managing mobile objects in water transport.
9
Salman et al., Mustafa I. "Software Defined Network of Video Surveillance System Based on Enhanced Routing Algorithms." Baghdad Science Journal 17, no. 1(Suppl.) (2020): 0391. http://dx.doi.org/10.21123/bsj.2020.17.1(suppl.).0391.
Full textAbstract:
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.
10
Chen, You Rong, Li Yu, Qi Fen Dong, and Zhen Hong. "Distributed Lifetime Optimized Routing Algorithm for Wireless Sensor Networks." Applied Mechanics and Materials 40-41 (November 2010): 448–52. http://dx.doi.org/10.4028/www.scientific.net/amm.40-41.448.
Full textAbstract:
The network hub nodes consumed excessive energy and failed prematurely, thus it reduced the network lifetime. In order to solve the problem, distributed lifetime optimized routing algorithm (DLOR) for wireless sensor networks was proposed. Energy for transmitting data and neighbor node residual energy were considered comprehensively. Then new weight function was introduced and distributed asynchronous Bellman-Ford algorithm was also used to construct the shortest routing tree. Finally, data were gathered along the shortest routing tree to sink node. Simulation results show that DLOR algorithm can extend network lifetime and enable cost-effective energy consumption. Under certain conditions, DLOR algorithm outperforms PEDAP, GreedyDijkstra, LET, Ratio-w and Sum-w algorithms.
11
Karbowski, Andrzej. "On the connections between optimal control, regulation and dynamic network routing." Journal of Telecommunications and Information Technology, no. 3 (September 30, 2003): 67–72. http://dx.doi.org/10.26636/jtit.2003.3.189.
Full textAbstract:
he paper is devoted to studying general features of dynamic network routing problems. It is shown that these problems may be interpreted as receding horizon optimal control problems or simply regulation problems. In the basic formulation it is assumed, that the nodes have no dynamics and the only goal of the optimization mechanism is to find the shortest paths from the source to the destination nodes. In this problem the optimization mechanism (i.e. the Bellman-Ford algorithm) may be interpreted as a receding horizon optimal control routine. Moreover, there is one-to-one correspondence between the Bellman optimal cost-to-go function in the shortest path problem and the Lyapunov function in the regulation problem. At the end some results of the application of the routing optimization algorithm to an inverted pendulum regulation problem are presented.
12
Liu, Wei, Fu Quan Sun, Hui Lin Yuan, and Jin Bo Cao. "A New Routing Algorithm Based on Adjacent Matrix in Pipeline Laying." Advanced Materials Research 1065-1069 (December 2014): 1683–86. http://dx.doi.org/10.4028/www.scientific.net/amr.1065-1069.1683.
Full textAbstract:
With the development of economy, higher requirements for pipeline laying are raised. Among them, how to choose path for laying effectivelyand cheaply is the most important. Compared with ‘Dijkstra’, ‘Bellman-Ford’, ‘Floyd’ and ‘Dynamic planning model’, a new routing algorithm based on adjacent matrix is proposed and detailed processes and rules are designed. Additionally the effectiveness of the algorithm is proved through being applied to an example.
13
Yiltas-Kaplan, Derya. "Traffic Optimization with Software-Defined Network Controller on a New User Interface." JUCS - Journal of Universal Computer Science 28, no. (6) (2022): 648–69. https://doi.org/10.3897/jucs.80625.
Full textAbstract:
Software-defined networking (SDN) has emerged as a solution to the cumbersome structures of classical computer networks. It separates control and data planes to give independence to devices with respect to either traffic routing or network management. The two isolated planes communicate with each other via the help of software modules, which are located in an SDN controller, such as Floodlight, NOX, or Ryu. In this study, Floodlight is used and an SDN topology with 20 switches is constructed with Python code in Mininet. All algorithms have been coded with Java. The default routing algorithm in Floodlight is Dijkstra’s algorithm. Four different network optimization algorithms, namely Bellman-Ford, Ford-Fulkerson, Auction, and Dual Ascent algorithms, are utilized in ordinary network routing instead of Dijkstra’s algorithm. None of these four algorithms were used in SDN before and network implementations using Ford-Fulkerson, Auction, or Dual Ascent algorithms were scarce in the literature. The results are analyzed with multiple types of normalization on a new user interface communicating with Floodlight part via HTTP requests. There has not been a user interface that performs the same operations in Floodlight. In the future, this study may possibly be improved with considering normalization processes based on various proportions among the metric values and accounting the computational time of the algorithms.
14
Vesovic, Mihailo, Aleksandra Smiljanic, and Dusan Kostic. "Performance of shortest path algorithm based on parallel vertex traversal." Serbian Journal of Electrical Engineering 13, no. 1 (2016): 31–43. http://dx.doi.org/10.2298/sjee1601031v.
Full textAbstract:
Shortest path algorithms for different applications, such as Internet routing, VLSI design and so on are used. Dijkstra and Bellman-Ford are commonly used shortest path algorithms which are typically implemented in networks with hundreds of nodes. However, scale of shortest path problems is increasing, and more efficient algorithms are needed. With the development of multicore processors, one natural way to speedup shortest path algorithms is through parallelization. In this paper, we propose a novel shortest path algorithm with parallel vertex transversal, and compare its speed with standard solutions in datacenter topologies.
15
WU, JIE, and FEI DAI. "QoS ROUTING IN HYPERCUBE MULTICOMPUTERS." Parallel Processing Letters 13, no. 01 (2003): 43–52. http://dx.doi.org/10.1142/s0129626403001136.
Full textAbstract:
In this paper, we present a coding method to capture QoS information in hypercube multicomputers. The coding method is based on a localized algorithm where each node interacts with its neighbors to gather QoS information. Specifically, each node maintains a QoS vector where the k-th element represents the guaranteed QoS performance to a destination that is k hops away. The localized algorithm exhibits desirable properties of self-stabilizing, self-optimizing, and self-healing. Simulation results show that this coding method provides a good approximation of the minimum QoS value to a k-hop destination and, at the same time, uses a relatively small number of packets to propagate a change in link state (QoS value) compared with the classical distributed Bellman-Ford method.
16
Mamoun Yaqoub Mimoun Alhammali and Abdulghader Basheer Murad Jalgum. "Enhanced Multi-path Energy-Efficient Routing with Dynamic Load Balancing for MANETs Using Bellman-Ford Algorithm." International Journal of Information Technology and Computer Engineering 12, no. 4 (2024): 243–58. https://doi.org/10.62647/ijitce.2024.v12.i4.pp243-258.
Full textAbstract:
Mobile Ad Hoc Networks (MANETs) play a crucial role in modern communication, particularly in dynamic and infrastructure-less environments such as disaster recovery, military operations, and IoT-based applications. However, traditional routing protocols like AODV, DSR, and DSDV face significant challenges, including high energy consumption, frequent route failures, and inefficient load balancing. The Bellman-Ford algorithm, despite its robustness in shortest-path computations, lacks energy-awareness, leading to rapid node depletion and network instability. To address these limitations, this study proposes an Enhanced Multi-path Energy-Efficient Routing (EMEER) with Dynamic Load Balancing, incorporating an optimized Bellman-Ford algorithm. The key novelties of this approach include an energy-aware routing metric that considers residual energy levels, a multi-path selection strategy to enhance fault tolerance, and a dynamic load-balancing mechanism that distributes traffic to prevent congestion. These enhancements collectively improve network reliability and longevity. The proposed EMEER protocol is implemented in a simulated MANET environment using NS-3, and its performance is evaluated against existing protocols. The results demonstrate that EMEER achieves a 25.6% reduction in energy consumption, a 17.3% improvement in packet delivery ratio (PDR), and a 31.8% increase in network lifetime compared to traditional approaches. Furthermore, it significantly reduces end-to-end delay and routing overhead. By integrating energy efficiency with adaptive load balancing, this study contributes to the development of more sustainable and resilient MANET architectures. Future work will explore the integration of AI-driven optimization techniques, inspired by hybrid metaheuristic models used in edge computing, to further enhance routing adaptability.
17
Sunardi, Sunardi, Muhamad Azwar, Dedy Sofian MZ, Angga Radlisa Samsudin, and Fazlul Rahman. "Implementasi Algoritma Dijkstra dan Bellman-Ford untuk Optimasi Rute Pemadam Kebakaran di Kota Praya." JTIM : Jurnal Teknologi Informasi dan Multimedia 7, no. 2 (2025): 398–407. https://doi.org/10.35746/jtim.v7i2.744.
Full textAbstract:
Forest and land fires are critical emergencies requiring rapid response to minimize casualties and property damage. In urban areas like Praya City, fire department response delays are often caused by inefficient routing, especially with traffic congestion and complex road infrastructure. This study aims to analyze and compare the performance of Dijkstra's and Bellman-Ford's algorithms for optimizing firefighter routes in Praya City. This quantitative research utilized a computational and comparative analysis approach. Road network data from Praya City was obtained from Google Maps and modeled as a static graph consisting of 17 nodes and weighted edges repre-senting actual distances. Dijkstra's and Bellman-Ford's algorithms were implemented in Python to find the shortest routes from a designated starting point (Fire Department office) to all other nodes. Performance was evaluated based on route optimality, completeness, and computation time. Both Dijkstra's and Bellman-Ford's algorithms successfully identified identical optimal shortest routes for all tested origin-destination pairs within the Praya City graph. However, Dijkstra's algorithm demonstrated significantly superior computational efficiency, with an average computation time of 0.5 seconds, compared to Bellman-Ford's 1.5 seconds. For optimizing firefighter routes on the static road network graph of Praya City, Dijkstra's algorithm is recommended due to its combi-nation of optimality and superior speed. This finding provides an empirical basis for developing more efficient emergency response navigation systems. Future research should focus on inte-grating dynamic parameters like real-time traffic data.
18
Thomas, Sanu, and Thomaskutty Mathew. "Congestion bottleneck avoid routing in wireless sensor networks." International Journal of Electrical and Computer Engineering (IJECE) 9, no. 6 (2019): 4804. http://dx.doi.org/10.11591/ijece.v9i6.pp4804-4814.
Full textAbstract:
A new efficient method for detecting congested bottleneck nodes and avoiding them in the route formation in a wireless sensor network is described. Sensor nodes with a higher degree of congestion are excluded while determining the best routing path from a given source to destination in a multi-hop transmission. In a scenario where different communication paths have different maximum congestion levels, selecting that path which has least maximum congestion, is a challenging task. A modified Bellman-Ford algorithm is proposed to solve this problem efficiently. The proposed technique is very much useful for the optimal route selection for vehicles in metropolitan cities that avoids high traffic density junctions. Once the desired destination is specified, the traffic control system can use this algorithm to provide the least congested routes to the intra-city vehicles.
19
Sanu, Thomas, and Mathew Thomaskutty. "Congestion bottleneck avoid routing in wireless sensor networks." International Journal of Electrical and Computer Engineering (IJECE) 9, no. 6 (2019): 4804–14. https://doi.org/10.11591/ijece.v9i6.pp4804-4814.
Full textAbstract:
A new efficient method for detecting congested bottleneck nodes and avoiding them in the route formation in a wireless sensor network is described. Sensor nodes with a higher degree of congestion are excluded while determining the best routing path from a given source to destination in a multi-hop transmission. In a scenario where different communication paths have different maximum congestion levels, selecting that path which has least maximum congestion, is a challenging task. A modified Bellman-Ford algorithm is proposed to solve this problem efficiently. The proposed technique is very much useful for the optimal route selection for vehicles in metropolitan cities that avoids high traffic density junctions. Once the desired destination is specified, the traffic control system can use this algorithm to provide the least congested routes to the intra-city vehicles.
20
Shukr, Sabreen Mahmood, Nuha Abdul Sahib Alwan, and Ibraheem Kassim Ibraheem. "A Comparative Study of Single-Constraint Routing in Wireless Mesh Networks Using Different Dynamic Programming Algorithms." Journal of Engineering 20, no. 2 (2023): 49–60. http://dx.doi.org/10.31026/j.eng.2014.02.04.
Full textAbstract:
Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorithms are proposed in this work with a discussion on the difference between them. These algorithms find the shortest route through finding the optimal rate between two nodes in the wireless networks but with bounded end-to-end delay. The Dijkstra-based algorithm is especially favorable in terms of processing time. We also present a comparison between our proposed single-constraint Dijkstra-based routing algorithm and the mesh routing algorithm (MRA) existing in the literature to clarify the merits of the former.
21
Rakesh, Kumar Saini, Ritika, and Vijay Sandip. "Data Flow in Wireless Sensor Network Protocol Stack by using Bellman-Ford Routing Algorithm." Bulletin of Electrical Engineering and Informatics 6, no. 1 (2017): 81–87. https://doi.org/10.11591/eei.v6i1.577.
Full textAbstract:
Wireless sensor network consists various sensor nodes that are used to monitor any target area like forest fire detection by our army person and monitoring any industrial activity by industry manager. Wireless sensor networks have been deployed in several cities to monitor the concentration of dangerous gases for citizens. In wireless sensor network when sensor nodes communicate from each other then routing protocol are used for communication between protocol layers. Wireless sensor network protocol stack consist five layers such as Application layer, Transport layer, Network layer, MAC Layer, Physical layer. In this paper we study and analysis Bellman-Ford routing algorithm and check the flow of data between these protocol layers. For simulation purpose we are using Qualnet 5.0.2 simulator tool.
22
Kumar Saini, Rakesh, Ritika Ritika, and Sandip Vijay. "Data Flow in Wireless Sensor Network Protocol Stack by using Bellman-Ford Routing Algorithm." Bulletin of Electrical Engineering and Informatics 6, no. 1 (2017): 81–87. http://dx.doi.org/10.11591/eei.v6i1.577.
Full textAbstract:
Wireless sensor network consists various sensor nodes that are used to monitor any target area like forest fire detection by our army person and monitoring any industrial activity by industry manager. Wireless sensor networks have been deployed in several cities to monitor the concentration of dangerous gases for citizens. In wireless sensor network when sensor nodes communicate from each other then routing protocol are used for communication between protocol layers. Wireless sensor network protocol stack consist five layers such as Application layer, Transport layer, Network layer, MAC Layer, Physical layer. In this paper we study and analysis Bellman-Ford routing algorithm and check the flow of data between these protocol layers. For simulation purpose we are using Qualnet 5.0.2 simulator tool.
23
Singh, Niharika, Irraivan Elamvazuthi, Perumal Nallagownden, Gobbi Ramasamy, and Ajay Jangra. "Routing Based Multi-Agent System for Network Reliability in the Smart Microgrid." Sensors 20, no. 10 (2020): 2992. http://dx.doi.org/10.3390/s20102992.
Full textAbstract:
Microgrids help to achieve power balance and energy allocation optimality for the defined load networks. One of the major challenges associated with microgrids is the design and implementation of a suitable communication-control architecture that can coordinate actions with system operating conditions. In this paper, the focus is to enhance the intelligence of microgrid networks using a multi-agent system while validation is carried out using network performance metrics i.e., delay, throughput, jitter, and queuing. Network performance is analyzed for the small, medium and large scale microgrid using Institute of Electrical and Electronics Engineers (IEEE) test systems. In this paper, multi-agent-based Bellman routing (MABR) is proposed where the Bellman–Ford algorithm serves the system operating conditions to command the actions of multiple agents installed over the overlay microgrid network. The proposed agent-based routing focuses on calculating the shortest path to a given destination to improve network quality and communication reliability. The algorithm is defined for the distributed nature of the microgrid for an ideal communication network and for two cases of fault injected to the network. From this model, up to 35%–43.3% improvement was achieved in the network delay performance based on the Constant Bit Rate (CBR) traffic model for microgrids.
24
Häkkinen, Jari, Martin Lagerholm, Carsten Peterson, and Bo Söderberg. "A Potts Neuron Approach to Communication Routing." Neural Computation 10, no. 6 (1998): 1587–99. http://dx.doi.org/10.1162/089976698300017322.
Full textAbstract:
A feedback neural network approach to communication routing problems is developed, with emphasis on multiple shortest path problems, with several requests for transmissions between distinct start and end nodes. The basic ingredients are a set of Potts neurons for each request, with interactions designed to minimize path lengths and prevent overloading of network arcs. The topological nature of the problem is conveniently handled using a propagator matrix approach. Although the constraints are global, the algorithmic steps are based entirely on local information, facilitating distributed implementations. In the polynomially solvable single-request case, the approach reduces to a fuzzy version of the Bellman-Ford algorithm. The method is evaluated for synthetic problems of varying sizes and load levels, by comparing to exact solutions from a branch-and-bound method, or to approximate solutions from a simple heuristic. With very few exceptions, the Potts approach gives high-quality legal solutions. The computational demand scales merely as the product of the numbers of requests, nodes, and arcs.
25
K.Thamizhmaran. "Modified Reactive Routing Protocol with Shortest path Algorithm for MANETs." Journal of Advancement in Electronics Design 8, no. 1 (2025): 36–46. https://doi.org/10.5281/zenodo.15152829.
Full textAbstract:
<em>Mobile Ad-hoc Networks (MANET) are one of the most popular study topics in recent years due to the world's natural problems. Every day, MANET encounters numerous significant issues in society; in this regard, link failure, packet loss, energy consumption, and retransmission are the most prevalent concerns. My goal in this article is to reduce packet loss while using the least amount of energy possible as a first step in my research. Using two distinct shortest route algorithms (SPA), Bellman Ford and Dijkstra's algorithms, this technical research study examined the On-demand Routing Protocol (AODV) technique with multiple topologies and three sets of nodes. This work's major objective is to use five steps to increase remaining energy and decrease packet dropping. All active nodes are flooded with route requests (i), all node IDs from our network group are tested (ii), the minimal weighted route is found (iv), the utilization energy of finding the route is calculated (v), and communication begins from source to destination. Use Network Simulator 2, one of the most widely used and user-friendly programs, to analyze a variety of characteristics, including packet delivery ratio, routing overhead, end-to-end delay, and throughput (NS2). Ultimately, it's evident that SPA employs protocols that are superior to conventional routing protocols in every way.</em>
26
Faouzi, Hassan, Hicham Mouncif, and Mohamed Lamsaadi. "AODV Energy Routing Mechanism for Multi-Channel Multi-Interface Ad Hoc Networks (EMCMI-AODV) Using a Dynamic Programming Algorithm." International Journal of Mobile Computing and Multimedia Communications 7, no. 4 (2016): 1–16. http://dx.doi.org/10.4018/ijmcmc.2016100101.
Full textAbstract:
Energy consumption is a significant issue and offers a rich scope for research in ad hoc networks. However, many energy efficiency routing protocols are configured to use only a single Interface single Channel (SISC). As a result, these networks rarely can fully exploit all bandwidth available in the radio spectrum provisioned by the standards. This paper proposes two extensions to the shortest-path routing algorithm that finds routes to balance load based on residual energy of nodes and hops of route, one uses Floyd Warshall and the other uses Bellman-Ford algorithm. The protocols work with nodes equipped with a multiple network interface to overcome the problems of SISC where each node is equipped with a single antenna to ensure connectivity with all other nodes. The proposed protocols primarily exploit the idea of interaction among MAC and Network layers by using a novel cross-layer routing solution. The performance of the proposed protocols were evaluated using different scenarios and performance metrics, and achieved good results compared with similar works in the field.
27
Gershteyn, Arkady, and Andrej Terekhov. "Bypassing dangerous sections of the route as a way to improve traffic safety (using St. Petersburg as an example)." Computer tools in education, no. 1 (March 28, 2023): 30–39. http://dx.doi.org/10.32603/2071-2340-2023-1-30-39.
Full textAbstract:
A simple routing algorithm to improve vehicle safety on a road network has been proposed. If the road network is represented by a graph with edges and nodes, it is enough to mark most populated with Traffic Accidents (TA) edges by adding to a attribute of the edge some penalty and the routing algorithm (Dijkstra or Bellman-Ford) will try to avoid this edge automatically. To estimate safety gain, a Relative Risk Ratio RRR= (TAs along route which avoids TA hotspots/TAs along original route) was used. Computer simulation was performed for St. Petersburg, Russian Federation. It is shown that for the same start and end points of the route, an average RRR gets smaller by 14.5–36 % depending on original route length. It is also shown that the cost for improving vehicle safety is an increase in the route length (by 8–10 %) and an increase in the number of nodes in the route by 3–12 % is required.
28
A. M., Gershteyn, and Terekhov A. N. "A Simple Way to Improve Road Safety by Avoiding Dangerous Sections of the Route." Programmnaya Ingeneria 14, no. 3 (2023): 103–9. http://dx.doi.org/10.17587/prin.14.103-109.
Full textAbstract:
A simple routing algorithm to improve vehicle safety on a road network has been proposed. If the road network is represented by a graph with edges and nodes, it is sufficient to mark edges with highest incidence (top 800) of severe Traffic Accidents (TA) by adding to the attribute of the edge some penalty and the routing algorithm (Dijkstra or Bellman-Ford) will try to avoid these edges automatically. To estimate safety gain, a Relative Risk Ratio RRR = (TAs along route which avoids TA hotspots/TAs along original route) introduced in [1] was used. Computer simulation was performed for Moscow, Russian Federation. It is shown that for the same start and end points of the route, an average RRR gets smaller by 9...31 % depending on original route length. It is also shown that the cost for improving vehicle safety is an increase in the route length (by 6...11 %) and an increase in the number of nodes in the route (by 6...28 %).
29
Sajid, Maimoona Bint E., Sameeh Ullah, Nadeem Javaid, Ibrar Ullah, Ali Mustafa Qamar, and Fawad Zaman. "Exploiting Machine Learning to Detect Malicious Nodes in Intelligent Sensor-Based Systems Using Blockchain." Wireless Communications and Mobile Computing 2022 (January 18, 2022): 1–16. http://dx.doi.org/10.1155/2022/7386049.
Full textAbstract:
In this paper, a blockchain-based secure routing model is proposed for the Internet of Sensor Things (IoST). The blockchain is used to register the nodes and store the data packets’ transactions. Moreover, the Proof of Authority (PoA) consensus mechanism is used in the model to avoid the extra overhead incurred due to the use of Proof of Work (PoW) consensus mechanism. Furthermore, during routing of data packets, malicious nodes can exist in the IoST network, which eavesdrop the communication. Therefore, the Genetic Algorithm-based Support Vector Machine (GA-SVM) and Genetic Algorithm-based Decision Tree (GA-DT) models are proposed for malicious node detection. After the malicious node detection, the Dijkstra algorithm is used to find the optimal routing path in the network. The simulation results show the effectiveness of the proposed model. PoA is compared with PoW in terms of the transaction cost in which PoA has consumed 30% less cost than PoW. Furthermore, without Man In The Middle (MITM) attack, GA-SVM consumes 10% less energy than with MITM attack. Moreover, without any attack, GA-SVM consumes 30% less than grayhole attack and 60% less energy than mistreatment. The results of Decision Tree (DT), Support Vector Machine (SVM), GA-DT, and GA-SVM are compared in terms of accuracy and precision. The accuracy of DT, SVM, GA-DT, and GA-SVM is 88%, 93%, 96%, and 98%, respectively. The precision of DT, SVM, GA-DT, and GA-SVM is 100%, 92%, 94%, and 96%, respectively. In addition, the Dijkstra algorithm is compared with Bellman Ford algorithm. The shortest distances calculated by Dijkstra and Bellman are 8 and 11 hops long, respectively. Also, security analysis is performed to check the smart contract’s effectiveness against attacks. Moreover, we induced three attacks: grayhole attack, mistreatment attack, and MITM attack to check the resilience of our proposed system model.
30
Khatri, Kajol, and Anand Sharma. "Energy Harvesting based Mobile Cloud Network in Latency and QoS Improvement using 5G Systems by Energy Routing Optimization." International Journal on Future Revolution in Computer Science & Communication Engineering 8, no. 2 (2022): 26–39. http://dx.doi.org/10.17762/ijfrcsce.v8i2.2099.
Full textAbstract:
D2D communication technology enables the User Equipment (UE) in 5G networks to instantly connect with other UEs, with or without partial infrastructure involvement. In a Cloud Assisted energy harvesting system, it has improved user numbers and data transmission between mobile nodes. This research propose energy harvesting for mobile cloud computing in enhancing the QoS and latency of the network. The main aim of this research is to enhance energy optimization using discrete energy efficient offloading algorithm. The routing has been optimized using fuzzy logic cognitive Bellman-Ford routing algorithm. To identify the failing node and find an alternative node to deliver the seamless services, an unique weight-based approach has been presented. The method relies on two working node parameters: execution time and failure rate. Threshold values are specified for the parameters of the chosen master node. By contrasting the values with the threshold values, the alternative node is chosen. The experimental results shows comparative analysis in terms of throughput of 96%, QoS of 96%, latency of 28%, energy consumption of 51%, end-end delay of 41%, average power consumption of 41% and PDR of 85%
31
Hadi, Harem Mahdi, and Ibrahim Mahmood Ibrahim. "A Comprehensive Review of Shortest Path Algorithms for Network Routing." Asian Journal of Research in Computer Science 18, no. 3 (2025): 152–75. https://doi.org/10.9734/ajrcos/2025/v18i3584.
Full textAbstract:
The rapid development of digital technology and the increasing interconnection of devices have made computer networks indispensable to modern life. Global data movement, communication, and applications like cloud computing, IoT, e-commerce, and smart cities are all made possible by these networks. Routing algorithms particularly shortest path algorithms are crucial for determining the most effective data transmission routes and are largely responsible for the dependability and efficiency of these networks. Because these algorithms maintain stability and reliability while lowering latency, costs, and energy consumption, they are crucial to network operation. Shortest path problem solving has long relied on fundamental algorithms with origins in graph theory, such as Bellman-Ford and Dijkstra's. Despite their successes, the growing complexity and dynamic nature of contemporary networks have exposed their shortcomings. Advanced approaches, including heuristic, hybrid, and AI-driven methods, have been developed to get around these challenges. Innovations like ant colony optimization and blockchain-based algorithms have improved computing efficiency, security, and adaptability. The Internet of Things, VANETs, and SDNs are just a few of the domains that use these algorithms; each has specific requirements, like real-time adaptation and energy efficiency. Reinforcement learning and prediction models driven by machine learning have further increased routing efficiency, while simulation tools such as Mininet and OMNeT++ have been essential for evaluating algorithm performance in practical scenarios. As emerging technologies like blockchain and quantum computing become more widely accepted, shortest path algorithms will continue to advance, ensuring their suitability in the rapidly evolving digital environment. This study, which looks at their development, applications, and possible future directions, emphasizes their importance in creating modern networks.
32
Wu, Huarui, Xiao Han, Huaji Zhu, Cheng Chen, and Baozhu Yang. "An Efficient Opportunistic Routing Protocol with Low Latency for Farm Wireless Sensor Networks." Electronics 11, no. 13 (2022): 1936. http://dx.doi.org/10.3390/electronics11131936.
Full textAbstract:
Wireless sensor networks (WSN) can accurately and timely obtain the production information of crops, and provide data basis for intelligent agriculture. The dynamic crop state and unstable climate environment make it difficult to predict the connectivity probability of wireless links. Therefore, this paper studies an energy-saving opportunity routing transmission strategy under the influence of dynamic link interaction. The protocol establishes an importance model based on algebraic connectivity to reduce the energy consumption of network key nodes. At the same time, based on the improved Bellman–Ford algorithm, a method of constructing candidate sets is studied. It converts the opportunistic routing transmission cost of farm WSN into anycast link cost and the remaining opportunistic path cost affected by energy consumption. The priority queue is used to determine the nodes participating in the iteration, thereby reducing the computational overhead. The protocol also designs a backoff strategy considering the current residual energy to select the only forwarding node and reduce the unnecessary packet copies in the transmission process. Simulation results show that the studied method is superior to the existing opportunistic routing schemes in terms of packet overhead, network lifetime, energy consumption, and packet delivery rate.
33
K.Thamizhmaran. "Efficient Non-Base-Station based Wireless Communication in MANET using Shortest Path Algorithm." Journal of Sensor Research and Technologies 7, no. 1 (2025): 7–10. https://doi.org/10.5281/zenodo.14627350.
Full textAbstract:
<em>Shortest path routing has the potential to improve network performance, but its effectiveness is partly dependent on the routing protocol's functioning and the settings chosen. Establishing an accurate and effective route between two nodes is the main objective of such an ad-hoc network routing protocol in order to deliver messages on time. The least amount of money, overhead, and bandwidth should be used when building a route. The idea of shortest path routing over ad hoc networks was investigated by a few researchers. Everybody utilizes different topologies and their own parameters.</em>
34
Mahapatro, Susrita, Prabhat Kumar sahu, and Pradeep Kumar Dash. "A hybrid active queue management technique for QoS based unicasting protocols in MANETs." International Journal of Engineering & Technology 7, no. 2.6 (2018): 58. http://dx.doi.org/10.14419/ijet.v7i2.6.10068.
Full textAbstract:
Mobile Ad hoc Networks (MANETs) is the interconnection of several self-energy dependent mobile nodes. It is one of the self-configured and infrastructure less network. In MANET the issues are security, Quality Of Services, Congestion etc. The major issue of MANET is to control the congestion. Congestion means the network capacity is larger than the no of packets transmitted across the network. In this paper, an effort has been made to evaluate and analyze the performance of the network by means of comparing two on-demand reactive routing protocols such as AODV [Ad-hoc On-demand Distance Vector] and DSR [Dynamic Source Routing] with each other along with also by comparing with DSDV [Destination Sequenced Distance Vector], which is a proactive routing protocol. The comparison is also being made under the light of two queue management techniques such as RED (Random Early Detection) and Droptail. A gateway discovery algorithm is being used by both AODV and DSR routing protocols, which uses the mechanism of connecting mobile nodes through gateway, however Bellman-Ford algorithm is being used by DSDV which uses the concept of including freedom from loops in the routing table. By means of simulation through NS-2 network simulator by varying the number of nodes, we observe that the performance differentials of AODV, DSR, and DSDV routing protocols are directed to foremost performance differentials to guarantee QoS for both of these protocols in RED and Droptail queue management techniques. There is a lot of queue management approach to minimize the congestion rate and transfer the data successfully to the destination. Two queue management techniques popularly used to manage queues in MANets are Active queue management and Passive queue management. Active queue management is widely used and RED is the most popular approach which gives low average delay, high throughput and lower packet drop rate. But RED algorithms have some drawback. So here we are using a hybrid approach, named as MRED by means of combining the features of both RED and ECN to overcome the drawbacks of RED.
35
Gershtein, Arkadiy, and Andrey Terekhov. "Routing Algorithm for Vehicles that Avoids Severe Traffic Accident Hotspots on the Road Network (Using the City of Springfield, Massachusetts as a Case Study)." Computer tools in education, no. 2 (August 29, 2022): 5–18. http://dx.doi.org/10.32603/2071-2340-2021-2-5-18.
Full textAbstract:
In [1] statistically significant clusters (hotspots) of severe Traffic Accidents (TA) are found. In this article, as a continuation of [1], a simple routing algorithm to avoid TA hotspots on a road network has been proposed («hotspot avoidance» path). If the road network is represented by a graph with edges and nodes, it is enough to mark every edge which lead to the TA hotspot as «not passable» by letting a attribute of the edge be a very large digit, much greater than max edge length for a given road graph — and the routing algorithm (Dijkstra or Bellman-Ford) will avoid the TA hotspot automatically. Computer simulation was performed for Springfield, MA. It is shown that for the same initial and end points of the route, an average ratio (Route avoiding TA length/Original route length) is bigger for shorter original (without taking into account TA hotspots) routes and gradually slows down to 1.04 for max original route length inside Springfield. Route length ratios show extra route length needed to avoid TA hotspots, but say nothing about new route safety. To estimate safety gain, a new Relative Risk Ratio RRR= (TAs along route which avoids TA hotspots/TAs along original route) was introduced. It is shown for Springfield that relatively short (less than 4 km) original routes are more dangerous (have more TAs along the «hotspot avoidance» route) than original ones, but for relatively long (> 4 km) original routes average RRR gets smaller by 16 % while modified path gets longer by 8 % in average.
36
Perger, Theresia, and Hans Auer. "Energy efficient route planning for electric vehicles with special consideration of the topography and battery lifetime." Energy Efficiency 13, no. 8 (2020): 1705–26. http://dx.doi.org/10.1007/s12053-020-09900-5.
Full textAbstract:
Abstract In contrast to conventional routing systems, which determine the shortest distance or the fastest path to a destination, this work designs a route planning specifically for electric vehicles by finding an energy-optimal solution while simultaneously considering stress on the battery. After finding a physical model of the energy consumption of the electric vehicle including heating, air conditioning, and other additional loads, the street network is modeled as a network with nodes and weighted edges in order to apply a shortest path algorithm that finds the route with the smallest edge costs. A variation of the Bellman-Ford algorithm, the Yen algorithm, is modified such that battery constraints can be included. Thus, the modified Yen algorithm helps solving a multi-objective optimization problem with three optimization variables representing the energy consumption with (vehicle reaching the destination with the highest state of charge possible), the journey time, and the cyclic lifetime of the battery (minimizing the number of charging/discharging cycles by minimizing the amount of energy consumed or regenerated). For the optimization problem, weights are assigned to each variable in order to put emphasis on one or the other. The route planning system is tested for a suburban area in Austria and for the city of San Francisco, CA. Topography has a strong influence on energy consumption and battery operation and therefore the choice of route. The algorithm finds different results considering different preferences, putting weights on the decision variable of the multi-objective optimization. Also, the tests are conducted for different outside temperatures and weather conditions, as well as for different vehicle types.
37
Rayhan Al Hayubi, Kalika Khaldan Nurshofa, Akmal Aziz, M. Taufiq Hidayatullah Syari, and Didik Aribowo. "Analisis Protocol Routing Eigrp Pada Topologi Ring Menggunakan Simulator Cisco Packet Tracer." Merkurius : Jurnal Riset Sistem Informasi dan Teknik Informatika 2, no. 3 (2024): 11–18. http://dx.doi.org/10.61132/merkurius.v2i3.94.
Full textAbstract:
This journal reviews the use of Cisco simulators in building and analyzing ring topology networks and the routing protocols used in them. Ring topology is one of the commonly used network topologies where all nodes are directly connected to form a circle. The routing protocol in ring topology uses Bellman Ford and Dijkstra algorithms to determine the best path. The main focus of this research is on Enhanced Interior Gateway Routing Protocol (EIGRP), a routing protocol developed from Interior Gateway Routing Protocol (IGRP). EIGRP enables fast convergence and efficiency in data transmission in the network. The research methods used are literature and simulation methods using Cisco Packet Tracer software.
38
Sehgal, Rajan. "Applications of Graph Theory in Network Optimization: Theory and Practice." Modern Dynamics: Mathematical Progressions 1, no. 3 (2024): 6–9. https://doi.org/10.36676/mdmp.v1.i3.35.
Full textAbstract:
Graph theory has become a fundamental tool in the field of network optimization, providing a robust framework for analyzing and improving network systems. the diverse applications of graph theory in optimizing various types of networks, including communication, transportation, and social networks. We begin by outlining the theoretical foundations of graph theory, focusing on key concepts such as graph connectivity, shortest paths, and network flows. practical applications, highlighting how graph-theoretic algorithms and models are employed to solve real-world optimization problems. For instance, we examine how Dijkstra’s and Bellman-Ford algorithms are used for efficient routing in communication networks, and how the Maximum Flow Problem and its solutions impact the design of transportation infrastructure. Additionally, we explore applications in social network analysis, where graph theory helps in understanding and enhancing connectivity and influence among individuals.
39
K., Thamizhmaran. "Reduced Delay for Mobile Ad Hoc Networks using Shortest Path Network." Journal of Sensor Research and Technologies 6, no. 1 (2024): 1–5. https://doi.org/10.5281/zenodo.10633619.
Full textAbstract:
<em>The accessibility of a way relies upon the quantity of connections and the unwavering quality of each connection framing the way. Many steering measurements as far as number of connections have been proposed, for example, the briefest way directing. Most brief way steering chooses a way having least expense to advance the information to the objective hub. Most limited way steering calculation determination relies upon direct traffic structure source to objective, boosting the organization execution and limiting the expense. Execution of the organization can be improved through briefest way steering however it additionally relies on the usefulness of the directing convention and the boundaries that are chosen for the most limited way steering. The essential objective of such an impromptu organization directing convention is right and productive course foundation between a couple of hubs so that messages might be conveyed as quickly as possible. Course development ought to be finished with at least expense, above and transfer speed utilization. Some of scientists investigated the idea of briefest way directing over specially appointed network. Every one purposes his own boundaries with various geography. Nobody utilizes all boundaries. We will talk about the ideas for solutions that they have suggested in this paper.</em> <strong><em> </em></strong>
40
Awais, Muhammad, Nadeem Javaid, Amjad Rehman, Umar Qasim, Musaed Alhussein, and Khursheed Aurangzeb. "Towards Void Hole Alleviation by Exploiting the Energy Efficient Path and by Providing the Interference-Free Proactive Routing Protocols in IoT Enabled Underwater WSNs." Sensors 19, no. 6 (2019): 1313. http://dx.doi.org/10.3390/s19061313.
Full textAbstract:
Nowadays, the Internet of Things enabled Underwater Wireless Sensor Network (IoT-UWSN) is suffering from serious performance restrictions, i.e., high End to End (E2E) delay, low energy efficiency, low data reliability, etc. The necessity of efficient, reliable, collision and interference-free communication has become a challenging task for the researchers. However, the minimum Energy Consumption (EC) and low E2E delay increase the performance of the IoT-UWSN. Therefore, in the current work, two proactive routing protocols are presented, namely: Bellman–Ford Shortest Path-based Routing (BF-SPR-Three) and Energy-efficient Path-based Void hole and Interference-free Routing (EP-VIR-Three). Then we formalized the aforementioned problems to accomplish the reliable data transmission in Underwater Wireless Sensor Network (UWSN). The main objectives of this paper include minimum EC, interference-free transmission, void hole avoidance and high Packet Delivery Ratio (PDR). Furthermore, the algorithms for the proposed routing protocols are presented. Feasible regions using linear programming are also computed for optimal EC and to enhance the network lifespan. Comparative analysis is also performed with state-of-the-art proactive routing protocols. In the end, extensive simulations have been performed to authenticate the performance of the proposed routing protocols. Results and discussion disclose that the proposed routing protocols outperformed the counterparts significantly.
41
V., M. Pakhomova, and S. Mandybura Y. "OPTIMAL ROUTE DEFINITION IN THE RAILWAY INFORMATION NETWORK USING NEURAL-FUZZY MODELS." Science and Transport Progress. Bulletin of Dnipropetrovsk National University of Railway Transport, no. 5(83) (November 20, 2019): 81–98. https://doi.org/10.15802/stp2019/184385.
Full textAbstract:
<strong>Purpose. </strong>Modern algorithms for choosing the shortest route, for example, the Bellman-Ford and Dijkstra algorithms, which are currently widely used in existing routing protocols (RIP, OSPF), do not always lead to an effective result. Therefore, there is a need to study the possibility of organizing routing in in the railway network of information and telecommunication system (ITS) using the methods of artificial intelligence. <strong>Methodology.</strong> On the basis of the simulation model created in the OPNET modeling system a fragment of the ITS railway network was considered and the following samples were formed: training, testing, and control one. For modeling a neural-fuzzy network (hybrid system) in the the MatLAB system the following parameters are input: packet length (three term sets), traffic intensity (five term sets), and the number of intermediate routers that make up the route (four term sets). As the resulting characteristic, the time spent by the packet in the routers along its route in the ITS network (four term sets) was taken. On the basis of a certain time of packet residence in the routers and queue delays on the routers making up different paths (with the same number of the routers) the optimal route was determined. <strong>Findings. </strong>For the railway ITS fragment under consideration, a forecast was made of the packet residence time in the routers along its route based on the neural-fuzzy network created in the MatLAB system. The authors conducted the study of the average error of the neural-fuzzy network`s training with various membership functions and according to the different methods of training optimization. It was found that the smallest value of the average learning error is provided by the neuro-fuzzy network configuration 3–12–60–60–1 when using the symmetric Gaussian membership function according to the hybrid optimization method. <strong>Originality</strong>. According to the RIP and OSPF scenarios, the following characteristics were obtained on the simulation model created in the OPNET simulation system: average server load, average packet processing time by the router, average waiting time for packets in the queue, average number of lost packets, and network convergence time. It was determined that the best results are achieved by the simulation network model according to the OSPF scenario. The proposed integrated routing system in the ITS network of railway transport, which is based on the neural-fuzzy networks created, determines the optimal route in the network faster than the existing OSPF routing protocol. <strong>Practical value. </strong>An integrated routing system in the ITS system of railway transport will make it possible to determine the optimal route in the network with the same number of the routers that make up the packet path in real time.
42
"Differentiation between Bellman-Ford and Dijsktra Algorithm in Routing Protocols." International Journal of Innovative Technology and Exploring Engineering 9, no. 4 (2020): 3248–50. http://dx.doi.org/10.35940/ijitee.d1882.029420.
Full textAbstract:
The modus operandi of congregating data pre-owned by home area network (HAN) protocols in order to deliver data across confined or extensive distance connection and that which is transmittal over a digital network in the form of packets is called as packet switching. Packet switching necessitates packaging of data in meagre units (packets) that are routed through a network, based on destination address contained within each packet and with the usage of network switches and routers. In packet switching networks, routing is the Avant-graded and multifaceted resolution maker, that controls the direction of network packets from their source in the vicinity of their destination through intermediate network nodes by precise packet advancing techniques. Here, in this disquisition we made an interpretation apropos the dyad pre-eminent shortest path (closest distance) searching algorithms, which are used in routing. They’re the BELLMAN-FORD and DIJKSTRA’S algorithm. The anatomization of the differentiation between the two is given concisely.
43
Sahu, Smita Rani, and Biswajit Tripathy. "Robust Routing Optimization in VANET Communication Based on Bellman–Ford Multitier Metaheuristic Algorithms." International Journal of Communication Systems, November 17, 2024. http://dx.doi.org/10.1002/dac.6056.
Full textAbstract:
ABSTRACTIn modern cities, vehicle ad hoc networks (VANETs) hold great promise for improving safety on the roads, traffic control, and communicating. The constantly changing and intricate nature of VANETs hampers adequate routing due to a variety of factors. The work examines the use of a multitiered metaheuristic algorithm that combines Bellman–Ford routing with the Fire Hawk, Gannet Optimization, and Mayfly Optimization algorithms to find optimal routing solutions for VANETs. The suggested work addresses network topological dynamics, actual time limitations, flexibility, connectivity problems, and security issues, in addition to the different quality of service (QoS) requirements in VANETs. Bellman–Ford serves as the foundational routing layer and maintains communication, whereas Fire Hawk, Gannet Optimization, and Mayfly Optimization improve and optimize routing patterns at subsequent levels. The multitier approach aims to strike a balance between the rational and probabilistic aspects of routing so as to satisfy the minimal latency needs of applications that are safety‐critical and respond quickly to the rapid changes in VANETs. The suggested work is evaluated with a traffic density ranging from 500 to 5000 with a step size of 500, and it has been observed that for the highest traffic density of 5000, the proposed work obtains a latency of 3.88 ms, data delivery rate of 0.944, a throughput of 2.94 Mbps, and energy efficiency of 97.14%. The proposed work remains robust compared to integrating state‐of‐the‐art metaheuristic algorithms such as ECRA, HOPRP, and CM. Overall, the proposed routing techniques increase routing efficiency in VANETs and make it possible to create vehicle communication networks that are more trustworthy and safe.
44
Крищенко, В. А. "Study of the Retention Timer in Dynamical Routing Based on the Bellman–Ford Algorithm." Engineering Journal: Science and Innovation, no. 1 (October 2012). http://dx.doi.org/10.18698/2308-6033-2012-1-20.
Full text
45
Tino Merlin, R., and R. Ravi. "Enhancing quality-driven iot operations for smart cities: A comprehensive approach for routing, security, and optimization." Journal of Intelligent & Fuzzy Systems, April 12, 2024, 1–10. http://dx.doi.org/10.3233/jifs-240308.
Full textAbstract:
This study introduces a tailored data acquisition and communication framework for IoT smart applications, focusing on enhancing efficiency and system performance. The proposed Quality-Driven IoT Routing (EQR-SC) for smart cities utilizes IoT-enabled wireless sensor networks. Additionally, a noteworthy contribution is the introduction of the Chaotic Firefly Optimization (CFOA) algorithm for IoT sensor cluster formation, potentially optimizing the organization and efficiency of IoT sensor networks in smart cities. Trust-based cluster Head Selection is enhanced by employing the Weighted Clustering Algorithm (WCA), which assigns weights to nodes based on trustworthiness and relevant metrics to select reliable cluster heads. The proposal of a lightweight data encryption technique enhances data security among IoT sensors, ensuring the privacy and integrity of transmitted information. To optimize pathfinding within the IoT platform, the research employs the Bellman-Ford algorithm, ensuring efficient data routing while accommodating negative edge weights when necessary. Finally, a thorough performance analysis, conducted through network simulation (NS2), provides insights into the effectiveness of the proposed OQR-SC technique, allowing for valuable comparisons with existing state-of-the-art methods.
46
Haq, Mujadad Ul, Majid Ashraf, Sana ul Haq, and Fazal Qudus Khan. "Managing Internet of Things based traffic using Software Defined Networking." Journal of Information Communication Technologies and Robotic Applications, March 8, 2021. http://dx.doi.org/10.51239/jictra.v0i0.236.
Full textAbstract:
The current internet architecture cannot manage the massive data volumes produced by the smart IoT-based healthcare systems. Very recently, the idea of Software-Defined Networking (SDN) has surfaced to resolve the issues related to networking. The incorporation of SDN technology in IoT-based healthcare systems can possibly solve the existing quality of service and data management issues. Furthermore, the IoT-based healthcare system can attain enhanced Quality of Service (QoS) through the employment of such schemes that use shortest-path routing algorithms and offer higher bandwidth to lesser delay paths as per the QoS requirements. In this study, the SDN technology is integrated with IoT-based healthcare systems, and the delay is reduced for delay-sensitive applications by using the Bellman-Ford algorithm. The proposed scheme is deployed using the POX controller and can effectively handle the existing QoS issues in the IoT healthcare systems. The simulation results of the proposed scheme show a clear drop in delay values in comparison to the benchmark scheme.
47
Mikhailov, Roman, and Dmitry Tsulun. "Application of Shortest Path Algorithms in Forming the Flight Route of an Unmanned Aerial Vehicle." Telecom IT, August 31, 2023, 26–38. http://dx.doi.org/10.31854/2307-1303-2023-11-1-26-38.
Full textAbstract:
Problem definition. Unmanned aerial vehicles are used in all fields of activity, in particular for monitoring (reconnaissance). However, modern methods of controlling them do not allow for automated formation of the flight route, taking into account the importance of monitoring objects from the position of effective application of the target load. To eliminate this disadvantage, it is proposed to use algorithms for finding shortest paths underlying routing protocols in telecommunication networks. The aim of the work is research on the routing of an unmanned aerial vehicle under enemy countermeasures (adverse conditions), as well as the development of an automated formation of the flight route. Methods used The elements of the scientific and methodological apparatus of graph theory, the theory of the effectiveness of purposeful processes and the theory of probability were used. Result: The directions of modification of Dijkstra and Bellman-Ford algorithms in the direction of their application in the routing of an unmanned aerial vehicle are shown. Practical significance: The results obtained will increase the efficiency of using the target load of an unmanned aerial vehicle when performing various classes of tasks
48
Silva, Tânia, David Verde, Sara Paiva, Luís Barreto, and Ana I. Pereira. "Accessibility strategies to promote inclusive mobility through multi-objective approach." SN Applied Sciences 5, no. 5 (2023). http://dx.doi.org/10.1007/s42452-023-05349-0.
Full textAbstract:
AbstractIn recent decades, urban mobility has assumed a need for adaptation due to the more significant congestion experienced in cities and the growing focus on sustainability. Several solutions are proposed to help citizens move around in an urban environment. Most are not yet aware of the universal and accessible aspect that these solutions must have. This paper proposes a route support system embedded in a mobile application, Viana+Acessível, using a multi-objective approach. The application aims to promote accessible mobility within the city, contributing to physical and psychological well-being for citizens with reduced mobility, temporary or permanently, such as people with spectrum autism disorder, the visually impaired, wheelchair users, pregnant, and the elderly. For the evaluation of the algorithms, four objective measures were considered: accessibility, slope, time, and length of the paths. The tests carried out with different routing algorithms showed that the A-Star presented the fastest results in terms of execution time compared to the Dijkstra, Floyd–Warshall, and Bellman–Ford. When analysing in a multi-objective approach, time, slope and accessibility were demonstrated to be conflicting objectives. Bi-objective and tri-objective were applied and Pareto front was explored. Graphical abstract