Relay resource allocation method and system, computer equipment and storage medium

Through the improved two-stage scheduling mechanism of the proportional fair algorithm, the shortcomings of the existing relay resource scheduling strategies in terms of throughput, fairness and load changes are solved, and more efficient and stable resource allocation is achieved.

CN119729877AInactive Publication Date: 2025-03-28CHINA SOUTHERN POWER GRID COMPANY
View PDF 7 Cites 0 Cited by

Patent Information

Application Number
CN202411818811.2
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-12-11
Publication Date
2025-03-28
Estimated Expiration
Not applicable · inactive patent

AI Technical Summary

Technical Problem

Existing relay resource scheduling strategies, such as polling, maximum load-to-dry ratio algorithm and proportional fairness algorithm, have problems with low throughput, poor fairness, or are difficult to deal with dynamically changing network load when the number of users surges.

Method used

Using the two-stage scheduling mechanism of an improved proportional fair algorithm, the user priority is dynamically adjusted through a scheduling framework combining time domain and frequency domain to ensure the throughput and stability of the system when the number of users fluctuates.

Benefits of technology

It improves the system's resource utilization and throughput, ensures fairness among users, and maintains the system's efficiency and stability when network load fluctuates.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119729877A_ABST
    Figure CN119729877A_ABST
Patent Text Reader

Abstract

The invention relates to the technical field of relay resource allocation, and discloses a relay resource allocation method and system, computer equipment and a storage medium, and the method comprises the steps: calculating the scheduling priority of each relay user on each resource block through employing an improved proportional fairness algorithm according to an orthogonal frequency division multiplexing relay system model, carrying out descending sorting on all relay users according to the scheduling priorities to obtain a relay user sequence; calculating the allocation priority of each relay user according to the channel gain of the relay user on the resource block and the scheduling priority, and updating the relay user sequence according to the allocation priority; and according to the updated relay user sequence, allocating the resource blocks to each relay user in sequence. Through a two-stage scheduling strategy, the resource utilization rate of the system is improved while the fairness of the user is ensured, and the high efficiency and stability of system operation are further improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of relay resource allocation, and in particular to a relay resource allocation method, system, computer equipment and storage medium. Background Art

[0002] In the field of communications, with the rapid development and technological progress of mobile Internet, especially the growth in the number of users and the increase in demand for diversified services, higher requirements have been placed on the effective use of network resources and service quality. Relay technology has received widespread attention as an effective communication solution. By introducing relay nodes between the sender and the receiver, relay technology can not only expand the communication range and improve transmission reliability, but also effectively reduce energy consumption. Relay nodes receive signals from the sender and forward them to the receiver, thereby helping to achieve long-distance transmission of signals.

[0003] However, the introduction of relay technology also brings about the problem of resource allocation. Currently, the commonly used relay resource scheduling strategies mainly include polling, maximum carrier-to-interference ratio algorithm and proportional fairness algorithm. Although these scheduling strategies can achieve resource allocation, they still have certain limitations. Among them, although the polling algorithm ensures fairness by providing service opportunities to each user in turn, its overall throughput is low and it cannot effectively utilize limited spectrum resources; the maximum carrier-to-interference ratio algorithm usually gives priority to users with the best channel conditions by maximizing the throughput at each scheduling. However, this method often sacrifices fairness among users, resulting in poor experience for some users; the proportional fairness algorithm finds a compromise between throughput and user fairness, taking into account performance and fairness to a certain extent, but when the number of users increases significantly, its performance will decline significantly, especially when the number of users surges, the algorithm is difficult to cope with dynamically changing network load conditions. Summary of the invention

[0004] In order to solve the above technical problems, the present invention provides a relay resource allocation method, system, computer device and storage medium, which optimizes the resource allocation process by introducing a two-stage scheduling mechanism of an improved proportional fairness algorithm, thereby achieving the effect of improving the system throughput and the stability of system operation.

[0005] In a first aspect, the present invention provides a method for allocating relay resources, the method comprising:

[0006] An orthogonal frequency division multiplexing relay system model is established based on regional parameters of the communication area, wherein the regional parameters include a relay user set and a resource block set;

[0007] According to the OFDM relay system model, an improved proportional fairness algorithm is used to calculate the scheduling priority of each relay user on each resource block, and all relay users are sorted in descending order according to the scheduling priority to obtain a relay user sequence;

