Inter-satellite beam skipping scheduling and coordination methods, devices, electronic equipment and storage media

Abstract

This application provides a method for inter-satellite beam hopping scheduling and coordination. The method includes: before the start of the next scheduling cycle, in response to the presence of edge users in the overlapping area of ​​the service ranges of a first satellite and a second satellite, comparing the edge user densities of the first and second satellites; the edge user density is the number of users per unit area on the edge signaling beam; if it is determined that the edge user density of the first satellite is low, then traversing the time slots of the next scheduling cycle; determining whether beam hopping pattern compromise is needed; if it is determined that beam hopping pattern compromise is needed, then performing beam hopping pattern compromise based on a scheduling compromise algorithm for edge user density to obtain a compromised beam hopping pattern; in the next scheduling cycle, providing service beam hopping services according to the compromised beam hopping pattern. This method, for services provided to edge users, can avoid inter-satellite interference, thereby improving the overall throughput performance of the constellation system.

Description

Technical Field

[0001] This application relates to the technical field of low-Earth orbit satellite communication, specifically to inter-satellite beam hopping scheduling and coordination methods, devices, electronic equipment, and storage media. Background Technology

[0002] In recent years, with the rapid development of space technology and satellite communication technology, large-scale low-Earth orbit satellite constellation systems have gradually become a research hotspot in industry and academia. Traditional terrestrial communication technologies can no longer meet the growing communication demands, especially in terms of communication coverage.

[0003] Large-scale low-Earth orbit (LEO) satellite constellations support wide-area coverage and ubiquitous communication, aiming to achieve efficient and stable data transmission and ensure communication reliability in complex space environments. Large-scale constellations bring denser beamforming and more frequent and severe interference, while LEO satellites inherently involve highly dynamic cell changes, rapid shifts in satellite service areas, and frequent switching of satellite-to-ground links. Against this backdrop, inter-satellite beam hopping scheduling coordination and resource collaborative allocation have become crucial technologies for ensuring the communication efficiency and quality of large-scale LEO satellite constellations.

[0004] By designing specific methods or processes, the effective management and optimization of beam-hopping spacetime resources in satellite communication networks can maximize network performance under limited resource conditions, including increasing communication rates, reducing latency, increasing system capacity, and improving signal quality.

[0005] However, in related technologies, when an edge user accesses one of two satellites in the overlapping area of ​​any service range, the two satellites provide service beam hopping services according to their respective single-satellite beam hopping patterns. This implementation results in significant inter-satellite interference because the edge user is simultaneously affected by multiple satellites, which in turn affects the overall throughput performance of the constellation system. Summary of the Invention

[0006] In view of this, this application provides a method, apparatus, electronic equipment and storage medium for inter-satellite beam hopping scheduling and coordination, which can avoid inter-satellite interference for services provided to edge users, thereby improving the overall throughput performance of the constellation system.

[0007] To solve the above-mentioned technical problems, the technical solution of this application is implemented as follows:

[0008] In one embodiment, an inter-satellite beam hopping scheduling coordination method is provided, applied to a first satellite, wherein the service ranges of the first satellite and a second satellite overlap. The method includes:

[0009] Before the start of the next scheduling cycle, in response to the presence of edge users in the overlapping area of ​​the service ranges of the first satellite and the second satellite, the edge user densities of the first satellite and the second satellite are compared; the edge user is a user located at an edge signaling position, and the edge signaling position is a signaling position located in the overlapping area of ​​the service ranges of the first satellite and the second satellite; the edge user density is the number of users per unit area on the edge signaling position.

[0010] If it is determined that the edge user density of the first satellite is low, then the time slots of the next scheduling cycle are traversed; it is determined whether a compromise on the beam hopping pattern is needed.

[0011] If it is determined that a compromise in beam hopping pattern is required, then a compromise algorithm based on edge user density is used to compromise the beam hopping pattern to obtain the compromised beam hopping pattern.

[0012] In the next scheduling cycle, service beam hopping will be performed based on the compromised beam hopping pattern.

[0013] The method further includes:

[0014] If it is determined that the edge user density of the second satellite is low, then the service beam service is provided based on the single-satellite hop beam pattern of the first satellite.

[0015] If it is determined that a compromise on the beam hopping pattern is necessary, then the service beaming will be provided based on the single-satellite beam hopping pattern of the first satellite.

[0016] in,

[0017] The process of traversing the time slots of the next scheduling cycle; determining whether a compromise on the beam hopping pattern is required, including:

[0018] For each time slot traversed, determine whether an edge service beam is lit simultaneously in the first service beam set and the second service beam set; if so, determine that a compromise on the beam hopping pattern is required; otherwise, determine that no compromise on the beam hopping pattern is required; wherein, the edge service beam is a service beam located in the overlapping area of ​​the service range, the first service beam set is the set of service beams lit by the current beam hopping pattern of the first satellite, and the second service beam set is the set of service beams lit by the current beam hopping pattern of the second satellite;

[0019] The scheduling compromise algorithm based on edge user density compromises the beam hopping pattern to obtain the compromised beam hopping pattern, including:

[0020] Calculate the set of hopping beam pattern grids where the first satellite collides within the time slot, and obtain the third service bit set; the third service bit set is a set that can be used for bit swapping.

[0021] In the third set of service positions, find the service position that is closest to the set corresponding to the conflicting hop beam pattern grid and whose distance does not exceed a preset distance, and swap their positions to obtain a compromised hop beam pattern.

[0022] Wherein, after the position exchange, the method further includes:

[0023] Delete the swapped service waveforms from the third service set;

[0024] The acquisition of the third service frequency set includes:

[0025] If a third service set exists, then obtain the third service set;

[0026] If no third service set exists, the third service wavelength set is calculated. The third service wavelength set is determined based on the first service wavelength set, the fourth service wavelength set, and the service wavelength set corresponding to the time slots that cannot be used for service wavelength exchange. The time slots that cannot be used for service wavelength exchange are the time slots where no edge service wavelengths are lit on the first satellite and edge services are lit on the second satellite. The fourth service wavelength set is the set of service wavelengths of the first satellite corresponding to edge users in the edge user set.

[0027] The method further includes:

[0028] In response to receiving a notification from the second satellite and an access request from the edge user, service contention calculation is performed; the notification is sent by the second satellite at the next interaction time node after receiving the access request from the edge user.

[0029] Obtain the competition result of the service competition calculation, and notify the second satellite of the competition result at the next interaction time node;

[0030] If the first satellite is determined to be the serving satellite of the edge user based on the competition result, an access response is sent to the user terminal of the edge user.

[0031] The method further includes:

[0032] In response to an access request sent by an edge user, and provided that no notification has been received from the second satellite regarding the access request, the access request is identified;

[0033] If the access request is identified as originating from an edge signaling bit, a notification is sent to the second satellite sharing the edge signaling bit at the next interaction time node.

[0034] In response to the contention result sent by the second satellite, if the first satellite is determined to be the serving satellite of the edge user based on the contention result, an access response is sent to the user terminal of the edge user.

[0035] The method further includes:

[0036] The first satellite polls the users below the satellite using the signaling beam according to the pre-planned signaling position to obtain the information reported by the users below the satellite through the user terminal; the signaling beam and the service beam work together.

[0037] In another embodiment, an inter-satellite beam hopping scheduling and coordination device is provided, applied to a first satellite, wherein the service ranges of the first satellite and a second satellite overlap. The device includes:

[0038] A comparison unit is configured to compare the edge user densities of the first satellite and the second satellite before the start of the next scheduling cycle, in response to the presence of edge users in the overlapping area of ​​the service ranges of the first satellite and the second satellite; wherein the edge users are users located at edge signaling positions, the edge signaling positions are signaling positions located in the overlapping area of ​​the service ranges of the first satellite and the second satellite, and the edge user density is the number of users per unit area on the edge signaling position;

[0039] The determining unit is configured to perform the following actions: if it is determined that the edge user density of the first satellite is low, then traverse the time slots of the next scheduling cycle; determine whether a compromise on the hopping beam pattern is required.

[0040] The computing unit is configured to execute a scheduling compromise algorithm based on edge user density to compromise the hopping beam pattern if it is determined that a compromise of the hopping beam pattern is required, and to obtain the compromised hopping beam pattern.

[0041] The service unit is configured to perform service beam hopping services in the next scheduling cycle, based on the compromised beam hopping pattern.

[0042] In another embodiment, an electronic device is provided, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the inter-satellite beam hopping scheduling coordination method as described above.

[0043] In another embodiment, a computer-readable storage medium is provided having a computer program stored thereon that, when executed by a processor, implements the inter-satellite beam hopping scheduling coordination method as described above.

[0044] As can be seen from the above technical solution, in the above embodiment, before the start of the next scheduling cycle, in response to the presence of edge users in the overlapping area of ​​the service ranges of the first and second satellites, and the satellite with low edge user density determining that a compromise in beam hopping pattern is required on that satellite side, a scheduling compromise algorithm based on edge user density is used to compromise the beam hopping pattern, resulting in a compromised beam hopping pattern; and in the next scheduling cycle, service beam hopping is provided according to the compromised beam hopping pattern. This solution, for services provided to edge users, can avoid inter-satellite interference, thereby improving the overall throughput performance of the constellation system and the service experience of edge users. Attached Figure Description

[0045] To more clearly illustrate the technical solutions in the embodiments of this application, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0046] Figure 1 This is a schematic diagram of an edge user access process in an embodiment of this application;

[0047] Figure 2 This is a schematic diagram of another edge user access process in an embodiment of this application;

[0048] Figure 3 This is a schematic diagram of a satellite beam skipping scheduling and coordination method according to an embodiment of this application;

[0049] Figure 4 This is a schematic diagram of another inter-satellite beam skipping scheduling and coordination method in an embodiment of this application;

[0050] Figure 5 This is a schematic diagram of the satellite constellation system in the embodiments of this application;

[0051] Figure 6 This is a schematic diagram illustrating the joint operation of the signaling beam and the service beam in the embodiments of this application;

[0052] Figure 7 This is a schematic diagram of beam hopping scheduling compromise in the embodiments of this application;

[0053] Figure 8 This is a graph showing the relationship between downlink average SINR and maximum working beam, as given in the embodiments of this application.

[0054] Figure 9 This is a schematic diagram of the inter-satellite beam skipping scheduling and coordination device in an embodiment of this application;

[0055] Figure 10 This is a schematic diagram of the physical structure of an electronic device provided in an embodiment of the present invention. Detailed Implementation

[0056] The technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, and not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0057] The terms “first,” “second,” “third,” “fourth,” etc. (if present) in the specification, claims, and accompanying drawings of this invention are used to distinguish similar objects and are not necessarily used to describe the order or sequence of objects. It should be understood that such data can be interchanged where appropriate so that embodiments of the invention described herein can be implemented, for example, in orders other than those illustrated or described herein. Furthermore, the terms “comprising” and “having,” and any variations thereof, are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or apparatus that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or apparatus.

[0058] The technical solution of the present invention will be described in detail below with reference to specific embodiments. The following specific embodiments can be combined with each other, and the same or similar concepts or processes may not be described again in some embodiments.

[0059] In related technologies, when an edge user accesses one of two satellites in the overlapping area of ​​any service range, the two satellites provide service beam hopping services according to their respective single-satellite beam hopping patterns. However, this implementation results in significant inter-satellite interference because the edge user is simultaneously affected by multiple satellites, which in turn affects the overall throughput performance of the constellation system.

[0060] In view of the above problems, this application discloses an inter-satellite beam hopping scheduling and coordination method. Before the start of the next scheduling cycle, in response to the presence of edge users in the overlapping area of ​​the service ranges of the first and second satellites, and the satellite with low edge user density determining that a compromise in beam hopping pattern is needed on that satellite side, a scheduling compromise algorithm based on edge user density is used to compromise the beam hopping pattern, obtaining a compromised beam hopping pattern. In the next scheduling cycle, service beam hopping is performed according to the compromised beam hopping pattern. This solution, targeting services provided to edge users, can avoid inter-satellite interference, thereby improving the overall throughput performance of the constellation system and the service experience of edge users.

[0061] The following, in conjunction with the accompanying drawings, illustrates the process of inter-satellite beam hopping scheduling and coordination in an embodiment of this application.

[0062] The inter-satellite beam skipping scheduling and coordination method provided in this application embodiment is applied to a large-scale low-Earth orbit satellite constellation system. In this constellation system, there are cases where the service ranges of two satellites overlap. For ease of description, one satellite in the constellation system is referred to as the first satellite, and the satellite whose service range overlaps with that of the first satellite is referred to as the second satellite.

[0063] The first satellite polls the users below the satellite using the signaling beam according to the pre-planned signaling wave positions to obtain the information reported by the users below the satellite through the user terminal;

[0064] The second satellite polls the users below the satellite using the signaling beam according to the pre-planned signaling wave positions to obtain the information reported by the users below the satellite through the user terminal;

[0065] The information reported by users through their terminals includes service requests, location information, etc.

[0066] The signaling beams and service beams on each satellite work together, specifically as follows:

[0067] Service beams provide beam-hopping services for existing users;

[0068] The signaling beam handles new user access and service requests through polling.

[0069] In a constellation system, multiple satellites equipped with phased array multi-beam antennas synchronously perform service beam scheduling cycles. Before the start of a certain service beam scheduling cycle, two satellites with overlapping service ranges share their observation data, status information, and beam usage through inter-satellite links.

[0070] The service beam and signaling beam adopt independent beam planning, and each satellite uses the same signaling beam and service beam allocation method.

[0071] Edge users are users located at edge signaling positions, which are signaling positions located in the overlapping area of ​​the service range of the first and second satellites.

[0072] When an edge user wants to access a satellite, it typically first listens to the satellite's synchronization signal and PBCH block (SSB). When it listens to the SSB of a satellite, it sends an access request (MsgA) to that satellite. Edge users usually listen to the SSBs of two satellites, so they need to send access requests to both satellites. The user then accesses the satellite that receives the access response (MsgB).

[0073] See Figure 1 , Figure 1 This is a schematic diagram of an edge user access process according to an embodiment of this application. The specific steps are as follows:

[0074] Step 101: In response to receiving a notification from the second satellite and an access request from the edge user, perform service contention calculation; the notification is sent by the second satellite at the next interaction time node after receiving the access request from the edge user.

[0075] This embodiment takes a scenario where the first satellite receives a notification from the second satellite first, and then receives an access request from an edge user as an example; in this scenario, the first satellite performs the service contention calculation.

[0076] When the second satellite sends a notification to the first satellite, the notification is used to inform about two things:

[0077] The first item indicates that an access request has been received from an edge user;

[0078] The second item includes information used for service competition, such as user density, signal strength, and satellite load.

[0079] The embodiments of this application do not limit the specific process of service competition.

[0080] Step 102: Obtain the competition result of the service competition calculation, and notify the second satellite of the competition result at the next interaction time node.

[0081] Step 103: If the first satellite is determined to be the serving satellite of the edge user based on the competition result, then an access response is sent to the user terminal of the edge user.

[0082] After receiving the access response sent by the first satellite, the user terminal accesses the first satellite.

[0083] If the second satellite is determined to be the service satellite for the edge user based on the competition results, then the first satellite will not be connected to the edge user.

[0084] This embodiment allows for a comprehensive consideration of which satellite edge users should access, taking into account user density, signal strength, and satellite load, thereby improving the throughput of the satellite constellation system.

[0085] See Figure 2 , Figure 2 This is a schematic diagram of another edge user access process in an embodiment of this application. The specific steps are as follows:

[0086] Step 201: In response to an access request sent by an edge user, and since no notification has been received from the second satellite regarding the access request, the access request is identified.

[0087] In this embodiment, if the first satellite receives an access request from a new edge user before the second satellite, then the access request needs to be identified.

[0088] Step 202: If the access request is identified as originating from an edge signaling bit, a notification is sent to the second satellite sharing the edge signaling bit at the next interaction time node.

[0089] This notification serves to inform you of two things:

[0090] The first item indicates that an access request has been received from an edge user;

[0091] The second item includes information used for service competition, such as user density, signal strength, and satellite load.

[0092] In the application scenario of this embodiment, the second satellite performs service contention calculations and notifies the first satellite of the contention results.

[0093] Step 203: In response to the competition result sent by the second satellite, if the first satellite is determined to be the serving satellite of the edge user based on the competition result, an access response is sent to the user terminal of the edge user.

[0094] If the first satellite is determined to be the serving satellite for the edge user based on the competition results, then the second satellite will not be connected to that edge user.

[0095] This embodiment allows for a comprehensive consideration of which satellite edge users should access, taking into account user density, signal strength, and satellite load, thereby improving the throughput of the satellite constellation system.

[0096] Before the start of each subsequent scheduling cycle, it is necessary to determine whether there are edge users in the edge regions corresponding to the first and second satellites. If so, it is necessary to determine whether a compromise on the beam hopping pattern is required. The following section will explain... Figure 3 and Figure 4 The detailed process is given; if it is determined that there are no edge users in the edge areas corresponding to the first and second satellites, it is directly determined that there is no need to compromise on the beam hopping pattern, and the current beam hopping pattern service of the first satellite can be used directly in the next scheduling cycle.

[0097] See Figure 3 , Figure 3 This is a schematic flowchart of an inter-satellite beam skipping scheduling and coordination method according to an embodiment of this application. The specific steps are as follows:

[0098] Step 301: Before the start of the next scheduling cycle, in response to the presence of edge users in the overlapping area of ​​the service ranges of the first satellite and the second satellite, compare the edge user densities of the first satellite and the second satellite.

[0099] Edge users are users located at edge signaling positions, which are signaling positions located in the overlapping area of ​​the service range of the first and second satellites; edge user density is the number of users per unit area on an edge signaling position.

[0100] In each scheduling cycle, the first satellite and the second satellite will interact to obtain edge user density. Therefore, in each scheduling cycle, the first satellite can obtain the edge user density of the second satellite.

[0101] Step 302: If it is determined that the edge user density of the first satellite is low, then traverse the time slots of the next scheduling cycle; determine whether a compromise on the hopping beam pattern is needed.

