WO2020207553A1 - Régulation d'encombrement dans une communication cellulaire - Google Patents

Régulation d'encombrement dans une communication cellulaire Download PDF

Info

Publication number
WO2020207553A1
WO2020207553A1 PCT/EP2019/058774 EP2019058774W WO2020207553A1 WO 2020207553 A1 WO2020207553 A1 WO 2020207553A1 EP 2019058774 W EP2019058774 W EP 2019058774W WO 2020207553 A1 WO2020207553 A1 WO 2020207553A1
Authority
WO
WIPO (PCT)
Prior art keywords
congestion
control message
channel
congestion control
network node
Prior art date
Application number
PCT/EP2019/058774
Other languages
English (en)
Inventor
Nuno Manuel KIILERICH PRATAS
Claudio Rosa
Frank Frederiksen
Benny Vejlgaard
Morten Toft
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 PCT/EP2019/058774 priority Critical patent/WO2020207553A1/fr
Publication of WO2020207553A1 publication Critical patent/WO2020207553A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/002—Transmission of channel access control information
    • H04W74/006—Transmission of channel access control information in the downlink, i.e. towards the terminal
    • 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/14—Spectrum sharing arrangements between different networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/08—Testing, supervising or monitoring using real traffic
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/02—Arrangements for optimising operational condition
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W48/00—Access restriction; Network selection; Access point selection
    • H04W48/08—Access restriction or access information delivery, e.g. discovery data delivery
    • H04W48/12—Access restriction or access information delivery, e.g. discovery data delivery using downlink control channel
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/08—Non-scheduled access, e.g. ALOHA
    • H04W74/0808—Non-scheduled access, e.g. ALOHA using carrier sensing, e.g. carrier sense multiple access [CSMA]

Definitions

  • the present application generally relates to the field of wireless communications.
  • the present application relates to a user node and a network node for wireless communication, and related methods and computer programs .
  • Some wireless communication techniques may require that before any transmis sion can be done over a wireless medium a check needs to be passed, for example, a Listen Before Talk (LBT) check.
  • LBT Listen Before Talk
  • the check requirement may have a significant per formance impact on radio communication protocols, for example, due to the induced delays that depend on the degree of channel activity. Namely, whenever an LBT check fails, then the user node cannot proceed with the transmission and may have to re-attempt the channel ac cess at a later opportunity (including a new LBT check) .
  • An example embodiment of a network node com prises at least one processor and at least one memory including computer program code.
  • the at least one memory and the computer program code are configured to, with the at least one processor, cause the network node to at least perform: monitoring at least one bandwidth por tion for activity in cellular communication in an unli censed spectrum; identifying a channel congestion based on the monitoring; and transmitting a congestion control message when the channel congestion ends.
  • the channel congestion is identified based on listen before talk check fails.
  • the activity is caused by activity of nodes of another net work .
  • the congestion control message comprises at least one of a duration of the channel congestion, at least one traffic class that can ignore the congestion control message, and an indication identifying a congestion avoidance behavior to apply when receiving the congestion control message .
  • the indication identifies a fixed length window back-off, a variable length window back-off based on the duration of the channel congestion, or a back-off selection based on when a user node started to attempt its transmission.
  • transmitting the congestion control message comprises transmitting the congestion control message by a random access load control radio network temporary identifier.
  • the at least one memory and the computer program code con figured to, with the at least one processor, cause the network node to at least perform: determining a duration of the channel congestion; and transmitting the conges tion control message when the channel congestion ends and when the duration exceeds a channel congestion threshold .
  • the at least one memory and the computer program code con figured to, with the at least one processor, cause the network node to at least perform: transmitting a load control information message before causing transmission of the congestion control message, the load control in formation message comprising at least one of a load control function activation element, the random access load control radio network temporary identifier, at least one traffic class allowed to ignore the congestion control message, and a default congestion avoidance be havior to apply when receiving the congestion control message .
  • the network node comprises a base station.
  • An example embodiment of a user node comprises at least one processor and at least one memory including computer program code.
  • the at least one memory and the computer program code are configured to, with the at least one processor, cause the user node to at least perform: listening for a congestion control message upon the start of a random access channel procedure in cel lular communication in an unlicensed spectrum; and ap plying a signaled congestion avoidance policy, when identifying the congestion control message.
  • listening for a congestion control message upon the start of a random access channel procedure comprises listening the congestion control message before initiating a physical random access channel procedure.
  • the at least one memory and the computer program code con figured to, with the at least one processor, cause the user node to at least perform: identifying a channel congestion in the cellular communication in the unli censed spectrum, and wherein the listening comprises listening for the congestion control message before at plausible a new physical random access channel procedure transmission .
  • the congestion control message is signaled by a random ac cess load control radio network temporary identifier.
  • the congestion control message comprises at least one of a duration of the channel congestion, at least one traffic class that can ignore the congestion control message, and an indication identifying a congestion avoidance behavior to apply when receiving the congestion control message .
  • the indication identifies a fixed length window back-off, a variable length window back-off based on the duration of the channel congestion, or a back-off selection based on when a user node started to attempt its transmission.
  • the at least one memory and the computer program code con figured to, with the at least one processor, cause the user node to at least perform: receiving a load control information message before the congestion control mes sage, the load control information message comprising at least one of a load control function activation el ement, the random access load control radio network tem porary identifier, at least one traffic class allowed to ignore the congestion control message, and a default congestion avoidance behavior to apply when receiving the congestion control message.
  • the user node comprises a mobile terminal.
  • An example embodiment of a method comprises monitoring, by a network node, at least one bandwidth portion for activity in cellular communication in an unlicensed spectrum; identifying, by the network node, a channel congestion based on the monitoring; and trans mitting, by the network node, a congestion control mes sage when the channel congestion ends.
  • the channel congestion is identified based on listen before talk check fails.
  • the activity is caused by activity of nodes of another net work .
  • the congestion control message comprises at least one of a duration of the channel congestion, at least one traffic class that can ignore the congestion control message, and an indication identifying a congestion avoidance behavior to apply when receiving the congestion control message .
  • the indication identifies a fixed length window back-off, a variable length window back-off based on the duration of the channel congestion, or a back-off selection based on when a user node started to attempt its transmission.
  • the method comprises transmitting, by the network node, the congestion control message by a random access load con trol radio network temporary identifier. In an example embodiment, alternatively or in addition to the above-described example embodiments, the method comprises determining, by the network node, a duration of the channel congestion; and transmitting, by the network node, the congestion control message when the channel congestion ends and when the duration ex ceeds a channel congestion threshold.
  • the method comprises transmitting, by the network node, a load control information message before causing trans mission of the congestion control message, the load con trol information message comprising at least one of a load control function activation element, the random access load control radio network temporary identifier, at least one traffic class allowed to ignore the conarea control message, and a default congestion avoid ance behavior to apply when receiving the congestion control message.
  • the network node comprises a base station.
  • An example embodiment of a method comprises listening, by a user node, for a congestion control message upon the start of a random access channel pro cedure in cellular communication in an unlicensed spec trum; and applying, by the user node, a signaled conflow avoidance policy, when identifying the conges tion control message.
  • listening for a congestion control message upon the start of a random access channel procedure comprises listening the congestion control message before initiating a physical random access channel procedure.
  • the method comprises identifying, by the user node, a chan nel congestion in the cellular communication in the un licensed spectrum, and wherein the listening comprises listening for the congestion control message before at plausible a new physical random access channel procedure transmission .
  • the congestion control message is signaled by a random ac cess load control radio network temporary identifier.
  • the congestion control message comprises at least one of a duration of the channel congestion, at least one traffic class that can ignore the congestion control message, and an indication identifying a congestion avoidance behavior to apply when receiving the congestion control message .
  • the indication identifies a fixed length window back-off, a variable length window back-off based on the duration of the channel congestion, or a back-off selection based on when a user node started to attempt its transmission.
  • the method comprises receiving, by the user node, a load control information message before the congestion con trol message, the load control information message com prising at least one of a load control function activa tion element, the random access load control radio net work temporary identifier, at least one traffic class allowed to ignore the congestion control message, and a default congestion avoidance behavior to apply when re DCving the congestion control message.
  • the user node comprises a mobile terminal.
  • An example embodiment of a network node com prises means for performing: monitoring at least one bandwidth portion for activity in cellular communication in an unlicensed spectrum; identifying a channel conarea based on the monitoring; and transmitting a conflow control message when the channel congestion ends .
  • the channel congestion is identified based on listen before talk check fails.
  • the activity is caused by activity of nodes of another net work .
  • the congestion control message comprises at least one of a duration of the channel congestion, at least one traffic class that can ignore the congestion control message, and an indication identifying a congestion avoidance behavior to apply when receiving the congestion control message .
  • the indication identifies a fixed length window back-off, a variable length window back-off based on the duration of the channel congestion, or a back-off selection based on when a user node started to attempt its transmission.
  • the method comprises transmitting, by the network node, the congestion control message by a random access load con trol radio network temporary identifier.
  • the network node comprises means for performing: determining a duration of the channel congestion; and transmitting the congestion control message when the channel conges tion ends and when the duration exceeds a channel con
  • the network node comprises means for performing: transmit ting a load control information message before causing transmission of the congestion control message, the load control information message comprising at least one of a load control function activation element, the random access load control radio network temporary identifier, at least one traffic class allowed to ignore the conarea control message, and a default congestion avoid ance behavior to apply when receiving the congestion control message.
  • the network node comprises a base station.
  • An example embodiment of a user node comprises means for performing: listening for a congestion control message upon the start of a random access channel pro cedure in cellular communication in an unlicensed spec trum; and applying a signaled congestion avoidance pol icy, when identifying the congestion control message.
  • listening for a congestion control message upon the start of a random access channel procedure comprises listening the congestion control message before initiating a physical random access channel procedure.
  • the user node comprises means for performing: identifying a channel congestion in the cellular communication in the unlicensed spectrum, and wherein the listening comprises listening for the congestion control message before at plausible a new physical random access channel procedure transmission .
  • the congestion control message is signaled by a random ac cess load control radio network temporary identifier.
  • the congestion control message comprises at least one of a duration of the channel congestion, at least one traffic class that can ignore the congestion control message, and an indication identifying a congestion avoidance behavior to apply when receiving the congestion control message .
  • the indication identifies a fixed length window back-off, a variable length window back-off based on the duration of the channel congestion, or a back-off selection based on when a user node started to attempt its transmission.
  • the user node comprises means for performing: receiving a load control information message before the congestion control message, the load control information message comprising at least one of a load control function ac tivation element, the random access load control radio network temporary identifier, at least one traffic class allowed to ignore the congestion control message, and a default congestion avoidance behavior to apply when re DCving the congestion control message.
  • the user node comprises a mobile terminal.
  • An example embodiment of a computer program comprises instructions for causing an apparatus to per form at least the following: monitoring at least one bandwidth portion for activity in cellular communication in an unlicensed spectrum; identifying a channel constation based on the monitoring; and transmitting a conflow control message when the channel congestion ends .
  • An example embodiment of a computer program comprises instructions for causing an apparatus to per form at least the following: listening for a congestion control message upon the start of a random access chan nel procedure in cellular communication in an unlicensed spectrum; and applying a signaled congestion avoidance policy, when identifying the congestion control message.
  • An example embodiment of a non-transitory com puter readable medium comprises program instructions for causing an apparatus to perform at least the following: monitoring at least one bandwidth portion for activity in cellular communication in an unlicensed spectrum; identifying a channel congestion based on the monitor ing; and transmitting a congestion control message when the channel congestion ends.
  • An example embodiment of a non-transitory com puter readable medium comprises program instructions for causing an apparatus to perform at least the following: listening for a congestion control message upon the start of a random access channel procedure in cellular communication in an unlicensed spectrum; and applying a signaled congestion avoidance policy, when identifying the congestion control message.
  • FIG. 1A illustrates an example embodiment of the subject matter described herein illustrating a net work node
  • FIG. IB illustrates an example embodiment of the subject matter described herein illustrating a user node
  • FIG. 2A illustrates an example embodiment of the subject matter described herein illustrating a method
  • FIG. 2B illustrates an example embodiment of the subject matter described herein illustrating a method
  • FIG. 2C illustrates an example embodiment of the subject matter described herein illustrating a method
  • FIG. 2D illustrates an example embodiment of the subject matter described herein illustrating a method
  • FIGS. 3A - 3C show an example embodiment of the subject matter described herein illustrating effects of applying a signaled congestion avoidance policy
  • FIGS. 4A - 4C show an example embodiment of the subject matter described herein illustrating effects of applying a signaled congestion avoidance policy
  • FIG. 5 shows an example embodiment of the sub ject matter described herein illustrating effects of applying a signaled congestion avoidance policy.
  • FIG. 1A illustrates an example embodiment of the subject matter described herein illustrating a net work node 100.
  • the network node 100 comprises one or more pro cessors 102, and one or more memories 104 that comprise computer program code.
  • the network node 100 may also include a transceiver 106, as well as other elements, such as an input/output module (not shown in FIG. 1A) , and/or a communication interface (not shown in FIG. 1A) .
  • the network node 100 is depicted to include only one processor 102, the network node 100 may include more than one processor.
  • the memory 104 is capable of storing instructions, such as an operating system and/or various applications.
  • the processor 102 is capable of executing the stored instructions.
  • the processor 102 may be embodied as a multi core processor, a single core processor, or a combina tion of one or more multi-core processors and one or more single core processors.
  • the processor 102 may be embodied as one or more of various processing devices, such as a coprocessor, a microprocessor, a con troller, a digital signal processor (DSP) , a processing circuitry with or without an accompanying DSP, or var ious other processing devices including integrated cir cuits such as, for example, an application specific in tegrated circuit (ASIC) , a field programmable gate array (FPGA) , a microcontroller unit (MCU) , a hardware accel erator, a special-purpose computer chip, or the like.
  • the processor 102 may be con figured to execute hard-coded functionality.
  • the processor 102 is embodied as an executor of software instructions, wherein the instruc tions may specifically configure the processor 102 to perform the algorithms and/or operations described herein when the instructions are executed.
  • the memory 104 may be embodied as one or more volatile memory devices, one or more non-volatile memory devices, and/or a combination of one or more volatile memory devices and non-volatile memory devices.
  • the memory 104 may be embodied as semiconductor memories (such as mask ROM, PROM (programmable ROM) , EPROM (erasable PROM) , flash ROM, RAM (random access memory) , etc . ) .
  • the network node 100 may be, for example, a base station.
  • the base station may include, for example, a fifth-generation base station (gNB) providing an air interface for user nodes to connect to a wireless net work via wireless transmissions.
  • gNB fifth-generation base station
  • the at least one memory 104 and the computer program code are configured to, with the at least one processor 102, cause the network node 100 to at least perform monitoring at least one bandwidth portion for activity in cellular communication in an unlicensed spectrum; identifying a channel congestion based on the monitoring; and transmitting a congestion control mes sage when the channel congestion ends.
  • the congestion control message may be sent to user nodes that are wait ing to start a random access channel procedure or cur rently executing the random access channel procedure.
  • FIG. IB illustrates an example embodiment of the subject matter described herein illustrating a user node 110.
  • the user node 110 comprises one or more pro cessors 112, and one or more memories 114 that comprise computer program code.
  • the user node 110 may also in clude a transceiver 116, as well as other elements, such as an input/output module (not shown in FIG. IB), and/or a communication interface (not shown in FIG. IB) .
  • the user node 110 is depicted to in clude only one processor 112, the user node 110 may include more processors.
  • the memory 114 is capable of storing instructions, such as an operating system and/or various applications.
  • the processor 112 is capable of executing the stored instructions.
  • the processor 112 may be embodied as a multi core processor, a single core processor, or a combina tion of one or more multi-core processors and one or more single core processors.
  • the processor 112 may be embodied as one or more of various processing devices, such as a coprocessor, a microprocessor, a con troller, a digital signal processor (DSP) , a processing circuitry with or without an accompanying DSP, or var ious other processing devices including integrated cir cuits such as, for example, an application specific in tegrated circuit (ASIC) , a field programmable gate array (FPGA) , a microcontroller unit (MCU) , a hardware accel erator, a special-purpose computer chip, or the like.
  • the processor 112 may be con figured to execute hard-coded functionality.
  • the processor 112 is embodied as an executor of software instructions, wherein the instruc tions may specifically configure the processor 112 to perform the algorithms and/or operations described herein when the instructions are executed.
  • the memory 114 may be embodied as one or more volatile memory devices, one or more non-volatile memory devices, and/or a combination of one or more volatile memory devices and non-volatile memory devices.
  • the memory 114 may be embodied as semiconductor memories (such as mask ROM, PROM (programmable ROM) , EPROM (erasable PROM) , flash ROM, RAM (random access memory) , etc . ) .
  • the user node 110 may be any of various types of devices used directly by an end user entity and ca pable of communication in a wireless network, such as user equipment (UE) .
  • UE user equipment
  • Such devices include but are not limited to smartphones, tablet computers, smart watches, laptop computers, Internet-of-Things (IoT) devices, any hand-held or portable devices etc.
  • IoT Internet-of-Things
  • the at least one memory 114 and the computer program code are configured to, with the at least one processor 112, cause the user node 110 to perform lis tening for a congestion control message upon the start of a random access channel procedure in cellular commu nication in an unlicensed spectrum; and applying a sig naled congestion avoidance policy, when identifying the congestion control message.
  • FIG. 2A illustrates an example embodiment of the subject matter described herein illustrating a method .
  • At 200 at least one bandwidth portion is mon itored for activity in cellular communication in an un licensed spectrum.
  • a channel congestion is identified based on the monitoring.
  • a congestion control message is trans mitted, when the channel congestion ends.
  • the steps 200-204 may be performed by a network node, for example, a base station. Further, a computer program comprising instructions for causing an apparatus to perform, may perform the steps 200-204.
  • FIG. 2B illustrates an example embodiment of the subject matter described herein illustrating a method .
  • a congestion control message is lis tened for upon the start of a random access channel procedure in cellular communication in an unlicensed spectrum.
  • a signaled congestion avoidance policy is applied, when identifying the congestion control mes sage .
  • the steps 206-208 may be performed by a user node, for example, a mobile terminal. Further, a com puter program comprising instructions for causing an apparatus to perform, may perform the steps 206-208.
  • FIG. 2C illustrates an example embodiment of the subject matter described herein illustrating a method .
  • the network node 100 monitors at least one bandwidth portion for activity in cellular communi cation in an unlicensed spectrum.
  • the unlicensed spec trum may refer, for example, to New-Radio Unlicensed (NR-U) .
  • NR-U New-Radio Unlicensed
  • the activ ity may be caused by activity of nodes of another net work.
  • a user node wants to transmit data, first it has to check with, for example, an LBT check whether it can transmit the data. Whenever an LBT check fails, the user node cannot proceed with the data transmission and will have to re-attempt the channel access at a later oppor tunity. This may include also performing a new LBT check .
  • a reference 214 indicates that the channel be tween the network node 100 and the user nodes 110 is occupied, for example, due to channel occupation by user nodes from another network.
  • the network node 100 identifies 202 a channel congestion situation based on the monitoring.
  • the net work node 100 may perform LBT checks, for example, pe riodically (for example, in every slot) . When the number of consecutive slots where the LBT check fails is greater than a predetermined threshold value, the net work node 100 may identify the channel situation as a channel congestion. Alternatively or in addition, the network node 100 may determine a duration of the channel congestion. For example, the network node 100 may de termine a time period during which the LBT checks have failed.
  • the network node 100 may identify the chan nel situation as a channel congestion. Alternatively or in addition, the network node 100 may identify the chan nel situation as a channel congestion, when X % of ob served slots had an LBT check fail in an observation window of a duration of Y slots. X and Y may have a variety of positive values.
  • the network node 100 may start estimation of the number of backlogged user nodes. The estimation may be based, for example, on the observed number of arrivals in a previous predetermined period of time.
  • the network node 100 transmits a congestion control message 210, for example, a proactive congestion control message.
  • the network node 100 may transmit the congestion control message when the channel conges tion ends and when the duration exceeds a channel constation threshold.
  • the channel congestion threshold may be set to any desired value. For example, for 30 kHz sub-carrier spacing, the congestion threshold may be either 20 sub-frames or 10 ms (which corresponds to 20 sub-frames, each with duration of 0.5 ms), or a duration of 1 frame, with duration of 10 ms.
  • the congestion control message may be trans mitted to all user nodes which are currently executing (or are about to execute) a random access procedure.
  • the proactive congestion control message 210 may be transmitted by using a predetermined random access load control radio network temporary iden tifier (RALC-RNTI) .
  • RALC-RNTI random access load control radio network temporary iden tifier
  • the conges tion control message 210 may comprise at least one of the following: a duration of the channel congestion, at least one traffic class that can ignore the congestion control message, and an indication identifying a conflow avoidance behavior to apply when receiving the congestion control message.
  • the duration of the channel congestion may be expressed, for example, as a number of sub-frames, frames or time period.
  • a traffic class may be identified, for example, with a bit string.
  • the indication may refer, for example, to a label identify ing the specific behavior. By using multiple different labels, multiple different behaviors may be identified by the network node 100 towards the user nodes 110.
  • the indication may identify one or more of the following congestion avoidance behaviors: a fixed length window back-off, a variable length window back-off based on the duration of the channel conges tion, and a back-off selection based on when a user node started to attempt its transmission.
  • the back-off se lection would ensure that user nodes that have waited the most, are served first. It is to be understood that the above list is non-limiting and other behaviors ad ditionally or alternatively to the listed behaviors may be applied.
  • each user node 110 listens for the congestion control message 210 upon the start of a random access channel procedure 212A, 212B, 212C in cellular communication in the unlicensed spec trum, and applies a signaled congestion avoidance pol icy, when identifying the congestion control message 210.
  • the congestion control message 210 may provide an indication for the user node 110 that a congestion sit uation in cellular communication in the unlicensed spec trum has ended.
  • the congestion control message 210 may be received by using a prede termined random access load control radio network tem porary identifier (RALC-RNTI).
  • RALC-RNTI prede termined random access load control radio network tem porary identifier
  • the user nodes 110 may only be required to monitor the RALC-RNTI for a congestion control message before initiating the physical random access channel (PRACH) procedure.
  • the network node 100 may transmit the congestion control message 210 at the same time as the remaining minimum system information (RMSI) message.
  • the RMSI may be transmitted in a system information block (SIB) 1.
  • SIB system information block
  • the user nodes 110 that are currently performing a random access channel procedure may be required to monitor the RALC- RNTI for the congestion control message 210 before at plausible a new PRACH transmission if they have experi enced congestion earlier.
  • the congestion may be identi fied by the user nodes 110, for example, by the fact that LBT checks have failed consistently for a certain time period.
  • the congestion con trol message 210 may comprise at least one of the fol lowing: a duration of the channel congestion, at least one traffic class that can ignore the congestion control message, and an indication identifying a congestion avoidance behavior to apply when receiving the conges- tion control message.
  • the indication may iden tify one or more of the following congestion avoidance behaviors: a fixed length window back-off, a variable length window back-off based on the duration of the channel congestion, and a back-off selection based on when a user node started to attempt its transmission. The back-off selection may ensure that user nodes that have waited the most, are served first. It is to be understood that the above list is non-limiting and other behaviors additionally or alternatively to the listed behaviors may be used.
  • the illustrated so lution may also allow for the network node to provide a signal that allows the user nodes (or selected user nodes) to perform the random access channel procedure without any LBT process.
  • the network node may also allow for the network node to provide a signal that allows the user nodes (or selected user nodes) to perform the random access channel procedure without any LBT process.
  • the network node may also allow for the network node to provide a signal that allows the user nodes (or selected user nodes) to perform the random access channel procedure without any LBT process.
  • LBT process Under certain unlicensed access regulations, it may be possible to have temporary trans missions without LBT process conditioned that such hap pen on rare occasions.
  • FIG. 2D illustrates an example embodiment of the subject matter described herein illustrating a method.
  • the signaling diagram illustrated in FIG. 2D is similar than the one illustrated in FIG. 2C. Therefore, identical parts are not repeated here.
  • the network node 100 may send a load control information message 216 by a system infor mation block (SIB) .
  • SIB system infor mation block
  • the load control information message 216 may provide some be forehand information associated with a later sent conflow control message 210 to the user nodes 110.
  • the load control information message 216 may provide at least one of the following:
  • the network node 100 may be able to update the congestion control message 210 with a new congestion avoidance behavior. This may provide a faster update than just sharing this information through the earlier sent load control information message through the SIB as the SIB may be broadcast to the user nodes 110 in a longer time period.
  • FIGS. 3A - 3C show an example embodiment of the subject matter described herein illustrating effects of applying a signaled congestion avoidance policy.
  • the y axis shows the number of backlogged user nodes, and on the right side, the y axis shows the probability of collision.
  • the x axis shows PRACH slots.
  • FIG. 3A illustrates an example showing latency and the number of backlogged user nodes due to large periods of listen before talk (LBT) failures during a random access channel (RACH) procedure.
  • LBT listen before talk
  • RACH random access channel
  • FIG. 3A illustrates an example showing a situation in which no pre-backoff is applied after the LBT interruption is performed, and each UE performs an independent backoff.
  • FIG. 3B illustrates an example showing a sit uation in which pre-backoff is applied after the LBT interruption, but the backoff is a random backoff of the same length for every user node.
  • FIG. 3C illustrates an example showing a sit uation in which pre-backoff is applied after the LBT interruption, but the random backoff is proportional to the waiting time of the user node during the LBT inter ruption .
  • FIGS. 4A - 4C show an example embodiment of the subject matter described herein illustrating effects of applying a signaled congestion avoidance policy.
  • the y axis shows the latency as the number of PRACH slots, and the x axis shows an arrival time as the number of PRACH slots .
  • FIG. 4A illustrates an example showing a sit uation in which no pre-backoff is applied after the LBT interruption is performed.
  • FIG. 4B illustrates an example showing a sit uation in which pre-backoff is applied after the LBT interruption, but the backoff is a random backoff of the same length for every user node.
  • FIG. 4C illustrates an example showing a sit uation in which pre-backoff is applied after the LBT interruption, but the random backoff is proportional to the waiting time of the user node during the LBT inter ruption .
  • FIG. 5 shows an example embodiment of the sub ject matter described herein illustrating effects of applying a signaled congestion avoidance policy.
  • the y axis shows a cumulative distribution function (CDF)
  • CDF cumulative distribution function
  • the x axis shows latency as the number of PRACH slots.
  • the baseline 500 corresponds with the situation in FIGS. 3A and 4A
  • the proposal 502 corresponds with the situ ation in FIGS. 3B and 4B
  • the enhanced proposal 504 corresponds with the situation in FIGS. 3C and 4C.
  • One or more of the above illustrated examples and example embodiments may provide a channel congestion aware congestion procedure, thus reducing the access delaying following an unexpected congestion situation due to, for example, interference from another network or system. Further, one or more of the above illustrated examples and example embodiments may provide a solution in which user nodes can be served with a more determin istically latency. This may help in time critical use cases where latency matters. Furthermore, one or more of the above illustrated examples and example embodi ments may allow user nodes with the longest wait to be able to access the PRACH resources sooner, such that initial access related timeouts are avoided, preventing even longer access times.