[0008] Calculating the allocation priority of each relay user according to the channel gain of the relay user on the resource block and the scheduling priority, and updating the relay user sequence according to the allocation priority;

[0009] The resource blocks are allocated to each relay user in sequence according to the updated relay user sequence.

[0010] Furthermore, the step of using the improved proportional fairness algorithm to calculate the scheduling priority of each relay user on each resource block includes:

[0011] Get the current rate of the relay user and calculate the average rate of the relay user in the historical period;

[0012] Determining a first adjustment factor according to the number of relay users, system load, and channel quality;

[0013] Determine a second adjustment factor according to system service quality requirements;

[0014] The scheduling priority of each relay user on each resource block is calculated according to the current rate, the average rate, the first adjustment factor, and the second adjustment factor.

[0015] Furthermore, the scheduling priority is expressed by the following formula:

[0016]

[0017] Where P i (t) represents the scheduling priority of the i-th relay user at time t, R i (t) represents the rate of the i-th relay user at time t, represents the average rate of the i-th relay user at time t-1, γ represents the first adjustment factor, w represents the second adjustment factor, Qos i represents the service quality requirement of the i-th relay user, Delay i represents the current delay of the ith relay user, e i represents the bit error rate of the i-th relay user;

[0018] The first adjustment factor is expressed by the following formula:

[0019]

[0020] Where N represents the current number of relay users, N0 represents the reference number of relay users, k1, k2, and k3 represent the first, second, and third coefficients, respectively, ρ represents the proportion of allocated resources, ρ0 represents the reference load ratio, SNR represents the system average channel signal-to-noise ratio, and SNR0 represents the reference signal-to-noise ratio.

[0021] Further, the step of calculating the allocation priority of each relay user according to the channel gain of the relay user on the resource block and the scheduling priority includes:

[0022] Obtaining a channel gain and a signal-to-interference ratio of a relay user on the resource block;

[0023] Calculating a channel gain factor according to the channel gain and a maximum value of the system channel gain;

[0024] Calculating a signal-to-interference ratio factor according to the signal-to-interference ratio and the maximum value of the system signal-to-interference ratio;

[0025] The allocation priority of each relay user is calculated according to the scheduling priority, the channel gain factor and the signal-to-interference ratio factor.

[0026] Furthermore, the allocation priority is expressed by the following formula:

[0027]

[0028] Where P i,j represents the allocation priority of the i-th relay user on the j-th resource block, P i (t) represents the scheduling priority of the i-th relay user at time t, G i,j represents the channel gain of the i-th relay user on the j-th resource block, G max Indicates the maximum system channel gain, S i,j represents the signal-to-interference ratio of the i-th relay user on the j-th resource block, S max It represents the maximum value of the system signal-to-interference ratio, and λ and μ both represent adjustment constants.

[0029] In a second aspect, the present invention provides a relay resource allocation system, the system comprising:

[0030] A model building module, used to establish an orthogonal frequency division multiplexing relay system model based on regional parameters of the communication area, wherein the regional parameters include a relay user set and a resource block set;

[0031] A time domain scheduling module, used to calculate the scheduling priority of each relay user on each resource block according to the orthogonal frequency division multiplexing relay system model and adopt an improved proportional fairness algorithm, and sort all relay users in descending order according to the scheduling priority to obtain a relay user sequence;

[0032] A frequency domain scheduling module, configured to calculate the allocation priority of each relay user according to the channel gain of the relay user on the resource block and the scheduling priority, and update the relay user sequence according to the allocation priority;

[0033] The resource allocation module is used to allocate the resource blocks to each relay user in sequence according to the updated relay user sequence.

[0034] Furthermore, the time domain scheduling module is also used to obtain the current rate of the relay user and calculate the average rate of the relay user in the historical period;

[0035] Determining a first adjustment factor according to the number of relay users, system load, and channel quality;

[0036] Determine a second adjustment factor according to system service quality requirements;

[0037] The scheduling priority of each relay user on each resource block is calculated according to the current rate, the average rate, the first adjustment factor, and the second adjustment factor.

[0038] Furthermore, the frequency domain scheduling module is also used to obtain the channel gain and signal-to-interference ratio of the relay user on the resource block;

[0039] Calculating a channel gain factor according to the channel gain and a maximum value of the system channel gain;

[0040] Calculating a signal-to-interference ratio factor according to the signal-to-interference ratio and the maximum value of the system signal-to-interference ratio;

[0041] The allocation priority of each relay user is calculated according to the scheduling priority, the channel gain factor and the signal-to-interference ratio factor.

[0042] In a third aspect, an embodiment of the present invention further provides a computer device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of the above method when executing the computer program.

[0043] In a fourth aspect, an embodiment of the present invention further provides a computer-readable storage medium having a computer program stored thereon, wherein the computer program implements the steps of the above method when executed by a processor.

[0044] The present invention provides a relay resource allocation method, system, computer device and storage medium. The present invention adopts a two-stage scheduling framework combining time domain and frequency domain, and dynamically adjusts the priority of users through an improved proportional fairness algorithm, which can improve the utilization rate of system allocation resources while ensuring the fairness of users, and can ensure the stability and efficiency of communication system operation when the network load fluctuates greatly. BRIEF DESCRIPTION OF THE DRAWINGS

[0045] Figure 1 is a schematic diagram of a flow chart of a relay resource allocation method according to an embodiment of the present invention;

[0046] Figure 2 It is a structural diagram of an OFDM relay system model according to an embodiment of the present invention;

[0047] Figure 3 is a schematic diagram of the structure of a relay resource allocation system according to an embodiment of the present invention;

[0048] Figure 4 It is a diagram of the internal structure of a computer device in an embodiment of the present invention. DETAILED DESCRIPTION

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

[0050] See also Figure 1 , a relay resource allocation method proposed in the first embodiment of the present invention includes steps S10 to S40:

[0051] Step S10, establishing an orthogonal frequency division multiplexing relay system model based on regional parameters of the communication area, wherein the regional parameters include a relay user set and a resource block set;

[0052] Step S20, according to the OFDM relay system model, using an improved proportional fairness algorithm, calculating the scheduling priority of each relay user on each resource block, and sorting all relay users in descending order according to the scheduling priority to obtain a relay user sequence;

[0053] Step S30, calculating the allocation priority of each relay user according to the channel gain of the relay user on the resource block and the scheduling priority, and updating the relay user sequence according to the allocation priority;

[0054] Step S40: allocating the resource blocks to each relay user in sequence according to the updated relay user sequence.

[0055] In the present invention, an orthogonal frequency division multiplexing (OFDM) relay system model is first established according to the regional parameters of the communication area, see Figure 2 Taking a cell as an example, the OFDM relay system model includes a base station, a relay node and a user equipment. A base station is set up at the center of the cell. Its main functions include sending control information and data signals to the relay node and the user equipment, and receiving feedback information from them. The base station is also responsible for the resource allocation decision of the entire system. According to factors such as the system load, user demand and channel conditions, it reasonably allocates wireless resources to different users and relay nodes. Within the cell range, K relay nodes are evenly deployed around the base station, and they are all located in the middle of the cell center and the edge. The base station, relay node and user equipment all use wireless links to achieve communication functions. In particular, a dedicated communication link is built between the base station and the relay node, which is specifically used for data transmission and control information interaction. At the same time, there is a direct communication link between the base station and the user equipment (for some users who are close to the base station). These links have corresponding resource allocation mechanisms in the time domain and frequency domain. There are M users in the cell, including U relay users, and these users are randomly distributed within the cell. The system design allows users to indirectly access the base station through relay nodes to obtain the best communication quality and service experience. Based on the relay system model, the cell radius is first determined, which defines the coverage of the system, clarifies the number of cell users, identifies the relay users in the system, and establishes a unique identifier for each relay user. All relay users are grouped into a set U = {1, 2, 3, ..., U}, which provides a basis for the subsequent resource allocation strategy adjustment; then the number of relay nodes is set, which will have a significant impact on the signal transmission path and resource allocation strategy of the system, and the specific structure of the resource block is defined, that is, in the time domain dimension, it is composed of a certain number of continuous orthogonal frequency division multiplexing symbols; and in the frequency domain dimension, the resource block is composed of several subcarriers, that is, in the time domain, it is composed of a specific number (for example, m) of continuous OFDM symbols, and in the frequency domain, it is composed of n subcarriers, and the initial state of the resource block is marked as unallocated, and its related attributes including available bandwidth and channel quality are recorded to form a resource block set. These initialization parameters lay the foundation for the normal operation of the system and the reasonable allocation of resources.

