Satellite beam hopping optimization method and device and satellite payload equipment
Patent Information
- Application Number
- CN202510560928.3
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-04-29
- Publication Date
- 2026-10-30
AI Technical Summary
[0004]本申请用于解决现有跳波束优化方案仅考虑了资源需求、环境干扰以及频率干扰等因素,并未考虑卫星本身相对于地面的移动引起的影响,不适用于低轨卫星通信,进而导致低轨卫星在物联网跳波束传输场景中存在传输不公平及降低整体传输效率的问题
[0060]本申请提供的卫星跳波束优化方法、装置及卫星载荷设备,通过确定星下覆盖范围内的多个区域及各区域的对星可见时间;根据各区域的对星可见时间,确定各区域的跳波束时隙(即按照对星可见时间越短,分配的跳波束时隙越长的原则);根据终端设备的卫星接入请求及终端设备所在区域的跳波束时隙,确定波束跳扫策略,能够解决由于未考虑星下覆盖范围终端对星可见时间的差异,导致位于不同波位终端传输时间的不公平的问题,基于波束的移动性,实现区域的非均匀的时隙分配,保证各区域中设备(尤其是物联网节点)数据传输有效时间一致,能够定期向卫星上报监测数据,提升了在低轨卫星物联网跳波束传输场景下,终端设备的传输公平性。
Smart Images

Figure CN123019811A_ABST
Abstract
Description
Technical Field
[0001] This application relates to the field of satellite communications, and in particular to a satellite beam hopping optimization method, apparatus, and satellite payload equipment. Background Technology
[0002] In the current field of satellite communication, there are numerous scenarios where terminal devices periodically report data. To allocate resources, beam hopping is typically used to support communication access for terminal devices in multiple regions. The key idea of beam hopping is to utilize time-slicing technology to allow a beam covering a smaller area to poll multiple positions in turn, enabling the beam to operate on demand, thus making resource allocation more flexible.
[0003] To address the issue of transmission fairness among multiple terminals in beam skipping mechanisms, existing technologies primarily adjust different beam access strategies based on factors such as resource requirements, environmental interference, and frequency interference. However, existing adjustment schemes are only applicable to scenarios where the satellite and ground are relatively fixed, such as geosynchronous orbit (GEO) satellites. Summary of the Invention
[0004] This application addresses the problem that existing beam-hopping optimization schemes only consider factors such as resource requirements, environmental interference, and frequency interference, without taking into account the impact of the satellite's movement relative to the ground. This makes them unsuitable for low-Earth orbit (LEO) satellite communications, leading to unfair transmission and reduced overall transmission efficiency in LEO satellites in IoT beam-hopping transmission scenarios.
[0005] To address the aforementioned technical problems, the first aspect of this application provides a satellite beam hopping optimization device, comprising:
[0006] A first processing unit is configured to perform the following operations:
[0007] Determine multiple regions within the satellite's coverage area and the visible time of each region;
[0008] Based on the visible time of each satellite in each region, determine the hopping beam time slot for each region; and
[0009] The beam skipping strategy is determined based on the satellite access request of the terminal device and the beam skipping time slot of the area where the terminal device is located.
[0010] As a further embodiment of this application, determining multiple regions within the sub-satellite coverage area and the visible time of each region includes:
[0011] Based on the satellite's movement direction, the area covered by the satellite is divided into multiple regions.
[0012] The visible time of each region is calculated based on the maximum length of the coverage area along the direction of satellite movement and the length of each region along the direction of satellite movement.
[0013] As a further embodiment of this application, determining multiple regions within the sub-satellite coverage area and the visible time of each region includes:
[0014] Multiple regions were determined based on the wave positions within the satellite's coverage area;
[0015] Determine the visible time of stars in the region based on the visible time of the wave position.
[0016] In a further embodiment of this application, after the first processing unit obtains multiple regions, it further includes:
[0017] Based on the visible time of stars in each region, the multiple regions are clustered.
[0018] In a further embodiment of this application, determining the beam skipping time slot for each region based on the visible time of each region includes:
[0019] Based on the visible time of each region, the hopping beam time slots of each region are non-uniformly distributed.
[0020] In a further embodiment of this application, the beam-hopping time slots of each region are non-uniformly allocated according to the visible time of each region, including:
[0021] Determine the maximum visible time of the stars from the visible times of the stars in each region;
[0022] Based on the single-slot transmission time, the maximum visible time of satellite alignment, and the visible time of satellite alignment in each region, the hopping beam slots for each region are calculated. The hopping beam slots for each region are inversely proportional to the visible time of satellite alignment in each region.
[0023] In a further embodiment of this application, the beam-hopping time slot for each region is calculated based on the single-slot transmission time, the maximum visible time to the satellite, and the visible time to the satellite in each region, including:
[0024] The hopping beam slots for each region are calculated using the following formula:
[0025]
[0026] Among them, T ni Let T0 be the beam-hopping time slot for region ni, and t be the transmission time per time slot. max For the maximum visible time to the stars, t ni The visible time of the star for region ni.
[0027] As a further embodiment of this application, the beam skipping strategy is determined based on the satellite access request of the terminal device and the beam skipping time slot of the area where the terminal device is located, including:
[0028] Extract the location of the terminal device from the satellite access request of the terminal device;
[0029] Based on the location of the terminal device, the target wavelength and target area are determined;
[0030] Based on the hopping beam slots of the target region, resource allocation is performed on the target positions to obtain resource allocation results. The resource allocation results include multiple polling intervals and the hopping beam slots and polling order of each position in each polling interval.
[0031] As a further embodiment of this application, it also includes:
[0032] The second processing unit is configured to perform the following operations:
[0033] Determine whether there is a wave position in the resource allocation result where the hopping beam time slot interval is greater than the maximum hold time. If so, determine the first wave position in the resource allocation result, where the hopping beam time slot of the first wave position is greater than the unit time slot.
[0034] The hopping beam time slots of the first wave position are split;
[0035] The hopping beam time slots of the unsplit wave positions and the hopping beam time slots after the first wave position is split are merged to make the hopping beam time slot interval of each wave position less than the maximum hold time.
[0036] As a further embodiment of this application, it also includes:
[0037] A third processing unit is configured to perform the following operations:
[0038] Determine whether the number of time slots for the same wavelength within a polling interval is greater than the number of hopping beam time slots for that wavelength. If so, adjust the resource allocation results.
[0039] A second aspect of this application provides a satellite beam hopping optimization method, comprising:
[0040] Determine multiple regions within the satellite's coverage area and the visible time of each region;
[0041] Based on the visible time of each satellite in each region, determine the hopping beam time slot for each region; and
[0042] The beam skipping strategy is determined based on the satellite access request of the terminal device and the beam skipping time slot of the area where the terminal device is located.
[0043] As a further embodiment of this application, the beam skipping strategy is determined based on the satellite access request of the terminal device and the beam skipping time slot of the area where the terminal device is located, including:
[0044] Extract the location of the terminal device from the satellite access request of the terminal device;
[0045] Based on the location of the terminal device, the target wavelength and target area are determined;
[0046] Based on the hopping beam slots of the target region, resource allocation is performed on the target positions to obtain resource allocation results. The resource allocation results include multiple polling intervals and the hopping beam slots and polling order of each position in each polling interval.
[0047] In a further embodiment of this application, after allocating resources for the target beam position according to the beam-hopping time slot of the target region, the method further includes:
[0048] Determine whether there is a wave position in the resource allocation result where the hopping beam slot interval is greater than the maximum hold time. If so, determine the first wave position in the resource allocation result, wherein the hopping beam slot of the first wave position is greater than a preset threshold.
[0049] The hopping beam time slots of the first wave position are split;
[0050] The hopping beam time slots of the unsplit wave positions and the hopping beam time slots after the first wave position is split are merged to make the hopping beam time slot interval of each wave position less than the maximum hold time.
[0051] As a further embodiment of this application, it also includes:
[0052] Determine whether the number of time slots for the same wavelength within a polling interval is greater than the number of hopping beam time slots for that wavelength. If so, adjust the resource allocation results.
[0053] A fourth aspect of this application provides a satellite payload device, comprising:
[0054] The first calculation unit is used to determine multiple regions within the satellite's coverage area and the satellite's visibility time for each region;
[0055] The second calculation unit is used to determine the beam skipping time slot for each region based on the visible time of each region; and
[0056] The processing unit is used to determine the beam skipping strategy based on the satellite access request of the terminal device and the beam skipping time slot of the area where the terminal device is located.
[0057] A fifth aspect of this application provides a computer device including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the method described in any of the foregoing embodiments.
[0058] A sixth aspect of this application provides a computer-readable storage medium storing a computer program, wherein the computer program, when executed by a processor of a computer device, implements the method described in any of the foregoing embodiments.
[0059] A seventh aspect of this application provides a computer program product comprising a computer program, wherein the computer program, when executed by a processor of a computer device, implements the method described in any of the foregoing embodiments.
[0060] The satellite beam-hopping optimization method, apparatus, and satellite payload equipment provided in this application determine multiple regions within the satellite's coverage area and the visible time of each region; determine the beam-hopping time slot for each region based on its visible time (i.e., allocating a longer beam-hopping time slot according to the principle that the shorter the visible time, the longer the allocated beam-hopping time slot); and determine the beam-hopping strategy based on the satellite access request of the terminal device and the beam-hopping time slot of the region where the terminal device is located. This solves the problem of unfair transmission time for terminals located at different beam positions caused by not considering the differences in the visible time of terminals within the satellite's coverage area. Based on the mobility of the beam, it achieves non-uniform time slot allocation for regions, ensuring consistent effective data transmission time for devices (especially IoT nodes) in each region, enabling regular reporting of monitoring data to the satellite, and improving the transmission fairness of terminal devices in low-Earth orbit satellite IoT beam-hopping transmission scenarios.
[0061] To make the above and other objects, features and advantages of this application more apparent and understandable, preferred embodiments are described below in detail with reference to the accompanying drawings. Attached Figure Description
[0062] To more clearly illustrate the technical solutions in the embodiments of this application or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the 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.
[0063] Figure 1 A schematic diagram of the satellite beam skipping mechanism in the prior art is shown;
[0064] Figure 2 This diagram illustrates the satellite beam skipping scan time slot allocation in the prior art.
[0065] Figure 3 This illustration shows a schematic diagram of wavelet access in a dynamic scenario according to an embodiment of this application;
[0066] Figure 4 A first flowchart of the satellite beam hopping optimization method according to an embodiment of this application is shown;
[0067] Figure 5A A schematic diagram of the region division in an embodiment of this application is shown;
[0068] Figure 5B This illustration shows a schematic diagram of the clustering results of regions based on the visible time of stars in an embodiment of this application;
[0069] Figure 6 A flowchart illustrating the beam skipping strategy determination process according to an embodiment of this application is shown;
[0070] Figure 7 A second flowchart of the satellite beam hopping optimization method according to an embodiment of this application is shown;
[0071] Figure 8 A third flowchart of the satellite beam hopping optimization method according to an embodiment of this application is shown;
[0072] Figure 9 This illustration shows a schematic diagram of the optimized pre-skip scan traversal according to an embodiment of this application;
[0073] Figure 10 This diagram illustrates the optimized skip-scan traversal of an embodiment of this application.
[0074] Figure 11 The fourth flowchart of the satellite beam hopping optimization method according to an embodiment of this application is shown;
[0075] Figure 12 A first structural diagram of a satellite beam hopping optimization device according to an embodiment of this application is shown;
[0076] Figure 13 A second structural diagram of the satellite beam hopping optimization device according to an embodiment of this application is shown;
[0077] Figure 14 A third structural diagram of the satellite beam hopping optimization device according to an embodiment of this application is shown;
[0078] Figure 15 A structural diagram of the satellite payload device according to an embodiment of this application is shown;
[0079] Figure 16 A structural diagram of a computer device according to an embodiment of this application is shown.
[0080] Explanation of symbols in the attached drawings:
[0081] 1201, First Processing Unit;
[0082] 1202, Second Processing Unit;
[0083] 1203, Third Processing Unit;
[0084] 1501, First Calculation Unit;
[0085] 1502, Second Calculation Unit;
[0086] 1503, Processing Unit;
[0087] 1602. Computer equipment;
[0088] 1604, Processor;
[0089] 1606. Memory;
[0090] 1608. Drive mechanism;
[0091] 1610. Input / Output Module;
[0092] 1612. Input devices;
[0093] 1614. Output devices;
[0094] 1616. Presentation equipment;
[0095] 1618. Graphical User Interface;
[0096] 1620. Network interface;
[0097] 1622. Communication link;
[0098] 1624. Communication bus. Detailed Implementation
[0099] 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.
[0100] It should be noted that the terms "first," "second," etc., in the specification, claims, and accompanying drawings of this application are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate so that the embodiments of this application described herein can be implemented 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, apparatus, product, or device 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 devices.
[0101] This specification provides the operational steps of the methods described in the embodiments or flowcharts, but based on conventional or non-inventive labor, more or fewer operational steps may be included. The order of steps listed in the embodiments is merely one possible execution order among many and does not represent the only possible execution order. In actual system or device products, the methods shown in the embodiments or drawings can be executed sequentially or in parallel.
[0102] It should be noted that in the embodiments of this application, certain software, components, models and other existing solutions in the industry may be mentioned. These should be regarded as exemplary and are only intended to illustrate the feasibility of implementing the technical solution of this application. However, it does not mean that the applicant has used or necessarily used the solution.
[0103] Due to the global coverage of satellite communications, satellite IoT has gradually attracted attention. By deploying IoT nodes (i.e. IoT devices) to regularly report monitoring data to satellites, it can meet important needs such as environmental monitoring in remote areas and border security monitoring. However, the dense deployment of IoT nodes has also brought huge challenges to the application of satellite IoT.
[0104] In existing beam-scanning mechanisms, service time for different beam positions is typically evenly distributed, meaning each beam position receives the same amount of service time. Ensuring fair transmission across multiple terminals is a crucial optimization direction in beam-scanning mechanisms. However, due to the dense deployment of IoT nodes, each IoT node has limited transmission time, resulting in some terminal devices being unable to upload sensing data. Therefore, optimizing transmission fairness in beam-scanning for IoT transmission has become a significant challenge in satellite IoT scenarios.
[0105] Existing beam-hopping optimization schemes only consider factors such as resource requirements, environmental interference, and frequency interference, without taking into account the impact of the satellite's movement relative to the ground. This makes them unsuitable for low-Earth orbit (LEO) satellite communications, leading to unfair transmission and reduced overall transmission efficiency in LEO satellites in IoT beam-hopping transmission scenarios.
[0106] Specifically, with the development of the Low Earth Orbit Satellite (LEO) industry, people's demand for LEO satellites' high bandwidth and wide coverage is increasing day by day. LEO satellites have important application value in fields such as communication, positioning and navigation, and environmental monitoring in remote areas.
[0107] Low Earth Orbit (LEO) satellites typically orbit at altitudes between 500 km and 1500 km. Compared to geostationary orbit (GEO) satellites, LEO satellites move at high speeds relative to the ground. Simultaneously, the lower orbital altitude results in shorter communication latency and higher ground voltage levels. Therefore, LEO satellites have become the primary direction for the development of high-throughput satellites.
[0108] Meanwhile, the coverage of a single beam from a low-Earth orbit (LEO) satellite is limited. To allocate resources more efficiently, LEO broadband satellites employ beam hopping to support parallel access and communication for nodes in multiple regions. The key idea behind beam hopping is to utilize time-slicing technology, allowing a beam covering a smaller area to poll multiple positions in turn, enabling the beam to operate on demand and thus making resource allocation more flexible. The satellite beam hopping mechanism is as follows: Figure 1 As shown, the large circular area is the sub-satellite beam coverage area, which includes multiple hop-scan positions. The satellite can provide time-division multiplexing services to the target position interval according to the access requirements of different positions, such as... Figure 1 The access intervals are for wavelengths 5, 7, 9, and 11. Typically, the service time for different target wavelengths is evenly distributed, and all available wavelengths are polled and scanned in a round-robin fashion. Figure 1 Taking the wavelength access situation as an example, the specific time slot allocation is as follows: Figure 2 As shown, the satellite beam performs time-division hopping scans on beam positions 5, 7, 9, and 11 using a polling method, providing service for each beam position within its corresponding time slot, with each time slot being equally spaced. Simultaneously, for multiple nodes (N1, N2, ...) within the same beam position, equally spaced time slots are also divided, providing time-division service to multiple terminals within that beam position. This beam-hopping scanning method enhances the beam coverage area, enabling service to more terminal devices within the same time period. The transmission time for each beam position can be expressed as:
[0109]
[0110] Where i takes the values 1, 2, 3...n, Tmax is the total transmission time, and T... NiThe transmission time available for each wavelength is given by |Ni|, where |Ni| is the total number of wavelengths to be transmitted.
[0111] As shown in the above formula, the transmission time for each beamwidth is the same. In beam skipping mechanisms, ensuring transmission fairness across multiple terminals is a crucial optimization direction. However, due to the dense deployment of IoT nodes, each terminal has limited transmission time, potentially preventing some terminals from uploading sensing data. Therefore, optimizing transmission fairness in beam skipping during IoT transmission has become a significant challenge in satellite IoT scenarios.
[0112] To address the issue of transmission fairness among multiple terminals in satellite beam hopping mechanisms, numerous studies have been conducted to optimize different scenarios. Existing solutions can adjust access strategies for different beam positions based on factors such as resource requirements, environmental interference, and frequency interference. Specifically, existing beam hopping mechanisms first calculate resource requirements based on the number of terminals accessing different beam positions, and then adjust the time slot allocation strategy. According to equation (1), the on-demand transmission time for each beam position can be optimized as follows:
[0113]
[0114] Where i takes the values 1, 2, 3...n, and t... max R is the total beam transmission time under this beam coverage condition. ni This indicates the number of positions required for each wave position.
[0115] Some beam skipping optimizations can be made by adjusting the time slot allocation based on the terminal's environment and location factors, such as differences in transmission delay at different locations and differences in signal attenuation caused by rain.
[0116] In addition, some studies have considered interference avoidance between high and low orbit satellites or frequency interference between multi-beam satellites. In order to avoid co-frequency interference, the beam position allocation and time slot allocation of different beam hopping have been optimized.
[0117] To address the transmission fairness issue under the beam skipping mechanism of satellite IoT, existing technical solutions only optimize fairness in scenarios where the satellite and ground are relatively fixed. However, due to the high-speed movement of low-Earth orbit (LEO) satellites relative to the ground, the visibility time of ground terminals to LEO satellites is only about 10 minutes. Furthermore, since the ground-based coverage area is mostly circular or elliptical, there are significant differences in the visibility time of satellites for terminal devices at different beam positions. The visibility time of satellites at the edge nodes is significantly shorter than that of nodes at the center of the orbit. Specifically, for example… Figure 3 As shown, the large circle represents the sub-satellite coverage area, and each small circle represents a wavelength interval. The arrows indicate the direction of satellite movement. The visible time of satellites in wavelength intervals located above and below the large circle is significantly shorter than the visible time of satellites in wavelength intervals located at the center of the orbit. Figure 3 It is known that due to the rapid movement of the satellite relative to the ground, the visible time of the satellite is much longer for the wave positions located at the center of the satellite's trajectory (i.e., wave positions 25-32) than for the wave positions located at the edge of the trajectory (i.e., wave positions 3-6 and 51-54). Therefore, IoT nodes densely deployed at the edge of the trajectory may not have enough transmission opportunities, while IoT nodes located at the center may waste a significant amount of transmission time.
[0118] Current optimization schemes for beam hopping only consider the differences in demand and transmission paths between different wave positions, without taking into account the movement of the satellite itself relative to the ground. For example, equation (2) only considers the difference in the number of terminals required in different wave positions. This leads to unfair transmission of low-orbit satellites in the IoT beam hopping transmission scenario, reducing the overall transmission efficiency in the satellite IoT scenario.
[0119] To address the aforementioned technical problems in existing technologies, this application provides a satellite beam skipping optimization method, which can also be referred to as a weighted beam skipping method based on regional satellite visibility time. Figure 4 As shown, it includes:
[0120] Step 401: Determine multiple regions within the satellite's coverage area and the visible time of each region.
[0121] To be more specific, each region includes multiple wave position intervals.
[0122] In one specific implementation method, this step includes the following process:
[0123] First, based on the satellite's movement direction, the sub-satellite coverage area is divided into multiple regions. Specifically, D / d is calculated to obtain the number of sub-satellite coverage areas, i.e., the number of wavefronts, such as... Figure 5A As shown, Figure 5A In the illustrated embodiment, there are 7 rows of wave positions and 7 regions, where D is the satellite's sub-satellite coverage diameter and d is the wave position diameter. Then, the region is divided based on the number of regions and the wave position diameter, as follows: Figure 5A As shown.
[0124] Secondly, based on the maximum length of the sub-satellite coverage along the direction of satellite movement (e.g. Figure 5A The D in the text is... Figure 5A The diameter of the great circle) and the length of each region along the direction of satellite movement (e.g., the ... length of the great Figure 5A Using d1, d2, d3, ..., d7 in the equation, the visible time to the stars in each region can be calculated as follows:
[0125] {t1, t2, t3,...,t7}={d1 / d, d2 / d, d3 / d,..., d7 / d} (3)
[0126] In some specific implementations, multiple regions within the satellite's coverage area and the visible time of each region are determined, including:
[0127] First, multiple regions are determined based on the wave positions within the satellite's coverage area. When implementing this step, multiple regions can be determined based on the satellite's direction of movement and the visible time of the wave positions.
[0128] Then, based on the visible times of the wavelengths, the visible times of the satellites in the region are determined. This step can be achieved by averaging or taking the maximum value of the visible times of the satellites at each wavelength in the region.
[0129] Step 402: Determine the hopping beam time slot for each region based on the visible time of each region.
[0130] During this step, the hopping beam time slots for each region are non-uniformly distributed based on the visible time of each region.
[0131] In some implementations, the hopping beam time slots of a region are divided according to the principle that the shorter the visible time to the satellite, the longer the hopping beam time slot. This ensures that the data transmission time of each beam interval in each region is consistent, enabling the terminal equipment in each beam interval to upload data, ensuring transmission fairness and improving overall transmission efficiency.
[0132] In some implementations, to account for relative movement between the beam and the ground, the maximum visible time for satellite alignment across all regions is used as a baseline for time slot allocation. Specifically, the maximum visible time t is first determined from the visible times for satellite alignment in each region. max Then, based on the single-slot transmission time T0 and the maximum visible time to the satellite t... max and the visible time T of the stars in each region ni Calculate the hopping beam time slot for each region, where the hopping beam time slot for each region is inversely proportional to the satellite alignment time for each region.
[0133] In one specific implementation, the hopping beam slots for each region are calculated using the following formula:
[0134]
[0135] Among them, T ni Let T0 be the beam-hopping time slot for region ni, and t be the transmission time per time slot. max For the maximum visible time to the stars, t ni The visible time of the star for region ni.
[0136] Step 403: Determine the beam skipping strategy based on the satellite access request of the terminal device and the beam skipping time slot of the area where the terminal device is located.
[0137] In one specific implementation, such as Figure 6 As shown, the implementation process of this step includes:
[0138] Step 601: Extract the location of the terminal device from the satellite access request of the terminal device.
[0139] In this step, the satellite access request of the terminal device refers to the satellite access request received at the same time, including satellite access requests from multiple terminal devices.
[0140] Step 602: Determine the target wave position and target area based on the location of the terminal device.
[0141] Each terminal device location can determine a target wavelength. Based on the target wavelength and the already divided area, the target area of the target wavelength can be determined.
[0142] Step 603: Based on the hopping beam slots of the target area, resource allocation is performed on the target positions to obtain resource allocation results. The resource allocation results include multiple polling intervals and the hopping beam slots and polling order of each position in each polling interval.
[0143] In this step, the hopping beam slots of the target area can be sorted according to the target beam position number to obtain a polling interval. The polling interval is repeated to obtain the resource allocation result. In specific implementation, the hopping beam slots of the target area can also be sorted in other orders, which is not limited in this invention.
[0144] by Figure 5B For example, assuming the terminal to be transmitted is located at wavelengths 5, 21, 25, and 46, the satellite can determine that wavelength 5 is in region N1, wavelengths 21 and 25 are in region N3, and wavelength 46 is in region N2. The corresponding beam hopping time slots for the terminal are:
[0145]
[0146] Where t1, t2, and t3 are the visible times to the satellite in regions N1, N2, and N3, respectively, and T0 is the transmission time per time slot.
[0147] The satellite beam performs polling and skipping scans in the corresponding four positions based on the time slot allocation of Equation (4).
[0148] This embodiment can solve the problem of unfair transmission time for terminals located at different beam positions due to the failure to consider the differences in the visible time of terminals under satellite coverage. Based on the mobility of beams, more hopping beam time slots are allocated to areas with short visible time, realizing non-uniform time slot allocation in the region. This ensures that the effective data transmission time of devices in each region is consistent, and monitoring data can be reported to the satellite regularly, improving the transmission fairness of terminal devices in the hopping beam transmission scenario of low-orbit satellite IoT.
[0149] In one embodiment of this application, another satellite beam hopping optimization method is provided, such as... Figure 7 As shown, it includes:
[0150] Step 701: Determine multiple regions within the satellite's coverage area and the visible time of each region.
[0151] Step 702: Cluster the multiple regions according to the visible time of each region and determine the visible time of each cluster. Each cluster includes at least one region.
[0152] by Figure 5A For example, by clustering the visible times of stars in different regions based on a fixed visible time interval, we obtain... Figure 5B The clustering regions shown are Q({t1, t2...t7}) = {N1, N2, N3}, meaning that based on the quantization results of the visible time {t1, t2, t3...t7} for each row of wave positions (each region), the wave positions can be clustered into three regions, N1, N2, and N3. Furthermore, the specific quantization scheme can be adjusted according to the sub-satellite coverage area; for example, when the sub-satellite coverage area is elliptical, the gradient division can be further reduced. Finally, time slots can be allocated based on the quantization times of the three regions.
[0153] In one real-time approach, the clustering rules include: classifying regions whose visible time difference with a star is less than a preset threshold into a single region.
[0154] Step 703: Determine the hopping beam time slot for each region based on the visible time of each region's satellite.
[0155] Step 704: Determine the beam skipping strategy based on the satellite access request of the terminal device and the beam skipping time slot of the area where the terminal device is located.
[0156] The real-time processes of steps 703 and 704 can be referred to the foregoing embodiments, and will not be described in detail here.
[0157] This embodiment reduces the number of regions to be divided by clustering the regions, thereby improving the generation efficiency of the beam skipping strategy and increasing the beam skipping efficiency.
[0158] In beam skipping mode, the fixed timeslot mechanism sets a maximum supported number of beams to ensure service quality across multiple beams and prevent link interruptions due to excessively long polling times. Since the service timeslot for a single beam may exceed the unit timeslot, setting a maximum number of beams based on the unit timeslot may result in excessively long polling times, leading to service quality degradation or even link interruptions. Therefore, optimizing polling reliability under the proposed weighted skipping mechanism is a crucial issue.
[0159] A simple method is to set the time slot size used to determine the number of wavelengths to the longest weighted time slot. However, this setting, geared towards flexible and varied real-world applications, may lead to a reduction in the number of wavelengths served simultaneously, resulting in underutilization of resources. To address this issue, this solution proposes a reliability time slot allocation optimization mechanism based on a weighted skip-scan mechanism. Specifically, such as... Figure 8 As shown, after allocating resources for the target beam position according to the hopping beam slots of the target area, the process further includes:
[0160] Step 801: Determine whether there are any wave positions in the resource allocation results where the hopping beam time slot interval is greater than the maximum hold time. If so, perform the following optimization operation on the resource allocation results. If not, no additional operation is required.
[0161] Step 802: Determine the first wave position in the resource allocation result, wherein the hopping beam time slot of the first wave position is greater than the unit time slot.
[0162] Step 803: Split the hopping beam time slot of the first wave position.
[0163] Step 804: Merge the hopping beam time slots of the unsplit wave positions and the hopping beam time slots of the first wave position after splitting, so that the hopping beam time slot interval of each wave position is less than the maximum hold time.
[0164] In this step, as long as the time slot interval of each hopping beam is less than the maximum holding time, the present invention does not limit the specific fusion process.
[0165] Taking the wave positions in equation (4) as an example, assuming the length of a unit time slot is T0, through calculation, the time slot of wave position 5 is 4T0, the time slots of wave positions 21 and 25 are T0, the length of wave position 46 is 2T0, and the maximum hold gap is set to 6T0. Then the unoptimized skip-scan traversal is as follows: Figure 9 As shown, by Figure 9 It can be seen that, following the normal polling sequence, the interval between wavelets 2 and 5 is 7T0, which cannot meet the maximum hold interval requirement of 6T0. However, due to the longer transmission time slot of wavelet 5, its transmission interval is only 4T0. Therefore, in the weighted time slot, according to... Figure 8 The method shown has been optimized, and the optimization result is as follows: Figure 10 As shown, the sequence of individual time slots for each wave position in the first polling cycle is: wave position 5, wave position 46, wave position 5, wave position 46, wave position 21, wave position 5, wave position 5, wave position 25. The sequence of individual time slots for each wave position in the second polling cycle is: wave position 5, wave position 46, wave position 21, wave position 5, wave position 5, wave position 46, wave position 25, wave position 5.
[0166] Depend on Figure 10It can be seen that by splitting the long time slot wavelet time, the maximum time interval between wavelets is reduced. However, in subsequent iterations, there are cases where wavelets that should belong to different polling intervals are located in the same polling interval. When this happens, the wavelets need to be adjusted.
[0167] Specifically, such as Figure 11 As shown, after step 804 above, the following steps are also included:
[0168] Step 805: Determine whether the number of time slots for the same wave position within a polling interval is greater than the hopping beam time slot for that wave position. If yes, adjust the resource allocation result; otherwise, no processing is required.
[0169] In this step, the polling interval range refers to any interval with a polling interval time slot quantity.
[0170] This application can achieve the following technical effects:
[0171] (1) For the optimization scheme of beam skipping for low-Earth orbit satellites, existing optimization methods only consider the differences in demand and transmission paths for different wave positions, without taking into account the movement of the satellite itself relative to the ground. However, this scheme focuses on solving the problem of transmission fairness of the link when the coverage area under the satellite moves relative to the ground, so it needs to be achieved through methods such as regional satellite time quantization and time slot weighting. Therefore, both the target problem and the solution are significantly different from existing methods.
[0172] (2) Existing beam skipping optimization methods do not optimize the link instability caused by the maximum link interval exceeding the maximum link hold time, or only adjust the maximum number of beams supported by the system to ensure link stability. In contrast, this scheme arranges the time slot interval of the beams by splitting the long time slots, thus ensuring the stability of the terminal links of different beams.
[0173] Based on the same inventive concept, this application also provides a satellite beam hopping optimization device, as described in the following embodiments. Since the principle of the satellite beam hopping optimization device in solving the problem is similar to that of the satellite beam hopping optimization method, the implementation of the satellite beam hopping optimization device can refer to the satellite beam hopping optimization method, and repeated details will not be elaborated further.
[0174] Specifically, such as Figure 12 As shown, the satellite beam hopping optimization device includes:
[0175] The first processing unit 1201 is configured to perform the following operations:
[0176] Determine multiple regions within the satellite's coverage area and the visible time of each region;
[0177] Based on the visible time of each satellite in each region, determine the hopping beam time slot for each region; and
[0178] The beam skipping strategy is determined based on the satellite access request of the terminal device and the beam skipping time slot of the area where the terminal device is located.
[0179] In a further embodiment, the first processing unit 1201 determines multiple regions within the sub-satellite coverage area and the visible time of each region, including:
[0180] Based on the satellite's movement direction, the area covered by the satellite is divided into multiple regions.
[0181] The visible time of each region is calculated based on the maximum length of the coverage area along the direction of satellite movement and the length of each region along the direction of satellite movement.
[0182] In a further embodiment, the first processing unit 1201 determines multiple regions within the sub-satellite coverage area and the visible time of each region, including:
[0183] Multiple regions were determined based on the wave positions within the satellite's coverage area;
[0184] Determine the visible time of stars in the region based on the visible time of the wave position.
[0185] In a further embodiment, after the first processing unit 1201 obtains multiple regions, it further includes: clustering the multiple regions according to the star visibility time of each region.
[0186] In a further embodiment, the first processing unit 1201 determines the beam skipping time slot for each region based on the visible time of each region, including:
[0187] Based on the visible time of each region, the hopping beam time slots of each region are non-uniformly distributed.
[0188] In a further embodiment, the beam-hopping time slots of each region are non-uniformly allocated according to the visible time of each region, including:
[0189] Determine the maximum visible time of the stars from the visible times of the stars in each region;
[0190] Based on the single-slot transmission time, the maximum visible time of satellite alignment, and the visible time of satellite alignment in each region, the hopping beam slots for each region are calculated. The hopping beam slots for each region are inversely proportional to the visible time of satellite alignment in each region.
[0191] In a specific real-time mode, based on the single-slot transmission time, the maximum visible time to the satellite, and the visible time to the satellite in each region, the hopping beam slot for each region is calculated, including:
[0192] The hopping beam slots for each region are calculated using the following formula:
[0193]
[0194] Among them, T ni Let T0 be the beam-hopping time slot for region ni, and t be the transmission time per time slot. max For the maximum visible time to the stars, t ni The visible time of the star for region ni.
[0195] In a further embodiment, the first processing unit 1201 determines a beam skipping strategy based on the satellite access request of the terminal device and the beam skipping time slot of the area where the terminal device is located, including:
[0196] Extract the location of the terminal device from the satellite access request of the terminal device;
[0197] Based on the location of the terminal device, the target wavelength and target area are determined;
[0198] Based on the hopping beam slots of the target region, resource allocation is performed on the target positions to obtain resource allocation results. The resource allocation results include multiple polling intervals and the hopping beam slots and polling order of each position in each polling interval.
[0199] In one embodiment of this application, as Figure 13 As shown, the satellite beam hopping optimization device also includes:
[0200] The second processing unit 1202 is configured to perform the following operations:
[0201] Determine whether there is a wave position in the resource allocation result where the hopping beam time slot interval is greater than the maximum hold time. If so, determine the first wave position in the resource allocation result, where the hopping beam time slot of the first wave position is greater than the unit time slot.
[0202] The hopping beam time slots of the first wave position are split;
[0203] The hopping beam time slots of the unsplit wave positions and the hopping beam time slots after the first wave position is split are merged to make the hopping beam time slot interval of each wave position less than the maximum hold time.
[0204] In one embodiment of this application, as Figure 14 As shown, the satellite beam hopping optimization device also includes:
[0205] The third processing unit 1203 is configured to perform the following operations:
[0206] Determine whether the number of time slots for the same wavelength within a polling interval is greater than the number of hopping beam time slots for that wavelength. If so, adjust the resource allocation results.
[0207] In one embodiment of this application, as Figure 15 As shown, a satellite payload device is also provided, comprising:
[0208] The first calculation unit 1501 is used to determine multiple regions within the satellite coverage area and the satellite visibility time of each region.
[0209] The second calculation unit 1502 is used to determine the beam skipping time slot for each region based on the visible time of each region; and
[0210] Processing unit 1503 is used to determine beam skipping strategy based on the satellite access request of the terminal device and the beam skipping time slot of the area where the terminal device is located.
[0211] In one embodiment of this application, a computer device is also provided, such as... Figure 16 As shown, computer device 1602 may include one or more processors 1604, such as one or more central processing units (CPUs), each of which may implement one or more hardware threads. Computer device 1602 may also include any memory 1606 for storing information of any kind, such as code, settings, data, etc. Non-limitingly, for example, memory 1606 may include any type of RAM, any type of ROM, flash memory, hard disk, optical disk, etc. More generally, any memory can use any technology to store information. Furthermore, any memory may provide volatile or non-volatile retention of information. Furthermore, any memory may represent a fixed or removable component of computer device 1602. In one case, when processor 1604 executes associated instructions stored in any memory or combination of memories, computer device 1602 may perform any operation of the associated instructions. Computer device 1602 also includes one or more drive mechanisms 1608 for interacting with any memory, such as hard disk drive mechanisms, optical disk drive mechanisms, etc.
[0212] Computer device 1602 may also include an input / output module 1610 (I / O) for receiving various inputs (via input device 1612) and providing various outputs (via output device 1614). A specific output mechanism may include a presentation device 1616 and an associated graphical user interface (GUI) 1618. In other embodiments, the input / output module 1610 (I / O), input device 1612, and output device 1614 may be omitted, and the device may function solely as a computer device within a network. Computer device 1602 may also include one or more network interfaces 1620 for exchanging data with other devices via one or more communication links 1622. One or more communication buses 1624 couple the components described above together.
[0213] Communication link 1622 can be implemented in any way, such as via a local area network, a wide area network (e.g., the Internet), a point-to-point connection, or any combination thereof. Communication link 1622 may include any combination of hardwired links, wireless links, routers, gateway functions, name servers, etc., governed by any protocol or combination of protocols.
[0214] This application also provides a computer-readable storage medium storing a computer program, which, when executed by a processor, performs the steps of the above-described method.
[0215] This application also provides a computer-readable instruction, wherein when a processor executes the instruction, the program therein causes the processor to perform the method described in any of the foregoing embodiments.
[0216] It should be understood that in the various embodiments of this application, the order of the above-mentioned processes does not imply the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of this application.
[0217] It should also be understood that, in the embodiments of this application, the term "and / or" is merely a description of the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A existing alone, A and B existing simultaneously, and B existing alone. Additionally, the character " / " in this application generally indicates that the preceding and following related objects have an "or" relationship.
[0218] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed in this application can be implemented in electronic hardware, computer software, or a combination of both. To clearly illustrate the interchangeability of hardware and software, the composition and steps of each example have been generally described in terms of functionality in the foregoing description. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.
[0219] Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.
[0220] In the embodiments provided in this application, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the couplings or direct couplings or communication connections shown or discussed may be indirect couplings or communication connections through some interfaces, apparatuses, or units, or they may be electrical, mechanical, or other forms of connection.
[0221] 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 units can be selected to achieve the purpose of the embodiments of this application, depending on actual needs.
[0222] Furthermore, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit.
[0223] If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or all or part 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, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this application. 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.
[0224] This application uses specific embodiments to illustrate the principles and implementation methods of this application. The description of the above embodiments is only for the purpose of helping to understand the method and core ideas of this application. At the same time, for those skilled in the art, there will be changes in the specific implementation methods and application scope based on the ideas of this application. Therefore, the content of this specification should not be construed as a limitation of this application.
Claims
1. A satellite beam hopping optimization device, wherein, include: A first processing unit is configured to perform the following operations: Determine multiple regions within the satellite's coverage area and the visible time of each region; Based on the visible time of each satellite in each region, determine the hopping beam time slot for each region; and The beam skipping strategy is determined based on the satellite access request of the terminal device and the beam skipping time slot of the area where the terminal device is located.
2. The apparatus of claim 1, wherein, Determine multiple areas within the satellite's coverage area and the visible time of each area, including: Based on the satellite's movement direction, the area covered by the satellite is divided into multiple regions. The visible time of each region is calculated based on the maximum length of the coverage area along the direction of satellite movement and the length of each region along the direction of satellite movement.
3. The apparatus of claim 1, wherein, Determine multiple areas within the satellite's coverage area and the visible time of each area, including: Multiple regions were determined based on the wave positions within the satellite's coverage area; Determine the visible time of stars in the region based on the visible time of the wave position.
4. The apparatus as claimed in claim 2 or 3, wherein, After the first processing unit obtains multiple regions, it further includes: Based on the visible time of stars in each region, the multiple regions are clustered.
5. The apparatus of claim 1, wherein, Based on the visible time of each region, determine the hopping beam time slots for each region, including: Based on the visible time of each region, the hopping beam time slots of each region are non-uniformly distributed.
6. The apparatus of claim 5, wherein, Based on the visible time of each region, the hopping beam time slots for each region are non-uniformly allocated, including: Determine the maximum visible time of the stars from the visible times of the stars in each region; Based on the single-slot transmission time, the maximum visible time of satellite alignment, and the visible time of satellite alignment in each region, the hopping beam slots for each region are calculated. The hopping beam slots for each region are inversely proportional to the visible time of satellite alignment in each region.
7. The apparatus of claim 1, wherein, Based on the satellite access request of the terminal device and the beam hopping time slot of the area where the terminal device is located, determine the beam hopping strategy, including: Extract the location of the terminal device from the satellite access request of the terminal device; Based on the location of the terminal device, the target wavelength and target area are determined; Based on the hopping beam slots of the target region, resource allocation is performed on the target positions to obtain resource allocation results. The resource allocation results include multiple polling intervals and the hopping beam slots and polling order of each position in each polling interval.
8. The apparatus of claim 7, wherein, Also includes: The second processing unit is configured to perform the following operations: Determine whether there is a wave position in the resource allocation result where the hopping beam slot interval is greater than the maximum hold time. If so, determine the first wave position in the resource allocation result, wherein the hopping beam slot of the first wave position is greater than a preset threshold. The hopping beam time slots of the first wave position are split; The hopping beam time slots of the unsplit wave positions and the hopping beam time slots after the first wave position is split are merged to make the hopping beam time slot interval of each wave position less than the maximum hold time.
9. The apparatus of claim 8, wherein, Also includes: A third processing unit is configured to perform the following operations: Determine whether the number of time slots for the same wavelength within a polling interval is greater than the number of hopping beam time slots for that wavelength. If so, adjust the resource allocation results.
10. A satellite beam hopping optimization method, wherein, include: Determine multiple regions within the satellite's coverage area and the visible time of each region; Based on the visible time of each satellite in each region, determine the hopping beam time slot for each region; and The beam skipping strategy is determined based on the satellite access request of the terminal device and the beam skipping time slot of the area where the terminal device is located.
11. The method of claim 10, wherein, Based on the satellite access request of the terminal device and the beam hopping time slot of the area where the terminal device is located, determine the beam hopping strategy, including: Extract the location of the terminal device from the satellite access request of the terminal device; Based on the location of the terminal device, the target wavelength and target area are determined; Based on the hopping beam slots of the target region, resource allocation is performed on the target positions to obtain resource allocation results. The resource allocation results include multiple polling intervals and the hopping beam slots and polling order of each position in each polling interval.
12. The method of claim 11, wherein, After allocating resources for the target beam position based on the hopping beam slots of the target area, the process also includes: Determine whether there is a wave position in the resource allocation result where the hopping beam slot interval is greater than the maximum hold time. If so, determine the first wave position in the resource allocation result, wherein the hopping beam slot of the first wave position is greater than a preset threshold. The hopping beam time slots of the first wave position are split; The hopping beam time slots of the unsplit wave positions and the hopping beam time slots after the first wave position is split are merged to make the hopping beam time slot interval of each wave position less than the maximum hold time.
13. The method of claim 12, wherein, Also includes: Determine whether the number of time slots for the same wavelength within a polling interval is greater than the number of hopping beam time slots for that wavelength. If so, adjust the resource allocation results.
14. A satellite payload device, wherein, include: The first calculation unit is used to determine multiple regions within the satellite's coverage area and the satellite's visibility time for each region; The second calculation unit is used to determine the hopping beam time slot of each region based on the visible time of each region. as well as The processing unit is used to determine the beam skipping strategy based on the satellite access request of the terminal device and the beam skipping time slot of the area where the terminal device is located.
15. A computer device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein, When the processor executes the computer program, it implements the method according to any one of claims 10 to 13.
16. A computer-readable storage medium storing a computer program, wherein, When the computer program is executed by the processor of a computer device, it implements the method according to any one of claims 10 to 13.
17. A computer program product, the computer program product comprising a computer program, wherein, When the computer program is executed by the processor of a computer device, it implements the method according to any one of claims 10 to 13.
