WO2009126078A1 - Ordonnancement montant amélioré dans un système cellulaire - Google Patents

Ordonnancement montant amélioré dans un système cellulaire Download PDF

Info

Publication number
WO2009126078A1
WO2009126078A1 PCT/SE2008/050410 SE2008050410W WO2009126078A1 WO 2009126078 A1 WO2009126078 A1 WO 2009126078A1 SE 2008050410 W SE2008050410 W SE 2008050410W WO 2009126078 A1 WO2009126078 A1 WO 2009126078A1
Authority
WO
WIPO (PCT)
Prior art keywords
controlling node
message
grant
time
user
Prior art date
Application number
PCT/SE2008/050410
Other languages
English (en)
Inventor
Ying Sun
Christian SKÄRBY
Gunnar Peters
Kelvin Maliti
Krister Norlund
Original Assignee
Telefonaktiebolaget L M Ericsson (Publ)
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 Telefonaktiebolaget L M Ericsson (Publ) filed Critical Telefonaktiebolaget L M Ericsson (Publ)
Priority to PCT/SE2008/050410 priority Critical patent/WO2009126078A1/fr
Publication of WO2009126078A1 publication Critical patent/WO2009126078A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/20—Control channels or signalling for resource management
    • H04W72/23—Control channels or signalling for resource management in the downlink direction of a wireless link, i.e. towards a terminal

