Method and apparatus in a node for wireless communication

By using the counter mechanism in wireless communication nodes to optimize the fallback mechanism of multiple PRACH transmissions, the problem of resource conflicts between multiple nodes is solved, and the access performance and coverage of the system are improved.

CN119342616APending Publication Date: 2025-01-21QUECTEL WIRELESS SOLUTIONS CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411344075.1
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2023-07-21
Publication Date
2025-01-21

AI Technical Summary

Technical Problem

In wireless communication systems, when increasing the number of PRACH transmissions based on the fallback mechanism may lead to resource conflicts and access performance degradation.

Method used

By introducing a counter mechanism into the wireless communication node and determining the number X2 of the second random access preamble to be sent according to the first parameter or counter value, the fallback mechanism of the complex PRACH transmission is optimized and resource conflicts are reduced.

Benefits of technology

It effectively reduces the resource consumption of multiple PRACH retransmissions, avoids resource conflicts, and improves the access performance and coverage of the system.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119342616A_ABST
    Figure CN119342616A_ABST
Patent Text Reader

Abstract

The invention provides a method and a device in a node for wireless communication, which are used for reducing resource consumption of complex PRACH (Physical Random Access Channel) retransmission. The method comprises the following steps: sending X1 first random access preambles, wherein X1 is a positive integer; monitoring a control signaling of a first random access response in a first time window, wherein the first random access response corresponds to the X1 first random access preambles; progressively increasing the first counter by X1, and / or progressively increasing the second counter by 1; sending X2 second random access preambles, wherein X2 is a positive integer greater than or equal to X1; wherein the first parameter is used for determining the X2; or, whether the first counter is greater than a first threshold value is used for determining X2, and the first threshold value is a positive integer greater than 1; or whether the second counter is greater than a second threshold value is used for determining X2, and the second threshold value is a positive integer; alternatively, whether the first counter is greater than a first threshold and whether the second counter is greater than a second threshold are jointly used to determine X2.
Need to check novelty before this filing date? Find Prior Art

Description

[0001] This application is a divisional application of the case with application number 202380011743.6, application date July 21, 2023, and invention name “Method and device in a node for wireless communication”. Technical Field

[0002] The present application relates to the field of communication technology, and more specifically, to a method and device in a node for wireless communication. Background Art

[0003] In order to enhance the coverage performance of random access, some communication systems (such as new radio (NR) systems) plan to introduce retransmission based on multiple physical random access channel (PRACH) transmissions, and discuss the scheme of increasing the number of PRACH transmissions through a backoff mechanism in retransmissions. However, the increase of multiple nodes from a smaller number of PRACH transmissions to a larger number of PRACH transmissions based on the backoff mechanism may not only cause resource conflicts due to resource allocation of multiple PRACH retransmissions, but may also cause conflicts in the backoff mechanism of multiple PRACH transmissions, thereby seriously affecting the access performance of the system. Summary of the invention

[0004] The embodiments of the present application provide a method and device in a node for wireless communication. The following introduces various aspects involved in the present application.

[0005] In a first aspect, a method in a first node for wireless communication is provided, comprising: sending X1 first random access preambles, where X1 is a positive integer; monitoring control signaling of a first random access response within a first time window, where the first random access response corresponds to the X1 first random access preambles; incrementing a first counter by X1, and / or incrementing a second counter by 1; sending X2 second random access preambles, where X2 is a positive integer greater than or equal to X1; wherein a first parameter is used to determine X2; or, whether the first counter is greater than a first threshold is used to determine X2, where the first threshold is a positive integer greater than 1; or, whether the second counter is greater than a second threshold is used to determine X2, where the second threshold is a positive integer; or, whether the first counter is greater than the first threshold and whether the second counter is greater than the second threshold are jointly used to determine X2.

[0006] As an implementation manner, control signaling of a second random access response is monitored within a second time window; wherein the second random access response corresponds to the X2 second random access preambles.

[0007] As an implementation manner, a third random access response is received, the third random access response includes at least one random access preamble identifier, and any random access preamble identifier of the at least one random access preamble identifier included in the third random access response does not match the preamble index corresponding to the X1 first random access preambles.

[0008] As an implementation manner, the control signaling of the first random access response or the control signaling of the third random access response or the third random access response is used to indicate the first parameter.

[0009] As an implementation manner, the X2 is one of a plurality of candidate integers, any integer among the plurality of candidate integers is not less than the X1; the X2 is equal to the first parameter, the first parameter is randomly selected from the plurality of candidate integers, and the plurality of candidate integers are configured by higher layer signaling.

[0010] As an implementation manner, the X2 is one of a plurality of candidate integers, any integer among the plurality of candidate integers is not less than the X1; the first parameter is used to determine the X2 including that the X2 is equal to the first parameter, or the first parameter is the index of the X2 in the plurality of candidate integers.

[0011] As an implementation manner, when the first counter is greater than the first threshold, X2 is a multiple of X1; when the first counter is not greater than the first threshold, X2 is equal to X1.

[0012] As an implementation manner, when the second counter is greater than the second threshold, X2 is a multiple of X1; when the second counter is not greater than the second threshold, X2 is equal to X1.

[0013] As an implementation, when the first counter is greater than the first threshold or the second counter is greater than the second threshold, the first parameter is used to determine the X2; when the first counter is not greater than the first threshold or the second counter is not greater than the second threshold, the X2 is equal to the X1.

[0014] As an implementation manner, the first threshold is configured by higher-layer signaling, or the second threshold is configured by higher-layer signaling, or both the first threshold and the second threshold are configured by higher-layer signaling.

[0015] As an implementation manner, the first parameter is used to determine the first threshold, or the second threshold, or the first threshold and the second threshold.

[0016] In a second aspect, a method is provided in a second node for wireless communication, comprising: performing reception of X1 first random access preambles, where X1 is a positive integer; determining within a first time window whether to send control signaling of a first random access response, where the first random access response corresponds to the X1 first random access preambles; performing reception of X2 second random access preambles, where X2 is a positive integer greater than or equal to X1; wherein a first parameter is used to determine X2; or, whether a first counter of a first node that sends the X1 first random access preambles is greater than a first threshold is used to determine X2, and the first threshold is a positive integer greater than 1; or, whether a second counter of a first node that sends the X1 first random access preambles is greater than a second threshold is used to determine X2, and the second threshold is a positive integer; or, whether a first counter of a first node that sends the X1 first random access preambles is greater than a first threshold and whether a second counter of the first node is greater than a second threshold are jointly used to determine X2.

[0017] As an implementation manner, it is determined whether to send control signaling of a second random access response within a second time window; wherein the second random access response corresponds to the X2 second random access preambles.

[0018] As an implementation manner, a third random access response is sent, the third random access response includes at least one random access preamble identifier, and any random access preamble identifier of the at least one random access preamble identifier included in the third random access response does not match the preamble index corresponding to the X1 first random access preambles.

[0019] As an implementation manner, the control signaling of the first random access response or the control signaling of the third random access response or the third random access response is used to indicate the first parameter.

[0020] As an implementation manner, the X2 is one of a plurality of candidate integers, any integer among the plurality of candidate integers is not less than the X1; the X2 is equal to the first parameter, the first parameter is randomly selected from the plurality of candidate integers, and the plurality of candidate integers are configured by higher layer signaling.

[0021] As an implementation manner, the X2 is one of a plurality of candidate integers, any integer among the plurality of candidate integers is not less than the X1; the first parameter is used to determine the X2 including that the X2 is equal to the first parameter, or the first parameter is the index of the X2 in the plurality of candidate integers.

[0022] As an implementation manner, when the first counter is greater than the first threshold, X2 is a multiple of X1; when the first counter is not greater than the first threshold, X2 is equal to X1.

[0023] As an implementation manner, when the second counter is greater than the second threshold, X2 is a multiple of X1; when the second counter is not greater than the second threshold, X2 is equal to X1.

[0024] As an implementation, when the first counter is greater than the first threshold or the second counter is greater than the second threshold, the first parameter is used to determine the X2; when the first counter is not greater than the first threshold or the second counter is not greater than the second threshold, the X2 is equal to the X1.

[0025] As an implementation manner, the first threshold is configured by higher-layer signaling, or the second threshold is configured by higher-layer signaling, or both the first threshold and the second threshold are configured by higher-layer signaling.

[0026] As an implementation manner, the first parameter is used to determine the first threshold, or the second threshold, or the first threshold and the second threshold.

[0027] In a third aspect, a first node for wireless communication is provided, characterized in that it includes: a first transmitter, used to send X1 first random access preambles, X1 is a positive integer; a first receiver, used to monitor control signaling of a first random access response within a first time window, the first random access response corresponding to the X1 first random access preambles; a first processor, used to increment a first counter by X1, and / or, to increment a second counter by 1; a second transmitter, used to send X2 second random access preambles, X2 is a positive integer greater than or equal to X1; wherein a first parameter is used to determine X2; or, whether the first counter is greater than a first threshold is used to determine X2, the first threshold is a positive integer greater than 1; or, whether the second counter is greater than a second threshold is used to determine X2, the second threshold is a positive integer; or, whether the first counter is greater than the first threshold and whether the second counter is greater than the second threshold are jointly used to determine X2.

[0028] As an implementation manner, the first receiver is further configured to monitor control signaling of a second random access response within a second time window; wherein the second random access response corresponds to the X2 second random access preambles.

[0029] As an implementation method, the first receiver is further used to receive a third random access response, the third random access response including at least one random access preamble identifier, and any random access preamble identifier of the at least one random access preamble identifier included in the third random access response does not match the preamble index corresponding to the X1 first random access preambles.

[0030] As an implementation manner, the control signaling of the first random access response or the control signaling of the third random access response or the third random access response is used to indicate the first parameter.

[0031] As an implementation manner, the X2 is one of a plurality of candidate integers, any integer among the plurality of candidate integers is not less than the X1; the X2 is equal to the first parameter, the first parameter is randomly selected from the plurality of candidate integers, and the plurality of candidate integers are configured by higher layer signaling.

[0032] As an implementation manner, the X2 is one of a plurality of candidate integers, any integer among the plurality of candidate integers is not less than the X1; the first parameter is used to determine the X2 including that the X2 is equal to the first parameter, or the first parameter is the index of the X2 in the plurality of candidate integers.

[0033] As an implementation manner, when the first counter is greater than the first threshold, X2 is a multiple of X1; when the first counter is not greater than the first threshold, X2 is equal to X1.

[0034] As an implementation manner, when the second counter is greater than the second threshold, X2 is a multiple of X1; when the second counter is not greater than the second threshold, X2 is equal to X1.

[0035] As an implementation, when the first counter is greater than the first threshold or the second counter is greater than the second threshold, the first parameter is used to determine the X2; when the first counter is not greater than the first threshold or the second counter is not greater than the second threshold, the X2 is equal to the X1.

[0036] As an implementation manner, the first threshold is configured by higher-layer signaling, or the second threshold is configured by higher-layer signaling, or both the first threshold and the second threshold are configured by higher-layer signaling.

[0037] As an implementation manner, the first parameter is used to determine the first threshold, or the second threshold, or the first threshold and the second threshold.

[0038] In a fourth aspect, a second node for wireless communication is provided, characterized in that it includes: a second receiver, used to perform reception of X1 first random access preambles, where X1 is a positive integer; a second processor, used to determine whether to send control signaling of a first random access response within a first time window, where the first random access response corresponds to the X1 first random access preambles; a third receiver, used to perform reception of X2 second random access preambles, where X2 is a positive integer greater than or equal to X1; wherein a first parameter is used to determine X2; or, whether a first counter of a first node that sends the X1 first random access preambles is greater than a first threshold is used to determine X2, and the first threshold is a positive integer greater than 1; or, whether a second counter of a first node that sends the X1 first random access preambles is greater than a second threshold is used to determine X2, and the second threshold is a positive integer; or, whether the first counter of a first node that sends the X1 first random access preambles is greater than the first threshold and whether the second counter of the first node is greater than the second threshold are jointly used to determine X2.

