Comparative Analysis between Dijkstra and Bellman-Ford Algorithms in Shortest Path Optimization

AbuSalim, Samah W. G.; Ibrahim, Rosziati; Saringat, Mohd Zainuri; Jamel, Sapiee; Wahab, Jahari Abdul

doi:10.1088/1757-899x/917/1/012077

Cited by 42 publications

(12 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[9] Dijkstra algorithm is added because the dijkstra algorithm has the advantage of being able to minimize packet loss and increase throughput. In addition, the Dijkstra algorithm is more effective than other routing algorithms based on research [10] [11].…”

Section: Methodsmentioning

confidence: 99%

Analysis of User Mobility Performance on Software Defined Wireless Network Using Dijkstra Algorithm

Khoerotunisa

Hertiana

Negara

2021

J. Tek. Inform. (JUTIF)

View full text Add to dashboard Cite

Over the last decade, wireless devices have developed rapidly until predictions will develop with high complexity and dynamic. So that new capabilities are needed for wireless problems in this problem. Software Defined Network (SDN) is generally a wire-based network, but to meet the needs of users in terms of its implementation, it has begun to introduce a Wireless-based SDN called Software Defined Wireless Network (SDWN) which provides good service quality and reach and higher tools, so as to be able to provide new capabilities to wireless in a high complexity and very dynamic. When SDN is implemented in a wireless network it will require a routing solution that chooses paths due to network complexity. In this paper, SDWN is tested by being applied to mesh topologies of 4,6 and 8 access points (AP) because this topology is very often used in wireless-based networks. To improve network performance, Dijkstra's algorithm is added with the user mobility scheme used is RandomDirection. The Dijkstra algorithm was chosen because it is very effective compared to other algorithms. The performance measured in this study is Quality of Service (QoS), which is a parameter that indicates the quality of data packets in a network. The measurement results obtained show that the QoS value in this study meets the parameters considered by the ITU-T G1010 with a delay value of 1.3 ms for data services and packet loss below 0.1%. When compared with the ITU-T standard, the delay and packet loss fall into the very good category.

show abstract

Section: Methodsmentioning

confidence: 99%

Analysis of User Mobility Performance on Software Defined Wireless Network Using Dijkstra Algorithm

Khoerotunisa

Hertiana

Negara

2021

J. Tek. Inform. (JUTIF)

View full text Add to dashboard Cite

show abstract

“…Therefore, the number of relay nodes in the generated route is limited. In this paper, the Bellman-Ford algorithm is improved to limit the number of edges in the generated shortest path, that is, the number of relay nodes [31].…”

Section: Shortest Path Algorithm With Limited Hopsmentioning

confidence: 99%

Adaptive selection scheme for multi‐path parallel forwarding in dual‐mode heterogeneous field network of power distribution grid

Xiao

Huang

Liu

et al. 2022

IEEJ Transactions Elec Engng

View full text Add to dashboard Cite

In order to improve forwarding rate and connectivity rate between these nodes of the power distribution field network, an adaptive selection scheme for multi‐path parallel forwarding in dual‐mode heterogeneous field network is designed. First, the topological structure, the networking process and network maintenance mechanism of the field network with high speed power line broadband carrier and high speed micro‐power radio frequency communication capabilities are discussed. Second, a link measurement method is designed based on sliding window weighted average, and hybrid multi‐path routing table is calculated using a modified Bellman‐ford shortest path algorithm with limited hops. On this basis, a multi‐path parallel forwarding scheme is designed which has three modes of multi‐path load balancing forwarding, single‐path forwarding and multi‐path redundant forwarding. Finally, the field network is applied to the power distribution information collection system. The test results showed that the dual‐mode field network was more effective than the single‐mode field network in increasing the copying rate and shortening the copying time. © 2022 Institute of Electrical Engineers of Japan. Published by Wiley Periodicals LLC.

show abstract

“…Instead, it repeatedly loops over all edges and updating the distances to the start node. BFA considered as a Dynamic Algorithm and it can calculate the negative directed edges [21], can minimize the cost when network was built by not building lot of router paths as it can find the shortest path from one node to another. Besides that, when used in Routing Information Protocol (RIP) a slow response to changes in network topology resulting from slow updates passed from the RIP device to the next device.…”

Section: Artefactmentioning

confidence: 99%

Cadastral Survey Plans Management System: A Deliberative Report on Possibility of Utilizing Innovative Technologies on Managing Cadastral Survey Plans and Mapping in Sri Lanka

Mendis

Gunasekara

2021

CINEC Acad. J.

View full text Add to dashboard Cite

This report discusses the review of the Cadastral Survey Plans Management System in the context of the research project that is aimed at improving the management and security of the system. The research efforts of the project are aimed at facilitating the Cadastral Survey Plans Management System by justifying the possibility of utilizing innovative technologies on managing cadastral survey plans and mapping in Sri Lanka. In order to overcome and avoid complexity of problems and issues, various techniques and tools will be used. While the research section of the project is bounded with the human interaction of the society, building a mutual relationship with the employees of the Survey Department and the clients will be one of the primary focus of the proposed project and it will lead to understand the structural aspects of the department as well. Thus, the project was focussed on decision procedures, data security and information sharing. When considering the data security and information sharing in the software artefact, responsibilities will be divided according to the decision procedures of the organization or department. The goal of implementing Cadastral Survey Plans Management System is to induce the manpower and paperwork into minimum level and empower the security of the department.

show abstract

Comparative Analysis between Dijkstra and Bellman-Ford Algorithms in Shortest Path Optimization

Cited by 42 publications

References 14 publications

Analysis of User Mobility Performance on Software Defined Wireless Network Using Dijkstra Algorithm

Analysis of User Mobility Performance on Software Defined Wireless Network Using Dijkstra Algorithm

Adaptive selection scheme for multi‐path parallel forwarding in dual‐mode heterogeneous field network of power distribution grid

Cadastral Survey Plans Management System: A Deliberative Report on Possibility of Utilizing Innovative Technologies on Managing Cadastral Survey Plans and Mapping in Sri Lanka

Contact Info

Product

Resources

About