A wave position scheduling method, device and storage medium

By determining the candidate wave bit set corresponding to its beam for each satellite in the satellite communication system and performing beam scheduling based on traffic indicators, the problems of large signaling overhead and inaccurate scheduling in the prior art are solved, and more efficient Beam Scheduling.

CN115865180BActive Publication Date: 2025-02-25CHINA SATELLITE NETWORK INNOVATION CO LTD
View PDF 1 Cites 0 Cited by

Patent Information

Application Number
CN202211528366.7
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-11-30
Publication Date
2025-02-25
Estimated Expiration
2042-11-30

AI Technical Summary

Technical Problem

The beam scheduling method based on signaling indication in the prior art has problems such as large signaling overhead and inaccurate scheduling in complex giant constellation systems.

Method used

By determining the candidate wave bit set corresponding to each beam it emits for each satellite, each candidate wave bit set contains multiple non-overlapping wave bits, and each beam is scheduled into the target schedule wave bit set based on traffic metrics. on one wave point.

Benefits of technology

Improve the accuracy of beam scheduling, save signaling overhead during wave bit scheduling, and effectively reduce the power consumption of satellites.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN115865180B_ABST
    Figure CN115865180B_ABST
Patent Text Reader

Abstract

The present application relates to the field of communication technology, and discloses a beam position scheduling method, device and storage medium. The method comprises: for each satellite in a satellite communication system, respectively determining a candidate beam position set of each beam emitted by the satellite, wherein each candidate beam position set includes a plurality of non-overlapping beam positions, and scheduling each beam to a beam position in a target scheduling beam position set based on a traffic volume index of each beam scheduled to each beam position in a target scheduling beam position set, wherein the target scheduling beam position set is determined based on the candidate beam position set, thereby improving the accuracy of beam scheduling, saving signaling overhead in the beam position scheduling process, and effectively reducing the power consumption of the satellite.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of communication technology and provides a wave position scheduling method, device and storage medium. Background Art

[0002] At present, with the development of space information network technology, more and more attention is paid to the development of satellite communications.

[0003] The existing NR standard supports beam scheduling based on beam indication, that is, the base station notifies the terminal that a specific physical downlink shared channel (PDSCH) or physical downlink control channel (PDCCH) uses the same beam as the configured reference signal. This beam indication is notified to the terminal through the downlink media access control address (MAC) signaling of the radio resource control (RRC) configuration and the transmission configuration indication (TCI). Each TCI includes information about a reference signal and can be associated with a specific downlink transmission, that is, the beam used for data transmission and the beam indicated by the TCI are quasi co-located (QCL). Typically, a terminal can configure up to 64 alternative TCI states.

[0004] The NR standard stipulates that there are a maximum of 64 SSB access beams and a maximum of 64 TCI-state candidate states. However, there are thousands of beam positions in a complex giant constellation system, and each beam has hundreds of candidate beam positions and states. If the scheduling of each beam is dynamically indicated by TCI, the signaling overhead involved is huge. In addition, the satellite is in a high-speed mobile state. Usually, when the scheduling signal is received, the satellite has moved out of its original beam position range. In summary, for complex giant constellation systems, the beam scheduling method based on signaling indication not only has a large signaling overhead, but also inaccurate scheduling. Summary of the invention

[0005] The embodiments of the present application provide a beam scheduling method, device, and storage medium, which are used to improve the accuracy of beam scheduling while saving signaling overhead in the beam scheduling process.

[0006] The specific technical solutions provided by this application are as follows:

[0007] In a first aspect, an embodiment of the present application provides a wave position scheduling method, including:

[0008] For each satellite in the satellite communication system, candidate wave position sets corresponding to each beam emitted by the satellite are determined respectively, wherein each candidate wave position set includes a plurality of non-overlapping wave positions;

[0009] Based on the traffic index of each beam scheduled to each beam position in the target scheduling beam position set, each beam is scheduled to a beam position in the target scheduling beam position set, wherein the target scheduling beam position set is determined based on the candidate beam position set.

[0010] Optionally, if the target scheduling wave position set is a candidate wave position set corresponding to the beam, then based on the traffic index of each beam scheduled to each wave position in the target scheduling wave position set, each beam is scheduled to a wave position in the target scheduling wave position set, including:

[0011] For each beam, perform the following operations:

[0012] Determine the traffic volume index of each beam position in a corresponding candidate beam position set for beam scheduling within a preset beam scheduling period;

[0013] Based on the obtained traffic volume indicators, the priority of each wave position is determined respectively;

[0014] In the current time slot, the beam is scheduled to the corresponding beam position with the highest priority in the candidate beam position set.

[0015] Optionally, after scheduling the beam to a beam position with the highest priority in a corresponding candidate beam position set in the current time slot, the method further includes:

[0016] In each time slot after the current time slot, the beam is sequentially scheduled to the remaining beam positions in the corresponding candidate beam position set with the priority from high to low.

[0017] Optionally, the method further comprises:

[0018] Establishing a first mapping relationship between the current time slot and a wave position with the highest priority, and establishing a second mapping relationship between each time slot after the current time slot and each remaining wave position in the candidate wave position set with the priority from high to low;

[0019] The first mapping relationship and the second mapping relationship are both sent to the satellite through an RRC command.

[0020] Optionally, if the target scheduling wave position set is the union of each candidate wave position set, then based on the traffic volume index of each beam scheduled to each wave position in the target scheduling wave position set, each beam is scheduled to a wave position in the target scheduling wave position set, including:

[0021] Based on the union of the candidate beam position sets, a target scheduling beam position set is obtained, and a scheduling scheme is determined in which each beam of the satellite is scheduled to each beam position in the target scheduling beam position set, wherein the beams and the beam positions in the scheduling scheme correspond one to one;

[0022] For each scheduling scheme, the traffic volume index of each beam scheduled to each beam position in the target scheduling beam position set is calculated within a preset beam scheduling period, and the sum of the traffic volume index corresponding to each scheduling scheme is determined;

[0023] Based on the traffic volume index and the maximum scheduling scheme, the beam is scheduled to a beam position in the target scheduling beam position set in the current time slot.