Landscapes

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

Abstract

La présente invention concerne un nœud de réseau, un nœud d'utilisateur, des procédés et des programmes informatiques. Le nœud de réseau peut surveiller au moins une partie de bande passante pour une activité dans une communication cellulaire dans un spectre sans licence, et identifier un encombrement de canal sur la base de la surveillance. Le nœud de réseau peut également transmettre un message de régulation d'encombrement lorsque l'encombrement de canal se termine. Le nœud d'utilisateur peut écouter un message de régulation d'encombrement lors du début d'une procédure de canal d'accès aléatoire dans une communication cellulaire dans un spectre sans licence ; et appliquer une politique d'évitement d'encombrement signalée, lors de l'identification du message de régulation d'encombrement.
PCT/EP2019/058774 2019-04-08 2019-04-08 Régulation d'encombrement dans une communication cellulaire WO2020207553A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/EP2019/058774 WO2020207553A1 (fr) 2019-04-08 2019-04-08 Régulation d'encombrement dans une communication cellulaire

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/EP2019/058774 WO2020207553A1 (fr) 2019-04-08 2019-04-08 Régulation d'encombrement dans une communication cellulaire

Publications (1)

Publication Number Publication Date
WO2020207553A1 true WO2020207553A1 (fr) 2020-10-15