[0039] As an implementation manner, the second processor is further used to determine whether to send control signaling of a second random access response within a second time window; wherein the second random access response corresponds to the X2 second random access preambles.

[0040] As an implementation method, the second node also includes a third transmitter, used to send a third random access response, the third random access response includes at least one random access preamble identifier, and any random access preamble identifier of the at least one random access preamble identifier included in the third random access response does not match the preamble index corresponding to the X1 first random access preambles.

[0041] As an implementation manner, the control signaling of the first random access response or the control signaling of the third random access response or the third random access response is used to indicate the first parameter.

[0042] As an implementation manner, the X2 is one of a plurality of candidate integers, any integer among the plurality of candidate integers is not less than the X1; the X2 is equal to the first parameter, the first parameter is randomly selected from the plurality of candidate integers, and the plurality of candidate integers are configured by higher layer signaling.

[0043] As an implementation manner, the X2 is one of a plurality of candidate integers, any integer among the plurality of candidate integers is not less than the X1; the first parameter is used to determine the X2 including that the X2 is equal to the first parameter, or the first parameter is the index of the X2 in the plurality of candidate integers.

[0044] As an implementation manner, when the first counter is greater than the first threshold, X2 is a multiple of X1; when the first counter is not greater than the first threshold, X2 is equal to X1.

[0045] As an implementation manner, when the second counter is greater than the second threshold, X2 is a multiple of X1; when the second counter is not greater than the second threshold, X2 is equal to X1.

[0046] As an implementation, when the first counter is greater than the first threshold or the second counter is greater than the second threshold, the first parameter is used to determine the X2; when the first counter is not greater than the first threshold or the second counter is not greater than the second threshold, the X2 is equal to the X1.

[0047] As an implementation manner, the first threshold is configured by higher-layer signaling, or the second threshold is configured by higher-layer signaling, or both the first threshold and the second threshold are configured by higher-layer signaling.

[0048] As an implementation manner, the first parameter is used to determine the first threshold, or the second threshold, or the first threshold and the second threshold.

[0049] In a fifth aspect, a first node used for wireless communication is provided, comprising a transceiver, a memory and a processor, wherein the memory is used to store programs, the processor is used to call the programs in the memory and control the transceiver to receive or send signals so that the first node executes the method described in any implementation method of the third aspect.

[0050] In the sixth aspect, a second node used for wireless communication is provided, comprising a transceiver, a memory and a processor, wherein the memory is used to store programs, the processor is used to call the programs in the memory and control the transceiver to receive or send signals so that the second node executes the method described in any implementation method of the fourth aspect.

[0051] In a seventh aspect, an embodiment of the present application provides a communication system, which includes the first node and / or the second node described above. In another possible design, the system may also include other devices that interact with the first node or the second node in the solution provided in the embodiment of the present application.

[0052] In an eighth aspect, an embodiment of the present application provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and the computer program enables a computer to execute part or all of the steps in the methods of the above aspects.

[0053] In a ninth aspect, an embodiment of the present application provides a computer program product, wherein the computer program product includes a non-transitory computer-readable storage medium storing a computer program, and the computer program is operable to cause a computer to execute some or all of the steps in the above-mentioned various aspects of the method. In some implementations, the computer program product can be a software installation package.

[0054] In the tenth aspect, an embodiment of the present application provides a chip, which includes a memory and a processor. The processor can call and run a computer program from the memory to implement some or all of the steps described in the methods of the above aspects.

[0055] In the embodiment of the present application, after the first node monitors the first random access responses corresponding to the X1 first random access preambles, the first node determines the number of second random access preambles sent X2 according to the first parameter or the first / second counter. It can be seen that the first node can determine the number of PRACH transmissions of the complex PRACH retransmission according to the first parameter or the counter, instead of directly increasing the number of PRACH transmissions, and optimizes the fallback mechanism of the complex PRACH transmission, which helps to reduce the resource consumption of the complex PRACH retransmission.

[0056] In the embodiment of the present application, when a conflict occurs in the PRACH transmissions performed by multiple first nodes using X1 first random access preambles, X2 can be determined based on the first parameter or the counter respectively, instead of increasing them to the same number of the next order. It can be seen that the probability of multiple first nodes selecting the same number of PRACH transmissions when sending the second random access preamble is reduced, thereby avoiding or reducing resource conflicts in the multiple PRACH transmissions.

[0057] In an embodiment of the present application, the first node can increase the number of PRACH transmissions for multiple PRACH retransmissions through an optimized fallback mechanism, or can choose to increase the number of PRACH transmissions based on the fallback mechanism, so that it can use separate PRACH resources with other nodes for multiple PRACH retransmissions, which not only helps to improve the performance gain of multiple PRACH transmissions and increase coverage, but also helps to reduce random access delays and improve the utilization efficiency of random access resources. BRIEF DESCRIPTION OF THE DRAWINGS

[0058] Figure 1 The present invention is a diagram showing an example of a system architecture of a wireless communication system to which the embodiments of the present application can be applied.

[0059] Figure 2 A flowchart of a method in a first node for wireless communication provided in an embodiment of the present application.

[0060] Figure 3 for Figure 2A flowchart of a possible implementation method of step S240 in FIG.

[0061] Figure 4 for Figure 2 A flowchart of another possible implementation method of step S240 in FIG.

[0062] Figure 5 for Figure 2 Schematic diagram of another possible implementation of step S240.

[0063] Figure 6 for Figure 2 FIG. 5 is a flow chart of another possible implementation method of step S240 in FIG.

[0064] Figure 7 for Figure 2 FIG. 5 is a flow chart of another possible implementation method of step S240 in FIG.

[0065] Figure 8 for Figure 2 FIG. 5 is a flow chart of another possible implementation method of step S240 in FIG.

[0066] Fig. 9 for Figure 2 FIG. 5 is a flow chart of another possible implementation method of step S240 in FIG.

[0067] Fig.10 for Figure 2 A flowchart of a possible implementation of the method shown.

[0068] Fig.11 A schematic diagram of the structure of a first node for wireless communication provided in an embodiment of the present application.

[0069] Fig.12 A schematic diagram of the structure of a second node for wireless communication provided in an embodiment of the present application.

[0070] Fig.13 A schematic structural diagram of a device provided in an embodiment of the present application.

[0071] Fig.14 A schematic diagram of the hardware modules of a communication device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0072] Communication system architecture

[0073] Figure 11 is a diagram showing an example of a system architecture of a wireless communication system 100 to which an embodiment of the present application can be applied. The wireless communication system 100 may include a network device 110 and a user device 120. The network device 110 may be a device that communicates with the user device 120. The network device 110 may provide communication coverage for a specific geographic area, and may communicate with the user device 120 located in the coverage area.

[0074] Figure 1 One network device and two user devices are shown exemplarily. Optionally, the wireless communication system 100 may include multiple network devices and each network device may include another number of user devices within its coverage area, which is not limited in the embodiments of the present application.

[0075] Optionally, the wireless communication system 100 may also include other network entities such as a network controller and a mobility management entity, which is not limited in the embodiments of the present application.

[0076] It should be understood that the technical solutions of the embodiments of the present application can be applied to various communication systems, such as: the fifth generation (5th generation, 5G) system or NR, long term evolution (long term evolution, LTE) system, LTE frequency division duplex (frequency division duplex, FDD) system, LTE time division duplex (time division duplex, TDD), etc. The technical solutions provided in this application can also be applied to future communication systems, such as the sixth generation mobile communication system, satellite communication system, and so on.

[0077] The user equipment in the embodiments of the present application may also be referred to as terminal equipment, access terminal, user unit, user station, mobile station, mobile station (MS), mobile terminal (MT), remote station, remote terminal, mobile device, user terminal, terminal, wireless communication device, user agent or user device. The user equipment in the embodiments of the present application may refer to a device that provides voice and / or data connectivity to a user, and may be used to connect people, objects and machines, such as a handheld device with a wireless connection function, a vehicle-mounted device, etc. The user equipment in the embodiments of the present application can be a mobile phone, a tablet computer, a laptop computer, a PDA, a mobile internet device (MID), a wearable device, a virtual reality (VR) device, an augmented reality (AR) device, a wireless terminal in industrial control, a wireless terminal in self-driving, a wireless terminal in remote medical surgery, a wireless terminal in smart grid, a wireless terminal in transportation safety, a wireless terminal in smart city, a wireless terminal in smart home, etc. Optionally, the UE can be used to act as a base station. For example, the UE can act as a scheduling entity that provides sidelink signals between UEs in V2X or D2D, etc. For example, a cellular phone and a car communicate with each other using a sidelink signal. Cellular phones and smart home devices communicate without relaying communication signals through a base station.

[0078] The network device in the embodiment of the present application may be a device for communicating with a user device, and the network device may also be referred to as an access network device or a radio access network device, such as a base station. The network device in the embodiment of the present application may refer to a radio access network (RAN) node (or device) that connects a user device to a wireless network. The base station can broadly cover various names as follows, or be replaced with the following names, such as: NodeB, evolved NodeB (eNB), next generation NodeB (gNB), relay station, access point, transmitting and receiving point (TRP), transmitting point (TP), master station MeNB, secondary station SeNB, multi-standard radio (MSR) node, home base station, network controller, access node, wireless node, access point (AP), transmission node, transceiver node, base band unit (BBU), remote radio unit (RRU), active antenna unit (AAU), remote radio head (RRH), central unit (CU), distributed unit (DU), positioning node, etc. The base station can be a macro base station, a micro base station, a relay node, a donor node or the like, or a combination thereof. The base station may also refer to a communication module, modem or chip used to be set in the aforementioned device or apparatus. The base station may also be a mobile switching center and a device to device D2D, vehicle-to-everything (V2X), machine-to-machine (M2M) communication device that performs the base station function, a network side device in a 6G network, and a device that performs the base station function in a future communication system. The base station may support networks with the same or different access technologies. The embodiments of the present application do not limit the specific technology and specific device form adopted by the network equipment.

[0079] Base stations can be fixed or mobile. For example, a helicopter or drone can be configured to act as a mobile base station, and one or more cells can move based on the location of the mobile base station. In other examples, a helicopter or drone can be configured to act as a device that communicates with another base station.

[0080] In some deployments, the network device in the embodiments of the present application may refer to a CU or a DU, or the network device includes a CU and a DU. The gNB may also include an AAU.

[0081] The network equipment and user equipment can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; they can also be deployed on the water surface; they can also be deployed on aircraft, balloons and satellites in the air. The embodiments of the present application do not limit the scenarios in which the network equipment and user equipment are located.

[0082] It should be understood that all or part of the functions of the communication device in the present application may also be implemented by software functions running on hardware, or by virtualization functions instantiated on a platform (eg, a cloud platform).

[0083] It should be understood that the interpretation of the terminology in the embodiments of the present application can refer to the 3GPP specification protocols TS36 series, TS37 series and TS38 series, but can also refer to the specification protocols of the Institute of Electrical and Electronics Engineers (IEEE).

[0084] Coverage enhancement of PRACH transmission

[0085] The coverage performance of a communication system (e.g., NR system) is an important factor that operators need to consider when commercializing communication networks. This is because the coverage performance of a communication system directly affects the service quality of the communication system and the operator's costs, such as the operator's capital expenditure (CAPEX) and the operator's operating expense (OPEX).

[0086] The coverage performance of a communication system will vary with the frequency band in which the communication system operates. For example, compared with the LTE system, the NR system operates at a higher frequency band (e.g., the millimeter wave frequency band), which results in a greater path loss in the NR system, and thus results in a relatively poorer coverage performance in the NR system. Therefore, as the frequency bands supported by the communication system may become higher and higher, how to enhance the coverage of the communication system becomes a problem that needs to be solved.