[0024] Optionally, if the target scheduling wave position set is a candidate wave position set corresponding to the beam, then based on the traffic index of each beam scheduled to each wave position in the target scheduling wave position set, each beam is scheduled to a wave position in the target scheduling wave position set, including:

[0025] Determine a scheduling scheme in which each beam of the satellite is scheduled to each wave position in the target scheduling wave position set, wherein the beams and the wave positions correspond one to one in the scheduling scheme;

[0026] For each scheduling scheme, the traffic volume index of each beam scheduled to each beam position in the target scheduling beam position set is calculated within a preset beam scheduling period, and the sum of the traffic volume index corresponding to each scheduling scheme is determined;

[0027] Based on the traffic volume index and the maximum scheduling scheme, the beam is scheduled to a beam position in the target scheduling beam position set in the current time slot.

[0028] Optionally, a scheduling scheme is determined by a deep learning Q-learning algorithm, including:

[0029] Convert each beam into a corresponding intelligent agent respectively;

[0030] Determine a scheduling action set corresponding to each agent; wherein the scheduling action set includes multiple scheduling actions, the number of scheduling actions is the same as the number of wave positions in the target scheduling wave position set, and different scheduling actions represent beam scheduling to different wave positions;

[0031] Generate multiple reward functions based on the environmental impact caused by each agent selecting a scheduling action from the scheduling action set;

[0032] Determine the scheduling plan based on the reward function with the largest value.

[0033] Optionally, the agent selects a dispatch action by:

[0034] If the scheduling random number is less than the preset greed coefficient, then any scheduling action from the scheduling action set is selected as the scheduling action of the agent;

[0035] Otherwise, the scheduling action corresponding to the largest Q value is selected as the scheduling action of the agent, where the Q value is calculated by the deep learning Q-Learning algorithm.

[0036] Optionally, for each satellite in the satellite communication system, a candidate beam position set of each beam emitted by the satellite is determined respectively, including:

[0037] For each satellite in the satellite communication system, the coverage range corresponding to each satellite is determined respectively;

[0038] Sorting each non-overlapping wave position within the coverage range to obtain a plurality of sorted wave positions;

[0039] The sorted multiple wave positions are divided according to preset rules to obtain multiple candidate wave position sets.

[0040] In a second aspect, an embodiment of the present application further provides a wave position scheduling device, including:

[0041] A determination unit, configured to determine, for each satellite in the satellite communication system, candidate wave position sets corresponding to each beam emitted by the satellite, wherein each candidate wave position set includes a plurality of non-overlapping wave positions;

[0042] The scheduling unit is used to schedule each beam to a beam in the target scheduling beam set based on the traffic index of each beam scheduled to each beam in the target scheduling beam set, wherein the target scheduling beam set is determined based on the candidate beam set.

[0043] Optionally, if the target scheduling wave position set is a candidate wave position set corresponding to the beam, then based on the traffic index of each beam scheduled to each wave position in the target scheduling wave position set, each beam is respectively scheduled to a wave position in the target scheduling wave position set, and the scheduling unit is used to:

[0044] For each beam, perform the following operations:

[0045] Determine the traffic volume index of each beam position in a corresponding candidate beam position set for beam scheduling within a preset beam scheduling period;

[0046] Based on the obtained traffic volume indicators, the priority of each wave position is determined respectively;

[0047] In the current time slot, the beam is scheduled to the corresponding beam position with the highest priority in the candidate beam position set.

[0048] Optionally, after scheduling the beam to a beam position with the highest priority in a corresponding candidate beam position set in the current time slot, the method further includes:

[0049] In each time slot after the current time slot, the beam is sequentially scheduled to the remaining beam positions in the corresponding candidate beam position set with the priority from high to low.

[0050] Optionally, it also includes:

[0051] Establishing a first mapping relationship between the current time slot and a wave position with the highest priority, and establishing a second mapping relationship between each time slot after the current time slot and each remaining wave position in the candidate wave position set with the priority from high to low;

[0052] The first mapping relationship and the second mapping relationship are both sent to the satellite through an RRC command.

[0053] Optionally, if the target scheduling wave position set is the union of each candidate wave position set, then based on the traffic volume index of each beam scheduled to each wave position in the target scheduling wave position set, each beam is scheduled to a wave position in the target scheduling wave position set, and the scheduling unit is used to:

[0054] Based on the union of the candidate beam position sets, a target scheduling beam position set is obtained, and a scheduling scheme is determined in which each beam of the satellite is scheduled to each beam position in the target scheduling beam position set, wherein the beams and the beam positions in the scheduling scheme correspond one to one;

[0055] For each scheduling scheme, the traffic volume index of each beam scheduled to each beam position in the target scheduling beam position set is calculated within a preset beam scheduling period, and the sum of the traffic volume index corresponding to each scheduling scheme is determined;

[0056] Based on the traffic volume index and the maximum scheduling scheme, the beam is scheduled to a beam position in the target scheduling beam position set in the current time slot.

[0057] Optionally, if the target scheduling wave position set is a candidate wave position set corresponding to the beam, then based on the traffic index of each beam scheduled to each wave position in the target scheduling wave position set, each beam is respectively scheduled to a wave position in the target scheduling wave position set, and the scheduling unit is used to:

[0058] Determine a scheduling scheme in which each beam of the satellite is scheduled to each wave position in the target scheduling wave position set, wherein the beams and the wave positions correspond one to one in the scheduling scheme;

[0059] For each scheduling scheme, the traffic volume index of each beam scheduled to each beam position in the target scheduling beam position set is calculated within a preset beam scheduling period, and the sum of the traffic volume index corresponding to each scheduling scheme is determined;

[0060] Based on the traffic volume index and the maximum scheduling scheme, the beam is scheduled to a beam position in the target scheduling beam position set in the current time slot.

[0061] Optionally, a scheduling scheme is determined by a deep learning Q-learning algorithm, including:

[0062] Convert each beam into a corresponding intelligent agent respectively;

[0063] Determine a scheduling action set corresponding to each agent; wherein the scheduling action set includes multiple scheduling actions, the number of scheduling actions is the same as the number of wave positions in the target scheduling wave position set, and different scheduling actions represent beam scheduling to different wave positions;

[0064] Generate multiple reward functions based on the environmental impact caused by each agent selecting a scheduling action from the scheduling action set;

[0065] Determine the scheduling plan based on the reward function with the largest value.

[0066] Optionally, the agent selects a dispatch action by:

[0067] If the scheduling random number is less than the preset greed coefficient, then any scheduling action from the scheduling action set is selected as the scheduling action of the agent;

[0068] Otherwise, the scheduling action corresponding to the largest Q value is selected as the scheduling action of the agent, where the Q value is calculated by the deep learning Q-Learning algorithm.

[0069] Optionally, for each satellite in the satellite communication system, a candidate beam position set of each beam emitted by the satellite is determined respectively, and the determination unit is used to:

[0070] For each satellite in the satellite communication system, the coverage range corresponding to each satellite is determined respectively;

[0071] Sorting each non-overlapping wave position within the coverage range to obtain a plurality of sorted wave positions;

[0072] The sorted multiple wave positions are divided according to preset rules to obtain multiple candidate wave position sets.

[0073] In a third aspect, a base station includes:

[0074] A memory for storing executable instructions;

[0075] A processor is used to read and execute executable instructions stored in a memory to implement any method as described in the first aspect.

[0076] In a fourth aspect, a computer-readable storage medium is provided. When instructions in the storage medium are executed by a processor, the processor is enabled to execute any method described in the first aspect.

[0077] The beneficial effects of this application are as follows:

[0078] To summarize, in an embodiment of the present application, a beam scheduling method, device and storage medium are provided, the method comprising: for each satellite in a satellite communication system, determining a candidate beam set for each beam emitted by the satellite, each candidate beam set including multiple non-overlapping beams, and scheduling each beam to a beam in a target scheduling beam set based on a traffic index of each beam scheduled to each beam in a target scheduling beam set, wherein the target scheduling beam set is determined based on the candidate beam set, thereby improving the accuracy of beam scheduling, saving signaling overhead in the beam scheduling process, and effectively reducing the power consumption of the satellite.

[0079] Other features and advantages of the present application will be described in the following description, and partly become apparent from the description, or be understood by practicing the present application. The purpose and other advantages of the present application can be realized and obtained by the structures specifically pointed out in the written description, claims, and drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0080] The drawings described herein are used to provide a further understanding of the present application and constitute a part of the present application. The illustrative embodiments of the present application and their descriptions are used to explain the present application and do not constitute an improper limitation on the present application. In the drawings:

[0081] Figure 1 It is a schematic diagram of a single satellite corresponding to different wave positions in different time slots in the prior art;

[0082] Figure 2 A schematic diagram of a single satellite emitting k beams in the prior art;

[0083] Figure 3 This is a schematic diagram of a system architecture for scheduling wave positions in an embodiment of the present application;

[0084] Figure 4 A schematic diagram of a flow chart of a wave position scheduling method in an embodiment of the present application;

[0085] Figure 5 A schematic diagram of a process for determining a candidate wave position set corresponding to a beam in an embodiment of the present application;

[0086] Figure 6 This is a schematic diagram of a first process of scheduling each beam to a beam position in a target scheduling beam position set in an embodiment of the present application;

[0087] Figure 7 This is a schematic diagram of a second process of scheduling each beam to a beam position in a target scheduling beam position set in an embodiment of the present application;

[0088] Figure 8 This is a schematic diagram of a third process of scheduling each beam to a beam position in a target scheduling beam position set in an embodiment of the present application;

[0089] Fig. 9 This is a schematic diagram of the logical architecture of a wave position scheduling device in an embodiment of the present application;

[0090] Fig.10 A schematic diagram of the physical architecture of a base station in an embodiment of the present application. DETAILED DESCRIPTION

[0091] In order to make the purpose, technical solution and advantages of the embodiments of the present application clearer, the technical solution of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are part of the embodiments of the technical solution of the present application, rather than all of the embodiments. Based on the embodiments recorded in the application documents, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the technical solution of the present application.

[0092] The terms "first", "second", etc. in the specification and claims of the present invention and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the numbers used in this way can be interchanged where appropriate, so that the embodiments of the present invention described herein can be implemented using sequences other than those illustrated or described herein.

[0093] Compared with the base stations of ground cellular systems, the coverage area of ​​a single satellite in a satellite communication system is large, the concentration density of terminal service requests in the coverage area is large, and the service carrying capacity of a single satellite is high. Figure 1 and Figure 2 As shown, a single satellite can send out multiple beams at the same time, each beam can cover thousands of wave positions, and each beam needs to be scheduled back and forth on different wave positions within its coverage area in different time slots.

[0094] The preferred implementation modes of the present application are described in detail below with reference to the accompanying drawings.

[0095] See also Figure 3 As shown, in the embodiment of the present application, the system includes at least one base station and multiple satellites. Figure 1In the figure, satellite 1, satellite 2 and satellite n are used as examples to represent satellites that emit beams. It should be noted that the satellite 1, satellite 2 or satellite n corresponds to multiple beams, and each beam is only scheduled to one beam position at the same time. It should be noted that the base station can be a satellite-borne base station set on a satellite, or a ground base station set on the ground.

[0096] In the embodiment of the present application, a wave position scheduling method is implemented, which is mainly performed on the base station side and is described in detail below.

[0097] See also Figure 4 As shown, in the embodiment of the present application, a specific process of wave position scheduling is as follows:

[0098] Step 201: for each satellite in the satellite communication system, determine the candidate wavelet sets corresponding to the beams emitted by the satellite, respectively, wherein each candidate wavelet set includes a plurality of non-overlapping wavelets.

[0099] Considering that there are multiple satellites in a satellite communication system, usually, a satellite can generate and send out multiple beams at the same time, and the multiple beams sent out by the satellite can cover N wave positions together. To this end, it is necessary to construct a corresponding candidate wave position set for a single beam. It should be noted that if two wave positions overlap in space, then different beams cannot be mapped to the overlapping wave positions at the same time. Therefore, in the embodiment of the present application, it is necessary to ensure that the wave positions in each candidate wave position set are valid wave positions that do not overlap.

[0100] For each satellite in the satellite communication system, the candidate beam position set of each beam emitted by the satellite is determined respectively, see Figure 5 As shown, including:

[0101] Step 2011: For each satellite in the satellite communication system, determine the coverage range corresponding to each satellite.

[0102] Since different satellites have different locations and importance in the satellite communication system, during the implementation process, in order to ensure that the wave positions in the candidate wave position set corresponding to each satellite do not overlap, it is necessary to first determine the coverage range corresponding to each satellite. Preferably, the above coverage range is divided according to the spatial position of the satellite. Obviously, each coverage range after division includes multiple wave positions.

[0103] Step 2012: sorting the non-overlapping wave positions within the coverage area to obtain a plurality of sorted wave positions.

[0104] Since all the wave positions corresponding to all satellites in the satellite communication system are mixed together, first, it is possible to check whether the wave positions within the coverage range of all satellites overlap. After determining that two or more wave positions overlap, only one of the overlapping wave positions is retained, and the remaining overlapping wave positions are eliminated. The non-overlapping wave positions within the above-mentioned coverage ranges are sorted to obtain a plurality of sorted wave positions. The principles of the above-mentioned sorting can be pre-set, including but not limited to importance, absolute distance from the satellite, etc.

[0105] Step 2013: Divide the sorted wave positions according to a preset rule to obtain a plurality of candidate wave position sets.

[0106] After determining the coverage ranges corresponding to each satellite and the order of all wave positions, during the implementation process, the sorted wave positions are divided according to preset rules to obtain multiple candidate wave position sets. It should be noted that the preset rules include but are not limited to the following methods: Method 1: dividing according to a preset number value or evenly distributing according to the total number of sorted wave positions, so that the number of wave positions in each candidate wave position set can be the same or different; Method 2: mapping different wave positions to different candidate wave position sets according to the NR protocol.

[0107] Step 202: Based on the traffic index of each beam scheduled to each beam position in the target scheduling beam position set, each beam is scheduled to a beam position in the target scheduling beam position set, wherein the target scheduling beam position set is determined based on the candidate beam position set.

[0108] During the implementation process, after determining the candidate wavelet set corresponding to a beam, after calculating the traffic index of each wavelet on the corresponding candidate wavelet set to which the above-mentioned beam is scheduled one by one, a wavelet in the corresponding candidate wavelet set (for example, the one with the highest traffic index) is selected and the beam is scheduled to the above-mentioned wavelet.

[0109] It should be noted that the above traffic indicators include some or all of the following: power consumption, interference, throughput, delay, channel quality, quality of service (QoS), and density of terminals within the coverage area. In the specific implementation process, one or more of them can be selected as the means of wave position.

[0110] In the first embodiment, if the target scheduling beam position set is a candidate beam position set corresponding to the beam, then based on the traffic index of each beam scheduled to each beam position in the target scheduling beam position set, each beam is scheduled to a beam position in the target scheduling beam position set, including:

[0111] In the implementation process, when the above-mentioned target scheduling beam position set is a candidate beam position set corresponding to the beam, refer to Figure 6 As shown, for each beam, the following operations are performed respectively:

[0112] Step 2021: within a preset beam scheduling period, determine the traffic index of each beam position in a corresponding candidate beam position set to be scheduled to the beam.

[0113] Taking into account that the above-mentioned traffic volume indicators change in real time, in order to more accurately determine the corresponding wave position of the beam scheduled in the current time slot, the implementation process will be within the preset beam scheduling period. Usually, the above-mentioned preset beam scheduling period is a period of time including the current time slot. In this way, within the limited time period, the traffic volume indicators of the beam scheduled to each wave position in the corresponding candidate wave position set are determined one by one.

[0114] Step 2022: Based on the obtained traffic volume indicators, the priority of each wave position is determined respectively.

[0115] Example 1: Assume that the above-mentioned traffic volume indicator is throughput, and assume that the number of wavelets in the corresponding candidate wavelet set is 100. Then calculate the throughput generated by beam scheduling to the above-mentioned 100 wavelets respectively, so as to obtain 100 throughput values, and sort the above-mentioned 100 throughput values ​​in descending order, and obtain the priority of the above-mentioned 100 wavelets accordingly.

[0116] Step 2023: Schedule the beam to a beam position with the highest priority in a corresponding candidate beam position set in the current time slot.

[0117] During the implementation process, after determining the highest priority beam position, the beam in the current time slot is scheduled to the beam position with the highest priority in the corresponding candidate beam position set. Still using the above example 1 as an example, after determining the beam position with the largest throughput value, the beam is scheduled to the beam position with the largest throughput value in the current time slot. It should be noted that the scheduling scope of the above beam is limited to the candidate beam position set corresponding to the beam.

[0118] Since a subframe usually includes multiple time slots during the communication process, and there are usually multiple time slots after the current time slot, after scheduling the beam to the highest priority beam position in the corresponding candidate beam position set in the current time slot, it also includes:

[0119] In each time slot after the current time slot, the beam is sequentially scheduled to the remaining beam positions in the corresponding candidate beam position set with the priority from high to low.

[0120] It should be noted that during the communication process, each time slot after the current time slot can also be scheduled to the highest priority wave position in the corresponding candidate wave position set. However, in order to save computing overhead, after determining the priority of each wave position in the candidate wave position set based on the traffic index, the beams of the same subframe in each time slot after the current time slot can be scheduled to the remaining wave positions in the corresponding candidate wave position set from high to low priority. Generally, the earlier the time slot, the higher the priority of the corresponding wave position.

[0121] In addition, in order to enable each satellite to quickly and accurately determine the beam position to be scheduled, the method in the embodiment of the present application also includes directly configuring the beam and the corresponding beam position to be scheduled to the satellite in a semi-static configuration manner, specifically including:

[0122] (1) A first mapping relationship is established between the current time slot and a wave position with the highest priority, and a second mapping relationship is established between each time slot after the current time slot and each wave position in the candidate wave position set with the priority from high to low.

[0123] During the implementation process, after determining the priority of each beam position in the candidate beam position set based on the traffic volume index, a mapping relationship between time slots and beam positions as shown in Table 1 is established based on the priority. Specifically, a mapping relationship is established between the beam corresponding to the current time slot of the satellite and the beam position with the highest priority, that is, the first mapping relationship. A mapping relationship is established between the beams corresponding to the time slots after the current time slot and the remaining beam positions with the highest priority from high to low, that is, the second mapping relationship.

[0124] Table 1

[0125] Beam The priority number of the wave position Beam 1 1-59 Beam 2 60-130 Beam... … Beam n 1001-1400

[0126] (2) The first mapping relationship and the second mapping relationship are both sent to the satellite through an RRC command.

[0127] During implementation, after the first mapping relationship and the second mapping relationship are determined, the first mapping relationship and the second mapping relationship are sent to the satellite through an RRC command to achieve semi-static configuration.

[0128] Taking into account that the satellite communication system in which the satellite is located is an integrated system, each satellite will also operate in the satellite communication system. Based on this, in another embodiment, the scheduling status of the beam emitted by a certain satellite can be determined based on all beam positions.

[0129] Specifically, in the second embodiment, if the target scheduling beam position set is the union of each candidate beam position set, then based on the traffic volume index of each beam scheduled to each beam position in the target scheduling beam position set, each beam is scheduled to a beam position in the target scheduling beam position set. That is, in the implementation process, when the target scheduling beam position set is the union of each candidate beam position set, refer to Figure 7 As shown, including:

[0130] Step 2021': based on the union of the candidate wave position sets, a target scheduling wave position set is obtained, and a scheduling scheme is determined for scheduling each beam of the satellite to each wave position in the target scheduling wave position set, wherein the beams and wave positions in the scheduling scheme correspond one to one.

[0131] During the implementation, the target scheduling wave position set is obtained by taking the union operation of the wave positions in each candidate wave position set. Assuming that the total number of all wave positions in the target scheduling wave position set obtained by taking the union of all candidate wave position sets is N, then there are N options for scheduling the beam emitted by a satellite to the wave position. When there are M satellites that need to schedule the wave position, there are N*M scheduling schemes for determining that each beam of the satellite is scheduled to each wave position in all candidate wave position sets. It should be noted that in each scheduling scheme, there is a one-to-one correspondence between the beam and the wave position to be scheduled.

[0132] Step 2022': for each scheduling scheme, the traffic index of each beam scheduled to each beam position in the target scheduling beam position set is calculated within the preset beam scheduling period, and the sum of the traffic index corresponding to each scheduling scheme is determined.

[0133] Considering that the beams to be scheduled to the target scheduling beam position set, that is, the beam positions in each candidate beam position set are different, the corresponding traffic indicators are also different. During the implementation process, the scheduling scheme with the best traffic indicator will be selected to determine the actual beam positions to be scheduled by each satellite. Similarly, the traffic indicators here also include one or more of: power consumption, interference, throughput, delay, channel quality, QoS, density of terminals within the coverage area, etc.

[0134] During the implementation process, in order to determine the optimal scheduling scheme for the above-mentioned traffic volume indicators, for each scheduling scheme, the traffic volume indicator of the beam corresponding to each satellite scheduled to any one of the above-mentioned target scheduling wave position set will be calculated within the preset beam scheduling period, and the sum of the traffic volume indicators generated by all beam scheduling will be calculated within the above-mentioned preset beam scheduling period, which is the sum of the traffic volume indicators corresponding to this scheduling scheme.

[0135] It should be noted that the above-mentioned preset beam scheduling period is set to ensure the effectiveness of beam scheduling of each satellite in the satellite communication system to a certain beam position.

[0136] Step 2023': Based on the traffic volume index and the maximum scheduling scheme, schedule the beam to a beam position in the target scheduling beam position set in the current time slot.

[0137] During the implementation process, after determining the scheduling scheme with the largest sum of business volume indicators, the beams emitted by each satellite in the satellite communication system in the current time slot can be scheduled to a beam position in the target scheduling beam position set indicated by the scheduling scheme according to the instructions of the scheduling scheme. In this embodiment, the correspondence between the candidate beam position set and the satellite is dynamic.

[0138] In the third embodiment, if the target scheduling wave position set is a candidate wave position set corresponding to the beam, then based on the traffic volume index of each beam scheduled to each wave position in the target scheduling wave position set, each beam is scheduled to a wave position in the target scheduling wave position set, that is, in the implementation process, when the above-mentioned target scheduling wave position set is the union of each candidate wave position set, refer to Figure 8 As shown, including:

[0139] Step 2021": determine a scheduling scheme in which each beam of the satellite is scheduled to each wave position in the target scheduling wave position set, wherein the beams and wave positions in the scheduling scheme correspond one to one.

[0140] In the case where the target scheduling beam position set is a candidate beam position set corresponding to the beam, assuming that the total number of all beam positions in the corresponding candidate beam position set is L (obviously, L is less than N), then there are L options for scheduling the beam sent by a satellite to the beam position. When there are M satellites that need to schedule beam positions, there are L*M scheduling schemes for determining that each beam of the satellite is scheduled to each beam position in the candidate beam position set. It should be noted that in each scheduling scheme, there is a one-to-one correspondence between the beam and the beam position to be scheduled.

[0141] Step 2022": For each scheduling scheme, the traffic index of each beam scheduled to each beam position in the target scheduling beam position set is calculated within the preset beam scheduling period, and the sum of the traffic index corresponding to each scheduling scheme is determined.

[0142] Considering that the beams to be scheduled to different positions in the target scheduling position set have different corresponding traffic indicators, during the implementation process, the scheduling scheme with the best traffic indicator will be selected to determine the actual scheduling position of each satellite. Similarly, the traffic indicators here also include one or more of: power consumption, interference, throughput, delay, channel quality, QoS, density of terminals within the coverage area, etc.

[0143] During the implementation process, in order to determine the optimal scheduling scheme for the above-mentioned traffic volume indicators, for each scheduling scheme, the traffic volume indicator of the beam corresponding to each satellite scheduled to any one of the above-mentioned target scheduling wave position set will be calculated within the preset beam scheduling period, and the sum of the traffic volume indicators generated by all beam scheduling will be calculated within the above-mentioned preset beam scheduling period, which is the sum of the traffic volume indicators corresponding to this scheduling scheme.

[0144] Similarly, the above-mentioned preset beam scheduling period is set to ensure the effectiveness of scheduling the beam of each satellite in the satellite communication system to a certain beam position.

