2008 4th International Conference on Wireless Communications, Networking and Mobile Computing 2008
DOI: 10.1109/wicom.2008.1017
|View full text |Cite
|
Sign up to set email alerts
|

A Shortest Path Algorithm Based on Mobile Agent in LEO Satellite Network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 9 publications
0
0
0
Order By: Relevance
“…• Shortest paths (k-SP): The k-sp algorithm finds k paths between the source and destination in the network with the minimum length [52]. This algorithm distributes traffic among the k-shortest paths in the satellite communication network [53]. • Ground-to-ground disjoint paths (k-DG): The algorithm considers k-shortest paths with node disjoint paths, i.e., without any shared uplinks, downlinks, or inter-satellite links.…”
Section: Random Routing Algorithmmentioning
confidence: 99%
“…• Shortest paths (k-SP): The k-sp algorithm finds k paths between the source and destination in the network with the minimum length [52]. This algorithm distributes traffic among the k-shortest paths in the satellite communication network [53]. • Ground-to-ground disjoint paths (k-DG): The algorithm considers k-shortest paths with node disjoint paths, i.e., without any shared uplinks, downlinks, or inter-satellite links.…”
Section: Random Routing Algorithmmentioning
confidence: 99%