Open Access Open Access  Restricted Access Subscription Access

Shortest Path Algorithm For Satellite Network


 

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.


Keywords

BFS,Dijkstra’s, Prim’s, network, algorithm,spanning tree
User
Notifications
Font Size

Abstract Views: 140

PDF Views: 0




  • Shortest Path Algorithm For Satellite Network

Abstract Views: 140  |  PDF Views: 0

Authors

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.


Keywords


BFS,Dijkstra’s, Prim’s, network, algorithm,spanning tree