Satellite network access resource allocation method and device, space-based base station and program product

Abstract

The application provides a satellite network access resource allocation method and device, a space-based base station and a program product. The method comprises the following steps: determining the end-to-end delay satisfaction of each GBR user based on the bearer network backhaul delay of each GBR user currently accessing the satellite network; allocating access resources to each GBR user according to the end-to-end delay satisfaction of each GBR user; determining the expected value of the backhaul packet loss number of each non-GBR user according to the bearer network backhaul packet loss rate of each non-GBR user currently accessing the satellite network; and allocating access resources to each non-GBR user based on the expected value of the backhaul packet loss number of each non-GBR user. The application can realize a satellite network backhaul-aware access resource allocation method, effectively improve the flexibility of satellite network access resource allocation, improve the reliability of satellite network data transmission, and thus provide effective end-to-end service quality guarantee for the satellite network.

Description

Technical Field

[0001] This application relates to the field of satellite network technology, and in particular to satellite network access resource allocation methods, devices, satellite-borne base stations, and software products. Background Technology

[0002] Satellite networks with laser inter-satellite links (ISL) carry satellite-based base stations that provide user terminals (UEs) with functions such as user access, spectrum resource management, and mobility management. As a global communication infrastructure, satellite networks need to provide differentiated Quality of Service (QoS) for different users and applications. Existing satellite network systems follow the architecture of terrestrial mobile networks, where the access network and bearer network have independent system architectures and management processes, and access resource allocation is implemented independently within the access network. In terrestrial mobile networks, the bearer network consists of high-capacity fiber optic links, and its performance has a negligible impact on end-to-end QoS.

[0003] However, in the backhaul of laser-based inter-satellite links (ISL), the capacity of the bearer network is significantly limited because the capacity of laser or microwave links is lower than that of terrestrial fiber optic links. Furthermore, compared to the access network, ISL-based backhaul typically faces longer propagation delays. In addition, inter-satellite link disconnections, queue congestion, and packet loss further exacerbate the performance degradation of the bearer network. In other words, in satellite networks, the backhaul of the bearer network plays a more crucial role in end-to-end QoS. Existing satellite network access resource allocation methods neglect backhaul performance during allocation, failing to guarantee the rationality of satellite network access resource allocation and impacting data transmission reliability, thus hindering the provision of more effective end-to-end QoS guarantees. Summary of the Invention

[0004] In view of this, embodiments of this application provide a satellite network access resource allocation method, apparatus, onboard base station, and program product to eliminate or improve one or more defects existing in the prior art.

[0005] One aspect of this application provides a method for allocating satellite network access resources, including:

[0006] Based on the backhaul latency of the bearer network corresponding to each GBR user currently accessing the satellite network, the end-to-end latency satisfaction of each GBR user is determined, and access resources are allocated to each GBR user according to the end-to-end latency satisfaction of each GBR user.

[0007] Based on the backhaul packet loss rate of each non-GBR user currently accessing the satellite network, the expected value of the backhaul packet loss for each non-GBR user is determined, and access resources are allocated to each non-GBR user based on the expected value of the backhaul packet loss for each non-GBR user.

[0008] In some embodiments of this application, determining the end-to-end latency satisfaction of each GBR user based on the backhaul latency of the bearer network corresponding to each GBR user currently accessing the satellite network includes:

[0009] Based on the current access latency of each GBR user currently accessing the satellite network and the backhaul latency of each GBR user from the onboard router of the satellite accessing the satellite in the satellite network, the end-to-end latency of each GBR user is determined respectively.

[0010] Based on the preset end-to-end latency requirement value and the end-to-end latency corresponding to each GBR user, the end-to-end latency satisfaction value corresponding to each GBR user is determined respectively.

[0011] In some embodiments of this application, the step of allocating access resources to each GBR user based on their respective end-to-end latency satisfaction includes:

[0012] Based on the data transmission rate constraints of each GBR user currently accessing the satellite network, resource blocks that satisfy their respective data transmission rate constraints are initially allocated to each GBR user, wherein the total number of resource blocks obtained by each GBR user is less than or equal to the initial resource block number threshold.

[0013] Each GBR user and the preset resource pool are classified as different classes, wherein the resource pool contains multiple resource blocks;

[0014] Clustering game is performed on each of the classes so that each resource block is exchanged between different classes based on a preset preference relationship, so as to achieve an equilibrium state among the classes. The resource blocks in the class corresponding to each GBR user are respectively used as the access resource allocation result data corresponding to each GBR user.

[0015] In some embodiments of this application, the preference relationship includes: taking any two classes as the current original class and target class respectively; if swapping a resource block in the original class to the target class makes the sum of the first benefit functions corresponding to the original class and the target class strictly increase, then it is confirmed that there is a preference for swapping the resource block from the original class to the target class, so that the resource block is swapped from the original class to the target class;

[0016] The first benefit function is pre-constructed based on the end-to-end latency satisfaction and the data transmission rate constraint.

[0017] In some embodiments of this application, determining the expected number of backhaul packet losses for each non-GBR user based on the backhaul packet loss rate of the bearer network corresponding to each non-GBR user currently accessing the satellite network includes:

[0018] Based on the average size and transmission time interval of the data packets corresponding to each non-GBR user currently accessing the satellite network, and the backhaul packet loss rate of the bearer network corresponding to each non-GBR user obtained from the onboard router of the satellite accessing the satellite in the satellite network, the expected value of the number of backhaul packets for each non-GBR user is determined respectively.

[0019] In some embodiments of this application, the allocation of access resources to each non-GBR user based on their respective expected backhaul packet loss count includes:

[0020] Based on the expected number of backhaul packet loss, the predicted data rate, the preset priority, and the buffer length for each non-GBR user, the solution of the second benefit function for each non-GBR user is obtained respectively.

[0021] The non-GBR users are sorted according to the decreasing order of the solutions of each of the second benefit functions, and the scheduling order of each non-GBR user after sorting decreases sequentially.

[0022] The remaining resource blocks in the class corresponding to the resource pool are sequentially allocated to the sorted non-GBR users.

[0023] Another aspect of this application provides a satellite network access resource allocation device, comprising:

[0024] The backhaul delay perception and allocation module is used to determine the end-to-end delay satisfaction of each GBR user based on the backhaul delay of the bearer network corresponding to each GBR user currently accessing the satellite network, and to allocate access resources to each GBR user according to the end-to-end delay satisfaction of each GBR user.

[0025] The backhaul packet loss rate sensing and allocation module is used to determine the expected value of the backhaul packet loss number for each non-GBR user based on the backhaul packet loss rate of the bearer network corresponding to each non-GBR user currently accessing the satellite network, and to allocate access resources for each non-GBR user based on the expected value of the backhaul packet loss number for each non-GBR user.

[0026] A third aspect of this application provides a satellite-borne base station, which is installed in a satellite network. The satellite-borne base station includes a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, it implements the satellite network access resource allocation method.

[0027] A fourth aspect of this application provides a computer-readable storage medium having a computer program stored thereon that, when executed by a processor, implements the satellite network access resource allocation method described above.

[0028] A fifth aspect of this application provides a computer program product, including a computer program that, when executed by a processor, implements the satellite network access resource allocation method described above.

[0029] The satellite network access resource allocation method provided in this application determines the end-to-end latency satisfaction of each GBR user based on the backhaul latency of the bearer network corresponding to each GBR user currently accessing the satellite network, and allocates access resources to each GBR user according to their respective end-to-end latency satisfaction. It also determines the expected number of backhaul packet losses for each non-GBR user based on the backhaul packet loss rate of the bearer network corresponding to each non-GBR user currently accessing the satellite network, and allocates access resources to each non-GBR user according to their respective expected number of backhaul packet losses. This method enables a satellite network backhaul-aware access resource allocation mechanism. By using bearer network backhaul latency and packet loss rate to assist in user access resource allocation decisions, it effectively improves the rationality, flexibility, and reliability of satellite network access resource allocation, enhances the reliability of satellite network data transmission and the operational stability of the bearer network, and ultimately provides effective end-to-end Quality of Service (QoS) assurance for the satellite network.

[0030] Additional advantages, objectives, and features of this application will be set forth in part in the description which follows, and will in part become apparent to those skilled in the art upon review of the following description, or may be learned by practice of the application. The objectives and other advantages of this application can be realized and obtained by means of the structures specifically pointed out in the specification and drawings.

[0031] Those skilled in the art will understand that the purposes and advantages that can be achieved with this application are not limited to those specifically described above, and that the above and other purposes that this application can achieve will be more clearly understood from the following detailed description. Attached Figure Description

[0032] The accompanying drawings, which are included to provide a further understanding of this application and form part of this application, do not constitute a limitation thereof. The components in the drawings are not drawn to scale but are merely for illustrating the principles of this application. For ease of illustration and description of certain parts of this application, corresponding portions in the drawings may be enlarged, i.e., may appear larger relative to other components in an exemplary device actually manufactured according to this application. In the drawings:

[0033] Figure 1 This is a schematic diagram of the first process of a satellite network access resource allocation method in one embodiment of this application.

[0034] Figure 2 This is a schematic diagram of a second process of a satellite network access resource allocation method in one embodiment of this application.

[0035] Figure 3 This is a schematic diagram of the structure of a satellite network access resource allocation device in one embodiment of this application.

[0036] Figure 4 This is a schematic diagram of the system architecture for the satellite network access resource allocation method in an application example of this application.

[0037] Figure 5 This is a schematic diagram illustrating the exchange of resource blocks between classes based on preference relationships in an application example of this application.

[0038] Figure 6 This is a schematic diagram illustrating the process of allocating access resources to non-GBR users in an application example of this application. Detailed Implementation

[0039] To make the objectives, technical solutions, and advantages of this application clearer, the application will be further described in detail below with reference to the embodiments and accompanying drawings. Here, the illustrative embodiments and their descriptions are used to explain this application, but are not intended to limit it.

[0040] It should also be noted that, in order to avoid obscuring this application with unnecessary details, only the structures and / or processing steps closely related to the solution according to this application are shown in the accompanying drawings, while other details that are not closely related to this application are omitted.

[0041] It should be emphasized that the term "including / comprises" as used herein refers to the presence of a feature, element, step, or component, but does not exclude the presence or addition of one or more other features, elements, steps, or components.

[0042] It should also be noted that, unless otherwise specified, the term "connection" in this article can refer not only to a direct connection, but also to an indirect connection involving an intermediary.

[0043] In the following description, embodiments of the present application will be illustrated with reference to the accompanying drawings. In the drawings, the same reference numerals represent the same or similar parts, or the same or similar steps.

[0044] In recent years, the successful deployment of Starlink, Iridium, and OneWeb has highlighted the significant advantages of low Earth orbit (LEO) satellite networks in global wireless access, possessing broad economic, social, and strategic value in areas such as global wireless broadband access, disaster relief, and military activities. In particular, the introduction of laser inter-satellite links (ISL) has reduced reliance on ground stations, achieving global coverage. Existing access resource allocation methods in terrestrial and satellite communication systems include: classical resource allocation algorithms, resource allocation algorithms based on classical optimization methods, and resource allocation algorithms based on reinforcement learning or deep learning. Specifically:

[0045] 1. Classic resource allocation algorithms: such as maximum throughput, proportional fairness algorithm, round-robin, weighted round-robin, etc., which achieve efficient resource scheduling optimization and bandwidth management through different strategies.

[0046] 2. Resource allocation algorithm based on classical optimization methods: To achieve the above optimization objectives, the resource allocation problem is modeled as an optimization problem and solved by methods such as convex optimization, dynamic programming, Lagrange duality, Lagrange relaxation, genetic algorithm, and ant colony algorithm to solve complex engineering problems.

[0047] 3. Resource allocation algorithms based on reinforcement learning or deep learning: Policies based on reinforcement learning and deep learning have shown strong optimization and intelligent decision-making capabilities in complex and dynamic environments. Q-Learning, policy gradient methods, multi-agent reinforcement learning and other methods have been applied to wireless resource scheduling and management.

[0048] However, in existing terrestrial mobile and satellite network systems, the access network and the bearer network have independent system architectures and management processes. User access resource allocation is based on a single access network resource view and is implemented independently within the access network. Specifically, the terrestrial bearer network consists of high-capacity fiber optic links, and its performance has a negligible impact on end-to-end Quality of Service (QoS). Similarly, in ISL-based backhaul, existing solutions neglect the state of the backhaul path. Access resource allocation remains based on a single access network view, focusing on the internal optimization goals of the access network while ignoring end-to-end performance. In other words, existing satellite network access resource allocation methods neglect backhaul performance when allocating access resources, which not only fails to guarantee the rationality of satellite network access resource allocation but also affects the reliability of data transmission, thus failing to provide more effective end-to-end QoS guarantees.

[0049] Based on this, in order to solve the above-mentioned problems of existing satellite network access resource allocation methods, the embodiments of this application provide a satellite network access resource allocation method, a satellite network access resource allocation device for executing the satellite network access resource allocation method, physical equipment such as satellite-borne base stations, computer-readable storage media, and computer program products, respectively, to propose a backhaul-aware access resource allocation method for diverse user needs, with end-to-end quality of service (QoS) as the optimization goal, and jointly serving both GBR users and Non-GBR users.

[0050] The following examples will provide a detailed description.

[0051] Based on this, embodiments of this application provide a satellite network access resource allocation method that can be implemented by a satellite network access resource allocation device, see [link to relevant documentation]. Figure 1 The satellite network access resource allocation method specifically includes the following:

[0052] Step 100: Determine the end-to-end latency satisfaction of each GBR user based on the backhaul latency of the bearer network corresponding to each GBR user currently accessing the satellite network, and allocate access resources to each GBR user according to the end-to-end latency satisfaction of each GBR user.

[0053] In step 100, the satellite network access resource allocation device uses the backhaul delay of the bearer network corresponding to each GBR user to help determine the end-to-end delay satisfaction of each GBR user. This can effectively improve the accuracy and rationality of the end-to-end delay satisfaction of each GBR user, and thus improve the rationality and effectiveness of allocating access resources to each GBR user based on the end-to-end delay satisfaction.

[0054] Step 200: Determine the expected number of backhaul packet loss for each non-GBR user based on the backhaul packet loss rate of the bearer network corresponding to each non-GBR user currently accessing the satellite network, and allocate access resources for each non-GBR user based on the expected number of backhaul packet loss for each non-GBR user.

[0055] In step 200, the satellite network access resource allocation device uses the backhaul packet loss rate of the bearer network corresponding to each non-GBR user to help determine the expected value of the backhaul packet loss number for each non-GBR user. This can effectively improve the accuracy and rationality of the expected value of the backhaul packet loss number for each non-GBR user, and thus improve the rationality and effectiveness of allocating access resources for each non-GBR user based on the expected value of the backhaul packet loss number.

[0056] Understandably, based on user data rate requirements, satellite network users can be categorized into GBR users and non-GBR users (i.e., Non-GBR users). GBR users are user terminals with a guaranteed minimum transmission rate for data transmission in the satellite network, primarily used in real-time applications such as voice communication and video conferencing. Non-GBR users are user terminals without a guaranteed minimum transmission rate; for a certain period, the minimum transmission rate of the channel resources used by the user can be lower than a certain value, primarily used in non-real-time scenarios.

[0057] The resources allocated for access resources to each non-GBR user in step 200 can be the remaining currently available resource blocks after the access resources were allocated to each GBR user in step 100.

[0058] In one or more embodiments of this application, access resource allocation refers to the allocation of resource blocks, also known as physical resource blocks. A physical resource block (PRB) is an important concept in Orthogonal Frequency Division Multiplexing (OFDM) systems. It is one of the basic units used to allocate radio resources in OFDM systems and is widely used in wireless communication systems such as LTE and 5G NR. In the frequency domain, a PRB typically contains a certain number of consecutive subcarriers. In the time domain, a PRB corresponds to a set of OFDM symbols. Within a Transmission Time Interval (TTI), each resource block can be allocated to at most one user.

[0059] In this context, the bearer network of a satellite network refers to the network layer located between the satellite and the ground communication network, primarily responsible for data transmission and forwarding. The bearer network plays a crucial role in satellite communication systems, connecting the satellite network and the ground network to ensure smooth data transmission between different networks. The satellite accessed by the user terminal is called the access satellite. The satellite carries a laser terminal and can establish inter-satellite links with adjacent satellites in the same orbit or adjacent satellites in different orbits. The ground station establishes a ground-to-satellite link (GSL) with the satellite to receive return data and forward it to the ground backbone network. The satellite connected to the ground station is called the landable satellite. Globally distributed UEs select access satellites and send data to them; the access satellite forwards the data to the landable satellite via the bearer network through one or more inter-satellite links; finally, the data reaches the ground backbone network through the ground station. The satellite network mentioned in one or more embodiments of this application may refer to a satellite network with a laser inter-satellite link (ISL).

[0060] As can be seen from the above description, the satellite network access resource allocation method provided in this application embodiment can realize a satellite network backhaul-aware access resource allocation mode. By using bearer network backhaul latency and packet loss rate to assist in user access resource allocation decisions, it can effectively improve the rationality, flexibility and reliability of satellite network access resource allocation, and improve the reliability of satellite network data transmission and the operational stability of the bearer network, thereby providing effective end-to-end QoS guarantee for the satellite network.

[0061] To further improve the effectiveness and reliability of end-to-end latency satisfaction, a satellite network access resource allocation method is provided in this application embodiment, see [link to relevant documentation]. Figure 2 Step 100 in the satellite network access resource allocation method specifically includes the following:

[0062] Step 110: Based on the current access latency of each GBR user currently accessing the satellite network and the backhaul latency of each GBR user obtained from the onboard router of the satellite accessing the satellite in the satellite network, determine the current end-to-end latency of each GBR user.

[0063] Step 120: Based on the preset end-to-end latency requirement value and the end-to-end latency corresponding to each GBR user, determine the end-to-end latency satisfaction value corresponding to each GBR user.

[0064] Specifically, end-to-end delay D u The following formula is used to calculate:

[0065]

[0066] in, Let be the access latency for user u, which consists of queuing latency, transmission latency, and satellite-to-ground propagation latency. The queuing latency and transmission latency are related to the current actual user rate. The backhaul delay of the bearer network corresponding to GBR users can also be simply referred to as backhaul delay.

[0067] End-to-end latency satisfaction Γ u (Also referred to as latency satisfaction) is shown in the following formula:

[0068]

[0069] in, This represents the end-to-end latency requirement for user u.

[0070] To further improve the rationality and reliability of access resource allocation for each GBR user, a satellite network access resource allocation method is provided in this application embodiment, see [link to relevant documentation]. Figure 2 Following step 120, step 100 of the satellite network access resource allocation method further includes the following:

[0071] Step 130: Based on the data transmission rate constraints of each GBR user currently accessing the satellite network, initially allocate resource blocks that satisfy their respective data transmission rate constraints to each GBR user, wherein the total number of resource blocks obtained by each GBR user is less than or equal to the initial resource block quantity threshold.

[0072] Specifically, step 130 can be used to generate an initial solution that satisfies the user data rate constraint, thus accelerating algorithm convergence. The process is as follows: traverse each GBR user. Allocate an additional resource block k to the current user. If the current user's rate reaches the requested rate, move on to the next user; otherwise, allocate an additional resource block to that user. To ensure system spectral efficiency, the total number of resource blocks obtained by each GBR user does not exceed a certain upper limit, i.e., the initial resource block number threshold. After the above process is completed, update the clustering result S. u .

[0073] Step 140: Each GBR user and the preset resource pool are classified as different classes, wherein the resource pool contains multiple resource blocks.

[0074] It is understandable that the respective classes corresponding to each of the GBR users can be represented as S1 to S2. N The class corresponding to the resource pool can be represented as S0.

[0075] Step 150: Perform clustering game on each of the classes so that each of the resource blocks can be exchanged between different classes based on a preset preference relationship, so as to achieve an equilibrium state among the classes, and use the resource blocks in the class corresponding to each GBR user as the access resource allocation result data corresponding to each GBR user.

[0076] Specifically, to solve the optimization objective of maximizing GBR users' latency satisfaction, this application transforms it into a clustering game process. Each user corresponds to a cluster, and the clustering result is represented as S. u And each resource block This corresponds to an individual. After clustering begins, resource blocks can choose to leave one cluster and join any other cluster. Through game theory, clustering eventually reaches an equilibrium state, meaning that no individual can gain higher overall utility by unilaterally changing its strategy.

[0077] The optimization objective is as follows:

[0078]

[0079] Based on this, in order to further improve the effectiveness and reliability of clustering game theory, in a satellite network access resource allocation method provided in this application embodiment, the preference relationship in the satellite network access resource allocation method includes: taking any two classes as the current original class and target class respectively; if exchanging a resource block in the original class to the target class makes the sum of the first benefit functions corresponding to the original class and the target class strictly increase, then it is confirmed that the resource block has a preference to be exchanged from the original class to the target class, so that the resource block is exchanged from the original class to the target class;

[0080] The first benefit function is pre-constructed based on the end-to-end latency satisfaction and the data transmission rate constraint.

[0081] Specifically, based on the initial solution that satisfies the data rate constraint, this application proposes an end-to-end latency optimization step. Specifically, an additional number of resource blocks are allocated as a resource pool to perform end-to-end latency compensation for GBR users. The number of resource blocks used for latency optimization is determined by engineering experience. The allocation strategy for the additional resource blocks is determined based on a clustering game theory method, implemented as follows:

[0082] First, an additional class S0 is defined as the initial resource pool, which is filled with additional resource blocks for performing latency optimization.

[0083] The association between any user and resource block produces a corresponding clustering benefit. Based on rate constraints and latency compensation objectives, the first benefit function U(S) u)The definitions are as follows:

[0084]

[0085] The first benefit function is explained as follows:

[0086] 1) The data rate obtained by any user u should not be less than its guaranteed bit rate Otherwise, the user benefit is -∞.

[0087] 2) S1 to S N represents the class corresponding to the user, where N is the total number of GBR users; specifically, S0 is the initial resource pool for loading additional resource blocks for performing delay optimization; when any resource block is in S0, the benefit generated is 0.

[0088] 3) In other cases, the benefit function of this class is equal to the delay satisfaction degree of this user.

[0089] In a clustering game, individuals exchange based on the preference relationship. For resource block k, the preference relationship > k is defined as follows:

[0090]

[0091] That is, resource block k is willing to leave the j-th class S j and join the i-th class S i , if and only if this exchange strictly increases the sum of the utility functions of S i and S j . Here, the sum of the two functions being strictly increasing means that after adding the two functions, the new function obtained has the property of a strictly increasing function within its domain. A strictly increasing function means that for a function f defined on a certain set D, if for any two elements x1 and x2 (x1 < x2) in D, there is f(x1) < f(x2), then f is called a strictly increasing function on D.

[0092] After clustering starts, all resource blocks exchange between classes based on the preference relationship until an equilibrium state is reached.

[0093] To further improve the application effectiveness and reliability of the expected value of the number of backhaul packet losses of each of the non - GBR users, in a satellite network access resource allocation method provided in an embodiment of the present application, refer to Figure 2 , step 200 in the satellite network access resource allocation method specifically includes the following content:

[0094] Step 210: Based on the average size and transmission time interval of the data packets corresponding to each non-GBR user currently accessing the satellite network, and the backhaul packet loss rate of the bearer network corresponding to each non-GBR user obtained from the onboard router of the satellite accessing the satellite in the satellite network, determine the expected value of the number of backhaul packets for each non-GBR user.

[0095] Specifically, the expected number of packet losses during the return trip. The following formula is used to calculate:

[0096]

[0097] Among them, T TTI It is the duration of the Transmission Time Interval (TTI), which can be simply referred to as the transmission time interval. It is the smallest unit of time for scheduling and resource allocation. For example, T... TTI The value can be 1ms. u Let L be the achievable data rate for user u under a given allocation result, i.e., the predicted data rate, which is obtained based on the Shannon formula. u That is, the current backhaul packet loss rate of user u's bearer network, which can be simply referred to as the backhaul packet loss rate, P. avg This is the average size of each data packet (i.e., the average size of the data packets).

[0098] To further improve the rationality and reliability of access resource allocation for each non-GBR user, a satellite network access resource allocation method is provided in this application embodiment, see [link to relevant documentation]. Figure 2 Following step 210, step 200 of the satellite network access resource allocation method further includes the following:

[0099] Step 220: Based on the expected number of backhaul packet loss, the predicted data rate, the preset priority, and the buffer length for each non-GBR user, obtain the solution of the second benefit function for each non-GBR user.

[0100] Specifically, the second benefit function R u The expression is as follows:

[0101]

[0102] Among them, P u Priority for user u; Q u ω1, ω2, and ω3 are weighted parameters that satisfy ω1+ω2+ω3=1 and each takes a value in the range [0,1]. This refers to the set of non-GBR users currently connected to the satellite network.u This is a user access variable, indicating whether user u receives resource allocation in the current time slot. A value of 1 indicates that a certain amount of resources has been allocated, while a value of 0 indicates that no resources have been allocated.

[0103] Therefore, the Non-GBR user resource allocation problem can be transformed into the following optimization problem:

[0104]

[0105] This problem is a classic 0-1 knapsack problem, which requires finding the optimal scheduling order for users to obtain the optimal allocation scheme.

[0106] Step 230: Sort each of the non-GBR users according to the decreasing order of the solutions of each of the second benefit functions, and the scheduling order of each of the sorted non-GBR users decreases sequentially.

[0107] Step 240: Distribute the remaining resource blocks in the class corresponding to the resource pool to the sorted non-GBR users in sequence.

[0108] To further improve the effectiveness and reliability of obtaining backhaul path status, in a satellite network access resource allocation method provided in this application embodiment, the onboard router can pre-store bearer network backhaul status information;

[0109] The backhaul status information of the bearer network includes the correspondence between: user unique identifier, bearer network backhaul path, reachability status, bearer network backhaul delay, and bearer network backhaul packet loss rate.

[0110] From a software perspective, this application also provides a satellite network access resource allocation apparatus for performing all or part of the satellite network access resource allocation method described above, see [link to relevant documentation]. Figure 3 The satellite network access resource allocation device specifically includes the following components:

[0111] The backhaul delay perception and allocation module 10 is used to determine the end-to-end delay satisfaction of each GBR user based on the backhaul delay of the bearer network corresponding to each GBR user currently accessing the satellite network, and to allocate access resources to each GBR user according to the end-to-end delay satisfaction of each GBR user.

[0112] The backhaul packet loss rate sensing and allocation module 20 is used to determine the expected value of the backhaul packet loss number for each non-GBR user according to the backhaul packet loss rate of the bearer network for each non-GBR user currently accessing the satellite network, and to allocate access resources for each non-GBR user based on the expected value of the backhaul packet loss number for each non-GBR user.

[0113] The embodiments of the satellite network access resource allocation device provided in this application can be used to execute the processing flow of the embodiments of the satellite network access resource allocation method described above. Its functions will not be repeated here, but can be referred to the detailed description of the embodiments of the satellite network access resource allocation method described above.

[0114] The satellite network access resource allocation part of the satellite network access resource allocation device can be completed in a server or client device, for example, it can be executed in a satellite-borne base station. The specific choice depends on the processing capability of the client device and the limitations of the user's usage scenario. This application does not impose any limitations on this. If all operations are completed in the client device, the client device may further include a processor for the specific processing of satellite network access resource allocation.

[0115] The aforementioned client device may have a communication module (i.e., a communication unit) that can communicate with a remote server to achieve data transmission. The server may include a server on the task scheduling center side; in other implementation scenarios, it may also include a server on an intermediate platform, such as a server on a third-party server platform that has a communication link with the task scheduling center server. The server may include a single computer device, a server cluster consisting of multiple servers, or a distributed server structure.

[0116] The server and the client device can communicate using any suitable network protocol, including those not yet developed as of the date of this application. Such network protocols may include, for example, TCP / IP, UDP / IP, HTTP, HTTPS, etc. Furthermore, such network protocols may also include RPC (Remote Procedure Call Protocol) and REST (Representational State Transfer Protocol) protocols used on top of the aforementioned protocols.

[0117] As can be seen from the above description, the satellite network access resource allocation device provided in this application embodiment can realize a satellite network backhaul-aware access resource allocation method. By using bearer network backhaul latency and packet loss rate to assist in user access resource allocation decisions, it can effectively improve the rationality, flexibility and reliability of satellite network access resource allocation, and improve the reliability of satellite network data transmission and the operational stability of the bearer network, thereby providing effective end-to-end QoS guarantee for the satellite network.

[0118] Based on this, this application also provides a satellite-borne base station, which is installed in a satellite network. The satellite-borne base station may include a processor, a memory, a receiver, and a transmitter. The processor is used to execute the satellite network access resource allocation method mentioned in the above embodiments. The processor and the memory can be connected via a bus or other means, taking a bus connection as an example. The receiver can be connected to the processor and the memory via wired or wireless means.

