A shortest path routing algorithm based on virtual coordinate in NeLS

摘要

Satellite networks can provide worldwide-coverage wireless datagram services. With the advantage of low orbit altitude and short round-trip delay, the Low Earth Orbit (LEO) satellite is becoming an essential part of the next generation of the Internet. In this paper, we propose a shortest path routing algorithm for Next-generation LEO System (NeLS), a delta-type LEO satellite constellation. Based on virtual coordinate, our routing algorithm has constant time complexity. The NS2 simulation results validate that the proposed algorithm can obtain the shortest path as Dijkstra shortest path algorithm with a less running time.