Shortest Path Algorithm For Satellite Network

Abstract

In this paper we have proposed a new algorithm for finding the shortest path in a network which consists of host systems on land and satellites. Some classical network theories, such as shortest path algorithm using Dijkstra or Bellman Ford, cannot be applied to it availably. We have worked with Prim's Algorithm and modified it to suit our purpose.