Definitions

  • the present invention discloses an improved method for scheduling of uplink traffic in a cellular system, along with corresponding devices.
  • a controlling node for each cell in the system.
  • One of the tasks of the controlling node of a cell is to schedule certain kinds of messages between the users in the cell and the controlling node.
  • Messages from the users to the controlling node are referred to as uplink traffic, and messages in the other direction are referred to as downlink traffic.
  • Scheduling downlink messages is not much of a problem for the controlling node, since the controlling node knows its own transmission capacity and also knows the messages it needs or wants to transmit to the users in the cell. However, scheduling the uplink messages is more of a challenge for the controlling node, since those messages are by definition to be transmitted by another party, i.e. the user.
  • the UE sends a Scheduling Request, SR, to inform eNodeB that there is a message pending in the UE buffer.
  • SR Scheduling Request
  • the eNodeB responds to the SR with an uplink grant which carries information regarding parameters such as, for example, the time and/or frequency resources that the UE has been granted for transmitting the message to the eNodeB.
  • the grant In a "worst case" scenario, the grant only covers the so called Buffer Status Report, BSR 1 transmitted at 3, and thus necessitates another grant at 4, and an UL message at 5.
  • the time elapsed between 1 and 5 can be in the interval of 20-40 ms.
  • Such a solution is offered by the present invention in that it discloses a method for use in a cellular communications system in which there are controlling nodes for the cells, and the cells are adapted to hold a number of users.
  • the controlling node of a cell schedules control messages from users in the cell to the controlling node by means of transmitting uplink grants to the users, and a controlling node:
  • the controlling node estimates the size of an uplink control message in response from the user and a transmit time, i.e. a point in time when the user will be ready to transmit the control message, and
  • the controlling node bases the uplink grant on knowledge of the nature of the uplink message which the user will send, and also bases the grant on knowledge of the time when the user will be ready to transmit its uplink message, the grant can still be made to fit the needs of the user, but without the time spent under the current uplink grant procedure.
  • the controlling node estimates the transmit time based on a report from the user, and in another embodiment, the controlling node estimates the transmit time based on a statistical observation of the user's processing times.
  • the method of the invention can be applied to an LTE, Long Term Evolution, system, in which case the controlling node sends the grant in the PDCCH channel after having transmitted the downlink message, or in an RRC message, Radio Resource Control.
  • the invention also discloses a controlling node and a user terminal for use in a system in which the method of the invention is applied.
  • Fig 1 shows a prior art method
  • Fig 2 shows a system in which the invention can be applied
  • Fig 3 shows a first time estimate of the invention
  • Fig 4 shows resource allocation in one embodiment of the invention
  • Fig 5 shows resource allocation in a further embodiment of the invention
  • Figs 6 shows a flow chart of a method of the invention
  • Fig 7 shows a block diagram of a transceiver of the invention.
  • Fig 2 shows an example of a system 200 in which the invention may be applied.
  • the system 200 is an LTE system, Long Term Evolution, and the invention will in the following be described using LTE terminology.
  • LTE terminology is merely by way of example, and is not intended to restrict the scope of protection sought for the present invention, which may be applied in a variety of different cellular systems.
  • the system 200 comprises a cell 220, with a controlling node 210 for the cell, a so called eNodeB.
  • the cell 220 can hold a number of users, UEs, one of which is shown as 230.
  • Traffic from the UE to the eNodeB is referred to as uplink traffic, UL traffic, and traffic from the eNodeB to the UE is referred to as downlink traffic, DL traffic.
  • an object of the present invention is to reduce the amount of time needed for a UE to transmit an UL control message in response to a DL control message from the eNodeB.
  • the eNodeB uses the size of the expected UL RRC message and an estimated reply time.
  • the reply time i.e. the time when the UL RRC message will be ready for transmission at the UE
  • the eNodeB needs to estimate the processing time in the UE, here denoted as t pest -
  • the eNodeB can use t pes t in order to actively schedule the UL RRC message for reception by the eNodeB at a point in time which will here be referred to as tsch. which can also be expressed as
  • tsch is the estimated time of arrival of the UL RRC message (UE response) at the eNodeB
  • toL is the point in time when the DL RRC message is sent by the eNodeB.
  • tpest is the time estimated by the eNodeB for the UE processing
  • tgir is the transmission time "one way" between eNodeB and UE
  • t M is a margin which may or may not be added to ensure that the grant does not arrive too early at the UE.
  • the parameter t air may be measured continuously, so that the only parameter which is variable in the calculation of t SCh is the processing time in the UE 1 tpest-
  • the eNodeB there are two methods for the eNodeB to estimate tpest-
  • the first of these methods is to base the estimate on a report from the UE: either the UE can report the "time stamp" for a certain event to the eNodeB, such as, for example, when the uplink RRC message is ready in the UE buffer for transmission, or the point in time when the UE receives the DL RRC message.
  • the eNodeB can arrive at tu ⁇ since the eNodeB knows the point in time, here denoted as to L j. when it transmitted the DL RRC message, and the point in time, here denoted as tu L _r, when the eNodeB received the UL RRC message from the UE.
  • the UE has a function for measuring its processing time and for reporting this time to the eNodeB.
  • the eNodeB When the eNodeB receives the report from the UE, in one of the two fashions described, it can estimate the value of t pest - The eNodeB can then use this estimate (t pes t) in issuing an UL RRC grant for the next UL RRC from the reporting UE.
  • the second method for the eNodeB to estimate t pest for a UE is to base the estimate on a statistical observation of the UE's processing times, i.e. the UE's processing time is estimated statistically by the eNodeB based on observations made by the eNodeB about the UE.
  • the eNodeB can measure the response times, t reS p, of uplink RRC response messages from any given UE in the cell. Since the estimate is based on statistical observations, the accuracy of the estimate will naturally depend on the number of observations. Thus, the number of observations (or the time interval used for the observations) becomes a design factor which depends on the desired accuracy, but a suitable value of the number of observation in one embodiment is in the range of 100-2000, even more suitably in the range of 800-1200.
  • the response time, t resp is defined as the time period which starts at the point in time when the eNodeB sends the DL RRC message and which lasts to the point in time when the UL RRC response message is received in the eNodeB.
  • the eNodeB will know if there was an SR (scheduling request) from the UE or not before the eNodeB received the UL RRC response message. If there was no SR before the UL RRC message was received, this means that the UE had a valid grant after the UL RRC message was ready in the UE buffer but before any SR could be sent.
  • the estimate of the UE's processing time should take into account both the (processing) time used by the eNodeB in response to the SR and the time used by the UE before transmitting the UL RRC message.
  • Fig 3 (not to scale) illustrates the different components of the response time in the case where an SR was received before the UL RRC message.
  • eNodeB's estimate of the UE's processing time tp ⁇ s t can be expressed as:
  • ⁇ t is the minimum time for the UE to send an SR.
  • ⁇ t is at present 5 ms
  • tair is the propagation time between the UE and the eNodeB
  • t 2 is the time measured by the eNodeB between receiving the SR and receiving the RRC response message
  • tresp is the measured response time.
  • the UL grant is issued to a UE for a TTI (transmission time interval) when the uplink RRC message is not ready for transmission in the UE, the UL resource will be wasted.
  • a time margin ⁇ M is included in the equation of t SC h- Another constraint is that if the grant is valid during a TTI later than the SR is sent by the UE, the UL SR resource will have been wasted. However, this is not a big problem, since the UL SR resource is dedicated for each UE.
  • the eNodeB or to be more exact, a function in the eNodeB known as the uplink scheduler, allocates the uplink resource to the UE for transmitting the UL RRC message.
  • the transmission is scheduled for a point in time t, with t being the point in time when the eNodeB expects to receive the UL RRC message from the UE, and t being such that t SC h ⁇ t ⁇ t SC h + t w ; where t SC h is the time instance when the eNodeB is expecting the uplink RRC response message, and t w is the window size that can be specified in the system.
  • the first way is to transmit the grant to the UE through the so called PDCCH, the
  • the grant should be such that it enables the UE to transmit at least a number of bits which corresponds to the size of the expected UL RRC message.
  • the timing of the grant should be the one shown previously, i.e.
  • the principle of allocating an UL RRC grant in PDCCH is shown in fig 4, where the eNodeB transmits a DL RRC message "A”, and in response expects UL RRC message "B" from the UE.
  • a second method of transmitting the UL RRC grants to the UEs is to utilize the downlink RRC messages from the eNodeB to the UE, as is shown in fig 5.
  • the grant for the UL RRC response message "B” is sent together with the DL RRC message "A”, which is the DL message that "B" is in response to.
  • the UE will find information on the point in time for transmission and the granted resources that the UE should use to transmit the uplink RRC response message "B".
  • the grant should be for an UL message which is at least the size of "B", i.e. the expected UL RRC response message to "A”, and at a point in time which, at the latest, equals t D L + tp esl + 2t air + t M + t w 3the eNodeB prepares to receive "B" from the UE.
  • the UE does not need to decode the PDCCH to find its UL grant. Since this grant is used specifically for sending the specific UL RRC messages, this means that the UL grants for other transmissions are not affected, i.e. SRs are still sent by the UE for other transmission, even though the UE has a future valid uplink grant for a particular UL response message.
  • the UE when an UL RRC message is ready for transmission in the UE, the UE will wait for several sub-frames to see if there is a valid grant for the transmission. If there is a valid grant, the UE will immediately transmit the uplink RRC message; otherwise, it will transmit a SR. Therefore, it is important that the estimated ready time of the uplink response RRC message is accurate.
  • the UE simply utilizes the UL RRC grant, and transmits the UL RRC message to the eNodeB.
  • the estimated message ready time is late.
  • the UE can either cancel its transmission of an SR for the UL RRC message, or it can cancel the scheduled grant which it has received from the eNodeB. In a preferred embodiment, the UE cancels the grant by simply ignoring it, although it is entirely conceivable for the UE to send a message to that effect to the eNodeB as well.
  • the eNodeB upon reception of the SR 1 issues the UL grant, and releases the previously allocated resources.
  • the estimated ready time is earlier than the actual ready time, this will lead to the UL RRC grant being issued before the data for the UL RRC message is ready at the UE, so that the UE has no data to transmit: in this case, the will instead utilize the grant to send a BSR which will indicate that the buffer is empty. In this case, the allocated UL resource will have been "wasted".
  • the eNodeB Upon reception of the "zero buffer size" BSR, the eNodeB (uplink scheduler function) will release the pre-allocated UL RRC resource. In the UE, when the UL RRC message data is in the buffer, an SR is sent to the eNodeB.
  • the eNodeB When receiving this SR, and based on previous RRC information, the eNodeB knows that the RRC response is ready in UE buffer, and sends an
  • Fig 6 shows a rough flow chart of a method 600 of the invention. Steps which are options or alternatives are shown with dashed lines.
  • the method 600 is intended for use in a cellular communications system such as the one 200 of fig 2, i.e. a system in which there are controlling nodes 210 for the cells 220, and the cells are adapted to hold a number of users 230.
  • the controlling node of a cell schedules, as shown in step 605, control messages from users in the cell to the controlling node by means of transmitting "uplink" grants to the users.
  • a controlling node
  • step 610 a downlink control message to a user
  • step 615 the size of an uplink control message in response from the user as well as a transmit time, i.e. a point in time when the user will be ready to transmit the control message
  • the controlling node estimates the transmit time based on a report (630) from the user, and in another embodiment, as indicated in step 625, the controlling node estimates the transmit time based on a statistical observation of the user's processing times.
  • the inventive method may be applied to an LTE, Long Term Evolution, system.
  • the controlling node when applied to an LTE system, the controlling node sends the grant in the PDCCH channel after having transmitted the downlink message.
  • the controlling node may send the grant in an RRC message, Radio Resource Control, and the downlink message may be an RRC message.
  • the uplink response message may also be an RRC message.
  • the invention also discloses a transceiver 700 for use as a controlling node in a system of the invention.
  • a basic block diagram of such a transceiver is shown in fig 7.
  • a controlling node of the invention comprises the following:
  • a receiver 720 • a controller 750 such as a microprocessor
  • the means 740, 750, 730, 710 may serve to aid the controlling node in scheduling data messages from users in the cell to the controlling node by means of transmitting "uplink" grants to the users, and the means enumerated above may also be used for the following functions in the controlling node:
  • the means 730, 710 can be used for transmitting a downlink message to users in the cell
  • the means 750, 740 can be sued for, based on the nature of a downlink message, estimating the size of a response message from the user and a transmit time, i.e. a point in time when the user will be ready to transmit the response message
  • the means 730, 710 may be used for transmitting an uplink grant to the user which is designed to fit the estimated size of the response message and the estimated transmit time.
  • the means 740, 750 are used for estimating the transmit time based on a report from the controlling node, and these means, i.e. 750, 740, may also in one embodiment be used for estimating the transmit time based on a statistical observation of the first node's processing times.
  • the controlling node 700 may in one embodiment be an eNodeB in an LTE,
  • the means 740, 750, 730, 710 may be used for transmitting the grant in the PDCCH channel after having transmitted the downlink message, or for transmitting the grant in an RRC message, Radio
  • the downlink message may also be an RRC message.
  • a transceiver for use as a user terminal in a system in which the invention is applied. Due to the generic nature of the block diagram 700 used to illustrate the controlling node of the invention, the same block diagram 700 may also be used in order to illustrate the user terminal of the invention. Thus, a user terminal 700 of the invention will comprise the following:
  • controller 750 such as a microprocessor
  • the means 710, 720, 730 can be used by the user terminal 700 in order to receive and transmit messages, including control messages to and from a controlling node of a cell in the system.
  • the control messages from the controlling node can include grants for letting the user terminal transmit control messages to the controlling node in response to control messages from the controlling node, and the means 710, 720, may be used for receiving grants which the user terminal has not requested, each of said non requested grants being for a control message which is in response to a control message which the terminal has received from the controlling node of the cell.
  • the means 710, 730, 740, 750 are used for the case in which the transmission time specified in a non requested grant from the controlling node is a point in time which is before the control message to which the grant refers is ready to be transmitted, in which case the user terminal transmits, by using the means 710 and 720, a message to the controlling node that the buffer of the terminal does not comprise a control message for transmission.
  • the user terminal uses the means 710, 730, 740, 750 in the case in which the transmission time specified in a non requested grant from the controlling node is a point in time when the control message to which the grant refers is ready to be transmitted, in which case the user terminal transmits, by using the means 720, 710, said control message to the controlling node.
  • the means 710, 730, 740, 750 are used for the case in which the transmission time specified in a non requested grant from the controlling node is a point in time which is after the control message to which the grant refers is ready to be transmitted, in which case the user terminal can choose between using the non-requested grant, or transmitting a scheduling request for transmission of the control message which the non requested grant refers to.
  • the user terminal 700 of the invention may, in a preferred embodiment, be a user terminal for an LTE, Long Term Evolution, system.

