Research Article
Distributed Routing Strategy Based on Machine Learning for LEO Satellite Network
Algorithm 1
Main flow of ELMDR strategy.
| begin | | initialize routing table and data structure | | (A)satellite node generates and sends forward MA | | (B)select the next node according to (1) | | (C)handover judgement according to (8) and (9) | | (D)if loop avoidance == true | | go to step (E) | | else | | go to step (B) | | (E)record delay at intermediate node | | (F)forward MA arrives at destination node | | (G)destination node generates and sends backward MA | | (H)backward MA returns to source node | | (I)handover judgement according to (8) and (9) | | (J)update routing table according to (2) and data structure according to (3) | | (K)prediction MA is activated to predict traffic at satellite node | | (L)revise routing table according to (4)–(7) | | End |
|