WO2018024943A1 - Programmation semi-persistante de canal avec concurrence pour répétitions d'émission - Google Patents

Programmation semi-persistante de canal avec concurrence pour répétitions d'émission Download PDF

Info

Publication number
WO2018024943A1
WO2018024943A1 PCT/FI2017/050552 FI2017050552W WO2018024943A1 WO 2018024943 A1 WO2018024943 A1 WO 2018024943A1 FI 2017050552 W FI2017050552 W FI 2017050552W WO 2018024943 A1 WO2018024943 A1 WO 2018024943A1
Authority
WO
WIPO (PCT)
Prior art keywords
resources
repetitions
dedicated
transmit
data
Prior art date
Application number
PCT/FI2017/050552
Other languages
English (en)
Inventor
Preben Mogensen
Renato ABREU
Klaus Pedersen
Original Assignee
Nokia Technologies Oy
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 Nokia Technologies Oy filed Critical Nokia Technologies Oy
Priority to EP17836464.2A priority Critical patent/EP3494752A4/fr
Publication of WO2018024943A1 publication Critical patent/WO2018024943A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/08—Arrangements for detecting or preventing errors in the information received by repeating transmission, e.g. Verdan system
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1867—Arrangements specially adapted for the transmitter end
    • H04L1/189—Transmission or retransmission of more than one copy of a message
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access, e.g. scheduled or random access
    • H04W74/08—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]