[0102] If the edge user density of the second satellite is determined to be low based on the edge user density of the exchanged satellite, then the first satellite will not compromise on the beam hopping pattern. In the next scheduling cycle, the first satellite will provide service beaming with its single-satellite beam hopping pattern.

[0103] If it is determined that no compromise on beam hopping pattern is required, then the service beam pattern will be provided using the single-satellite beam hopping pattern of the first satellite.

[0104] Step 303: If it is determined that a compromise on the beam hopping pattern is required, then a compromise on the beam hopping pattern is performed based on the scheduling compromise algorithm of edge user density to obtain the compromised beam hopping pattern.

[0105] Step 304: In the next scheduling cycle, perform service beam hopping based on the compromised beam hopping pattern.

[0106] In one example, step 302 iterates through the time slots of the next scheduling cycle; determining whether a compromise on the hopping beam pattern is needed, including:

[0107] For each time slot traversed, determine whether there are edge service beams lit simultaneously in the first service beam set and the second service beam set; if so, determine that a compromise on the beam hopping pattern is required; otherwise, determine that no compromise on the beam hopping pattern is required; where edge service beams are service beams in the overlapping area of ​​the service range, the first service beam set is the set of service beams lit by the current beam hopping pattern of the first satellite, and the second service beam set is the set of service beams lit by the current beam hopping pattern of the second satellite.

[0108] In step 303, a scheduling compromise algorithm based on edge user density is used to compromise the beam hopping pattern, resulting in a compromised beam hopping pattern, including:

[0109] Calculate the set of hopping beam pattern grids where the first satellite collides within a time slot, and obtain the third service bit set; the third service bit set is the set that can be used for bit swapping.

[0110] In the third set of service positions, find the service position that is closest to the grid corresponding to the conflicting hop beam pattern and whose distance does not exceed a preset distance, and swap their positions to obtain a compromised hop beam pattern.

[0111] In one example, after swapping the positions, the following operation is performed:

[0112] Delete the swapped service waveforms from the third service set;

[0113] Obtain the third business wave position set, including:

[0114] If a third business set exists, then obtain the third business set;

[0115] If a third service set does not exist, then calculate the third service wave position set;

[0116] The third service wavelength set is determined based on the first service wavelength set, the fourth service wavelength set, and the service wavelength set corresponding to the time slots that cannot be used for service wavelength exchange. The time slots that cannot be used for service wavelength exchange are the time slots where the first satellite has no edge service wavelengths lit up while the second satellite has edge services lit up. The fourth service wavelength set is the set of service wavelengths of the first satellite corresponding to the edge users in the edge user set.

[0117] Among them, the time slots that cannot be used for service frequency switching are obtained through set operations and logical operations between the first service set, the second service set, the fourth service set, and the fifth service set; the fifth service frequency set is the set of service frequency slots of the second satellite corresponding to the edge users in the edge user set.

[0118] The third service slot set is determined based on the first service slot set, the fourth service set, and the service slot set corresponding to the time slots that cannot be used for service slot switching, including:

[0119] Delete the service bits that exist in the fourth service bit set in the first service bit set, as well as the service bit sets corresponding to time slots that cannot be used for service bit exchange. Use the first service bit set after deleting the service bits as the third service bit set.

[0120] In this embodiment, before the start of the next scheduling cycle, in response to the presence of edge users in the overlapping area of ​​the service ranges of the first and second satellites, and the satellite with low edge user density determining that a beam hopping pattern compromise is needed on that satellite side, a scheduling compromise algorithm based on edge user density is used to compromise the beam hopping pattern, resulting in a compromised beam hopping pattern. In the next scheduling cycle, service beam hopping is provided based on the compromised beam hopping pattern. This scheme, designed for services provided to edge users, avoids inter-satellite interference, thereby improving the overall throughput performance of the constellation system and the service experience for edge users.

[0121] See Figure 4 , Figure 4 This is a schematic diagram of another inter-satellite beam hopping scheduling and coordination method in an embodiment of this application. The specific steps are as follows:

[0122] Step 401: Before the start of the next scheduling cycle, in response to the presence of edge users in the overlapping area of ​​the service ranges of the first satellite and the second satellite, compare the edge user densities of the first satellite and the second satellite.

[0123] Step 402: If it is determined that the edge user density of the first satellite is low, then traverse the time slots of the next scheduling cycle.

[0124] If it is determined that the edge user density of the second satellite is low, the first satellite will not make a compromise judgment on the beam hopping pattern, and will directly provide service beam hopping based on the single-satellite beam hopping pattern of the first satellite.

[0125] Step 403: For the traversed time slots, determine whether there are edge service slots lit up simultaneously in the first service slot set and the second service slot set; if so, proceed to step 404; otherwise, proceed to step 406.

[0126] The first service bit set is the set of service bits illuminated by the current hopping beam pattern of the first satellite, and the second service bit set is the set of service bits illuminated by the current hopping beam pattern of the second satellite.

[0127] Step 404: Calculate the set of hopping beam pattern grids where the first satellite collides within the time slot, and obtain the third service beam set.

[0128] The third service frequency set is a set that can be used for frequency exchange; the specific implementation of obtaining the third service frequency set in this step can be as follows:

[0129] If a third business set exists, then obtain the third business set;

[0130] If a third service set does not exist, a third service wavelength set is calculated. The third service wavelength set is determined based on the first service wavelength set, the fourth service wavelength set, and the service wavelength set corresponding to the time slots that cannot be used for service wavelength exchange. The time slots that cannot be used for service wavelength exchange are the time slots where no edge service wavelengths are lit on the first satellite, while edge services are lit on the second satellite. The fourth service wavelength set is the set of service wavelengths of the first satellite corresponding to the edge users in the edge user set.

[0131] Among them, the time slots that cannot be used for service frequency switching are obtained through set operations and logical operations between the first service set, the second service set, the fourth service set, and the fifth service set; the fifth service frequency set is the set of service frequency slots of the second satellite corresponding to the edge users in the edge user set.

[0132] The third service slot set is determined based on the first service slot set, the fourth service set, and the service slot set corresponding to the time slots that cannot be used for service slot switching, including:

[0133] Delete the service bits that exist in the fourth service bit set in the first service bit set, as well as the service bit sets corresponding to time slots that cannot be used for service bit exchange. Use the first service bit set after deleting the service bits as the third service bit set.

[0134] If a third service set exists, it means that the third service set has been calculated and stored, and can be retrieved directly; if a third service set does not exist, it means that the third service set has not been calculated in this scheduling period, so the third service set should be calculated and retrieved.

[0135] Step 405: In the third service position set, find the service position that is closest to the location of the conflicting hop beam pattern grid in the corresponding set and the distance does not exceed the preset distance, and swap the positions. Delete the swapped service position in the third service set.

[0136] The preset distance here can be set according to actual needs, and this application embodiment does not impose any restrictions on it.

[0137] Step 406: Determine whether all time slots of the next scheduling cycle have been traversed. If yes, proceed to step 408; otherwise, proceed to step 407.

[0138] Step 407: Traverse the next time slot and execute step 403.

[0139] Step 408: Determine whether a compromise has been made to the hopping beam pattern. If yes, proceed to step 409; otherwise, proceed to step 410.

[0140] Step 409: Output the compromised beam hopping pattern for the first satellite, and provide service beam hopping based on this compromised beam hopping pattern in the next scheduling cycle. End this process.

[0141] Step 410: Output the single-satellite hop beam pattern of the first satellite, and provide service beam hop beam service based on the single-satellite hop beam pattern in the next scheduling cycle.

[0142] In this embodiment, before the start of the next scheduling cycle, in response to the presence of edge users in the overlapping service range of the first and second satellites, the satellite with low edge user density determines whether beam hopping pattern compromise is needed on that satellite side. If so, a beam hopping pattern compromise is performed based on a scheduling compromise algorithm according to edge user density, resulting in a compromised beam hopping pattern. In the next scheduling cycle, service beam hopping is performed based on the compromised beam hopping pattern. This implementation scheme can, on the one hand, balance inter-satellite load to adapt to the differentiated distribution of global users and service traffic, better improve system performance and optimize network resource utilization; on the other hand, it can suppress inter-satellite interference while minimizing the difference in beam hopping patterns before and after compromise, thereby increasing the throughput of satellite edge users and improving their service experience.

[0143] In this application embodiment, the interaction time node refers to the time node when a notification is sent after receiving an access request from an edge user or when the competition result is sent after the service competition calculation.

[0144] The following detailed explanation, using specific examples, illustrates the detailed process of the inter-satellite beam skipping scheduling and coordination method in this application.

[0145] After a user connects to the satellite, the satellite provides periodic beam-hopping service. During a fixed beam-hopping period, the satellite periodically collects user information within its coverage area, and an onboard beam scheduling algorithm calculates the beam-hopping pattern for the next scheduling period. The beam scheduling algorithm is based on a fully hotspot-driven beam-hopping mechanism. The algorithm input is determined by the user distribution and their service requests; the algorithm is computed onboard; and the optimization result is executed by the satellite's beam-hopping mechanism.

[0146] See Figure 5 , Figure 5 This is a schematic diagram of a satellite constellation system in an embodiment of this application. Figure 5 There is an overlapping service area between the coverage areas of satellite A and satellite B. Edge users A and B are users located at edge signaling positions, which are signaling positions located in the overlapping service areas of the first and second satellites. Edge users can simultaneously receive signaling beams from both satellites.

[0147] Each satellite performs its own independent beam hopping scheduling process, forming its own single-satellite beam hopping pattern.

[0148] See Figure 6 , Figure 6 This is a schematic diagram illustrating the joint operation of the signaling beam and the service beam in an embodiment of this application.

[0149] Taking edge user A as an example, assuming that edge user A first listens to the SSB from satellite A through the user terminal, then first sends MsgA to satellite A; then listens to the SSB from satellite B, and then sends MsgA to satellite B.

[0150] After receiving MsgA, satellite A identifies that MsgA comes from an edge signaling bit and sends a notification to satellite B, which shares the edge signaling bit, at the next interaction time node.

[0151] Satellite B receives a notification from Satellite A and receives MsgA from Edge User A.

[0152] Satellite B performs service contention calculations based on information such as user density, signal strength, and satellite load contained in the notification sent by Satellite A, and obtains the contention results.

[0153] Satellite B will notify Satellite A of the competition results it obtained at the next interaction time node.

[0154] Assuming the outcome of the competition determines that satellite A will serve edge user A, then satellite A sends MsgB to edge user A, and a connection is established between satellite A and edge user A.

[0155] After edge user A accesses satellite A, it can transmit services based on service beam hopping.

[0156] Each scheduling cycle between satellite A and satellite B will exchange edge user density; edge user density refers to the number of users per unit area on the edge signaling beam.

[0157] When transmitting services, it is necessary to transmit according to the beam skipping pattern.

[0158] Before each scheduling cycle begins, it is necessary to determine whether the hopping beam pattern to be used in the next scheduling cycle needs to be compromised.

[0159] Since there are edge users in the overlapping area of ​​the service ranges of satellite A and satellite B, it is assumed that the edge user density of satellite A is small, and then a judgment is made on whether satellite A should compromise on the beam skipping pattern.

[0160] Iterate through all time slots in the next scheduling cycle:

[0161] For any time slot traversed, obtain the first service wavelet set and the second service wavelet set; wherein, the first service wavelet set is the set of service wavelets illuminated by the current hopping beam pattern of satellite A, and the second service wavelet set is the set of service wavelets illuminated by the current hopping beam pattern of satellite B.

[0162] Satellite A determines whether an edge service spectrum is lit up simultaneously in both the first service spectrum set and the second service spectrum set.

[0163] If so, calculate the set of hop beam pattern lattice cells where the first satellite collides within the time slot, and obtain the third service bit set; the third service bit set is the set that can be used for bit swapping.

[0164] When obtaining the third business wave position set, if it already exists, obtain it directly;

[0165] If it does not exist, calculate and obtain the third business wave position set;

[0166] The third service slot set is determined based on the first service slot set, the fourth service slot set, and the service slot set corresponding to the time slots that cannot be used for service slot exchange. The time slots that cannot be used for service slot exchange are the time slots where the first satellite has no edge service slots lit up while the second satellite has edge services lit up. The fourth service slot set is the set of service slots of the first satellite corresponding to the edge users in the edge user set.

