Choosing a path for a cable between two points

Abstract

Most of the people in the world use the internet every day. The demand for high-speed Internet is increasing. The fastest Internet technology which is 5G will be released in the next year (2020). Many telecommunications cables will be installed when developing the 5G network all around the world. Therefore, good path planning for a cable is very important. It could save much money. The objective of this project is finding the optimized path between two places which located in California. In this project, the programming language Matlab is used to implement Dijkstra’s algorithm to choose the optimized path. This main concern of the project is divided into three parts. Firstly, the basic Dijkstra’s algorithm in 2-Dimensional is implemented. Secondly, the 3-Dimensional real data in California is imported into Matlab program. Thirdly, implementing the Dijkstra’s algorithm in 3-Dimensional by using the 3-Dimensional real data in California to find the optimized path. Other than that, background study and some approximations have done when handling a larger network. The result of the project is an optimized path which is calculated by using the Dijkstra’s algorithm. Also, the graph of the real data and the path is created to display the result. The result can be clearly to see the path how to optimize. Also, there are some solutions when handling large network and higher resolution.