[0087] In most scenarios of actual deployment, since the capabilities of user equipment are weaker than those of network equipment, the uplink (UL) coverage performance is the bottleneck for coverage enhancement of communication systems. With the development of communication technology, the uplink services in some emerging vertical use cases are gradually increasing, such as video uploading services. In scenarios with more uplink services, how to enhance uplink coverage is a problem that needs to be further solved.

[0088] In the related art, there are already technical solutions for coverage enhancement for some uplinks. For example, NR release 17 (Rel-17) has designed coverage enhancement solutions for the physical uplink shared channel (PUSCH), physical uplink control channel (PUCCH) and message 3 (Msg3) in the random access process.

[0089] However, Rel-17 does not design a coverage enhancement solution for PRACH, but PRACH transmission performance is very important for many processes such as initial access and beam failure recovery. Therefore, it is also very important to enhance the coverage of PRACH. Based on this, the 3rd Generation Partnership Project (3GPP) formally established the "further NR coverage enhancements" work item (WI) in the Rel-18 version of NR through project RP-221858. Among them, enhancing the coverage performance of PRACH transmission is one of the important topics of this work item.

[0090] As a possible implementation, multiple PRACH transmissions may be used to achieve coverage enhancement of PRACH transmission. That is, the performance gain of PRACH transmission may be obtained by repeated transmission of PRACH (eg, sending a preamble in PRACH multiple times).

[0091] In order to achieve coverage enhancement of PRACH transmission, the 3GPP Radio Access Network (RAN) 1#110bis-e meeting agreed to use multiple PRACH transmissions with the same beam in one RACH attempt to achieve performance gain. The RAN1#110bis-e meeting also further supports the use of the same PRACH preamble in multiple PRACH transmissions, and physical random access channel opportunities (PRAC Hoccasions, ROs) at different time instances can be used for multiple PRACH transmissions.

[0092] Furthermore, the 3GPP RAN1#112 meeting agreed to introduce physical random access channel opportunity group (PRAC Hoccasion group, RO group, ROG) for multiple PRACH transmission; and all ROs in a ROG are associated with the same synchronization signal / physical broadcast channel block (synchronization signal / physical broadcast channel block(s), SS / PBCH block(s), SSB(s)); the number of PRACH transmissions in multiple PRACH transmissions using the same beam supports 2, 4 or 8.

[0093] Further, the 3GPP RAN1#112bis-e meeting agreed that multiple PRACH transmissions in a random access channel attempt are run in only one ROG; and the number of PRACH transmissions in the multiple PRACH transmission is configured as one or more values, and the number of valid ROs in a ROG is equal to the configured one or more values. That is, the size of a ROG (ROG size) is one of 2 ROs, 4 ROs or 8 ROs, depending on the one or more values ​​configured for the number of PRACH transmissions in the multiple PRACH transmission.

[0094] Based on the above technical progress, subsequent meetings discussed solutions for retransmission based on multiple PRACH transmission and increasing the number of PRACH transmissions in retransmission. For example, the 3GPP RAN2#122 meeting agreed to further discuss the fallback mechanism from a smaller number of PRACH transmissions to a larger number of PRACH transmissions in multiple PRACH transmissions. For another example, the 3GPP RAN1#113 meeting also discussed a solution for performing single PRACH transmission or multiple PRACH transmission in the initial random access channel attempt, and allowing an increase in the number of PRACH transmissions during retransmission. This solution enables coverage-limited user equipment to quickly access the system by adjusting the number of PRACH transmissions of multiple PRACH transmissions in retransmission when the number of PRACH transmissions determined in the initial random access channel attempt does not meet performance requirements; especially when the PRACH transmit power of the user equipment reaches the maximum transmit power and there is no additional power available to increase coverage, increasing the number of PRACH transmissions of multiple PRACH transmissions to obtain combined gain is an effective solution.

[0095] The fallback mechanism of the multiple PRACH transmission refers to falling back from the multiple PRACH transmission including a smaller number of PRACH transmissions to the multiple PRACH transmission including a larger number of PRACH transmissions when performing retransmission of the multiple PRACH transmission. For example, falling back from a multiple PRACH transmission including 2 PRACH transmissions to a multiple PRACH transmission including 4 PRACH transmissions. For another example, falling back from a multiple PRACH transmission including 4 PRACH transmissions to a multiple PRACH transmission including 8 PRACH transmissions. For another example, falling back from a multiple PRACH transmission including 2 PRACH transmissions to a multiple PRACH transmission including 8 PRACH transmissions.

[0096] In most discussions on the fallback mechanism for multiple PRACH transmissions, when the previous multiple PRACH transmission is unsuccessful, the user equipment will increase the number of PRACH transmissions in the multiple PRACH transmission. Therefore, when multiple user equipments use the same number of PRACH transmissions for multiple PRACH transmissions in the previous transmission, these user equipments may still use the same number of PRACH transmissions for the next PRACH retransmission.

[0097] Since complex PRACH transmissions with different numbers of PRACH transmissions are distinguished by different PRACH resources, when multiple user equipments conflict when using complex PRACH transmissions with the same number of PRACH transmissions, these user equipments are all increased to the next level of complex PRACH transmissions with the same number of PRACH transmissions, which may cause conflicts to occur again, seriously affecting the access performance of the system.

[0098] In summary, in a scenario where multiple user equipments perform multiple PRACH retransmissions based on a fallback mechanism, the change from a smaller number of PRACH transmissions to a larger number of PRACH transmissions may not only lead to resource conflicts due to resource allocation for multiple PRACH retransmissions, but may also lead to fallback mechanism conflicts for multiple PRACH transmissions, thereby seriously affecting the access performance of the system.

[0099] In order to solve the above problems, the embodiments of the present application provide a method and apparatus in a node for wireless communication. The method optimizes the fallback mechanism of multiple PRACH transmission to minimize resource conflicts in multiple PRACH retransmissions, and through the optimization of resource allocation, while improving the multiple PRACH transmission performance gain and increasing the coverage, reduces random access delay and improves the utilization efficiency of random access resources.

[0100] The embodiments of the present application can be applied to the retransmission scenario of performing a single PRACH transmission or a multiple PRACH transmission in the initial random access channel attempt, that is, multiple PRACH repeated transmissions can be used in multiple random access channel attempts of retransmission to achieve PRACH coverage enhancement.

[0101] In some embodiments, the complex PRACH transmission mentioned in the embodiments of the present application may refer to complex PRACH transmission using the same beam to obtain a signal-to-noise ratio gain by performing repeated transmission of multiple PRACHs on the same beam. In some embodiments, the complex PRACH transmission mentioned in the embodiments of the present application may refer to multiple PRACH transmission using different beams to obtain a diversity gain by performing repeated transmission of multiple PRACHs on different beams.

[0102] It should be noted that the beam mentioned in the embodiments of the present application can be replaced by other terms such as antenna port, spatial filter, spatial parameter, etc., and the meanings expressed by them can be consistent. The embodiments of the present application do not distinguish between them.

[0103] It should be noted that the beam mentioned in the embodiment of the present application may include or be replaced by at least one of the following: beam, physical beam

[0104] (physical beam), logical beam, spatial filter, spatial domain filter, spatial domain transmission filter, spatial domain reception filter, antenna port.

[0105] The embodiments of the present application can be applied to the initial access process or the beam failure recovery process. Taking the initial access process as an example, the embodiments of the present application can be applied to the four-step random access process (i.e., random access process type-1), or can also be applied to the two-step random access process (i.e., random access process type-2), and the embodiments of the present application are not limited to this.

[0106] The method embodiments of the present application are described in detail below with reference to the accompanying drawings. Figure 2 A flow chart of a method in a first node for wireless communication provided in an embodiment of the present application. The method is used for interaction between the first node and the second node.

[0107] As an embodiment, the first node may be a network-controlled repeater (NCR).

[0108] As an embodiment, the first node may be a user equipment, for example, Figure 1 A user device 120 is shown.

[0109] As an embodiment, the first node may be a relay, such as a relay terminal.

[0110] As an embodiment, the second node may be a network device, for example, Figure 2 A network device 110 is shown.

[0111] Figure 2 The method shown includes steps S210 to S240, which are described below.

[0112] In step S210, the first node sends X1 first random access preambles, where X1 is a positive integer.

[0113] The random access preamble (RA preamble) can replace the PRACH preamble mentioned above. The first random access preamble is a random access preamble generated by the first node through a random access sequence.

[0114] In some embodiments, the first random access preamble is a random access preamble sent by the first node in a current random access procedure (also referred to as a random access process). The current random access procedure may also be referred to as a first random access procedure. The first random access procedure may include multiple random access channel attempts (RACH attempts) performed by the first node. The first random access preamble is a preamble sent in the current random access channel attempt.

[0115] As an embodiment, the first random access procedure includes a multiple PRACH initial transmission (ie, the first multiple PRACH transmission) based on a fallback mechanism.

[0116] As an embodiment, the first random access procedure includes multiple PRACH retransmissions based on a fallback mechanism.

[0117] As an embodiment, the first random access procedure does not include multiple PRACH retransmissions based on a fallback mechanism.

[0118] In some embodiments, X1 represents the number of first random access preambles sent by the first node, or the number of first random access preambles sent in the current random access attempt. The number of first random access preambles is equivalent to the number of PRACH transmissions. For example, X1 is equal to 1, and X1 first random access preambles indicate that the first node is currently performing a single PRACH transmission. For another example, X1 is a positive integer greater than 1, and X1 first random access preambles may indicate that the number of PRACH transmissions of the first node currently performing a multiple PRACH transmission is X1. That is, when multiple candidate values ​​of X1 are all greater than 1, the first random access process is a multiple PRACH transmission.

[0119] As an embodiment, X1 is a positive integer greater than 1.

[0120] As an embodiment, X1 is one of {1, 2, 4}, or one of {2, 4}.

[0121] As one implementation, X1 is equal to 2.

[0122] As one implementation, X1 is equal to 4.

[0123] As an embodiment, the X1 first random access preambles are respectively transmitted on X1 physical random access channel opportunities (ROs).

[0124] As an embodiment, the X1 physical random access channel opportunities (ROs) are orthogonal in the time domain.

[0125] As an embodiment, the X1 physical random access channel opportunities (ROs) belong to one ROG.

[0126] As an embodiment, the first node sending X1 first random access preambles belongs to the first random access procedure.

[0127] As an embodiment, the first node sends X1 first random access preambles as an initial random access channel attempt in the first random access process.

[0128] As an embodiment, the first node sends X1 first random access preambles as any random access channel attempt in the first random access process.

[0129] As an embodiment, the first node sends X1 first random access preambles as a random access channel attempt in the first random access process.

[0130] In some embodiments, the X1 first random access preambles belong to a first preamble group sent by the first node. That is, the first preamble group includes X1 first random access preambles. The first preamble group may be any one of a plurality of preamble groups for which the first node performs a multiple PRACH retransmission. Alternatively, the first preamble group may be one of a plurality of preamble groups for which the first node performs a multiple PRACH retransmission.

[0131] In some embodiments, the first preamble group is one of Q preamble groups sent by the first node, where Q is a positive integer.

[0132] As an embodiment, the sending of the Q preamble groups belongs to the first random access process.

[0133] As an embodiment, the X1 first random access preambles belong to one of the Q preamble groups.

[0134] As an embodiment, any preamble group among the Q preamble groups includes X1 random access preambles.

[0135] In some embodiments, the Q preamble groups sent by the first node use the same number of random access preambles, that is, the first node performs Q repeated transmissions of multiple PRACH transmissions based on the same number of PRACH transmissions. For example, the Q preamble groups correspond to Q random access channel attempts sent by the first node based on X1 random access preambles.

[0136] As an embodiment, the X1 first random access preambles are X1 random access preambles included in one preamble group among the Q preamble groups.