[0167] Among them, the time slots that cannot be used for service frequency switching are obtained through set operations and logical operations between the first service set, the second service set, the fourth service set, and the fifth service set; the fifth service frequency set is the set of service frequency slots of the second satellite corresponding to the edge users in the edge user set.

[0168] The third service slot set is determined based on the first service slot set, the fourth service set, and the service slot set corresponding to the time slots that cannot be used for service slot switching, including:

[0169] Delete the service bits that exist in the fourth service bit set in the first service bit set, as well as the service bit sets corresponding to time slots that cannot be used for service bit exchange. Use the first service bit set after deleting the service bits as the third service bit set.

[0170] Satellite A finds the service position in the third service position set that is closest to the location of the conflicting hop beam pattern grid and is within a preset distance, and swaps the positions, then deletes the swapped service position from the third service set.

[0171] See Figure 7 , Figure 7 This is a schematic diagram of beam skipping scheduling compromise in an embodiment of this application. Figure 7 In a time slot, if edge service wavelengths exist simultaneously in the first and second wavelength sets, satellite A finds a wavelength with no edge users, the closest distance to the conflicting wavelength, and a distance not exceeding a preset distance, as the wavelength to be used for switching, and the switching is performed.

[0172] If satellite A determines that edge service beams are not simultaneously lit in the first service beam set and the second service beam set (edge ​​service beams are lit only in the first service set, only in the second service set, or no edge service beams are lit in either the first or second service set); or, after the satellite performs a position swap, it determines whether all time slots of the next scheduling cycle have been traversed. If so, it outputs a beam skipping pattern; otherwise, it traverses the next time slot and performs the same judgment operation for the next time slot.

[0173] If a beam hopping pattern compromise is made in the next scheduling cycle, the output is the compromised beam hopping pattern; if no beam hopping pattern compromise is made, the output is the single-satellite beam hopping pattern.

[0174] At the start of the next scheduling cycle, service hopping beaming is performed based on the output beam hopping pattern.

[0175] At this point, the beam hopping pattern for the next scheduling cycle has been determined, and service beam hopping can be provided based on the determined beam hopping pattern.

[0176] See Figure 8 , Figure 8 This is a graph showing the relationship between downlink average SINR and maximum operating beam, as given in the embodiments of this application.

[0177] Figure 8 When simulating the relationship between downlink average SINR and maximum operating beamwidth, the following system data and application scenarios are used:

[0178] Considering a low-Earth orbit satellite hopping beam communication system with an orbital altitude of 508 km, the satellite is equipped with a noiseless phased array multi-beam antenna, capable of supporting up to N... b =16 to 32 beams operating simultaneously, with a total antenna power of P T=300W, each beam is a single carrier and the bandwidth is B W =40MHz, center frequency is f0=3GHz. The number of users below the satellite is N. u =400, and its service requests follow a Poisson distribution. Consider the gain provided by the beam to the beam center as G. b = 36.2 dBi, and in beam-hopping communication, the beam is directly directed at a single user. Assuming all user antennas are pointed towards the satellite, the receive gain is G. u = -2dBi, antenna noise temperature T n =150K, receiver noise figure F n =7dB. The satellite operates according to the beam scheduling period T. s =40ms provides users with periodically scheduled beam-hopping service, with the smallest scheduling granularity being a slot with a duration of T0 = 0.5ms, and T s =N s ·T0, N s =80. Considering a clear, cloudless sky, calm atmosphere, and no ionospheric scintillation, the temperature T... a =300K.

[0179] pass Figure 8 The results show that, under the same maximum working beam conditions, the average downlink SINR of inter-satellite joint scheduling is much greater than that of single-satellite scheduling in this embodiment of the application.

[0180] This embodiment discloses an edge user dual access request mechanism and a beam hopping pattern compromise implementation based on inter-satellite links. This implementation scheme can adapt to communication in highly dynamic scenarios and is sensitive to resource changes caused by high-speed satellite movement. It also improves communication capacity, reduces beam interference, and increases the average throughput of users. This scheme is also suitable for large-scale low-Earth orbit satellite constellation systems and has good robustness.

[0181] All of the above-mentioned optional technical solutions can be combined in any way to form optional embodiments of this disclosure, and will not be described in detail here.

[0182] Based on the same inventive concept, this application also provides an inter-satellite beam hopping scheduling and coordination device. It is applied to a first satellite, where the service areas of the first satellite and a second satellite overlap. See also... Figure 9 , Figure 9 This is a schematic diagram of the inter-satellite beam skipping scheduling and coordination device in an embodiment of this application. The device includes:

[0183] The comparison unit 901 is configured to compare the edge user densities of the first satellite and the second satellite before the start of the next scheduling cycle, in response to the presence of edge users in the overlapping area of ​​the service ranges of the first satellite and the second satellite; wherein, an edge user is a user located at an edge signaling position, an edge signaling position is a signaling position located in the overlapping area of ​​the service ranges of the first satellite and the second satellite, and the edge user density is the number of users per unit area on the edge signaling position;

[0184] The determination unit 902 is configured to perform the following actions: if it is determined that the edge user density of the first satellite is low, then traverse the time slots of the next scheduling cycle; determine whether a compromise on the hopping beam pattern is required.

[0185] The computing unit 903 is configured to execute a scheduling compromise algorithm based on edge user density to compromise the hopping beam pattern if it is determined that a compromise of the hopping beam pattern is required, and to obtain the compromised hopping beam pattern.

[0186] Service unit 904 is configured to perform service beam hopping service in the next scheduling cycle based on the compromised beam hopping pattern.

[0187] In another embodiment,

[0188] Service unit 904 is configured to perform service beam service based on the single-satellite hopping beam pattern of the first satellite if it is determined that the edge user density of the second satellite is low; and to perform service beam service based on the single-satellite hopping beam pattern of the first satellite if it is determined that a compromise on the hopping beam pattern is required.

[0189] In another embodiment,

