Prims Algorithm for Optimizing Fiber Optic Trajectory Planning

Authors

  • Muhammad Iqbal  Faculty of Computer Science, Universitas Pembangunan Panca Budi, Medan, Indonesia
  • Andysah Putera Utama Siahaan  Ph.D. Student of School of Computer and Communication Engineering, Universiti Malaysia Perlis, Kangar, Malaysia
  • Nathania Elizabeth Purba  Faculty of Computer Science and Information Technology, Universitas Sumatera Utara, Medan, Indonesia
  • Dedi Purwanto  Ph.D. Student of School of Computer and Communication Engineering, Universiti Malaysia Perlis, Kangar, Malaysia

Keywords:

Fiber Optic, Prim's Algorithm, Shortest Path

Abstract

The transition of copper cable technology to fiber optic is very triggering the development of technology where data can be transmitted quickly and accurately. This cable change can be seen everywhere. This cable is an expensive cable. If it is not installed optimally, it will cost enormously. This excess cost can be used to other things to support performance rather than for excess cable that should be minimized. Determining how much cable use at the time of installation is difficult if done manually. Prim's algorithm can optimize by calculating the minimum spanning tree on branches used for fiber optic cable installation. This algorithm can be used to shorten the time to a destination by making all the points interconnected according to the points listed. Use of this method helps save the cost of fiber optic construction.

References

  1. N. P. Akpan and I. A. Iwok, "A Minimum Spanning Tree Approach of Solving a Transportation Problem," International Journal of Mathematics and Statistics Invention, vol. 5, no. 3, pp. 09-18, 2017.
  2. S. Dagar, "Modified Prim's Algorithm," International Journal of Computer and Information Technology, vol. 3, no. 2, pp. 26-29, 2012.
  3. T. O. Arogundade, B. Sobowale and T. A. Akinwale, "Prim Algorithm Approach to Improving Local Access Network in Rural Areas," International Journal of Computer Theory and Engineering, vol. 3, no. 3, pp. 413-417, 2011.
  4. A. Mandal, J. Dutta and S. Pal, "A New Efficient Technique to Construct a Minimum Spanning Tree," International Journal of Advanced Research in Computer Science and Software Engineering, vol. 2, no. 10, pp. 93-97, 2012.
  5. A. P. U. Siahaan, "Heuristic Function Influence to the Global Optimum Value in Shortest Path Problem," IOSR Journal of Computer Engineering, vol. 18, no. 5, pp. 39-48, 2016.
  6. M. Jose and S. Sreekumar, "Comparison of BFS and Prim's Algorithm when Used in MANETs Routing," International Journal of Computer Applications Technology and Research, vol. 5, no. 2, pp. 92-94, 2016.
  7. W.-C. Chang, T.-H. Wang and Y.-D. Chiu, "Board Game Supporting Learning Prim’s Algorithm and Dijkstra’s Algorithm," International Journal of Multimedia Data Engineering and Management, vol. 1, no. 4, pp. 16-30, 2010.
  8. A. Amaku, R. E. Watti and J. Joshua, "Optic Fiber as a Reliable Medium for Metropolitan Area Networking (MAN) Connectivity," International Journal of Engineering and Technology, vol. 4, no. 9, pp. 542-547, 2014.
  9. P. Sharma, R. K. Arora, S. Pardeshi and M. Singh, "Fibre Optic Communications: An Overview," International Journal of Emerging Technology and Advanced Engineering, vol. 3, no. 5, pp. 474-479, 2013.
  10. A. Kumar and G. Kumar, "An Efficient Method to Construct Minimum Spanning Tree," International Journal of Latest Technology in Engineering, Management & Applied Science, vol. 4, no. 10, pp. 48-51, 2015.
  11. Ray, "Algoritma Prim," 20 April 2011. [Online]. Available: http://architectureandrouting.blogspot.co.id/ 2011/04/algoritma-prim.html. [Accessed 24 August 2017].

Downloads

Published

2017-08-31

Issue

Section

Research Articles

How to Cite

[1]
Muhammad Iqbal, Andysah Putera Utama Siahaan, Nathania Elizabeth Purba, Dedi Purwanto, " Prims Algorithm for Optimizing Fiber Optic Trajectory Planning, International Journal of Scientific Research in Science and Technology(IJSRST), Online ISSN : 2395-602X, Print ISSN : 2395-6011, Volume 3, Issue 6, pp.504-509, July-August-2017.