[0119] The processor can be a central processing unit (CPU). The processor can also be other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, or combinations of the above types of chips.

[0120] Memory, as a non-transitory computer-readable storage medium, can be used to store non-transitory software programs, non-transitory computer-executable programs, and modules, such as the program instructions / modules corresponding to the satellite network access resource allocation method in the embodiments of this application. The processor executes various functional applications and data processing by running the non-transitory software programs, instructions, and modules stored in the memory, thereby implementing the satellite network access resource allocation method in the above method embodiments.

[0121] The memory may include a program storage area and a data storage area. The program storage area may store the operating system and applications required for at least one function; the data storage area may store data created by the processor, etc. Furthermore, the memory may include high-speed random access memory and non-transitory memory, such as at least one disk storage device, flash memory device, or other non-transitory solid-state storage device. In some embodiments, the memory may optionally include memory remotely located relative to the processor, which can be connected to the processor via a network. Examples of such networks include, but are not limited to, the Internet, corporate intranets, local area networks, mobile communication networks, and combinations thereof.

[0122] The one or more modules are stored in the memory, and when executed by the processor, the satellite network access resource allocation method in the embodiment is executed.

[0123] In some embodiments of this application, the user equipment may include a processor, a memory, and a transceiver unit. The transceiver unit may include a receiver and a transmitter. The processor, memory, receiver, and transmitter may be connected via a bus system. The memory is used to store computer instructions, and the processor is used to execute the computer instructions stored in the memory to control the transceiver unit to send and receive signals.

[0124] As one implementation method, the functions of the receiver and transmitter in this application can be implemented by transceiver circuits or dedicated transceiver chips, and the processor can be implemented by dedicated processing chips, processing circuits or general-purpose chips.

[0125] As another implementation approach, the server provided in this application embodiment can be implemented using a general-purpose computer. That is, the program code implementing the processor, receiver, and transmitter functions is stored in memory, and the general-purpose processor implements the processor, receiver, and transmitter functions by executing the code in memory.

[0126] This application also provides a computer-readable storage medium storing a computer program thereon, which, when executed by a processor, implements the steps of the aforementioned satellite network access resource allocation method. The computer-readable storage medium can be a tangible storage medium, such as random access memory (RAM), main memory, read-only memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, floppy disks, hard disks, removable storage disks, CD-ROMs, or any other form of storage medium known in the art.

[0127] This application also provides a computer program product, including a computer program that, when executed by a processor, implements the steps of the aforementioned satellite network access resource allocation method.

[0128] To further illustrate the above embodiments, this application also provides a specific application example of a satellite network access resource allocation method, namely, a satellite network backhaul-aware access resource allocation method. In this application example, the backhaul path information (backhaul latency, packet loss rate, etc.) of the satellite bearer network is exposed to the satellite-based base station to assist the base station in making access resource allocation decisions. First, for GBR users, backhaul latency awareness is achieved. While meeting user rate requirements, user backhaul latency and end-to-end latency constraints are considered to optimize end-to-end latency satisfaction. Next, for Non-GBR users, backhaul reliability awareness is achieved. While optimizing system throughput, temporary service degradation is performed on users with high backhaul packet loss rates. Long-term service degradation may cause user fairness issues; this problem is addressed by considering the UE buffer state.

[0129] The satellite network access resource allocation method provided in the application example targets a system architecture that is described in [reference needed]. Figure 4 Among them, UE1, UE2 and UE n Since all users are involved, the essence of the resource allocation problem is the resource block-user association problem. (Definition) The set of GBR and Non-GBR users to be scheduled. This is a set of resource blocks available for scheduling. This application example first describes the detection and storage scheme for the return path status; then it elaborates on the resource allocation strategy design around two aspects: GBR user resource allocation and Non-GBR user resource allocation. Specifically, this application example includes the following:

[0130] 1. Enter the user attributes and QoS requirements for GBR users and Non-GBR users. QoS requirements for GBR users include end-to-end latency and data rate; Non-GBR users have no rate or latency requirements.

[0131] Specifically, in a satellite bearer network based on Software Defined Network (SDN), the onboard routers accessing the satellite cache user backhaul paths and their attributes to indicate packet forwarding paths. The access satellite uses multiple detection methods to detect and cache user service backhaul path latency, packet loss rate, and reachability status.

[0132] The backhaul delay and backhaul packet loss rate mentioned above both refer to the path delay or packet loss rate of the bearer network portion.

[0133] 2. First, GBR users are allocated resources. Each user receives a certain number of resource blocks until the actual data rate obtained by the user meets its QoS requirements.

[0134] As a sub-stage allocated by GBR users, latency compensation is performed. Based on the initial solution obtained in the previous step, S1 to S... N Updated; based on practical experience, the number of additional resource blocks used for latency compensation is determined, and the corresponding number of resource blocks are placed in S0, completing the latency compensation algorithm initialization. After the clustering game begins, individual resource blocks are exchanged between the corresponding clusters of each user based on preference relationships, during which the total system benefit strictly increases. Until all individuals have no intention of exchanging, the system reaches an equilibrium state, and latency compensation ends. If all users achieve 100% latency satisfaction, some resource blocks in S0 will remain in S0 and will be used for the next stage of Non-GBR users.

[0135] Specifically, in this application example, GBR users are scheduled first. The data rate received by any user should not be less than its guaranteed bit rate. Under this constraint, this application example proposes to perform end-to-end latency optimization for GBR users. The latency optimization is modeled as a clustering game problem and solved using a swap-based method.

[0136] First, define the latency satisfaction of GBR users. Let D be the end-to-end latency requirement for user u. u The actual end-to-end latency for the user under the current resource allocation. The end-to-end latency consists of two parts: access network latency and backhaul latency, as defined in the aforementioned formula (1). The end-to-end latency satisfaction is defined in the aforementioned formula (2). The optimization objective of this sub-process can be expressed as the above formula (3), that is, to maximize the latency satisfaction of GBR users.

[0137] To solve the above problem, this application example transforms it into a clustering game process. Each user corresponds to a cluster, and the clustering result is represented as S. u And each resource block This corresponds to an individual. After clustering begins, resource blocks can choose to leave one cluster and join any other cluster. Through game theory, clustering eventually reaches an equilibrium state, meaning that no individual can gain higher overall utility by unilaterally changing its strategy.

[0138] This sub-process consists of two stages: initial solution generation and time delay compensation.

[0139] 2.1 Initial Solution Generation

[0140] Generate an initial solution that satisfies the user data rate constraint to accelerate algorithm convergence. The process is as follows: Iterate through all GBR users. Allocate an additional resource block k to the current user. If the current user's rate reaches the requested rate, move on to the next user; otherwise, allocate an additional resource block to that user. To ensure system spectral efficiency, the total number of resource blocks allocated to each GBR user does not exceed a certain upper limit, i.e., the initial resource block number threshold. After the above process is completed, update the clustering result S. u .

[0141] 2.2 End-to-end latency optimization

[0142] Based on the initial solution that satisfies the data rate constraint, this application example proposes an end-to-end latency optimization step. Specifically, an additional number of resource blocks are allocated as a resource pool to perform end-to-end latency compensation for GBR users. The number of resource blocks used for latency optimization is determined by engineering experience. The allocation strategy for the additional resource blocks is determined based on a clustering game theory method, implemented as follows:

[0143] First, an additional class S0 is defined as the initial resource pool, which is filled with additional resource blocks for performing latency optimization.

[0144] The association between any user and resource block produces a corresponding clustering benefit. Based on the rate constraint and the delay compensation objective, the first benefit function is defined as shown in the aforementioned formula (4).

[0145] The first benefit function is explained as follows:

[0146] 1) The data rate obtained by any user u should not be less than its guaranteed bit rate. Otherwise, the user benefit is -∞.

[0147] 2) S1~S N This represents the class corresponding to the user, where N is the total number of GBR users; in particular, S0 is the initial resource pool used to load additional resource blocks for performing latency optimization; the benefit generated when any resource block is in S0 is 0.

[0148] 3) In other cases, the benefit function of this type is equal to the user's latency satisfaction.

[0149] In a clustering game, individuals exchange resources based on preference relationships. For resource block k, define the preference relationship as > k As shown in formula (5), resource block k is willing to leave S. j And joining S i If and only if this exchange makes S i With S j The sum of the utility functions is strictly increasing. In this case, the sum of the two functions is strictly increasing because when the two functions are added, the new function obtained has the property of being a strictly increasing function within its domain.

[0150] See Figure 5 After clustering begins, all resource blocks are exchanged between clusters based on preference relationships until an equilibrium state is reached.

[0151] 3. After GBR user allocation is completed, the remaining resource blocks are used for Non-GBR user allocation. An optimal user scheduling order is obtained based on a certain optimization method. Based on the optimal scheduling order, the next user to be allocated is determined sequentially, and allocation is performed based on the number of remaining resource blocks. If no remaining resource blocks are available, the algorithm terminates.

[0152] Specifically, after GBR users are allocated, the remaining resource blocks that have not yet been allocated form a resource pool to be allocated to Non-GBR users. Non-GBR users do not enjoy guaranteed data rates and are only provided with best-effort service. Setting the number of Non-GBR users is overloaded, meaning that the capacity of a single time slot cannot serve all Non-GBR users. Therefore, the resource block-user association problem is transformed into a user scheduling order optimization problem.

[0153] First, set the user access variable m. u This indicates whether user u has received resource allocation in the current time slot. A value of 1 indicates that a certain amount of resources has been allocated, while a value of 0 indicates that no resources have been allocated.

[0154] In this application example, see Figure 6 The optimal user scheduling order is determined first, and resources are allocated to each user according to this optimal order to maximize system efficiency.

[0155] For any Non-GBR user, the number of resource blocks they acquire should not exceed a constant. A second benefit function based on user data rate, expected packet loss rate, and UE buffer state is defined as shown in formula (7) above.

[0156] in, The mathematical expectation of the number of backhaul packet losses for user u under the current allocation result is shown in the aforementioned formula (6).

[0157] Therefore, the Non-GBR user resource allocation problem can be transformed into an optimization problem as shown in Equation (8).

[0158] This problem is a classic 0-1 knapsack problem, which requires finding the optimal scheduling order for users to obtain the optimal allocation scheme.

[0159] Based on this, the improvements provided in the application examples of this application include at least the following:

[0160] 1. This application example proposes a backhaul-aware access resource allocation method and process in a wireless communication system using satellite backhaul.

[0161] 2. This application example proposes to synchronize the backhaul path status information (backhaul latency, packet loss rate, etc.) of the satellite bearer network to the satellite base station to assist the base station in making user access resource allocation decisions.

[0162] 3. This application example proposes a strategy for optimizing end-to-end latency for GBR users in a wireless communication system using satellite backhaul, based on backhaul latency of the bearer network and end-to-end latency constraints. The latency optimization is modeled as a clustering game problem and solved using a swap-based method.

[0163] 4. This application example proposes a resource allocation strategy for Non-GBR users in a wireless communication system using satellite backhaul, based on the reliability of the bearer network backhaul. The scheme implements temporary service degradation for Non-GBR users with high backhaul packet loss rates; and introduces UE buffer states to avoid system fairness issues caused by service degradation.

[0164] 5. Based on points 3 and 4 above, this application example proposes a joint resource allocation framework for GBR users and Non-GBR users in a wireless communication system using satellite backhaul.

[0165] 6. This application example proposes a method and form for detecting and storing the return path status.

[0166] Those skilled in the art will understand that the exemplary components, systems, and methods described in conjunction with the embodiments disclosed herein can be implemented in hardware, software, or a combination of both. Whether 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. When implemented in hardware, it can be, for example, electronic circuits, application-specific integrated circuits (ASICs), appropriate firmware, plug-ins, function cards, etc. When implemented in software, the elements of this application are programs or code segments used to perform the required tasks. The programs or code segments can be stored in a machine-readable medium or transmitted over a transmission medium or communication link via data signals carried on a carrier wave.

[0167] It should be clarified that this application is not limited to the specific configurations and processes described above and shown in the figures. For the sake of brevity, detailed descriptions of known methods are omitted here. In the above embodiments, several specific steps are described and shown as examples. However, the method process of this application is not limited to the specific steps described and shown. Those skilled in the art can make various changes, modifications, and additions, or change the order of steps, after understanding the spirit of this application.

[0168] In this application, features described and / or illustrated for one embodiment may be used in the same or similar manner in one or more other embodiments, and / or combined with or in place of features of other embodiments.

[0169] The above description is merely a preferred embodiment of this application and is not intended to limit this application. Various modifications and variations can be made to the embodiments of this application by those skilled in the art. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of this application should be included within the protection scope of this application.

Claims

1. A method for allocating satellite network access resources, characterized in that, include: Based on the backhaul latency of each GBR user currently accessing the satellite network, the end-to-end latency satisfaction of each GBR user is determined. According to the data transmission rate constraints of each GBR user, resource blocks satisfying their respective data transmission rate constraints are initially allocated to each GBR user, wherein the total number of resource blocks obtained by each GBR user is less than or equal to an initial resource block quantity threshold. Each GBR user and a preset resource pool are classified as different classes, wherein each resource pool contains multiple resource blocks. Clustering game theory is performed on each class to allow resource blocks to be exchanged between different classes based on preset preference relationships, thereby achieving an equilibrium state among the classes. The resource blocks in each class corresponding to each GBR user are then used as the access resource allocation result data for each GBR user. Based on the backhaul packet loss rate of each non-GBR user currently accessing the satellite network, the expected number of backhaul packet losses for each non-GBR user is determined. Then, based on the expected number of backhaul packet losses, predicted data rate, preset priority, and buffer length for each non-GBR user, the solution of the second benefit function for each non-GBR user is obtained. The non-GBR users are sorted in descending order of the solutions to the second benefit functions, and the scheduling order for each sorted non-GBR user decreases sequentially. The remaining resource blocks in the class corresponding to the resource pool are then sequentially allocated to the sorted non-GBR users.

2. The satellite network access resource allocation method according to claim 1, characterized in that, The determination of the end-to-end latency satisfaction of each GBR user based on the backhaul latency of the bearer network corresponding to each GBR user currently accessing the satellite network includes: Based on the current access latency of each GBR user currently accessing the satellite network and the backhaul latency of each GBR user from the onboard router of the satellite accessing the satellite in the satellite network, the end-to-end latency of each GBR user is determined respectively. Based on the preset end-to-end latency requirement value and the end-to-end latency corresponding to each GBR user, the end-to-end latency satisfaction value corresponding to each GBR user is determined respectively.

3. The satellite network access resource allocation method according to claim 1, characterized in that, The preference relationship includes: taking any two classes as the current original class and target class respectively; if swapping a resource block in the original class to the target class makes the sum of the first benefit functions corresponding to the original class and the target class strictly increase, then it is confirmed that there is a preference for swapping the resource block from the original class to the target class, so that the resource block is swapped from the original class to the target class; The first benefit function is pre-constructed based on the end-to-end latency satisfaction and the data transmission rate constraint.

4. The satellite network access resource allocation method according to claim 1, characterized in that, The step of determining the expected number of backhaul packet losses for each non-GBR user based on the backhaul packet loss rate of the bearer network corresponding to each non-GBR user currently accessing the satellite network includes: Based on the average size and transmission time interval of the data packets corresponding to each non-GBR user currently accessing the satellite network, and the backhaul packet loss rate of the bearer network corresponding to each non-GBR user obtained from the onboard router of the satellite accessing the satellite in the satellite network, the expected value of the number of backhaul packets for each non-GBR user is determined respectively.

5. A satellite network access resource allocation device, characterized in that, include: The backhaul latency-aware allocation module is used to determine the end-to-end latency satisfaction of each GBR user based on the backhaul latency of the bearer network corresponding to each GBR user currently accessing the satellite network, and to initially allocate resource blocks that satisfy the corresponding data transmission rate constraints to each GBR user according to the data transmission rate constraints corresponding to each GBR user, wherein the total number of resource blocks obtained by each GBR user is less than or equal to the initial resource block number threshold; classifying each GBR user and a preset resource pool as different classes, wherein the resource pool contains multiple resource blocks; performing clustering game on each class to allow each resource block to be exchanged between different classes based on a preset preference relationship, so as to achieve an equilibrium state among the classes, and using the resource blocks in the class corresponding to each GBR user as the access resource allocation result data corresponding to each GBR user; The backhaul packet loss rate sensing and allocation module is used to determine the expected number of backhaul packet losses for each non-GBR user based on the backhaul packet loss rate of the bearer network corresponding to each non-GBR user currently accessing the satellite network, and to obtain the solution of the second benefit function for each non-GBR user based on the expected number of backhaul packet losses, the predicted data rate, the preset priority, and the buffer length. The module sorts the non-GBR users according to the descending order of the solutions of the second benefit function, and the scheduling order of each sorted non-GBR user decreases sequentially. Finally, the module allocates the remaining resource blocks in the class corresponding to the resource pool to the sorted non-GBR users sequentially.

6. A spaceborne base station, installed in a satellite network, the spaceborne base station comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the computer program, it implements the satellite network access resource allocation method as described in any one of claims 1 to 4.

7. A computer-readable storage medium having a computer program stored thereon, characterized in that, When executed by a processor, the computer program implements the satellite network access resource allocation method as described in any one of claims 1 to 4.

8. A computer program product, comprising a computer program, characterized in that, When executed by a processor, the computer program implements the satellite network access resource allocation method as described in any one of claims 1 to 4.

Images