Journal articles: 'Bellman-Ford algorithm'

1

Dinitz, Yefim, and Rotem Itzhak. "Hybrid Bellman–Ford–Dijkstra algorithm." Journal of Discrete Algorithms 42 (January 2017): 35–44. http://dx.doi.org/10.1016/j.jda.2017.01.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Rai, Avinish. "A Study on Bellman Ford Algorithm for Shortest Path Detection in Global Positioning System." International Journal for Research in Applied Science and Engineering Technology 10, no. 5 (May 31, 2022): 2118–26. http://dx.doi.org/10.22214/ijraset.2022.42720.

Full text

Abstract:

Abstract: This is the Master of Technology project report of Mr. Avinish Rai (Roll No- MT/CS/45001/20), final year student in the department of Computer Science and Engineering, Birla Institute of Technology, under the supervision and guidance of Dr Ila Sahay Dayal. The thesis deals with Bellman ford algorithms is used to find the optimal shortest path between two or more than two nodes in the graph or in the tree. In this paper we add this bellman ford functionality in the G.P.S. this algorithm will work as the parameter in this and use from the initial node to target or source node. We will do the comparative and mathematical studies between both Dijkstra’s and Bellman ford algorithm which will give optimal results.

APA, Harvard, Vancouver, ISO, and other styles

3

Yaddarabullah, Yaddarabullah. "Modifikasi Algoritme Bellman-Ford Untuk Pencarian Rute Terpendek Berdasarkan Kondisi Jalan." Jurnal Teknologi dan Sistem Komputer 7, no. 3 (July 31, 2019): 109–15. http://dx.doi.org/10.14710/jtsiskom.7.3.2019.109-115.

Full text

Abstract:

The application of the Bellman-ford algorithm for finding the shortest path both weighted and unweighted graph has a weakness in determining the shortest path based on road conditions. This study modified the Bellman-Ford algorithm by adding the Technique for Order of Preference by Similarity to the Ideal Solution method to provide alternative road assessments based on its condition criteria including road density, road width, travel time, and distance. This modified Bellman-Ford has better performance in finding the alternative shortest path by choosing a road with smoother conditions, even though distance and travel time increase.

APA, Harvard, Vancouver, ISO, and other styles

4

Jadhav, Lekha, Rahul Dubey, and Manish Shrivastava. "Cache Friendly Bellman-Ford algorithm using OpenCL." International Journal of Computer Applications 139, no. 13 (April 15, 2016): 1–3. http://dx.doi.org/10.5120/ijca2016909305.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Pramudita, Rully, and Nadya Safitri. "Algoritma Bellman-Ford Untuk Menentukan Jalur Tercepat Dalam Sistem Informasi Geografis." PIKSEL : Penelitian Ilmu Komputer Sistem Embedded and Logic 6, no. 2 (September 18, 2018): 105–14. http://dx.doi.org/10.33558/piksel.v6i2.1502.

Full text

Abstract:

Abstract In a large city, there are many congestion problems, so the selection of the fastest route to reach the destination is needed. The city of Bandung is one of the big cities in Indonesia which has a fairly crowded traffic density and tends to be a lot of congestion in it. So we need a study that can discuss the path of independence. In the study to determine the shortest path there are several algorithm options to solve it. This research was conducted using the Bellman Ford algorithm to try to solve the problem of selecting the fastest path. The case that will be focused on in this study covers the route that starts from Ir. H. Juanda street and ends at the Leuwipanjang bus terminal. The road node that will be passed is taken from several main points that will be passed. Calculation of coordinates will be calculated using the concept of graph and haversine formula. The impact of this research is that it can be known the fastest path needed using the Bellman Ford algorithm. Keywords: Algoritm, Bellman Ford, Graph, Haversine Formula, Shortest Path. Abstrak Dalam sebuah kota besar saat ini banyak sekali permasalahan kemacetan, maka dibutuhkan pemilihan rute jalan yang tercepat untuk mencapai tujuan. Kota Bandung merupakan salah satu kota besar di Indonesia yang memiliki kepadatan lalu lintas cukup ramai dan cenderung banyak terjadi kemacetan didalamnya. Maka diperlukan sebuah penelitian yang dapat membahas mengenai jalur tependek. Dalam kajian untuk menentukan jalur terpendek terdapat beberapa pilihan algoritma untuk menyelesaikannya. Penelitian ini dilakukan menggunakan algoritma Bellman Ford untuk mencoba menyelesaikan masalah pemilihan jalur tercepat. Kasus yang akan difokuskan dalam penelitian ini mencangkup rute yang dimulai dari jalan Ir.H.Djuanda dan berakhir di terminal bis Leuwipanjang. Simpul jalan yang akan dilalui diambil dari beberapa titik utama yang akan dapat dilewati. Perhitungan koordinat akan dihitung menggunakan konsep graf dan haversine formula. Dampak dari penelitian ini yaitu dapat diketahuinya jalur tercepat yang dibutuhkan menggunakan algoritma Bellman Ford. Kata kunci: Algoritma, Bellman Ford, Graf, Haversine Formula, Shortest Path.

APA, Harvard, Vancouver, ISO, and other styles

6

Zhang, Dandan, and Panjing Tan. "Internet of Things and Intelligent Transportation System." Journal of Physics: Conference Series 2066, no. 1 (November 1, 2021): 012066. http://dx.doi.org/10.1088/1742-6596/2066/1/012066.

Full text

Abstract:

Abstract As the core of the new monitoring system, the Internet of Things realizes the integration of wireless sensor networks and traditional communication networks, and provides a platform for remote management and monitoring of the underlying equipment. The intelligent transportation system framework built on this basis combines intelligent transportation technology and the organic combination of vehicle management technologies is conducive to the safety, speed and reliability of vehicle transportation, and plays an important role in further reducing transportation costs. Based on this, this article launched the research on the Internet of Things and intelligent transportation systems. This article first summarizes the concepts of the Internet of Things, intelligent transportation and wireless sensor network technology and the current research status at home and abroad. By analyzing and comparing the performance and characteristics of various communication methods, embedded core microprocessors and embedded operating systems, this paper proposes an overall design scheme of the Internet of Things transportation system based on embedded technology. This paper analyzes the path planning problems in the application of the transportation system, combining the shortest path algorithm simulation results and the actual characteristics of the transportation network, and proposes a simulation data fitting method based on two network parameters and Bellman-Ford, Dijkstra, and Floyd algorithms. The route optimization scheme, and the above-mentioned design scheme was implemented in the transportation system, and the scheme verification was carried out. Finally, this article describes in detail the overall debugging process and operating results of the transportation system, thereby fully verifying the feasibility and correctness of the design and implementation methods of the intelligent transportation system based on the Internet of Things. The research results show that when the INF-PROPORTION is small, the Dijkstra algorithm is better than the Bellman-Ford algorithm. When INF-PROPORTION=0.3, the two algorithms T overlap. Since then, the advantages of the Bellman-Ford algorithm gradually appear, but it is approaching in INF-PROPORTION. At 1 o’clock, the Dijkstra algorithm has a sharp decrease, which is again smaller than the Bellman-Ford algorithm. The second loop condition in the main loop of Dijkstra’s algorithm cannot be satisfied, resulting in a decrease in T.

APA, Harvard, Vancouver, ISO, and other styles

7

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

APA, Harvard, Vancouver, ISO, and other styles

8

Lam, K. P., and C. W. Tong. "Optimisation circuits for the Bellman-Ford computation algorithm." Electronics Letters 30, no. 19 (September 15, 1994): 1584–86. http://dx.doi.org/10.1049/el:19941077.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Goldberg, Andrew V., and Tomasz Radzik. "A heuristic improvement of the Bellman-Ford algorithm." Applied Mathematics Letters 6, no. 3 (May 1993): 3–6. http://dx.doi.org/10.1016/0893-9659(93)90022-f.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

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 (October 26, 2019): 87. http://dx.doi.org/10.3991/ijoe.v15i14.11546.

Full text

Abstract:

<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>

APA, Harvard, Vancouver, ISO, and other styles

11

