CN114245477A - Rapid processing method after contention random access failure - Google Patents
Rapid processing method after contention random access failure Download PDFInfo
- Publication number
- CN114245477A CN114245477A CN202210099666.1A CN202210099666A CN114245477A CN 114245477 A CN114245477 A CN 114245477A CN 202210099666 A CN202210099666 A CN 202210099666A CN 114245477 A CN114245477 A CN 114245477A
- Authority
- CN
- China
- Prior art keywords
- random access
- preamble
- contention
- sequence
- sequences
- Prior art date
- Legal status (The legal status 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 status listed.)
- Granted
Links
Images
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
- H04W74/0841—Random access procedures, e.g. with 4-step access with collision treatment
- H04W74/085—Random access procedures, e.g. with 4-step access with collision treatment collision avoidance
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a rapid processing method after a contention random access failure, which comprises the following steps: the physical layer calculates and generates preambleTransMax leader sequences according to the configuration parameters of the upper layer and stores the leader sequences; randomly selecting 1 sequence from preambleTransMax sequences to transmit, wherein PREAMBLE _ TRANSMISSION _ COUNTER + 1; when receiving the message 4, if the contention timer is overtime or the received UE identities are not matched, the contention resolution fails; then selects a PREAMBLE sequence that has not been transmitted, does not need to wait for backoff time, transmits immediately at the next prach occasion, and then PREAMBLE _ transition _ COUNTER + 1. The invention can reduce the calculation of the leader sequence, only generates the leader sequence with the maximum random access times, effectively reduces the delay of competitive random access, avoids the waiting of avoidance time, sends the generated different sequences and effectively reduces the probability of collision.
Description
Technical Field
The invention relates to the technical field of wireless communication, in particular to a rapid processing method after a contention random access failure.
Background
Random Access (Random Access) refers to a process of establishing connection between User Equipment (UE) and a network, and in a New Radio (NR) system of the fifth generation, Random Access can be initiated in 10 scenarios including initial connection, handover, and RRC connection reestablishment, and is further classified into contention-based Random Access and non-contention-based Random Access.
After the random access based on competition is triggered, the UE needs to generate 64 random access preamble sequences according to the upper layer parameter configuration, the UE can randomly select 1 preamble sequence to transmit, at this time, if other UEs in the cell select the same time frequency resource to transmit the same preamble sequence, and these UEs have received the random access response (message 2) and successfully sent the RRC establishment request message (message 3), at which point the base station needs to perform contention resolution, and after the UE sends message 3, the contention resolution timer is started, if the timer expires or the UE identity in the UE decoding RRC setup request response message (message 4) does not match the identity sent in the own message 3, then, the contention resolution is considered to be failed, after the failure, the UE randomly selects a time delay based on the Backoff value to transmit the preamble sequence transmitted last time, and at this time, the transmission count of the preamble is increased by 1: PREAMBLE _ TRANSMISSION _ COUNTER +1, if the PREAMBLE TRANSMISSION times reaches the maximum limit times, that is, PREAMBLE _ TRANSMISSION _ COUNTER is preambleTransMax +1, then indicating that the current random access fails to the higher layer RRC.
It can be known from the above procedures that when initiating contention random access, the UE generates 64 preamble sequences with a very large calculation amount, and if contention fails, it needs to wait for an avoidance time and then initiates random access using the same preamble, so that access delay is increased and user experience is poor.
Disclosure of Invention
Based on the technical problems in the background art, the invention provides a rapid processing method after the failure of the competitive random access.
The invention provides a rapid processing method after a contention random access failure, which comprises the following steps:
s1, calculating and generating preambleTransMax leader sequences by the physical layer according to the configuration parameters of the upper layer and storing the leader sequences;
s2 randomly selects 1 sequence from preambleTransMax sequences to send, at this time, PREAMBLE _ TRANSMISSION _ COUNTER + 1;
s3, when receiving message 4, if the contention timer is overtime or the received UE identities are not matched, the contention resolution fails;
s4 then selects a PREAMBLE sequence that has not been transmitted, without waiting for backoff time, and transmits immediately at the next prach time, and then PREAMBLE _ TRANSMISSION _ COUNTER + 1;
s5 if the UE fails to solve the contention again, the step S4 is repeated until the UE succeeds in access or the maximum access times are reached.
Preferably, the step S3 is preceded by receiving the message 2 and sending the message 3, and starting a contention resolution timer.
In the invention, the method is suitable for contention-based random access, namely only preambletTransMax preamble sequences are generated and stored without generating 64 preamble sequences, and if the contention fails, the avoidance time (Backoff) is not waited, a generated different sequence is immediately sent at the next prach opportunity;
the invention can reduce the calculation of the leader sequence, only generates the leader sequence with the maximum random access times, effectively reduces the delay of competitive random access, avoids the waiting of avoidance time, sends the generated different sequences and effectively reduces the probability of collision.
Drawings
Fig. 1 is a flowchart of a fast processing method after a contention random access failure according to the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments.
Referring to fig. 1, a method for fast processing after a contention random access failure includes the following steps:
s1, calculating and generating preambleTransMax leader sequences by the physical layer according to the configuration parameters of the upper layer and storing the leader sequences;
s2 randomly selects 1 sequence from preambleTransMax sequences to send, at this time, PREAMBLE _ TRANSMISSION _ COUNTER + 1;
s3, when receiving message 4, if the contention timer is overtime or the received UE identities are not matched, the contention resolution fails;
s4 then selects a PREAMBLE sequence that has not been transmitted, without waiting for backoff time, and transmits immediately at the next prach time, and then PREAMBLE _ TRANSMISSION _ COUNTER + 1;
s5 if the UE fails to solve the contention again, the step S4 is repeated until the UE succeeds in access or the maximum access times are reached.
In the present invention, before step S3, message 2 is received and message 3 is sent, and a contention resolution timer is started.
Examples
A cell has 3 scenarios where UEs are preparing to initiate random access:
suppose the maximum number of times preambleTransMax of cell is 4. The UE1, UE2, and UE3 generate 4 preambles according to an upper layer configuration (refer to the method in 3gpp ts38.211: section 6.3.3), respectively. UE1 sequence { a, b, c, d }; UE2 sequence { e, f, g, h }, UE3 sequence { i, j, k, l }. Suppose UE1, UE2, and UE3 send preamble in the same uplink slot, and send a, e, and i, respectively, at this time, there are 3 cases:
assuming that the sequences a, e and i are all different, no competition exists at this time, each UE only generates 4 sequences, and time for generating 64 preambles through respective calculation is saved;
assuming that sequences a and e are identical, there is contention for UE1 and UE2 at this time. Assuming that the UE2 fails to compete, the UE will re-initiate random access, and at this time, the UE2 will randomly select a sequence f in { f, g, h } to transmit immediately at the next rach occasion. The time to wait for backoff is avoided;
assuming that the sequences a, e and i are all the same, there is contention for UE1, UE2 and UE3 at this time. Assuming that the access of the UE1 is successful, the access of the UE2 and the UE3 fails. At this time, the UE2 randomly selects one sequence f of { f, g, h }, and the UE3 randomly selects one sequence j of { j, k, l }, and immediately transmits at the next rach occasion. Both UE2 and UE3 avoid waiting for backoff time and have a low probability of sequence f being the same as sequence j.
The invention comprises the following steps: the physical layer calculates and generates preambleTransMax leader sequences according to the configuration parameters of the upper layer and stores the leader sequences; randomly selecting 1 sequence from preambleTransMax sequences to transmit, wherein PREAMBLE _ TRANSMISSION _ COUNTER + 1; when receiving the message 4, if the contention timer is overtime or the received UE identities are not matched, the contention resolution fails; then selecting a PREAMBLE sequence which is not transmitted, without waiting for backoff time, immediately transmitting at the next prach occasion, and then PREAMBLE _ TRANSMISSION _ COUNTER + 1; if the UE fails to perform contention resolution again, step S4 is repeated until the UE accesses successfully or the maximum access times are reached.
The above description is only for the preferred embodiment of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art should be considered to be within the technical scope of the present invention, and the technical solutions and the inventive concepts thereof according to the present invention should be equivalent or changed within the scope of the present invention.
Claims (2)
1. A fast processing method after the failure of the competitive random access is characterized by comprising the following steps:
s1, calculating and generating preambleTransMax leader sequences by the physical layer according to the configuration parameters of the upper layer and storing the leader sequences;
s2 randomly selects 1 sequence from preambleTransMax sequences to send, at this time, PREAMBLE _ TRANSMISSION _ COUNTER + 1;
s3, when receiving message 4, if the contention timer is overtime or the received UE identities are not matched, the contention resolution fails;
s4 then selects a PREAMBLE sequence that has not been transmitted, without waiting for backoff time, and transmits immediately at the next prach time, and then PREAMBLE _ TRANSMISSION _ COUNTER + 1;
s5 if the UE fails to solve the contention again, the step S4 is repeated until the UE succeeds in access or the maximum access times are reached.
2. The method as claimed in claim 1, wherein the step S3 is preceded by receiving message 2 and sending message 3, and starting a contention resolution timer.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210099666.1A CN114245477B (en) | 2022-01-27 | 2022-01-27 | Quick processing method after competition random access failure |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210099666.1A CN114245477B (en) | 2022-01-27 | 2022-01-27 | Quick processing method after competition random access failure |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114245477A true CN114245477A (en) | 2022-03-25 |
| CN114245477B CN114245477B (en) | 2023-08-18 |
Family
ID=80747363
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210099666.1A Active CN114245477B (en) | 2022-01-27 | 2022-01-27 | Quick processing method after competition random access failure |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114245477B (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090316586A1 (en) * | 2008-06-18 | 2009-12-24 | Lg Electronics Inc. | Method for detecting failures of random access procedures |
| CN102291836A (en) * | 2010-06-21 | 2011-12-21 | 中兴通讯股份有限公司 | Random access control method and system |
| KR20120025392A (en) * | 2010-07-25 | 2012-03-15 | 엘지전자 주식회사 | Method of performing distributely random access and distributing random access and apparatus thereof |
| CN107493608A (en) * | 2016-06-12 | 2017-12-19 | 电信科学技术研究院 | A kind of method and apparatus for carrying out Stochastic accessing |
| CN108781470A (en) * | 2016-03-14 | 2018-11-09 | 华为技术有限公司 | A random access backoff method and system |
| CN109803435A (en) * | 2017-11-16 | 2019-05-24 | 北京三星通信技术研究有限公司 | Accidental access method and its equipment |
| US20200351853A1 (en) * | 2017-06-26 | 2020-11-05 | Samsung Electronics Co., Ltd. | Method for generating preamble, method for configuring preamble and equipment thereof, random access method, device, user equipment and base station |
| CN113940135A (en) * | 2020-04-28 | 2022-01-14 | 上海诺基亚贝尔股份有限公司 | Sending reports of random access procedures |
| CN114025433A (en) * | 2019-03-19 | 2022-02-08 | Oppo广东移动通信有限公司 | Method, terminal equipment and network equipment for two-step random access |
-
2022
- 2022-01-27 CN CN202210099666.1A patent/CN114245477B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090316586A1 (en) * | 2008-06-18 | 2009-12-24 | Lg Electronics Inc. | Method for detecting failures of random access procedures |
| CN102291836A (en) * | 2010-06-21 | 2011-12-21 | 中兴通讯股份有限公司 | Random access control method and system |
| KR20120025392A (en) * | 2010-07-25 | 2012-03-15 | 엘지전자 주식회사 | Method of performing distributely random access and distributing random access and apparatus thereof |
| CN108781470A (en) * | 2016-03-14 | 2018-11-09 | 华为技术有限公司 | A random access backoff method and system |
| CN107493608A (en) * | 2016-06-12 | 2017-12-19 | 电信科学技术研究院 | A kind of method and apparatus for carrying out Stochastic accessing |
| US20200351853A1 (en) * | 2017-06-26 | 2020-11-05 | Samsung Electronics Co., Ltd. | Method for generating preamble, method for configuring preamble and equipment thereof, random access method, device, user equipment and base station |
| CN109803435A (en) * | 2017-11-16 | 2019-05-24 | 北京三星通信技术研究有限公司 | Accidental access method and its equipment |
| CN114025433A (en) * | 2019-03-19 | 2022-02-08 | Oppo广东移动通信有限公司 | Method, terminal equipment and network equipment for two-step random access |
| CN113940135A (en) * | 2020-04-28 | 2022-01-14 | 上海诺基亚贝尔股份有限公司 | Sending reports of random access procedures |
Non-Patent Citations (3)
| Title |
|---|
| FUJITSU: "R2-082222 "Msg1/ Msg3 Cancellation"", 3GPP TSG_RAN\\WG2_RL2, no. 2 * |
| X. YANG, A. FAPOJUWO AND E. EGBOGAH: "Performance Analysis and Parameter Optimization of Random Access Backoff Algorithm in LTE", 2012 IEEE VEHICULAR TECHNOLOGY CONFERENCE (VTC FALL) * |
| 余昊;: "关于LTE随机接入过程研究", 无线互联科技, no. 24 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114245477B (en) | 2023-08-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11844135B2 (en) | State transitions for idle mode transmissions using pre-configured dedicated resources | |
| EP2090126B1 (en) | Method for immediate access to a random access channel | |
| CN110167147B (en) | A beam failure recovery method and user terminal | |
| WO2018127226A1 (en) | Contention random access method and apparatus | |
| JP7520883B2 (en) | Random access method, device and communication system | |
| US10813135B2 (en) | Random access method and apparatus | |
| CN103826318B (en) | Macro base station and micro base station combined random access method and equipment | |
| CN113574958A (en) | Method, device and communication system for receiving random access response | |
| CN109661830B (en) | Method and device for random access configuration | |
| CN114449677B (en) | Contention-based random access method, terminal and base station | |
| WO2014032577A1 (en) | Random access response method and apparatus | |
| TW201909589A (en) | Method and terminal device for random access | |
| CN111466149A (en) | Random Access Technology in Wireless Network | |
| CN113498212B (en) | Random access method, terminal and network side equipment | |
| CN114245477B (en) | Quick processing method after competition random access failure | |
| CN116614815B (en) | Satellite lower equipment random access method, satellite, terminal equipment and electronic equipment | |
| CN109963349B (en) | A contention random access method and system | |
| CN114364055B (en) | Contention-based random access method, device, base station and storage medium | |
| WO2020156188A1 (en) | Random access method, device and apparatus | |
| CN113163507A (en) | Method, system and base station for processing random access | |
| US12588100B2 (en) | State transitions for idle mode transmissions using pre-configured dedicated resources | |
| CN111107661A (en) | Random access resource acquisition method and device | |
| WO2022012318A1 (en) | Random access methodand apparatus and user equipment | |
| CN119678587A (en) | Wireless communication method, terminal device and network device | |
| CN117835449A (en) | Beam failure recovery method and device, storage medium, terminal, and network equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |