WO2022083880A1 - Classes de priorité pour des procédures d'accès aléatoire en fonction de la tranche de réseau et de la catégorie d'accès - Google Patents

Classes de priorité pour des procédures d'accès aléatoire en fonction de la tranche de réseau et de la catégorie d'accès Download PDF

Info

Publication number
WO2022083880A1
WO2022083880A1 PCT/EP2020/079940 EP2020079940W WO2022083880A1 WO 2022083880 A1 WO2022083880 A1 WO 2022083880A1 EP 2020079940 W EP2020079940 W EP 2020079940W WO 2022083880 A1 WO2022083880 A1 WO 2022083880A1
Authority
WO
WIPO (PCT)
Prior art keywords
priority class
access
random
class information
priority
Prior art date
Application number
PCT/EP2020/079940
Other languages
English (en)
Inventor
Malgorzata Tomala
György Tamás Wolfner
Samuli Heikki TURTINEN
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/EP2020/079940 priority Critical patent/WO2022083880A1/fr
Publication of WO2022083880A1 publication Critical patent/WO2022083880A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/08—Non-scheduled access, e.g. ALOHA
    • H04W74/0833—Random access procedures, e.g. with 4-step access

Definitions

  • Exemplary embodiments herein relate generally to wireless communications and, more specifically, relates to random access procedures for user equipment to attempt to access wireless networks.
  • a wireless network has a certain amount of network resources available for use to support user equipment (UEs) access to and communication with the network.
  • UEs user equipment
  • One relatively recent topic of exploration in this area has been to “slice” these resources into slices, where the slices can have different resources and be assigned for different reasons.
  • the slices could be customer based, e.g., customers require guaranteed resources.
  • the slices could be services based, e.g., different services require different quality of services.
  • the slices can, however, create issues when UEs perform random access procedures, which are performed for the UEs to access and connect to the network.
  • a method in an exemplary embodiment, includes determining by a user equipment priority class information for performing a random-access procedure. The method also includes performing by the user equipment at least a part of the random-access procedure based on the priority class information.
  • An additional exemplary embodiment includes a computer program, comprising code for performing the method of the previous paragraph, when the computer program is run on a processor.
  • the computer program according to this paragraph wherein the computer program is a computer program product comprising a computer-readable medium bearing computer program code embodied therein for use with a computer.
  • Another example is the computer program according to this paragraph, wherein the program is directly loadable into an internal memory of the computer.
  • An exemplary apparatus includes one or more processors and one or more memories including computer program code.
  • the one or more memories and the computer program code are configured to, with the one or more processors, cause the apparatus to perform operations comprising: determining by a user equipment priority class information for performing a random-access procedure; and performing by the user equipment at least a part of the random-access procedure based on the priority class information.
  • An exemplary computer program product includes a computer-readable storage medium bearing computer program code embodied therein for use with a computer.
  • the computer program code includes: code for determining by a user equipment priority class information for performing a random-access procedure; and code for performing by the user equipment at least a part of the random-access procedure based on the priority class information.
  • an apparatus comprises means for performing: determining by a user equipment priority class information for performing a random-access procedure; and performing by the user equipment at least a part of the randomaccess procedure based on the priority class information.
  • a method in an exemplary embodiment, includes generating, by a network node in a wireless network, priority class information for a user equipment to use for a random-access procedure. The method further includes sending, by the network node, the priority class information toward the user equipment.
  • An additional exemplary embodiment includes a computer program, comprising code for performing the method of the previous paragraph, when the computer program is run on a processor.
  • the computer program according to this paragraph wherein the computer program is a computer program product comprising a computer-readable medium bearing computer program code embodied therein for use with a computer.
  • Another example is the computer program according to this paragraph, wherein the program is directly loadable into an internal memory of the computer.
  • An exemplary apparatus includes one or more processors and one or more memories including computer program code.
  • the one or more memories and the computer program code are configured to, with the one or more processors, cause the apparatus to perform operations comprising: generating, by a network node in a wireless network, priority class information for a user equipment to use for a random-access procedure; and sending, by the network node, the priority class information toward the user equipment.
  • An exemplary computer program product includes a computer-readable storage medium bearing computer program code embodied therein for use with a computer.
  • the computer program code includes: code for generating, by a network node in a wireless network, priority class information for a user equipment to use for a random-access procedure; and code for sending, by the network node, the priority class information toward the user equipment.
  • an apparatus comprises means for performing: generating, by a network node in a wireless network, priority class information for a user equipment to use for a random-access procedure; and sending, by the network node, the priority class information toward the user equipment.
  • FIG. 1 is a block diagram of one possible and non-limiting exemplary system in which the exemplary embodiments may be practiced;
  • FIGS. 2A-2D illustrate various RA procedures, where FIG. 2A illustrates a CBRA with 4-step RA type, FIG. 2B illustrates CBRA with 2-step RA type, FIG. 2C illustrates CFRA with 4-step RA type, and FIG. 2D illustrates CFRA with 2-step RA type;
  • FIG. 3 is a signaling diagram illustrating a procedure for slice-specific RA priority classes initiation and use for an MO access attempt, in accordance with an exemplary embodiment
  • FIG. 4A illustrates an exemplary IE carrying a field used for implementing an exemplary embodiment
  • FIG. 4B is a table defining the field from FIG. 4A;
  • FIG. 5 is a logic flow diagram performed by a user equipment for using priority classes for random access procedures, and illustrates the operation of an exemplary method or methods, 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; and
  • FIG. 6 is a logic flow diagram performed by a network node for using priority classes for random access procedures, and illustrates the operation of an exemplary method or methods, 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.
  • the exemplary embodiments herein describe techniques for priority classes for random access procedures. Additional description of these techniques is presented after a system into which the exemplary embodiments may be used is described.
  • FIG. 1 shows a block diagram of one possible and nonlimiting exemplary system in which the exemplary embodiments may be practiced.
  • a user equipment (UE) 110 radio access network (RAN) node 170, and network element(s) 190 are illustrated.
  • 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 UE 110 includes a control module 140, comprising one of or both parts 140-1 and/or 140-2, which may be implemented in a number of ways.
  • the control module 140 may be implemented in hardware as control module 140-1, such as being implemented as part of the one or more processors 120.
  • the control module 140-1 may be implemented also as an integrated circuit or through other hardware such as a programmable gate array.
  • control module 140 may be implemented as control 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, cause the user equipment 110 to perform one or more of the operations as described herein.
  • the UE 110 communicates with RAN node 170 via a wireless link 111.
  • the RAN node 170 is a base station that provides access by wireless devices such as the UE 110 to the wireless network 100.
  • the RAN node 170 may be, for instance, a base station for 5G, also called New Radio (NR).
  • the RAN node 170 may be a NG-RAN node, which is defined as either a gNB or an ng-eNB.
  • the RAN node 170 is assumed to be gNB 170, though this is merely exemplary.
  • a gNB is a node providing NR user plane and control plane protocol terminations towards the UE, and connected via the NG interface to a 5GC (e.g., the network element(s) 190).
  • priority classes may be determined by the network 100, such as the gNB 170 (and/or other network element(s) 190). It is the network 100 that decides to allocate priorities for slices/access categories. That is, since the network provides (e.g., NR) user plane and control plane protocol terminations towards the UE, the network can decide to assign a (higher) priority for random access, e.g., only for the terminations associated with slicing/access categories. Any configuration that is designed for slices or access categories (e.g., assigned as values 32-63 in certain examples below) may be assigned higher priority compared to other access attempts. Additional details are provided below.
  • the ng- eNB is a node providing E-UTRA user plane and control plane protocol terminations towards the UE, and connected via the NG interface to the 5GC.
  • the NG-RAN node may include multiple gNBs, which may also include a central unit (CU) (gNB-CU) 196 and distributed unit(s) (DUs) (gNB-DUs), of which DU 195 is shown.
  • CU central unit
  • DUs distributed unit
  • the DU may include or be coupled to and control a radio unit (RU).
  • the gNB-CU is a logical node hosting RRC, SDAP and PDCP protocols of the gNB or RRC and PDCP protocols of the en-gNB that controls the operation of one or more gNB-DUs.
  • the gNB-CU terminates the Fl interface connected with the gNB-DU.
  • the Fl interface is illustrated as reference 198, although reference 198 also illustrates a link between remote elements of the RAN node 170 and centralized elements of the RAN node 170, such as between the gNB-CU 196 and the gNB-DU 195.
  • the gNB-DU is a logical node hosting RLC, MAC and PHY layers of the gNB or en-gNB, and its operation is partly controlled by gNB-CU.
  • One gNB-CU supports one or multiple cells.
  • One cell is supported by one gNB-DU.
  • the gNB-DU terminates the Fl interface 198 connected with the gNB-CU.
  • the DU 195 is considered to include the transceiver 160, e.g., as part of an RU, but some examples of this may have the transceiver 160 as part of a separate RU, e.g., under control of and connected to the DU 195.
  • the RAN node 170 may also be an eNB (evolved NodeB) base station, for LTE (long term evolution), or any other suitable base station.
  • eNB evolved NodeB
  • the RAN node 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 CU 196 may include the processor(s) 152, memories 155, and network interfaces 161. Note that the DU 195 may also contain its own memory/memories and processor(s), and/or other hardware, but these are not shown.
  • the RAN node 170 includes a control module 150, comprising one of or both parts 150-1 and/or 150-2, which may be implemented in a number of ways.
  • the control module 150 may be implemented in hardware as control module 150-1, such as being implemented as part of the one or more processors 152.
  • the control module 150-1 may be implemented also as an integrated circuit or through other hardware such as a programmable gate array.
  • the control module 150 may be implemented as control 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, cause the RAN node 170 to perform one or more of the operations as described herein.
  • the functionality of the control module 150 may be distributed, such as being distributed between the DU 195 and the CU 196, or be implemented solely in the DU 195.
  • the one or more network interfaces 161 communicate over a network such as via the links 176 and 131.
  • Two or more RAN nodes 170 communicate using, e.g., link 176.
  • the link 176 may be wired or wireless or both and may implement, e.g., an Xn interface for 5G, an X2 interface for LTE, or other suitable interface for other standards.
  • 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 for LTE or a distributed unit (DU) 195 for gNB implementation for 5G, with the other elements of the RAN node 170 possibly being physically in a different location from the RRH/DU, and the one or more buses 157 could be implemented in part as, e.g., fiber optic cable or other suitable network connection to connect the other elements (e.g., a central unit (CU), gNB-CU) of the RAN node 170 to the RRH/DU 195.
  • Reference 198 also indicates those suitable network link(s).
  • each cell performs functions, but it should be clear that the base station that forms the cell will perform the functions.
  • the cell makes up part of a base station. That is, there can be multiple cells per base station. For instance, there could be three cells for a single carrier frequency and associated bandwidth, each cell covering one-third of a 360 degree area so that the single base station’s coverage area covers an approximate oval or circle.
  • 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 element or elements 190 that may include core network functionality, and which provides connectivity via a link or links 181 with a data network 191, such as a telephone network and/or a data communications network (e.g., the Internet).
  • a data network 191 such as a telephone network and/or a data communications network (e.g., the Internet).
  • core network functionality for 5G may include access and mobility management function(s) (AMF(s)) and/or user plane functions (UPF(s)) and/or session management function(s) (SMF(s)).
  • AMF(s) access and mobility management function(s)
  • UPF(s) user plane functions
  • SMF(s) session management function
  • Such core network functionality for LTE may include MME (Mobility Management Entity)/SGW (Serving Gateway) functionality. These are merely exemplary functions that may be supported by the network element(s) 190, and note that both 5G and LTE functions might be supported.
  • the RAN node 170 is coupled via a link 131 to a network element 190.
  • the link 131 may be implemented as, e.g., an NG interface for 5G, or an SI interface for LTE, or other suitable interface for other standards.
  • the network element 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 network element 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 are still 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, RAN node 170, and other functions as described herein.
  • the various embodiments of the user equipment 110 can include, but are not limited to, cellular telephones such as smart phones, tablets, personal digital assistants (PDAs) having wireless communication capabilities, portable computers having wireless communication capabilities, vehicles with a modem device for wireless V2X (vehicle-to- everything) communication, 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 (including Internet of Things, loT, devices) permitting wireless Internet access and possibly browsing, loT devices with sensors and/or actuators for automation applications with wireless communication tablets with wireless communication capabilities, as well as portable units or terminals that incorporate combinations of such functions.
  • cellular telephones such as smart phones, tablets, personal digital assistants (PDAs) having wireless communication capabilities, portable computers having wireless communication capabilities, vehicles with a modem device for wireless V2X (vehicle-to- everything) communication
  • 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
  • NR supports Network Slicing.
  • General requirements, as per TS 38.300 see, e.g., 3GPP TS 38.300 V16.3.0 (2020-09)), state the following: _
  • access-barring control To enable fast access to a cell, two access control mechanisms are considered: (1) access-barring control; or (2) random-access control.
  • TS 24.501 (see, e.g., 3GPP TS 24.501 VI 7.0.0 (2020-09)) specifies how each UE’s access attempt is categorized in a Non- Access Stratum (NAS) layer. There are 32 access category values that are reserved for operator use and can be associated with a slice identifier (e.g., S-NSSAI), see TS 24.501, subclause 4.5.3.
  • NAS Non- Access Stratum
  • the UE can determine whether an access attempt for a given slice is authorized based on the broadcasted barring information, since a slice, for which access attempt is issued, corresponds to an access category. Once the barring check succeeds, the UE initiates a random-access procedure.
  • FIGS. 2A-2D illustrate various RA procedures (reference: Figure 9.2.6-1 in 3GPP TS 38.300), where FIG. 2A illustrates a CBRA with 4-step RA type, FIG. 2B illustrates CBRA with 2-step RA type, FIG. 2C illustrates CFRA with 4-step RA type, and FIG. 2D illustrates CFRA with 2-step RA type.
  • the UE selects the type of random access at initiation of the random-access procedure based on network configuration, which can be realized either by common or dedicated signaling.
  • the MSG1 of the 4-step RA type includes a preamble on PRACH, see step 1. After MSG1 transmission, the UE monitors for a response from the network within a configured window. The gNB 170 responds in step 2 with an RA response, and the UE 110 in step 3 sends a scheduled transmission. In step 4, the gNB 170 responds with a contention resolution.
  • a dedicated preamble for MSG1 transmission is assigned by the network (see step 0 of FIG. 2C) and upon receiving random access response from the network, the UE ends the random-access procedure as shown in FIG. 2C.
  • the UE upon reception of the random-access response, the UE sends (step 3 in FIG. 2A) MSG3 using the UL grant scheduled in the response and monitors contention resolution as shown in FIG. 2A. If contention resolution (step 4 in FIG. 2A) is not successful after MSG3 (re)transmission(s), the UE goes back to MSG1 transmission.
  • the MS GA of the 2-step RA type includes a preamble on PRACH and a payload on PUSCH.
  • the UE 110 monitors for a response from the network within a configured window.
  • CFRA a dedicated preamble and PUSCH resource are configured for MSGA transmission and, upon receiving the network response (see step B of FIG. 2D), the UE ends the random-access procedure as shown in FIG. 4D.
  • CBRA if contention resolution (see step B of FIG. 2B) is successful upon receiving the network response, the UE 110 ends the random-access procedure as shown in FIG. 2B.
  • a UE supporting and requesting a certain slice does not distinguish different RACH configurations for different slices, since the random-access procedure and gNB resources management is slice information agnostic.
  • Network slicing mechanisms defined since Rel-15 assume resource isolation support: it should be possible to fully dedicate gNB resources to a certain slice, however how gNB supports resource isolation are implementation-dependent.
  • RA priority classes can be assigned to access categories, for instance, to enable special priorities for certain access categories.
  • the RA priority classes may also be assigned to slices to enable slice-specific access during an RA procedure.
  • the RA priority classes may also be assigned to slices to enable slice-specific access before RA procedure and applied during RA procedure.
  • Access category assignment to slices is also proposed in some exemplary embodiments to perform slice-specific access control, and assigning RA priority classes to access categories may also be used to assign RA priority classes to slices.
  • an RA access priority class may be introduced by via one or more of the following examples:
  • RA resources e.g., a set of preambles and/or set of ROs and/or set of RACH configurations
  • RA prioritization parameters e.g., backoff scaling factor, power ramping step, message power offset for group B preambles, maximum transmission attempts, and the like.
  • the gNB 170 broadcasts the parameters for the RA priority classes. It is possible that gNB starts broadcasting RA priority class-specific parameters upon load detection on a (e.g., set of) operator-defined access category(ies).
  • the NW can provide, for the UE for a set of cells (e.g., within UE’s RAN area), the parameters for the RA priority classes over dedicated signaling.
  • the RA priority can be applied to certain types of RA procedures. These procedures include handover or beam failure recovery procedures. The priority for RA triggered by these procedures could be higher than priority for RA triggered by other procedures.
  • the gNB 170 can provide the parameters over Random Access Response (RAR), e.g., in response to a sudden increase in RACH load.
  • RAR Random Access Response
  • Such a configuration could be limited, e.g., to indication to ignore a backoff indication (BI) contained in the RAR for certain RA priority class(es).
  • BI backoff indication
  • Concerning backoff in general, if the UE attempts to access the RACH and experiences a collision, the backoff is a time period the UE uses to back off from performing another access. If, by contrast, the backoff set to zero or ignored, this would mean the UE does not have to wait. Instead, after failing the first attempt of the initial access, the UE tries again immediately to access the RACH.
  • RA priority class there can be a configuration in the UEs as to which RA priority class is to be used for which access category(ies) (or slices).
  • the configuration could be pre-provisioned to the UEs, e.g., through dedicated signaling, broadcast signaling, pre-configured, or via other options.
  • Pre-configured means, e.g., set in standard or, e.g., pre-provisioned into the SIM by an MNO or the like.
  • the configuration could be signaled, e.g., in the system information broadcast by the gNB, for a specific access category(ies) or slice(s).
  • the RA is triggered for certain access category (or slice)
  • the UE uses the RA priority class according to this configuration.
  • a UE may use the RA resources in the following ways after selecting the RA priority class for an RA procedure (this could be also configurable by the NW):
  • the UE may only use the RA resources assigned for that RA priority class; or
  • the UE may use the RA resources assigned for that RA priority class or RA resources assigned to any lower priority RA class(es).
  • One exemplary advantage of approach (a) is that this approach enables use of totally separate RA resources for RA priority classes.
  • One exemplary advantage of approach (b) is that this approach enables more efficient of use of RA resources as well as lowers the chances of collision for the UE using higher priority RA class.
  • FIG. 3 is a signaling diagram illustrating a procedure for slice-specific RA priority classes initiation and use for an MO access attempt.
  • FIG. 3 also illustrates the operation of an exemplary method or methods, 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. For the operations in FIG. 3,
  • the UE 110 is assumed to be under control of the control module 140
  • the gNB 170 is assumed to be under control of the control module 150
  • the corresponding control modules 140/150 contain the circuitry (and possibly computer-readable code executed on the circuitry) and at least some of the means for performing the functions described herein.
  • the gNB 170 broadcasts common RACH configuration parameters. See signaling 310, where the gNB sends SIB1 in RRC signaling, with common RA parameters but without RA priority classes.
  • the gNB detects overload on a (e.g., set of) operator-defined access category(ies) that correspond to slices (e.g., access categories having values in the 32-63 range have been associated with a S-NSSAI). This occurs in block 320, via a resource management function on the gNB 170.
  • the condition is overload detection for access categories 32-26 in this example.
  • Each access category can get own configuration, depending on gNB configuration and potential decision to prioritize this access category.
  • Block 320 also includes a configuration validation, where the gNB 170 performs generating configuration with random access priority classes. This is part of reference 330, where the gNB 170 configures (config) activation for slice-specific RA priority classes.
  • the gNB 170 Based at least on the condition occurring, the gNB 170 triggers slice-based configuration with RA priority classes.
  • the gNB broadcasts (see signaling 340) SIB1 with serving cell common configuration, the contents of which facilitate resource management for slices as the examples below indicate.
  • the gNB prioritizes one or more access categories from set of operator-defined access categories.
  • the configuration is signaled by, e.g., extending cell-specific common RACH configuration parameters for access categories that had been associated with a S-NSSAIs (e.g., from access categories range: 32-64), or RACH configuration parameters explicitly for slices (e.g., S-NSSAIs), see FIG. 3.
  • the cell specific configuration may be signaled as access categories-specific RACH configuration or slice-specific RACH configuration (e.g., distinguished from a common set of parameters).
  • the parameters within the configuration may reuse existing randomaccess methodology. That is, configuration contents enable scaling the power ramping and periodicity and/or offsetting the time domain position of the RACH occasions.
  • the UE acquires and stores slice-based configuration with RA priority classes. This is illustrated in FIG 3 in block 350, where the UE acquires and maintains the information.
  • the UE detects an access attempt (e.g., a MO call) and a corresponding random-access procedure is initiated (see reference 380) for an operator-defined access category (e.g., access category from 32-63) or slice identifier (e.g., S-NSSAI).
  • an access attempt e.g., a MO call
  • a corresponding random-access procedure is initiated (see reference 380) for an operator-defined access category (e.g., access category from 32-63) or slice identifier (e.g., S-NSSAI).
  • an operator-defined access category e.g., access category from 32-63
  • slice identifier e.g., S-NSSAI
  • the UE applies slice-based configuration with RA priority classes random access operation as per the following:
  • the UE may decide to apply 2-step RA type upon detection the randomaccess procedure is initiated for an operator-defined access category (e.g., access category from 32-63); or
  • the UE proceeds with RA procedure, applying RA parameters from slicespecific RA priority class configuration.
  • option (a) above was selected by the UE 110.
  • UE sends MSG1 or MSG3, see FIG. 2A or 2C and signaling 370, toward the gNB.
  • FIG. 4A this figure illustrates an exemplary IE (BWP-
  • the BWP-UplinkCommon IE has a field rach-Config for an Access Category from range 32-63, conditioned by ‘LoadedACOnly’, which defines network circumstance(s) to send the field and is described in FIG. 4B.
  • FIG. 4B is a table defining the field from FIG. 4 A.
  • the presence of the LoadedACOnly field is conditional (Cond in FIG. 4A) and is optionally present.
  • the field is optionally present in a cell that detected an overload on one or more Access Categories 32-64. It is absent otherwise.
  • FIG. 5 is a logic flow diagram performed by a user equipment for using priority classes for random access procedures. This figure illustrates the operation of an exemplary method or methods, 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.
  • the blocks in FIG. 5 and the examples below for this figure are assumed to be performed by a UE 110, e.g., under control of the control module 140.
  • the UE 110 determines priority class information for performing a random-access procedure.
  • the UE 110 performs, in block 520, at least a part of the randomaccess procedure based on the priority class information.
  • Example 2 The method of example 1 , wherein the priority class information corresponds to a priority class, and the priority class corresponds to one or more access categories.
  • Example 3 The method of example 2, wherein:
  • the priority class information corresponds to a plurality of priority classes, and the priority classes correspond to one or more access categories;
  • determining by a user equipment priority class information comprises selecting one of the plurality of priority classes based on an available access category
  • performing by the user equipment the at least part of the randomaccess procedure comprises performing the at least part of the random-access procedure based on the selected priority class.
  • Example 4 The method of example 1, wherein the priority class information corresponds to a priority class, and the priority class corresponds to one or more slice identifiers.
  • Example 5 The method of example 4, wherein:
  • the priority class information corresponds to a plurality of slices and corresponding slice identifiers, and the slices correspond to one or more access categories;
  • determining by a user equipment priority class information comprises selecting one of the plurality of slices based on an available access category
  • performing by the user equipment the at least part of the randomaccess procedure comprises performing the at least part of the random-access procedure based on the selected slice and its corresponding slice identifier.
  • Example 6 The method of example 1 , wherein:
  • the priority class information corresponds to a plurality of priority classes, and the priority classes correspond to one or more slices;
  • determining by a user equipment priority class information comprises selecting one of the plurality of priority classes based on an available slice and
  • performing by the user equipment the at least part of the randomaccess procedure comprises performing the at least part of the random-access procedure based on the selected priority class.
  • Example 7 The method of any one of examples 1 to 6, wherein:
  • the priority classes are configured with separate random-access resources for specific priority classes.
  • the performing the at least part of a random-access procedure uses the random-access resources corresponding to the selected priority class used for the random-access procedure.
  • Example 8 The method of example 7, wherein the separate random-access resources comprise a set of random-access preambles and/or a set of random-access channel occasions and/or a set of random-access channel configurations.
  • Example 9 The method of any one of examples 1 to 6, wherein:
  • the priority classes are configured with separate random-access prioritization parameters for specific priority classes; and [00106] the performing the at least part of a random-access procedure uses the random-access prioritization parameters corresponding to a selected priority class used for the random-access procedure.
  • Example 10 The method of example 9, wherein the separate random-access prioritization parameters comprise one or more of the following: a backoff scaling factor; a power ramping step; a message power offset for group B preambles; or a maximum number of transmission attempts.
  • Example 11 The method of any one of examples 1 to 10, wherein the determining the priority class information comprises one or more of the following:
  • Example 12 The method of any one of examples 1 to 11, wherein the one or more access categories have been defined by an operator.
  • Example 13 The method of any one of examples 1 to 12, wherein:
  • performing by the user equipment at least a part of the random-access procedure is performed by the user equipment based on determining by the user equipment initiation of a random-access procedure is triggered for an access category.
  • this figure is a logic flow diagram performed by a network node for using priority classes for random access procedures.
  • This figure illustrates the operation of an exemplary method or methods, 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.
  • the blocks in FIG. 6 and the examples below for this figure are assumed to be performed by a network node such as gNB 170, e.g., under control of the control module 150.
  • the network node in block 610 generates priority class information for a user equipment to use for a random-access procedure.
  • the network node sends the priority class information toward the user equipment. This occurs in block 620.
  • the following include additional examples for FIG. 6. In these examples, the method of FIG. 6 is referred to as example 14.
  • Example 15 The method of example 14, wherein the priority class information corresponds to a priority class, and the priority class corresponds to one or more access categories.
  • Example 16 The method of example 15, wherein:
  • the priority class information corresponds to a plurality of priority classes, and the priority classes correspond to one or more access categories;
  • the sending the priority class information toward the user equipment further comprises sending by the network node the priority class information for at least one of the plurality of priority classes toward the user equipment.
  • Example 17 The method of example 14, wherein the priority class information corresponds to a priority class, and the priority class corresponds to one or more slice identifiers.
  • Example 18 The method of example 17, wherein:
  • the priority class information corresponds to a plurality of slices and corresponding slice identifiers, and the slices correspond to one or more access categories;
  • the sending the priority class information toward the user equipment further comprises sending by the network node the priority class information for at least one of the plurality of slices and corresponding at least one slice identifier toward the user equipment.
  • Example 19 The method of example 14, wherein:
  • the priority class information corresponds to a plurality of priority classes, and the priority classes correspond to one or more slices;
  • the sending the priority class information toward the user equipment further comprises sending by the network node the priority class information for at least one of the plurality of priority classes toward the user equipment.
  • Example 20 The method of any one of examples 14 to 19, wherein:
  • the priority classes have defined separate random-access resources for specific priority classes; and [00131] the sending the priority class information toward the user equipment further comprises sending the separate random-access resources for any of the specific priority classes corresponding to the priority class information.
  • Example 21 The method of example 20, wherein the separate random-access resources comprise a set of random-access preambles and/or a set of random-access channel occasions and/or a set of random-access channel configurations.
  • Example 22 The method of any one of examples 14 to 21, wherein:
  • the priority classes have defined separate random-access prioritization parameters for specific priority classes.
  • the sending the priority class information toward the user equipment further comprises sending the separate random-access prioritization parameters for any of the specific priority classes corresponding to the priority class information.
  • Example 23 The method of example 22, wherein the separate random-access prioritization parameters comprise one or more of the following: a backoff scaling factor; a power ramping step; a message power offset for group B preambles; or a maximum number of transmission attempts.
  • Example 24 The method of any one of examples 14 to 23, wherein the sending the priority class information toward the user equipment is performed via one or more of the following: dedicated signaling; or broadcast signaling.
  • Example 25 The method of any one of examples 14 to 24, wherein the one or more access categories have been defined by an operator.
  • Example 26 A computer program, comprising code for performing the methods of any of examples 1 to 25, when the computer program is run on a computer.
  • Example 27 The computer program according to example 26, wherein the computer program is a computer program product comprising a computer-readable medium bearing computer program code embodied therein for use with the computer.
  • Example 28 The computer program according to example 26, wherein the computer program is directly loadable into an internal memory of the computer.
  • Example 29 An apparatus, comprising means for performing: [00144] determining by a user equipment priority class information for performing a random-access procedure; and
  • Example 30 The apparatus of example 29, wherein the priority class information corresponds to a priority class, and the priority class corresponds to one or more access categories.
  • Example 31 The apparatus of example 30, wherein:
  • the priority class information corresponds to a plurality of priority classes, and the priority classes correspond to one or more access categories;
  • determining by a user equipment priority class information comprises selecting one of the plurality of priority classes based on an available access category
  • performing by the user equipment the at least part of the randomaccess procedure comprises performing the at least part of the random-access procedure based on the selected priority class.
  • Example 32 The apparatus of example 29, wherein the priority class information corresponds to a priority class, and the priority class corresponds to one or more slice identifiers.
  • Example 33 The apparatus of example 32, wherein:
  • the priority class information corresponds to a plurality of slices and corresponding slice identifiers, and the slices correspond to one or more access categories;
  • determining by a user equipment priority class information comprises selecting one of the plurality of slices based on an available access category
  • performing by the user equipment the at least part of the randomaccess procedure comprises performing the at least part of the random-access procedure based on the selected slice and its corresponding slice identifier.
  • Example 34 The apparatus of example 29, wherein:
  • the priority class information corresponds to a plurality of priority classes, and the priority classes correspond to one or more slices; [00158] determining by a user equipment priority class information comprises selecting one of the plurality of priority classes based on an available slice and
  • performing by the user equipment the at least part of the randomaccess procedure comprises performing the at least part of the random-access procedure based on the selected priority class.
  • Example 35 The apparatus of any one of examples 29 to 34, wherein:
  • the priority classes are configured with separate random-access resources for specific priority classes.
  • the performing the at least part of a random-access procedure uses the random-access resources corresponding to the selected priority class used for the random-access procedure.
  • Example 36 The apparatus of example 35, wherein the separate randomaccess resources comprise a set of random-access preambles and/or a set of random-access channel occasions and/or a set of random-access channel configurations.
  • Example 37 The apparatus of any one of examples 29 to 34, wherein:
  • the priority classes are configured with separate random-access prioritization parameters for specific priority classes.
  • the performing the at least part of a random-access procedure uses the random-access prioritization parameters corresponding to a selected priority class used for the random-access procedure.
  • Example 38 The apparatus of example 37, wherein the separate randomaccess prioritization parameters comprise one or more of the following: a backoff scaling factor; a power ramping step; a message power offset for group B preambles; or a maximum number of transmission attempts.
  • Example 39 The apparatus of any one of examples 29 to 38, wherein the determining the priority class information comprises one or more of the following:
  • Example 40 The apparatus of any one of examples 29 to 39, wherein the one or more access categories have been defined by an operator.
  • Example 41 The apparatus of example 29, wherein:
  • performing by the user equipment at least a part of the random-access procedure is performed by the user equipment based on determining by the user equipment initiation of a random-access procedure is triggered for an access category.
  • Example 42 An apparatus, comprising means for performing:
  • Example 43 The apparatus of example 42, wherein the priority class information corresponds to a priority class, and the priority class corresponds to one or more access categories.
  • Example 44 The apparatus of example 43, wherein:
  • the priority class information corresponds to a plurality of priority classes, and the priority classes correspond to one or more access categories;
  • the sending the priority class information toward the user equipment further comprises sending by the network node the priority class information for at least one of the plurality of priority classes toward the user equipment.
  • Example 45 The apparatus of example 42, wherein the priority class information corresponds to a priority class, and the priority class corresponds to one or more slice identifiers.
  • Example 46 The apparatus of example 45, wherein:
  • the priority class information corresponds to a plurality of slices and corresponding slice identifiers, and the slices correspond to one or more access categories;
  • the sending the priority class information toward the user equipment further comprises sending by the network node the priority class information for at least one of the plurality of slices and corresponding at least one slice identifier toward the user equipment.
  • Example 47 The apparatus of example 42, wherein: [00187] the priority class information corresponds to a plurality of priority classes, and the priority classes correspond to one or more slices;
  • the sending the priority class information toward the user equipment further comprises sending by the network node the priority class information for at least one of the plurality of priority classes toward the user equipment.
  • Example 48 The apparatus of any one of examples 42 to 47, wherein:
  • the priority classes have defined separate random-access resources for specific priority classes.
  • the sending the priority class information toward the user equipment further comprises sending the separate random-access resources for any of the specific priority classes corresponding to the priority class information.
  • Example 49 The apparatus of example 48, wherein the separate randomaccess resources comprise a set of random-access preambles and/or a set of random-access channel occasions and/or a set of random-access channel configurations.
  • Example 50 The apparatus of any one of examples 42 to 48, wherein:
  • the priority classes have defined separate random-access prioritization parameters for specific priority classes.
  • the sending the priority class information toward the user equipment further comprises sending the separate random-access prioritization parameters for any of the specific priority classes corresponding to the priority class information.
  • Example 51 The apparatus of example 50, wherein the separate randomaccess prioritization parameters comprise one or more of the following: a backoff scaling factor; a power ramping step; a message power offset for group B preambles; or a maximum number of transmission attempts.
  • Example 52 The apparatus of any one of examples 42 to 51, wherein the sending the priority class information toward the user equipment is performed via one or more of the following: dedicated signaling; or broadcast signaling.
  • Example 53 The apparatus of any one of examples 42 to 52, wherein the one or more access categories have been defined by an operator.
  • Example 54 The apparatus of any of examples 29 to 53 wherein the means comprises:
  • At least one memory including computer program code, the at least one memory and computer program code configured to, with the at least one processor, cause the performance of the apparatus.
  • Example 55 An apparatus, comprising:
  • one or more memories including computer program code
  • Another exemplary embodiment is the apparatus of example 55, wherein the one or more memories and the computer program code are further configured, with the one or more processors, to cause the apparatus to perform operations in the methods of any of examples 2 to 13.
  • Example 56 An apparatus, comprising:
  • one or more memories including computer program code
  • Another exemplary embodiment is the apparatus of example 55, wherein the one or more memories and the computer program code are further configured, with the one or more processors, to cause the apparatus to perform operations in the methods of any of examples 15 to 25.
  • circuitry may refer to one or more or all of the following:
  • circuitry also covers an implementation of merely a hardware circuit or processor (or multiple processors) or portion of a hardware circuit or processor and its (or their) accompanying software and/or firmware.
  • circuitry also covers, for example and if applicable to the particular claim element, a baseband integrated circuit or processor integrated circuit for a mobile device or a similar integrated circuit in server, a cellular network device, or other computing or network device.
  • 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) is maintained on any one of various conventional computer-readable media.
  • 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., memories 125, 155, 171 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 propagating signals.
  • AMF access and mobility management function [00231] CBRA contention-based random access
  • eNB or eNodeB evolved Node B (e.g., an LTE base station)
  • En-gNB or En-gNB node providing NR user plane and control plane protocol terminations towards the UE, and acting as secondary node in EN-DC
  • E-UTRA evolved universal terrestrial radio access i.e., the LTE radio access technology
  • gNB or gNodeB base station for 5G/NR, i.e., a node providing NR user plane and control plane protocol terminations towards the UE, and connected via the NG interface to the 5GC
  • ng-eNB or NG-eNB next generation eNB [00249]
  • UE user equipment e.g., a wireless, typically mobile device