Devi, Boddu Rama, K. Kishan Rao, and M. Asha Rani. "Application of Modified Bellman-Ford Algorithm for Cooperative Communication." Wireless Personal Communications 109, no. 3 (August 19, 2019): 2025–49. http://dx.doi.org/10.1007/s11277-019-06666-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Dahshan, Mostafa H. "Maximum Independent Set Approximation Based on Bellman-Ford Algorithm." Arabian Journal for Science and Engineering 39, no. 10 (May 31, 2014): 7003–11. http://dx.doi.org/10.1007/s13369-014-1159-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Bhowmik, B., and S. Nag Chowdhury. "Prograph Based Analysis of Single Source Shortest Path Problem with Few Distinct Positive Lengths." Engineering, Technology & Applied Science Research 1, no. 4 (August 16, 2011): 90–97. http://dx.doi.org/10.48084/etasr.41.

Full text

Abstract:

In this paper we propose an experimental study model S3P2 of a fast fully dynamic programming algorithm design technique in finite directed graphs with few distinct nonnegative real edge weights. The Bellman-Ford’s approach for shortest path problems has come out in various implementations. In this paper the approach once again is re-investigated with adjacency matrix selection in associate least running time. The model tests proposed algorithm against arbitrarily but positive valued weighted digraphs introducing notion of Prograph that speeds up finding the shortest path over previous implementations. Our experiments have established abstract results with the intention that the proposed algorithm can consistently dominate other existing algorithms for Single Source Shortest Path Problems. A comparison study is also shown among Dijkstra’s algorithm, Bellman-Ford algorithm, and our algorithm.

APA, Harvard, Vancouver, ISO, and other styles

14

Supraptono, Eko, Arief Arfriandi, and Sulus Ilhamti Rizqian. "The Implementation Of Bellman-Ford Algorithm In Rembang Tourism Mobile Application As A Tourism Information Media." Data Science: Journal of Computing and Applied Informatics 3, no. 1 (January 29, 2019): 46–56. http://dx.doi.org/10.32734/jocai.v3.i1-679.

Full text

Abstract:

Tourism is one of the methods to publish the beauty of nature or the uniqueness of culture in a region that spreads from the coast up to the mountains. The distribution and the access to tourist attractions require mobile application. In creating the application, Bellman – Ford algorithm was used to get the shortest route. The algorithm was the Bellman – Ford algorithm which was used to calculate the shortest distance to the tourist attraction on the weighted graph. Testing the functionality of the application used a black box. The results showed that functions on the mobile application could run well. The compatibility testing showed 100% compatibility with a number of Android devices. In addition, the usability testing showed that the application was appropriate to use with percentage by 82.7% of the 30 respondents. The "Rembang tourism" mobile application can be used by users of information about tourism.

APA, Harvard, Vancouver, ISO, and other styles

15

Salman et al., Mustafa I. "Software Defined Network of Video Surveillance System Based on Enhanced Routing Algorithms." Baghdad Science Journal 17, no. 1(Suppl.) (March 18, 2020): 0391. http://dx.doi.org/10.21123/bsj.2020.17.1(suppl.).0391.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

16

Hutson, Kevin R., Terri L. Schlosser, and Douglas R. Shier. "On the Distributed Bellman-Ford Algorithm and the Looping Problem." INFORMS Journal on Computing 19, no. 4 (November 2007): 542–51. http://dx.doi.org/10.1287/ijoc.1060.0195.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Jukna, Stasys, and Georg Schnitger. "On the optimality of Bellman–Ford–Moore shortest path algorithm." Theoretical Computer Science 628 (May 2016): 101–9. http://dx.doi.org/10.1016/j.tcs.2016.03.014.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

19

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 text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

20

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

21

Hutasoit, Ester Tetri H. "Pencarian Rute Terpendek Menggunakan Algoritma Bellman-Ford (Studi Kasus: PT. JNE Medan)." Jurnal Sistem Komputer dan Informatika (JSON) 1, no. 1 (August 21, 2019): 20. http://dx.doi.org/10.30865/json.v1i1.1367.

Full text

Abstract:

Every human being wants to get to his destination on time. But often congestion causes human desires are blocked. Therefore, we need a way to overcome this problem by knowing the minimum distance to reach a place. The service sector is a field that offers services by helping consumers in various ways. The service sector is a field that will never experience bankruptcy even in difficult conditions because everyone certainly needs the help of others in completing or completing various things. Freight forwarding services are one of the services most widely used, especially in saving time and costs (cost). In the freight forwarding service, the route of shipping the goods becomes very important because without a structured route, the delivery of goods becomes not timely and can be detrimental to the company itself. The loss that will be experienced by the company is that the delivery time will be longer because the delivery distance will be further. In this study the calculation of the application using the Bellman-Ford algorithm is performed which aims to find the shortest path from the office of PT. JNE Medan to Helvetia. The algorithm used is Bellman-Ford. The Belmman-Ford algorithm is used to calculate all paths from origin to destination formed in a graph to find the shortest path.

APA, Harvard, Vancouver, ISO, and other styles

22

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

23

Muzakir, Ari, and Hutrianto Hutrianto. "Bellman-Ford Algorithm for Completion of Route Determination: An Experimental Study." Jurnal Ilmiah Teknik Elektro Komputer dan Informatika 6, no. 1 (July 26, 2020): 29. http://dx.doi.org/10.26555/jiteki.v16i1.16943.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Kumar, Kamlesh, and Vipin Saxena. "An Energy Computation in Distributed Computing Environment through Bellman-Ford Algorithm." International Journal of Computer Applications 142, no. 2 (May 17, 2016): 1–6. http://dx.doi.org/10.5120/ijca2016909675.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Mo, Yuanqiu, and Lanlin Yu. "A Lyapunov analysis of the continuous-time adaptive Bellman–Ford algorithm." Systems & Control Letters 157 (November 2021): 105045. http://dx.doi.org/10.1016/j.sysconle.2021.105045.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Wan, Dong. "The Design and Implementation of Micromouse Based on C8051F120." Applied Mechanics and Materials 313-314 (March 2013): 308–11. http://dx.doi.org/10.4028/www.scientific.net/amm.313-314.308.

Full text

Abstract:

According to the international Micromouse competition requirements suited for the IEEE standard maze, a kind of Micromouse based on C8051F120 is designed in this paper. The hardware structure and software algorithm are specifically introduced, the Center Toward Rule and the Bellman-Ford Algorithm is used for turning, searching and attitude control is optically designed. The designed Micromouse can find the optimal route of the IEEE standard maze by 0.4 s and walk rapidly and stably.

APA, Harvard, Vancouver, ISO, and other styles

27

Tamimi, Abdelfatah Aref. "Comparison Studies for Different Shortest path Algorithms." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 14, no. 8 (June 2, 2015): 5979–86. http://dx.doi.org/10.24297/ijct.v14i8.1857.

Full text

Abstract:

While technological revolution has active role to the increase of computer information, growing computational capabilities of devices, and raise the level of knowledge abilities, and skills. Increase developments in science and technology. In graph used the shortest path algorithms for solving the shortest path problem. The shortest path can be single pair shortest path problem or all pairs shortest path problem. This paper discuss briefly the shortest path algorithms such as Dijkstra's algorithm, Bellman-Ford algorithm,Floyd- Warshall algorithm, and johnson's algorithm. It describes the previous algorithms for solving the shortest path problem. The goal of this paper is to investigate and comparison the impacts of different shortest path algorithms. The study shows that the efficiency varies among algorithms, helps to suggest which one of them ought to be used to solve a specific variant of the shortest path problem.

APA, Harvard, Vancouver, ISO, and other styles

28

Busato, Federico, and Nicola Bombieri. "An Efficient Implementation of the Bellman-Ford Algorithm for Kepler GPU Architectures." IEEE Transactions on Parallel and Distributed Systems 27, no. 8 (August 1, 2016): 2222–33. http://dx.doi.org/10.1109/tpds.2015.2485994.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Swathika, O. V. Gnana, S. Hemamalini, Shivam Mishra, Sumedh Meher Pophali, and Nilay Alokkumar Barve. "Shortest Path Identification in Reconfigurable Microgrid Using Hybrid Bellman Ford-Dijkstra’s Algorithm." Advanced Science Letters 22, no. 10 (October 1, 2016): 2932–35. http://dx.doi.org/10.1166/asl.2016.7081.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Mo, Yuanqiu, Soura Dasgupta, and Jacob Beal. "Robustness of the Adaptive Bellman –Ford Algorithm: Global Stability and Ultimate Bounds." IEEE Transactions on Automatic Control 64, no. 10 (October 2019): 4121–36. http://dx.doi.org/10.1109/tac.2019.2904239.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Hemalatha, S., and P. Valsalal. "Identification of Optimal Path in Power System Network Using Bellman Ford Algorithm." Modelling and Simulation in Engineering 2012 (2012): 1–6. http://dx.doi.org/10.1155/2012/913485.

Full text

Abstract:

Power system network can undergo outages during which there may be a partial or total blackout in the system. In that condition, transmission of power through the optimal path is an important problem in the process of reconfiguration of power system components. For a given set of generation, load pair, there could be many possible paths to transmit the power. The optimal path needs to consider the shortest path (minimum losses), capacity of the transmission line, voltage stability, priority of loads, and power balance between the generation and demand. In this paper, the Bellman Ford Algorithm (BFA) is applied to find out the optimal path and also the several alternative paths by considering all the constraints. In order to demonstrate the capability of BFA, it has been applied to a practical 230 kV network. This restorative path search guidance tool is quite efficient in finding the optimal and also the alternate paths for transmitting the power from a generating station to demand.

APA, Harvard, Vancouver, ISO, and other styles

32

Yulianto, Budi. "Teknologi Location Based Service (Global Positioning System) Pada Perangkat Mobile." ComTech: Computer, Mathematics and Engineering Applications 1, no. 1 (June 1, 2010): 61. http://dx.doi.org/10.21512/comtech.v1i1.2168.

Full text

Abstract:

Article presents analysis and design of software using Location Based Service (LBS) that is part of communication technology based on geographic position. The goal of the research is designing LBS application to be implemented on mobile device that has GPS (Global Positioning System) technology and uses GPRS (General Packet Radio Service) to connect to server for generating shortest path by Dijkstra algorithm method Fibonacci Heap. Software development method used is LBS application implemented on mobile device. Conclusion of the research has shown that shortest path generated using Dijkstra algorithm method Fibonacci Heap as single source shortest path is faster than Dijkstra algorithm and Bellman Ford.

APA, Harvard, Vancouver, ISO, and other styles

33

Agarwal, Pankhari, and Maitreyee Dutta. "New Approach of Bellman Ford Algorithm on GPU using Compute Unified Design Architecture (CUDA)." International Journal of Computer Applications 110, no. 13 (January 16, 2015): 11–15. http://dx.doi.org/10.5120/19375-1027.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

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 (March 1, 2017): 81–87. http://dx.doi.org/10.11591/eei.v6i1.577.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

35

Chertkov, Alexandr A. "AUTOMATION SELECTION SHORTCUTS ROUTES OF SHIPS ON THE BASIS OF MODIFIED BELLMAN-FORD ALGORITHM." Vestnik Gosudarstvennogo universiteta morskogo i rechnogo flota imeni admirala S. O. Makarova 9, no. 5 (October 28, 2017): 1113–22. http://dx.doi.org/10.21821/2309-5180-2017-9-5-1113-1122.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

R, Al Bager A. Al Bager, and Al Samani A. Ahmed. "Designing and Implementing Shortest and Fastest Paths; A Comparison of Bellman-Ford algorithm, A*, and Dijkstra’s algorithms." International Journal of Computer Trends and Technology 69, no. 5 (May 25, 2021): 6–12. http://dx.doi.org/10.14445/22312803/ijctt-v69i5p102.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Ferreira, Joao, Gustavo Callou, Dietmar Tutsch, and Paulo Maciel. "PLDAD—An Algorihm to Reduce Data Center Energy Consumption." Energies 11, no. 10 (October 19, 2018): 2821. http://dx.doi.org/10.3390/en11102821.

Full text

Abstract:

Due to the demands of new technologies such as social networks, e-commerce and cloud computing, more energy is being consumed in order to store all the produced data. While these new technologies require high levels of availability, a reduction in the cost and environmental impact is also expected. The present paper proposes a power balancing algorithm (power load distribution algorithm-depth (PLDA-D)) to optimize the energy distribution of data center electrical infrastructures. The PLDA-D is based on the Bellman and Ford–Fulkerson flow algorithms that analyze energy-flow models (EFM). EFM computes the power efficiency, sustainability and cost metrics of data center infrastructures. To demonstrate the applicability of the proposed strategy, we present a case study that analyzes four power infrastructures. The results obtained show about a 3.8% reduction in sustainability impact and operational costs.

APA, Harvard, Vancouver, ISO, and other styles

38

Zhang, Chuanwei, Rui Zhou, Lei Lei, and Xinyue Yang. "Research on Automatic Parking System Strategy." World Electric Vehicle Journal 12, no. 4 (October 19, 2021): 200. http://dx.doi.org/10.3390/wevj12040200.

Full text

Abstract:

The development of the automobile industry and the increase in car ownership has brought great traffic pressures to the city, among which, the difficulty of parking has become a serious problem to the majority of drivers. An automatic parking system can help drivers to complete parking operation or automatic parking task, and a decision control system is an important part of automatic parking system. In this paper, a strategy for generating the shortest parking path based on a bidirectional breadth-first search algorithm combined with a modified Bellman–Ford algorithm is proposed for automatic parking systems. Experimental results show that this scheme can improve the performance of an automatic parking system, especially in a complex environment.

APA, Harvard, Vancouver, ISO, and other styles

39

WU, JIE, and FEI DAI. "QoS ROUTING IN HYPERCUBE MULTICOMPUTERS." Parallel Processing Letters 13, no. 01 (March 2003): 43–52. http://dx.doi.org/10.1142/s0129626403001136.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

40

SITORUS, IRMA YOLANDA, and PENDA SUDARTO HASUGIAN. "Shortest These search Heading Attractions Lubukpakam Using Greedy Algorithm." Journal Of Computer Networks, Architecture and High Performance Computing 2, no. 2 (June 1, 2020): 245–49. http://dx.doi.org/10.47709/cnapc.v2i2.417.

Full text

Abstract:

In the case of this shortest route search actually has many different types of solutions for path searching, for example the greedy algorithm, dijkstra, floyd-warshall and bellman-ford but what is commonly used to solve this problem is the Greedy algorithm because this algorithm is an algorithm that uses a problem solving approach with look for a temporary maximum value at each step. Of all the tourist attractions such as the Fruit Garden, Deli Serdang Swimming Pool, Deli Serdang Museum, Deli Serdang Regency Government Square, Tengku Raja Muda Field, the writer will look for the shortest path to take the closest route because of the many paths that can be taken to get the optimum path as well as using google maps. This application is made web-based with PHP and MySQL scripts as a database manager so that it is enough to connect to the internet network that everyone can easily access.

APA, Harvard, Vancouver, ISO, and other styles

41

Góngora, Pedro A., and David A. Rosenblueth. "A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria." International Journal of Applied Mathematics and Computer Science 25, no. 3 (September 1, 2015): 577–96. http://dx.doi.org/10.1515/amcs-2015-0043.

Full text

Abstract:

AbstractConsider games where players wish to minimize the cost to reach some state. A subgame-perfect Nash equilibrium can be regarded as a collection of optimal paths on such games. Similarly, the well-known state-labeling algorithm used in model checking can be viewed as computing optimal paths on a Kripke structure, where each path has a minimum number of transitions. We exploit these similarities in a common generalization of extensive games and Kripke structures that we name “graph games”. By extending the Bellman-Ford algorithm for computing shortest paths, we obtain a model-checking algorithm for graph games with respect to formulas in an appropriate logic. Hence, when given a certain formula, our model-checking algorithm computes the subgame-perfect Nash equilibrium (as opposed to simply determining whether or not a given collection of paths is a Nash equilibrium). Next, we develop a symbolic version of our model checker allowing us to handle larger graph games. We illustrate our formalism on the critical-path method as well as games with perfect information. Finally, we report on the execution time of benchmarks of an implementation of our algorithms

