Design Hardware Simulation Using an Embedded System Find Shortest-Path Based on Dijkstra's Algorithm

Ali Obaid, Mohammed; Abdul Lateef, Zina

	Design Hardware Simulation Using an Embedded System Find Shortest-Path Based on Dijkstra's Algorithm
Journal of University of Babylon
Article 1, Volume 22, Issue 1, 2014, Pages 192-200
Authors
Mohammed Ali Obaid; Zina Abdul Lateef
Abstract
In computer science, graphs are used to represent networks of communication, data organization, computational devices, the flow of computation, etc. One practical example: The link structure of a website could be represented by a directed graph. The vertices are the web pages available at the website and a directed edge from page A to page B exists if and only if A contains a link to B. A similar approach can be taken to problems in travel, biology, computer chip design, and many other fields. The proposal design is a simulation of one algorithm in graph theory to find shortest path called Dijkstra algorithm. The implementation of routing algorithm in hardware design has return practical solution benefit to find the shortest path in many fields (communication, search shortest road, and engineering design, etc.) The hardware simulation process start by specify the source and destination of the topology consist of four nodes, and specify length between each connection. Then, microcontroller using in embedded system is ATML89c51 will start solving the problem of Dijkstra, and find the shortest path. The experimental results show process of the hardware and the Dijkstra's algorithm, and the results shows on LCD implemented with microcontroller.
Keywords
Graph theory; Dijkstra; ATML; LCD

Statistics Article View: 210 PDF Download: 43