Abstract | ||
---|---|---|
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 |
Year | Venue | Field |
---|---|---|
2016 | 2016 8TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS & SIGNAL PROCESSING (WCSP) | Link-state routing protocol,Equal-cost multi-path routing,Shortest path problem,Computer science,Computer network,Constrained Shortest Path First,Real-time computing,Suurballe's algorithm,Private Network-to-Network Interface,K shortest path routing,Dijkstra's algorithm |
DocType | ISSN | Citations |
Conference | 2325-3746 | 0 |
PageRank | References | Authors |
0.34 | 0 | 6 |
Name | Order | Citations | PageRank |
---|---|---|---|
Qiuwen Chen | 1 | 48 | 12.35 |
Kechen Zheng | 2 | 38 | 9.26 |
Feng Ouyang | 3 | 0 | 0.34 |
Xiaoying Gan | 4 | 344 | 48.16 |
Youyun Xu | 5 | 1204 | 117.78 |
Xiaohua Tian | 6 | 568 | 65.92 |