APA, Harvard, Vancouver, ISO, and other styles

42

Thomas, Sanu, and Thomaskutty Mathew. "Congestion bottleneck avoid routing in wireless sensor networks." International Journal of Electrical and Computer Engineering (IJECE) 9, no. 6 (December 1, 2019): 4804. http://dx.doi.org/10.11591/ijece.v9i6.pp4804-4814.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

43

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 (May 25, 2020): 2992. http://dx.doi.org/10.3390/s20102992.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

44

Banerjee, Arijeet, and Pijush Kanti Kumar. "Review of Shortest Path Algorithm." International Journal of Computer Science and Mobile Computing 11, no. 4 (April 30, 2022): 1–8. http://dx.doi.org/10.47760/ijcsmc.2022.v11i04.001.

Full text

Abstract:

Shortest path algorithm. Graphs are an example of non-linear data structure. A graph is a collection of nodes which are connected by edges. The definition of graph G = (V, E) is basically a collection of vertices and edges. Graphs can be classified on the basis of types of edges. Directed graphs have each of the edges directed which means the edges connecting the two nodes defines the way it is connected from and to. On the other side, undirected graphs have edges which have no direction. The edges of a graph have weights which are associated with it. The weight of an edge can be thought as the cost of the edge. Let’s assume there are two vertices representing two cities, then the weight of the edge between the vertices may represent the distance between the cities. Given a given graph and a particular node, we can find a path of least total weight from that node to other vertices of the graph. The total weight of the path will be the sum of the weights of the edges. Graphs can be used in real life to find the shortest path between two destinations, used in social networking sites like facebook and the world wide web where the web pages are represented by the nodes. Dijkstra’s Algorithm, Floyd – Warshall, Bellman Ford Algorithm, Johnson’s algorithm, A* search algorithm are some of the shortest path algorithms.

APA, Harvard, Vancouver, ISO, and other styles

45

Thayer, Edward C., Maynard V. Olson, and Richard M. Karp. "Error Checking and Graphical Representation of Multiple–Complete–Digest (MCD) Restriction-Fragment Maps." Genome Research 9, no. 1 (January 1, 1999): 79–90. http://dx.doi.org/10.1101/gr.9.1.79.

Full text

Abstract:

Genetic and physical maps display the relative positions of objects or markers occurring within a target DNA molecule. In constructing maps, the primary objective is to determine the ordering of these objects. A further objective is to assign a coordinate to each object, indicating its distance from a reference end of the target molecule. This paper describes a computational method and a body of software for assigning coordinates to map objects, given a solution or partial solution to the ordering problem. We describe our method in the context of multiple–complete–digest (MCD) mapping, but it should be applicable to a variety of other mapping problems. Because of errors in the data or insufficient clone coverage to uniquely identify the true ordering of the map objects, a partial ordering is typically the best one can hope for. Once a partial ordering has been established, one often seeks to overlay a metric along the map to assess the distances between the map objects. This problem often proves intractable because of data errors such as erroneous local length measurements (e.g., large clone lengths on low-resolution physical maps). We present a solution to the coordinate assignment problem for MCD restriction-fragment mapping, in which a coordinated set of single-enzyme restriction maps are simultaneously constructed. We show that the coordinate assignment problem can be expressed as the solution of a system of linear constraints. If the linear system is free of inconsistencies, it can be solved using the standard Bellman–Ford algorithm. In the more typical case where the system is inconsistent, our program perturbs it to find a new consistent system of linear constraints, close to those of the given inconsistent system, using a modified Bellman–Ford algorithm. Examples are provided of simple map inconsistencies and the methods by which our program detects candidate data errors and directs the user to potential suspect regions of the map.

APA, Harvard, Vancouver, ISO, and other styles

46

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

47