[0190] The determining unit 902 is configured to traverse the time slots of the next scheduling cycle. When determining whether a compromise on the hopping beam pattern is required, for each traversed time slot, it determines whether an edge service beam is lit simultaneously in the first service beam set and the second service beam set. If so, it is determined that a compromise on the hopping beam pattern is required; otherwise, it is determined that a compromise on the hopping beam pattern is not required. Wherein, the edge service beam is the service beam located in the overlapping area of ​​the service range, the first service beam set is the set of service beams lit by the current hopping beam pattern of the first satellite, and the second service beam set is the set of service beams lit by the current hopping beam pattern of the second satellite.

[0191] The computing unit 903 is configured to execute a scheduling compromise algorithm based on edge user density to compromise the hopping beam pattern. When obtaining the compromised hopping beam pattern, it calculates the set of hopping beam pattern grids that conflict with the first satellite in the time slot and obtains the third service position set. In the third service position set, it finds the service position that is closest to the set corresponding to the conflicting hopping beam pattern grid and whose distance does not exceed a preset distance, and performs position swapping to obtain the compromised hopping beam pattern.

[0192] In another embodiment,

[0193] The calculation unit 903 is configured to, after performing a location exchange, delete the exchanged service wavelengths in the third service set; and obtain the third service wavelength set, which is a set of exchangeable service wavelengths; specifically, this includes: if a third service set exists, obtaining the third service set; if a third service set does not exist, calculating the third service wavelength set; the third service wavelength set is determined based on the first service wavelength set, the fourth service wavelength set, and the service wavelength set corresponding to the determined time slots that cannot be used for service wavelength exchange; the time slots that cannot be used for service wavelength exchange are the time slots where the first satellite has no edge service wavelengths lit while the second satellite has edge services lit; the fourth service wavelength set is the set of service wavelengths of the first satellite corresponding to the edge users in the edge user set.

[0194] In another embodiment,

[0195] The receiving unit 905 is configured to receive notifications sent by the second satellite and to receive access requests sent by edge users.

[0196] The computing unit 903 is configured to perform service contention calculations in response to receiving a notification sent by the second satellite and an access request sent by the edge user; the notification is sent by the second satellite at the next interaction time node after receiving the access request sent by the edge user;

[0197] Notification unit 906 is configured to further execute the competition result of the service competition calculation and notify the second satellite of the competition result at the next interaction time node;

[0198] The transmitting unit 907 is configured to send an access response to the user terminal of the edge user if the first satellite is determined to be the serving satellite of the edge user based on the competition result.

[0199] In another embodiment,

[0200] The identification unit 909 is configured to respond to an access request sent by an edge user and identify the access request if no notification is received from the second satellite.

[0201] Notification unit 906 is configured to send a notification to the second satellite sharing the edge signaling position at the next interaction time node if the access request is identified as originating from an edge signaling position.

[0202] The transmitting unit 907 is configured to further execute the competition result in response to the transmission of the second satellite, and if the competition result determines that the first satellite is the serving satellite of the edge user, then send an access response to the user terminal of the edge user.

[0203] In another embodiment,

[0204] The first satellite polls the users below the satellite using the signaling beam according to the pre-planned signaling position to obtain the information reported by the users below the satellite through the user terminal; the signaling beam and the service beam work together.

[0205] The units in the above embodiments can be integrated into one unit or deployed separately; they can be merged into one unit or further divided into multiple sub-units.

[0206] In another embodiment, an electronic device is also provided, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement an inter-satellite beam hopping scheduling coordination method.

[0207] In another embodiment, a computer-readable storage medium is also provided, on which computer instructions are stored, which, when executed by a processor, enable an inter-satellite beam hopping scheduling coordination method.

[0208] Figure 10 This is a schematic diagram of the physical structure of an electronic device provided in an embodiment of the present invention. Figure 10 As shown, the electronic device may include a processor 1010, a communications interface 1020, a memory 1030, and a communication bus 1040, wherein the processor 1010, the communications interface 1020, and the memory 1030 communicate with each other via the communication bus 1040. The processor 1010 can call logical instructions in the memory 1030 to execute the following methods:

[0209] Before the start of the next scheduling cycle, in response to the overlapping area of ​​the service ranges of the first and second satellites, there are edge users. The edge user density of the first and second satellites is compared. Edge users are users located at edge signaling positions, and edge signaling positions are signaling positions located in the overlapping area of ​​the service ranges of the first and second satellites. Edge user density is the number of users per unit area on the edge signaling position.

[0210] If it is determined that the edge user density of the first satellite is low, then iterate through the time slots of the next scheduling cycle; determine whether a compromise on the beam skipping pattern is needed.

[0211] If it is determined that a compromise in beam hopping pattern is required, then a compromise algorithm based on edge user density is used to compromise the beam hopping pattern to obtain the compromised beam hopping pattern.

[0212] In the next scheduling cycle, service beam hopping will be performed based on the compromised beam hopping pattern.

[0213] Furthermore, the logical instructions in the aforementioned memory 1030 can be implemented as software functional units and, when sold or used as independent products, can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, essentially, or the part that contributes to the prior art, or a portion of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods of the various embodiments of the present invention. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0214] The device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the modules can be selected to achieve the purpose of this embodiment according to actual needs. Those skilled in the art can understand and implement this without any creative effort.

[0215] Through the above description of the embodiments, those skilled in the art can clearly understand that each embodiment can be implemented by means of software plus necessary general-purpose hardware platforms, and of course, it can also be implemented by hardware. Based on this understanding, the above technical solutions, in essence or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, magnetic disk, optical disk, etc., and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute the methods described in the various embodiments or some parts of the embodiments.

[0216] The flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments disclosed in this application. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of code containing one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions indicated in the blocks may occur in a different order than those shown in the drawings. For example, two blocks shown connectedly may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in a block diagram or flowchart, and combinations of blocks in a block diagram or flowchart, may be implemented using a dedicated hardware-based system that performs the specified function or operation, or using a combination of dedicated hardware and computer instructions.

[0217] Those skilled in the art will understand that the features described in the various embodiments and / or claims disclosed in this application can be combined and / or combined in various ways, even if such combinations or combinations are not explicitly described in this application. In particular, without departing from the spirit and teachings of this application, the features described in the various embodiments and / or claims of this application can be combined and / or combined in various ways, and all such combinations and / or combinations fall within the scope of this application.

[0218] This document uses specific embodiments to illustrate the principles and implementation methods of the present invention. The descriptions of these embodiments are merely illustrative of the method and core concepts of the present invention and are not intended to limit this application. Those skilled in the art can make changes to the specific implementation methods and application scope based on the ideas, spirit, and principles of the present invention. Any modifications, equivalent substitutions, or improvements made should be included within the scope of protection of this application.

Claims

1. A method for inter-satellite beam hopping scheduling and coordination, applied to a first satellite, wherein the service ranges of the first satellite and a second satellite overlap, characterized in that, The method includes: Before the start of the next scheduling cycle, in response to the presence of edge users in the overlapping area of ​​the service ranges of the first satellite and the second satellite, the edge user densities of the first satellite and the second satellite are compared; the edge user is a user located at an edge signaling position, and the edge signaling position is a signaling position located in the overlapping area of ​​the service ranges; the edge user density is the number of users per unit area on the edge signaling position. If it is determined that the edge user density of the first satellite is low, then the time slots of the next scheduling cycle are traversed; it is determined whether a compromise on the beam hopping pattern is needed. If it is determined that a compromise in beam hopping pattern is required, then a compromise algorithm based on edge user density is used to compromise the beam hopping pattern to obtain the compromised beam hopping pattern. In the next scheduling cycle, service beam hopping will be provided based on the compromised beam hopping pattern. If it is determined that the edge user density of the second satellite is low, then the service beam service is provided based on the single-satellite hop beam pattern of the first satellite. If it is determined that no compromise on beam hopping pattern is required, then the service beaming service shall be provided based on the single-satellite beam hopping pattern of the first satellite.

2. The method according to claim 1, characterized in that, The time slot for traversing the next scheduling cycle; Determine whether compromises in beam skipping patterns are necessary, including: For each time slot traversed, determine whether an edge service beam is lit simultaneously in the first service beam set and the second service beam set; if so, determine that a compromise on the beam hopping pattern is required; otherwise, determine that no compromise on the beam hopping pattern is required; wherein, the edge service beam is a service beam located in the overlapping area of ​​the service range, the first service beam set is the set of service beams lit by the current beam hopping pattern of the first satellite, and the second service beam set is the set of service beams lit by the current beam hopping pattern of the second satellite; The scheduling compromise algorithm based on edge user density compromises the beam hopping pattern to obtain the compromised beam hopping pattern, including: Calculate the set of hopping beam pattern grids where the first satellite collides within the time slot, and obtain the third service bit set; the third service bit set is a set that can be used for bit swapping. In the third set of service positions, find the service position that is closest to the set corresponding to the conflicting hop beam pattern grid and whose distance does not exceed a preset distance, and swap their positions to obtain a compromised hop beam pattern.

3. The method according to claim 2, characterized in that, After the position exchange is performed, the method further includes: Delete the swapped service waveforms from the third service waveform set; The acquisition of the third service frequency set includes: If a third service frequency band set exists, then obtain the third service frequency band set; If a third service wavelength set does not exist, then the third service wavelength set is calculated. The third service wavelength set is determined based on the first service wavelength set, the fourth service wavelength set, and the service wavelength set corresponding to the determined time slots that cannot be used for service wavelength exchange. The time slots that cannot be used for service wavelength exchange are the time slots where no edge service wavelengths are lit on the first satellite, while edge services are lit on the second satellite. The fourth service wavelength set is the set of service wavelengths of the first satellite corresponding to edge users within the edge user set.

4. The method according to claim 1, characterized in that, The method further includes: In response to receiving a notification from the second satellite and an access request from the edge user, service contention calculation is performed; the notification is sent by the second satellite at the next interaction time node after receiving the access request from the edge user. Obtain the competition result of the service competition calculation, and notify the second satellite of the competition result at the next interaction time node; If the first satellite is determined to be the serving satellite of the edge user based on the competition result, an access response is sent to the user terminal of the edge user.

5. The method according to claim 1, wherein The method further includes: In response to an access request sent by an edge user, and provided that no notification has been received from the second satellite regarding the access request, the access request is identified; If the access request is identified as originating from an edge signaling bit, a notification is sent to the second satellite sharing the edge signaling bit at the next interaction time node. In response to the contention result sent by the second satellite, if the first satellite is determined to be the serving satellite of the edge user based on the contention result, an access response is sent to the user terminal of the edge user.

6. The method according to any one of claims 1-5, characterized in that, The method further includes: The first satellite polls the users below the satellite using the signaling beam according to the pre-planned signaling position to obtain the information reported by the users below the satellite through the user terminal; the signaling beam and the service beam work together.

7. A satellite-to-satellite beam hopping scheduling and coordination device, applied to a first satellite, wherein the service ranges of the first satellite and a second satellite overlap, characterized in that, The device includes: A comparison unit is configured to perform, before the start of the next scheduling cycle, a comparison between the edge user densities of the first satellite and the second satellite in response to the presence of edge users in the overlapping area of ​​the service ranges of the first satellite and the second satellite; wherein the edge users are users located at edge signaling positions, the edge signaling positions are signaling positions located in the overlapping area of ​​the service ranges of the first satellite and the second satellite, and the edge user density is the number of users per unit area on the edge signaling position; The determining unit is configured to perform the following actions: if it is determined that the edge user density of the first satellite is low, then traverse the time slots of the next scheduling cycle; determine whether a compromise on the hopping beam pattern is required. The computing unit is configured to execute a scheduling compromise algorithm based on edge user density to compromise the hopping beam pattern if it is determined that a compromise of the hopping beam pattern is required, and to obtain the compromised hopping beam pattern. The service unit is configured to perform service beam hopping services based on the compromised beam hopping pattern in the next scheduling cycle. The service unit is further configured to provide service beam services based on the single-satellite hopping beam pattern of the first satellite if it is determined that the edge user density of the second satellite is low; and to provide service beam services based on the single-satellite hopping beam pattern of the first satellite if it is determined that no compromise on the hopping beam pattern is required.

8. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the program, it implements the method as described in any one of claims 1-6.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that, When executed by a processor, the program implements the method described in any one of claims 1-6.

Images