TY - JOUR
T1 - Knowledge Graph Aided Network Representation and Routing Algorithm for LEO Satellite Networks
AU - Li, Chenxi
AU - He, Wenji
AU - Yao, Haipeng
AU - Mai, Tianle
AU - Wang, Jingjing
AU - Guo, Song
N1 - Publisher Copyright:
© 1967-2012 IEEE.
PY - 2023/4/1
Y1 - 2023/4/1
N2 - The compelling applications of Low earth orbit (LEO) satellite networks in our daily lives have been witnessed in recent years, ranging from weather forecasts to military monitoring. LEO satellite networks have grown in importance as a complement to terrestrial networks aiming at delivering global, ubiquitous communication. However, due to the LEO network topology keeps changing dynamically, the development of efficient routing algorithms becomes one of the challenges in the LEO network. Traditional routing policies hardly solve the rerouting problem caused by link switchover and the high calculation cost caused by large-scale irregular satellite topology. In this paper, we propose a knowledge graph-aided representation of satellite network topologies and routing architecture to optimize path selection and calculation cost for lower packet loss ratio and average delay. Moreover, we generate a routing policy by predicting potential relations between data packets and nodes to select the best relay nodes with the maximum probability of forwarding relations. Finally, extensive simulations are performed to evaluate the performance and availability of our proposed algorithm.
AB - The compelling applications of Low earth orbit (LEO) satellite networks in our daily lives have been witnessed in recent years, ranging from weather forecasts to military monitoring. LEO satellite networks have grown in importance as a complement to terrestrial networks aiming at delivering global, ubiquitous communication. However, due to the LEO network topology keeps changing dynamically, the development of efficient routing algorithms becomes one of the challenges in the LEO network. Traditional routing policies hardly solve the rerouting problem caused by link switchover and the high calculation cost caused by large-scale irregular satellite topology. In this paper, we propose a knowledge graph-aided representation of satellite network topologies and routing architecture to optimize path selection and calculation cost for lower packet loss ratio and average delay. Moreover, we generate a routing policy by predicting potential relations between data packets and nodes to select the best relay nodes with the maximum probability of forwarding relations. Finally, extensive simulations are performed to evaluate the performance and availability of our proposed algorithm.
KW - knowledge graph (KG)
KW - LEO satellite networks
KW - network representation learning (NRL)
KW - routing policy
UR - https://www.scopus.com/pages/publications/85144018020
U2 - 10.1109/TVT.2022.3225666
DO - 10.1109/TVT.2022.3225666
M3 - 文章
AN - SCOPUS:85144018020
SN - 0018-9545
VL - 72
SP - 5195
EP - 5207
JO - IEEE Transactions on Vehicular Technology
JF - IEEE Transactions on Vehicular Technology
IS - 4
ER -