[0145] Step 2023": Based on the traffic volume index and the maximum scheduling scheme, the beam is scheduled to a beam position in the target scheduling beam position set in the current time slot.

[0146] During the implementation process, after determining the scheduling scheme with the largest sum of business volume indicators, the beams emitted by each satellite in the satellite communication system in the current time slot can be scheduled to a beam position in the target scheduling beam position set indicated by the scheduling scheme according to the instructions of the scheduling scheme.

[0147] Since the calculation process of determining whether the sum of the traffic volume indicators is the largest scheduling solution is very cumbersome, during the implementation process, the scheduling solution is determined by the deep learning Q-learning algorithm, which specifically includes:

[0148] First of all, it should be introduced that the candidate wave position set corresponding to the k-th beam can be expressed as:

[0149] Among them, N T =CS k =N S +1 indicates the total number of wave positions in the candidate wave position set.

[0150] Assuming that the traffic volume maximization of the system traffic volume is taken as the criterion, the system traffic volume of beam k at the current wave position to be scheduled can be expressed as:

[0151] r k =B*log 2 (1+θ k )

[0152] The above θ k is the signal-to-noise ratio of the current satellite signal, and B is the current channel bandwidth.

[0153] Furthermore, the above system traffic is the sum of the traffic of all K beams, and the optimization function can be expressed as: The value range of k is 1≤k≤K. In this way, the problem is transformed into the optimal beam position selection problem under K parallel beams.

[0154] (1) Convert each beam into the corresponding intelligent agent.

[0155] During the implementation process, in order to quantify the scheduling of each beam, each beam is converted into a corresponding intelligent agent. That is, the K beam scheduling in the satellite communication system is taken as an intelligent agent, and the beam position selection of each beam is taken as an action. This problem can be converted into a problem of solving the joint optimal action of K intelligent agents.

[0156] (2) Determine a scheduling action set corresponding to each intelligent agent; wherein the scheduling action set includes multiple scheduling actions, the number of scheduling actions is the same as the number of wave positions in the target scheduling wave position set, and different scheduling actions represent beam scheduling to different wave positions.

[0157] Since the wave position scheduled by the beam is uncertain, when there are n schedulable wave positions, the corresponding scheduling actions of the beam are also n. In this way, each intelligent agent has a corresponding set of scheduling actions. It should be noted that different scheduling actions represent the scheduling of the beam to different wave positions.

[0158] For example, taking the kth agent as an example, its action set is defined as Total N T actions, among which V kl (1≤l≤N T ) indicates that the kth beam selects its candidate wave position set CS k The lth wave position in is scheduled.

[0159] Specifically, the agent selects the scheduling action through the following methods:

[0160] Case 1: If the scheduling random number is less than the preset greedy coefficient, then any scheduling action from the scheduling action set is selected as the scheduling action of the agent.

[0161] After the agent obtains the reward function, it will update the Q value table. For the Q-learning algorithm of multiple agents, the Q-Learning algorithm in deep learning will only update when the new Q value is greater than the current Q value, otherwise the Q value remains unchanged. Since the single environment state does not change, that is,

[0162]

[0163] Among them, Q t is the Q value at the current moment, Q t+1 is the Q value at the next moment, It is the sum of all business volume indicators.

[0164] Action selection criteria: After completing the Q value update, each agent must select the next action according to the action selection criteria. Here, the ε greedy strategy is used as the action selection criterion. During the implementation process, the scheduling random number x is generated k ∈[0,1], and then generate the scheduling random number x k Compared with the predefined greed coefficient ε∈[0,1], if x k <ε, then from V k Select one of them as the next scheduling action.

[0165] Case 2: Otherwise, that is, when the scheduling random number is not less than the preset greedy coefficient, the scheduling action corresponding to the largest Q value is selected as the scheduling action of the agent, where the Q value is calculated by the deep learning Q-Learning algorithm.

[0166] Similarly, based on the above action selection criteria, during the implementation process, when the scheduling random number is not less than the preset greedy coefficient, the scheduling action corresponding to the largest Q value is selected as the scheduling action of the agent, that is, the action corresponding to the largest Q value is selected as the next scheduling action of the agent.

[0167] (3) Generate multiple reward functions based on the environmental impact caused by each agent selecting a scheduling action from the scheduling action set.

[0168] During the implementation process, a single-state environment is set, that is, the optimization problem does not involve changes in the environment state. The environment state does not change during the Q-Learning process, but the reward function value will change with the action of the intelligent agent and cause the Q-value table to be updated.

[0169] It should be noted that the above reward function is defined as: after the agent selects an action from its own action set and executes it, it will have an impact on the environment. The environment will inform the agent of the quality of its selected action through certain feedback, which is usually defined as the reward function.

[0170] (4) Determine the scheduling plan based on the reward function with the largest value.

[0171] The optimization goal of this system is to maximize the system traffic. Therefore, the reward function is defined as the sum of the system traffic obtained after K beams are scheduled in parallel, that is,

[0172]

[0173] When the reward function is large, the currently selected scheduling beam position is good; otherwise, the current beam position is not the optimal scheduling solution. In addition, the above process will continue to iterate until the Q value converges to obtain the optimal beam position scheduling solution for K beams in parallel.

[0174] Based on the same inventive concept, refer to Fig. 9 As shown, an embodiment of the present application provides a wave position scheduling device, including:

[0175] The determining unit 901 is used to determine, for each satellite in the satellite communication system, candidate beam position sets corresponding to each beam emitted by the satellite, wherein each candidate beam position set includes a plurality of non-overlapping beam positions;

[0176] The scheduling unit 902 is used to schedule each beam to a beam in the target scheduling beam set based on the traffic index of each beam scheduled to each beam in the target scheduling beam set, wherein the target scheduling beam set is determined based on the candidate beam set.

[0177] Optionally, if the target scheduling wave position set is a candidate wave position set corresponding to the beam, then based on the traffic index of each beam scheduled to each wave position in the target scheduling wave position set, each beam is scheduled to a wave position in the target scheduling wave position set, and the scheduling unit 902 is used to:

[0178] For each beam, perform the following operations:

[0179] Determine the traffic volume index of each beam position in a corresponding candidate beam position set for beam scheduling within a preset beam scheduling period;

[0180] Based on the obtained traffic volume indicators, the priority of each wave position is determined respectively;

[0181] In the current time slot, the beam is scheduled to the corresponding beam position with the highest priority in the candidate beam position set.

[0182] Optionally, after scheduling the beam to a beam position with the highest priority in a corresponding candidate beam position set in the current time slot, the method further includes:

[0183] In each time slot after the current time slot, the beam is sequentially scheduled to the remaining beam positions in the corresponding candidate beam position set with the priority from high to low.

[0184] Optionally, it also includes:

[0185] Establishing a first mapping relationship between the current time slot and a wave position with the highest priority, and establishing a second mapping relationship between each time slot after the current time slot and each remaining wave position in the candidate wave position set with the priority from high to low;

[0186] The first mapping relationship and the second mapping relationship are both sent to the satellite through an RRC command.

[0187] Optionally, if the target scheduling wave position set is the union of each candidate wave position set, then based on the traffic index of each beam scheduled to each wave position in the target scheduling wave position set, each beam is scheduled to a wave position in the target scheduling wave position set, and the scheduling unit 902 is used to:

[0188] Based on the union of the candidate beam position sets, a target scheduling beam position set is obtained, and a scheduling scheme is determined in which each beam of the satellite is scheduled to each beam position in the target scheduling beam position set, wherein the beams and the beam positions in the scheduling scheme correspond one to one;

[0189] For each scheduling scheme, the traffic volume index of each beam scheduled to each beam position in the target scheduling beam position set is calculated within a preset beam scheduling period, and the sum of the traffic volume index corresponding to each scheduling scheme is determined;

[0190] Based on the traffic volume index and the maximum scheduling scheme, the beam is scheduled to a beam position in the target scheduling beam position set in the current time slot.

[0191] Optionally, if the target scheduling wave position set is a candidate wave position set corresponding to the beam, then based on the traffic index of each beam scheduled to each wave position in the target scheduling wave position set, each beam is scheduled to a wave position in the target scheduling wave position set, and the scheduling unit 902 is used to:

[0192] Determine a scheduling scheme in which each beam of the satellite is scheduled to each wave position in the target scheduling wave position set, wherein the beams and the wave positions correspond one to one in the scheduling scheme;

[0193] For each scheduling scheme, the traffic volume index of each beam scheduled to each beam position in the target scheduling beam position set is calculated within a preset beam scheduling period, and the sum of the traffic volume index corresponding to each scheduling scheme is determined;

[0194] Based on the traffic volume index and the maximum scheduling scheme, the beam is scheduled to a beam position in the target scheduling beam position set in the current time slot.

[0195] Optionally, a scheduling scheme is determined by a deep learning Q-learning algorithm, including:

[0196] Convert each beam into a corresponding intelligent agent respectively;

[0197] Determine a scheduling action set corresponding to each agent; wherein the scheduling action set includes multiple scheduling actions, the number of scheduling actions is the same as the number of wave positions in the target scheduling wave position set, and different scheduling actions represent beam scheduling to different wave positions;

[0198] Generate multiple reward functions based on the environmental impact caused by each agent selecting a scheduling action from the scheduling action set;

[0199] Determine the scheduling plan based on the reward function with the largest value.

[0200] Optionally, the agent selects a dispatch action by:

[0201] If the scheduling random number is less than the preset greed coefficient, then any scheduling action from the scheduling action set is selected as the scheduling action of the agent;

[0202] Otherwise, the scheduling action corresponding to the largest Q value is selected as the scheduling action of the agent, where the Q value is calculated by the deep learning Q-Learning algorithm.

[0203] Optionally, for each satellite in the satellite communication system, a candidate beam position set of each beam emitted by the satellite is determined respectively, and the determination unit 901 is used to:

[0204] For each satellite in the satellite communication system, the coverage range corresponding to each satellite is determined respectively;

[0205] Sorting each non-overlapping wave position within the coverage range to obtain a plurality of sorted wave positions;

[0206] The sorted multiple wave positions are divided according to preset rules to obtain multiple candidate wave position sets.

[0207] Based on the same inventive concept, refer to Fig.10 As shown, an embodiment of the present application provides a base station, including: a memory 1001, used to store executable instructions; a processor 1002, used to read and execute the executable instructions stored in the memory, and execute any one of the above-mentioned wave position scheduling methods.

[0208] Based on the same inventive concept, an embodiment of the present application provides a computer-readable storage medium. When instructions in the storage medium are executed by a processor, the processor is enabled to perform the above-mentioned wave position scheduling method.

[0209] To summarize, in an embodiment of the present application, a beam scheduling method, device and storage medium are provided, the method comprising: for each satellite in a satellite communication system, determining a candidate beam set for each beam emitted by the satellite, each candidate beam set including multiple non-overlapping beams, and scheduling each beam to a beam in a target scheduling beam set based on a traffic index of each beam scheduled to each beam in a target scheduling beam set, wherein the target scheduling beam set is determined based on the candidate beam set, thereby improving the accuracy of beam scheduling, saving signaling overhead in the beam scheduling process, and effectively reducing the power consumption of the satellite.

[0210] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program product systems. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product system implemented in one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that include computer-usable program code.

[0211] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program product systems according to the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0212] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0213] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process in the computer or other programmable device. Figure 1A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0214] Obviously, those skilled in the art can make various changes and modifications to the present application without departing from the spirit and scope of the present application. Thus, if these modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is also intended to include these modifications and variations.

Claims