Hossen, Rakib, Md Whaiduzzaman, Mohammed Nasir Uddin, Md Jahidul Islam, Nuruzzaman Faruqui, Alistair Barros, Mehdi Sookhak, and Md Julkar Nayeen Mahi. "BDPS: An Efficient Spark-Based Big Data Processing Scheme for Cloud Fog-IoT Orchestration." Information 12, no. 12 (December 10, 2021): 517. http://dx.doi.org/10.3390/info12120517.

Full text

Abstract:

The Internet of Things (IoT) has seen a surge in mobile devices with the market and technical expansion. IoT networks provide end-to-end connectivity while keeping minimal latency. To reduce delays, efficient data delivery schemes are required for dispersed fog-IoT network orchestrations. We use a Spark-based big data processing scheme (BDPS) to accelerate the distributed database (RDD) delay efficient technique in the fogs for a decentralized heterogeneous network architecture to reinforce suitable data allocations via IoTs. We propose BDPS based on Spark-RDD in fog-IoT overlay architecture to address the performance issues across the network orchestration. We evaluate data processing delays from fog-IoT integrated parts using a depth-first-search-based shortest path node finding configuration, which outperforms the existing shortest path algorithms in terms of algorithmic (i.e., depth-first search) efficiency, including the Bellman–Ford (BF) algorithm, Floyd–Warshall (FW) algorithm, Dijkstra algorithm (DA), and Apache Hadoop (AH) algorithm. The BDPS exhibits low latency in packet deliveries as well as low network overhead uplink activity through a map-reduced resilient data distribution mechanism, better than in BF, DA, FW, and AH. The overall BDPS scheme supports efficient data delivery across the fog-IoT orchestration, outperforming faster node execution while proving effective results, compared to DA, BF, FW and AH, respectively.

APA, Harvard, Vancouver, ISO, and other styles

48

Arrumdany, Ayu Cahyany, Putri Perdana Sari, Paet Rahmadani, and Ahmadi Irhamsyah Lubis. "Web-Based Geographic Information System (GIS) in Determining Shortest Path of MSME Medan City Using Bellman-Ford Algorithm." Journal of Physics: Conference Series 1255 (August 2019): 012075. http://dx.doi.org/10.1088/1742-6596/1255/1/012075.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

MOHAN, J., SHWETA M. DEVANAGAONKAR, VINEETA V. GARUR, A. KARTHIK, K. ROHITAKSHA, and A. B. RAJENDRA. "An Improved Approach for Eliminating the Loop in Hybrid Software Defined Network (SDN) Using Modified Bellman-Ford Algorithm." Journal of Interconnection Networks 20, no. 04 (December 2020): 2150001. http://dx.doi.org/10.1142/s0219265921500018.

Full text

Abstract:

SDN is approaching its own structure of acceptance. Therefore, the increasing deployment of SDNs is being discussed as a possible approach, appearing in the development of the hybrid SDN networks. An foremost work in the hybrid SDN networks is bandwidth allocation, taking into account the integration of both SDN-enabled and conventional switches. The network loop in layer 2 switches is skipped in Spanning Tree Protocol (STP) by ceaselessly watching the network to trace all links and block the unwanted ones. Bridge loops will occur anytime there’s a redundant Layer2 way between ends. By default, switches forward broadcast/multicast out all ports, other than the port from that the broadcast/multicast was delivered. Once a switch loop is brought in the network, broadcast messages are going to be broadcasted more often leading to broadcast storms. The Spanning-tree algorithm enforces a distributed divergent of the Bellman-Ford iterative algorithm that always looks for the optimal solution and selects an optimal influential switch anytime. In this paper we use controller’s global network view for resolving loop problem in layer 2 network. SDN controller acts on broadcast packets received from switch-ports and host-ports differently that is if the broadcast packets received from host ports, the SDN controller broadcasts these packets to all ports and if broadcast packets is received from switch ports, only some switches broadcasts these packets on all ports instead of all switches.

APA, Harvard, Vancouver, ISO, and other styles

50

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 (October 2016): 1–16. http://dx.doi.org/10.4018/ijmcmc.2016100101.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Bellman-Ford algorithm'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles