Methods and apparatus in a node for wireless communication

Abstract

The present application provides a method and apparatus in a node for wireless communication to reduce resource consumption of retransmissions of complex PRACH. The method includes: transmitting X1 first random access preambles, where X1 is a positive integer greater than 1; 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; when the first time window expires and the reception of the first random access response is not successful, the current value of a first counter is increased by X2 to obtain an updated value of the first counter, where X2 is a positive integer greater than or equal to X1; wherein, the size relationship between the updated value of the first counter and a first threshold is used to determine whether to transmit X2 second random access preambles, and the first threshold is configured by higher layer signaling.

Description

Technical Field

[0001] This application relates to the field of communication technologies, and more particularly, to a method and apparatus in a node for wireless communication. Background Art

[0002] To enhance the coverage performance of random access, some communication systems (such as the new radio (NR) system) plan to introduce retransmission based on complex physical random access channel (PRACH) transmission and increase the number of PRACH transmissions in the retransmission. However, increasing the number of PRACH transmissions of complex PRACH transmissions in the retransmission consumes additional time-frequency resources and may also increase the collision probability of PRACH preambles. In this scenario, how to allocate resources for complex PRACH retransmission and how to balance the resource consumption of complex PRACH retransmission and the effectiveness of random access have become problems to be solved. Summary of the Invention

[0003] Embodiments of this application provide a method and apparatus in a node for wireless communication. The following introduces each aspect related to this application.

[0004] In a first aspect, a method in a first node for wireless communication is provided, including: sending X1 first random access preambles, where X1 is a positive integer greater than 1; 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; when the first time window expires and the reception of the first random access response is not successful, increasing the current value of a first counter by X2 to obtain an updated value of the first counter, where X2 is a positive integer greater than or equal to X1; where, the size relationship between the updated value of the first counter and a first threshold is used to determine whether to send X2 second random access preambles, and the first threshold is configured by a higher layer signaling.

[0005] As an implementation, when the updated value of the first counter is less than the first threshold, send the X2 second random access preambles; when the updated value of the first counter is greater than the first threshold, abandon sending the X2 second random access preambles.

[0006] As an implementation, increasing the current value of a second counter by 1 to obtain an updated value of the second counter, the size relationship between the updated value of the second counter and the sum of a second threshold and 1 is used to determine whether to send the X2 second random access preambles, or, whether the updated value of the second counter is equal to the sum of the second threshold and 1 is used to determine whether to send the X2 second random access preambles, and the second threshold is configured by a higher layer signaling.

[0007] As an implementation, set the initial value of the second counter to 1, and the initial value of the second counter is less than or equal to the current value of the second counter.

[0008] As an implementation, when the updated value of the first counter is less than the first threshold and the updated value of the second counter is not equal to the sum of the second threshold plus 1, send the X2 second random access preambles; when the updated value of the first counter is greater than the first threshold or the updated value of the second counter is equal to the sum of the second threshold plus 1, abandon sending the X2 second random access preambles.

[0009] As an implementation, when the updated value of the second counter is equal to the sum of the second threshold plus 1, indicate a random access problem to the upper layer.

[0010] As an implementation, set the initial value of the first counter to X0, where X0 is a positive integer greater than 1, and the initial value of the first counter is less than or equal to the current value of the first counter; select X0 physical random access channel opportunities; wherein, the X0 physical random access channel opportunities are used for the first random access procedure.

[0011] As an implementation, when the updated value of the first counter is greater than the first threshold, indicate a random access problem to the upper layer.

[0012] As an implementation, within the first time window, when the reception of the first random access response is successful, stop the first time window.

[0013] As an implementation, receive first information, where the first information is used to determine a plurality of candidate values, and the plurality of candidate values include the X1 and the X2.

[0014] In a second aspect, a method in a second node for wireless communication is provided, including: performing reception of X1 first random access preambles, where X1 is a positive integer greater than 1; determining whether to send control signaling of a first random access response according to the reception situation of the X1 first random access preambles within a first time window, where the first random access response corresponds to the X1 first random access preambles; wherein, when the first time window expires and the control signaling of the first random access response is not successfully sent, the magnitude relationship between the updated value of a first counter of a first node that sends the X1 first random access preambles and a first threshold is used to determine whether to perform reception of X2 second random access preambles, where X2 is a positive integer greater than or equal to X1, and the first threshold is configured by a higher layer signaling.

[0015] As an implementation, when the updated value of the first counter is less than the first threshold, receive the X2 second random access preambles; when the updated value of the first counter is greater than the first threshold, abandon receiving the X2 second random access preambles.

[0016] As an implementation, the magnitude relationship between the updated value of the second counter of the first node and the sum of the second threshold plus 1 is used to determine whether to receive the X2 second random access preambles, or whether the updated value of the second counter of the first node is equal to the sum of the second threshold plus 1 is used to determine whether to receive the X2 second random access preambles, and the second threshold is configured by higher layer signaling.

[0017] As an implementation, when the updated value of the first counter is less than the first threshold and the updated value of the second counter is not equal to the sum of the second threshold plus 1, receive the X2 second random access preambles; when the updated value of the first counter is greater than the first threshold or the updated value of the second counter is equal to the sum of the second threshold plus 1, abandon receiving the X2 second random access preambles.

[0018] As an implementation, within the first time window, when the control signaling of the first random access response is successfully sent, stop the first time window.

[0019] As an implementation, send a first message, where the first message is used to determine a plurality of candidate values, and the plurality of candidate values include the X1 and the X2.

[0020] In a third aspect, a first node for wireless communication is provided, including: a first transmitter for sending X1 first random access preambles, where X1 is a positive integer greater than 1; a first receiver for 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; a first counter for, when the first time window expires and the reception of the first random access response is not successful, increasing the current value by X2 to obtain the updated value of the first counter, where X2 is a positive integer greater than or equal to X1; wherein, the magnitude relationship between the updated value of the first counter and the first threshold is used to determine whether to send X2 second random access preambles, and the first threshold is configured by higher layer signaling.

[0021] As an implementation, the first transmitter is further configured to send the X2 second random access preambles when the updated value of the first counter is less than the first threshold; and abandon sending the X2 second random access preambles when the updated value of the first counter is greater than the first threshold.

[0022] As an implementation, the first node further includes a second counter, which is used to increment the current value by 1 to obtain an updated value of the second counter. The magnitude relationship between the updated value of the second counter and the sum of the second threshold plus 1 is used to determine whether to send the X2 second random access preambles, or whether the updated value of the second counter is equal to the sum of the second threshold plus 1 is used to determine whether to send the X2 second random access preambles. The second threshold is configured by higher layer signaling.

[0023] As an implementation, the second counter is further used to set an initial value of 1, and the initial value of the second counter is less than or equal to the current value of the second counter.

[0024] As an implementation, the first transmitter is further used to send the X2 second random access preambles when the updated value of the first counter is less than the first threshold and the updated value of the second counter is not equal to the sum of the second threshold plus 1; when the updated value of the first counter is greater than the first threshold or the updated value of the second counter is equal to the sum of the second threshold plus 1, to abandon sending the X2 second random access preambles.

[0025] As an implementation, the first node further includes a first processor, which is used to indicate a random access problem to the upper layer when the updated value of the second counter is equal to the sum of the second threshold plus 1.

[0026] As an implementation, the first counter is further used to set an initial value of X0, where X0 is a positive integer greater than 1, and the initial value of the first counter is less than or equal to the current value of the first counter; the first node further includes a second processor, which is used to select X0 physical random access channel opportunities; wherein, the X0 physical random access channel opportunities are used for the first random access procedure.

[0027] As an implementation, the first node further includes a third processor, which is used to indicate a random access problem to the upper layer when the updated value of the first counter is greater than the first threshold.

[0028] As an implementation, the first node further includes a fourth processor, which is used to stop the first time window when the reception of the first random access response is successful within the first time window.

[0029] As an implementation, the first receiver is further used to receive first information, and the first information is used to determine a plurality of candidate values, and the plurality of candidate values include the X1 and the X2.

[0030] Fourthly, a second node for wireless communication is provided, including: a second receiver configured to receive X1 first random access preambles, where X1 is a positive integer greater than 1; a fifth processor configured to determine whether to send control signaling of a first random access response according to the reception of the X1 first random access preambles within a first time window, where the first random access response corresponds to the X1 first random access preambles; wherein, when the first time window expires and the control signaling of the first random access response fails to be sent successfully, the size relationship between the updated value of a first counter of a first node that sends the X1 first random access preambles and a first threshold is used to determine whether to receive X2 second random access preambles, where X2 is a positive integer greater than or equal to X1, and the first threshold is configured by higher layer signaling.

[0031] As an implementation, the second receiver is further configured to, when the updated value of the first counter is less than the first threshold, receive the X2 second random access preambles; when the updated value of the first counter is greater than the first threshold, abandon receiving the X2 second random access preambles.

[0032] As an implementation, the size relationship between the updated value of a second counter of the first node and the sum of a second threshold plus 1 is used to determine whether to receive the X2 second random access preambles, or whether the updated value of the second counter of the first node is equal to the sum of the second threshold plus 1 is used to determine whether to receive the X2 second random access preambles, where the second threshold is configured by higher layer signaling.

[0033] As an implementation, the second receiver is further configured to, when the updated value of the first counter is less than the first threshold and the updated value of the second counter is not equal to the sum of the second threshold plus 1, receive the X2 second random access preambles; when the updated value of the first counter is greater than the first threshold or the updated value of the second counter is equal to the sum of the second threshold plus 1, abandon receiving the X2 second random access preambles.

[0034] As an implementation, the fifth processor is further configured to stop the first time window within the first time window when the control signaling of the first random access response is sent successfully.

[0035] As an implementation, the second node further includes a second transmitter configured to send first information, where the first information is used to determine a plurality of candidate values, and the plurality of candidate values include the X1 and the X2.

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

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

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

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

[0040] In a ninth aspect, an embodiment of the present application provides a computer program product, where the computer program product includes a non-transitory computer-readable storage medium storing a computer program, and the computer program is operable to enable a computer to execute some or all of the steps in the methods of the above various aspects. In some implementation manners, the computer program product may be a software installation package.

[0041] In a 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 various aspects.

[0042] In the embodiment of the present application, when the first random access response corresponding to X1 first random access preambles is not successfully received, the first node can determine whether to send X2 second random access preambles according to the magnitude relationship between the updated value of the first counter and the first threshold, and the updated value of the first counter is related to X2. By setting the first threshold, the first node can limit the total number of transmissions of random access preambles, which helps to reduce the resource consumption of repeated PRACH retransmissions.

[0043] In the embodiments of the present application, when the first node fails to successfully receive the first random access response, it can determine whether to continue sending random access preambles according to the first threshold and the updated value of the first counter, so as to balance the resource consumption of the PRACH and the effectiveness of random access.

[0044] In the embodiments of the present application, the first node supports retransmission based on complex PRACH, and determines the number of retransmissions for complex PRACH transmission through the first threshold and the updated value of the first counter, which not only helps to improve the performance gain of complex PRACH transmission and increase the coverage range, but also helps to reduce the random access delay and improve the utilization efficiency of random access resources. Description of the Drawings

[0045] Figure 1 FIG. is a schematic diagram of the system architecture of a wireless communication system to which the embodiments of the present application can be applied.

[0046] Figure 2 FIG. is a schematic flow chart of a method in the first node for wireless communication provided by the embodiments of the present application.

[0047] Figure 3 is Figure 2 a schematic flow chart of a possible implementation manner of the method shown.

[0048] Figure 4 is Figure 2 a schematic flow chart of another possible implementation manner of the method shown.

[0049] Figure 5 FIG. is a schematic structural diagram of the first node for wireless communication provided by the embodiments of the present application.

[0050] Figure 6 FIG. is a schematic structural diagram of the second node for wireless communication provided by the embodiments of the present application.

[0051] Figure 7 FIG. is a schematic structural diagram of the device provided by the embodiments of the present application.

[0052] Figure 8 FIG. is a schematic diagram of the hardware modules of the communication device provided by the embodiments of the present application. Detailed Embodiments

[0053] Communication system architecture

[0054] Figure 1FIG. 0 is a schematic diagram of the system architecture of the wireless communication system 100 to which the embodiments of the present application can be applied. The wireless communication system 100 may include a network device 110 and a user equipment (UE) 120. The network device 110 may be a device that communicates with the user equipment 120. The network device 110 may provide communication coverage for a specific geographical area and may communicate with the user equipment 120 located within the coverage area.

[0055] Figure 1 Exemplarily, one network device and two user equipments are shown. Optionally, the wireless communication system 100 may include multiple network devices and the coverage range of each network device may include other numbers of user equipments. The embodiments of the present application do not limit this.

[0056] Optionally, the wireless communication system 100 may further include other network entities such as a network controller and a mobility management entity. The embodiments of the present application do not limit this.

[0057] It should be understood that the technical solutions of the embodiments of the present application can be applied to initial access and can also be used for beam failure recovery. Further, the technical solutions of the embodiments of the present application can be applied to the random access procedure type-1 and can also be used for the random access procedure type-2. Further, the technical solutions of the embodiments of the present application can be applied to the Uu interface and can also be used for the PC5 interface. Further, the technical solutions of the embodiments of the present application can be applied to single-carrier communication and can also be used for multi-carrier communication. Further, the technical solutions of the embodiments of the present application can be applied to multi-antenna communication and can also be used for single-antenna communication. Further, the technical solutions of the embodiments of the present application can be applied to the scenario of user equipment and base station and are also applicable to the V2X scenario, the communication scenarios between user equipment and relay, and between relay and base station, achieving similar technical effects in the scenario of user equipment and base station. Further, the technical solutions of the embodiments of the present application can be applied to various communication scenarios, such as: Enhanced Mobile Broadband (eMBB) scenario, Ultra-Reliable & Low Latency Communication (URLLC) scenario, Massive Machine-Type Communication (mMTC) scenario, etc. In addition, adopting a unified solution in different scenarios helps to reduce the hardware complexity and cost.

[0058] It should be understood that, without conflict, the embodiments and features in the first node of the present application can be applied to the second node, and vice versa. Without conflict, the embodiments and features in the embodiments of the present application can be arbitrarily combined with each other.

[0059] 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 (5G) system or new radio (NR), long term evolution (LTE) system, LTE frequency division duplex (FDD) system, LTE time division duplex (TDD), etc. The technical solutions provided by the present application can also be applied to future communication systems, such as the sixth generation mobile communication system, and also satellite communication systems, and so on.

[0060] The user equipment in the embodiments of the present application may also be referred to as a terminal device, an access terminal, a user unit, a user station, a mobile station (MS), a mobile terminal (MT), a remote station, a remote terminal, a mobile device, a user terminal, a terminal, a wireless communication device, a user agent, or a user device. The user equipment in the embodiments of the present application may be a device that provides voice and / or data connectivity to users and can be used to connect people, things, and machines. For example, it may be a handheld device with a wireless connection function, a vehicle-mounted device, etc. The user equipment in the embodiments of the present application may be a mobile phone, a tablet computer (Pad), a laptop computer, a handheld computer, 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 a smart grid, a wireless terminal in transportation safety, a wireless terminal in a smart city, a wireless terminal in a smart home, etc. Optionally, the UE may be used to act as a base station. For example, the UE may act as a scheduling entity that provides sidelink signals between UEs in V2X or D2D, etc. For instance, a cellular phone and a vehicle communicate with each other using sidelink signals. A cellular phone communicates with a smart home device without relaying the communication signal through a base station.

[0061] The network device in the embodiments of the present application can be a device for communicating with a user equipment, and this network device can also be referred to as an access network device or a radio access network device. For example, the network device can be a base station. The network device in the embodiments of the present application can refer to a radio access network (RAN) node (or device) that connects a user equipment to a wireless network. The base station can generally cover various names as follows, or be replaced with the following names, such as: Node B, evolved Node B (eNB), next generation Node B (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 can also refer to a communication module, a modem or a chip disposed in the foregoing device or apparatus. The base station can also be a mobile switching center and a device that undertakes the function of a base station in device-to-device (D2D), vehicle-to-everything (V2X), machine-to-machine (M2M) communications, a network-side device in a 6G network, a device that undertakes the function of a base station in a future communication system, etc. The base station can support networks with the same or different access technologies. The embodiments of the present application do not limit the specific technologies and specific device forms adopted by the network device.

[0062] The base station can be fixed or mobile. For example, a helicopter or a drone can be configured to act as a mobile base station, and one or more cells can move according to the position of the mobile base station. In other examples, a helicopter or a drone can be configured to be a device for communicating with another base station.

[0063] 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.

[0064] The network device and the user equipment may be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; they may also be deployed on water; they may also be deployed on aircraft, balloons, and satellites in the air. In the embodiments of the present application, the scenarios where the network device and the user equipment are located are not limited.

[0065] 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 virtualized functions instantiated on a platform (such as a cloud platform).

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

[0067] Coverage enhancement for PRACH transmission

[0068] The coverage performance of a communication system (such as an NR system) is an important factor that needs to be considered by operators when commercializing the deployment of a communication network. This is because the coverage performance of a communication system will directly affect the service quality of the communication system and the costs of the operator, such as the operator's capital expenditure (CAPEX) and the operator's operating expense (OPEX), etc.

[0069] The coverage performance of a communication system will vary with the different frequency bands at which the communication system operates. For example, compared with the LTE system, the NR system operates at a higher frequency band (such as the millimeter wave band), resulting in a greater path loss in the NR system, thereby resulting in relatively poorer coverage performance of the NR system. Therefore, as the frequency bands supported by communication systems may become higher and higher, how to enhance the coverage of communication systems has become a problem to be solved.

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

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

[0072] However, Rel-17 does not have a coverage enhancement solution for PRACH. However, the PRACH transmission performance is very important for many procedures 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) officially established a work item (WI) of "further NR coverage enhancements" in Release 18 (Rel-18) 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.

[0073] As a possible implementation method, multiple PRACH transmissions can be used to achieve coverage enhancement of PRACH transmission. That is to say, the performance gain of PRACH transmission can be obtained through repeated transmission of PRACH (for example, sending the preamble multiple times in PRACH).

[0074] To achieve coverage enhancement for PRACH transmission, the 3GPP radio access network (RAN) 1#110bis-e meeting agreed to adopt complex PRACH transmission with the same beam in one random access channel attempt to obtain performance gains. The RAN1#110bis-e meeting also further supports using the same PRACH preamble in complex PRACH transmission, and random access channel occasions (PRACH occasions, ROs) in different time instances can be used for complex PRACH transmission.

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

[0076] Furthermore, the 3GPP RAN1#112bis-e meeting agreed that complex PRACH transmission in one random access channel attempt only operates in one ROG; and the number of PRACH transmissions in complex PRACH transmission is configured as one or more values, and the number of valid ROs in an ROG is equal to one of these configured one or more values. That is to say, the size of an ROG 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 complex PRACH transmission.

[0077] Based on the above technical progress, the subsequent meetings discussed the retransmission based on complex PRACH transmission and the scheme of increasing the number of PRACH transmissions during retransmission. For example, 3GPP RAN1#113 meeting discussed the scheme of performing single PRACH transmission or complex PRACH transmission in the initial random access channel attempt and allowing the increase of the number of PRACH transmissions during retransmission. This scheme enables the user equipment with limited coverage to quickly access the system by adjusting the number of PRACH transmissions of complex PRACH transmission during retransmission when the number of PRACH transmissions determined in the initial random access channel attempt cannot meet the 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 the coverage, increasing the number of PRACH transmissions of complex PRACH transmission to obtain the combining gain is an effective solution. Another example is that 3GPP RAN2#122 meeting also agreed to further discuss the fallback mechanism from a smaller number of PRACH transmissions to a larger number of PRACH transmissions in complex PRACH transmission.

[0078] However, increasing the number of PRACH transmissions of complex PRACH transmission during retransmission will consume additional time-frequency resources and increase the collision probability of PRACH preambles. When the number of PRACH transmissions of complex PRACH transmission performed by the user equipment in the previous random access channel attempt is already large, increasing the number of PRACH transmissions of complex PRACH transmission in multiple retransmissions will bring a large amount of resource consumption and increase the preamble collision probability. Especially if the access failure of the user equipment is caused by preamble collision, then increasing the number of PRACH transmissions at the cost of resource consumption is an ineffective and wasteful solution. In this scenario, a better solution should be to re-initiate the random access process and re-select the random access resources and PRACH preambles.

[0079] In summary, in the scenario of performing complex PRACH retransmission, how to allocate resources for complex PRACH retransmission and how to balance the resource consumption of complex PRACH retransmission and the effectiveness of random access are all problems that need to be solved.

[0080] To solve the above problems, the embodiments of the present application provide a method and device for a node in wireless communication, which can reduce the resource consumption of complex PRACH retransmission, balance the resource consumption of complex PRACH and the effectiveness of random access, and also help to reduce the random access delay and improve the utilization efficiency of random access resources while enhancing the performance gain of complex PRACH transmission and increasing the coverage.

[0081] The embodiments of the present application can be applied to the retransmission scenario of complex PRACH transmission, that is, multiple PRACH repeated transmissions can be adopted in multiple random access channel attempts to achieve the coverage enhancement of PRACH.

[0082] In some embodiments, the multiple PRACH transmissions mentioned in the embodiments of the present application may refer to multiple PRACH transmissions using the same beam, so as to obtain a signal-to-noise ratio gain by repeating the transmission of multiple PRACHs on the same beam. In some embodiments, the multiple PRACH transmissions mentioned in the embodiments of the present application may refer to multiple PRACH transmissions using different beams, so as to obtain a diversity gain by repeating the transmission of multiple PRACHs on different beams.

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

[0084] 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 procedure (i.e., random access procedure type-1), or can also be applied to the two-step random access procedure (i.e., random access procedure type-2). The embodiments of the present application do not limit this.

[0085] The method embodiments of the present application will be introduced in detail below with reference to the accompanying drawings. Figure 2 It is a schematic flowchart of a method in a first node for wireless communication provided by an embodiment of the present application. This method is used for the interaction between the first node and the second node.

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

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

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

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

[0090] Figure 2 The method shown includes step S210, step S220, and step S230. These steps will be introduced below.

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

[0092] The random access preamble (RA preamble) can be used interchangeably with the PRACH preamble described above. The first random access preamble is a random access preamble generated by the first node through a random access sequence.

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

[0094] As an embodiment, the first random access process includes sending the X1 random access preambles.

[0095] As an embodiment, the random access channel attempt currently being made by the first node includes sending X1 first random access preambles. The random access channel attempt currently being made can be any one of the multiple random access channel attempts in the first random access process. For example, the first node currently sending X1 random access preambles can be the first time sending X1 random access preambles, or the Nth time (N>1) sending X1 random access preambles.

[0096] In some embodiments, the number of random access preambles sent by the first node is related to the number of PRACH transmissions in the complex PRACH transmission. For example, X1 first random access preambles can indicate that the number of PRACH transmissions in the complex PRACH transmission currently being made by the first node is X1.

[0097] In some embodiments, the number of random access preambles sent by the first node is related to the number of ROs in the ROG occupied by the complex PRACH transmission. For example, X1 first random access preambles can indicate that the number of ROs in the ROG occupied by the complex PRACH transmission currently being made by the first node is X1.

[0098] As an embodiment, in multiple random access channel attempts, the first node can send the same or different numbers of random access preambles. For example, the first node sends X1 random access preambles in the current random access channel attempt, and the number of random access preambles sent in the next random access channel attempt is different from X1.

[0099] In some embodiments, the first node may determine X1 by receiving first information. Exemplarily, the first information is used to determine a plurality of candidate values, and the plurality of candidate values includes the X1.

[0100] As an embodiment, the plurality of candidate values of the X1 includes at least one of {2, 4, 8}.

[0101] For the second node, the second node may perform reception of X1 first random access preambles. In some embodiments, the second node may receive one or more of the X1 first random access preambles. In some embodiments, the second node may not receive the first random access preamble.

[0102] In step S220, monitor the control signaling of the first random access response within the first time window.

[0103] The first time window may be a time window for the first node to monitor the random access response (RAR) for X1 random access preambles.

[0104] As an embodiment, the media access control (MAC) entity may start the first time window at the first PDCCH occasion after the transmission of the first random access preamble ends.

[0105] The control signaling of the first random access response may be a physical downlink control channel (PDCCH) related to the first random access response.

[0106] As an embodiment, for the initial access process, the first node's monitoring of the control signaling of the first random access response includes monitoring the PDCCH for RAR when the first time window is running.

[0107] As an embodiment, in the beam failure recovery process, the first node's monitoring of the control signaling of the first random access response includes monitoring the PDCCH transmission on the search space indicated by recoverySearchSpaceId when the first time window is running.

[0108] As an embodiment, the first random access process includes monitoring the control signaling of the first random access response within the first time window.

[0109] As an embodiment, the first random access process includes receiving the first random access response.

[0110] As an example, the first random access procedure includes transmitting a first physical uplink shared channel (PUSCH), and the first PUSCH is scheduled by the uplink grant in the first random access response.

[0111] As an example, the first random access procedure includes receiving a first physical downlink shared channel (PDSCH), and the first PDSCH is used for conflict resolution.

[0112] The first random access response corresponds to X1 first random access preambles. That is to say, the first random access response is a random access response sent by the second node for one or more of the X1 first random access preambles. Within the first time window, the second node can determine whether to send the control signaling of the first random access response according to the reception situation of the X1 first random access preambles.

[0113] In some embodiments, the reception situation of the first random access preamble may include the number of received first random access preambles, or may also include whether the first random access preamble conflicts with other random access preambles, which is not limited herein.

[0114] As an example, within the first time window, when the first random access preambles received by the second node meet the conditions for sending a random access response, the second node will send the first random access response. Conversely, if the second node does not receive the first random access preamble, or the received first random access preambles do not meet the conditions for sending a random access response, the first random access response will not be sent.

[0115] In step S230, when the first time window expires and the reception of the first random access response is not successful, the current value of the first counter is increased by X2 to obtain the updated value of the first counter, where X2 is a positive integer greater than or equal to X1.

[0116] The unsuccessful reception of the first random access response means that when the first time window expires, the first node does not receive the first random access response corresponding to the X1 first random access preambles, or the reception fails.

[0117] As an example, when the first time window expires, if the first node does not receive the PDCCH transmission on the search space indicated by recoverySearchSpaceId in the serving cell where the first random access preamble is transmitted, the reception of the first random access response is not successful.

[0118] As an example, when the first time window expires and the first node does not receive a random access response, or the random access preamble identifier included in the received random access response does not match the transmitted preamble index, the reception of the first random access response is unsuccessful.

[0119] The first counter is used by the first node to count the number of PRACH transmissions in all complex PRACH transmissions during multiple random access channel attempts, or the number of ROs occupied by the complex PRACH transmissions, or the number of random access preambles transmitted.

[0120] In some embodiments, the first counter can be the traditional preamble transmission counter (preamble transmission counter) of the first node, or a newly set PRACH transmission counter of the first node, which is not limited herein.

[0121] As an example, the first counter can be PREAMBLE_TRANSMISSION_COUNTER, that is, the traditional preamble transmission counter is reused.

[0122] In some embodiments, the initial value of the first counter is set to the number of PRACH transmissions in the initial complex PRACH transmission, or the number of ROs in the ROG occupied by the initial complex PRACH transmission, or the number of random access preambles transmitted in the initial random access channel attempt. It should be understood that in the embodiments of the present application, the number of PRACH transmissions, the number of ROs, and the number of random access preamble transmissions can be substituted for each other.

[0123] As an example, the initial value of the first counter is set to X0, where X0 is a positive integer greater than 1. For example, X0 can be at least one of {2, 4, 8}.

[0124] As an example, the initial value of the first counter is set to the maximum value of the random access preamble, or the maximum value of the number of PRACH transmissions, or the maximum value of the number of ROs occupied by the complex PRACH transmission.

[0125] In some embodiments, when the initial value of the first counter is a parameter of the initial random access channel attempt, the initial value of the first counter is less than or equal to the current value of the first counter. The current value of the first counter can be the cumulative value of the first counter when the first node is currently performing a random access channel attempt. For example, when the first node performs the initial random access channel attempt, the current value of the first counter is equal to the initial value of the first counter. Another example is that after the first node performs the (N + 1)-th (N > 1) random access channel attempt, the current value of the first counter can be the cumulative value based on the previous N attempts, and at this time the current value of the first counter is greater than the initial value of the first counter.

[0126] The updated value of the first counter is the value of the first counter after one update based on the current value. The first counter can be updated according to the reception of the channel access response after the current random access preamble is sent, or can be updated before planning to initiate the next random access channel attempt. For example, the first counter can update its value in a scenario where the reception of the first random access response corresponding to X1 first random access preambles is unsuccessful.

[0127] In some embodiments, when the initial value of the first counter is a parameter for the initial random channel access attempt, the value update of the first counter is incremental, that is, the value of the first counter increases when it is updated. The increased value can be the number of random access preambles corresponding to the next random access channel attempt.

[0128] That the updated value of the first counter is obtained by increasing the current value of the first counter by X2 means that the first counter uses the sum of adding X2 to the current value as the updated value. X2 is the same as the number of PRACH transmissions in the next re - PRACH transmission of the first node.

[0129] As an embodiment, the first node can determine X2 by receiving the first information. Exemplarily, the first information is used to determine a plurality of candidate values, and the plurality of candidate values includes the X2.

[0130] As an embodiment, the plurality of candidate values of the X2 includes at least one of {2, 4, 8}.

[0131] As an embodiment, the first information is used to determine a plurality of candidate values, and the plurality of candidate values includes the X1 and the X2.

[0132] As an embodiment, the plurality of candidate values includes at least two of {2, 4, 8}.

[0133] As an embodiment, the X1 is equal to 2, and the X2 is one of {4, 8}.

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

[0135] In some embodiments, the number of PRACH transmissions in the current re - PRACH transmission during multiple retransmissions can be different from or the same as the number of PRACH transmissions in the previous re - PRACH transmission.

[0136] As an embodiment, in order to achieve coverage enhancement, the number of PRACH transmissions during re - PRACH retransmission can be greater than the number of PRACH transmissions in the previous re - PRACH transmission. For example, the above - mentioned X2 is greater than X1.

[0137] As an example, the number of PRACH transmissions during retransmission of the complex PRACH may also be equal to the number of PRACH transmissions in the previous retransmission of the complex PRACH. For example, X2 is equal to X1.

[0138] As an example, if the first time window expires and the first node does not successfully receive the corresponding RAR, the preamble transmission counter may increase the number of PRACH transmissions in the retransmission of the complex PRACH for the next time, or the number of ROs in the ROG occupied by the retransmission of the complex PRACH for the next time. For example, the number of PRACHs in the next retransmission of the complex PRACH by the first node is X2, and the first counter is updated by adding X2 to the current value to obtain an updated value.

[0139] As an example, when the initial value of the first counter is the maximum number of PRACH transmissions or the maximum number of ROs, the update of the first counter is decreasing, that is, the value of the first counter decreases during the update. The decreased value may be the number of random access preambles corresponding to the next random access attempt.

[0140] In some embodiments, the first node may select a physical random access channel opportunity according to the update situation of the value of the first counter. The physical random access channel opportunity also represents an ROG.

[0141] In some embodiments, after setting the initial value of the first counter to X0, the first node may select X0 physical random access channel opportunities, and the X0 physical random access channel opportunities are used for the first random access procedure.

[0142] As an example, the X0 physical random access channel opportunities are used to send X0 third random access preambles.

[0143] As an example, the first random access procedure includes the sending of the X0 third random access preambles.

[0144] As an example, the X0 third random access preambles are the same as the X1 first random access preambles.

[0145] As an example, the X0 third random access preambles are different from the X1 first random access preambles.

[0146] As an example, when the first counter is increased by X2 based on the current value, if the updated value of the first counter is less than the first threshold, the first node may select X2 physical random access channel opportunities for sending X2 second random access preambles.

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

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

[0149] The relationship between the updated value of the first counter and the first threshold is used to determine whether to send the X2 second random access preambles. That is, the first node can determine whether to continue the random access channel attempt according to the updated value of the first counter obtained in step S230 of the first counter and the first threshold.

[0150] In some embodiments, whether the first node sends the X2 second random access preambles refers to whether, after performing a multiplexed PRACH transmission based on the X1 first random access preambles, a next multiplexed PRACH transmission based on the X2 second random access preambles is performed. Whether the first node sends the X2 second random access preambles also refers to whether the first node performs a multiplexed PRACH retransmission. If the first node sends the X2 second random access preambles, it is equivalent to continuing to perform the multiplexed PRACH retransmission; if the first node abandons sending the X2 second random access preambles, it is equivalent to abandoning the multiplexed PRACH retransmission.

[0151] As an embodiment, the relationship between the updated value of the first counter and the first threshold is used to determine whether the first random access procedure is not successfully completed, and the first threshold is configured by higher layer signaling.

[0152] As an embodiment, whether to send the X2 second random access preambles is equivalent to whether the first random access procedure is not successfully completed.

[0153] As an embodiment, the second random access preambles can be the same as the first random access preambles. That is, the preambles used for the retransmitted multiplexed PRACH transmission can be the same as the preambles used for the previous multiplexed PRACH transmission. For example, the second random access preambles and the first random access preambles are generated by the same random access preamble sequence.

[0154] As an embodiment, the second random access preambles can be different from the first random access preambles. That is, the preambles used for the retransmitted multiplexed PRACH transmission can be different from the preambles used for the previous multiplexed PRACH transmission. For example, the first node reselects a preamble different from the first random access preamble as the second random access preamble.

[0155] As an embodiment, when the first counter is updated by decreasing its value, the initial value of the first counter is the first threshold, and the relationship between the updated value of the first counter and 0 is used to determine whether to send the X2 second random access preambles.

[0156] The first threshold is configured by higher layer signaling. The higher layer signaling may be radio resource control (RRC) signaling. The RRC signaling indicates the configuration parameters of the RRC information element (IE).

[0157] As an embodiment, the first threshold is configured by "preambleTransMax" in the RRC IE RACH-ConfigGeneric.

[0158] As an embodiment, the first threshold is indicated by the second information. The second information may be the "preambleTransMax" in the RRC IE, or the second information includes the "preambleTransMax".

[0159] As an embodiment, the first threshold is configured by a newly introduced IE parameter in the RRC.

[0160] In some embodiments, the first threshold is the total maximum number of PRACH transmissions, or the total maximum number of ROs, or the total maximum number of random access preamble transmissions.

[0161] The relationship between the updated value of the first counter and the first threshold is used to determine whether to send X2 second random access preambles, including that when the updated value of the first counter is less than the first threshold, send X2 second random access preambles; when the updated value of the first counter is greater than the first threshold, abandon sending X2 second random access preambles.

[0162] As an embodiment, when the updated value of the first counter is less than or equal to the first threshold, send the X2 second random access preambles; when the updated value of the first counter is greater than the first threshold, abandon sending the X2 second random access preambles.

[0163] As an embodiment, when the updated value of the first counter is less than the first threshold, send the X2 second random access preambles; when the updated value of the first counter is equal to or greater than the first threshold, abandon sending the X2 second random access preambles.

[0164] As an embodiment, the abandonment of sending the X2 second random access preambles is equivalent to the first random access process not being successfully completed.

[0165] For the second node, when the first node sends X2 second random access preambles, the second node can perform the reception of X2 second random access preambles; when the first node abandons sending X2 second random access preambles, the second node abandons performing the reception of X2 second random access preambles.

[0166] In some embodiments, when the updated value of the first counter is greater than the first threshold, the first node needs to indicate to the upper layer so that the upper layer can determine whether the first random access process is successful.

[0167] As an embodiment, when the updated value of the first counter is greater than the first threshold, a random access problem is indicated to the upper layer.

[0168] As an embodiment, indicating a random access problem to the upper layer is equivalent to abandoning sending the X2 second random access preambles.

[0169] As an embodiment, if the first counter exceeds the total maximum number of PRACH transmissions or the total maximum number of ROs indicated by the second information, then a random access problem is indicated to the upper layer (i.e., abandoning the retransmission of the duplicate PRACH transmission); if the first counter does not exceed the total maximum number of PRACH transmissions or the total maximum number of ROs indicated by the second information, then the retransmission of the duplicate PRACH transmission is performed.

[0170] In some embodiments, if the first node successfully receives the first random access response within the first time window, it is regarded that the first random access process is successfully completed.

[0171] As an embodiment, within the first time window, when the reception of the first random access response is successful, the first time window is stopped. For example, the MAC entity determines the opening and stopping of the first time window according to the execution situation of the first random access process.

[0172] As an embodiment, stopping the first time window means that the MAC entity stops monitoring the time window of the first random access response.

[0173] For the second node, within the first time window, when the first random access response is successfully sent, the first time window is stopped.

[0174] From Figure 2 It can be seen that in the embodiments of the present application, regardless of the number of PRACH transmissions of the duplicate PRACH, the first node can control the total number of PRACH transmissions or the total number of occupied ROs, so as to minimize unnecessary resource waste in the duplicate PRACH retransmission and avoid introducing unnecessary PRACH preamble conflicts, so as to optimize resource allocation.

[0175] For ease of understanding, the following is combined with Figure 3, an example is given of a scheme in which the total number of PRACH transmissions for all complex PRACH transmissions in multiple random access channel attempts is used to determine whether to perform a complex PRACH retransmission. Figure 3 Shown is a schematic flowchart of a possible implementation of the method according to an embodiment of the present application by a first node.

[0176] See Figure 3 , in step S302, a first random access process starts.

[0177] In step S304, set the preamble transmission counter to the number of PRACH transmissions in the initial complex PRACH transmission. This preamble transmission counter is the first counter.

[0178] In step S306, perform a random access resource selection process.

[0179] In step S308, send multiple preambles on multiple ROs in a ROG. The preambles sent in different times can be different or the same.

[0180] In step S310, determine whether a RAR is successfully received within the RAR time window. If a RAR is successfully received, execute step S316; if the RAR reception is unsuccessful within the RAR time window, execute step S312.

[0181] In step S312, update the preamble transmission counter. The updated preamble transmission counter is the sum of the value of the original preamble transmission counter and the number of PRACH transmissions in the retransmission complex PRACH transmission. The number of PRACH transmissions in the retransmission complex PRACH transmission can be different or the same as the number of PRACH transmissions in the previous complex PRACH transmission.

[0182] In step S314, determine whether the value of the updated preamble transmission counter is greater than the maximum total number of PRACH transmissions. If it is greater, execute step S318; if it is not greater, repeat steps S306 to S310.

[0183] In step S316, if a RAR is successfully received within the RAR time window, it is considered that the random access process is successfully completed, so the first random access process ends.

[0184] In step S318, if the RAR reception is unsuccessful within the RAR time window and the preamble transmission counter exceeds the maximum total number of PRACH transmissions, abandon the retransmission complex PRACH transmission. In this scenario, indicate a random access problem to the upper layer, and this random access process is considered not to be successfully completed, and the first random access process ends.

[0185] As described above in conjunction with Figure 2 andFigure 3 A method for determining whether to perform retransmission of complex PRACH is introduced based on the total number of PRACH transmissions. An embodiment of this application also proposes a method in which the total number of PRACH transmissions and the maximum number of transmissions of all complex PRACH transmissions are jointly used to determine whether to perform retransmission of complex PRACH. For the sake of brevity, terms that have been explained in Figure 2 will not be elaborated again in the embodiments of this method.

[0186] After Figure 2 the step S230 shown, the current value of the second counter is incremented by 1 to obtain the updated value of the second counter.

[0187] The second counter is used by the first node to count the number of transmissions of all complex PRACH transmissions in multiple random access channel attempts, that is, the number of times the first node sends a random access preamble, or the number of random access channel attempts.

[0188] As an embodiment, the first counter and the second counter work together so that the first node comprehensively considers the number of PRACH transmissions and the number of transmissions of complex PRACH transmissions when determining whether to perform retransmission of complex PRACH.

[0189] As an embodiment, when the first counter is the traditional preamble transmission counter of the first node, the second counter is a newly set transmission count counter of the first node.

[0190] As an embodiment, when the first counter is a newly set PRACH transmission counter of the first node, the second counter is the traditional preamble transmission counter, and the setting of the preamble transmission counter does not need to be adjusted.

[0191] For example, the second counter can be PREAMBLE_TRANSMISSION_COUNTER.

[0192] As an embodiment, the initial value of the second counter is set to 1, which is consistent with the traditional setting of the preamble transmission counter.

[0193] As an embodiment, the initial value of the second counter is set to the maximum number of transmissions.

[0194] In some embodiments, when the initial value of the second counter is 1, the initial value of the second counter is less than or equal to the current value of the second counter. The current value of the second counter can be the cumulative number of times the first node currently performs random access channel attempts. For example, when the first node makes the first random access channel attempt, the current value of the second counter is equal to 1. The initial value and the current value of the second counter are the same. Another example is that when the first node makes the Nth (N>1) random access channel attempt, the current value of the second counter can be N, and at this time the current value of the second counter is greater than the initial value of the second counter.

[0195] The updated value of the second counter is the value after the second counter is updated once based on the current value. The second counter can be updated according to the reception of the channel access response after the current random access preamble is sent, or can be updated before the next random access channel attempt is scheduled to start, or can also be updated in a scenario where the updated value of the first counter is less than the first threshold. For example, in a scenario where the reception of the first random access response corresponding to X1 first random access preambles is unsuccessful, if the updated value of the first counter is less than the first threshold, the second counter updates its value.

[0196] In some embodiments, when the initial value of the second counter is 1, the value update of the second counter is incremental.

[0197] That the updated value of the first counter is obtained by adding 1 to the current value of the first counter means that the first counter uses the sum of the current value and the added value as the updated value.

[0198] As an embodiment, if the first time window expires and the first node does not successfully receive the corresponding RAR, the second counter (for example, the preamble transmission counter) is incremented by 1, and the first counter (for example, the PRACH transmission counter) increases by the number of PRACH transmissions in the multiple PRACH transmissions for the next retransmission, or the number of ROs in the ROG occupied by the multiple PRACH transmissions for the next retransmission.

[0199] As an embodiment, when the initial value of the second counter is the maximum number of transmissions, the update of the second counter is decremental, that is, the second counter is decremented by 1 when it is updated.

[0200] The magnitude relationship between the updated value of the second counter and the second threshold is used to determine whether to send X2 second random access preambles. That is to say, the first node can determine whether to continue the random access channel attempt according to the updated value of the second counter and the second threshold. Among them, the second threshold is configured by higher layer signaling.

[0201] In some embodiments, the magnitude relationship between the updated value of the second counter and the sum of the second threshold plus 1 is used to determine whether to send X2 second random access preambles, or whether the sum of the updated value of the second counter and the second threshold plus 1 is equal is used to determine whether to send the X2 second random access preambles.

[0202] As an embodiment, the magnitude relationship between the updated value of the second counter and the sum of the second threshold plus 1 is used to determine whether the first random access process is not successfully completed, and the second threshold is configured by higher layer signaling.

[0203] As an example, when the second counter is updated by decreasing its value, the initial value of the second counter is the second threshold, and the comparison between the updated value of the second counter and 0 is used to determine whether to send X2 second random access preambles.

[0204] The second threshold is configured by higher layer signaling. The higher layer signaling may be RRC signaling.

[0205] As an example, when the second counter is the preamble transmission counter, the configuration of the second threshold refers to the configuration method of the preamble transmission counter. For example, the second threshold is configured by "preambleTransMax" in the RRC IE RACH-ConfigGeneric, and the first threshold is configured by a newly introduced IE parameter in the RRC.

[0206] As an example, the second threshold is indicated by the second information. The second information may be the "preambleTransMax" in the RRC IE, or when the second information includes the "preambleTransMax", the first threshold is indicated by the third information. For example, the second information indicates the maximum number of transmissions, and the third information indicates the maximum number of PRACH transmissions.

[0207] As an example, when the first threshold is configured by "preambleTransMax", the second threshold is configured by a newly introduced IE parameter in the RRC.

[0208] As an example, the first threshold is indicated by the second information described above, and the second threshold is indicated by the third information.

[0209] As an example, the second threshold is the maximum number of transmissions for all complex PRACH transmissions.

[0210] The comparison between the updated value of the second counter and the sum of the second threshold plus 1 is used to determine whether to send X2 second random access preambles, including abandoning the transmission of X2 second random access preambles when the updated value of the second counter is greater than the second threshold; it also includes jointly determining whether to send X2 second random access preambles based on the comparison between the updated value of the second counter and the second threshold and the comparison between the updated value of the first counter and the first threshold.

[0211] As an example, when the updated value of the first counter is less than the first threshold and the updated value of the second counter is not equal to the sum of the second threshold plus 1, send X2 second random access preambles; when the updated value of the first counter is greater than the first threshold or the updated value of the second counter is equal to the sum of the second threshold plus 1, abandon the transmission of X2 second random access preambles.

[0212] As an embodiment, when the updated value of the first counter is less than or equal to the first threshold and the updated value of the second counter is not equal to the sum of the second threshold plus 1, send the X2 second random access preambles; when the updated value of the first counter is greater than the first threshold or the updated value of the second counter is equal to the sum of the second threshold plus 1, abandon sending the X2 second random access preambles.

[0213] As an embodiment, when the updated value of the first counter is less than the first threshold and the updated value of the second counter is not equal to the sum of the second threshold plus 1, send the X2 second random access preambles; when the updated value of the first counter is equal to or greater than the first threshold or the updated value of the second counter is equal to the sum of the second threshold plus 1, abandon sending the X2 second random access preambles.

[0214] As an embodiment, when the updated value of the first counter is less than the first threshold and the updated value of the second counter is less than the sum of the second threshold plus 1, send the X2 second random access preambles; when the updated value of the first counter is greater than the first threshold or the updated value of the second counter is equal to the sum of the second threshold plus 1, abandon sending the X2 second random access preambles.

[0215] As an embodiment, when the updated value of the first counter is less than or equal to the first threshold and the updated value of the second counter is less than the sum of the second threshold plus 1, send the X2 second random access preambles; when the updated value of the first counter is greater than the first threshold or the updated value of the second counter is equal to the sum of the second threshold plus 1, abandon sending the X2 second random access preambles.

[0216] As an embodiment, when the updated value of the first counter is less than the first threshold and the updated value of the second counter is less than the sum of the second threshold plus 1, send the X2 second random access preambles; when the updated value of the first counter is equal to or greater than the first threshold or the updated value of the second counter is equal to the sum of the second threshold plus 1, abandon sending the X2 second random access preambles.

[0217] In some embodiments, when the updated value of the second counter is greater than the second threshold, the first node needs to indicate to the upper layer so that the upper layer can determine whether the first random access process is successful.

[0218] As an embodiment, when the updated value of the second counter is equal to the sum of the second threshold plus 1, indicate a random access problem to the upper layer.

[0219] As an embodiment, when the updated value of the first counter is greater than the first threshold or the updated value of the second counter is equal to the sum of the second threshold plus 1, an indication of a random access problem is sent to the upper layer.

[0220] As an embodiment, when the updated value of the first counter is equal to or greater than the first threshold or the updated value of the second counter is equal to the sum of the second threshold plus 1, an indication of a random access problem is sent to the upper layer.

[0221] As an embodiment, if the second counter (e.g., preamble transmission counter) exceeds the maximum number of transmissions, or if the first counter (e.g., PRACH transmission counter) exceeds the total maximum number of PRACH transmissions or the total maximum number of ROs, then an indication of a random access problem (i.e., abandonment of retransmission of duplicate PRACH transmissions) is sent to the upper layer; if the second counter (e.g., preamble transmission counter) does not exceed the maximum number of transmissions and the first counter (e.g., PRACH transmission counter) does not exceed the total maximum number of PRACH transmissions or the total maximum number of ROs, then retransmission of the duplicate PRACH transmission is performed.

[0222] In the method embodiments described above, regardless of the number of PRACH transmissions of the duplicate PRACH, the first node can control the maximum number of transmissions and the total number of PRACH transmissions or the total number of ROs occupied, which is beneficial to balancing the resource consumption of retransmission of duplicate PRACH and the effectiveness of random access.

[0223] For ease of understanding, the following combines Figure 4 to provide an exemplary illustration of a solution in which the total number of PRACH transmissions and the maximum number of transmissions of all duplicate PRACH transmissions in multiple random access channel attempts are jointly used to determine whether to perform retransmission of duplicate PRACH. Figure 4 The figure shows a schematic flowchart of another possible implementation of the method of the embodiment of the present application by the first node.

[0224] See Figure 4 , in step S402, the first random access process starts.

[0225] In step S404, the preamble transmission counter is set to 1. This preamble transmission counter is the second counter.

[0226] In step S406, the PRACH transmission counter is set to the number of PRACH transmissions in the initial duplicate PRACH transmission. This PRACH transmission counter is the first counter.

[0227] In step S408, a random access resource selection process is performed.

[0228] In step S410, multiple preambles are respectively sent on multiple ROs in a ROG. The preambles sent in different times can be different or the same.

[0229] In step S412, it is determined whether a RAR is successfully received within the RAR time window. If a RAR is successfully received, step S422 is executed; if the RAR reception is unsuccessful within the RAR time window, step S414 is executed.

[0230] In step S414, the PRACH transmission counter is updated. The updated PRACH transmission counter is the sum of the value of the original PRACH transmission counter and the number of PRACH transmissions in the retransmission complex PRACH transmission. The number of PRACH transmissions in the retransmission complex PRACH transmission can be different or the same as the number of PRACH transmissions in the previous retransmission complex PRACH transmission.

[0231] In step S416, it is determined whether the value of the updated PRACH transmission counter is greater than the maximum total number of PRACH transmissions. If it is greater, step S424 is executed; if it is not greater, step S418 is executed.

[0232] In step S418, the preamble transmission counter is updated. The updated preamble transmission counter is the sum of the value of the original preamble transmission counter and 1.

[0233] In step S420, it is determined whether the value of the updated preamble transmission counter is greater than the maximum number of transmissions. If it is greater, step S424 is executed; if it is not greater, steps S408 to S412 are repeatedly executed.

[0234] In step S422, if a RAR is successfully received within the RAR time window, it is considered that the random access process is successfully completed, and thus the first random access process ends.

[0235] In step S424, if the RAR reception is unsuccessful within the RAR time window, and the PRACH transmission counter exceeds the maximum total number of PRACH transmissions, or the preamble transmission counter exceeds the maximum number of transmissions, the retransmission complex PRACH transmission is abandoned. In this scenario, a random access problem is indicated to the upper layer, and the random access process is considered not to be successfully completed, and the first random access process ends.

[0236] Through the method embodiments described above, the total resources occupied by the complex PRACH transmission and retransmission can be controlled, thereby avoiding invalid repeated transmissions, consuming a large amount of resources, and deteriorating preamble conflicts.

[0237] As described above in conjunction with Figures 1 to 4 ,the method embodiments of the present application are described in detail. Next, in conjunction with Figures 5 to 8, a device embodiment of the present application is described in detail. It should be understood that the description of the method embodiment corresponds to the description of the device embodiment. Therefore, for the parts not described in detail, reference can be made to the previous method embodiment.

[0238] Figure 5 A first node for wireless communication provided by an embodiment of the present application. As Figure 5 shown, the first node 500 includes a first transmitter 510, a first receiver 520, and a first counter 530.

[0239] The first transmitter 510 is configured to send X1 first random access preambles, where X1 is a positive integer greater than 1;

[0240] The first receiver 520 is configured to monitor the control signaling of the first random access response within a first time window, where the first random access response corresponds to the X1 first random access preambles;

[0241] The first counter 530 is configured to, when the first time window expires and the reception of the first random access response is not successful, increase the current value by X2 to obtain an updated value of the first counter 530, where X2 is a positive integer greater than or equal to X1;

[0242] Wherein, the magnitude relationship between the updated value of the first counter 530 and a first threshold is used to determine whether to send X2 second random access preambles, and the first threshold is configured by higher layer signaling.

[0243] As an embodiment, the first transmitter 510 is further configured to send the X2 second random access preambles when the updated value of the first counter 530 is less than or equal to the first threshold; and to abandon sending the X2 second random access preambles when the updated value of the first counter 530 is greater than the first threshold.

[0244] As an embodiment, the first node 500 further includes a second counter, which is configured to increase the current value by 1 to obtain an updated value of the second counter, and the magnitude relationship between the updated value of the second counter and the sum of the second threshold plus 1 is used to determine whether to send the X2 second random access preambles, or whether the updated value of the second counter is equal to the sum of the second threshold plus 1 is used to determine whether to send the X2 second random access preambles, and the second threshold is configured by higher layer signaling.

[0245] As an embodiment, the second counter is further configured to set an initial value of 1, and the initial value of the second counter is less than or equal to the current value of the second counter.

[0246] As an example, the first transmitter 510 is further configured to send the X2 second random access preambles when the updated value of the first counter is less than the first threshold and the updated value of the second counter is not equal to the sum of the second threshold and 1; and to abandon sending the X2 second random access preambles when the updated value of the first counter is greater than the first threshold or the updated value of the second counter is equal to the sum of the second threshold and 1.

[0247] As an example, the first node 500 further includes a first processor, which is configured to indicate a random access problem to the upper layer when the updated value of the second counter is equal to the sum of the second threshold and 1.

[0248] As an example, the first counter 530 is further configured to set an initial value to X0, where X0 is a positive integer greater than 1, and the initial value of the first counter 530 is less than or equal to the current value of the first counter 530; the first node 500 further includes a second processor, which is configured to select X0 physical random access channel opportunities; wherein, the X0 physical random access channel opportunities are used for the first random access procedure.

[0249] As an example, the first node 500 further includes a third processor, which is configured to indicate a random access problem to the upper layer when the updated value of the first counter 530 is greater than the first threshold.

[0250] As an example, the first node 500 further includes a fourth processor, which is configured to stop the first time window when the reception of the first random access response is successful within the first time window.

[0251] As an example, the first receiver 520 is further configured to receive first information, which is used to determine a plurality of candidate values, and the plurality of candidate values includes the X1 and the X2.

[0252] As an example, the first transmitter 510 and the first receiver 520 may be a transceiver 730. The first node 500 may further include a processor 710 and a memory 720, specifically as Figure 7 shown.

[0253] Figure 6 A second node for wireless communication provided by an embodiment of the present application. As Figure 6 shown, the second node 600 includes a second receiver 610 and a fifth processor 620.

[0254] The second receiver 610 is configured to perform the reception of X1 first random access preambles, where X1 is a positive integer greater than 1;

[0255] A fifth processor 620, which can be used to determine whether to send control signaling of a first random access response within a first time window according to the reception situation of the X1 first random access preambles, where the first random access response corresponds to the X1 first random access preambles;

[0256] Wherein, when the first time window expires and the control signaling of the first random access response fails to be sent successfully, the magnitude relationship between the updated value of a first counter of a first node that sends the X1 first random access preambles and a first threshold is used to determine whether to perform reception of X2 second random access preambles, X2 is a positive integer greater than or equal to X1, and the first threshold is configured by higher layer signaling.

[0257] As an embodiment, the second receiver 610 is further configured to perform reception of the X2 second random access preambles when the updated value of the first counter is less than the first threshold; and to abandon performing reception of the X2 second random access preambles when the updated value of the first counter is greater than the first threshold.

[0258] As an embodiment, the magnitude relationship between the updated value of a second counter of the first node and the sum of a second threshold plus 1 is used to determine whether to perform reception of the X2 second random access preambles, or whether the updated value of the second counter of the first node is equal to the sum of the second threshold plus 1 is used to determine whether to perform reception of the X2 second random access preambles, and the second threshold is configured by higher layer signaling.

[0259] As an embodiment, the second receiver 610 is further configured to perform reception of the X2 second random access preambles when the updated value of the first counter is less than the first threshold and the updated value of the second counter is not equal to the sum of the second threshold plus 1; and to abandon performing reception of the X2 second random access preambles when the updated value of the first counter is greater than the first threshold or the updated value of the second counter is equal to the sum of the second threshold plus 1.

[0260] As an embodiment, the fifth processor 620 is further configured to stop the first time window within the first time window when the control signaling of the first random access response is sent successfully.

[0261] As an embodiment, the second node 600 further includes a second transmitter, which can be used to send first information, and the first information is used to determine a plurality of candidate values, and the plurality of candidate values include the X1 and the X2.

[0262] As an embodiment, the second receiver 610 can be a transceiver 730, and the fifth processor 620 can be a processor 710. The second node 600 can further include a memory 720, specifically asFigure 7 as shown

[0263] Figure 7 is a schematic structural diagram of a communication device according to an embodiment of the present application. Figure 7 The dotted lines in indicate that the unit or module is optional. The device 700 can be used to implement the method described in the above method embodiment. The device 700 can be a chip, a user equipment or a network equipment.

[0264] The device 700 may include one or more processors 710. The processor 710 can support the device 700 to implement the method described in the foregoing method embodiment. The processor 710 can be a general-purpose processor or a dedicated processor. For example, the processor can be a central processing unit (CPU). Alternatively, the processor can also be other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field programmable gate arrays (FPGAs) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor can be a microprocessor or the processor can also be any conventional processor, etc.

[0265] The device 700 may further include one or more memories 720. A program is stored on the memory 720, and the program can be executed by the processor 710, so that the processor 710 executes the method described in the foregoing method embodiment. The memory 720 can be independent of the processor 710 or integrated in the processor 710.

[0266] The device 700 may further include a transceiver 730. The processor 710 can communicate with other devices or chips through the transceiver 730. For example, the processor 710 can perform data transmission and reception with other devices or chips through the transceiver 730.

[0267] Figure 8 is a schematic diagram of the hardware module of the communication device provided by the embodiment of the present application. Specifically, Figure 8 shows a block diagram of a first communication device 850 and a second communication device 810 that communicate with each other in an access network.

[0268] The first communication device 850 includes a controller / processor 859, a memory 860, a data source 867, a transmitting processor 868, a receiving processor 856, a multi-antenna transmitting processor 857, a multi-antenna receiving processor 858, a transmitter / receiver 854, and an antenna 852.

[0269] The second communication device 810 includes a controller / processor 875, a memory 876, a data source 877, a receiving processor 870, a transmitting processor 816, a multi-antenna receiving processor 872, a multi-antenna transmitting processor 871, a transmitter / receiver 818, and an antenna 820.

[0270] In the transmission from the second communication device 810 to the first communication device 850, at the second communication device 810, upper layer data packets from the core network or from the data source 877 are provided to the controller / processor 875. The core network and the data source 877 represent all protocol layers above the L2 layer. The controller / processor 875 implements the functionality of the L2 layer. In the transmission from the second communication device 810 to the first communication device 850, the controller / processor 875 provides header compression, encryption, packet segmentation and reordering, multiplexing between logical and transport channels, and radio resource allocation to the first communication device 850 based on various priority metrics. The controller / processor 875 is also responsible for retransmission of lost packets and signaling to the first communication device 850. The transmitting processor 816 and the multi-antenna transmitting processor 871 implement various signal processing functions for the Ll layer (i.e., the physical layer). The transmitting processor 816 implements coding and interleaving to facilitate forward error correction at the second communication device 810, and 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 transmitting processor 871 performs digital space precoding on the coded and modulated symbols, including codebook-based precoding and non-codebook-based precoding, and beamforming processing, to generate one or more spatial streams. The transmitting processor 816 then maps each spatial stream to subcarriers, multiplexes with reference signals (e.g., pilots) in the time domain and / or frequency domain, and then uses the inverse fast Fourier transform to generate a physical channel carrying time-domain multi-carrier symbol streams. Subsequently, the multi-antenna transmitting processor 871 performs transmit analog precoding / beamforming operations on the time-domain multi-carrier symbol streams. Each transmitter 818 converts the baseband multi-carrier symbol streams provided by the multi-antenna transmitting processor 871 into radio frequency streams, and then provides them to different antennas 820.

[0271] In the transmission from the second communication device 810 to the first communication device 850, at the first communication device 850, each receiver 854 receives signals via its respective antenna 852. Each receiver 854 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 receive processor 856. The receive processor 856 and the multi-antenna receive processor 858 perform various signal processing functions of the L1 layer. The multi-antenna receive processor 858 performs receive analog precoding / beamforming operations on the baseband multi-carrier symbol stream from the receivers 854. The receive processor 856 uses the fast Fourier transform to convert the baseband multi-carrier symbol stream after the receive analog precoding / beamforming operations 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 receive processor 856, where the reference signal will be used for channel estimation, and the data signal recovers any spatial streams destined for the first communication device 850 after multi-antenna detection in the multi-antenna receive processor 858. The symbols on each spatial stream are demodulated and recovered in the receive processor 856, and soft decisions are generated. Subsequently, the receive processor 856 decodes and de-interleaves the soft decisions to recover the upper layer data and control signals transmitted by the second communication device 810 on the physical channel. Subsequently, the upper layer data and control signals are provided to the controller / processor 859. The controller / processor 859 performs the functions of the L2 layer. The controller / processor 859 may be associated with a memory 860 that stores program code and data. The memory 860 may be referred to as a computer-readable medium. In the transmission from the second communication device 810 to the first communication device 850, the controller / processor 859 provides demultiplexing 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 810. Subsequently, the upper layer data packets are provided to all protocol layers above the L2 layer. Various control signals may also be provided to the L3 for L3 processing.

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

[0273] In the transmission from the first communication device 850 to the second communication device 810, the functions at the second communication device 810 are similar to the receiving functions described at the first communication device 850 in the transmission from the second communication device 810 to the first communication device 850. Each receiver 818 receives a radio frequency signal through its corresponding antenna 820, converts the received radio frequency signal into a baseband signal, and provides the baseband signal to the multi-antenna receive processor 872 and the receive processor 870. The receive processor 870 and the multi-antenna receive processor 872 jointly implement the Ll layer functions. The controller / processor 875 implements the L2 layer functions. The controller / processor 875 may be associated with a memory 876 that stores program code and data. The memory 876 may be referred to as a computer-readable medium. In the transmission from the first communication device 850 to the second communication device 810, the controller / processor 875 provides demultiplexing between transport and logical channels, packet reassembly, decryption, header decompression, and control signal processing to recover the upper layer data packet from the first communication device 850. The upper layer data packet from the controller / processor 875 may be provided to the core network or all protocol layers above the L2 layer, and various control signals may also be provided to the core network or L3 for L3 processing.

[0274] As an embodiment, the first communication device 850 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 with the at least one processor, and the first communication device 850 is at least configured to: send X1 first random access preambles, where X1 is a positive integer greater than 1; 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; when the first time window expires and the reception of the first random access response is not successful, increase the current value of a first counter by X2 to obtain an updated value of the first counter, where X2 is a positive integer greater than or equal to X1; wherein, the magnitude relationship between the updated value of the first counter and a first threshold is used to determine whether to send X2 second random access preambles, and the first threshold is configured by higher layer signaling.

[0275] As an embodiment, the first communication device 850 includes: a memory storing a computer-readable instruction program, and the computer-readable instruction program generates actions when executed by at least one processor, the actions including: sending X1 first random access preambles, where X1 is a positive integer greater than 1; 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; when the first time window expires and the reception of the first random access response is not successful, increase the current value of a first counter by X2 to obtain an updated value of the first counter, where X2 is a positive integer greater than or equal to X1; wherein, the magnitude relationship between the updated value of the first counter and a first threshold is used to determine whether to send X2 second random access preambles, and the first threshold is configured by higher layer signaling.

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

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

[0278] As an embodiment, the first communication device 850 is a user equipment, and this user equipment can act as a relay node.

[0279] As an embodiment, the first communication device 850 is a user equipment supporting V2X, and this user equipment can act as a relay node.

[0280] As an embodiment, the first communication device 850 is a user equipment supporting D2D, and this user equipment can act as a relay node.

[0281] As an example, the first communication device 850 is a network control relay NCR.

[0282] As an example, the first communication device 850 is a relay repeater.

[0283] As an example, the first communication device 850 is a relay.

[0284] As an example, the second communication device 810 is a base station.

[0285] As an example, the antenna 852, the transmitter 854, the multi-antenna transmission processor 857, the transmission processor 868, and the controller / processor 859 are used to send X1 first random access preambles in the present application.

[0286] As an example, the antenna 820, the receiver 818, the multi-antenna reception processor 872, the reception processor 870, and the controller / processor 875 are used to perform the reception of X1 first random access preambles in the present application.

[0287] As an example, the antenna 852, the receiver 854, the multi-antenna reception processor 858, the reception processor 856, and the controller / processor 859 are used to monitor the first random access response in the present application within the first time window.

[0288] As an example, the antenna 820, the transmitter 818, the multi-antenna transmission processor 871, the transmission processor 816, and the controller / processor 875 are used to determine whether to send the first random access response in the present application within the first time window.

[0289] An embodiment of the present application further provides a computer-readable storage medium for storing a program. The computer-readable storage medium can be applied to the terminal or network device provided by the embodiment of the present application, and the program enables the computer to execute the methods performed by the terminal or network device in various embodiments of the present application.

[0290] An embodiment of the present application further 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 by the embodiment of the present application, and the program enables the computer to execute the methods performed by the terminal or network device in various embodiments of the present application.

[0291] An embodiment of the present application further provides a computer program. The computer program can be applied to the terminal or network device provided by the embodiment of the present application, and the computer program enables the computer to execute the methods performed by the terminal or network device in various embodiments of the present application.

[0292] It should be understood that the terms "system" and "network" in this application may be used interchangeably. Additionally, the terms used in this application are only for explaining specific embodiments of this application and are not intended to limit this application. Terms such as "first", "second", "third", and "fourth" in the specification, claims, and drawings of this application are used to distinguish different objects and not to describe a specific order. Furthermore, the terms "comprising" and "having" and any variations thereof are intended to cover non-exclusive inclusion.

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

[0294] In the embodiments of this application, "B corresponding to A" means that B is associated with A, and B can be determined according to A. However, it should also 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.

[0295] In the embodiments of this application, the term "corresponding" may indicate a direct or indirect corresponding relationship between two parties, may also indicate an associated relationship between two parties, or may also be relationships such as indication and being indicated, configuration and being configured, etc.

[0296] In the embodiments of this application, "predefined" or "preconfigured" can be implemented by pre-saving corresponding codes, tables, or other means that can be used to indicate relevant information in a device (for example, including user equipment and network equipment), and this application does not limit its specific implementation manner. For example, predefined can refer to being defined in a protocol.

[0297] In the embodiments of this application, the "protocol" may refer to standard protocols in the communication field. For example, it may include LTE protocols, NR protocols, and related protocols applied to future communication systems, and this application does not limit this.

[0298] In the embodiments of this application, the term "and / or" is merely a description of the associated relationship of associated objects, indicating that there can be three relationships. For example, A and / or B can represent: A exists alone, A and B exist simultaneously, and B exists alone. Additionally, the character " / " in this article generally indicates that the associated objects before and after are in an "or" relationship.

[0299] In various embodiments of the present application, the magnitudes of the serial numbers of the above processes do not mean the order of execution is prior or posterior, and the order of execution of each process should be determined according to its function and internal logic, and should not constitute any limitation to the implementation process of the embodiments of the present application.

[0300] In several embodiments provided by 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 merely illustrative. For example, the division of the units is only a logical function division, and there may be other division methods in actual implementation. For example, 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 displayed or discussed coupling or direct coupling or communication connection to each other can be through some interfaces, and the indirect coupling or communication connection of the devices or units can be in electrical, mechanical or other forms.

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

[0302] In addition, in each embodiment of the present application, the functional units can be integrated in a processing unit, or each unit can exist physically alone, or two or more units can be integrated in one unit.

[0303] 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 processes or functions described in the embodiments of the present application are generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, the computer instructions can be transmitted from a website, computer, server, or data center to another website, computer, server, or data center by wire (such as coaxial cable, optical fiber, digital subscriber line (DSL)) or wirelessly (such as infrared, wireless, microwave, etc.). The computer-readable storage medium can 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 integrated available media. The available medium can be a magnetic medium (such as a floppy disk, hard disk, magnetic tape), an optical medium (such as a digital video disc (DVD)), or a semiconductor medium (such as a solid state disk (SSD)), etc.

[0304] As described above, the foregoing are only specific embodiments of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art can easily conceive of changes or substitutions within the technical scope disclosed in the present application, and all such changes or substitutions should be covered by the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims

1. A method in a first node for wireless communication, characterized in that, comprising: sending X1 first random access preambles, where X1 is a positive integer greater than 1; 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; when the first time window expires and the reception of the first random access response is not successful, obtaining an updated value of a first counter; when the updated value of the first counter is less than or equal to a first threshold, sending X2 second random access preambles; when the updated value of the first counter is greater than the first threshold, abandoning sending the X2 second random access preambles; wherein, the first threshold is configured by higher layer signaling, and X2 is a positive integer greater than X1.

2. The method according to claim 1, characterized in that, comprising: if the updated value of the first counter is less than the first threshold, selecting X2 physical random access channel opportunities for sending the X2 second random access preambles.

3. The method according to claim 1, characterized in that, the first counter is PREAMBLE_TRANSMISSION_COUNTER.

4. The method according to claim 1, characterized in that, the first threshold is configured by "preambleTransMax" in a radio resource control information element RACH-ConfigGeneric.

5. The method according to claim 1, characterized in that, comprising: increasing the current value of a second counter by 1 to obtain an updated value of the second counter, and the magnitude relationship between the updated value of the second counter and the sum of a second threshold plus 1 is used to determine whether to send the X2 second random access preambles, or whether the updated value of the second counter is equal to the sum of the second threshold plus 1 is used to determine whether to send the X2 second random access preambles, and the second threshold is configured by higher layer signaling.

6. The method according to claim 5, characterized in that, comprising: setting an initial value of the second counter to 1, and the initial value of the second counter is less than or equal to the current value of the second counter.

7. The method according to claim 5 or 6, characterized in that, comprising: when the updated value of the first counter is less than or equal to the first threshold and the updated value of the second counter is not equal to the sum of the second threshold plus 1, sending the X2 second random access preambles; when the updated value of the first counter is greater than the first threshold, abandoning sending the X2 second random access preambles.

8. The method according to claim 1, characterized in that, comprising: setting an initial value of the first counter, the initial value of the first counter is less than or equal to the current value of the first counter, and the updated value of the first counter is a value obtained by updating the first counter once based on the current value; selecting X0 physical random access channel opportunities; wherein, the X0 physical random access channel opportunities are used for a first random access process.

9. The method according to claim 1, wherein, the relationship between the updated value of the first counter and the first threshold is used to determine whether the first random access procedure is not successfully completed.

10. The method according to claim 1, wherein, it includes: when the updated value of the first counter is greater than the first threshold, indicating a random access problem to the upper layer.

11. The method according to claim 10, wherein, indicating a random access problem to the upper layer is equivalent to abandoning the transmission of the X2 second random access preambles.

12. The method according to claim 1, wherein, it includes: within the first time window, when the reception of the first random access response is successful, stopping the first time window.

13. The method according to claim 1, wherein, it includes: receiving first information, the first information being used to determine a plurality of candidate values, the plurality of candidate values including the X1 and the X2, the plurality of candidate values including at least two of {2, 4, 8}.

14. A method in a second node for wireless communication, wherein, it includes: performing reception of X1 first random access preambles, where X1 is a positive integer greater than 1; determining whether to send control signaling of a first random access response within a first time window according to the reception situation of the X1 first random access preambles, the first random access response corresponding to the X1 first random access preambles; when the updated value of the first counter of the first node that transmits the X1 first random access preambles is less than or equal to a first threshold, performing reception of X2 second random access preambles; when the updated value of the first counter is greater than the first threshold, abandoning the reception of the X2 second random access preambles; wherein, when the first time window expires and the control signaling of the first random access response is not successfully sent, X2 is a positive integer greater than X1, and the first threshold is configured by higher layer signaling.

15. The method according to claim 14, wherein, it includes: if the updated value of the first counter is less than the first threshold, receiving the X2 second random access preambles on X2 physical random access channel opportunities.

16. The method according to claim 14, wherein, the first counter is PREAMBLE_TRANSMISSION_COUNTER.

17. The method according to claim 14, wherein, the first threshold is configured through "preambleTransMax" in the radio resource control information element RACH-ConfigGeneric.

18. The method according to claim 14, wherein, it includes: The magnitude relationship between the updated value of the second counter of the first node and the sum of the second threshold plus 1 is used to determine whether to perform the reception of the X2 second random access preambles, or whether the sum of the updated value of the second counter of the first node and the second threshold plus 1 is equal is used to determine whether to perform the reception of the X2 second random access preambles, and the second threshold is configured by higher layer signaling.

19. The method according to claim 18, wherein, it includes: When the updated value of the first counter is less than or equal to the first threshold and the updated value of the second counter is not equal to the sum of the second threshold plus 1, perform the reception of the X2 second random access preambles; when the updated value of the first counter is greater than the first threshold, abandon the reception of the X2 second random access preambles.

20. The method according to claim 14, wherein, the magnitude relationship between the updated value of the first counter and the first threshold is used to determine whether the first random access procedure is not successfully completed.

21. The method according to claim 14, wherein, it includes: Within the first time window, when the control signaling of the first random access response is successfully sent, stop the first time window.

22. The method according to claim 14, wherein, it includes: Send first information, the first information is used to determine a plurality of candidate values, the plurality of candidate values include the X1 and the X2, and the plurality of candidate values include at least two of {2, 4, 8}.

23. A first node for wireless communication, wherein, it includes: A first transmitter, configured to send X1 first random access preambles, where X1 is a positive integer greater than 1; A first receiver, configured to monitor the control signaling of the first random access response within a first time window, and the first random access response corresponds to the X1 first random access preambles; A first counter, configured to obtain the updated value of the first counter when the first time window expires and the reception of the first random access response is not successful; The first transmitter is further configured to send X2 second random access preambles when the updated value of the first counter is less than or equal to a first threshold; when the updated value of the first counter is greater than the first threshold, abandon sending the X2 second random access preambles; wherein, the first threshold is configured by higher layer signaling, and X2 is a positive integer greater than X1.

24. The first node according to claim 23, wherein, it includes: The first transmitter is further configured to select X2 physical random access channel opportunities for the transmission of the X2 second random access preambles if the updated value of the first counter is less than the first threshold.

25. The first node according to claim 23 or 24, wherein, the first counter is PREAMBLE_TRANSMISSION_COUNTER.

26. The first node according to claim 23 or 24, wherein, The first threshold is configured by "preambleTransMax" in the radio resource control information element RACH-ConfigGeneric.

27. The first node according to claim 25, wherein, The first threshold is configured by "preambleTransMax" in the radio resource control information element RACH-ConfigGeneric.

28. The first node according to any one of claims 23-24, 27, wherein, The first node further includes: A second counter, configured to obtain an updated value of the second counter by incrementing the current value by 1, and the magnitude relationship between the updated value of the second counter and the sum of the second threshold plus 1 is used to determine whether to send the X2 second random access preambles, or whether the updated value of the second counter is equal to the sum of the second threshold plus 1 is used to determine whether to send the X2 second random access preambles, and the second threshold is configured by higher layer signaling.

29. The first node according to claim 25, wherein, The first node further includes: A second counter, configured to obtain an updated value of the second counter by incrementing the current value by 1, and the magnitude relationship between the updated value of the second counter and the sum of the second threshold plus 1 is used to determine whether to send the X2 second random access preambles, or whether the updated value of the second counter is equal to the sum of the second threshold plus 1 is used to determine whether to send the X2 second random access preambles, and the second threshold is configured by higher layer signaling.

30. The first node according to claim 26, wherein, The first node further includes: A second counter, configured to obtain an updated value of the second counter by incrementing the current value by 1, and the magnitude relationship between the updated value of the second counter and the sum of the second threshold plus 1 is used to determine whether to send the X2 second random access preambles, or whether the updated value of the second counter is equal to the sum of the second threshold plus 1 is used to determine whether to send the X2 second random access preambles, and the second threshold is configured by higher layer signaling.

31. The first node according to claim 28, wherein, including: The second counter is further configured to set an initial value of 1, and the initial value of the second counter is less than or equal to the current value of the second counter.

32. The first node according to claim 29 or 30, wherein, including: The second counter is further configured to set an initial value of 1, and the initial value of the second counter is less than or equal to the current value of the second counter.

33. The first node according to claim 28, wherein, including: The first transmitter is further configured to send the X2 second random access preambles when the updated value of the first counter is less than or equal to the first threshold and the updated value of the second counter is not equal to the sum of the second threshold plus 1; and to abandon sending the X2 second random access preambles when the updated value of the first counter is greater than the first threshold.

34. The first node according to any one of claims 29 - 31, characterized in that, comprising: The first transmitter is further configured to send the X2 second random access preambles when the updated value of the first counter is less than or equal to the first threshold and the updated value of the second counter is not equal to the sum of the second threshold plus 1; and to abandon sending the X2 second random access preambles when the updated value of the first counter is greater than the first threshold.

35. The first node according to claim 32, characterized in that, comprising: The first transmitter is further configured to send the X2 second random access preambles when the updated value of the first counter is less than or equal to the first threshold and the updated value of the second counter is not equal to the sum of the second threshold plus 1; and to abandon sending the X2 second random access preambles when the updated value of the first counter is greater than the first threshold.

36. The first node according to any one of claims 23 - 24, 27, 29 - 31, 33, 35, characterized in that, comprising: The first counter is further configured to set an initial value, the initial value of the first counter is less than or equal to the current value of the first counter, and the updated value of the first counter is the value after the first counter is updated once based on the current value; The first node further comprises a second processor, configured to select X0 physical random access channel opportunities; wherein, the X0 physical random access channel opportunities are used for a first random access procedure.

37. The first node according to claim 25, characterized in that, comprising: The first counter is further configured to set an initial value, the initial value of the first counter is less than or equal to the current value of the first counter, and the updated value of the first counter is the value after the first counter is updated once based on the current value; The first node further comprises a second processor, configured to select X0 physical random access channel opportunities; wherein, the X0 physical random access channel opportunities are used for a first random access procedure.

38. The first node according to claim 26, characterized in that, comprising: The first counter is further configured to set an initial value, the initial value of the first counter is less than or equal to the current value of the first counter, and the updated value of the first counter is the value after the first counter is updated once based on the current value; The first node further comprises a second processor, configured to select X0 physical random access channel opportunities; wherein, the X0 physical random access channel opportunities are used for a first random access procedure.

39. The first node according to claim 28, characterized in that, comprising: The first counter is further configured to set an initial value, the initial value of the first counter is less than or equal to the current value of the first counter, and the updated value of the first counter is the value after the first counter is updated once based on the current value; The first node further comprises a second processor, configured to select X0 physical random access channel opportunities; Among them, the X0 physical random access channel opportunities are used for the first random access process.

40. The first node according to claim 32, wherein, comprising: The first counter is further configured to set an initial value, the initial value of the first counter is less than or equal to the current value of the first counter, and the updated value of the first counter is the value after the first counter is updated once based on the current value; The first node further includes a second processor for selecting X0 physical random access channel opportunities; Among them, the X0 physical random access channel opportunities are used for the first random access process.

41. The first node according to claim 34, wherein, comprising: The first counter is further configured to set an initial value, the initial value of the first counter is less than or equal to the current value of the first counter, and the updated value of the first counter is the value after the first counter is updated once based on the current value; The first node further includes a second processor for selecting X0 physical random access channel opportunities; Among them, the X0 physical random access channel opportunities are used for the first random access process.

42. The first node according to any one of claims 23-24, 27, 29-31, 33, 35, 37-41, wherein, The magnitude relationship between the updated value of the first counter and the first threshold is used to determine whether the first random access process is not successfully completed.

43. The first node according to claim 25, wherein, The magnitude relationship between the updated value of the first counter and the first threshold is used to determine whether the first random access process is not successfully completed.

44. The first node according to claim 26, wherein, The magnitude relationship between the updated value of the first counter and the first threshold is used to determine whether the first random access process is not successfully completed.

45. The first node according to claim 28, wherein, The magnitude relationship between the updated value of the first counter and the first threshold is used to determine whether the first random access process is not successfully completed.

46. The first node according to claim 32, wherein, The magnitude relationship between the updated value of the first counter and the first threshold is used to determine whether the first random access process is not successfully completed.

47. The first node according to claim 34, wherein, The magnitude relationship between the updated value of the first counter and the first threshold is used to determine whether the first random access process is not successfully completed.

48. The first node according to claim 36, wherein, The magnitude relationship between the updated value of the first counter and the first threshold is used to determine whether the first random access process is not successfully completed.

49. The first node according to any one of claims 23-24, 27, 29-31, 33, 35, 37-41, 43-48, wherein, The first node further includes: A third processor for indicating a random access problem to the upper layer when the updated value of the first counter is greater than the first threshold.

50. The first node according to claim 25, wherein, the first node further comprises: a third processor, configured to indicate a random access problem to an upper layer when an updated value of the first counter is greater than the first threshold.

51. The first node according to claim 26, wherein, the first node further comprises: a third processor, configured to indicate a random access problem to an upper layer when an updated value of the first counter is greater than the first threshold.

52. The first node according to claim 28, wherein, the first node further comprises: a third processor, configured to indicate a random access problem to an upper layer when an updated value of the first counter is greater than the first threshold.

53. The first node according to claim 32, wherein, the first node further comprises: a third processor, configured to indicate a random access problem to an upper layer when an updated value of the first counter is greater than the first threshold.

54. The first node according to claim 34, wherein, the first node further comprises: a third processor, configured to indicate a random access problem to an upper layer when an updated value of the first counter is greater than the first threshold.

55. The first node according to claim 36, wherein, the first node further comprises: a third processor, configured to indicate a random access problem to an upper layer when an updated value of the first counter is greater than the first threshold.

56. The first node according to claim 42, wherein, the first node further comprises: a third processor, configured to indicate a random access problem to an upper layer when an updated value of the first counter is greater than the first threshold.

57. The first node according to claim 49, wherein, indicating a random access problem to an upper layer is equivalent to abandoning sending the X2 second random access preambles.

58. The first node according to any one of claims 50-56, wherein, indicating a random access problem to an upper layer is equivalent to abandoning sending the X2 second random access preambles.

59. The first node according to any one of claims 23-24, 27, 29-31, 33, 35, 37-41, 43-48, 50-57, wherein, the first node further comprises: a fourth processor, configured to stop the first time window when the reception of the first random access response is successful within the first time window.

60. The first node according to claim 25, wherein, the first node further comprises: a fourth processor, configured to stop the first time window when the reception of the first random access response is successful within the first time window.

61. The first node according to claim 26, wherein, the first node further comprises: a fourth processor, configured to stop the first time window when the reception of the first random access response is successful within the first time window.

62. The first node according to claim 28, wherein, the first node further comprises: A fourth processor, configured to stop the first time window when the reception of the first random access response is successful within the first time window.

63. The first node according to claim 32, wherein: The first node further includes: A fourth processor, configured to stop the first time window when the reception of the first random access response is successful within the first time window.

64. The first node according to claim 34, wherein: The first node further includes: A fourth processor, configured to stop the first time window when the reception of the first random access response is successful within the first time window.

65. The first node according to claim 36, wherein: The first node further includes: A fourth processor, configured to stop the first time window when the reception of the first random access response is successful within the first time window.

66. The first node according to claim 42, wherein: The first node further includes: A fourth processor, configured to stop the first time window when the reception of the first random access response is successful within the first time window.

67. The first node according to claim 49, wherein: The first node further includes: A fourth processor, configured to stop the first time window when the reception of the first random access response is successful within the first time window.

68. The first node according to claim 58, wherein: The first node further includes: A fourth processor, configured to stop the first time window when the reception of the first random access response is successful within the first time window.

69. The first node according to any one of claims 23-24, 27, 29-31, 33, 35, 37-41, 43-48, 50-56, 60-68, wherein: including: The first receiver is further configured to receive first information, which is used to determine a plurality of candidate values, the plurality of candidate values include the X1 and the X2, and the plurality of candidate values include at least two of {2, 4, 8}.

70. The first node according to claim 25, wherein: including: The first receiver is further configured to receive first information, which is used to determine a plurality of candidate values, the plurality of candidate values include the X1 and the X2, and the plurality of candidate values include at least two of {2, 4, 8}.

71. The first node according to claim 26, wherein: including: The first receiver is further configured to receive first information, which is used to determine a plurality of candidate values, the plurality of candidate values include the X1 and the X2, and the plurality of candidate values include at least two of {2, 4, 8}.

72. The first node according to claim 28, wherein: including: The first receiver is further configured to receive first information, which is used to determine a plurality of candidate values, the plurality of candidate values including the X1 and the X2, and the plurality of candidate values including at least two of {2, 4, 8}.

73. The first node according to claim 32, wherein: comprises: The first receiver is further configured to receive first information, which is used to determine a plurality of candidate values, the plurality of candidate values including the X1 and the X2, and the plurality of candidate values including at least two of {2, 4, 8}.

74. The first node according to claim 34, wherein: comprises: The first receiver is further configured to receive first information, which is used to determine a plurality of candidate values, the plurality of candidate values including the X1 and the X2, and the plurality of candidate values including at least two of {2, 4, 8}.

75. The first node according to claim 36, wherein: comprises: The first receiver is further configured to receive first information, which is used to determine a plurality of candidate values, the plurality of candidate values including the X1 and the X2, and the plurality of candidate values including at least two of {2, 4, 8}.

76. The first node according to claim 42, wherein: comprises: The first receiver is further configured to receive first information, which is used to determine a plurality of candidate values, the plurality of candidate values including the X1 and the X2, and the plurality of candidate values including at least two of {2, 4, 8}.

77. The first node according to claim 49, wherein: comprises: The first receiver is further configured to receive first information, which is used to determine a plurality of candidate values, the plurality of candidate values including the X1 and the X2, and the plurality of candidate values including at least two of {2, 4, 8}.

78. The first node according to claim 58, wherein: comprises: The first receiver is further configured to receive first information, which is used to determine a plurality of candidate values, the plurality of candidate values including the X1 and the X2, and the plurality of candidate values including at least two of {2, 4, 8}.

79. The first node according to claim 59, wherein: comprises: The first receiver is further configured to receive first information, which is used to determine a plurality of candidate values, the plurality of candidate values including the X1 and the X2, and the plurality of candidate values including at least two of {2, 4, 8}.

80. A second node for wireless communication, wherein: comprises: A second receiver, configured to receive X1 first random access preambles, where X1 is a positive integer greater than 1; A fifth processor, configured to determine whether to send control signaling of a first random access response according to the reception situation of the X1 first random access preambles within a first time window, where the first random access response corresponds to the X1 first random access preambles; The second receiver is further configured to receive the X2 second random access preambles when an updated value of a first counter of a first node that transmits the X1 first random access preambles is less than or equal to a first threshold; and to abandon receiving the X2 second random access preambles when the updated value of the first counter is greater than the first threshold; Wherein, when the first time window expires and the control signaling of the first random access response fails to be successfully transmitted, X2 is a positive integer greater than X1, and the first threshold is configured by higher layer signaling.

81. The second node according to claim 80, wherein, comprising: The second receiver is further configured to receive the X2 second random access preambles on X2 physical random access channel occasions if the updated value of the first counter is less than the first threshold.

82. The second node according to claim 81, wherein, the first counter is PREAMBLE_TRANSMISSION_COUNTER.

83. The second node according to claim 82, wherein, the first threshold is configured by "preambleTransMax" in the radio resource control information element RACH-ConfigGeneric.

84. The second node according to claim 83, wherein, comprising: A magnitude relationship between an updated value of a second counter of the first node and a sum of a second threshold plus 1 is used to determine whether to receive the X2 second random access preambles, or whether an updated value of the second counter of the first node is equal to the sum of the second threshold plus 1 is used to determine whether to receive the X2 second random access preambles, and the second threshold is configured by higher layer signaling.

85. The second node according to claim 84, wherein, comprising: The second receiver is further configured to receive the X2 second random access preambles when the updated value of the first counter is less than or equal to the first threshold and the updated value of the second counter is not equal to the sum of the second threshold plus 1; and to abandon receiving the X2 second random access preambles when the updated value of the first counter is greater than the first threshold.

86. The second node according to claim 85, wherein, A magnitude relationship between the updated value of the first counter and the first threshold is used to determine whether a first random access procedure is not successfully completed.

87. The second node according to claim 86, wherein, comprising: The fifth processor is further configured to stop the first time window within the first time window when the control signaling of the first random access response is successfully transmitted.

88. The second node according to claim 87, wherein, the second node further comprises: A second transmitter, configured to transmit first information, the first information being used to determine a plurality of candidate values, the plurality of candidate values including the X1 and the X2, and the plurality of candidate values including at least two of {2, 4, 8}.

89. A node used for wireless communication, characterized in that, it includes a transceiver, a memory, and a processor. The memory is used to store programs, and the processor is used to call the programs in the memory and control the transceiver to receive or send signals, so that the node executes the method described in any one of claims 1-13 or 14-22.

90. A communication device, characterized in that, it includes a processor for calling a program from a memory, so that the communication device executes the method described in any one of claims 1-13 or 14-22.

91. A chip, characterized in that, it includes a processor for calling a program from a memory, such that a device installed with the chip executes the method described in any one of claims 1-13 or 14-22.

92. A computer-readable storage medium, characterized in that, a program is stored thereon, and the program causes a computer to execute the method described in any one of claims 1-13 or 14-22.

93. A computer program product, characterized in that, it includes a program, and the program causes a computer to execute the method described in any one of claims 1-13 or 14-22.

Images