[0137] As an embodiment, the Q preamble groups sent by the first node use the same random access preamble. For example, the Q preamble groups all use the first random access preamble.

[0138] As an embodiment, the Q preamble groups sent by the first node use different random access preambles.

[0139] In some embodiments, the first node performs Q transmissions on the Q preamble groups based on a certain transmission order. The transmission of the X1 first random access preambles may be the first transmission of the Q transmissions, or the last transmission, or any transmission in between.

[0140] As an embodiment, the transmission of the X1 first random access preambles belongs to one of the Q transmissions of the Q preamble groups.

[0141] As an embodiment, the Q is configured by higher layer signaling.

[0142] As an embodiment, the higher layer signaling includes at least one of radio resource control (RRC) layer signaling and media access control (MAC) layer signaling.

[0143] In step S220, the first node monitors control signaling of a first random access response within a first time window.

[0144] The first time window may be a time window for monitoring a corresponding random access response (RAR) after the first node sends X1 first random access preambles.

[0145] In some embodiments, the start time of the first time window is associated with X1 physical random access channel opportunities for sending X1 first random access preambles.

[0146] As an embodiment, the last physical random access channel opportunity among the X1 physical random access channel opportunities is used to determine the start of the first time window.

[0147] As an embodiment, the MAC entity may start the first time window at the first physical downlink control channel (PDCCH) timing after the first random access preamble transmission is completed.

[0148] As an embodiment, the first random access procedure includes receiving the first random access response.

[0149] As an embodiment, the first random access procedure includes monitoring control signaling of a first random access response within a first time window. The control signaling of the first random access response may be used to send a random access related indication to the first node. For example, the control signaling of the first random access response is used to indicate Q. For another example, the control signaling of the first random access response is used to indicate determining a first parameter of X2.

[0150] As an embodiment, the control signaling of the first random access response includes downlink control information (DCI).

[0151] As an embodiment, the control signaling of the first random access response is transmitted on the PDCCH.

[0152] The first random access response corresponds to X1 first random access preambles, which means that the first random access response is a random access response sent by the second node for X1 first random access preambles or resources related to X1 first random access preambles, or the first random access response is a response to sending X1 first random access preambles. For example, the first random access response is a random access response sent by the second node for one or more first random access preambles among the X1 first random access preambles. For another example, the random access preamble identity (RAPID) in the first random access response matches the index of the first random access preamble. For another example, at least one of the X1 physical random access channel opportunities is used to scramble the cyclic redundancy check (CRC) of the control signaling of the first random access response.

[0153] As an embodiment, the first random access response is a response to sending a first preamble group.

[0154] For a second node interacting with the first node, after the second node receives X1 first random access preambles, it determines whether to send a first random access response within a first time window. For example, the second node determines whether to send a first random access response based on the reception of X1 first random access preambles. For another example, the second node determines whether to send a control signaling of a first random access response within the first time window.

[0155] As an embodiment, the second node performs reception of X1 first random access preambles, which means that the second node will perform reception of random access preambles, but does not mean that the second node can receive the X1 first random access preambles.

[0156] In some embodiments, the first random access response may include control signaling of the first random access response. As an embodiment, the control signaling of the first random access response may be a PDCCH related to the first random access response.

[0157] In some embodiments, the first random access response further includes a random access preamble identifier. The random access preamble identifier in the first random access response is used by the first node receiving the random access response to perform random access preamble matching.

[0158] As an embodiment, the first random access response includes at least one random access preamble identifier, and the random access preamble identifier included in the first random access response matches the index of the X1 first random access preambles.

[0159] As an embodiment, the first random access response is RAR.

[0160] In step S230 , the first node increments the first counter by X1 and / or increments the second counter by 1.

[0161] The first counter increments at X1, which is equivalent to the first counter incrementing based on the number of random access preambles sent. The number of random access preambles sent is equivalent to the number of PRACH transmissions.

[0162] The second counter incrementing by 1 is equivalent to the first counter incrementing based on the number of transmissions of the complex PRACH transmission. The number of transmissions of the complex PRACH transmission is related to the number of random access channel attempts made by the first node.

[0163] As an embodiment, the initial value of the first counter is set to X1.

[0164] As an embodiment, the initial value of the second counter is set to 1.

[0165] In some embodiments, the first counter and the second counter may be the reuse of traditional counters by the first node, or may be newly set counters, which is not limited here.

[0166] As an embodiment, the first counter may be a newly set PRACH transmission counter, and the second counter may be a traditional preamble transmission counter.

[0167] As an embodiment, the first counter may be a traditional preamble sending counter, and the second counter may be a newly set counter.

[0168] In some embodiments, when the first random access response is not successfully received within the first time window, the first node increments the first counter or the second counter. That is, when the first random access response is not successfully received, the first node may increment the first counter, may increment the second counter, or may increment the first counter and the second counter at the same time.

[0169] In some embodiments, when the first time window expires, the first node does not receive the first random access response corresponding to the first random access preamble, or does not receive the random access response, the first random access response reception is unsuccessful.

[0170] As an embodiment, when the first time window expires, when the first node does not receive the PDCCH transmission on the search space in the serving cell that sends the first random access preamble, reception of the first random access response is unsuccessful.

[0171] As an embodiment, when the first time window expires, if the random access preamble identifier included in the random access response received by the first node does not match the transmitted preamble index, the reception of the first random access response is unsuccessful.

[0172] In step S240, X2 second random access preambles are sent, where X2 is a positive integer greater than or equal to X1.

[0173] In some embodiments, when the first random access response is not successfully received, the first node sends X2 second random access preambles to enhance the coverage performance of PRACH transmission.

[0174] As an embodiment, the first random access procedure includes sending the X2 second random access preambles.

[0175] As an embodiment, the X2 second random access preambles are respectively transmitted on X2 physical random access channel opportunities.

[0176] As an embodiment, the X2 physical random access channel opportunities are orthogonal in the time domain.

[0177] As an embodiment, the X2 second random access preambles are the same as the X1 first random access preambles.

[0178] As an embodiment, the X2 second random access preambles are different from the X1 first random access preambles.

[0179] In some embodiments, the X2 second random access preambles belong to a second preamble group sent by the first node. That is, the second preamble group includes X2 second random access preambles. The second preamble group may be a preamble group located after the first preamble group among multiple preamble groups for which the first node performs complex PRACH retransmission.

[0180] As an embodiment, when X2 is equal to X1, the second preamble group may be one of the Q preamble groups.

[0181] As an embodiment, the sending of the first preamble group and the sending of the second preamble group both belong to the first random access process.

[0182] In some embodiments, after the first node sends X2 second random access preambles, it may monitor the second random access response within the second time window. Figure 4 The flowchart shown is provided for exemplary purposes.

[0183] The second time window may be a time window in which the first node monitors random access responses corresponding to X2 second random access preambles.

[0184] In some embodiments, the start time of the second time window is associated with X1 physical random access channel opportunities for sending X2 second random access preambles.

[0185] As an embodiment, the last physical random access channel opportunity among the X2 physical random access channel opportunities is used to determine the start of the second time window.

[0186] As an embodiment, the MAC entity may start the second time window at the first PDCCH opportunity after the second random access preamble transmission ends.

[0187] As an embodiment, the first random access procedure includes receiving the second random access response.

[0188] As an embodiment, the first random access procedure includes monitoring control signaling of a second random access response within a second time window. The control signaling of the second random access response may be used to send a random access related indication to the first node.

[0189] The second random access response corresponds to X2 second random access preambles, which means that the second random access response is a random access response sent by the second node for the X2 second random access preambles or resources related to the X2 second random access preambles.

[0190] As an embodiment, the second random access response corresponds to the second preamble group.

[0191] After receiving X2 first random access preambles, the second node determines whether to send control signaling of a second random access response within the second time window. For example, the second node determines whether to send control signaling of a first random access response based on the reception of X1 first random access preambles.

[0192] As an embodiment, the second node performs reception of X1 first random access preambles, which means that the second node will perform a receiving action, but does not mean that the second node can receive the X1 first random access preambles.

[0193] In some embodiments, X2 represents the number of second random access preambles sent by the first node. The number of second random access preambles is also equivalent to the number of PRACH transmissions. X2 is a positive integer greater than or equal to X1. It can be seen that X2 is related to X1, or X2 can be determined based on X1. For example, it can be determined whether X2 is greater than X1.

[0194] As an embodiment, X2 is greater than X1.

[0195] As an embodiment, X2 is equal to X1.

[0196] In some embodiments, the multiple candidate integers are values ​​in a candidate set. X1 can be determined based on the multiple candidate integers in the first candidate set, and X2 can be determined based on the multiple candidate integers in the second candidate set. The multiple candidate integers in the first candidate set and the second candidate set can be configured by an upper layer, can be specified by a protocol, or can be determined by the first node based on an instruction from the second node.

[0197] As an embodiment, X2 is one of a plurality of candidate integers.

[0198] In some embodiments, at least one of the multiple candidate integers of X2 is equal to a candidate integer of X1, so as to implement repeated transmission of the same number of PRACH transmissions. Accordingly, at least one of the multiple candidate integers of X2 is greater than the maximum candidate integer of X1, so as to implement a fallback mechanism based on an increase in the number of PRACH transmissions.

[0199] As an embodiment, X1 is one of {1, 2, 4}, and X2 is one of {1, 2, 4, 8}.

[0200] As an embodiment, X1 is one of {1, 2, 4}, and X2 is one of {2, 4, 8}.

[0201] As an embodiment, X1 is one of {2, 4}, and X2 is one of {2, 4, 8}.

[0202] As an embodiment, X1 is one of {2, 4}, and X2 is one of {4, 8}.

[0203] As an embodiment, X1 is equal to 2, and X2 is equal to 2.

[0204] As an embodiment, X1 is equal to 4, and X2 is equal to 4.

[0205] As an embodiment, X1 is equal to 2, and X2 is equal to 4.

[0206] As an embodiment, X1 is equal to 4, and X2 is equal to 8.

[0207] As an embodiment, X1 and X2 may be determined by the same candidate set. That is, the multiple candidate integers in the first candidate set and the second candidate set are the same. X2 is an integer in the candidate set that is greater than or equal to X1.

[0208] In some embodiments, any integer among the multiple candidate integers of X2 is not less than X1. That is, any integer among the multiple candidate integers of X2 may be greater than X1 or may be equal to X1. For example, at least one of the multiple candidate integers of X2 is greater than X1. For another example, all candidate integers of X2 are greater than X1. For another example, one of the multiple candidate integers of X2 is equal to X1.

[0209] As an embodiment, any integer among the multiple candidate integers of X2 is not less than X1 includes any integer among the multiple candidate integers is greater than X1.

[0210] As an embodiment, any integer among the multiple candidate integers of X2 is not less than X1, including one candidate integer among the multiple candidate integers being equal to X1.

[0211] In some embodiments, X2 can be determined according to the first parameter, or according to the value of the first counter and / or the second counter, or according to the first parameter and the value of the first / second counter. The first / second counter can determine X2 according to the corresponding threshold. That is, the first parameter is used to determine X2; or, whether the first counter is greater than a first threshold is used to determine X2, and the first threshold is a positive integer greater than 1; or, whether the second counter is greater than a second threshold is used to determine X2, and the second threshold is a positive integer; or, whether the first counter is greater than the first threshold and whether the second counter is greater than the second threshold are used together to determine X2.

[0212] In some embodiments, the first node may obtain the first parameter in a variety of ways. For example, the first parameter may be configured by the highest layer signaling. For another example, the control signaling of the first random access response sent by the second node is used to indicate the first parameter. For another example, the control signaling of the third random access response sent by the second node is used to indicate the first parameter. For another example, the third random access response sent by the second node is used to indicate the first parameter.

[0213] The third random access response is a random access response received by the first node in the first random access procedure. In some embodiments, the third random access response includes at least one random access preamble identifier, and any random access preamble identifier of the at least one random access preamble identifier does not match the preamble index corresponding to the X1 first random access preambles. That is, the third random access response is not a random access response corresponding to the X1 first random access preambles.

[0214] As an embodiment, the time when the first node receives the third random access response is within the first time window.

[0215] As an embodiment, the time when the first node receives the third random access response is outside the first time window.

[0216] In some embodiments, the third random access response may be used to indicate relevant parameters for the first node to perform random access.

[0217] As an embodiment, the third random access response is used to indicate the Q of the Q preamble groups.

[0218] As an embodiment, the third random access is used to indicate a fallback indication for the first node to perform random access.

[0219] For ease of understanding, the following Figure 3 A method for determining X2 according to the first parameter is exemplified. Figure 3 for Figure 2 A possible implementation of step S240 in FIG.

[0220] See also Figure 3 In step S310, the first node determines a first parameter according to control signaling of the first random access response or the third random access response or control signaling of the third random access response.

[0221] In step S320, the first node determines X2 according to the first parameter.

[0222] In step S330, the first node sends X2 second random access preambles.

[0223] In some embodiments, the first parameter is determined based on multiple candidate integers of X2. For example, the first parameter can be used as a random factor to determine the number of PRACH transmissions for the first node to perform complex PRACH retransmissions based on the second random access preamble. The random factor is used to indicate that the first node randomly selects a candidate number from multiple candidate integers of X2 as X2. For another example, the first parameter can directly indicate the value of X2 from multiple candidate integers of X2.

[0224] In some embodiments, the first parameter is randomly selected from a plurality of candidate integers for X2.

[0225] As an embodiment, the multiple candidate integers include at least one of {2, 4, 8}.

[0226] As an example, when the number of PRACH transmissions in the previous multiple PRACH transmission (first random access preamble) is 2, the first node can randomly select a candidate number from {2, 4} as the number of PRACH transmissions in the next multiple PRACH transmission (second random access preamble), or the first node can randomly select a candidate number from {2, 4, 8} as the number of PRACH transmissions in the next multiple PRACH transmission.

[0227] As another example, when the number of PRACH transmissions in the previous multiple PRACH transmission is 4, the first node may randomly select a candidate number from {4, 8} as the number of PRACH transmissions in the next multiple PRACH transmission.

[0228] As an embodiment, the first parameter is selected as the X2.

[0229] In some embodiments, the multiple candidate integers of X2 are configured by higher layer signaling. For example, the system may configure the candidate numbers of PRACH transmission of the first node in the complex PRACH transmission to include {2, 4, 8}.

[0230] As an embodiment, the multiple candidate integers are configurable.

[0231] As an embodiment, the multiple candidate integers are preconfigured.

[0232] In some embodiments, the higher layer signaling may include signaling of an upper layer indication relative to the physical layer. For example, the higher layer signaling may be RRC layer signaling or MAC layer signaling.

[0233] As an embodiment, the multiple candidate integers are configured by RRC layer signaling.

[0234] As an embodiment, the multiple candidate integers are configured by MAC layer signaling.

[0235] For ease of understanding, the following Figure 4 Another method for determining X2 according to the first parameter is exemplified. Figure 4 for Figure 2 Another possible implementation of step S240.

[0236] See also Figure 4 In step S410, the first node randomly selects a first parameter from multiple candidate integers of X2.

[0237] In step S420, the first parameter is equal to X2, and X2 is determined according to the first parameter.

[0238] In step S430, the first node sends X2 second random access preambles.

[0239] In some embodiments, determining X2 includes determining a value of X2 and also includes determining a magnitude relationship between X2 and X1.

[0240] As an embodiment, the first parameter is used to determine X2 includes X2 being equal to the first parameter, or the first parameter is an index of X2 in a plurality of candidate integers. As described above, the first parameter may be selected as X2.

[0241] As an embodiment, the first parameter may be one of {1, 2, 3, 4}. When the multiple candidate integers of X2 are {1, 2, 4, 8}, each value in {1, 2, 3, 4} corresponds to a candidate integer. The value selected by the first parameter from the set {1, 2, 3, 4} may be used as an index of the multiple candidate integers of X2 to determine the value of X2. For example, when the first parameter is 3, X2 is 4.

[0242] In some embodiments, the first parameter may be used to determine whether X2 is greater than X1. For example, the first parameter may indicate that X2 is equal to X1, that is, the number of transmitted second random access preambles is the same as the number of transmitted first random access preambles. For another example, the first parameter may indicate that X2 is greater than X1 to improve coverage performance by increasing the number of PRACH transmissions.

[0243] As an embodiment, the first parameter may be used as a repetition factor for determining whether X2 is greater than X1. The first parameter used as the repetition factor is configured by a higher layer, or the first parameter may be one of a plurality of candidate repetition factors.

[0244] As an embodiment, the first parameter is one of {1, 2, 3, 4}. The first node randomly selects one from {1, 2, 3, 4} as the repetition factor.

[0245] As an embodiment, when the first parameter selects 1 from {1, 2, 3, 4} as the repetition factor, X2 is greater than X1.

[0246] As an embodiment, when the first parameter selects 3 in {1, 2, 3, 4} as the repetition factor, when the number of times X1 random access preambles are sent is less than 3, X2 is equal to X1; when the number of times X1 random access preambles are sent is equal to 3, X2 is greater than X1.

[0247] As an example, when the candidate number of PRACH transmissions in the system configuration complex PRACH transmission includes {2, 4, 8}, when the number of PRACH transmissions in the initial complex PRACH transmission is 2 and the repetition factor is equal to 1, the number of PRACH transmissions in the next complex PRACH transmission is 4 or 8; when the number of PRACH transmissions in the initial complex PRACH transmission is 2 and the repetition factor is equal to X, the complex PRACH transmission with the number of PRACH transmissions of 2 is repeated X times, and then the number of PRACH transmissions in the complex PRACH transmission is adjusted.

[0248] In some embodiments, X2 is determined according to the order in which the first preamble group is sent among the Q preamble groups. That is, the position of the first preamble group in the Q transmissions among the Q preamble groups is used to determine X2.

[0249] As an embodiment, when the transmission of the first preamble group is the last transmission among the Q transmissions of the Q preamble groups, the X2 is greater than the X1; when the transmission of the first preamble group is any transmission among the Q transmissions of the Q preamble groups except the last transmission, the X2 is equal to the X1.

[0250] In some embodiments, the position of the transmission of the first preamble group among the Q transmissions of the Q preamble groups and the first parameter are used together to determine the X2.

[0251] As an embodiment, when the transmission of the first preamble group is the last transmission among the Q transmissions of the Q preamble groups, the X2 is equal to the first parameter; when the transmission of the first preamble group is any transmission among the Q transmissions of the Q preamble groups except the last transmission, the X2 is equal to the X1.

[0252] For ease of understanding, the following Figure 5 The sending order of multiple preamble groups in the complex PRACH retransmission shown exemplifies a method for determining X2. Figure 5 yes Figure 2 A schematic diagram of a possible implementation method of step S240 in FIG.

[0253] like Figure 5 As shown, the Q preamble groups include a plurality of preamble groups 510 of any transmission except the last transmission and the last transmission preamble group 520. When the first preamble group is the preamble group 510, X2 is equal to X1. In this case, the same number of PRACH transmissions as the previous one is used in the next PRACH transmission. When the first preamble group is the preamble group 520, X2 is greater than X1. In this case, the number of PRACH transmissions of the complex PRACH transmission is adjusted.

[0254] In some embodiments, X2 may also be determined based on the relationship between the first counter and / or the second counter and the corresponding threshold value. For example, when the first counter is greater than the first threshold value, and / or when the second counter is greater than the second threshold value, X2 is greater than X1.

[0255] As an embodiment, the first counter being greater than the first threshold includes the first counter being equal to the sum of the first threshold and the X1.

[0256] As an embodiment, the second counter being greater than the second threshold includes the second counter being equal to the sum of the second threshold plus 1.

[0257] As an embodiment, when the first counter is greater than the first threshold, X2 is a multiple of X1; when the first counter is not greater than the first threshold, X2 is equal to X1. It should be noted that X2 being a multiple of X1 does not include X2 being equal to X1. That is, when X2 is a multiple of X1, the multiple is a positive integer greater than 1.

[0258] For ease of understanding, the following Figure 6 A method for determining X2 according to the first counter and the first threshold is exemplarily described. Figure 6 for Figure 2 Another possible implementation of step S240.

[0259] See also Figure 6 In step S610, the first node determines whether the first counter is greater than a first threshold. If the first counter is greater than the first threshold, step S620 is executed; if the first counter is not greater than the first threshold, step S630 is executed.

[0260] In step S620, X2 is a multiple of X1, and the first node determines X2.

[0261] In step S630, X2 is equal to X1, and the first node determines X2.

[0262] In step S640, the first node sends X2 second random access preambles.

[0263] As an embodiment, when the second counter is greater than the second threshold, X2 is a multiple of X1; when the second counter is not greater than the second threshold, X2 is equal to X1.

[0264] For ease of understanding, the following Figure 7 The method of determining X2 according to the second counter and the second threshold is exemplified. Figure 7 for Figure 2 Another possible implementation of step S240.

[0265] See also Figure 7 In step S710, the first node determines whether the second counter is greater than a second threshold. If the second counter is greater than the second threshold, step S720 is executed; if the second counter is not greater than the second threshold, step S730 is executed.

[0266] Steps S720 to S740 and Figure 6 Steps S620 to S640 are the same and will not be repeated here.

[0267] As an embodiment, when X1 is 2, X2 is twice as much as X1, or may be four times as much as X1.

[0268] In some embodiments, X2 can be determined based on the first counter or the second counter and the first parameter. For example, X2 can determine whether to increase based on X1 based on the relationship between the first counter or the second counter and the corresponding threshold, and then determine the value of X2 based on the first parameter.

[0269] As an embodiment, when the first counter is greater than the first threshold, the first parameter is used to determine the X2; when the first counter is not greater than the first threshold, the X2 is equal to the X1.

[0270] As an embodiment, when the second counter is greater than the second threshold, the first parameter is used to determine the X2; when the second counter is not greater than the second threshold, the X2 is equal to the X1.

[0271] As an embodiment, when the first node determines X2 through two counters, when the first counter is greater than the first threshold or the second counter is greater than the second threshold, the first parameter is used to determine X2; when the first counter is not greater than the first threshold and the second counter is not greater than the second threshold, X2 is equal to X1.

[0272] As an embodiment, when the first counter is greater than the first threshold or the second counter is greater than the second threshold, the first parameter is used to determine a multiple of X2 relative to X1.

[0273] For ease of understanding, the following Figure 8 A method of determining X2 according to the first / second counter and the first parameter is exemplarily described. Figure 8 for Figure 2 Another possible implementation of step S240.

[0274] See also Figure 8In step S810, the first node determines whether the first counter is greater than the first threshold or the second counter is greater than the second threshold. If the first counter is greater than the first threshold or the second counter is greater than the second threshold, step S820 is executed; if the first counter is not greater than the first threshold and the second counter is not greater than the second threshold, step S830 is executed.

[0275] In step S820, X2 is determined according to the first parameter.

[0276] Step S830 and step S840 are Figure 6 Step S630 is consistent with step S640 and will not be described in detail here.

[0277] In some embodiments, the first threshold is configured by higher layer signaling, or the second threshold is configured by higher layer signaling, or both the first threshold and the second threshold are configured by higher layer signaling.

[0278] As an embodiment, the first threshold is configurable.

[0279] As an embodiment, the first threshold is preconfigured.

[0280] As an embodiment, the second threshold is configurable.

[0281] As an embodiment, the second threshold is preconfigured.

[0282] In some embodiments, the first threshold is compared with the value of the first counter to determine X2. The first counter counts up based on the number of random access preambles sent, so the first threshold should be (pre)configured taking into account the superposition of the number of PRACH transmissions in multiple random access channel attempts.

[0283] As an embodiment, the first threshold is no greater than 32.

[0284] As an embodiment, the first threshold is not greater than 100.

[0285] In some implementations, the second threshold is compared with the value of the second counter to determine X2. The second counter counts up based on 1, that is, the second counter increases by 1 each time a random access preamble is sent, so the second threshold is (pre)configured mainly based on the number of random access channel attempts.

[0286] As an embodiment, the second threshold is no greater than 32.

[0287] As an embodiment, the second threshold is one of {1, 2, 3, 4}.

[0288] In some embodiments, the first parameter may also be used to determine the first threshold, or the second threshold, or the first threshold and the second threshold. That is, the first parameter may be used to determine a threshold of the number of PRACH transmissions accumulated from multiple random access channel attempts, or may be used to determine the number of random access channel attempts.

[0289] As an embodiment, the first parameter is a backoff indicator (BI).

[0290] As an embodiment, the first parameter may reuse the backoff indication in the RAR. The backoff indication is reinterpreted as the number of repeated transmissions of the complex PRACH transmission, that is, the number of repeated transmissions of the complex PRACH transmission with the same number of PRACH transmissions is the value of the backoff indication.

[0291] As an embodiment, when reusing the backoff indication in the RAR, the product of the backoff indication and a proportional factor is reinterpreted as the number of repeated transmissions of the complex PRACH transmission, that is, the number of repeated transmissions of the complex PRACH transmission with the same number of PRACH transmissions is the product of the value of the backoff indication and the general proportional factor.

[0292] For ease of understanding, the following Fig. 9 A method for determining the first threshold or the second threshold according to the first parameter and then determining X2 according to the threshold and the counter is described. Fig. 9 for Figure 2 Another possible implementation of step S240.

[0293] See also Fig. 9 , in step S910, the first node determines a first threshold and / or a second threshold according to a first parameter.

[0294] In step S920, the first node determines X2 according to the first counter and / or the second counter. Figure 6 or Figure 7 .

[0295] In step S930, the first node sends X2 second random access preambles.

[0296] It should be noted that, in the embodiment of the present application, when different methods are used to determine X2, the first parameter can represent different parameter types. For example, the first parameter can represent a random factor for randomly selecting X2. For another example, the first parameter can be used as a repetition factor to determine whether X2 is greater than X1. For another example, the first parameter can be used as a fallback indication for reuse. When a combination of multiple methods is used to determine X2, different parameter types can be represented by different parameters.

[0297] As an embodiment, the first parameter is one of a plurality of non-negative integers. For example, when the first parameter is used as a fallback indication, the first parameter is any value between 0 and the upper limit of the index in the fallback parameter table.

[0298] As an embodiment, the first threshold is one of a plurality of first-category thresholds, and the first parameter is an index of the first threshold among the plurality of first-category thresholds.

[0299] As an embodiment, a plurality of first-type thresholds constitute a set of first-type thresholds. The plurality of first-type thresholds are used to limit the cumulative number of PRACH transmissions for PRACH retransmissions.

[0300] As an embodiment, multiple first-type thresholds are used to indicate a cumulative upper limit on the number of PRACH transmissions.

[0301] As an embodiment, the multiple first-category thresholds are respectively multiple positive integers.

[0302] As an embodiment, the plurality of first-category thresholds are respectively products of a plurality of positive integers and a first proportional factor.

[0303] As an embodiment, when the product of the multiple positive integers and the first proportional factor is not an integer, the product result may be rounded down or rounded up to determine the multiple first-category thresholds.

[0304] As an implementation, the first scaling factor is one of {0, 0.5, 1}.

[0305] As an embodiment, the first parameter is the index of the first threshold in the first type of threshold, that is, the first threshold can determine the upper limit of the corresponding PRACH transmission number according to the index value of the first parameter.

[0306] As an embodiment, the second threshold is one of a plurality of second-category thresholds, and the first parameter is the index of the second threshold among the plurality of second-category thresholds.

[0307] As an embodiment, a plurality of second-type thresholds constitute a set of second thresholds. The plurality of second-type thresholds are used to limit the cumulative number of PRACH transmissions for PRACH retransmissions.

[0308] As an embodiment, the plurality of second-category thresholds are respectively a plurality of positive integers.

[0309] As an embodiment, the plurality of second-type thresholds are respectively products of a plurality of positive integers and a first proportional factor.

[0310] As an embodiment, when the product of the multiple positive integers and the first proportional factor is not an integer, the product result may be rounded down or rounded up to determine the multiple first-category thresholds.

[0311] As an example, when the multiple second-type thresholds are positive integers and the first parameter is the index of the second threshold in the multiple second-type thresholds, the corresponding relationship between the multiple second-type thresholds and the first parameter is shown in Table 1.

[0312] Table 1

[0313]

[0314] Taking Table 1 as an example, assuming that the number of candidates for PRACH transmission in the system configuration complex PRACH transmission includes {2, 4, 8}, when the first parameter used as the fallback indication is 3, the corresponding second threshold is 4. If X1 is 2, when the second counter is less than or equal to 4, X2 is equal to 2; when the second counter is greater than 4, X2 is equal to 4 or equal to 8.

[0315] As an example, when the multiple second-class thresholds are products of multiple positive integers and the first proportional factor, and the first parameter is the index of the second threshold in the multiple second-class thresholds, the corresponding relationship between the multiple second-class thresholds and the first parameter is shown in Table 2.

[0316] Table 2

[0317]

[0318]

[0319] Taking Table 2 as an example, assuming that the number of candidates for PRACH transmission in the system configuration complex PRACH transmission includes {2, 4, 8}, when the first parameter used as the fallback indication is 3, the corresponding second threshold is 8. If X1 is 2, when the second counter is less than or equal to 8, X2 is equal to 2; when the second counter is greater than 8, X2 is equal to 4 or equal to 8.

[0320] Still taking Table 2 as an example, when the second type of thresholds are respectively the products of multiple positive integers and the first proportional factor, the number of transmission times of complex PRACH transmissions with the same number of PRACH transmissions will change with the change of the first proportional factor.

[0321] As an example, when the first scaling factor is 0, multiple PRACH transmissions with the same number of PRACH transmissions are not repeatedly transmitted, that is, in one random access channel attempt, the number of PRACH transmissions in the multiple PRACH transmissions is adjusted.

[0322] As an example, when the first scaling factor is 0.5 and the value of the backoff indication is 4 (index is 1), a complex PRACH transmission with the same number of PRACH transmissions is sent a total of 4×0.5=2 times.

[0323] As an example, when the scaling factor is 1, and the value of the backoff indication is 4 (index is 1), a complex PRACH transmission with the same number of PRACH transmissions is sent a total of 4×1=4 times.

[0324] Depend on Figures 2 to 9 It can be seen that in the embodiment of the present application, the first node can determine the number of transmissions when repeatedly sending multiple PRACH transmissions by using the first parameter or the first / second counter. It should be understood that Figures 3 to 9 When multiple first nodes use any one or more of the above methods, different first nodes can adjust to different numbers of PRACH transmissions when repeatedly sending multiple PRACH transmissions, thereby using separate PRACH resources to avoid or reduce the re-conflict of multiple PRACH transmissions.

[0325] Combined with the previous article Figures 2 to 9 Several methods for determining X2 are introduced. Fig.10 The schematic diagram of the interaction between the first node and the second node shown illustrates a possible implementation method of the embodiment of the present application.

[0326] See also Fig.10 , in step S1010, the first node sends X1 first random access preambles to the second node.

[0327] In step S1020, the second node performs reception of X1 first random access preambles.

[0328] In step S1030, the first node monitors control signaling of a first random access response within a first time window.

[0329] In step S1040, the second node sends a third random access response to the first node.

[0330] In step S1050, the first node sends X2 second random access preambles. X2 may be determined according to the first parameter indicated by the control signaling of the third random access response or the first random access response.

[0331] In step S1060, the second node performs reception of X2 second random access preambles.

[0332] In step S1070, the first node monitors the control signaling of the second random access response within the second time window.

[0333] In some embodiments, the first node may also determine, based on the first information, whether to enable or disable a function of repeatedly sending multiple PRACH transmissions with the same number of PRACHs, so as to reduce resource consumption of the random access procedure.

[0334] As an embodiment, the first node receives first information, where the first information is used to indicate whether to enable Q transmissions of the Q preamble groups.

[0335] As an embodiment, the first information is used to indicate whether to disable Q transmissions of the Q preamble groups.

[0336] As an embodiment, the first information is configured by higher layer signaling.

[0337] As an embodiment, the first information is indicated by whether the second parameter is 0.

[0338] As an embodiment, the second parameter is the first scaling factor mentioned above. By configuring the value of the first scaling factor to be 0 or non-0, it is controlled whether the function of repeatedly sending multiple PRACH transmissions with the same number of PRACHs is invalid.

[0339] Combination of the above Figures 1 to 10 , describes the method embodiment of the present application in detail, and the following is combined with Figures 11 to 14 , describes the device embodiment of the present application in detail. It should be understood that the description of the method embodiment corresponds to the description of the device embodiment, so the parts not described in detail can refer to the previous method embodiment.

[0340] Fig.11 A first node for wireless communication provided in an embodiment of the present application. Fig.11 As shown, the first node 1100 includes a first transmitter 1110 , a first receiver 1120 , a first processor 1130 , and a second transmitter 1140 .

[0341] The first transmitter 1110 may be configured to send X1 first random access preambles, where X1 is a positive integer;

[0342] A first receiver 1120, configured to monitor control signaling of a first random access response within a first time window, the first random access response corresponding to the X1 first random access preambles;

[0343] The first processor 1130 may be configured to increment the first counter by the X1 and / or increment the second counter by 1;

[0344] The second transmitter 1140 is used to send X2 second random access preambles, where X2 is a positive integer greater than or equal to X1; wherein a first parameter is used to determine the X2; or, whether the first counter is greater than a first threshold is used to determine the X2, and the first threshold is a positive integer greater than 1; or, whether the second counter is greater than a second threshold is used to determine the X2, and the second threshold is a positive integer; or, whether the first counter is greater than the first threshold and whether the second counter is greater than the second threshold are jointly used to determine the X2.

[0345] As an embodiment, the first receiver 1120 is further configured to monitor control signaling of a second random access response within a second time window; wherein the second random access response corresponds to the X2 second random access preambles.

[0346] As an embodiment, the first receiver 1120 is also used to receive a third random access response, the third random access response including at least one random access preamble identifier, and any random access preamble identifier of the at least one random access preamble identifier included in the third random access response does not match the preamble index corresponding to the X1 first random access preambles.

[0347] As an embodiment, the control signaling of the first random access response or the control signaling of the third random access response or the third random access response is used to indicate the first parameter.

[0348] As an embodiment, X2 is one of a plurality of candidate integers, and any integer among the plurality of candidate integers is not less than X1; X2 is equal to the first parameter, and the first parameter is randomly selected from the plurality of candidate integers, and the plurality of candidate integers are configured by higher layer signaling.

[0349] As an embodiment, X2 is one of a plurality of candidate integers, and any integer among the plurality of candidate integers is not less than X1; the first parameter is used to determine X2, including X2 being equal to the first parameter, or the first parameter is the index of X2 in the plurality of candidate integers.

[0350] As an embodiment, when the first counter is greater than the first threshold, X2 is a multiple of X1; when the first counter is not greater than the first threshold, X2 is equal to X1.

[0351] As an embodiment, when the second counter is greater than the second threshold, X2 is a multiple of X1; when the second counter is not greater than the second threshold, X2 is equal to X1.

[0352] As an embodiment, when the first counter is greater than the first threshold or the second counter is greater than the second threshold, the first parameter is used to determine the X2; when the first counter is not greater than the first threshold or the second counter is not greater than the second threshold, the X2 is equal to the X1.

[0353] As an embodiment, the first threshold is configured by higher layer signaling, or the second threshold is configured by higher layer signaling, or both the first threshold and the second threshold are configured by higher layer signaling.

[0354] As an embodiment, the first parameter is used to determine the first threshold, or the second threshold, or the first threshold and the second threshold.

[0355] As an embodiment, the first transmitter 1110, the first receiver 1120, and the second transmitter 1140 may all be transceivers 1330, and the first processor 1130 may be the processor 1310. The second node 1100 may further include a memory 1320, specifically, Fig.13 shown.

[0356] Fig.12 A second node for wireless communication provided in an embodiment of the present application. Fig.12 As shown, the second node 1200 includes a second receiver 1210 , a second processor 1220 , and a third receiver 1230 .

[0357] The second receiver 1210 may be configured to receive X1 first random access preambles, where X1 is a positive integer;

[0358] The second processor 1220 is configured to determine whether to send control signaling of a first random access response within a first time window, where the first random access response corresponds to the X1 first random access preambles;

[0359] The third receiver 1230 is used to perform reception of X2 second random access preambles, where X2 is a positive integer greater than or equal to X1; wherein a first parameter is used to determine X2; or, whether a first counter of a first node that sends the X1 first random access preambles is greater than a first threshold is used to determine X2, and the first threshold is a positive integer greater than 1; or, whether a second counter of a first node that sends the X1 first random access preambles is greater than a second threshold is used to determine X2, and the second threshold is a positive integer; or, whether the first counter of a first node that sends the X1 first random access preambles is greater than the first threshold and whether the second counter of the first node is greater than the second threshold are jointly used to determine X2.

[0360] As an embodiment, the second processor 1220 is further configured to determine whether to send control signaling of a second random access response within a second time window; wherein the second random access response corresponds to the X2 second random access preambles.

[0361] As an embodiment, the second node 1200 also includes a third transmitter, which can be used to send a third random access response, wherein the third random access response includes at least one random access preamble identifier, and any random access preamble identifier of the at least one random access preamble identifier included in the third random access response does not match the preamble index corresponding to the X1 first random access preambles.

[0362] As an embodiment, the control signaling of the first random access response or the control signaling of the third random access response or the third random access response is used to indicate the first parameter.

[0363] As an embodiment, X2 is one of a plurality of candidate integers, and any integer among the plurality of candidate integers is not less than X1; X2 is equal to the first parameter, and the first parameter is randomly selected from the plurality of candidate integers, and the plurality of candidate integers are configured by higher layer signaling.

[0364] As an embodiment, X2 is one of a plurality of candidate integers, and any integer among the plurality of candidate integers is not less than X1; the first parameter is used to determine X2, including X2 being equal to the first parameter, or the first parameter is the index of X2 in the plurality of candidate integers.

[0365] As an embodiment, when the first counter is greater than the first threshold, X2 is a multiple of X1; when the first counter is not greater than the first threshold, X2 is equal to X1.

[0366] As an embodiment, when the second counter is greater than the second threshold, X2 is a multiple of X1; when the second counter is not greater than the second threshold, X2 is equal to X1.

[0367] As an embodiment, when the first counter is greater than the first threshold or the second counter is greater than the second threshold, the first parameter is used to determine the X2; when the first counter is not greater than the first threshold or the second counter is not greater than the second threshold, the X2 is equal to the X1.

[0368] As an embodiment, the first threshold is configured by higher layer signaling, or the second threshold is configured by higher layer signaling, or both the first threshold and the second threshold are configured by higher layer signaling.

[0369] As an embodiment, the first parameter is used to determine the first threshold, or the second threshold, or the first threshold and the second threshold.

[0370] As an embodiment, the second receiver 1210 and the third receiver 1230 may be transceivers 1330, and the second processor 1220 may be processor 1310. The second node 1200 may further include a memory 1320, specifically, Fig.13 shown.

[0371] Fig.13 It is a schematic structural diagram of a communication device according to an embodiment of the present application. Fig.13 The dotted line in the figure indicates that the unit or module is optional. The device 1300 can be used to implement the method described in the above method embodiment. The device 1300 can be a chip, a user equipment or a network device.

[0372] The device 1300 may include one or more processors 1310. The processor 1310 may support the device 1300 to implement the method described in the method embodiment above. The processor 1310 may be a general-purpose processor or a special-purpose processor. For example, the processor may be a central processing unit (CPU). Alternatively, the processor may also be other general-purpose processors, digital signal processors (DSP), application specific integrated circuits (ASIC), field programmable gate arrays (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, etc. A general-purpose processor may be a microprocessor or the processor may also be any conventional processor, etc.

[0373] The apparatus 1300 may further include one or more memories 1320. The memory 1320 stores a program, which can be executed by the processor 1310, so that the processor 1310 executes the method described in the above method embodiment. The memory 1320 may be independent of the processor 1310 or integrated in the processor 1310.

[0374] The apparatus 1300 may further include a transceiver 1330. The processor 1310 may communicate with other devices or chips through the transceiver 1330. For example, the processor 1310 may transmit and receive data with other devices or chips through the transceiver 1330.

[0375] Fig.14A schematic diagram of the hardware modules of a communication device provided in an embodiment of the present application. Specifically, Fig.14 A block diagram is shown of a first communication device 1450 and a second communication device 1410 communicating with each other in an access network.

[0376] The first communication device 1450 includes a controller / processor 1459, a memory 1460, a data source 1467, a transmit processor 1468, a receive processor 1456, a multi-antenna transmit processor 1457, a multi-antenna receive processor 1458, a transmitter / receiver 1454 and an antenna 1452.

[0377] The second communication device 1410 includes a controller / processor 1475, a memory 1476, a data source 1477, a receive processor 1470, a transmit processor 1416, a multi-antenna receive processor 1472, a multi-antenna transmit processor 1471, a transmitter / receiver 1418 and an antenna 1420.

[0378] In the transmission from the second communication device 1410 to the first communication device 1450, at the second communication device 1410, the upper layer data packets from the core network or the upper layer data packets from the data source 1477 are provided to the controller / processor 1475. The core network and the data source 1477 represent all the protocol layers above the L2 layer. The controller / processor 1475 implements the functionality of the L2 layer. In the transmission from the second communication device 1410 to the first communication device 1450, the controller / processor 1475 provides header compression, encryption, packet segmentation and reordering, multiplexing between logical and transport channels, and allocation of radio resources to the first communication device 1450 based on various priority metrics. The controller / processor 1475 is also responsible for the retransmission of lost packets and signaling to the first communication device 1450. The transmit processor 1416 and the multi-antenna transmit processor 1471 implement various signal processing functions for the L1 layer (i.e., the physical layer). The transmit processor 1416 implements coding and interleaving to facilitate forward error correction at the second communication device 1410, as well as mapping of signal constellations based on various modulation schemes (e.g., binary phase shift keying, quadrature phase shift keying, M phase shift keying, M quadrature amplitude modulation). The multi-antenna transmit processor 1471 performs digital spatial precoding, including codebook-based precoding and non-codebook-based precoding, and beamforming processing on the coded and modulated symbols to generate one or more spatial streams. The transmit processor 1416 then maps each spatial stream to a subcarrier, multiplexes with a reference signal (e.g., a pilot) in the time domain and / or frequency domain, and then uses an inverse fast Fourier transform to generate a physical channel carrying a time domain multi-carrier symbol stream. The multi-antenna transmit processor 1471 then performs a transmit analog precoding / beamforming operation on the time domain multi-carrier symbol stream. Each transmitter 1418 converts the baseband multi-carrier symbol stream provided by the multi-antenna transmit processor 1471 into a radio frequency stream, and then provides it to a different antenna 1420 .

[0379] In the transmission from the second communication device 1410 to the first communication device 1450, at the first communication device 1450, each receiver 1454 receives a signal through its corresponding antenna 1452. Each receiver 1454 recovers the information modulated onto the radio frequency carrier and converts the radio frequency stream into a baseband multi-carrier symbol stream and provides it to the receiving processor 1456. The receiving processor 1456 and the multi-antenna receiving processor 1458 implement various signal processing functions of the L1 layer. The multi-antenna receiving processor 1458 performs a receiving analog precoding / beamforming operation on the baseband multi-carrier symbol stream from the receiver 1454. The receiving processor 1456 uses a fast Fourier transform to convert the baseband multi-carrier symbol stream after the receiving analog precoding / beamforming operation from the time domain to the frequency domain. In the frequency domain, the physical layer data signal and the reference signal are demultiplexed by the receiving processor 1456, wherein the reference signal will be used for channel estimation, and the data signal is recovered after multi-antenna detection in the multi-antenna receiving processor 1458 to any spatial stream with the first communication device 1450 as the destination. The symbols on each spatial stream are demodulated and recovered in the receiving processor 1456, and soft decisions are generated. The receiving processor 1456 then decodes and deinterleaves the soft decisions to recover the upper layer data and control signals transmitted by the second communication device 1410 on the physical channel. The upper layer data and control signals are then provided to the controller / processor 1459. The controller / processor 1459 implements the functions of the L2 layer. The controller / processor 1459 may be associated with a memory 1460 that stores program codes and data. The memory 1460 may be referred to as a computer-readable medium. In the transmission from the second communication device 1410 to the first communication device 1450, the controller / processor 1459 provides multiplexing between transport and logical channels, packet reassembly, decryption, header decompression, control signal processing to recover the upper layer data packets from the second communication device 1410. The upper layer data packets are then provided to all protocol layers above the L2 layer. Various control signals may also be provided to the L3 for L3 processing.

[0380] In the transmission from the first communication device 1450 to the second communication device 1410, at the first communication device 1450, the upper layer data packets are provided to the controller / processor 1459 using the data source 1467. The data source 1467 represents all the protocol layers above the L2 layer. Similar to the transmission function at the second communication device 1410 described in the transmission from the second communication device 1410 to the first communication device 1450, the controller / processor 1459 implements header compression, encryption, packet segmentation and reordering, and multiplexing between logical and transport channels, and implements L2 layer functions for user plane and control plane. The controller / processor 1459 is also responsible for the retransmission of lost packets and signaling to the second communication device 1410. The transmit processor 1468 performs modulation mapping and channel coding processing, and the multi-antenna transmit processor 1457 performs digital multi-antenna spatial precoding, including codebook-based precoding and non-codebook-based precoding, and beamforming processing. Then, the transmit processor 1468 modulates the generated spatial stream into a multi-carrier / single-carrier symbol stream, which is then provided to different antennas 1452 via the transmitter 1454 after analog precoding / beamforming operations in the multi-antenna transmit processor 1457. Each transmitter 1454 first converts the baseband symbol stream provided by the multi-antenna transmit processor 1457 into a radio frequency symbol stream, and then provides it to the antenna 1452.

[0381] In the transmission from the first communication device 1450 to the second communication device 1410, the function at the second communication device 1410 is similar to the reception function at the first communication device 1450 described in the transmission from the second communication device 1410 to the first communication device 1450. Each receiver 1418 receives a radio frequency signal through its corresponding antenna 1420, converts the received radio frequency signal into a baseband signal, and provides the baseband signal to a multi-antenna reception processor 1472 and a reception processor 1470. The reception processor 1470 and the multi-antenna reception processor 1472 jointly implement the functions of the L1 layer. The controller / processor 1475 implements the L2 layer functions. The controller / processor 1475 may be associated with a memory 1476 that stores program codes and data. The memory 1476 may be referred to as a computer-readable medium. In transmission from the first communication device 1450 to the second communication device 1410, the controller / processor 1475 provides demultiplexing between transport and logical channels, packet reassembly, decryption, header decompression, and control signal processing to recover upper layer data packets from the first communication device 1450. The upper layer data packets from the controller / processor 1475 can be provided to the core network or all protocol layers above the L2 layer, and various control signals can also be provided to the core network or L3 for L3 processing.

[0382] As an embodiment, the first communication device 1450 apparatus includes: at least one processor and at least one memory, the at least one memory including computer program code; the at least one memory and the computer program code are configured to be used together with the at least one processor, and the first communication device 1450 apparatus at least: sends X1 first random access preambles, X1 is a positive integer; monitors the control signaling of the first random access response within a first time window, the first random access response corresponds to the X1 first random access preambles; increments the first counter by X1, and / or increments the second counter by 1; sends X2 second random access preambles, X2 is a positive integer greater than or equal to X1; wherein a first parameter is used to determine X2; or, whether the first counter is greater than a first threshold is used to determine X2, the first threshold is a positive integer greater than 1; or, whether the second counter is greater than a second threshold is used to determine X2, the second threshold is a positive integer; or, whether the first counter is greater than the first threshold and whether the second counter is greater than the second threshold are jointly used to determine X2.

[0383] As an embodiment, the first communication device 1450 apparatus includes: a memory storing a computer-readable instruction program, wherein the computer-readable instruction program generates an action when executed by at least one processor, wherein the action includes: sending X1 first random access preambles, X1 is a positive integer; monitoring the control signaling of a first random access response within a first time window, wherein the first random access response corresponds to the X1 first random access preambles; incrementing a first counter by X1, and / or incrementing a second counter by 1; sending X2 second random access preambles, X2 is a positive integer greater than or equal to X1; wherein a first parameter is used to determine X2; or, whether the first counter is greater than a first threshold is used to determine X2, wherein the first threshold is a positive integer greater than 1; or, whether the second counter is greater than a second threshold is used to determine X2, wherein the second threshold is a positive integer; or, whether the first counter is greater than the first threshold and whether the second counter is greater than the second threshold are jointly used to determine X2.

[0384] As an embodiment, the first communication device 1450 corresponds to the first node in this application.

[0385] As an embodiment, the second communication device 1410 corresponds to the second node in this application.

[0386] As an embodiment, the first communication device 1450 is a user equipment, and the user equipment can serve as a relay node.

[0387] As an embodiment, the first communication device 1450 is a user equipment supporting V2X, and the user equipment can serve as a relay node.

[0388] As an embodiment, the first communication device 1450 is a user equipment supporting D2D, and the user equipment can serve as a relay node.

[0389] As an embodiment, the first communication device 1450 is a network control relay NCR.

[0390] As an embodiment, the first communication device 1450 is a relay wireless repeater.

[0391] As an embodiment, the first communication device 1450 is a relay.

[0392] As an embodiment, the second communication device 1410 is a base station.

[0393] As an embodiment, the antenna 1452, the transmitter 1454, the multi-antenna transmit processor 1457, the transmit processor 1468, and the controller / processor 1459 are used to send X1 first random access preambles in this application.

[0394] As an embodiment, the antenna 1420, the receiver 1418, the multi-antenna reception processor 1472, the reception processor 1470, and the controller / processor 1475 are used to perform the reception of X1 first random access preambles in the present application.

[0395] As an embodiment, the antenna 1452, the receiver 1454, the multi-antenna receiving processor 1458, the receiving processor 1456, and the controller / processor 1459 are used to monitor the first random access response in the present application within a first time window.

[0396] As an embodiment, the antenna 1420, the transmitter 1418, the multi-antenna transmit processor 1471, the transmit processor 1416, and the controller / processor 1475 are used to determine whether to send the first random access response in the present application within a first time window.

[0397] The present application also provides a computer-readable storage medium for storing a program. The computer-readable storage medium can be applied to a terminal or network device provided in the present application, and the program enables a computer to execute the method performed by the terminal or network device in each embodiment of the present application.

[0398] The embodiment of the present application also provides a computer program product. The computer program product includes a program. The computer program product can be applied to the terminal or network device provided in the embodiment of the present application, and the program enables the computer to execute the method performed by the terminal or network device in each embodiment of the present application.

[0399] The embodiment of the present application also provides a computer program. The computer program can be applied to the terminal or network device provided in the embodiment of the present application, and the computer program enables a computer to execute the method executed by the terminal or network device in each embodiment of the present application.

[0400] It should be understood that the terms "system" and "network" in this application can be used interchangeably. In addition, the terms used in this application are only used to explain the specific embodiments of the present application, and are not intended to limit the present application. The terms "first", "second", "third" and "fourth" in the specification and claims of this application and the accompanying drawings are used to distinguish different objects, rather than to describe a specific order. In addition, the terms "including" and "having" and any of their variations are intended to cover non-exclusive inclusions.

[0401] In the embodiments of the present application, the "indication" mentioned can be a direct indication, an indirect indication, or an indication of an association relationship. For example, A indicates B, which can mean that A directly indicates B, for example, B can be obtained through A; it can also mean that A indirectly indicates B, for example, A indicates C, and B can be obtained through C; it can also mean that there is an association relationship between A and B.

[0402] In the embodiment of the present application, "B corresponding to A" means that B is associated with A, and B can be determined according to A. However, it should be understood that determining B according to A does not mean determining B only according to A, and B can also be determined according to A and / or other information.

[0403] In the embodiments of the present application, the term "corresponding" may indicate that there is a direct or indirect correspondence between the two, or an association relationship between the two, or a relationship of indication and being indicated, configuration and being configured, etc.

[0404] In the embodiments of the present application, "pre-definition" or "pre-configuration" can be implemented by pre-saving corresponding codes, tables or other methods that can be used to indicate relevant information in a device (for example, including a user device and a network device), and the present application does not limit the specific implementation method. For example, pre-definition can refer to what is defined in the protocol.

[0405] In the embodiments of the present application, the “protocol” may refer to a standard protocol in the communication field, for example, it may include an LTE protocol, an NR protocol, and related protocols used in future communication systems, and the present application does not limit this.

[0406] In the embodiments of the present application, the term "and / or" is only a description of the association relationship of the associated objects, indicating that there can be three relationships. For example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone. In addition, the character " / " in this article generally indicates that the associated objects before and after are in an "or" relationship.

[0407] In various embodiments of the present application, the size of the serial numbers of the above-mentioned processes does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.

[0408] In the several embodiments provided in the present application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of the units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0409] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0410] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0411] In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented using software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, the process or function described in the embodiment of the present application is generated in whole or in part. The computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions may be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium, for example, the computer instructions may be transmitted from a website site, computer, server or data center by wired (e.g., coaxial cable, optical fiber, digital subscriber line (digital subscriber line, DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) mode to another website site, computer, server or data center. The computer-readable storage medium may be any available medium that can be read by a computer or a data storage device such as a server or data center that includes one or more available media integrated. The available medium may be a magnetic medium (eg, a floppy disk, a hard disk, a magnetic tape), an optical medium (eg, a digital video disc (DVD)), or a semiconductor medium (eg, a solid state disk (SSD)).

[0412] A person of ordinary skill in the art can understand that all or part of the steps in the above method can be completed by instructing the relevant hardware through a program, and the program can be stored in a computer-readable storage medium, such as a read-only memory, a hard disk or an optical disk. Optionally, all or part of the steps in the above embodiment can also be implemented using one or more integrated circuits. Accordingly, each module unit in the above embodiment can be implemented in the form of hardware or in the form of a software function module, and the present application is not limited to any specific form of software and hardware combination. The first node in the present application includes but is not limited to mobile phones, tablet computers, notebooks, Internet cards, low-power devices, enhanced machine-type communication (enhanced machine-type communication, eMTC) devices, narrowband Internet of Things (narrow band internet of things, NB-IoT) devices, vehicle-mounted communication devices, aircraft, airplanes, drones, remote-controlled aircraft and other wireless communication devices. The second node in the present application includes but is not limited to mobile phones, tablet computers, notebooks, Internet cards, low-power devices, eMTC devices, NB-IoT devices, vehicle-mounted communication devices, aircraft, airplanes, drones, remote-controlled aircraft and other wireless communication devices. The user equipment or UE or terminal in this application includes but is not limited to mobile phones, tablet computers, notebooks, network cards, low-power devices, eMTC devices, NB-IoT devices, vehicle-mounted communication equipment, aircraft, airplanes, drones, remote-controlled airplanes and other wireless communication devices. The base station equipment or base station or network-side equipment in this application includes but is not limited to macrocell base stations, microcell base stations, home base stations, relay base stations, eNB, gNB, TRP, global navigation satellite system (GNSS), relay satellites, satellite base stations, aerial base stations and other wireless communication devices.

[0413] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art who is familiar with the present technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

Claims

1. A method in a first node for wireless communication, characterized in that include: Send X1 first random access preambles, where X1 is a positive integer; Monitoring control signaling of a first random access response within a first time window, the first random access response corresponding to the X1 first random access preambles; Incrementing a second counter by 1; Send X2 second random access preambles, where X2 is a positive integer greater than or equal to X1; The second counter is used to determine X2.

2. The method according to claim 1, characterized in that include: monitoring control signaling of a second random access response within a second time window; The second random access response corresponds to the X2 second random access preambles; the X1 first random access preambles are respectively transmitted on X1 physical random access channel opportunities, and the X1 physical random access channel opportunities are orthogonal in the time domain; the X2 second random access preambles are respectively transmitted on X2 physical random access channel opportunities, and the X2 physical random access channel opportunities are orthogonal in the time domain.

3. The method according to claim 1 or 2, characterized in that: The X2 is one of a plurality of candidate integers, and any integer among the plurality of candidate integers is not less than the X1.

4. The method according to any one of claims 1 to 3, characterized in that The initial value of the second counter is set to 1.

5. The method according to any one of claims 1 to 4, characterized in that include: A third random access response is received, the third random access response including at least one random access preamble identifier, any random access preamble identifier among the at least one random access preamble identifier included in the third random access response does not match a preamble index corresponding to the X1 first random access preambles.

6. A method in a second node for wireless communication, characterized in that: include: Perform reception of X1 first random access preambles, where X1 is a positive integer; Determine, within a first time window, whether to send control signaling of a first random access response, where the first random access response corresponds to the X1 first random access preambles; Perform reception of X2 second random access preambles, where X2 is a positive integer greater than or equal to X1; The second counter of the first node that sends the X1 first random access preambles is used to determine X2.

7. A method in a first node for wireless communication, characterized in that: include: Send X1 first random access preambles, where X1 is a positive integer; Monitoring control signaling of a first random access response within a first time window, the first random access response corresponding to the X1 first random access preambles; Incrementing a second counter by 1; Send X2 second random access preambles, where X2 is a positive integer greater than or equal to X1; A first parameter is used to determine the X2, and the first parameter is configured by a higher layer.

8. A method in a second node for wireless communication, characterized in that: include: Perform reception of X1 first random access preambles, where X1 is a positive integer; Determine, within a first time window, whether to send control signaling of a first random access response, where the first random access response corresponds to the X1 first random access preambles; Perform reception of X2 second random access preambles, where X2 is a positive integer greater than or equal to X1; A first parameter is used to determine the X2, and the first parameter is configured by a higher layer.

9. A first node for wireless communication, characterized in that: include: A first transceiver, configured to send X1 first random access preambles, where X1 is a positive integer; The first transceiver is configured to monitor control signaling of a first random access response within a first time window, the first random access response corresponding to the X1 first random access preambles; a first processor configured to increment a second counter by 1; The first transceiver is used to send X2 second random access preambles, where X2 is a positive integer greater than or equal to X1; The second counter is used to determine X2.

10. A second node for wireless communication, characterized in that: include: A second transceiver, configured to receive X1 first random access preambles, where X1 is a positive integer; a second processor, configured to determine, within a first time window, whether to send control signaling of a first random access response, where the first random access response corresponds to the X1 first random access preambles; The second transceiver is configured to receive X2 second random access preambles, where X2 is a positive integer greater than or equal to X1; The second counter of the first node that sends the X1 first random access preambles is used to determine X2.