Searching for shortest paths between nodes of telecommunication network

Miha Gobov (2014) Searching for shortest paths between nodes of telecommunication network. EngD thesis.

Preview

PDF Download (1926Kb)

Abstract

The thesis describes a solution to the shortest path problem between two points in a telecommunication network. To solve the problem a detailed spatial data describing network and the list of start and end coordinate pairs are available, between which we have to find the shortest path. The network layout is provided in the shapefile format which is used for storing vector geospatial data in geographic information systems. In order to be able to search for paths in the network, we have transformed it into a graph form. We have saved the graph into the graph database, which is a purpose tool for working with graphs in the form of vertices and edges. Start and end coordinate points were then connected to the leaves in the graph. In order to look for of the shortest paths we have used Dijkstra's algorithm. Results were then stored in the CSV format. The results were also visualised in the geographic information system, where we used the Well-known text format to import them.

Actions (login required)