Landscapes

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

Abstract

Un procédé (600) destiné à être utilisé dans un système cellulaire (200), dans lequel se trouvent des nœuds de contrôle (210) qui ordonnancent (605) des messages de contrôle provenant d’utilisateurs (230) dans une cellule sur le nœud de contrôle en transmettant des allocations montantes aux utilisateurs. Un nœud de contrôle : transmet (610) un message de contrôle descendant à un utilisateur, et estime, sur la base de la nature du message de contrôle descendant, la taille du message de contrôle montant en réponse à l’utilisateur (230) et un temps de transmission lorsque l’utilisateur sera prêt à transmettre le message de contrôle, et transmet une allocation montante (620) à l’utilisateur (230), prévue pour correspondre à la taille estimée du message de contrôle de l’utilisateur et au temps de transmission estimé.
PCT/SE2008/050410 2008-04-10 2008-04-10 Ordonnancement montant amélioré dans un système cellulaire WO2009126078A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/SE2008/050410 WO2009126078A1 (fr) 2008-04-10 2008-04-10 Ordonnancement montant amélioré dans un système cellulaire

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/SE2008/050410 WO2009126078A1 (fr) 2008-04-10 2008-04-10 Ordonnancement montant amélioré dans un système cellulaire

Publications (1)

Publication Number Publication Date
WO2009126078A1 true WO2009126078A1 (fr) 2009-10-15

