Method and apparatus in node for wireless communication

Abstract

The present application provides a method and apparatus in a node for wireless communication, for use in reducing resource consumption of multiple PRACH retransmissions. The method comprises: sending X1 first random access preambles, wherein X1 is a positive integer greater than 1; monitoring control signaling of first random access responses within a first time window, wherein the first random access responses correspond to the X1 first random access preambles; and when the first time window expires and the reception of the first random access responses is unsuccessful, increasing the current value of a first counter by X2 to obtain an updated value of the first counter, wherein X2 is a positive integer greater than or equal to X1, the magnitude relationship between the updated value of the first counter and a first threshold is used for determining whether to send X2 second random access preambles, and the first threshold is configured by higher-layer signaling.

Description

Method and apparatus in a node for wireless communication Technical Field

[0001] The present application relates to the field of communication technology, 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 (e.g., new radio (NR) systems) plan to introduce a scheme based on multiple physical random access channel (PRACH) transmissions for retransmissions and increase the number of PRACH transmissions in retransmissions. However, increasing the number of PRACH transmissions in retransmissions consumes additional time-frequency resources and may also increase the probability of PRACH preamble collisions. In this scenario, how to allocate resources for multiple PRACH retransmissions and how to balance the resource consumption of multiple PRACH retransmissions with the effectiveness of random access become issues that need to be addressed.

[0003] Summary of the Invention

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

[0005] In a first aspect, a method in a first node for wireless communication is provided, comprising: sending X1 first random access preambles, where X1 is a positive integer greater than 1; 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; when the first time window expires and reception of the first random access response is unsuccessful, increasing a 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 a 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, where the first threshold is configured by higher layer signaling.

[0006] As an implementation manner, when the updated value of the first counter is less than the first threshold, the X2 second random access preambles are sent; when the updated value of the first counter is greater than the first threshold, the sending of the X2 second random access preambles is abandoned.

[0007] As an implementation manner, the current value of the second counter is increased by 1 to obtain an updated value of the second counter, and the 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 sum of the updated value of the second counter and the second threshold plus 1 is equal to each other is used to determine whether to send the X2 second random access preambles, where the second threshold is configured by higher layer signaling.

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

[0009] As an implementation manner, 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, the X2 second random access preambles are sent; 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, the sending of the X2 second random access preambles is abandoned.

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

[0011] As an implementation method, the initial value of the first counter is set 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; X0 physical random access channel opportunities are selected; wherein the X0 physical random access channel opportunities are used for the first random access process.

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

[0013] As an implementation manner, within the first time window, when the first random access response is received successfully, the first time window is stopped.

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

[0015] In a second aspect, a method is provided in a second node for wireless communication, comprising: performing reception of X1 first random access preambles, where X1 is a positive integer greater than 1; determining, within a first time window, based on reception status of the X1 first random access preambles, whether to send control signaling of a first random access response, where the first random access response corresponds to the X1 first random access preambles; wherein, upon expiration of the first time window, if the control signaling of the first random access response is not successfully sent, a relationship between an updated value of a first counter of the first node that sent 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 higher layer signaling.

[0016] As an implementation manner, when the updated value of the first counter is less than the first threshold, the reception of the X2 second random access preambles is performed; when the updated value of the first counter is greater than the first threshold, the reception of the X2 second random access preambles is abandoned.

[0017] As an implementation manner, a magnitude relationship between the sum of the updated value of the second counter of the first node and the second threshold plus 1 is used to determine whether to perform 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 to each other is used to determine whether to perform reception of the X2 second random access preambles, where the second threshold is configured by higher layer signaling.

[0018] As an implementation manner, 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, the reception of the X2 second random access preambles is performed; 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, the reception of the X2 second random access preambles is abandoned.

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

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

[0021] In a third aspect, a first node for wireless communication is provided, comprising: 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 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; and a first counter, configured to, when the first time window expires and reception of the first random access response is unsuccessful, increase a current value of the 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 a 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, the first threshold being configured by higher layer signaling.

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

[0023] As an implementation manner, the first node further includes a second counter, configured to increase a current value by 1 to obtain an updated value of the second counter, wherein a magnitude relationship between the sum of the updated value of the second counter and the second threshold plus 1 is used to determine whether to send the 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 to each other is used to determine whether to send the X2 second random access preambles, wherein the second threshold is configured by higher layer signaling.

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

[0025] As an implementation manner, the first transmitter 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, 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, give up sending the X2 second random access preambles.

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

[0027] As an implementation method, the first counter is also used to set an initial value 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; the first node also includes a second processor for selecting X0 physical random access channel opportunities; wherein the X0 physical random access channel opportunities are used for the first random access process.

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

[0029] As an implementation manner, the first node further includes a fourth processor, configured to stop the first time window when the first random access response is successfully received within the first time window.

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

[0031] In a fourth aspect, a second node for wireless communication is provided, comprising: a second receiver, configured to receive X1 first random access preambles, where X1 is a positive integer greater than 1; and a fifth processor, configured to determine, within a first time window, based on a reception status of the X1 first random access preambles, whether to send control signaling of a first random access response, where the first random access response corresponds to the X1 first random access preambles. Upon expiration of the first time window, if the control signaling of the first random access response is not successfully sent, a relationship between an updated value of a first counter of the first node that sent 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.

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

[0033] As an implementation manner, a magnitude relationship between the sum of the updated value of the second counter of the first node and the second threshold plus 1 is used to determine whether to perform 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 to each other is used to determine whether to perform reception of the X2 second random access preambles, where the second threshold is configured by higher layer signaling.

[0034] As an implementation manner, 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, perform 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, abandon reception of the X2 second random access preambles.

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

[0036] As an implementation manner, 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, where the plurality of candidate values ​​include the X1 and the X2.

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

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

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

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

[0041] In a ninth aspect, embodiments of the present application provide a computer program product, wherein the computer program product includes a non-transitory computer-readable storage medium storing a computer program, wherein the computer program is operable to cause a computer to perform some or all of the steps of the methods described in each of the above aspects. In some implementations, the computer program product may be a software installation package.

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

[0043] In an embodiment of the present application, when the first random access responses corresponding to X1 first random access preambles are not successfully received, the first node can determine whether to send X2 second random access preambles based on the relationship between the updated value of the first counter and the first threshold, where 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 random access preambles to be transmitted, thereby helping to reduce resource consumption of multiple PRACH retransmissions.

[0044] In an embodiment of the present application, when the first random access response is not successfully received, the first node can determine whether to continue sending the random access preamble based on the first threshold and the updated value of the first counter to balance PRACH resource consumption and random access effectiveness.

[0045] In an embodiment of the present application, the first node supports retransmission based on multiple PRACH, and determines the number of retransmissions for multiple PRACH transmission by using the first threshold and the updated value of the first counter, which not only helps to improve the performance gain of multiple PRACH transmission and increase the coverage range, but also helps to reduce random access delay and improve the utilization efficiency of random access resources. BRIEF DESCRIPTION OF THE DRAWINGS

[0046] FIG1 is a diagram illustrating an example of a system architecture of a wireless communication system to which embodiments of the present application may be applied.

[0047] FIG2 is a schematic flow chart of a method in a first node for wireless communication provided in an embodiment of the present application.

[0048] FIG3 is a flow chart of a possible implementation of the method shown in FIG2 .

[0049] FIG4 is a flow chart of another possible implementation of the method shown in FIG2 .

[0050] FIG5 is a schematic structural diagram of a first node for wireless communication provided in an embodiment of the present application.

[0051] FIG6 is a schematic structural diagram of a second node for wireless communication provided in an embodiment of the present application.

[0052] FIG7 is a schematic structural diagram of the device provided in an embodiment of the present application.

[0053] FIG8 is a schematic diagram of the hardware modules of the communication device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0054] Communication system architecture

[0055] FIG1 is a diagram illustrating an exemplary system architecture of a wireless communication system 100 to which embodiments of the present application may 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 geographic area and may communicate with the user equipment 120 located within the coverage area.

[0056] FIG1 exemplarily shows a network device and two user devices. Optionally, the wireless communication system 100 may include multiple network devices and each network device may include another number of user devices within its coverage area, which is not limited in the embodiments of the present application.

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

[0058] It should be understood that the technical solution of the embodiment of the present application can be targeted at initial access and can also be used for beam failure recovery. Furthermore, the technical solution of the embodiment of the present application can be targeted at random access procedure type-1 (Type-1 random access procedure) and can also be used for random access procedure type-2 (Type-2 random access procedure). Furthermore, the technical solution of the embodiment of the present application can be targeted at Uu interface and can also be used for PC5 interface. Furthermore, the technical solution of the embodiment of the present application can be targeted at single-carrier communication and can also be used for multi-carrier communication. Further, the technical solution of the embodiment of the present application can be targeted at multi-antenna communication and can also be used for single-antenna communication. Further, the technical solution of the embodiment of the present application can be targeted at the scenario of user equipment and base station, and is also applicable to V2X scenario, user equipment and relay, and communication scenario between relay and base station, to achieve similar technical effects in the scenario of user equipment and base station. Furthermore, the technical solutions of the embodiments of the present application can be applied to various communication scenarios, such as enhanced mobile broadband (eMBB) scenarios, ultra-reliable and low-latency communication (URLLC) scenarios, and massive machine type communication (mMTC) scenarios. In addition, adopting a unified solution for different scenarios can also help reduce hardware complexity and costs.

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

[0060] It should be understood that the technical solutions of the embodiments of the present application can be applied to various communication systems, such as: 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 in this application can also be applied to future communication systems, such as the sixth generation mobile communication system, satellite communication system, etc.

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

[0062] The network device in the embodiments of the present application may be a device for communicating with a user equipment, and may also be referred to as an access network device or a radio access network device. For example, the network device may be a base station. The network device in the embodiments of the present application may refer to a radio access network (RAN) node (or device) that connects the user equipment to a wireless network. A base station can broadly cover various names as follows, or be replaced with the following names, such as: NodeB, evolved NodeB (eNB), next generation NodeB (gNB), relay station, access point, transmission point (TRP), transmission 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, baseband unit (BBU), remote radio unit (RRU), active antenna unit (AAU), remote radio head (RRH), central unit (CU), distributed unit (DU), positioning node, etc. A 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. A base station can also refer to a communication module, modem or chip used to be set in the aforementioned device or apparatus. The base station can also be a mobile switching center and a device that performs base station functions in device-to-device D2D, vehicle-to-everything (V2X), and machine-to-machine (M2M) communications, a network-side device in a 6G network, or a device that performs base station functions in future communication systems. The base station can support networks with the same or different access technologies. The embodiments of this application do not limit the specific technology and specific device form used by the network equipment.

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

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

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

[0066] It should be understood that all or part of the functions of the communication device in this application can also be implemented through software functions running on hardware, or through virtualization functions instantiated on a platform (such as a cloud platform).

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

[0068] Coverage enhancement of PRACH transmission

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

[0070] The coverage performance of a communication system varies depending on the frequency band in which it operates. For example, compared to LTE, NR systems operate at higher frequencies (e.g., millimeter wave bands), resulting in greater path loss and, consequently, poorer coverage. Therefore, as communication systems support increasingly higher frequency bands, enhancing coverage becomes a pressing issue.

[0071] In most real-world deployment scenarios, uplink (UL) coverage is a bottleneck for enhancing communication system coverage, as user equipment (UE) capabilities are weaker than those of network equipment. However, with the advancement of communication technology, uplink traffic is increasing in emerging vertical use cases, such as video uploading. In these scenarios, enhancing uplink coverage is a challenge that needs further resolution.

[0072] In related technologies, coverage enhancement solutions already exist for certain uplink channels. For example, NR Release 17 (Rel-17) 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.

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

[0074] As a possible implementation, multiple PRACH transmissions may be used to enhance PRACH transmission coverage. In other words, performance gain of PRACH transmission may be achieved by repeated PRACH transmissions (eg, sending a preamble multiple times in the PRACH).

[0075] To enhance PRACH coverage, the 3GPP Radio Access Network (RAN) 1#110bis-e meeting agreed to use multiple PRACH transmissions using the same beam within a single RACH attempt to achieve performance gains. The RAN1#110bis-e meeting further supports the use of the same PRACH preamble in multiple PRACH transmissions, allowing random access channel occasions (ROs) in different time instances to be used for multiple PRACH transmissions.

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

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

[0078] Based on the above technological advances, subsequent meetings discussed solutions for retransmissions based on multiple PRACH transmissions and increasing the number of PRACH transmissions during retransmissions. For example, the 3GPP RAN1#113 meeting discussed a solution for performing either a single PRACH transmission or multiple PRACH transmissions during the initial random access channel attempt, while allowing an increase in the number of PRACH transmissions during retransmissions. This solution enables coverage-limited user equipment to quickly access the system by adjusting the number of PRACH transmissions during multiple PRACH transmissions during retransmissions when the number of PRACH transmissions determined during the initial random access channel attempt does not meet performance requirements. In particular, when the user equipment's PRACH transmit power reaches its maximum transmit power and no additional power is available to increase coverage, increasing the number of PRACH transmissions during multiple PRACH transmissions to achieve combining gain is an effective solution. For another example, the 3GPP RAN2#122 meeting also agreed to further discuss a fallback mechanism for multiple PRACH transmissions from a smaller number of PRACH transmissions to a larger number of PRACH transmissions.

[0079] However, increasing the number of PRACH transmissions in a retransmission consumes additional time-frequency resources and increases the probability of PRACH preamble collisions. When the user equipment has already performed a large number of PRACH transmissions in the previous random access channel attempt, increasing the number of PRACH transmissions in multiple retransmissions will result in significant resource consumption and increase the probability of preamble collisions. In particular, if the user equipment access failure is caused by a preamble collision, increasing the number of PRACH transmissions at the expense of consuming resources is an ineffective and wasteful solution. In this scenario, a better solution would be to re-initiate the random access process and reselect the random access resources and PRACH preamble.

[0080] In summary, in the scenario of performing multiple PRACH retransmission, how to allocate resources for the multiple PRACH retransmission and how to balance the resource consumption of the multiple PRACH retransmission and the effectiveness of random access are issues that need to be addressed.

[0081] To solve the above problems, the embodiments of the present application provide a method and apparatus in a node for wireless communication, which can reduce the resource consumption of multiple PRACH retransmissions, balance the resource consumption of multiple PRACHs and the effectiveness of random access, and help improve the performance gain of multiple PRACH transmissions and increase coverage while reducing random access delays and improving the efficiency of random access resource utilization.

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

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

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

[0085] 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 a four-step random access process (i.e., random access process type-1) or a two-step random access process (i.e., random access process type-2), and the embodiments of the present application are not limited to this.

[0086] The following is a detailed description of the method embodiment of the present application in conjunction with the accompanying drawings. Figure 2 is a flow chart of a method in a first node for wireless communication provided by an embodiment of the present application. The method is used for interaction between the first node and the second node.

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

[0088] As an embodiment, the first node may be a user equipment, for example, the user equipment 120 shown in FIG1 .

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

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

[0091] The method shown in FIG2 includes step S210 , step S220 and step S230 , which are described below.

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

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

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

[0095] As an embodiment, the first random access procedure includes sending the X1 random access preambles.

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

[0097] In some embodiments, the number of random access preambles sent by the first node is related to the number of PRACH transmissions in the multiple PRACH transmission. For example, X1 first random access preambles may indicate that the number of PRACH transmissions currently being performed by the first node in the multiple PRACH transmission is X1.

[0098] 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 multiple PRACH transmission. For example, X1 first random access preambles may indicate that the number of ROs in the ROG currently occupied by the first node for multiple PRACH transmission is X1.

[0099] As an embodiment, in multiple random access channel attempts, the first node may 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.

[0100] 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, where the plurality of candidate values ​​includes X1.

[0101] As an embodiment, the multiple candidate values ​​of X1 include at least one of {2, 4, 8}.

[0102] 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 random access preambles among the X1 first random access preambles. In some embodiments, the second node may not be able to receive the first random access preamble.

[0103] In step S220, control signaling of a first random access response is monitored within a first time window.

[0104] The first time window may be a time window in which the first node monitors random access responses (RARs) for X1 random access preambles.

[0105] As an embodiment, a media access control (MAC) entity may start the first time window at the first PDCCH opportunity after the first random access preamble transmission is completed.

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

[0107] As an embodiment, for the initial access procedure, the first node monitoring the control signaling of the first random access response includes monitoring the PDCCH for the RAR when the first time window runs.

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

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

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

[0111] As an embodiment, the first random access process includes sending a first physical uplink shared channel (PUSCH), and the first PUSCH is scheduled by an uplink grant (UL grant) in the first random access response.

[0112] As an embodiment, the first random access process includes receiving a first physical uplink shared channel (PUSCH) PDSCH, and the first PDSCH is used for conflict resolution.

[0113] The first random access response corresponds to X1 first random access preambles. That is, the first random access response is a random access response sent by the second node in response to one or more first random access preambles among the X1 first random access preambles. Within the first time window, the second node may determine whether to send control signaling for the first random access response based on a reception status of the X1 first random access preambles.

[0114] In some embodiments, the reception status of the first random access preamble may include the number of received first random access preambles, and may also include whether the first random access preamble conflicts with other random access preambles, which is not limited here.

[0115] As an embodiment, within the first time window, if the first random access preamble received by the second node meets 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 preamble does not meet the conditions for sending a random access response, the second node will not send the first random access response.

[0116] In step S230, the first time window expires, the first random access response is not successfully received, and the current value of the 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.

[0117] The reception of the first random access response is unsuccessful, which 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.

[0118] As an embodiment, 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 that sends the first random access preamble, reception of the first random access response is unsuccessful.

[0119] As an embodiment, when the first time window expires, the first node does not receive the 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.

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

[0121] In some embodiments, the first counter may be a 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 here.

[0122] As an embodiment, the first counter may be PREAMBLE_TRANSMISSION_COUNTER, that is, the traditional preamble sending counter is reused.

[0123] In some embodiments, the initial value of the first counter is set to the number of PRACH transmissions in the initial multiple PRACH transmission, or the number of ROs in the ROG occupied by the initial multiple PRACH transmission, or the number of random access preambles sent 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 preambles sent can be replaced with each other.

[0124] As an embodiment, 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}.

[0125] As an embodiment, the initial value of the first counter is set to the maximum value of the random access preamble, or the maximum number of PRACH transmissions, or the maximum number of ROs occupied by multiple PRACH transmissions.

[0126] In some embodiments, when the initial value of the first counter is a parameter of the first 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 may be the accumulated value of the first counter when the first node is currently attempting a random access channel. For example, when the first node attempts the random access channel for the first time, the current value of the first counter is equal to the initial value of the first counter. For another example, after the first node makes the N+1th (N>1) random access channel attempt, the current value of the first counter may be the accumulated value based on the previous N attempts, in which case the current value of the first counter is greater than the initial value of the first counter.

[0127] The updated value of the first counter is the value of the first counter after an update based on the current value. The first counter may be updated based on the reception of a channel access response after the current random access preamble is sent, or may be updated before the next random access channel attempt is scheduled to be initiated. For example, the first counter may be updated if the first random access response corresponding to X1 first random access preambles is not successfully received.

[0128] In some embodiments, when the initial value of the first counter is a parameter of an initial random channel access attempt, the value of the first counter is updated incrementally, that is, the value of the first counter is increased when it is updated. The increased value may be the number of random access preambles corresponding to the next random access channel attempt.

[0129] The current value of the first counter is increased by X2 to obtain the updated value of the first counter, which means that the first counter uses the sum of the current value and X2 as the updated value. X2 is the same as the number of PRACH transmissions of the next multiple PRACH transmission of the first node.

[0130] As an embodiment, the first node may determine X2 by receiving first information. Exemplarily, the first information is used to determine a plurality of candidate values, where the plurality of candidate values ​​include X2.

[0131] As an embodiment, the multiple candidate values ​​of X2 include at least one of {2, 4, 8}.

[0132] As an embodiment, the first information is used to determine a plurality of candidate values, where the plurality of candidate values ​​include the X1 and the X2.

[0133] As an embodiment, the multiple candidate values ​​include at least two of {2, 4, 8}.

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

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

[0136] In some embodiments, the number of PRACH transmissions in a current multiple PRACH transmission among multiple retransmissions may be different from or the same as the number of PRACH transmissions in a previous multiple PRACH transmission.

[0137] As an embodiment, in order to achieve coverage enhancement, the number of PRACH transmissions during multiple PRACH retransmissions may be greater than the number of PRACH transmissions during the previous multiple PRACH transmission. For example, the aforementioned X2 is greater than X1.

[0138] As an embodiment, the number of PRACH transmissions during the multiple PRACH retransmission may also be equal to the number of PRACH transmissions during the previous multiple PRACH transmission. For example, X2 is equal to X1.

[0139] As an embodiment, if the first time window expires and the first node fails to successfully receive the corresponding RAR, the preamble transmission counter may be increased by the number of PRACH transmissions in the next retransmitted multiple PRACH transmission, or the number of ROs in the ROG occupied by the next retransmitted multiple PRACH transmission. For example, if the number of PRACHs in the next multiple PRACH transmission of the first node is X2, the first counter is increased by X2 based on the current value to obtain an updated value.

[0140] In one embodiment, 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 decremental, that is, the value of the first counter is reduced when it is updated. The reduced value can be the number of random access preambles corresponding to the next random access attempt that is counted in the channel.

[0141] In some embodiments, the first node may select a physical random access channel opportunity according to the update status of the value of the first counter. The physical random access channel opportunity is also referred to as RO.

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

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

[0144] As an embodiment, the first random access process includes sending the X0 third random access preambles.

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

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

[0147] As an embodiment, when the first counter increases 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.

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

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

[0150] 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. That is, the first node can determine whether to continue random access channel attempts based on the updated value of the first counter obtained in step S230 and the first threshold.

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

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

[0153] As an embodiment, whether the X2 second random access preambles are sent is equivalent to whether the first random access process is not successfully completed.

[0154] As an embodiment, the second random access preamble may be the same as the first random access preamble, that is, the preamble used in the retransmitted multiple PRACH transmission may be the same as the preamble used in the previous multiple PRACH transmission. For example, the second random access preamble and the first random access preamble are generated using the same random access preamble sequence.

[0155] As an embodiment, the second random access preamble may be different from the first random access preamble, that is, the preamble used in the retransmitted multiple PRACH transmission may be different from the preamble used in the previous multiple PRACH transmission. For example, the first node reselects a preamble different from the first random access preamble as the second random access preamble.

[0156] As an embodiment, when the first counter is updated by decreasing the 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 X2 second random access preambles.

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

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

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

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

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

[0162] A 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: when the updated value of the first counter is less than the first threshold, sending X2 second random access preambles; when the updated value of the first counter is greater than the first threshold, giving up sending the X2 second random access preambles.

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

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

[0165] As an embodiment, the giving up sending the X2 second random access preambles is equivalent to the first random access process being unsuccessfully completed.

[0166] For the second node, when the first node sends X2 second random access preambles, the second node can perform reception of X2 second random access preambles; when the first node gives up sending X2 second random access preambles, the second node gives up receiving X2 second random access preambles.

[0167] 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 procedure is successful.

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

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

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

[0171] In some embodiments, if the first node successfully receives the first random access response within the first time window, it is considered that the first random access procedure is successfully completed.

[0172] As an embodiment, within the first time window, when the first random access response is successfully received, the first time window is stopped. For example, the MAC entity determines whether to start or stop the first time window based on the execution status of the first random access process.

[0173] As an embodiment, stopping the first time window refers to the time window in which the MAC entity stops monitoring the first random access response.

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

[0175] As can be seen from Figure 2, in the embodiment of the present application, no matter how many PRACH transmissions of the multiple PRACH are, the first node can control the total number of PRACH transmissions or the total number of ROs occupied, thereby minimizing unnecessary resource waste in multiple PRACH retransmissions and avoiding the introduction of unnecessary PRACH preamble conflicts to optimize resource allocation.

[0176] For ease of understanding, the following, in conjunction with Figure 3, illustrates an exemplary solution in which the total number of PRACH transmissions in all multiple PRACH transmissions in multiple random access channel attempts is used to determine whether to perform multiple PRACH retransmissions. Figure 3 shows a flow chart of a possible implementation method of the first node using an embodiment of the present application.

[0177] Referring to FIG. 3 , in step S302 , a first random access procedure begins.

[0178] In step S304, a preamble sending counter is set to the number of PRACH transmissions in the initial multiple PRACH transmission. The preamble sending counter is a first counter.

[0179] In step S306, a random access resource selection process is performed.

[0180] In step S308, multiple preambles are respectively sent to multiple ROs in one ROG. The preambles sent at different times may be different or the same.

[0181] In step S310, it is determined whether the RAR is successfully received within the RAR time window. If the RAR is successfully received, step S316 is executed; if the RAR is not successfully received within the RAR time window, step S312 is executed.

[0182] In step S312, the preamble transmission counter is updated. The updated preamble transmission counter is the value of the original preamble transmission counter plus the sum of the number of PRACH transmissions in the repeated PRACH transmission. The number of PRACH transmissions in the repeated PRACH transmission can be different from or the same as the number of PRACH transmissions in the previous repeated PRACH transmission.

[0183] In step S314, it is determined whether the updated value of the preamble transmission counter is greater than the maximum total number of PRACH transmissions. If so, step S318 is executed; if not, steps S306 to S310 are repeated.

[0184] In step S316, if the 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.

[0185] In step S318, if RAR reception is unsuccessful within the RAR time window and the preamble transmission counter exceeds the maximum number of PRACH transmissions, the retransmission of the PRACH transmission is abandoned. In this scenario, a random access problem is indicated to the upper layer, and the random access process is considered unsuccessful, and the first random access process ends.

[0186] The preceding text, in conjunction with Figures 2 and 3, describes a method for determining whether to perform multiple PRACH retransmissions based on the total number of PRACH transmissions. This embodiment of the present application also proposes a method in which the total number of PRACH transmissions and the maximum number of transmissions for all multiple PRACH transmissions are used together to determine whether to perform multiple PRACH retransmissions. For the sake of brevity, the terms explained in Figure 2 will not be repeated in this method embodiment.

[0187] After step S230 shown in FIG2 , the current value of the second counter is increased by 1 to obtain an updated value of the second counter.

[0188] The second counter is used by the first node to count the number of transmissions of all multiple 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.

[0189] 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 times the multiple PRACH transmissions are sent when determining whether to perform multiple PRACH retransmission.

[0190] As an embodiment, when the first counter is a traditional preamble sending counter of the first node, the second counter is a sending times counter newly set by the first node.

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

[0192] For example, the second counter may be PREAMBLE_TRANSMISSION_COUNTER.

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

[0194] As an embodiment, the initial value of the second counter is set to the maximum number of transmission times.

[0195] 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 may be the cumulative number of random access channel attempts currently made by the first node. For example, when the first node makes its first random access channel attempt, the current value of the second counter is equal to 1. The initial value of the second counter is the same as the current value. For another example, when the first node makes its Nth (N>1) random access channel attempt, the current value of the second counter may be N, in which case the current value of the second counter is greater than the initial value of the second counter.

[0196] The updated value of the second counter is the value of the second counter after an update based on the current value. The second counter may be updated based on the reception of a channel access response after the current random access preamble is sent, or may be updated before the next random access channel attempt is scheduled to be initiated. The second counter may also be updated in a scenario where the updated value of the first counter is less than a first threshold. For example, in a scenario where the first random access response corresponding to X1 first random access preambles is not successfully received, if the updated value of the first counter is less than the first threshold, the second counter is updated.

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

[0198] The current value of the first counter is increased by 1 to obtain the updated value of the first counter, which means that the first counter uses the sum of the current value and the added value as the updated value.

[0199] As an embodiment, if the first time window expires and the first node fails to successfully receive the corresponding RAR, the second counter (e.g., the preamble sending counter) is increased by 1, and the first counter (e.g., the PRACH transmission counter) is increased by the number of PRACH transmissions in the next retransmitted multiple PRACH transmission, or the number of ROs in the ROG occupied by the next retransmitted multiple PRACH transmission.

[0200] 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 subtracted by 1 when it is updated.

[0201] The 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. In other words, the first node can determine whether to continue random access channel attempts based on the updated value of the second counter and the second threshold. The second threshold is configured by higher-layer signaling.

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

[0203] 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 procedure is not successfully completed, and the second threshold is configured by higher layer signaling.

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

[0205] The second threshold is configured by higher-layer signaling, which may be RRC signaling.

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

[0207] In one embodiment, the second threshold is indicated by 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 third information. For example, the second information indicates the maximum number of transmissions, and the third information indicates the maximum number of PRACH transmissions.

[0208] As an embodiment, when the first threshold is configured through "preambleTransMax", the second threshold is configured through the IE parameter newly introduced in RRC.

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

[0210] As an embodiment, the second threshold is the maximum number of transmissions of all complex PRACH transmissions.

[0211] A 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, including abandoning sending the X2 second random access preambles when the updated value of the second counter is greater than the second threshold; and also including jointly determining whether to send the X2 second random access preambles based on a relationship between the updated value of the second counter and the second threshold and a relationship between the updated value of the first counter and the first threshold.

[0212] 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, X2 second random access preambles are sent; 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, the sending of X2 second random access preambles is abandoned.

[0213] 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, the X2 second random access preambles are sent; 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, the sending of the X2 second random access preambles is abandoned.

[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 not equal to the sum of the second threshold plus 1, the X2 second random access preambles are sent; 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, the sending of the X2 second random access preambles is abandoned.

[0215] 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, the X2 second random access preambles are sent; 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, the sending of the X2 second random access preambles is abandoned.

[0216] 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, the X2 second random access preambles are sent; 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, the sending of the X2 second random access preambles is abandoned.

[0217] 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, the X2 second random access preambles are sent; 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, the sending of the X2 second random access preambles is abandoned.

[0218] 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 procedure is successful.

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

[0220] 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, a random access problem is indicated to the upper layer.

[0221] 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, a random access problem is indicated to the upper layer.

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

[0223] In the method embodiment described above, regardless of the number of PRACH transmissions of the multiple 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 conducive to balancing the resource consumption of multiple PRACH retransmissions and the effectiveness of random access.

[0224] For ease of understanding, the following, in conjunction with Figure 4, illustrates an exemplary solution in which the total number of PRACH transmissions and the maximum number of transmissions for all multiple PRACH transmissions in multiple random access channel attempts are jointly used to determine whether to perform multiple PRACH retransmissions. Figure 4 is a flow chart illustrating another possible implementation of the method according to an embodiment of the present application by a first node.

[0225] Referring to FIG. 4 , in step S402 , a first random access procedure begins.

[0226] In step S404, the preamble sending counter is set to 1. The preamble sending counter is a second counter.

[0227] In step S406, a PRACH transmission counter is set to the number of PRACH transmissions in the initial multiple PRACH transmission. The PRACH transmission counter is a first counter.

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

[0229] In step S410, multiple preambles are respectively sent to multiple ROs in an ROG. The preambles sent at different times may be different or the same.

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

[0231] In step S414, the PRACH transmission counter is updated. The updated PRACH transmission counter is the value of the original PRACH transmission counter plus the sum of the number of PRACH transmissions in the repeated PRACH transmission. The number of PRACH transmissions in the repeated PRACH transmission can be different from or the same as the number of PRACH transmissions in the previous repeated PRACH transmission.

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

[0233] In step S418, the preamble sending counter is updated. The updated preamble sending counter is the sum of the value of the original preamble sending counter plus 1.

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

[0235] In step S422, if the RAR is successfully received within the RAR time window, the random access process is deemed to be successfully completed, and thus the first random access process ends.

[0236] In step S424, if RAR reception is unsuccessful within the RAR time window and the PRACH transmission counter exceeds the maximum number of PRACH transmissions, or the preamble transmission counter exceeds the maximum number of transmissions, the retransmission of the PRACH transmission is abandoned. In this scenario, a random access problem is indicated to the upper layer, the random access procedure is deemed unsuccessful, and the first random access procedure ends.

[0237] By using the method embodiments described above, the total resources occupied by multiple PRACH transmissions and retransmissions can be controlled, thereby avoiding invalid repeated transmissions, consuming a large amount of resources, and worsening preamble conflicts.

[0238] The method embodiment of the present application is described in detail above in conjunction with Figures 1 to 4 , and the device embodiment of the present application is described in detail below in conjunction with Figures 5 to 8 . It should be understood that the description of the method embodiment corresponds to the description of the device embodiment, and therefore, for portions not described in detail, reference can be made to the above method embodiment.

[0239] FIG5 is a diagram of a first node for wireless communication provided by an embodiment of the present application. As shown in FIG5 , the first node 500 includes a first transmitter 510 , a first receiver 520 , and a first counter 530 .

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

[0241] A first receiver 520 is configured to monitor 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;

[0242] A first counter 530 may be used to increase a current value by X2 to obtain an updated value of the first counter 530 when the first time window expires and reception of the first random access response is unsuccessful, where X2 is a positive integer greater than or equal to X1;

[0243] The 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.

[0244] As an embodiment, the first transmitter 510 is further used 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 give up sending the X2 second random access preambles when the updated value of the first counter 530 is greater than the first threshold.

[0245] 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 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 sum of the updated value of the second counter and the second threshold plus 1 is equal to each other is used to determine whether to send the X2 second random access preambles, and the second threshold is configured by higher layer signaling.

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

[0247] As an embodiment, the first transmitter 510 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, 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, give up sending the X2 second random access preambles.

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

[0249] As an embodiment, the first counter 530 is also used 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 also includes a second processor, which can be used to select X0 physical random access channel opportunities; wherein the X0 physical random access channel opportunities are used for the first random access process.

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

[0251] As an embodiment, the first node 500 further includes a fourth processor, which is configured to stop the first time window when the first random access response is successfully received within the first time window.

[0252] As an embodiment, the first receiver 520 is further configured to receive first information, where the first information is used to determine a plurality of candidate values, where the plurality of candidate values ​​include the X1 and the X2.

[0253] As an embodiment, 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, as specifically shown in FIG7 .

[0254] FIG6 shows a second node for wireless communication provided by an embodiment of the present application. As shown in FIG6 , the second node 600 includes a second receiver 610 and a fifth processor 620 .

[0255] The second receiver 610 may be configured to receive X1 first random access preambles, where X1 is a positive integer greater than 1;

[0256] The fifth processor 620 is configured to determine, within a first time window, based on a reception status of the X1 first random access preambles, whether to send control signaling of a first random access response, where the first random access response corresponds to the X1 first random access preambles;

[0257] The first time window expires, the control signaling of the first random access response is not successfully sent, and the relationship between the updated value of the first counter of the first node that sends the X1 first random access preambles and the 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 higher layer signaling.

[0258] As an embodiment, the second receiver 610 is further used 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 reception of the X2 second random access preambles when the updated value of the first counter is greater than the first threshold.

[0259] As an embodiment, 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 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 to each other 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.

[0260] As an embodiment, the second receiver 610 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, perform 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, abandon reception of the X2 second random access preambles.

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

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

[0263] As an embodiment, the second receiver 610 may be a transceiver 730, and the fifth processor 620 may be a processor 710. The second node 600 may further include a memory 720, as specifically shown in FIG7 .

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

[0265] The device 700 may include one or more processors 710. The processor 710 may support the device 700 to implement the method described in the method embodiment above. The processor 710 may be a general-purpose processor or a special-purpose processor. For example, the processor may be a central processing unit (CPU). Alternatively, the processor may be another general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, a discrete gate or transistor logic device, a discrete hardware component, etc. The general-purpose processor may be a microprocessor or the processor may be any conventional processor, etc.

[0266] The apparatus 700 may further include one or more memories 720. The memories 720 store programs that can be executed by the processor 710, causing the processor 710 to perform the methods described in the above method embodiments. The memories 720 may be independent of the processor 710 or integrated into the processor 710.

[0267] The apparatus 700 may further include a transceiver 730. The processor 710 may communicate with other devices or chips via the transceiver 730. For example, the processor 710 may transmit and receive data with other devices or chips via the transceiver 730.

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

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

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

[0271] During transmission from the second communications device 810 to the first communications device 850, at the second communications device 810, upper layer data packets from the core network or from a data source 877 are provided to a controller / processor 875. The core network and data source 877 represent all protocol layers above the L2 layer. The controller / processor 875 implements L2 layer functionality. During transmission from the second communications device 810 to the first communications 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 communications device 850 based on various priority metrics. The controller / processor 875 is also responsible for retransmission of lost packets and signaling to the first communications device 850. The transmit processor 816 and the multi-antenna transmit processor 871 implement various signal processing functions for the L1 layer (i.e., the physical layer). The transmit processor 816 performs coding and interleaving to facilitate forward error correction at the second communication device 810, as well as mapping signal constellations based on various modulation schemes (e.g., binary phase shift keying, quadrature phase shift keying, M-phase shift keying, and M-quadrature amplitude modulation). The multi-antenna transmit processor 871 performs digital spatial precoding, including codebook-based and non-codebook-based precoding, and beamforming on the coded and modulated symbols to generate one or more spatial streams. The transmit processor 816 then maps each spatial stream to a subcarrier, multiplexes it with a reference signal (e.g., a pilot) in the time and / or frequency domain, and then uses an inverse fast Fourier transform to generate a physical channel carrying the time-domain multicarrier symbol stream. The multi-antenna transmit processor 871 then performs transmit analog precoding / beamforming operations on the time-domain multicarrier symbol stream. Each transmitter 818 converts the baseband multicarrier symbol stream provided by the multi-antenna transmit processor 871 into a radio frequency stream, which is then provided to a different antenna 820.

[0272] During transmission from the second communications device 810 to the first communications device 850, each receiver 854 at the first communications device 850 receives signals via its corresponding antenna 852. Each receiver 854 recovers the information modulated onto the RF carrier and converts the RF stream into a baseband multi-carrier symbol stream, which is provided to the receive processor 856. The receive processor 856 and the multi-antenna receive processor 858 implement various L1 layer signal processing functions. The multi-antenna receive processor 858 performs receive analog precoding / beamforming operations on the baseband multi-carrier symbol stream from the receiver 854. The receive processor 856 uses a 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 receive processor 856 demultiplexes the physical layer data signal and reference signal, where the reference signal is used for channel estimation. The data signal undergoes multi-antenna detection in the multi-antenna receive processor 858 to recover any spatial streams destined for the first communications device 850. The symbols on each spatial stream are demodulated and recovered in the receive processor 856, and soft decisions are generated. The receive processor 856 then decodes and deinterleaves the soft decisions to recover the upper layer data and control signals transmitted by the second communication device 810 on the physical channel. The upper layer data and control signals are then provided to the controller / processor 859. The controller / processor 859 implements 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. During 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, and control signal processing to recover the upper layer data packets from the second communication device 810. The upper layer data packets are then provided to all protocol layers above the L2 layer. Various control signals may also be provided to the L3 layer for L3 processing.

[0273] During transmission from the first communications device 850 to the second communications device 810, upper layer data packets are provided to the controller / processor 859 at the first communications device 850 using a data source 867. The data source 867 represents all protocol layers above the L2 layer. Similar to the transmission functionality at the second communications device 810 described in the transmission from the second communications device 810 to the first communications device 850, the controller / processor 859 implements header compression, encryption, packet segmentation and reordering, and multiplexing between logical and transport channels, implementing L2 layer functions for both the user plane and the control plane. The controller / processor 859 is also responsible for retransmission of lost packets and signaling to the second communications device 810. The transmit processor 868 performs modulation mapping and channel coding, while the multi-antenna transmit processor 857 performs digital multi-antenna spatial precoding, including codebook-based and non-codebook-based precoding, and beamforming. The transmit processor 868 then modulates the resulting spatial stream into a multi-carrier / single-carrier symbol stream. After analog precoding and beamforming operations in the multi-antenna transmit processor 857, the stream is provided to different antennas 852 via the transmitter 854. Each transmitter 854 first converts the baseband symbol stream provided by the multi-antenna transmit processor 857 into a RF symbol stream before providing it to the antenna 852.

[0274] During transmission from the first communication device 850 to the second communication device 810, the functionality at the second communication device 810 is similar to the reception functionality at the first communication device 850 described for transmission from the second communication device 810 to the first communication device 850. Each receiver 818 receives RF signals via its corresponding antenna 820, converts the received RF signals into baseband signals, and provides the baseband signals to a multi-antenna receive processor 872 and a receive processor 870. The receive processor 870 and the multi-antenna receive processor 872 collectively implement Layer 1 functionality. A controller / processor 875 implements Layer 2 functionality. The controller / processor 875 may be associated with a memory 876 storing program code and data. The memory 876 may be referred to as a computer-readable medium. During 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 upper layer data packets from the first communication device 850. The controller / processor 875 may provide upper layer data packets to the core network or all protocol layers above the L2 layer, and may also provide various control signals to the core network or L3 for L3 processing.

[0275] As an embodiment, the first communication device 850 apparatus includes: at least one processor and at least one memory, the at least one memory including computer program code; the at least one memory and the computer program code are configured to be used together with the at least one processor, and the first communication device 850 apparatus at least: sends X1 first random access preambles, X1 is a positive integer greater than 1; monitors the control signaling of the 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 unsuccessful, the current value of the first counter is increased by X2 to obtain an updated value of the first counter, X2 is a positive integer greater than or equal to X1; wherein the 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 apparatus includes: a memory storing a computer-readable instruction program, wherein the computer-readable instruction program generates an action when executed by at least one processor, the action including: sending X1 first random access preambles, where X1 is a positive integer greater than 1; monitoring 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; when the first time window expires and the reception of the first random access response is unsuccessful, the current value of the 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 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.

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

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

[0279] As an embodiment, the first communication device 850 is a user equipment, which can serve as a relay node.

[0280] As an embodiment, the first communication device 850 is a user equipment supporting V2X, which can serve as a relay node.

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

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

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

[0284] As an embodiment, the first communication device 850 is a relay.

[0285] As an embodiment, the second communication device 810 is a base station.

[0286] As an embodiment, the antenna 852, the transmitter 854, the multi-antenna transmit processor 857, the transmit processor 868, and the controller / processor 859 are used to send X1 first random access preambles in this application.

[0287] As an embodiment, 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 this application.

[0288] As an embodiment, 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 this application within a first time window.

[0289] As an embodiment, the antenna 820, the transmitter 818, the multi-antenna transmit processor 871, the transmit processor 816, and the controller / processor 875 are used to determine whether to send the first random access response in this application within a first time window.

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

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

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

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

[0294] In the embodiments of this application, the term "indication" may refer to a direct indication, an indirect indication, or an indication of an association. For example, "A indicates B" may refer to a direct indication of B, e.g., B can obtain information through A; it may refer to an indirect indication of B, e.g., A indicates C, e.g., B can obtain information through C; or it may refer to an association between A and B.

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

[0296] In the embodiments of the present application, the term "corresponding" may indicate a direct or indirect correspondence between the two, or an association relationship between the two, or a relationship between indication and indication, configuration and configuration, etc.

[0297] In the embodiments of the present application, "pre-defined" or "pre-configured" may be implemented by pre-storing corresponding codes, tables, or other methods that can be used to indicate relevant information in a device (e.g., including a user device and a network device). The present application does not limit the specific implementation method. For example, pre-defined may refer to information defined in a protocol.

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

[0299] In the embodiments of this application, the term "and / or" is simply a description of the association relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone. In addition, the character " / " in this document generally indicates that the related objects are in an "or" relationship.

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

[0301] In the several embodiments provided in this 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 schematic. For example, the division of the units is merely a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

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

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

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

[0305] The above description is merely a specific embodiment of the present application, but the scope of protection of the present application is not limited thereto. Any changes or substitutions that can be easily conceived by a person skilled in the art within the technical scope disclosed in this application should be included in the scope of protection of this application. Therefore, the scope of protection of this application should be based on the scope of protection of the claims.

Claims

1. A method in a first node for wireless communication, characterized in that include: 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; The first time window expires, the first random access response is not successfully received, and the current value of the 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; 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.

2. The method according to claim 1, characterized in that include: When the updated value of the first counter is less than the first threshold, sending the X2 second random access preambles; When the updated value of the first counter is greater than the first threshold, giving up sending the X2 second random access preambles.

3. The method according to claim 1 or 2, characterized in that: include: The current value of the second counter is increased 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 sum of the updated value of the second counter and the second threshold plus 1 is equal to each other is used to determine whether to send the X2 second random access preambles, and the second threshold is configured by higher layer signaling.

4. The method according to claim 3, characterized in that include: An initial value of the second counter is set to 1, and the initial value of the second counter is less than or equal to the current value of the second counter.

5. The method according to claim 3 or 4, characterized in that: include: 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, 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 plus 1, giving up sending the X2 second random access preambles.

6. The method according to claim 3 or 4, characterized in that: include: When the updated value of the second counter is equal to the sum of the second threshold value plus 1, a random access problem is indicated to an upper layer.

7. The method according to any one of claims 1 to 6, characterized in that include: Setting an 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; The X0 physical random access channel opportunities are used for the first random access process.

8. The method according to any one of claims 1 to 7, characterized in that include: When the updated value of the first counter is greater than the first threshold, a random access problem is indicated to an upper layer.

9. The method according to any one of claims 1 to 8, characterized in that include: When the first random access response is received successfully within the first time window, the first time window is stopped.

10. The method according to any one of claims 1 to 9, characterized in that include: First information is received, where the first information is used to determine a plurality of candidate values, where the plurality of candidate values ​​include the X1 and the X2.

11. A method in a second node for wireless communication, characterized in that: include: Perform reception of X1 first random access preambles, where X1 is a positive integer greater than 1; Determine, within a first time window, according to reception conditions of the X1 first random access preambles, whether to send control signaling of a first random access response, where the first random access response corresponds to the X1 first random access preambles; The first time window expires, the control signaling of the first random access response is not successfully sent, and the relationship between the update value of the first counter of the first node that sends the X1 first random access preambles and the 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.

12. The method according to claim 11, characterized in that include: When the updated value of the first counter is less than the first threshold, performing reception of the X2 second random access preambles; When the updated value of the first counter is greater than the first threshold, the reception of the X2 second random access preambles is abandoned.

13. The method according to claim 11 or 12, characterized in that: include: 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 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 reception of the X2 second random access preambles, and the second threshold is configured by higher layer signaling.

14. The method according to claim 13, characterized in that include: 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, 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, abandoning the reception of the X2 second random access preambles.

15. The method according to any one of claims 11 to 14, characterized in that include: Within the first time window, when control signaling of the first random access response is sent successfully, the first time window is stopped.

16. The method according to any one of claims 11 to 15, characterized in that include: First information is sent, where the first information is used to determine a plurality of candidate values, where the plurality of candidate values ​​include the X1 and the X2.

17. A first node for wireless communication, characterized in that: include: 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 control signaling of a first random access response within a first time window, the first random access response corresponding to the X1 first random access preambles; A first counter, used for, when the first time window expires and the reception of the first random access response is unsuccessful, increasing a current value by X2 to obtain an updated value of the first counter, where X2 is a positive integer greater than or equal to X1; 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.

18. The first node according to claim 17, characterized in that: include: 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; When the updated value of the first counter is greater than the first threshold, giving up sending the X2 second random access preambles.

19. The first node according to claim 17 or 18, characterized in that: The first node also includes: a second counter, used to increase the current value by 1 to obtain an updated value of the second counter, wherein a 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 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, wherein the second threshold is configured by higher layer signaling.

20. The first node according to claim 19, characterized in that include: The second counter is further used to set an initial value to 1, and the initial value of the second counter is less than or equal to the current value of the second counter.

21. The first node according to claim 19 or 20, characterized in that: include: The first transmitter 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, 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, give up sending the X2 second random access preambles.

22. The first node according to claim 19 or 20, characterized in that: The first node also includes: The first processor is configured to indicate a random access problem to an upper layer when the updated value of the second counter is equal to the sum of the second threshold value plus 1.

23. The first node according to any one of claims 17 to 22, characterized in that: include: The first counter is further used to set an initial value 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; The first node also includes a second processor, configured to select X0 physical random access channel opportunities; The X0 physical random access channel opportunities are used for the first random access process.

24. The first node according to any one of claims 17 to 23, characterized in that: The first node also includes: The third processor is configured to indicate a random access problem to an upper layer when the updated value of the first counter is greater than the first threshold.

25. The first node according to any one of claims 17 to 24, characterized in that: The first node also includes: The fourth processor is configured to stop the first time window when the first random access response is successfully received within the first time window.

26. The first node according to any one of claims 17 to 25, characterized in that: include: The first receiver is further configured to receive first information, where the first information is used to determine a plurality of candidate values, where the plurality of candidate values ​​include the X1 and the X2.

27. A second node for wireless communication, characterized in that: include: 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 a first random access preamble according to a reception status of the X1 first random access preambles within a first time window; control signaling of a random access response, the first random access response corresponding to the X1 first random access preambles; The first time window expires, the control signaling of the first random access response is not successfully sent, and the relationship between the update value of the first counter of the first node that sends the X1 first random access preambles and the 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.

28. The second node according to claim 27, characterized in that: include: The second receiver is further configured to, when the updated value of the first counter is less than the first threshold, perform reception of the X2 second random access preambles; and when the updated value of the first counter is greater than the first threshold, abandon reception of the X2 second random access preambles.

29. The second node according to claim 27 or 28, characterized in that: include: 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 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 reception of the X2 second random access preambles, and the second threshold is configured by higher layer signaling.

30. The second node according to claim 29, characterized in that: include: 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, perform reception of the X2 second random access preambles; and 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 reception of the X2 second random access preambles.

31. The second node according to any one of claims 27 to 30, characterized in that: include: The fifth processor is further configured to, within the first time window, stop the first time window when control signaling of the first random access response is sent successfully.

32. The second node according to any one of claims 27 to 31, characterized in that: The second node also includes: The second transmitter is used to send first information, where the first information is used to determine a plurality of candidate values, where the plurality of candidate values ​​include the X1 and the X2.

33. A node used for wireless communication, characterized in that: It comprises a transceiver, a memory and a processor, wherein the memory is used to store a program, and the processor is used to call the program in the memory and control the transceiver to receive or send a signal so that the node executes the method as described in any one of claims 1-10 or 11-16.

34. A device, characterized in that It comprises a processor, which is used to call a program from a memory so that the device executes the method as described in any one of claims 1-10 or 11-16.

35. A chip, characterized in that: It comprises a processor, which is used to call a program from a memory, so that a device equipped with the chip executes the method as described in any one of claims 1-10 or 11-16.

36. A computer-readable storage medium, characterized in that: A program is stored thereon, the program causing a computer to execute the method according to any one of claims 1-10 or 11-16.

37. A computer program product, characterized in that The method comprises a program which causes a computer to execute the method as claimed in any one of claims 1 to 10 or 11 to 16.

38. A computer program, characterized in that The computer program enables a computer to execute the method according to any one of claims 1-10 or 11-16.

Images