Landscapes

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

Abstract

UE déterminant des informations de classe de priorité pour effectuer une procédure d'accès aléatoire. L'UE effectue au moins une partie de la procédure d'accès aléatoire sur la base des informations de classe de priorité. Un nœud de réseau dans un réseau sans fil génère des informations de classe de priorité qu'un équipement utilisateur doit utiliser pour une procédure d'accès aléatoire. Le nœud de réseau envoie les informations de classe de priorité vers l'équipement utilisateur.
PCT/EP2020/079940 2020-10-23 2020-10-23 Classes de priorité pour des procédures d'accès aléatoire en fonction de la tranche de réseau et de la catégorie d'accès WO2022083880A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/EP2020/079940 WO2022083880A1 (fr) 2020-10-23 2020-10-23 Classes de priorité pour des procédures d'accès aléatoire en fonction de la tranche de réseau et de la catégorie d'accès

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/EP2020/079940 WO2022083880A1 (fr) 2020-10-23 2020-10-23 Classes de priorité pour des procédures d'accès aléatoire en fonction de la tranche de réseau et de la catégorie d'accès

Publications (1)

Publication Number Publication Date
WO2022083880A1 true WO2022083880A1 (fr) 2022-04-28

Family

ID=73040040

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2020/079940 WO2022083880A1 (fr) 2020-10-23 2020-10-23 Classes de priorité pour des procédures d'accès aléatoire en fonction de la tranche de réseau et de la catégorie d'accès