Family

ID=41162081

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/SE2008/050410 WO2009126078A1 (fr) 2008-04-10 2008-04-10 Ordonnancement montant amélioré dans un système cellulaire

Country Status (1)

Country Link
WO (1) WO2009126078A1 (fr)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2010089640A1 (fr) 2009-02-04 2010-08-12 Nokia Corporation Optimisation de la procédure d'allocation de ressources en liaison montante
WO2012148331A1 (fr) 2011-04-29 2012-11-01 Telefonaktiebolaget L M Ericsson (Publ) Planification d'un trafic sensible aux retards
CN103348733A (zh) * 2012-01-18 2013-10-09 联发科技股份有限公司 增强型连接恢复和无损失数据恢复方法
CN103687043A (zh) * 2012-09-11 2014-03-26 普天信息技术研究院有限公司 一种建立无线资源控制协议连接的方法
CN109983813A (zh) * 2016-12-09 2019-07-05 华为技术有限公司 传输上行数据的方法和装置
CN110149712A (zh) * 2018-02-13 2019-08-20 华为技术有限公司 一种用于上行授权的方法及装置
CN110944397A (zh) * 2018-09-25 2020-03-31 中国移动通信有限公司研究院 Msg5的发送方法、网络侧设备及用户设备

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2006126920A1 (fr) * 2005-05-26 2006-11-30 Telefonaktiebolaget Lm Ericsson (Publ) Programmation ascendante dans les reseaux de telecommunication mobile

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2006126920A1 (fr) * 2005-05-26 2006-11-30 Telefonaktiebolaget Lm Ericsson (Publ) Programmation ascendante dans les reseaux de telecommunication mobile

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
"3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Evolved Universal Terrestrial Access (E-UTRA) and Evolved Universal Terrestrial Access Network(E-UTRAN); Overall Description; Stage 2 (Release 8)", 3GPP TS 36.300 V 8.4.0, March 2008 (2008-03-01), XP003024233 *
"3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Physical channels and mapping of transport channels onto physical channels (FDD)(Release 8)", 3GPP TS 25.211 V 8.0.0, March 2008 (2008-03-01), XP003024232 *

