WO2011020241A1 - Procede et dispositif correspondant pour programmer des ressources radio de liaison descendante - Google Patents

Procede et dispositif correspondant pour programmer des ressources radio de liaison descendante Download PDF

Info

Publication number
WO2011020241A1
WO2011020241A1 PCT/CN2009/073341 CN2009073341W WO2011020241A1 WO 2011020241 A1 WO2011020241 A1 WO 2011020241A1 CN 2009073341 W CN2009073341 W CN 2009073341W WO 2011020241 A1 WO2011020241 A1 WO 2011020241A1
Authority
WO
WIPO (PCT)
Prior art keywords
relay node
base station
status
radio resources
buffer
Prior art date
Application number
PCT/CN2009/073341
Other languages
English (en)
Chinese (zh)
Inventor
刘建国
沈钢
王栋耀
王伟
陈继明
Original Assignee
上海贝尔股份有限公司
阿尔卡特朗讯
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 上海贝尔股份有限公司, 阿尔卡特朗讯 filed Critical 上海贝尔股份有限公司
Priority to PCT/CN2009/073341 priority Critical patent/WO2011020241A1/fr
Priority to CN200980159613.7A priority patent/CN102450045B/zh
Publication of WO2011020241A1 publication Critical patent/WO2011020241A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/02—Resource partitioning among network components, e.g. reuse partitioning
    • H04W16/04—Traffic adaptive resource partitioning
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/02—Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
    • H04W84/04—Large scale networks; Deep hierarchical networks
    • H04W84/042—Public Land Mobile systems, e.g. cellular systems
    • H04W84/047—Public Land Mobile systems, e.g. cellular systems using dedicated repeater stations

Definitions

  • the invention relates to the field of communications. More specifically, the present invention relates to a base station and a relay node for having a relay node.
  • BACKGROUND OF THE INVENTION Three-generation partner i's long-term evolution project LTE-Advanced is accepted and adopted: for forwarding service/signaling data between a base station eNodeB and a user equipment UE for better coverage or better Throughput.
  • the relay node RN is a network node dedicated to storing and forwarding data packets from the base station eNodeB to the user equipment UE, and, in contrast, storing data packets from the user equipment UE and Forwarded to the base station eNodeB.
  • the user equipment UE needs to receive a data packet directly from the base station eNodeB (such a user equipment UE is referred to as a "macro user"), or receives a packet from the base station eNodeB that it forwards from the relay node RN. Therefore, when there is a relay node RN, multiple downlinks need to be scheduled for downlink transmission of data packets.
  • base stations eNodeB and relay node RN in the LTE-A system use orthogonal resources to transmit data to reduce interference.
  • the base station eNodeB acts as a scheduler and needs to allocate different physical radio resources for each downlink.
  • the scheduling can be centralized, with the base station eNodeB scheduling all transmissions on all downlinks.
  • the base station eNodeB first allocates physical radio resources for all secondary links of the relay node RN to the relay node RN. Then, the relay node RN then allocates the physical radio resources to each of the secondary links of the relay node RN.
  • the prior art distributed scheduling is a static scheduling method that allocates fixed physical radio resources to the relay node RN in advance. A disadvantage of this method is that if the total amount of physical radio resources allocated by the base station eNodeB to the relay node RN is excessive, some physical radio resources will be idle, thereby causing waste of resources and reducing the spectrum efficiency of the system.
  • the present invention proposes a scheme for scheduling downlink radio resources in a wireless communication network having relay nodes.
  • the adjusted radio resource allocation information is sent to the relay node.
  • a base station comprising:
  • a receiving unit configured to receive a buffer status and a traffic load status of the relay node, and a scheduling unit, configured to buffer according to the read relay node received from the relay node State and service load status, adjusting a total amount of radio resources allocated to the relay node; and a sending unit, configured to send the adjusted radio resource allocation information to the relay node.
  • a sending unit configured to send, to the base station, a service load status of the relay node and a determined buffer status of the relay node
  • a receiving unit configured to receive, by the base station, a total amount of radio resources allocated to the PD node according to the buffer status and the service load status;
  • a scheduling unit configured to schedule and allocate each radio resource block to each secondary link according to a radio resource allocated by the base station to the relay node.
  • the relay node RN it is possible to balance the input traffic load and the output traffic load on the relay node RN, thereby reducing the delay of data at the relay node RN and significantly improving the system spectrum efficiency.
  • the relay node RN only needs to feed back the buffer and traffic load status to the base station eNodeB, so only a small amount of signaling overhead needs to be added.
  • FIG. 1 schematically shows an example of an environment in which the present invention can be implemented.
  • Fig. 2 schematically shows a flow chart of a scheduling method in accordance with one embodiment of the present invention.
  • Fig. 3A shows a comparison of the CDF (Cumulative Distribution Function) curve of the user data rate of the semi-static method of the present invention obtained based on the above simulation and the static method of the prior art.
  • CDF Cumulative Distribution Function
  • FIG. 3B shows the semi-static method and the present invention of the present invention based on the above simulation. There is a comparison of the average delayed CDF curves of the technical static method.
  • Fig. 4 schematically shows a block diagram of a base station eNodeB and a relay node RN according to an embodiment of the present invention.
  • the basic idea of the present invention is to adopt a semi-static downlink radio resource scheduling method, in which the base station eNodeB periodically adjusts the allocation to the relay node according to the buffer status and the traffic load status on the access link reported by the relay node RN.
  • Fig. 1 schematically shows an example of an environment in which the present invention can be implemented.
  • the environment 100 includes a base station eNodeB 101 and a relay node RN 102 served by the base station eNodeB 101, a user equipment UE 103 (i.e., the above-mentioned macro user), and a user served by the relay node RN 102.
  • Device UE 104 the environment 100 includes a base station eNodeB 101 and a relay node RN 102 served by the base station eNodeB 101, a user equipment UE 103 (i.e., the above-mentioned macro user), and a user served by the relay node RN 102.
  • Device UE 104 i.e., the above-mentioned macro user
  • base station eNodeB 101 For simplicity, only one base station eNodeB 101 and relay node RN 102 served by the base station eNodeB 101, user equipment UE 103, and user equipment UE 104 served by relay node RN 102 are shown in FIG. . However, those skilled in the art will appreciate that the base station eNodeB 101 may have more relay node RNs and user equipment UEs, and the relay node RN 102 may also have more user equipment UEs.
  • the base station eNodeB 101 schedules transmissions on the downlink from the base station eNodeB 101 to the user equipment UE 103 and from the base station eNodeB 101 to the relay node RN 102, and the relay node RN 102 is separately
  • the scheduling on the downlink from the relay node RN 102 to the user equipment UE 104 served by the relay node RN 102 is scheduled. That is, in the environment shown in FIG. 1, the base station eNodeB 101 first allocates the total amount of physical radio resources for all secondary links of the relay node RN 102 to the relay node RN 102.
  • the physical radio resources are then separately allocated by the relay node RN 102 to each of the secondary links of the relay node RN 102.
  • the present invention is directed to the process by which the base station eNodeB 101 assigns to the relay node RN 102 the total amount of physical radio resources for all secondary links of the relay node RN 102.
  • the base station eNodeB can allocate a fixed physical radio resource to the relay node RN 102 in advance in the initialization phase. Then, according to the method shown in FIG. 2, the total amount of radio resources allocated to the relay node RN 102 is periodically adjusted to match the traffic buffered by the relay node RN 102, and the relay is secured from the granularity level. A balance between the input traffic load and the output traffic load on the node RN 102.
  • Fig. 2 schematically shows a flow chart of a scheduling method in accordance with one embodiment of the present invention.
  • step 201 the relay node RN 102 estimates the virtual buffer size virtual_buf.
  • each relay node RN 102 has its own buffer for storing data packets from the base station eNodeB 101.
  • the data packets from the base station eNodeB 101 in the buffer can be adaptively concatenated or split and then transmitted to the user equipment UE 104.
  • the actual buffer size refers to the actual amount of remaining data currently waiting to be transmitted in the buffer of the relay node RN 102
  • the virtual buffer size is expected to be received in the buffer of the relay node RN 102. Down will wait for the amount of virtual remaining data sent. That is, the virtual buffer size is a prediction of the actual input traffic load and virtual output traffic load difference for the relay node RN 102.
  • the virtual output traffic load reflects the actual transmittable traffic of the relay node RN 102 during the current scheduling period.
  • the virtual buffer size is used to predict the secondary link (ie, from the relay node RN 102 to the user equipment UE served by the relay node RN 102) during a semi-persistent scheduling period.
  • the data rate on the downlink of 104) and the amount of virtual remaining data is recorded in the buffer.
  • the virtual buffer size is obtained based on the assumption that even if the data buffered in the buffer of the relay node RN 102 is empty, the relay node RN 102 transmits data on the secondary link. . That is, on the radio resources scheduled by the eNodeB to the relay node RN 102, the relay node RN 102 is always transmitting data to the secondary link.
  • the virtual buffer size should be subtracted from the constraints that can be based on QoS (Quality of Service) (e.g., packet error rate) and CQI (Channel Quality Information) fed back from the user equipment UE 104. And the amount of virtual data predicted. Therefore, the virtual buffer size may be negative.
  • QoS Quality of Service
  • CQI Channel Quality Information
  • the relay node RN 102 periodically reports the buffer status and traffic load status of the read relay node RN 102 to the base station eNodeB 101.
  • the buffer status may include an actual buffer size real-buff and a virtual buffer size virtual_buf.
  • the traffic load status may include a traffic load indicator t fficjoad - indicator, wherein the traffic load indicator of the relay node RN 102 records the total amount of data transmitted on the secondary link during a semi-persistent scheduling period.
  • the base station eNodeB 101 adjusts the total amount of radio resources allocated to the relay node RN 102 based on the buffer status and traffic load status of the relay node RN 102 received from the relay node RN 102.
  • the base station eNodeB 101 can adjust the total amount of radio resources allocated to the relay node RN 102 according to the following formula: wherein the number of radio resources allocated to the ⁇ i relay nodes RN in the scheduling period t is represented in the scheduling period t-1
  • the base station eNodeB 101 may have more relay nodes RN than the relay node RN 102.
  • the relay node RN 102 is the i-th relay node RN involved in the above formula.
  • the available resources of the relay node RN 102 are equal to the previous allocation. Resources - 1) plus this increment " ⁇ ,. ( ⁇ , that depends on the previously allocated resource ⁇ - ⁇ ) and the adjustment factor ⁇ ,. ( ).
  • ⁇ ,. ⁇ the adjustment factor ⁇ ,. ⁇ :
  • a W can be calculated according to the following formula:
  • e is the delay time scale, ie the time window.
  • e can be 10 TTI (Transmission Time Interval), 15 TTI, and so on.
  • step 204 the virtual buffer size virtual_buf is initialized with the actual buffer size real-buff for use in the next scheduling period. This step is an optional step because in practice other ways can be used to determine the virtual buffer size virtual_buf.
  • step 205 the adjusted radio resource allocation information is transmitted to the relay node RN 102 by the downlink control signal.
  • the base station eNodeB 101 and the relay node RN 102 can independently schedule the total amount of radio resources on all secondary links, where CQI feedback from the secondary link can be considered, and more particularly The buffer status of the relay node RN is considered. Then, the relay node RN 102 schedules each radio resource block in the frequency domain and assigns it to each secondary according to a selected scheduling algorithm, such as a round-robin algorithm, a proportional fairness algorithm, or the like. link.
  • a selected scheduling algorithm such as a round-robin algorithm, a proportional fairness algorithm, or the like. link.
  • the method of the present invention may include more or fewer steps, each of which may be performed serially or in parallel, some of which may be combined into one step, or may be performed in a different order than described herein. The order to execute.
  • Table 1 A performance comparison between the semi-static method of the present invention based on the above simulation and the static method of the prior art is shown in Table 2 below.
  • Figure 3A shows a comparison of the CDF curves of the user data rate of the semi-static method of the present invention based on the above simulation with the static method of the prior art.
  • the abscissa is the normalized user data rate and the ordinate is the probability.
  • Fig. 3B shows a comparison of the average delayed CDF curve of the semi-stationary method of the present invention based on the above simulation with the static method of the prior art.
  • the abscissa is the average delay and the ordinate is the probability.
  • Fig. 4 schematically shows a block diagram of a base station eNodeB and a relay node RN according to an embodiment of the present invention.
  • the relay node RN 102 includes a buffer 102B for storing data packets from the base station eNodeB 101.
  • the relay node RN 102 also includes a determining unit 102A for determining the buffer status of the relay node RN 102.
  • the determining unit 102A further comprises an estimation module 102A-1 for estimating a virtual buffer size virtual_buf of the relay node RN 102, and wherein the read buffer status comprises an actual buffer Size and virtual buffer size.
  • the relay node RN 102 further includes a transmitting unit 102D for transmitting to the base station eNodeB 101 The buffer status and traffic load status of the relay node RN 102 are transmitted.
  • the transmitting unit 102D may be a transmitter or a transmitting unit in the prior art, or may be any transmitter or transmitting unit developed in the future.
  • the relay node RN 102 further includes a receiving unit 102E for receiving the total amount of radio resources allocated by the base station eNodeB 101 to the relay node RN 102 based on the buffer status and the traffic load status.
  • the receiving unit 102E may be a receiver or receiving unit in the prior art, or may be any receiver or receiving unit developed in the future.
  • the relay node RN 102 further includes a scheduling unit 102C for scheduling and assigning each radio resource block to each secondary link according to the radio resources allocated by the base station eNodeB 101 to the relay node RN 102.
  • the base station eNodeB 101 includes a buffer 101B for storing data and information to be transmitted on the downlink.
  • the base station eNodeB 101 further includes a receiving unit 101E for receiving the buffer status and traffic load status of the relay node RN 102 from the relay node RN 102.
  • the receiving unit 101E may be a receiver or receiving unit in the prior art, or may be any receiver or receiving unit developed in the future.
  • the base station eNodeB 101 further includes a scheduling unit 101C for adjusting the total amount of radio resources allocated to the relay node RN 102 based on the buffer status and traffic load status of the relay node RN 102 received from the relay node RN 102.
  • the base station eNodeB 101 further includes a transmitting unit 101D for transmitting the adjusted radio resource allocation information to the relay node RN 102 through the downlink control signal.
  • the transmitting unit 101D may be a transmitter or a transmitting unit in the prior art, or may be any transmitter or transmitting unit developed in the future.
  • Figure 4 is merely exemplary and not limiting.
  • the base station eNodeB 101 and relay node RN 102 shown in Figure 4 may also include more components.
  • some of the components shown in Figure 4 may be separate or implemented in the same component.
  • the determining unit 102A and the scheduling unit 102C can be implemented in the same component.
  • the present invention can take the form of an entirely hardware implementation, an entirely software implementation, or an implementation that includes both hardware elements and software elements.
  • the invention is implemented in software, including but not limited to firmware, resident software, microcode, and the like.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

L'invention concerne un procédé et un dispositif correspondant permettant de programmer des ressources radio de liaison descendante. Ledit procédé comporte les étapes suivantes: rapporter l'état du tampon et l'état de la charge de service d'un noeud relais (RN) périodiquement à la station de base; régler les ressources radio totales allouées audit RN en fonction de l'état du tampon et de l'état de la charge de service reçus; et envoyer les informations d'allocation des ressources radio réglées audit RN. Selon l'invention, la charge de service d'entrée et la charge de service de sortie du RN sont équilibrées, le retard de données causé dans le RN est réduit, et l'efficacité du spectre de fréquences du système est amélioré considérablement.
PCT/CN2009/073341 2009-08-19 2009-08-19 Procede et dispositif correspondant pour programmer des ressources radio de liaison descendante WO2011020241A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
PCT/CN2009/073341 WO2011020241A1 (fr) 2009-08-19 2009-08-19 Procede et dispositif correspondant pour programmer des ressources radio de liaison descendante
CN200980159613.7A CN102450045B (zh) 2009-08-19 2009-08-19 对下行链路无线资源进行调度的方法及相应的装置

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2009/073341 WO2011020241A1 (fr) 2009-08-19 2009-08-19 Procede et dispositif correspondant pour programmer des ressources radio de liaison descendante