Country Status (1)

Country Link
WO (1) WO2022083880A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20230180287A1 (en) * 2020-06-03 2023-06-08 Industry-Academic Cooperation Foundation, Dankook University Apparatus and method for performing random access

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180368179A1 (en) * 2017-06-16 2018-12-20 Qualcomm Incorporated Differentiated random access in new radio
US20200128456A1 (en) * 2017-03-22 2020-04-23 Lg Electronics Inc. Method and device for adjusting random access backoff parameter

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20200128456A1 (en) * 2017-03-22 2020-04-23 Lg Electronics Inc. Method and device for adjusting random access backoff parameter
US20180368179A1 (en) * 2017-06-16 2018-12-20 Qualcomm Incorporated Differentiated random access in new radio

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
"Study on enhancement of RAN Slicing", RP-193254, 3GPP TSG-RAN MEETING #86, SITGES, BARCELONA, 9 December 2019 (2019-12-09)
3GPP TS 38.300
3GPP TS 38.300, September 2020 (2020-09-01)
NOKIA ET AL: "RACH prioritisation for slices", vol. RAN WG2, no. Electronic; 20201102 - 20201113, 22 October 2020 (2020-10-22), XP051942378, Retrieved from the Internet <URL:https://ftp.3gpp.org/tsg_ran/WG2_RL2/TSGR2_112-e/Docs/R2-2009422.zip R2-2009422 RACH prioritisation for slices.docx> [retrieved on 20201022] *
ZTE CORPORATION ET AL: "Consideration on the slice specific RACH configuration", vol. RAN WG2, no. Electronic; 20201102 - 20201113, 22 October 2020 (2020-10-22), XP051941434, Retrieved from the Internet <URL:https://ftp.3gpp.org/tsg_ran/WG2_RL2/TSGR2_112-e/Docs/R2-2009806.zip R2-2009806_Consideration on the slice specific RACH configuration.docx> [retrieved on 20201022] *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20230180287A1 (en) * 2020-06-03 2023-06-08 Industry-Academic Cooperation Foundation, Dankook University Apparatus and method for performing random access
US11985696B2 (en) * 2020-06-03 2024-05-14 Uucom Co., Ltd Apparatus and method for performing random access

Similar Documents

Publication Publication Date Title
US11889403B2 (en) Access control for network slices of a wireless communication system
US10701619B2 (en) Method and apparatus for controlling an access of a terminal in a wireless communication system
CN110235472B (zh) 一种用于接入禁止的系统和方法
EP3706473B1 (fr) Interdiction d&#39;accès étendu
CN112203336B (zh) 无线接入控制方法、装置及系统
CN113630848A (zh) 网络切片的选择方法、无线接入设备和终端
US10028114B2 (en) Method and apparatus for adaptive barring control for MO-SMS in wireless access system
US11683849B2 (en) Redcap UE identification
CN108271213B (zh) 通信控制方法、非授权传输方法及装置
US20230094040A1 (en) Communication method, and associated communication apparatus, medium, and chip
US20200329505A1 (en) Random Access Method Of Communications Apparatus, Apparatus, And Storage Medium
WO2022083880A1 (fr) Classes de priorité pour des procédures d&#39;accès aléatoire en fonction de la tranche de réseau et de la catégorie d&#39;accès
US20230403745A1 (en) Prioritizing Random Access Procedures for Mobile Terminated Access Attempts in Paging Message
US11388653B2 (en) Method and apparatus providing access control
US11304239B2 (en) Random access procedure
EP4109975A1 (fr) Communication relative à une tranche de réseau
EP3791686A1 (fr) Concept de gestion d&#39;accès en liaison montante
US20230189331A1 (en) Dynamic random access occasion configuration after a contention
WO2024011424A1 (fr) Procédé, dispositif et produit-programme d&#39;ordinateur destinés aux communications sans fil
CN116801385A (zh) 数据传输方法及装置、存储介质、终端设备、网络设备
CN117813869A (zh) 在无线通信系统中用于操作终端的方法和设备

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

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

Country of ref document: EP

Kind code of ref document: A1