[0056] Based on the OFDM relay system, the present invention adopts a two-stage scheduling strategy of time domain and frequency domain. Among them, the main function of the time domain stage scheduling is to complete the screening of users within a scheduling cycle. At the end of the scheduling, the users are sorted according to a predefined algorithm. The scheduling in the time domain stage reduces the number of users, and then the user list is forwarded to the frequency domain stage scheduling. If the user has a retransmission service, it is placed at the top of the user list in the time domain stage. In the frequency domain scheduling stage, actual resource blocks are allocated to different users. First, according to the priority formula, the user priority order is calculated, and then the corresponding resource blocks are allocated. After each resource allocation is completed, the scheduling user information is updated until all resource blocks have been allocated or there are no users to be scheduled in the list, and the allocation is completed.

[0057] According to the above scheduling strategy, this embodiment adopts an improved proportional fairness algorithm in the time domain scheduling stage to calculate the scheduling priority of all relay users on each resource block. The specific calculation steps include:

[0058] Get the current rate of the relay user and calculate the average rate of the relay user in the historical period;

[0059] Determining a first adjustment factor according to the number of relay users, system load, and channel quality;

[0060] Determine a second adjustment factor according to system service quality requirements;

[0061] The scheduling priority of each relay user on each resource block is calculated according to the current rate, the average rate, the first adjustment factor, and the second adjustment factor.

[0062] In this embodiment, although the proportional fairness algorithm can be applied in real-time services to achieve high throughput and good fairness, it cannot be directly applied to OFDM-based relay systems. Therefore, this embodiment adopts an improved proportional fairness algorithm to calculate the scheduling priority of each user in the time-frequency scheduling stage. The algorithm introduces an adjustment factor on the basis of the proportional fairness algorithm to dynamically adjust the scheduling priority of the user, ensuring that a high system throughput can be maintained even when the number of users increases, so as to adapt to the impact of changes in the number of users on the system throughput.

[0063] In this embodiment, the scheduling priority consists of two parts, one part is a representation of the user transmission rate, and the other part is a representation of the user demand. The specific formula is as follows:

[0064]

[0065] Where P i (t) represents the scheduling priority of the i-th relay user at time t, R i(t) represents the rate of the i-th relay user at time t, represents the average rate of the i-th relay user at time t-1, γ represents the first adjustment factor, w represents the second adjustment factor, Qos i represents the service quality requirement of the i-th relay user, Delay i represents the current delay of the ith relay user, e i represents the bit error rate of the i-th relay user.

[0066] The first adjustment factor is expressed by the following formula:

[0067]

[0068] Where N represents the current number of relay users, N0 represents the reference number of relay users, k1, k2, and k3 represent the first, second, and third coefficients, respectively, ρ represents the proportion of allocated resources, ρ0 represents the reference load ratio, SNR represents the system average channel signal-to-noise ratio, and SNR0 represents the reference signal-to-noise ratio.

[0069] In this embodiment, the calculation formula of the first adjustment factor γ comprehensively considers multiple factors such as the number of users, system load and channel quality. Its principle is to achieve all-round optimization of system performance based on the mapping of the changes in various states of the system by the logic function. Specifically, for the user number factor, the number of users in the current system is compared with the preset reference number of users, and the first coefficient is used to control the degree of influence of the change in the number of users on the adjustment factor. When the number of users deviates from the reference value, the setting of the logic function causes γ to change accordingly; the system load factor is reflected by the difference between the proportion of the allocated resources in the current system to the total resources and the reference load ratio, and the second coefficient is used to adjust the sensitivity of the system load to the adjustment factor. When the system load is heavy, γ will change according to the setting, prompting the resource allocation algorithm to pay more attention to fairness, ensuring that the system runs stably under high load conditions, preventing the system from crashing due to excessive allocation of resources to some users, and ensuring that each user can obtain a certain quality of service; the channel quality factor is represented by the difference between the average channel signal-to-noise ratio of the system and the reference signal-to-noise ratio, and its influence on the adjustment factor is controlled by the third coefficient. When the difference is higher than the threshold, it indicates that the channel quality is good, and γ will be adjusted according to the setting. When calculating user priority, the algorithm will give users with good channel quality a higher weight, thereby improving the overall throughput of the system. Conversely, when the channel quality is poor, the adjustment of γ makes the algorithm more inclined to ensure fairness and ensure that each user can obtain basic services under poor channel conditions. Through such a calculation formula, the first adjustment factor can flexibly adjust its value according to the dynamic changes in the number of users, system load and channel quality, and comprehensively consider the influence of these factors when calculating user priority, so that the system can adapt to complex and changing communication environments, effectively improve the overall performance of the system, optimize resource allocation, provide users with better service quality, and achieve efficient and stable operation of the system in different scenarios.

[0070] In the above scheduling priority formula, the second adjustment factor w is mainly used to dynamically adjust the impact of the proportional relationship between service quality requirements and delay on user priority. This factor is determined by the system's service quality requirements. When the system pays more attention to service quality requirements, the value of w is larger, and the weight of the proportional relationship between service quality requirements and delay in the user priority calculation will increase significantly. At this time, even if the delay increases slightly, as long as the service quality requirements can be better met, the user's priority may still be higher. This is because the system believes that meeting service quality requirements is more critical to overall performance and user experience, and an increase in delay to a certain extent can ensure high quality of data transmission. By dynamically adjusting the value of w, the system can find a balance between service quality requirements and delay to adapt to various complex and changing communication environments and user needs, thereby providing more targeted and adaptive services to different types of users on the basis of ensuring the overall performance of the system.

[0071] In the above scheduling priority formula, the average rate of user i is The calculation formula can be expressed as:

[0072]

[0073] Among them, α is a coefficient between 0 and 1, which is used to control the new rate R i (t) for average rate degree of impact.

[0074] Average rate It is used to evaluate the average performance of users in the past period of time and is an important indicator for measuring long-term fairness. It is usually obtained by accumulating the amount of data transmitted by users in a period of time and dividing it by the length of this period of time.

[0075] Quality of Service Requirement Qos i Refers to the specific requirements of users for service quality, usually including indicators such as delay, bandwidth, and packet loss rate. Service quality requirements reflect the user's requirements for service quality such as delay and bandwidth. The acquisition of service quality requirements can be determined by the service request sent by the user when accessing the system.

[0076] The user's current delay Delay i It reflects the delay time of the user's current data transmission, which can be obtained by the system by measuring the time required from the sending of a data packet to the confirmation of receipt.

[0077] Bit Error Rate i It reflects the frequency of errors during user data transmission. The user bit error rate is usually calculated by counting the proportion of the number of data packets received by the user in a certain period of time to the total number of received data packets. The system can know whether the data packet arrives correctly through the information fed back by the receiving end, and then calculate the bit error rate.

[0078] In this embodiment, in the time domain scheduling stage, an improved proportional fairness algorithm is used to calculate the scheduling priority of all users on each resource block. The algorithm reduces the impact of fluctuations in the number of users on the system by dynamically adjusting factors, thereby effectively improving the overall throughput of the system. This is because the adjustment factor changes the user rate distribution, so it can effectively prevent the average throughput from dropping too quickly, thereby ensuring the overall performance of the system.

[0079] Through the above formula, the scheduling priority of each user in the time domain scheduling stage can be calculated, and the users in the relay user set are sorted in descending order according to the scheduling priority, so as to obtain a user sequence arranged from high to low priority. The sorted user sequence is sent to the frequency domain stage for resource allocation.

[0080] Assuming that the number of resource blocks available in the system is J = {1, 2, 3, ..., J}, in the frequency domain scheduling stage, the allocation priority of each user on each resource block is determined according to the priority order determined by each user in the time domain stage, and the resource block is allocated to each user in turn according to the allocation priority. Among them, the allocation priority of the user in the frequency domain scheduling node is calculated using the following steps:

[0081] Obtaining a channel gain and a signal-to-interference ratio of a relay user on the resource block;

[0082] Calculating a channel gain factor according to the channel gain and a maximum value of the system channel gain;

[0083] Calculating a signal-to-interference ratio factor according to the signal-to-interference ratio and the maximum value of the system signal-to-interference ratio;

[0084] The allocation priority of each relay user is calculated according to the scheduling priority, the channel gain factor and the signal-to-interference ratio factor.

[0085] In this embodiment, the channel gain and signal-to-interference ratio of the relay user on the resource block are first obtained, where the signal-to-interference ratio refers to the ratio between the signal strength of the user on the resource block and the interference level, and the channel gain factor and the signal-to-interference ratio factor are calculated according to the maximum channel gain and the maximum signal-to-interference ratio of the system, and then the allocation priority is determined in combination with the scheduling priority in the time domain scheduling stage. The specific calculation formula can be expressed as:

[0086]

[0087] Where P i,j represents the allocation priority of the i-th relay user on the j-th resource block, P i (t) represents the scheduling priority of the i-th relay user at time t, G i,j represents the channel gain of the i-th relay user on the j-th resource block, G max Indicates the maximum system channel gain, S i,j represents the signal-to-interference ratio of the i-th relay user on the j-th resource block, S max It represents the maximum value of the system signal-to-interference ratio. Both λ and μ represent adjustment constants. The adjustment constants are determined by the system characteristics and are used to adjust the influence of various factors on the priority.

[0088] According to the calculated allocation priority of all users on the resource block, the user sequence is reordered. This ordering is based on the comprehensive advantages of the users on each resource block to ensure that the resource blocks are allocated to the users who can use them most effectively. The sorted user order will determine the order of resource block allocation. Finally, resource blocks are allocated to users in order of priority. First, check whether there are schedulable resources. If there are schedulable resources, they are allocated to users in order of priority from high to low. If there are no schedulable resources, it is necessary to wait for the resources to be released or re-evaluate the resource allocation strategy. In the process of allocating resources to users, factors such as the user's business type, service quality requirements, and the overall performance of the system need to be considered to ensure the fairness and rationality of resource allocation. For example, for users with high bandwidth requirements, resource blocks with larger bandwidth are allocated; for users with high signal quality requirements, resource blocks with good channel gain are allocated. In addition, in order to cope with changes in network conditions, in a preferred embodiment, user priorities are re-evaluated regularly and resource allocation strategies are adjusted according to actual conditions. When the number of users changes, the adjustment factor is updated in time to ensure that the algorithm can quickly adapt to new situations and maintain high performance of the system.

[0089] This embodiment provides a relay resource allocation method. The present invention adopts a two-stage scheduling framework combining time domain and frequency domain. In the time domain scheduling stage, the user priority is dynamically adjusted by introducing an improved proportional fairness algorithm, which improves the throughput performance of the system when the number of users fluctuates. This dynamic adjustment mechanism effectively promotes the balanced allocation of system resources among different users, prevents excessive inclination of resources to a small number of users, ensures that the system throughput remains high while also taking into account fairness among users. In the frequency domain scheduling stage, the user priority is adjusted by channel gain, further improving the resource utilization of the system. The present invention improves the resource utilization of the system while ensuring the fairness of users through a two-stage scheduling strategy, and further improves the efficiency and stability of system operation.

[0090] See also Figure 3 Based on the same inventive concept, a relay resource allocation system proposed in the second embodiment of the present invention includes:

[0091] A model building module 10 is used to establish an orthogonal frequency division multiplexing relay system model based on regional parameters of the communication area, wherein the regional parameters include a relay user set and a resource block set;

[0092] The time domain scheduling module 20 is used to calculate the scheduling priority of each relay user on each resource block according to the orthogonal frequency division multiplexing relay system model and adopt an improved proportional fairness algorithm, and sort all relay users in descending order according to the scheduling priority to obtain a relay user sequence;

[0093] A frequency domain scheduling module 30, configured to calculate the allocation priority of each relay user according to the channel gain of the relay user on the resource block and the scheduling priority, and update the relay user sequence according to the allocation priority;

[0094] The resource allocation module 40 is used to allocate the resource blocks to each relay user in sequence according to the updated relay user sequence.

[0095] Furthermore, the time domain scheduling module 20 is also used to obtain the current rate of the relay user and calculate the average rate of the relay user in the historical period;

[0096] Determining a first adjustment factor according to the number of relay users, system load, and channel quality;

[0097] Determine a second adjustment factor according to system service quality requirements;

[0098] The scheduling priority of each relay user on each resource block is calculated according to the current rate, the average rate, the first adjustment factor, and the second adjustment factor.

[0099] The frequency domain scheduling module 30 is further used to obtain the channel gain and signal-to-interference ratio of the relay user on the resource block;

[0100] Calculating a channel gain factor according to the channel gain and a maximum value of the system channel gain;

[0101] Calculating a signal-to-interference ratio factor according to the signal-to-interference ratio and the maximum value of the system signal-to-interference ratio;

[0102] The allocation priority of each relay user is calculated according to the scheduling priority, the channel gain factor and the signal-to-interference ratio factor.