Publications (1)

Publication Number Publication Date
WO2011020241A1 true WO2011020241A1 (fr) 2011-02-24

Family

ID=43606543

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2009/073341 WO2011020241A1 (fr) 2009-08-19 2009-08-19 Procede et dispositif correspondant pour programmer des ressources radio de liaison descendante

Country Status (2)

Country Link
CN (1) CN102450045B (fr)
WO (1) WO2011020241A1 (fr)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111586749B (zh) * 2019-02-15 2023-02-07 华为技术有限公司 一种下行缓存状态反馈方法及装置

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008050425A1 (fr) * 2006-10-25 2008-05-02 Fujitsu Limited Station de base radio, station relais, système de communication radio, et procédé de communication radio
CN101212762A (zh) * 2006-12-25 2008-07-02 华为技术有限公司 给中继节点分配无线信道的方法和系统
WO2008138164A1 (fr) * 2007-05-10 2008-11-20 Alcatel Shanghai Bell Company, Ltd. Procédé pour programmer les transmissions de liaison montante d'un système de communication sans fil et dispositif associé
CN101389113A (zh) * 2007-09-14 2009-03-18 中兴通讯股份有限公司 一种给中继站分配无线资源的方法
CN101505482A (zh) * 2009-02-23 2009-08-12 北京邮电大学 半分布式资源分配方法及系统

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008050425A1 (fr) * 2006-10-25 2008-05-02 Fujitsu Limited Station de base radio, station relais, système de communication radio, et procédé de communication radio
CN101212762A (zh) * 2006-12-25 2008-07-02 华为技术有限公司 给中继节点分配无线信道的方法和系统
WO2008138164A1 (fr) * 2007-05-10 2008-11-20 Alcatel Shanghai Bell Company, Ltd. Procédé pour programmer les transmissions de liaison montante d'un système de communication sans fil et dispositif associé
CN101389113A (zh) * 2007-09-14 2009-03-18 中兴通讯股份有限公司 一种给中继站分配无线资源的方法
CN101505482A (zh) * 2009-02-23 2009-08-12 北京邮电大学 半分布式资源分配方法及系统

Also Published As

Publication number Publication date
CN102450045B (zh) 2014-11-05
CN102450045A (zh) 2012-05-09

Similar Documents

Publication Publication Date Title
RU2454813C2 (ru) Способ, устройство и компьютерная программа для планирования восходящей линии связи в сети с ретрансляционными узлами
EP2849524B1 (fr) Virtualisation de planification pour mobile RAN cloud et séparation de la planification des ressources cellulaires et des ressources d'utilisateur
EP2681960B1 (fr) Algorithme de programmation de liaison pour des réseaux sans fil ofdma comprenant des noeuds de relais
JP5193369B2 (ja) 無線ネットワークにおけるスケジューリングリクエストを触発或は送信する方法及び装置
JP5627676B2 (ja) 分散スケジューリングを用いて無線システムにおけるセル端性能を管理するためのシステムおよび方法
JP5667285B2 (ja) リンク・セグメントについてのターゲット・パケット遅延を決定するための、また調整するための方法、装置およびノード
US8982809B2 (en) Method and apparatus for resource management in a relay communication system, and method and apparatus for data relay using same
GB2562220A (en) Methods and devices associated with direct communications in a radio access network
EP2472981B1 (fr) Procédé et appareil pour la programmation combinée de domaine de fréquence et de temps
US8249026B2 (en) Scheduling of data packets over an air interface of a cellular communication system
US20120207124A1 (en) Method and Device for Allocating Resources of a Control Channel in a Wireless Communication System
Afrin et al. Design of a buffer and channel adaptive LTE semi-persistent scheduler for M2M communications
KR20100044064A (ko) 중계기를 포함하는 무선통신 시스템에서 스케줄링 방법
US11956771B2 (en) Scheduling in wireless communication networks
EP2849485B1 (fr) Virtualisation d'ordonnanceur pour nuage mobile de liaison terrestre à haute latence
WO2011020241A1 (fr) Procede et dispositif correspondant pour programmer des ressources radio de liaison descendante
WO2011038529A1 (fr) Procédé de planification et planificateur
Anas Uplink Radio Resource Management for QoS Provisioning in Long Term Evolution: With Emphasis on Admission Control and Handover
Lasfar et al. TCP-ACK triggered bandwidth request scheme in IEEE 802.16 e systems
CN114451052A (zh) 用于控制通信网络中对上行链路传输的抢占的方法和装置
Zhou A LTE Uplink Scheduling Algorithm Based on Water Filling Princple
Kwon et al. Improving fairness using ARQ messages in LTE mobile multi-hop relay (MMR) networks
Haider Scheduling and Resource Partitioning Schemes in Mobile Femtocell Based Cellur Systems
JP2010056754A (ja) 無線基地局及び無線リソース割当方法
JP2014160940A (ja) 無線通信システムにおける無線通信装置および無線リソース割り当て方法

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: 200980159613.7

Country of ref document: CN

121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 09848382

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 09848382

Country of ref document: EP

Kind code of ref document: A1