CN114245477B - Quick processing method after competition random access failure - Google Patents
Quick processing method after competition random access failure Download PDFInfo
- Publication number
- CN114245477B CN114245477B CN202210099666.1A CN202210099666A CN114245477B CN 114245477 B CN114245477 B CN 114245477B CN 202210099666 A CN202210099666 A CN 202210099666A CN 114245477 B CN114245477 B CN 114245477B
- Authority
- CN
- China
- Prior art keywords
- preamble
- sequences
- random access
- message
- contention
- 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.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access, e.g. scheduled or random access
- H04W74/08—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
- H04W74/0833—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure
- H04W74/0841—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure with collision treatment
- H04W74/085—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure 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
Abstract
The invention discloses a quick processing method after contention random access failure, which comprises the following steps: the physical layer calculates and generates preamble TransMax preamble sequences according to the upper layer configuration parameters and stores the preamble sequences; randomly selecting 1 sequences from the preamblesransmax sequences to send, wherein the 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 a PREAMBLE sequence which is not transmitted is selected, and the PREAMBLE sequence is transmitted immediately at the next prach opportunity without waiting for the time of backoff, and then preamble_transmission_counter+1. The invention can reduce the calculation of the preamble sequences, only generates the preamble sequences with the maximum random access times, effectively reduces the delay of competing random access, avoids the waiting of avoidance time, transmits different generated sequences and effectively reduces the probability of collision.
Description
Technical Field
The present invention relates to the field of wireless communication technologies, and in particular, to a method for fast processing after 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 a fifth generation mobile communication, random Access can be initiated under 10 scenarios including initial connection, handover, and RRC connection reestablishment, where Random Access is further classified into contention-based and non-contention-based Random Access.
After the random access trigger based on the contention is triggered, the UE needs to generate 64 random access preamble sequences according to the upper layer parameter configuration, the UE randomly selects 1 preamble sequence to send, at this time, if other UEs in the cell select the same preamble sequence to send on the same time-frequency resource, and all the UEs receive the random access response (message 2) and successfully send the RRC establishment request message (message 3), at this time, the base station needs to perform contention resolution, after the UE sends the message 3, the UE starts a contention resolution timer, if the timer times out or the UE decodes the UE identification in the RRC establishment request response message (message 4) and does not match with the identification sent by the UE itself message 3, the UE considers that the contention resolution fails, and after failure, the UE randomly selects a preamble sequence sent last time after the time delay based on the backhaul value, at this time, the transmission count of the preamble is increased by 1: the preamble_transmission_counter+1 indicates the current random access failure to the higher RRC if the PREAMBLE TRANSMISSION number reaches the maximum limit number, i.e., preamble_transmission_counter=preambisetmax+1.
As can be seen from the above flow, when the contention random access is initiated, the amount of calculation of the UE for generating 64 preamble sequences is very large, and if the contention fails, the UE needs to wait for the avoidance time, and then initiates the random access by using the same preamble, so that the access delay is increased and the user experience is deteriorated.
Disclosure of Invention
Based on the technical problems in the background technology, the invention provides a rapid processing method after the competition random access fails.
The invention provides a fast processing method after contention random access failure, which comprises the following steps:
s1, the physical layer calculates and generates and stores preambmantransMax leader sequences according to upper layer configuration parameters;
s2, randomly selecting 1 sequence from the preamblicransMax sequences to send, wherein the preamble_transmission_counter+1 is selected;
s3, when receiving the message 4, if the competition timer is overtime or the received UE identifications are not matched, the competition solving is failed;
s4, selecting a PREAMBLE sequence which is not transmitted, and immediately transmitting at the next prach opportunity without waiting for the time of backoff, and then enabling the preamble_TRANSMISSION_COUNTER+1;
s5, if the UE fails to solve the contention resolution again, repeating the step S4 until the UE is successfully accessed 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.
The invention discloses a quick processing method after contention random access failure, which is applicable to contention random access, namely, only generating and storing preamble TransMax preamble sequences, not generating 64 preamble sequences, if contention fails, not waiting for avoidance time (Backoff), and immediately transmitting a generated different sequence at the next prach opportunity;
the invention can reduce the calculation of the preamble sequences, only generates the preamble sequences with the maximum random access times, effectively reduces the delay of competing random access, avoids the waiting of avoidance time, transmits different generated sequences and effectively reduces the probability of collision.
Drawings
Fig. 1 is a flowchart of a fast processing method after contention random access failure according to the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments.
Referring to fig. 1, a fast processing method after contention random access failure includes the steps of:
s1, the physical layer calculates and generates and stores preambmantransMax leader sequences according to upper layer configuration parameters;
s2, randomly selecting 1 sequence from the preamblicransMax sequences to send, wherein the preamble_transmission_counter+1 is selected;
s3, when receiving the message 4, if the competition timer is overtime or the received UE identifications are not matched, the competition solving is failed;
s4, selecting a PREAMBLE sequence which is not transmitted, and immediately transmitting at the next prach opportunity without waiting for the time of backoff, and then enabling the preamble_TRANSMISSION_COUNTER+1;
s5, if the UE fails to solve the contention resolution again, repeating the step S4 until the UE is successfully accessed or the maximum access times are reached.
In the present invention, before the step S3, the message 2 is received and the message 3 is sent, and the contention resolution timer is started.
Examples
A cell has 3 scenarios in which UEs are preparing to initiate random access:
let the maximum number of cell accesses preambbletransmax=4. UE1, UE2 and UE3 generate 4 preambles according to the upper layer configuration (see 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 preambles on the same uplink slot, and send a, e and i respectively, where 3 cases are divided:
assuming that the sequences a, e and i are different, no competition exists at the moment, each UE only generates 4 sequences, and the time for generating 64 preamble by respective calculation is saved;
assuming that sequences a and e are identical, there is contention between UE1 and UE 2. Assuming that the UE2 fails to compete, re-initiate random access, at this time, the UE2 randomly selects one sequence f in { f, g, h }, and immediately sends it at the next rach occasion. Avoiding waiting for a backup off time;
assuming that sequences a, e and i are all the same, there is contention for UE1, UE2 and UE 3. Suppose UE1 access is successful and UE2 and UE3 access fails. At this time, UE2 randomly selects one sequence f of { f, g, h }, 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 the backoff time and the probability that sequence f and sequence j are identical is low.
The invention comprises the following steps: the physical layer calculates and generates preamble TransMax preamble sequences according to the upper layer configuration parameters and stores the preamble sequences; randomly selecting 1 sequences from the preamblesransmax sequences to send, wherein the 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, and immediately transmitting at the next prach opportunity without waiting for the time of backoff, and then transmitting a PREAMBLE sequence_transmission_counter+1; if the UE fails to resolve the contention again, the step S4 is repeated until the UE is successfully accessed or the maximum access times are reached.
The foregoing is only a preferred embodiment of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art, who is within the scope of the present invention, should make equivalent substitutions or modifications according to the technical scheme of the present invention and the inventive concept thereof, and should be covered by the scope of the present invention.
Claims (2)
1. The fast processing method after the competition random access failure is characterized by comprising the following steps:
s1, the physical layer calculates and generates and stores preambmantransMax leader sequences according to upper layer configuration parameters;
s2, randomly selecting 1 sequence from the preamblicransMax sequences to send, wherein the preamble_transmission_counter+1 is selected;
s3, when receiving the message 4, if the competition timer is overtime or the received UE identifications are not matched, the competition solving is failed;
s4, selecting a PREAMBLE sequence which is not transmitted, and immediately transmitting at the next prach opportunity without waiting for the time of backoff, and then enabling the preamble_TRANSMISSION_COUNTER+1;
s5, if the UE fails to solve the contention resolution again, repeating the step S4 until the UE is successfully accessed or the maximum access times are reached.
2. The method according to claim 1, wherein the step S3 is preceded by receiving the message 2 and sending the 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 CN114245477A (en) | 2022-03-25 |
| CN114245477B true 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 (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 kind of random access back-off method and system |
| CN109803435A (en) * | 2017-11-16 | 2019-05-24 | 北京三星通信技术研究有限公司 | Accidental access method and its equipment |
| 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 |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2136599B1 (en) * | 2008-06-18 | 2017-02-22 | LG Electronics Inc. | Detection of failures of random access procedures |
| EP3628135B1 (en) * | 2017-06-26 | 2023-02-22 | Samsung Electronics Co., Ltd. | Method for generating preamble, method for configuring preamble and equipment thereof, random access method, device, user equipment and base station |
-
2022
- 2022-01-27 CN CN202210099666.1A patent/CN114245477B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 kind of random access back-off method and system |
| CN107493608A (en) * | 2016-06-12 | 2017-12-19 | 电信科学技术研究院 | A kind of method and apparatus for carrying out Stochastic accessing |
| 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 (1)
| Title |
|---|
| Performance Analysis and Parameter Optimization of Random Access Backoff Algorithm in LTE;X. Yang, A. Fapojuwo and E. Egbogah;2012 IEEE Vehicular Technology Conference (VTC Fall);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114245477A (en) | 2022-03-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108282899B (en) | Two-step competition random access method and device | |
| US11844135B2 (en) | State transitions for idle mode transmissions using pre-configured dedicated resources | |
| CN107360628B (en) | Random access method, base station and terminal | |
| WO2018127226A1 (en) | Contention random access method and apparatus | |
| EP2090126B1 (en) | Method for immediate access to a random access channel | |
| WO2017028644A1 (en) | Mtc ue random access method and device | |
| CN110167147B (en) | Beam failure recovery method and user terminal | |
| JP2022031881A (en) | Method for random access, terminal device, and network device | |
| US20200374920A1 (en) | Method and apparatus for transmitting data in random access process | |
| EP3531784B1 (en) | Random access method and apparatus | |
| CN109756990B (en) | Random access method and mobile communication terminal | |
| WO2020168566A1 (en) | Message sending method and apparatus in random access process, and device and system | |
| CN110933762B (en) | Random access method, system, terminal and base station based on competition | |
| JP7182002B2 (en) | Random access method and apparatus | |
| CN113574958B (en) | Method, device and communication system for receiving random access response | |
| WO2020220323A1 (en) | Random access method and apparatus, and communication system | |
| WO2019014904A1 (en) | Random access method and terminal device | |
| WO2014089831A1 (en) | Random access method and device | |
| EP2063680A2 (en) | Enhancing radio resource control (RRC) procedure re-initiation efficiency in a wireless communications system | |
| KR101707163B1 (en) | Method and apparatus for dynamic random access control and resource allocation in wireless communication system | |
| CN114449677B (en) | Random access method based on competition, terminal and base station | |
| CN114245477B (en) | Quick processing method after competition random access failure | |
| CN111466149A (en) | Random access technique in wireless networks | |
| CN111107661B (en) | Random access resource acquisition method and device | |
| EP3509383A1 (en) | Random access method and apparatus |
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 |