1. A wave position scheduling method, characterized in that: Applied to a base station, the method comprises: For each satellite in the satellite communication system, respectively determine a candidate wave position set corresponding to each beam emitted by the satellite, wherein each of the candidate wave position sets includes a plurality of non-overlapping wave positions; Based on the traffic volume index of each beam scheduled to each of the beams in the target scheduling beamset, each beam is scheduled to one of the beams in the target scheduling beamset, wherein the target scheduling beamset is determined based on a candidate beamset set, and the target scheduling beamset is a candidate beamset set corresponding to the beam or the target scheduling beamset is a union of the candidate beamset sets; If the target scheduling beam position set is a candidate beam position set corresponding to the beam, then scheduling each beam to one of the beam positions in the target scheduling beam position set based on a traffic volume indicator of each beam scheduled to each of the beam positions in the target scheduling beam position set includes: For each beam, perform the following operations: Determine, within a preset beam scheduling period, a traffic volume index of each of the beam positions in the corresponding candidate beam position set to be scheduled by the beam; Based on the obtained traffic volume indicators, respectively determine the priority of each of the wave positions; Scheduling the beam to a corresponding beam position with the highest priority in the candidate beam position set in a current time slot; In each time slot after the current time slot, the beam is sequentially scheduled to the remaining beam positions in the corresponding candidate beam position set with the priority from high to low; Establishing a first mapping relationship between the current time slot and the wave position with the highest priority, and establishing a second mapping relationship between each time slot after the current time slot and each remaining wave position in the candidate wave position set with the priority from high to low; The first mapping relationship and the second mapping relationship are both sent to the satellite through an RRC instruction.

2. The method according to claim 1, characterized in that If the target scheduling beam position set is a union of the candidate beam position sets, then scheduling each beam to one of the beam positions in the target scheduling beam position set based on a traffic volume indicator of each beam scheduled to each of the beam positions in the target scheduling beam position set includes: Taking a union of the candidate beam position sets to obtain the target scheduling beam position set, determining a scheduling scheme in which the beams of the satellite are respectively scheduled to the beam positions in the target scheduling beam position set, wherein the beams in the scheduling scheme correspond one-to-one to the beam positions; For each of the scheduling schemes, calculate the traffic volume index of each of the beams scheduled to each of the beam positions in the target scheduling beam position set within a preset beam scheduling period, and determine the sum of the traffic volume index corresponding to each of the scheduling schemes; Based on the scheduling scheme with the maximum sum of the traffic volume indicators, the beam is respectively scheduled to one of the beam positions in the target scheduling beam position set in the current time slot.

3. The method according to claim 1, characterized in that If the target scheduling beam position set is a candidate beam position set corresponding to the beam, then scheduling each beam to one of the beam positions in the target scheduling beam position set based on a traffic volume indicator of each beam scheduled to each of the beam positions in the target scheduling beam position set includes: Determine a scheduling scheme in which each of the beams of the satellite is respectively scheduled to each of the beam positions in the target scheduling beam position set, wherein the beams in the scheduling scheme correspond one-to-one to the beam positions; For each of the scheduling schemes, calculate the traffic volume index of each of the beams scheduled to each of the beam positions in the target scheduling beam position set within a preset beam scheduling period, and determine the sum of the traffic volume index corresponding to each of the scheduling schemes; Based on the scheduling scheme with the maximum sum of the traffic volume indicators, the beam is respectively scheduled to one of the beam positions in the target scheduling beam position set in the current time slot.

4. The method according to claim 2 or 3, characterized in that The determining the scheduling scheme by using a deep learning Q-learning algorithm includes: Converting each of the beams into a corresponding intelligent agent respectively; Determine a scheduling action set corresponding to each of the intelligent agents; wherein the scheduling action set includes multiple scheduling actions, the number of the scheduling actions is the same as the number of wave positions in the target scheduling wave position set, and different scheduling actions represent that the beam is scheduled to different wave positions; Generate multiple reward functions based on the environmental impacts caused by each of the intelligent agents selecting one of the scheduling actions from the scheduling action set; The scheduling scheme is determined based on the reward function with the largest value.

5. The method according to claim 4, characterized in that The agent selects the scheduling action by the following method: If the scheduling random number is less than the preset greedy coefficient, then any one scheduling action from the scheduling action set is selected as the scheduling action of the agent; Otherwise, the scheduling action corresponding to the maximum Q value is selected as the scheduling action of the agent, wherein the Q value is calculated by a deep learning Q-Learning algorithm.

6. The method according to claim 1, characterized in that The step of determining, for each satellite in the satellite communication system, a candidate beam position set of each beam emitted by the satellite comprises: For each satellite in the satellite communication system, respectively determine the coverage range corresponding to each satellite; Sorting each non-overlapping wave position within the coverage area to obtain a plurality of sorted wave positions; The sorted multiple wave positions are divided according to a preset rule to obtain multiple candidate wave position sets.

7. A wave position scheduling device, characterized in that: include: A determination unit, configured to determine, for each satellite in the satellite communication system, candidate beam position sets corresponding to each beam emitted by the satellite, wherein each candidate beam position set includes a plurality of non-overlapping beam positions; A scheduling unit, used for scheduling each beam to one of the beams in the target scheduling beamset based on the traffic index of each beam scheduled to each of the beams in the target scheduling beamset, wherein the target scheduling beamset is determined based on a candidate beamset, the target scheduling beamset is a candidate beamset corresponding to the beam or the target scheduling beamset is a union of the candidate beamsets; if the target scheduling beamset is a candidate beamset corresponding to the beam, then scheduling each beam to one of the beams in the target scheduling beamset based on the traffic index of each beam scheduled to each of the beams in the target scheduling beamset comprises: for each beam, performing the following operations respectively: determining within a preset beam scheduling period, The beam is scheduled to a corresponding wave position in the candidate wave position set according to a traffic volume indicator; based on the obtained traffic volume indicators, the priorities of the wave positions are determined respectively; the beam is scheduled to a wave position with the highest priority in the corresponding candidate wave position set in the current time slot; in each time slot after the current time slot, the beam is sequentially scheduled to the remaining wave positions in the corresponding candidate wave position set from high to low priority; a first mapping relationship is established between the current time slot and the wave position with the highest priority, and a second mapping relationship is established between each time slot after the current time slot and the remaining wave positions in the candidate wave position set from high to low priority; the first mapping relationship and the second mapping relationship are both sent to the satellite through RRC instructions.

8. A base station, characterized in that: include: A memory for storing executable instructions; A processor, configured to read and execute the executable instructions stored in the memory to implement the method according to any one of claims 1 to 6.

9. A computer-readable storage medium, characterized in that: When the instructions in the storage medium are executed by a processor, the processor is enabled to execute the method according to any one of claims 1 to 6.

Citation Information

Patent Citations

  • Elastic beam position resource scheduling system and scheduling method for jump beams

    CN107949066A