Family

ID=66175407

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2019/058774 WO2020207553A1 (fr) 2019-04-08 2019-04-08 Régulation d'encombrement dans une communication cellulaire

Country Status (1)

Country Link
WO (1) WO2020207553A1 (fr)

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
ERICSSON: "Discussions on RACH enhancements for NR-U", vol. RAN WG2, no. Xi'an, China; 20190408 - 20190412, 6 April 2019 (2019-04-06), XP051702031, Retrieved from the Internet <URL:http://www.3gpp.org/ftp/Meetings%5F3GPP%5FSYNC/RAN2/Docs/R2%2D1904752%2Ezip> [retrieved on 20190406] *
MEDIATEK INC: "Random access backoff and timers in NR-U", vol. RAN WG2, no. Spokane, US; 20181112 - 20181116, 12 November 2018 (2018-11-12), XP051556257, Retrieved from the Internet <URL:http://www.3gpp.org/ftp/Meetings%5F3GPP%5FSYNC/RAN2/Docs/R2%2D1816688%2Ezip> [retrieved on 20181112] *
QUALCOMM INCORPORATED: "Configuration and Selection for RACH Resources", vol. RAN WG2, no. Xi'an, China; 20190408 - 20190412, 6 April 2019 (2019-04-06), XP051701051, Retrieved from the Internet <URL:http://www.3gpp.org/ftp/Meetings%5F3GPP%5FSYNC/RAN2/Docs/R2%2D1903710%2Ezip> [retrieved on 20190406] *

