Relay network system and downlink resource allocation method thereof

A technology of resource allocation and relay network, applied in the field of communication, can solve problems such as insufficient utilization of resources and limitation of relay network performance.

Inactive Publication Date: 2011-07-06
ZTE CORP
3 Cites 11 Cited by

AI-Extracted Technical Summary

Problems solved by technology

[0006] For relay networks, the traditional single-hop link structure is extended to 2 hops, including direct links, backhaul links and access links, and the existing resource allocation methods do not address the wireless resources between these ...
View more

Method used

[0049] In this embodiment, by sequentially assigning downlink resources to the delivery stage and the delivery stage, it solves the problem of the three links in the relay network that have not yet been addressed in the related art: the direct transmission link, the backhaul link and the access link. The allocation of wireless resources among the design issues. This embodiment fully considers the characteristics of the relay network, and sequentially allocates downlink resources in the two stages of the downlink receiving and transmitting processes in the relay network, so as to target the direct transmission link, backhaul link and The wireless resource allocation between the three links of the access link is reasonably designed, which can improve the throughput of the cell and increase the spectrum efficiency.
[0052] This preferred embodiment provides a specific implementation of the base station allocating resources in the delivery phase. This preferred embodiment adopts the allocation criterion based on the wireless resource itself, specifies a resource to be allocated, selects a terminal that meets the conditions from the terminals requesting the service, and allocates the resource to be allocated to the terminal, which solves the problem that the related technology adopts only user-based Allocation criteria lead to underutilization of resources, limiting the performance of the relay network. Using...
View more

Abstract

The invention discloses a relay network system and a downlink resource allocation method thereof. The method comprises the following steps that: a base station calculates a priority of a terminal on an allocable resource according to a channel condition quantized value of the terminal requesting a service on the allocable resource in a submission stage and an average acquired resource quantized value of the terminal; the base station allocates the allocable resource in the submission stage to the terminal having the channel condition quantized value of not less than a pre-set first threshold value and having the highest priority obtained by calculation; and the base station allocates the allocable resource in a transmission stage after the allocable resource in the submission stage is allocated. In the relay network system and the downlink resource allocation method thereof provided by the invention, radio resource allocation among three links, namely a direct link, a backhaul link and an access link in a relay network is designed reasonably, so that the throughput of a cell can be improved, and spectrum efficiency is increased.

Application Domain

Radio transmission for post communicationWireless communication

Technology Topic

Relay networkReal-time computing +6

Image

  • Relay network system and downlink resource allocation method thereof
  • Relay network system and downlink resource allocation method thereof
  • Relay network system and downlink resource allocation method thereof

Examples

  • Experimental program(1)

Example Embodiment