[0103] The technical features and technical effects of the relay resource allocation system proposed in the embodiment of the present invention are the same as those of the method proposed in the embodiment of the present invention, and are not described in detail here. Each module in the above-mentioned relay resource allocation system can be implemented in whole or in part by software, hardware, and a combination thereof. Each of the above-mentioned modules can be embedded in or independent of a processor in a computer device in the form of hardware, or can be stored in a memory in a computer device in the form of software, so that the processor can call and execute the operations corresponding to each of the above modules.

[0104] In addition, an embodiment of the present invention further 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 implements the steps of the above method when executing the computer program.

[0105] See also Figure 4, an internal structure diagram of a computer device in an embodiment, the computer device can specifically be a terminal or a server. The computer device includes a processor, a memory, a network interface, a display and an input device connected through a system bus. Among them, the processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The network interface of the computer device is used to communicate with an external terminal through a network connection. When the computer program is executed by the processor, a relay resource allocation method is implemented. The display screen of the computer device can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer device can be a touch layer covered on the display screen, or a key, trackball or touchpad set on the computer device housing, or an external keyboard, touchpad or mouse, etc.

[0106] It can be understood by those skilled in the art that Figure 4 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computing device may include more or fewer components than those shown in the figure, or combine certain components, or have the same component arrangement.

[0107] In addition, an embodiment of the present invention further provides a computer-readable storage medium on which a computer program is stored. When the computer program is executed by a processor, the steps of the above method are implemented.

[0108] In summary, an embodiment of the present invention proposes a relay resource allocation method, system, computer device and storage medium. The method establishes an orthogonal frequency division multiplexing relay system model based on regional parameters of the communication area, wherein the regional parameters include a relay user set and a resource block set; according to the orthogonal frequency division multiplexing relay system model, an improved proportional fairness algorithm is adopted to calculate the scheduling priority of each relay user on each resource block, and all relay users are sorted in descending order according to the scheduling priority to obtain a relay user sequence; according to the channel gain of the relay user on the resource block and the scheduling priority, the allocation priority of each relay user is calculated, and the relay user sequence is updated according to the allocation priority; according to the updated relay user sequence, the resource block is allocated to each relay user in turn. The present invention adopts a two-stage scheduling framework combining time domain and frequency domain. In the time domain scheduling stage, the user priority is dynamically adjusted by introducing an improved proportional fairness algorithm, which improves the throughput performance of the system when the number of users fluctuates. This dynamic adjustment mechanism effectively promotes the balanced allocation of system resources among different users, prevents excessive inclination of resources to a small number of users, ensures that the system throughput remains high while also taking into account fairness among users. In the frequency domain scheduling stage, the user priority is adjusted by channel gain, further improving the resource utilization of the system. Through a two-stage scheduling strategy, the present invention improves the resource utilization of the system while ensuring the fairness of users, and further improves the efficiency and stability of system operation.

[0109] Each embodiment in this specification is described in a progressive manner, and the same or similar parts of each embodiment can be directly referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the system embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts can be referred to the partial description of the method embodiment. It should be noted that the technical features of the above-mentioned embodiments can be combined arbitrarily. In order to make the description concise, all possible combinations of the technical features in the above-mentioned embodiments are not described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0110] The above-mentioned embodiments only express several preferred implementation modes of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the invention patent. It should be pointed out that, for ordinary technicians in the technical field, several improvements and substitutions can be made without departing from the technical principles of the present invention, and these improvements and substitutions should also be regarded as the protection scope of the present application. Therefore, the protection scope of the patent of the present application shall be based on the protection scope of the claims.

Claims

1. A relay resource allocation method, characterized in that: include: An orthogonal frequency division multiplexing relay system model is established based on regional parameters of the communication area, wherein the regional parameters include a relay user set and a resource block set; According to the OFDM relay system model, an improved proportional fairness algorithm is used to calculate the scheduling priority of each relay user on each resource block, and all relay users are sorted in descending order according to the scheduling priority to obtain a relay user sequence; Calculating the allocation priority of each relay user according to the channel gain of the relay user on the resource block and the scheduling priority, and updating the relay user sequence according to the allocation priority; The resource blocks are allocated to each relay user in sequence according to the updated relay user sequence.

2. The relay resource allocation method according to claim 1, characterized in that: The step of using the improved proportional fairness algorithm to calculate the scheduling priority of each relay user on each resource block includes: Get the current rate of the relay user and calculate the average rate of the relay user in the historical period; Determining a first adjustment factor according to the number of relay users, system load, and channel quality; Determine a second adjustment factor according to system service quality requirements; The scheduling priority of each relay user on each resource block is calculated according to the current rate, the average rate, the first adjustment factor, and the second adjustment factor.

3. The relay resource allocation method according to claim 2, characterized in that: The scheduling priority is expressed by the following formula: Where P i (t) represents the scheduling priority of the i-th relay user at time t, R i (t) represents the rate of the i-th relay user at time t, represents the average rate of the i-th relay user at time t-1, γ represents the first adjustment factor, w represents the second adjustment factor, Qos i represents the service quality requirement of the i-th relay user, Delay i represents the current delay of the ith relay user, e i represents the bit error rate of the i-th relay user; The first adjustment factor is expressed by the following formula: Where N represents the current number of relay users, N0 represents the reference number of relay users, k1, k2, and k3 represent the first, second, and third coefficients, respectively, ρ represents the proportion of allocated resources, ρ0 represents the reference load ratio, SNR represents the system average channel signal-to-noise ratio, and SNR0 represents the reference signal-to-noise ratio.

4. The relay resource allocation method according to claim 1, characterized in that: The step of calculating the allocation priority of each relay user according to the channel gain of the relay user on the resource block and the scheduling priority comprises: Obtaining a channel gain and a signal-to-interference ratio of a relay user on the resource block; Calculating a channel gain factor according to the channel gain and a maximum value of the system channel gain; Calculating a signal-to-interference ratio factor according to the signal-to-interference ratio and a maximum value of the system signal-to-interference ratio; The allocation priority of each relay user is calculated according to the scheduling priority, the channel gain factor and the signal-to-interference ratio factor.

5. The relay resource allocation method according to claim 4, characterized in that: The allocation priority is expressed by the following formula: Where P i,j represents the allocation priority of the i-th relay user on the j-th resource block, P i (t) represents the scheduling priority of the i-th relay user at time t, G i,j represents the channel gain of the i-th relay user on the j-th resource block, G max Indicates the maximum system channel gain, S i,j represents the signal-to-interference ratio of the i-th relay user on the j-th resource block, S max It represents the maximum value of the system signal-to-interference ratio, and λ and μ both represent adjustment constants.

6. A relay resource allocation system, characterized in that: include: A model building module, used to establish an orthogonal frequency division multiplexing relay system model based on regional parameters of the communication area, wherein the regional parameters include a relay user set and a resource block set; A time domain scheduling module, used to calculate the scheduling priority of each relay user on each resource block according to the orthogonal frequency division multiplexing relay system model and adopt an improved proportional fairness algorithm, and sort all relay users in descending order according to the scheduling priority to obtain a relay user sequence; A frequency domain scheduling module, configured to calculate the allocation priority of each relay user according to the channel gain of the relay user on the resource block and the scheduling priority, and update the relay user sequence according to the allocation priority; The resource allocation module is used to allocate the resource blocks to each relay user in sequence according to the updated relay user sequence.

7. The relay resource allocation system according to claim 6, characterized in that: The time domain scheduling module is also used to obtain the current rate of the relay user and calculate the average rate of the relay user in the historical period; Determining a first adjustment factor according to the number of relay users, system load, and channel quality; Determine a second adjustment factor according to system service quality requirements; The scheduling priority of each relay user on each resource block is calculated according to the current rate, the average rate, the first adjustment factor, and the second adjustment factor.

8. The relay resource allocation system according to claim 6, characterized in that: The frequency domain scheduling module is further used to obtain the channel gain and signal-to-interference ratio of the relay user on the resource block; Calculating a channel gain factor according to the channel gain and a maximum value of the system channel gain; Calculating a signal-to-interference ratio factor according to the signal-to-interference ratio and a maximum value of the system signal-to-interference ratio; The allocation priority of each relay user is calculated according to the scheduling priority, the channel gain factor and the signal-to-interference ratio factor.

9. A computer device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 5 are implemented.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 5 are implemented.

Citation Information

Patent Citations

  • Method for determining user priority order in long term evolution (LTE) scheduling

    CN102186256A

  • Method for allocating resources in relay system of single carrier frequency division multiple access

    CN102497260A

  • Game theory-based radio resource optimization method in LTE-A relay system

    CN103369568A

  • Upstream resource distribution method capable of considering both throughput capacity and fairness in TD-LTE-Advanced (Time Division-Long Term Evolution-Advanced) relay system

    CN104394596A

  • Multiservice-based resource scheduling method and device in cognitive relay system

    CN104640226A