Definitions

  • TECHNICAL FIELD This embodiments relate generally to wireless communication systems and, more specifically, to employing a pre-scheduling scheme for contention based channels to be used for necessary transmission repetitions.
  • SPS semi- persistent scheduling
  • the base station or eNB
  • SPS resources are UE specific and, if there is available data during the pre-scheduled interval, they may be reserved to the UE for a longer period of time for transmission/reception.
  • the scheme reduces signaling overhead and helps to avoid the limitation of the control channel capacity, enabling a higher number of users both in downlink and uplink.
  • NACK negative acknowledgement
  • the current embodiments combine transmissions on pre-configured dedicated resources with automatic retransmissions on a set of shared contention-based resources.
  • This embodiments include autonomous methods for deciding at which radio resources to transmit repetitions.
  • the embodiments also include the corresponding UE- and BS-behaviors, as well as the corresponding air interface signaling between those entities.
  • FIG. 1 is a block diagram of one possible and non-limiting exemplary system in which the exemplary embodiments may be practiced;
  • FIG. 2 is an illustration of an embodiment of the proposed embodiments for the uplink
  • FIG. 3 is a logic flow diagram for semi-persistent scheduling of contention based channel for transmission repetitions, and illustrates the operation of an exemplary method, a result of execution of computer program instructions embodied on a computer readable memory, functions performed by logic implemented in hardware, and/or interconnected means for performing functions in accordance with exemplary embodiments;
  • FIG. 4 illustrates an embodiment the embodiments with repetitions and contention
  • FIG. 5A and FIG. 5B illustrate SPS transmission without the concept of the current embodiments and SPS transmission with the contention based (CB) for repetitions concept of the current embodiments, respectively.
  • CB contention based
  • This embodiments relate to a fifth generation (5G) concept design, focusing on a new scheme with improved resource utilization and latency reduction, to be applied for Machine Type Communication (MTC).
  • the 5G radio access technology is expected to enable a wide range of MTC services, including the support of ultra-reliable and low latency communication (URLLC) to be used in many novel applications.
  • the 3GPP group in the technical report TR 38.913, defines stringent targets for reliability, for example 1-10 "5 within 1ms, and average user plane latency of 0.5ms. Meeting such requirements in an efficient way demands new solutions to come in the future mobile wireless technologies.
  • exemplary embodiments of the current embodiments look to use a new concept that employs a pre- scheduling scheme for CB channels to be used in case of necessary transmission repetitions, in a low latency and resource efficient way.
  • Embodiments of the present embodiments may provide enhanced latency by pre-scheduling resources to be used on necessity of further transmission repetitions for a reliable communication.
  • the suggested scheme has improved radio resource utilization, since it proposes occasional use of shared pre-scheduled resources by a group of users.
  • the retransmissions procedure specified by 3GPP for NB-IoT [3GPP TR 45.820] has the amount of time- frequency resources, for instance, the number of repetitions and the number of tones, set individually per UE depending on the coverage condition.
  • the UEs are dynamically scheduled with up to 2048 repetitions onto a 1ms TTI. This technique can lead to high latency and resource consumption when the number of necessary repetitions is overestimated.
  • the word "exemplary” as used herein means “serving as an example, instance, or illustration.” Any embodiment described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other embodiments. All of the embodiments described in this Detailed Description are exemplary embodiments provided to enable persons skilled in the art to make or use the embodiments and not to limit the scope of the embodiments which is defined by the claims. Therefore, the exemplary embodiments herein describe techniques for semi-persistent scheduling of contention based channel for transmission repetitions.
  • the base station (BS) configures the UE to use a pre-scheduled (SPS) dedicated time-frequency resource pattern with a certain periodicity.
  • SPS pre-scheduled
  • the BS also configures the UE with CB resources (shared by a group of UEs, in order to optimize resources utilization) located among its periodic dedicated resources. The later should be used by the UE only if it needs to perform further retransmissions.
  • the BS should reconcile the amount of dedicated and CB resources in order to avoid waste and, at the same time, reduce the probability of collision. This reconciliation can be done by proper allocation of necessary dedicated resources and by grouping the number of users per CB channel according to the target success probability and expected error rate.
  • the BS can reconfigure the UEs in order to increase or reduce the number of users sharing a CB resource depending on the conditions and target reliability.
  • the BS can configure the decision rules to use the dedicated and the CB channels for continuing retransmissions or for a drop in the information. This can be defined according to the QoS constraints or to a maximum number of allowed repetitions per UE.
  • the BS may or may not assign orthogonal reference signals to the UEs sharing the same CB channel so as to be able to differentiate them by their transmitted signal.
  • the UE uses its dedicated SPS resources to transmit repetitions of the information (for example, in symbol or TTI level) in order to increase the probability of success.
  • the UE does not receive an ACK from the BS, then it continues transmitting the repetitions in the pre-scheduled CB resources. Note, however, that there is the possibility that there may be no repetitions on the dedicated resources, but merely a single transmission per piece of data, which may occur if the reliability on the dedicated resources is adequately high.
  • the dedicated SPS resources are used by the BS to transmit the information and may be used by the BS to transmit repetitions of the information (for example, in symbol or TTI level) in order to increase the probability of success.
  • the BS does not receive an ACK from the UE, then it continues transmitting the repetitions in the pre-scheduled CB resources. For example, if the BS receives a NACK from the UE, then it continues transmitting the repetitions in the pre-scheduled CB resources.
  • BS does not receive an ACK from more than one UE, then it has to choose to which UE it will continue transmitting to on the CB channel (randomly or based on QoS requirements).
  • a UE sending a NACK, or a UE not sending an ACK, for data received from the BS in its dedicated SPS resources should monitor its allocated resources on the CB channel and detect whether it is the intended recipient for any data received on these allocated resources on the CB channel.
  • a UE which sent an ACK for data received on the dedicated resources may skip the monitoring of its allocated resources on the CB channel.
  • Transmitting repetitions or retransmissions could also be implemented in such a manner as to transmit one single repetition or many repetitions of the same information, or different redundant versions of the same information (or portions of it).
  • SPS semi-persistent scheduling
  • it could also be implemented as a persistent scheduling (e.g., pre-scheduling of a sequence of resource chunks valid until the UE is active or receives another allocation) or as a single pre-scheduling (e.g. without a periodicity, not necessarily persistent).
  • the embodiments may be practiced with any form of pre-scheduling, even though (semi-)persistent scheduling implementation may be more applicable for URLLC cases. Additional description of these techniques is presented after a system into which the exemplary embodiments may be used is described.
  • FIG. 1 is a block diagram of one possible and non-limiting exemplary system in which the exemplary embodiments may be practiced.
  • a user equipment (UE) 110 is in wireless communication with a wireless network 100.
  • a UE is a wireless, typically mobile device that can access a wireless network.
  • the UE 110 includes one or more processors 120, one or more memories 125, and one or more transceivers 130 interconnected through one or more buses 127.
  • Each of the one or more transceivers 130 includes a receiver, Rx, 132 and a transmitter, Tx, 133.
  • the one or more buses 127 may be address, data, or control buses, and may include any interconnection mechanism, such as a series of lines on a motherboard or integrated circuit, fiber optics or other optical communication equipment, and the like.
  • the one or more transceivers 130 are connected to one or more antennas 128.
  • the one or more memories 125 include computer program code 123.
  • the YYY module allows functionality for the semi-persistent scheduling of contention based channel for transmission repetitions where any method or examples of such embodiments discussed herein can be practiced.
  • the UE 110 includes a YYY module 140, comprising one of or both parts 140-1 and/or 140-2, which may be implemented in a number of ways.
  • the YYY module 140 may be implemented in hardware as YYY module 140-1, such as being implemented as part of the one or more processors 120.
  • the YYY module 140-1 may be implemented also as an integrated circuit or through other hardware such as a programmable gate array.
  • the YYY module 140 may be implemented as YYY module 140-2, which is implemented as computer program code 123 and is executed by the one or more processors 120.
  • the one or more memories 125 and the computer program code 123 may be configured to, with the one or more processors 120, to cause the user equipment 110 to perform one or more of the operations as described herein.
  • the UE 110 communicates with base station 170 via a wireless link 111.
  • the base station (for instance, an evolved NodeB) 170 is a base station (e.g., for LTE, long term evolution) that provides access by wireless devices such as the UE 110 to the wireless network 100.
  • the base station 170 includes one or more processors 152, one or more memories 155, one or more network interfaces (N/W I/F(s)) 161, and one or more transceivers 160 interconnected through one or more buses 157.
  • Each of the one or more transceivers 160 includes a receiver, Rx, 162 and a transmitter, Tx, 163.
  • the one or more transceivers 160 are connected to one or more antennas 158.
  • the one or more memories 155 include computer program code 153.
  • the base station 170 includes a ZZZ module 150, comprising one of or both parts 150-1 and/or 150-2, which may be implemented in a number of ways.
  • the ZZZ module 150 may be implemented in hardware as ZZZ module 150-1, such as being implemented as part of the one or more processors 152.
  • the ZZZ module 150-1 may be implemented also as an integrated circuit or through other hardware such as a programmable gate array.
  • the ZZZ module 150 may be implemented as ZZZ module 150-2, which is implemented as computer program code 153 and is executed by the one or more processors 152.
  • the one or more memories 155 and the computer program code 153 are configured to, with the one or more processors 152, to cause the base station 170 to perform one or more of the operations as described herein.
  • the one or more network interfaces 161 communicate over a network such as via the links 176 and 131.
  • Two or more base stations 170 communicate using, e.g., link 176.
  • the link 176 may be wired or wireless or both and may implement, e.g., an X2 interface.
  • the one or more buses 157 may be address, data, or control buses, and may include any interconnection mechanism, such as a series of lines on a motherboard or integrated circuit, fiber optics or other optical communication equipment, wireless channels, and the like.
  • the one or more transceivers 160 may be implemented as a remote radio head (RRH) 195, with the other elements of the base station 170 being physically in a different location from the RRH, and the one or more buses 157 could be implemented in part as fiber optic cable to connect the other elements of the base station 170 to the RRH 195.
  • RRH remote radio head
  • each cell can correspond to a single carrier and a base station may use multiple carriers. So if there are three 120-degree cells per carrier and two carriers, then the base station has a total of 6 cells.
  • the wireless network 100 may include a network control element (NCE) 190 that may include MME (Mobility Management Entity)/SGW (Serving Gateway) functionality, and which provides connectivity with a further network, such as a telephone network and/or a data communications network (e.g., the Internet).
  • the base station 170 is coupled via a link 131 to the NCE 190.
  • the link 131 may be implemented as, e.g., an S 1 interface.
  • the NCE 190 includes one or more processors 175, one or more memories 171, and one or more network interfaces (N/W I/F(s)) 180, interconnected through one or more buses 185.
  • the one or more memories 171 include computer program code 173.
  • the one or more memories 171 and the computer program code 173 are configured to, with the one or more processors 175, cause the NCE 190 to perform one or more operations.
  • the wireless network 100 may implement network virtualization, which is the process of combining hardware and software network resources and network functionality into a single, software-based administrative entity, a virtual network.
  • Network virtualization involves platform virtualization, often combined with resource virtualization.
  • Network virtualization is categorized as either external, combining many networks, or parts of networks, into a virtual unit, or internal, providing network- like functionality to software containers on a single system. Note that the virtualized entities that result from the network virtualization may still be implemented, at some level, using hardware such as processors 152 or 175 and memories 155 and 171, and also such virtualized entities create technical effects.
  • the computer readable memories 125, 155, and 171 may be of any type suitable to the local technical environment and may be implemented using any suitable data storage technology, such as semiconductor based memory devices, flash memory, magnetic memory devices and systems, optical memory devices and systems, fixed memory and removable memory.
  • the computer readable memories 125, 155, and 171 may be means for performing storage functions.
  • the processors 120, 152, and 175 may be of any type suitable to the local technical environment, and may include one or more of general purpose computers, special purpose computers, microprocessors, digital signal processors (DSPs) and processors based on a multi- core processor architecture, as non-limiting examples.
  • the processors 120, 152, and 175 may be means for performing functions, such as controlling the UE 110, base station 170, and other functions as described herein.
  • the various embodiments of the user equipment 110 can include, but are not limited to, cellular phones such as smart devices, tablets, personal digital assistants (PDAs) having wireless communication capabilities, portable computers having wireless communication capabilities, image capture devices such as digital cameras having wireless communication capabilities, gaming devices having wireless communication capabilities, music storage and playback appliances having wireless communication capabilities, internet appliances permitting wireless Internet access and browsing, tablets with wireless communication capabilities, as well as portable units or terminals that incorporate combinations of such functions.
  • PDAs personal digital assistants
  • image capture devices such as digital cameras having wireless communication capabilities
  • gaming devices having wireless communication capabilities
  • music storage and playback appliances having wireless communication capabilities
  • internet appliances permitting wireless Internet access and browsing tablets with wireless communication capabilities, as well as portable units or terminals that incorporate combinations of such functions.
  • various embodiments of the user equipment include machines, communicators and categories of equipment, which are not primarily or not at all in use by human interaction.
  • FIG. 2 is an illustration of the proposed embodiments for the uplink 200.
  • the BS 202 first configures the UE 204 with the semi-persistent scheduling information of its dedicated channels and the contention based channels, where this information can include time- frequency location and periodicity of the resources, as shown in action 206.
  • This is an example, but consider also that, instead SPS with certain periodicity, it could simply be a pre-scheduling of dedicated and CB resources.
  • the UE awaits for data to be driven in the dedicated resources, shown on the diagram as block 208.
  • the UE 204 will be able to regularly use its pre-scheduled resources whenever it has data available for transmission, reducing signaling overhead, latency and error probability on scheduling request and granting messages.
  • the UE transmits repetitions of information in symbol or TTI level.
  • the UE transmits its available data using repetitions in a proactive way in order to increase the probability of success of reception.
  • this action could be merely once or many repetitions.
  • the BS may fail to decode the information.
  • the UE will not receive an ACK from the BS, so that the UE will have to contend for the CB resources.
  • the UE does not get an ACK during its transmission, then it contends for the CB channel and continues its repetitions on it as seen in the figure as action 216.
  • a soft combining of the received data will substantially increase the probability of success, resulting in an acknowledgment from the BS, as can be seen from action 218.
  • the same type of procedure can basically be implemented in the other direction for the downlink transmission (except for the initial configuration setting that is typically transmitted from the BS to the UE side).
  • FIG. 3 depicts a representation of the information and the decision flow of an embodiment of the embodiments. It shows that the information is initially transmitted on the pre-scheduled dedicated resources. A decision to continue retransmitting on the CB resources is taken if an ACK is not received. If there is still no acknowledgement after the transmissions on the CB channel, then a decision should be taken to either continue retransmitting that information or drop it.
  • This decision rule can initially be configured by the BS taking into account the QoS requirement and the maximum number of allowed repetitions per user.
  • Block 302 represents the BS configuring SPS of dedicated and CB resources to UEs.
  • Block 304 represents checking if there is available data to transmit. If there is, then the method proceeds to block 306 which requires a decision as to whether there is data to transmit. If yes, then the process, as shown in block 308 transmits data or any repetitions thereof on dedicated resources. If no, then the process returns to block 304.
  • another decision point is reached as to whether an ACK is received. If yes, then the process returns to block 304 to determine if there is still available data to transmit. If no, then the technique calls for continuing to transmit repetitions on CB resources as shown in block 312. Once again, a decision point is reached in block 314 to determine if an ACK has been received. If yes, then he process returns to block 304 to determine if there is still available data to transmit. If no, then the technique calls for deciding whether or not to drop the data, as shown in block 316.
  • the process returns to block 304 to determine once again if there is still available data to transmit. If the data is not to be dropped, then the process returns to block 308 to again transmit repetitions on dedicated resources.
  • Exemplary embodiments of the current embodiments employ an optimized scheduling algorithm in the base station to allocate the amount of dedicated and contention based resources for the users in a way that prevents wasting by providing the necessary resources estimated to meet targeted latency and reliability.
  • the scheduler may determine which users, and as such how many users, to allocate to specific resources on the CB channel in order to achieve a certain maximum probability of collision on these resources in view of reliability of the dedicated resources of the users.
  • all users of the BS may allocated the same resources on the CB channel, which is advantageously possible when the probability of failure on the dedicated resources is adequately low to produce a low probability of collision on the CB resources, as users would rarely have to resort to the use of the CB resources.
  • the scheduler may set the periodicity of CB resources to be the same or different from the periodicity of dedicated SPS resources of a UE.
  • the concept can be implemented with a NACK message but there is also the possibility of implementing with an implicit NACK (that is, "no ACK”), which should be a preferable approach for the URLLC cases. In that case, it may be preferable to have the risk of a pointless transmission (which may not be energy efficient), than have the risk of not getting a retransmission when it is really needed (which could reduce the reliability and increase latency). Note that when using an explicit NACK, the node could also misunderstand an NACK as an ACK and not retransmit when is needed. As such, both approaches are shown herein. Thus, the embodiments include an enablement for a solution to prevent wasting.
  • FIG. 4 illustrates a situation in which different UEs transmit their repetitions in symbol or TTI level. Some UEs might not get an ACK and will contend for continuing their repetitions on the CB channel. The probability of more than one UE needing to use the CB channel should be reduced by the pre-scheduling strategy.
  • the embodiments may improve the probability of successful reception combined with reduced delays, which would be caused by negative acknowledgment and retransmissions rescheduling. In addition, it allows for allocation of large numbers of users to the same CB resource while maintaining, under typical operation, low probability of collision on these resources.
  • the embodiments may avoid the signaling caused by the retransmission grants and, consequently, reduces the delays caused by re-scheduling of non-acknowledged blocks and the probability of errors on control signals.
  • FIG. 5 A illustrates SPS transmission without use of the embodiments
  • FIG. 5B illustrates SPS transmission with the CB for repetitions concept of the embodiments.
  • FIG. 5 A illustrates SPS transmission without use of the embodiments
  • FIG. 5B illustrates SPS transmission with the CB for repetitions concept of the embodiments.
  • Embodiments herein may be implemented in software (executed by one or more processors), hardware (e.g., an application specific integrated circuit), or a combination of software and hardware.
  • the software e.g., application logic, an instruction set
  • a "computer-readable medium” may be any media or means that can contain, store, communicate, propagate or transport the instructions for use by or in connection with an instruction execution system, apparatus, or device, such as a computer, with one example of a computer described and depicted, e.g., in FIG. 1.
  • a computer-readable medium may comprise a computer-readable storage medium (e.g., 104, 134, or other device) that may be any media or means that can contain, store, and/or transport the instructions for use by or in connection with an instruction execution system, apparatus, or device, such as a computer.
  • a computer- readable storage medium does not comprise merely propagating signals. If desired, the different functions discussed herein may be performed in a different order and/or concurrently with each other. Furthermore, if desired, one or more of the above-described functions may be optional or may be combined.
  • a technical effect or advantage of one or more of the example embodiments disclosed herein is, in URLLC use cases where capacity is not a main requirement, a certain flexibility to sacrifice some extra resources in order to meet the targets of latency and reliability.
  • Another technical effect or advantage of one or more of the example embodiments disclosed herein is that the concept of transmitting repetitions using a CB channel brings a new degree of freedom optimize resources.
  • Yet a further technical effect or advantage of one or more of the example embodiments disclosed herein is to optimize the use of radio resources.

Abstract

Les modes de réalisation de l'invention concernent un équipement d'utilisateur comportant une ou plusieurs mémoires et un code de programme informatique configuré, avec un ou plusieurs processeurs, pour amener l'équipement d'utilisateur à: recevoir une configuration de ressources dédiées et de ressources avec concurrence (CB); s'il existe des données disponibles à émettre, émettre les données ou d'éventuelles répétitions de celles-ci sur les ressources dédiées; si un accusé de réception n'est pas reçu, continuer à émettre les répétitions sur les ressources avec concurrence, et si un accusé de réception n'est pas reçu, abandonner des données ou continuer à émettre les répétitions sur les ressources dédiées.
PCT/FI2017/050552 2016-08-05 2017-07-25 Programmation semi-persistante de canal avec concurrence pour répétitions d'émission WO2018024943A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
EP17836464.2A EP3494752A4 (fr) 2016-08-05 2017-07-25 Programmation semi-persistante de canal avec concurrence pour répétitions d'émission

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US201662371406P 2016-08-05 2016-08-05
US62/371,406 2016-08-05

Publications (1)

Publication Number Publication Date
WO2018024943A1 true WO2018024943A1 (fr) 2018-02-08

Family

ID=61072652

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/FI2017/050552 WO2018024943A1 (fr) 2016-08-05 2017-07-25 Programmation semi-persistante de canal avec concurrence pour répétitions d'émission

Country Status (2)

Country Link
EP (1) EP3494752A4 (fr)
WO (1) WO2018024943A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112771977A (zh) * 2018-07-24 2021-05-07 皇家Kpn公司 共享资源上的可靠低时延通信
WO2022048583A1 (fr) * 2020-09-07 2022-03-10 中兴通讯股份有限公司 Appareil et procédé de détermination de ressources, appareil et procédé de configuration de ressources, nœud de communication et support de stockage

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2530992A1 (fr) * 2010-01-26 2012-12-05 Sharp Kabushiki Kaisha Procédé de traitement et appareil de station mobile
US20130034071A1 (en) * 2010-04-28 2013-02-07 Lg Electronics Inc. Uplink signal transmission method using contention-based identifiers
WO2013096555A1 (fr) * 2011-12-23 2013-06-27 Research In Motion Limited Procédé mis en œuvre dans une station de base enodeb
US20160050667A1 (en) * 2014-08-18 2016-02-18 Samsung Electronics Co., Ltd. Communication on licensed and unlicensed bands
WO2016105570A1 (fr) * 2014-12-23 2016-06-30 Interdigital Patent Holdings, Inc. Réduction de latence dans des systèmes lte

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9603048B2 (en) * 2012-03-16 2017-03-21 Interdigital Patent Holdings, Inc. Random access procedures in wireless systems

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2530992A1 (fr) * 2010-01-26 2012-12-05 Sharp Kabushiki Kaisha Procédé de traitement et appareil de station mobile
US20130034071A1 (en) * 2010-04-28 2013-02-07 Lg Electronics Inc. Uplink signal transmission method using contention-based identifiers
WO2013096555A1 (fr) * 2011-12-23 2013-06-27 Research In Motion Limited Procédé mis en œuvre dans une station de base enodeb
US20160050667A1 (en) * 2014-08-18 2016-02-18 Samsung Electronics Co., Ltd. Communication on licensed and unlicensed bands
WO2016105570A1 (fr) * 2014-12-23 2016-06-30 Interdigital Patent Holdings, Inc. Réduction de latence dans des systèmes lte

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
CATTCATR: "Analysis on resource efficiency of uplink access solutions", R2-154122, October 2015 (2015-10-01)
HUAWEIHISILICON: "Contention based uplink transmission", R2-154191, October 2015 (2015-10-01)
K. ZHOU ET AL.: "Adaptive transmission and multiple-access for sparse-traffic sources", PROCEEDINGS OF THE 20TH EUSIPCO, 2012
RATASUK, R.PRASAD, A.ZEXIAN LIGHOSH, A.UUSITALO, M.: "Recent advancements in M2M communications in 4G networks and evolution towards 5G", INTELLIGENCE IN NEXT GENERATION NETWORKS (ICIN, vol. 52, no. 57, February 2015 (2015-02-01), pages 17 - 19
See also references of EP3494752A4 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112771977A (zh) * 2018-07-24 2021-05-07 皇家Kpn公司 共享资源上的可靠低时延通信
WO2022048583A1 (fr) * 2020-09-07 2022-03-10 中兴通讯股份有限公司 Appareil et procédé de détermination de ressources, appareil et procédé de configuration de ressources, nœud de communication et support de stockage

Also Published As

Publication number Publication date
EP3494752A1 (fr) 2019-06-12
EP3494752A4 (fr) 2020-03-25

Similar Documents

Publication Publication Date Title
US11956086B2 (en) Method for scheduling retransmissions for configured grants in NR-unlicensed
US11019510B2 (en) Apparatus and method for radio resource management for high reliability and low latency traffic
US10904903B2 (en) Scheduling UEs with mixed TTI length
CN114600541A (zh) 用于侧行链路的反馈报告
US11770837B2 (en) Systems and methods for determining information indicative of cancelation
US20150195854A1 (en) Methods and apparatus for contention based transmission
JP6328561B2 (ja) アップリンクでの制御信号に関する通信リソース割当
JP2021534652A (ja) Ｕｒｌｌｃサービスのための低レイテンシｈａｒｑプロトコル
JP6780090B2 (ja) データ伝送のための制御リソースの使用
US10952260B1 (en) Enhancements for contention based shared preconfigured uplink resource mechanism with additional resource allocation for retransmissions
WO2018024943A1 (fr) Programmation semi-persistante de canal avec concurrence pour répétitions d'émission
EP3619999B1 (fr) Support urllc utilisant deux groupes de ressources radio
RU2784411C1 (ru) Способ планирования повторных передач для сконфигурированных грантов в системе NR с нелицензированным спектром
WO2022213238A1 (fr) Transmission fiable sur des bandes sous licence et sans licence
US11985699B2 (en) Ultra-reliable low-latency communications support using grant free transmissions
KR20240068503A (ko) 유형 2 구성된 승인들을 지원하기 위한 네트워크 제어식 리피터(ncr) 절차들
KR20240068505A (ko) 유형 1 구성된 승인들을 지원하기 위한 네트워크 제어식 리피터(ncr) 절차들
KR20240068506A (ko) 구성된 승인들을 사용한 반정적 ul 송신들을 위한 네트워크 제어식 리피터(ncr) 사이드 정보 및 구성들
WO2022083863A1 (fr) Opération de planification semi-persistante (sps) de liaison descendante (dl) (sps dl) améliorée pour point de réception multi-transmission
WO2018150084A1 (fr) Récupération de données efficace et rapide à l'aide d'informations de coordination de réseau et d'un canal de rétroaction harq

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

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2017836464

Country of ref document: EP

Effective date: 20190305