[0110] Example 1
[0111] In a relay network with one base station eNB, two relay stations RN1, RN2, and three users UE1, UE2, and UE3, user 1 and user 2 are served by RN1 and RN2 respectively, and UE3 is directly served by the base station. The system can allocate resources as 5 RBs, denoted as RB1, RB2, RB3, RB4, and RB5. It is known that the average obtained resource quantization value of user i is T. i. In the delivery stage, the channel condition quantization value of user i on RBk is SINR2 U i,k , have exceeded the basic threshold THb2; in the transmission phase, the quantized value of the channel condition of user i on RBk is SINR1 U i,k , the quantized value of the channel condition of relay station j on the RBk-th RBk is SINR1 during the transmission phase R j,k , have exceeded the basic threshold THb1.
[0112] 1. First, allocate resources in the submission stage. For RB1, the priorities of three users are obtained according to the following methods:
[0113] P U 1,1 = SINR 2 U 1,1 T 1 , P U 2,1 = SINR 2 U 2,1 T 2 , P U 3,1 = SINR 2 U 3,1 T 3
[0114] where P 1,1 The largest, then RB1 is allocated to UE1.
[0115] 2. Considering the interference introduced after RB1 allocation, update the quantized value of the signal condition of user i on RB1 to SINR2′ i,1 , again getting its priority as:
[0116] P U 1,1 = SINR 2 1,1 ′ U T 1 = 0 , P U 2,1 = SINR 2 2,1 ′ U T 2 , P U 3,1 = SINR 2 3,1 ′ U T 3
[0117] where P U 2,1 maximum and SINR2′ 2,1 U If the basic threshold THb2 has been exceeded, RB1 is also allocated to user 2, because SINR2' 1,1 U and SINR2′ 3,1 U If neither exceeds the basic threshold THb2, RB1 is excluded from the allocatable radio resources.
[0118] 3. Allocate RB2, RB4 and RB5 to UE3 according to the same method, and allocate RB3 to user 2, and save the resource allocation result.
[0119] 4. Resource allocation in the transmission phase. For RB1, the priorities of 3 users and 2 relay stations are obtained according to the following methods:
[0120] P U 1,1 = SINR 1 U 1,1 T 1 , P U 2,1 = SINR 1 U 2,1 T 2 , P U 3,1 = SINR 1 U 3,1 T 3
[0121] P U 1,1 = SINR 1 U 1,1 T 1 , P U 2,1 = SINR 1 U 2,1 T 2
[0122] where P R 1,1 maximum, then RB1 is allocated to RN1. And delete RB1 from the allocatable radio resources.
[0123] 5. Allocate RB2 to RN1, RB3 to RN2, and RB4 and RB5 to UE3 in the same way.
[0124]6. According to the resource allocation in the submission stage and the allocation stage, it is found that the throughput that RN2 can obtain on RB3 is lower than the throughput that RN2 can provide on RB1 and RB3, and the low level reaches the threshold TH1, then save the RN2 identifier into the set S, and the throughput that RN1 can obtain on RB1 and RB2 is higher than the throughput that RN1 can provide on RB1, and the higher degree reaches the threshold TH2, considering SINR1 R 1,1SINR1 R 1,2 , the obtained RB2 is released as an assignable radio resource. At this time, the excess throughput that can be obtained on RB1 compared to the throughput that can be provided on RB1 does not exceed TH2.
[0125] 7. Because of the channel condition quantization value SINR2 of RN2 on RB2 R 2,2 not lower than the basic threshold THb1, and its priority maximum, then RB2 is allocated to RN2.
[0126] 8. According to the resource allocation situation, it is found that the difference between the throughput obtained by all the relay stations and the throughput provided by the relay station does not exceed TH1 or TH2, and the allocation process ends.
[0127] The final allocation result is: in the delivery stage, RB1 is allocated to UE1, RB1 and RB3 are allocated to UE2, and RB2, RB4 and RB5 are allocated to UE3; in the delivery stage, RB1 is allocated to RN1, RB2 and RB3 are allocated to RN2, and RB4 and RB5 are allocated to UE3 .
[0128] Figure 7 is a schematic diagram of a relay network system according to an embodiment of the present invention, the relay network system includes: a base station 10, a terminal 20 and a relay station 30; wherein,
[0129] The base station 10 is used to calculate the priority of the terminal on the allocatable resources according to the channel condition quantization value on the allocatable resources of the terminal 20 requesting service in the delivery stage and the average obtained resource quantization value of the terminal; The allocatable resources of the stage are allocated to the terminal whose channel condition quantification value is not lower than the preset first threshold value and the calculated priority is the highest; it is also used to allocate the allocable resources in the delivery stage after the allocation of the allocatable resources in the delivery stage is completed. Allocatable resources.
[0130] Preferably, the base station 10 includes:
[0131] The priority calculation module 101 is used to designate a resource block RB or RB group to be allocated in the allocatable resources in the delivery stage and quantify the value according to the channel condition of the terminal requesting service on the RB or RB group to be allocated and the terminal's The average obtained resource quantization value calculates the priority of the terminal on the RB to be allocated or the RB group; also used for if the judgment result of the judgment module 104 is that all allocations are not completed, then according to the RB or the RB group is allocated after the introduction of the interference update The channel condition quantization value of the terminal requesting service on the RB or RB group and the RB or RB group is allocated to the terminal requesting service again. The updated channel condition quantization value is greater than the first threshold value and calculated with the updated channel condition quantization value the terminal with the highest priority, until the RB or RB group is deleted from the allocatable resources;
[0132] The resource allocation module 102 is used for allocating the RB or RB group to be allocated to the terminal whose channel condition quantization value is not lower than the first threshold value and the calculated priority is the highest in the terminal requesting service;
[0133] Preserving module 103, for preserving the resource allocation result of RB or RB group;
[0134] The judgment module 104 is configured to judge whether all RBs or RB groups in the resources that can be allocated in the delivery stage have been allocated completely according to the saved resource allocation result.
[0135] Preferably, the priority calculation module 101 is further configured to designate a to-be-allocated RB or RB group in the allocatable resources in the delivery phase and quantify the value according to the channel conditions of the terminal and relay station requesting service on the to-be-allocated RB or RB group And the average obtained resource quantization value of the terminal and the relay station calculates the priority of the terminal and the relay station on the to-be-allocated RB or RB group;
[0136] The resource allocation module 102 is further configured to allocate the to-be-allocated RB or RB group in the transmission phase to the terminal or relay station whose channel condition quantization value is not lower than the second threshold value and the calculated priority is the highest in the terminal or relay station requesting the service. Delete the RB or RB group from the allocatable resources until all the allocatable RBs or RB groups are allocated;
[0137] The judging module 104 is further configured to judge whether all RBs or RB groups in the resources that can be allocated in the delivery stage have been allocated completely according to the saved resource allocation result.
[0138] Preferably, the base station 10 is also used to coordinate the allocated resources in the delivery phase and the allocated resources in the delivery phase.
[0139] The relay network in the above-mentioned embodiment uses the downlink resource allocation method of the above-mentioned preferred embodiment (such as Figure 3 to Figure 6 shown) to allocate radio resources.
[0140] From the above description, it can be seen that the present invention achieves the following technical effects: by performing downlink resource allocation based on radio resources in the delivery stage and the transmission stage in turn, and further coordinating the allocated radio resources, the cell throughput can be improved increase spectral efficiency, ensure fairness among users, and improve QoS.
[0141] Obviously, those skilled in the art should understand that the above-mentioned modules or steps of the present invention can be implemented by a general-purpose computing device, which can be centralized on a single computing device, or distributed in a network composed of multiple computing devices Alternatively, they may be implemented in program code executable by a computing device, such that they may be stored in a storage device and executed by the computing device, and in some cases, in a different order than here The steps shown or described are performed either by fabricating them separately into individual integrated circuit modules, or by fabricating multiple modules or steps of them into a single integrated circuit module. As such, the present invention is not limited to any particular combination of hardware and software.

PUM

no PUM

Description & Claims & Application Information

We can also present the details of the Description, Claims and Application information to help users get a comprehensive understanding of the technical details of the patent, such as background art, summary of invention, brief description of drawings, description of embodiments, and other original content. On the other hand, users can also determine the specific scope of protection of the technology through the list of claims; as well as understand the changes in the life cycle of the technology with the presentation of the patent timeline. Login to view more.
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products