Similar Documents

Publication Publication Date Title
US11895709B2 (en) Random access method and terminal
EP3294036B1 (fr) Procédé et dispositif d&#39;accès à un canal
WO2018171376A1 (fr) Procédé et dispositif d&#39;accès aléatoire et d&#39;instruction après retour arrière d&#39;accès aléatoire
US20150146665A1 (en) Method, apparatus, device and network system for adding secondary serving cell
US20170006636A1 (en) Multi-channel access method and apparatus
WO2017162004A1 (fr) Procédé et appareil d&#39;accès aléatoire en fonction d&#39;une contention
US11849486B2 (en) Channel detection method and apparatus
CN110691415A (zh) 一种随机接入方法及终端
EP3522660A2 (fr) Procédé d&#39;attribution de ressources, procédé de contention de ressources et appareil associé
US10873879B2 (en) Data transmission method, device, and system
EP3823380A1 (fr) Procédé et dispositif d&#39;attribution de ressources de liaison montante, station de base et terminal
WO2020118559A1 (fr) Procédé d&#39;accès aléatoire, dispositif terminal, et dispositif de réseau d&#39;accès
US20220124794A1 (en) Channel access method, terminal device, and network device
WO2020207553A1 (fr) Régulation d&#39;encombrement dans une communication cellulaire
CN106559192B (zh) 一种基于ofdma的数据传输方法及相关设备
US20220248458A1 (en) Contention free random access method and device
CN116806039A (zh) 基于acb因子优化算法的mtc设备拥塞优化方法及装置
AU2016432554A1 (en) Random access method and apparatus
CN112788712A (zh) 随机接入响应rar的检测方法、终端设备和网络设备
EP4014661A1 (fr) Amélioration de la procédure de rach
CN107690199B (zh) 一种分配资源和随机接入的方法及设备
CN113647171A (zh) 无线通信的方法和设备
KR101810820B1 (ko) 액세스 제어 디바이스, 액세스 디바이스 및 방법
WO2023160675A1 (fr) Procédé de transmission de signal et appareil associé
US20230102086A1 (en) Transmitting a Frame

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

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

Country of ref document: EP

Kind code of ref document: A1