A LEO Satellite Handover Strategy Based on Graph and Multiobjective Multiagent Path Finding
Low earth orbit (LEO) satellite network can provide services to users anywhere on the earth. However, the high-speed mobility of satellites leads to a dynamic environment, which brings challenges for handover and network performance optimization, especially in the scenario of multiuser using the net...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2023-01-01
|
| Series: | International Journal of Aerospace Engineering |
| Online Access: | http://dx.doi.org/10.1155/2023/1111557 |
| _version_ | 1811165473958526976 |
|---|---|
| author | Zhiyun Jiang Wei Li Xiangtong Wang Binbin Liang |
| author_facet | Zhiyun Jiang Wei Li Xiangtong Wang Binbin Liang |
| author_sort | Zhiyun Jiang |
| collection | DOAJ |
| description | Low earth orbit (LEO) satellite network can provide services to users anywhere on the earth. However, the high-speed mobility of satellites leads to a dynamic environment, which brings challenges for handover and network performance optimization, especially in the scenario of multiuser using the networks meanwhile. In this paper, we exploit multiple directed graphs to model the handover process for multiuser. The nodes in a graph represent the satellites that the corresponding user may choose to access. The edges represent the possible handovers between adjacent timestamps. The path from the start node to the end node in each graph is the handover strategy of the corresponding user, and the path length is the reward that the user can get. Therefore, the handover strategy problem is transformed into a path planning problem. To minimize the average handover times, maximize the average received power, and minimize the average number of conflicts, we propose a novel handover strategy based on multiobjective multiagent path finding (MOMAPF). The simulated handover experiment on Starlink successfully derives the Pareto-optimal solution set, which corroborates the effectiveness of the proposed handover strategy. The results also show that the proposed strategy has better comprehensive performance than other strategies. |
| first_indexed | 2024-04-10T15:37:43Z |
| format | Article |
| id | doaj.art-59a4b79e48b24d7eadb0169815c1f3a4 |
| institution | Directory Open Access Journal |
| issn | 1687-5974 |
| language | English |
| last_indexed | 2024-04-10T15:37:43Z |
| publishDate | 2023-01-01 |
| publisher | Hindawi Limited |
| record_format | Article |
| series | International Journal of Aerospace Engineering |
| spelling | doaj.art-59a4b79e48b24d7eadb0169815c1f3a42023-02-13T01:08:59ZengHindawi LimitedInternational Journal of Aerospace Engineering1687-59742023-01-01202310.1155/2023/1111557A LEO Satellite Handover Strategy Based on Graph and Multiobjective Multiagent Path FindingZhiyun Jiang0Wei Li1Xiangtong Wang2Binbin Liang3School of Aeronautics and AstronauticsSchool of Aeronautics and AstronauticsSchool of Aeronautics and AstronauticsSchool of Aeronautics and AstronauticsLow earth orbit (LEO) satellite network can provide services to users anywhere on the earth. However, the high-speed mobility of satellites leads to a dynamic environment, which brings challenges for handover and network performance optimization, especially in the scenario of multiuser using the networks meanwhile. In this paper, we exploit multiple directed graphs to model the handover process for multiuser. The nodes in a graph represent the satellites that the corresponding user may choose to access. The edges represent the possible handovers between adjacent timestamps. The path from the start node to the end node in each graph is the handover strategy of the corresponding user, and the path length is the reward that the user can get. Therefore, the handover strategy problem is transformed into a path planning problem. To minimize the average handover times, maximize the average received power, and minimize the average number of conflicts, we propose a novel handover strategy based on multiobjective multiagent path finding (MOMAPF). The simulated handover experiment on Starlink successfully derives the Pareto-optimal solution set, which corroborates the effectiveness of the proposed handover strategy. The results also show that the proposed strategy has better comprehensive performance than other strategies.http://dx.doi.org/10.1155/2023/1111557 |
| spellingShingle | Zhiyun Jiang Wei Li Xiangtong Wang Binbin Liang A LEO Satellite Handover Strategy Based on Graph and Multiobjective Multiagent Path Finding International Journal of Aerospace Engineering |
| title | A LEO Satellite Handover Strategy Based on Graph and Multiobjective Multiagent Path Finding |
| title_full | A LEO Satellite Handover Strategy Based on Graph and Multiobjective Multiagent Path Finding |
| title_fullStr | A LEO Satellite Handover Strategy Based on Graph and Multiobjective Multiagent Path Finding |
| title_full_unstemmed | A LEO Satellite Handover Strategy Based on Graph and Multiobjective Multiagent Path Finding |
| title_short | A LEO Satellite Handover Strategy Based on Graph and Multiobjective Multiagent Path Finding |
| title_sort | leo satellite handover strategy based on graph and multiobjective multiagent path finding |
| url | http://dx.doi.org/10.1155/2023/1111557 |
| work_keys_str_mv | AT zhiyunjiang aleosatellitehandoverstrategybasedongraphandmultiobjectivemultiagentpathfinding AT weili aleosatellitehandoverstrategybasedongraphandmultiobjectivemultiagentpathfinding AT xiangtongwang aleosatellitehandoverstrategybasedongraphandmultiobjectivemultiagentpathfinding AT binbinliang aleosatellitehandoverstrategybasedongraphandmultiobjectivemultiagentpathfinding AT zhiyunjiang leosatellitehandoverstrategybasedongraphandmultiobjectivemultiagentpathfinding AT weili leosatellitehandoverstrategybasedongraphandmultiobjectivemultiagentpathfinding AT xiangtongwang leosatellitehandoverstrategybasedongraphandmultiobjectivemultiagentpathfinding AT binbinliang leosatellitehandoverstrategybasedongraphandmultiobjectivemultiagentpathfinding |