Cited By (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2010089640A1 (fr) 2009-02-04 2010-08-12 Nokia Corporation Optimisation de la procédure d'allocation de ressources en liaison montante
US7917137B2 (en) 2009-02-04 2011-03-29 Nokia Corporation Optimization of uplink resource grant procedure and apparatus
EP2394486A1 (fr) * 2009-02-04 2011-12-14 Nokia Corporation Optimisation de la procédure d'allocation de ressources en liaison montante
EP2394486A4 (fr) * 2009-02-04 2014-12-17 Nokia Corp Optimisation de la procédure d'allocation de ressources en liaison montante
WO2012148331A1 (fr) 2011-04-29 2012-11-01 Telefonaktiebolaget L M Ericsson (Publ) Planification d'un trafic sensible aux retards
CN103348733A (zh) * 2012-01-18 2013-10-09 联发科技股份有限公司 增强型连接恢复和无损失数据恢复方法
US9661678B2 (en) 2012-01-18 2017-05-23 Mediatek Inc. Method of enhanced connection recovery and cell selection
US9504082B2 (en) 2012-01-18 2016-11-22 Mediatek Inc. Method of enhanced connection recovery and loss-less data recovery
CN103687043B (zh) * 2012-09-11 2016-12-21 普天信息技术研究院有限公司 一种建立无线资源控制协议连接的方法
CN103687043A (zh) * 2012-09-11 2014-03-26 普天信息技术研究院有限公司 一种建立无线资源控制协议连接的方法
CN109983813A (zh) * 2016-12-09 2019-07-05 华为技术有限公司 传输上行数据的方法和装置
CN109983813B (zh) * 2016-12-09 2021-05-18 华为技术有限公司 传输上行数据的方法和装置
CN110149712A (zh) * 2018-02-13 2019-08-20 华为技术有限公司 一种用于上行授权的方法及装置
WO2019157945A1 (fr) * 2018-02-13 2019-08-22 华为技术有限公司 Procédé et appareil d'autorisation de liaison montante
CN110149712B (zh) * 2018-02-13 2021-09-03 华为技术有限公司 一种用于上行授权的方法及装置
CN110944397A (zh) * 2018-09-25 2020-03-31 中国移动通信有限公司研究院 Msg5的发送方法、网络侧设备及用户设备
CN110944397B (zh) * 2018-09-25 2023-01-17 中国移动通信有限公司研究院 Msg5的发送方法、网络侧设备及用户设备

Similar Documents

Publication Publication Date Title
CN112738900B (zh) 一种蜂窝网络中无线电传送方法、装置、节点及介质
US10687345B2 (en) Method for transmitting and receiving uplink signal in wireless communication system supporting unlicensed band and apparatus for supporting same
US9167594B2 (en) Method and related device of a trigger mechanism of buffer status report and scheduling request in a wireless communication system
EP2486764B1 (fr) Plage de cellules étendue
EP2422576B1 (fr) Procédé et appareil pour réaliser des transmissions de liaison montante dans un système de communications sans fil
CN109005596B (zh) 一种调整竞争窗长度的方法及设备
EP3226635B1 (fr) Procédé de système de communication cellulaire
JP6207837B2 (ja) スケジューリングを制御するための方法及び装置
EP2206395B1 (fr) Procédé et agencement dans un système de télécommunication
CN107113756B (zh) 用于支持设备到设备通信的用户设备的调度指配传输定时
KR20190005943A (ko) 업링크 신호 송신 방법 및 사용자 장치
CN112584555B (zh) 一种数据传输方法、终端及ran设备
US8750224B2 (en) Preconfigured short scheduling request cycle
WO2009126078A1 (fr) Ordonnancement montant amélioré dans un système cellulaire
CN110636550B (zh) 广覆盖场景下基于基站侧资源预留的多用户上行调度方法
EP2521407A1 (fr) Procédé et appareil de configuration de ressources basées sur la contention
KR20140034285A (ko) 스케줄링 요청이 가능하게 된 업링크 전송
CN102595600A (zh) 半静态调度方法、用户设备及网络设备
IL195045A (en) A system, method, and computer software that provides applink synchronization using the allocation of dedicated applink resources
CN108293249B (zh) 用于发送上行控制信息的方法、终端和基站
KR101595992B1 (ko) 통신하는 방법 및 그것을 위한 무선국
WO2016099345A1 (fr) Programmation de ressources en liaison montante dans des instances temporelles multiples
CN110506446B (zh) 用于子帧调度的方法和装置
US9001731B2 (en) Method for communicating in a network, a secondary station and system therefor
EP3189701B1 (fr) Compte rendu d'état de tampon

Legal Events

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

Ref document number: 08741900

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: 08741900

Country of ref document: EP

Kind code of ref document: A1