METHOD FOR USE IN NODES FOR WIRELESS COMMUNICATION AND FIRST 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

1 / 64 “METHOD FOR USE IN NODES FOR WIRELESS COMMUNICATION AND FIRST NODE FOR WIRELESS COMMUNICATION” TECHNICAL AREA

[001] The various embodiments described in this document generally relate to the technical field of communications and, more particularly, to a method and device for use in nodes for wireless communication. Background of the Invention

[002] To improve the coverage performance of random access, some communication systems (e.g., new radio systems (NR)) plan to introduce retransmissions based on multiple physical random access channel (PRACH) transmissions and increase the number of PRACH transmissions in the retransmissions. However, increasing the number of PRACH transmissions in the multiple PRACH transmissions in the retransmissions may consume additional time-frequency resources and may also increase the probability of PRACH preamble collisions. In this case, how to allocate resources for multiple PRACH retransmissions and how to balance the resource consumption of multiple PRACH retransmissions and the effectiveness of random access have become problems to be solved. Brief Description of the Invention

[003] The embodiments of this disclosure provide a method and a device for use in nodes for wireless communication. Several aspects of this disclosure are described below.

[004] According to a first aspect, the forms of carrying out the disclosure provide a method for use in a first node for wireless communication, including: transmitting X1 first random access (RA) preambles, where X1 is a positive integer greater than 1; monitoring a Petition 870250075828, dated 08 / 27 / 2025, page 10 / 151 2 / 64 control signaling for a first random access response (RAR) during a first time window, where the first RAR corresponds to the first X1 RA preambles; and incrementing a current value of a first counter in X2 to obtain an updated value of the first counter in response to the expiration of the first time window and the first RAR being received unsuccessfully, where X2 is a positive integer greater than or equal to X1. A magnitude relationship between the updated value of the first counter and a first threshold is set to determine whether X2 second RA preambles should be transmitted, the first threshold being set by upper-layer signaling.

[005] As an implementation, the X2-second RA preambles are transmitted in response to the updated value of the first counter being less than the first limit, and the transmission of the X2-second RA preambles is discarded in response to the updated value of the first counter being greater than the first limit.

[006] As an implementation, a current value of a second counter is increased by 1 to obtain an updated value of the second counter, where a magnitude ratio between the updated value of the second counter and a sum of a second limit plus 1 is configured to determine whether to transmit the X2 second RA preambles, or whether the updated value of the second counter is equal to the sum of the second limit plus 1 is configured to determine whether to transmit the X2 second RA preambles, the second limit being configured by upper layer signaling.

[007] As an implementation, an initial value of the second counter is defined as 1, where the initial value of the second counter is less than or equal to the current value of the second counter.

[008] As an implementation, transmit the X2 second RA preambles in response to the updated value of the first counter be Petition 870250075828, dated 08 / 27 / 2025, page 11 / 151 3 / 64 less than the first limit and the updated value of the second counter not being equal to the sum of the second limit plus 1. The transmission of the X2 second RA preambles is discarded in response to the updated value of the first counter being greater than the first limit or the updated value of the second counter being equal to the sum of the second limit plus 1.

[009] As an implementation, an RA problem is indicated for the upper layers in response to the updated value of the second counter being equal to the sum of the second limit plus 1.

[0010] As an implementation, an initial value of the first counter is defined as 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. Physical Random Access Channel (PRACH) occasions X0 (ROs) are selected. The X0 ROs are configured for a first RA procedure.

[0011] As an implementation, an RA problem is indicated for the upper layers in response to the updated value of the first counter being greater than the first limit.

[0012] As an implementation, the first time window is interrupted in response to the first RAR being successfully received during the first time window.

[0013] As an implementation, the first information is received, where the first information is configured to determine a plurality of candidate values, the plurality of candidate values ​​including X1 and X2.

[0014] According to a second aspect, a method is provided for use in a second node for wireless communication. The method includes: performing the reception of X1 first random access (RA) preambles, where X1 is a positive integer greater than 1; and determining whether to transmit a Petition 870250075828, dated 08 / 27 / 2025, page 12 / 151 4 / 64 Control signaling for a first random access response (RAR) according to the result of receiving the first X1 RA preambles during a first time window, where the first RAR corresponds to the first X1 RA preambles. When the first time window expires, the control signaling for the first RAR is not successfully transmitted, and a magnitude relationship between an updated value of a first counter from a first node transmitting the first X1 RA preambles and a first threshold is set to determine whether to perform the reception of X2 second RA preambles, X2 being a positive integer greater than or equal to X1, and the first threshold being set by upper-layer signaling.

[0015] As an implementation, the reception of the X2-second RA preambles is performed in response to the updated value of the first counter being less than the first limit. The reception of the X2-second RA preambles is discarded in response to the updated value of the first counter being greater than the first limit.

[0016] As an implementation, a magnitude relationship between an updated value of a second counter of the first node and a sum of a second limit plus 1 is configured to determine whether to execute the reception of the X2 second RA preambles, or whether the updated value of the second counter of the first node is equal to a sum of the second limit plus 1 is configured to determine whether to execute the reception of the X2 second RA preambles, the second limit being configured by upper-layer signaling.

[0017] As an implementation, the reception of the X2-second RA preambles is performed in response to the updated value of the first counter being less than the first limit and the updated value of the second counter not being equal to the sum of the second limit plus 1. The reception of the X2-second RA preambles is discarded in response to the updated value of Petition 870250075828, dated 08 / 27 / 2025, p. 13 / 151 5 / 64 first counter being greater than the first limit or the updated value of the second counter being equal to the sum of the second limit plus 1.

[0018] As an implementation, the first time window is interrupted, in response to the control signal for the first RAR to be successfully transmitted during the first time window.

[0019] As an implementation, the first information is transmitted, the first information being configured to determine a plurality of candidate values, the plurality of candidate values ​​including X1 and X2.

[0020] According to a third aspect, a first node for wireless communication is provided. The first node includes: a first transmitter configured to transmit X1 first random access (RA) preambles, where X1 is a positive integer greater than 1; a first receiver configured to monitor a control signal for a first random access response (RAR) during a first time window, where the first RAR corresponds to the X1 first RA preambles; and a first counter configured to increment a current value of the first counter by X2 to obtain an updated value of the first counter in response to the expiration of the first time window and the unsuccessful reception of the first RAR, where X2 is a positive integer greater than or equal to X1.A magnitude relationship between the updated value of the first counter and a first threshold is configured to determine whether the X2-second RA preambles should be transmitted, with the first threshold being configured by upper-layer signaling.

[0021] As an implementation, the first transmitter is further configured to: transmit the X2-second RA preambles in response to the updated value of the first counter being less than the first limit; and discard the transmission of the X2-second RA preambles in response to the value Petition 870250075828, dated 08 / 27 / 2025, p. 14 / 151 6 / 64 updated from the first counter being greater than the first limit.

[0022] As an implementation, the first node further includes: a second counter configured to increment a current value of the second counter by 1 to obtain an updated value of the second counter, where a magnitude ratio between the updated value of the second counter and a sum of a second limit plus 1 is configured to determine whether the X2 second RA preambles should be transmitted, or whether the updated value of the second counter is equal to the sum of the second limit plus 1 is configured to determine whether the X2 second RA preambles should be transmitted, the second limit being configured by upper layer signaling.

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

[0024] As an implementation, the first transmitter is further configured to: transmit the X2-second RA preambles in response to the updated value of the first counter being less than the first limit and the updated value of the second counter not being equal to the sum of the second limit plus 1; and discard transmission of the X2-second RA preambles in response to the updated value of the first counter being greater than the first limit or the updated value of the second counter being equal to the sum of the second limit plus 1.

[0025] As an implementation, the first node also includes: a first processor configured to indicate an RA problem to the upper layer in response to the updated value of the second counter being equal to the sum of the second limit plus 1.

[0026] As an implementation, the first counter is further configured to set 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. Petition 870250075828, dated 08 / 27 / 2025, page 15 / 151 7 / 64 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 instances of physical random access channels (PRACH) (ROs). The X0 ROs are configured for a first RA procedure.

[0027] As an implementation, the first node also includes: a third processor configured to indicate an RA problem to the upper layers in response to the updated value of the first counter being greater than the first limit.

[0028] As an implementation, the first node also includes: a fourth processor configured to stop the first time window in response to the first RAR being successfully received during the first time window.

[0029] As an implementation, the first receiver is still configured to receive first information, where the first information is configured to determine a plurality of candidate values, the plurality of candidate values ​​including X1 and X2.

[0030] According to a fourth aspect, a second node for wireless communication is provided. The second node includes: a second receiver configured to receive X1 first random access (RA) preambles, where X1 is a positive integer greater than 1; and a fifth processor configured to determine whether a control signal for a first random access response (RAR) should be transmitted according to the result of receiving the X1 first RA preambles during a first time window, where the first RAR corresponds to the X1 first RA preambles. Upon expiration of the first time window, if the control signal for the first RAR is not successfully transmitted, a magnitude relationship between an updated value of a first counter of a first node transmitting the X1 first RA preambles and a first threshold is configured to Petition 870250075828, dated 08 / 27 / 2025, page 16 / 151 8 / 64 determine whether to perform the reception of X2 seconds RA preambles, X2 being a positive integer greater than or equal to X1, and the first limit being configured by upper layer signaling.

[0031] As an implementation, the second receiver is further configured to: receive the X2-second RA preambles in response to the updated value of the first counter being less than the first limit; and discard the reception of the X2-second RA preambles in response to the updated value of the first counter being greater than the first limit.

[0032] As an implementation, a magnitude relationship between an updated value of a second counter of the first node and a sum of a second limit plus 1 is configured to determine whether to execute the reception of the X2 second RA preambles, or whether the updated value of the second counter of the first node is equal to the sum of the second limit plus 1 is configured to determine whether to execute the reception of the X2 second RA preambles, the second limit being configured by upper-layer signaling.

[0033] As an implementation, the second receiver is further configured to: execute the reception of the X2-second RA preambles in response to the updated value of the first counter being less than the first limit and the updated value of the second counter not being equal to the sum of the second limit plus 1; and discard the reception of the X2-second RA preambles in response to the updated value of the first counter being greater than the first limit or the updated value of the second counter being equal to the sum of the second limit plus 1.

[0034] As an implementation, the fifth processor is further configured to interrupt the first time window, in response to the control signal for the first RAR being successfully transmitted during the first time window.

[0035] As an implementation, the second node also includes: a Petition 870250075828, dated 08 / 27 / 2025, page 17 / 151 9 / 64 second transmitter configured to transmit initial information, the initial information being configured to determine a plurality of candidate values, the plurality of candidate values ​​including X1 and X2.

[0036] According to a fifth aspect, a first node for wireless communication is provided and includes a transceiver, a memory for storing programs, and a processor, where the processor is configured to invoke the programs in memory to control the transceiver to receive or transmit signals to cause the first node to execute the method as described in the first aspect.

[0037] According to a sixth aspect, a second node for wireless communication is provided and includes a transceiver, a memory for storing programs, and a processor, where the processor is configured to invoke the programs in memory to control the transceiver to receive or transmit signals to cause the second node to execute the method as described in the second aspect.

[0038] According to a seventh aspect, a communication system is provided. The communication system includes the first node and / or the second node, as 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 solutions provided by the embodiments of this disclosure.

[0039] According to an eighth aspect, a computer-readable storage medium is provided and stores a computer program, the computer program causing a computer to perform all or some operations of the method of any aspect described above.

[0040] According to a ninth aspect, a computer program product is provided. The computer program product includes a computer-readable non-transient storage medium that stores Petition 870250075828, dated 08 / 27 / 2025, page 18 / 151 10 / 64 a computer program, being the operable computer program to cause a computer to perform some or all of the operations in the method of the various aspects described above. In some implementations, the computer program product may be a software installation package.

[0041] According to a tenth aspect, a chip is provided and includes a memory and a processor, the processor being able to invoke and execute a computer program stored in memory to perform some or all of the operations described in the methods of the aspects above.

[0042] In embodiments of the present disclosure, when the first RAR corresponding to the first X1 RA preambles is not successfully received, the first node can determine whether to transmit X2 second RA preambles according to the magnitude relationship between the updated value of the first counter and the first limit, and the updated value of the first counter is related to X2. By setting the first limit, the first node can limit the total number of RA preamble transmissions, which is useful for reducing the resource consumption of multiple PRACH retransmissions.

[0043] In the ways this disclosure is carried out, when the first RAR is not successfully received, the first node may determine whether to continue transmitting the RA preambles according to the first limit and the updated value of the first counter, in order to balance the PRACH resource consumption and the validity of the RA.

[0044] In the dissemination implementation methods, the first node supports retransmissions based on multiple PRACH transmissions and determines the number of retransmissions based on multiple PRACH transmissions according to the first limit and the updated value of the first counter, which is not only useful for improving the performance gain of multiple PRACH transmissions and increasing the coverage range, but Petition 870250075828, dated 08 / 27 / 2025, p. 19 / 151 11 / 64 is also useful for reducing AR latency and improving the efficiency of AR resource utilization. Brief Description of the Drawings

[0045] Figure 1 is an example diagram of a system architecture for a wireless communication system to which a form of embodiment of the present disclosure can be applied.

[0046] Figure 2 is a flowchart of a method for use in a first wireless communication node according to an embodiment of the present disclosure.

[0047] Figure 3 is a flowchart of a possible implementation of the method in Figure 2.

[0048] Figure 4 is a flowchart of another possible implementation of the method in Figure 2.

[0049] Figure 5 is a schematic structural diagram of a first node for wireless communication according to one embodiment of the present disclosure.

[0050] Figure 6 is a schematic structural diagram of a second node for wireless communication according to one embodiment of the present disclosure.

[0051] Figure 7 is a schematic structural diagram of a device according to an embodiment of the present disclosure.

[0052] Figure 8 is a schematic diagram of a hardware module of a communication device according to an embodiment of the present disclosure. Detailed Description of the Invention: Communication System Architecture

[0053] Figure 1 is an illustrative diagram of the architecture of a wireless communication system (100) to which a form of embodiment of Petition 870250075828, dated 08 / 27 / 2025, page 20 / 151 12 / 64 present disclosure may be applied. The wireless communication system (100) may include a network device (110) and at least one user equipment (UE) (120). The network device (110) may communicate with each UE (120). The network device (110) may provide communication coverage for a specific geographic region and may communicate with at least one UE (120) located within the coverage region.

[0054] Figure 1 illustrates, in an exemplary manner, a network device and two UEs. Alternatively, the wireless communication system (100) may include a plurality of network devices, and other numbers of UEs may be included within a coverage range of each network device, which is not limited in the embodiments of the present disclosure.

[0055] Alternatively, the wireless communication system (100) may also include other network entities, such as network controllers, mobility management entities and the like, which are not limited in the embodiments of the present disclosure.

[0056] It should be understood that the technical proposal of the embodiments of this disclosure can be applied to initial access or beam fault recovery. Furthermore, the technical proposal of the embodiments of this disclosure can be applied to the Type 1 random access procedure or the Type 2 random access procedure. Additionally, the technical proposal of the embodiments of this disclosure can be applied to the Uu interface or the PC5 interface. Furthermore, the technical proposal of the embodiments of this disclosure can be applied to single-carrier communication or multi-carrier communication. Furthermore, the technical proposal of the embodiments of this disclosure can be applied to multi-antenna communication or single-antenna communication. Furthermore, the technical proposal of the embodiments of this disclosure can be applied in a scenario involving UEs and a station. Petition 870250075828, dated 08 / 27 / 2025, page 21 / 151 The 13 / 64 base can be applied in a V2X scenario, in a communication scenario involving UEs and relays, or in a communication scenario involving relays and base stations, in order to obtain similar technical effects in the scenario involving UEs and the base station. Furthermore, the technical proposal of the embodiments presented in this disclosure can be applied to various communication scenarios, such as enhanced mobile broadband (eMBB) scenarios, ultra-reliable low-latency communication (URLLC) scenarios, massive machine-type communication (mMTC) scenarios, and similar scenarios. In addition, adopting a unified solution for different scenarios also helps to reduce hardware complexity and cost.

[0057] It should be understood that the embodiments and features in the embodiments of the first node of this disclosure may be applied to the second node and vice versa without conflict. The embodiments of this disclosure and the features in the embodiments may be arbitrarily combined with each other without conflict.

[0058] It should be understood that the technical solutions of the embodiments of this disclosure can be applied to various communication systems, such as: 5th generation (5G) mobile communication systems or new radio systems (NR), long-term evolution (LTE) systems, frequency division duplex (FDD) LTE systems, time division duplex (TDD) LTE systems and the like. The technical proposal presented in this disclosure can also be applied to future communication systems, such as sixth generation mobile communication systems, satellite communication systems, etc.

[0059] The UE in embodiments of this disclosure may also be referred to as a terminal device, an access terminal, a subscriber unit, a subscriber station, a mobile station, a mobile station (MS), a mobile terminal (MT), a remote station, a terminal Petition 870250075828, dated 08 / 27 / 2025, p. 22 / 151 14 / 64 remote, a mobile device, a user terminal, a terminal, a wireless communication device, a user agent, or a user device. The UE in the embodiments of this disclosure may be a device that provides voice and / or data connectivity to a user and may be used to connect people, objects, and machines, such as portable devices with wireless connectivity, vehicle-mounted devices, etc.The UE, in the embodiments of this disclosure, may be a mobile phone, a tablet (Pad), a notebook, a palmtop, 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 autonomous driving, a wireless terminal in remote medical surgery, a wireless terminal in a smart network, a wireless terminal in transport security, a wireless terminal in a smart city, a wireless terminal in a smart home, etc. Alternatively, the UE may be used to act as a base station. For example, the UE may act as a scheduling entity that provides side-link signals between UEs in V2X or D2D or similar. For example, mobile phones and cars communicate using side-link signals.Cell phones communicate with smart home devices without relaying communication signals through base stations.

[0060] The network device in embodiments of this disclosure may be a device for communication with the UE, and the network device 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 embodiments of this disclosure may refer to a radio access network (RAN) node (or device) that accesses an UE to a wireless network. The base station may encompass or broadly replace the following names, such as Node B, Node Petition 870250075828, dated 08 / 27 / 2025, p. 23 / 151 15 / 64 Evolved B Node (eNB), Next Generation B Node (gNB), relay station, access point, transmit and receive point (TRP), transmit point (TP), Master eNodeB (MeNB), Secondary eNodeB (SeNB), multi-pattern radio node (MSR), home base station, network controller, access node, wireless node, access point (AP), transmit 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, and the like. The base station may be a macro base station, a micro base station, a relay node, a donor node, or similar, or a combination thereof. The base station may also refer to a communication module, a modem, or a chip supplied in the device or appliance.A base station can also be a mobile switching center and a device that performs a base station function in device-to-device (D2D), vehicle-to-everything (V2X), machine-to-machine (M2M) communications, a network-side device in a 6G network, a device that performs a base station function in a future communication system, and similar applications. Base stations can support networks with the same or different access technologies. There is no restriction on the specific technology and equipment adopted by the network in the ways this disclosure is carried out.

[0061] The base station can be fixed or mobile. For example, a helicopter or unmanned aerial vehicle can be configured to act as a mobile base station, and one or more cells can change depending on the location of the mobile base station. In other examples, the helicopter or unmanned aerial vehicle can be configured to serve as a communication device with another base station.

[0062] In some implementations, the network device in the embodiments of this disclosure may refer to a CU or a Petition 870250075828, dated 08 / 27 / 2025, p. 24 / 151 16 / 64 DU, or the network device includes a CU and a DU. The gNB may also include an AAU.

[0063] The network device and the UE can be deployed on land, including indoor or outdoor devices, portable or vehicle-mounted, or they can also be deployed on the water surface. Alternatively, the network device and the UE can also be deployed on airplanes, balloons, and satellites in the air. In the embodiments of this disclosure, the scene in which the network device and the UE are located is not limited.

[0064] It should be understood that all or part of the communication device functionality in this disclosure may also be implemented by software functionality running on hardware or by virtualization functionality instantiated on a platform (e.g., a cloud platform).

[0065] It should be understood that the terminology in embodiments of this disclosure may be interpreted with reference to the 3GPP TS36 series, TS37 series and TS38 series specification protocols, and may also be interpreted with reference to the specification protocols of the Institute of Electrical and Electronics Engineers (IEEE). Increased coverage of PRACH transmission

[0066] The coverage performance of communication systems (e.g., NR system) is an important factor that operators need to consider when deploying commercial communication networks, because the coverage performance of communication systems can directly affect the quality of service of the communication system and the cost to operators, such as capital expenditures (CAPEX) and operating expenses (OPEX).

[0067] The coverage performance of communication systems Petition 870250075828, dated 08 / 27 / 2025, page 25 / 151 17 / 64 coverage can vary depending on the different operating frequency bands. For example, compared to LTE systems, NR systems operate in higher frequency bands (e.g., millimeter wave bands), resulting in greater path loss in NR systems, leading to relatively lower coverage performance. Therefore, as the frequency bands supported by communication systems can become increasingly higher, improving the coverage of communication systems has become a problem to be solved.

[0068] In most real-world deployment scenarios, where UE capacity is lower than that of the network device, uplink coverage (UL) performance is the bottleneck for improving communication system coverage. With the development of communication technologies, uplink services in some emerging vertical use cases are gradually increasing, for example, video upload services. In the scenario of more uplink services, how to improve uplink coverage is a problem that needs to be addressed in more detail.

[0069] In related technologies, there are technical schemes for coverage enhancement for some uplinks. For example, in version (17) (Rel-17) of NR, coverage enhancement schemes were designed for physical uplink shared channel (PUSCH), physical uplink control channel (PUCCH) and message 3 (Msg3) in a random access procedure.

[0070] However, in Rel-17, there is no design scheme for improving PRACH coverage, but PRACH transmission performance is very important for many processes, such as initial access and beam fault recovery, therefore improving PRACH coverage is also relatively important. Based on this, the 3rd Generation Partnership Project (3GPP) formally established the work item (WI) for “further improvements in NR coverage” in NR Rel-18 through the project. Petition 870250075828, dated 08 / 27 / 2025, page 26 / 151 18 / 64 RP-221858, in which improving the performance of PRACH transmission coverage is one of the important topics of the work item.

[0071] As a possible implementation, multiple PRACH transmissions can be used to obtain increased coverage of PRACH transmissions. That is, the performance gain of PRACH transmissions can be obtained through repeated transmissions on the PRACH (for example, sending preambles on the PRACH many times).

[0072] To achieve improved coverage of PRACH transmissions, the RAN1#110bis-e conference of the 3GPP radio access network (RAN) agreed to utilize multiple PRACH transmissions from the same beam in an attempt to RACH to achieve performance gain. The RAN1#110bis-e conference also supports the use of the same PRACH preamble in multiple PRACH transmissions, and PRACH occasions (ROs) at different time instances can be configured for multiple PRACH transmissions.

[0073] Furthermore, the 3GPP RAN1#112 conference agreed to introduce a group of PRACH occasions (RO group, ROG) for multiple PRACH transmissions. Additionally, all ROs in a ROG are associated with the same synchronization signal block(s) / physical transmission channel (SS / PBCH block(s), SSB(s)). The number of PRACH transmissions in multiple PRACH transmissions using the same beam is 2, 4, or 8, i.e., multiple PRACH transmissions using the same beam support: 2 PRACH transmissions, 4 PRACH transmissions, or 8 PRACH transmissions.

[0074] Furthermore, the 3GPP RAN1#112bis-e conference agreed that multiple PRACH transmissions in a RACH attempt are performed only on one ROG, the number of PRACH transmissions in the multiple PRACH transmissions is set to one or more values, and Petition 870250075828, dated 08 / 27 / 2025, page 27 / 151 19 / 64 The number of valid ROs in a ROG is equal to one or more values. That is, a size (ROG size) of the ROG is one of two ROs, four ROs, or eight ROs, depending on one or more values ​​configured for the number of PRACH transmissions in multiple PRACH transmissions.

[0075] Based on the above technical progress, subsequent conferences discussed the retransmission scheme based on multiple PRACH transmissions and increasing the number of PRACH transmissions in retransmissions. For example, the 3GPP RAN1#113 conference discussed a scheme to perform a single PRACH transmission or multiple PRACH transmissions in an initial RACH attempt, allowing for an increase in the number of PRACH transmissions in retransmissions. In this way, it is possible to allow the UE in limited coverage scenarios to access the system quickly, adjusting the number of PRACH transmissions in multiple PRACH transmissions in retransmissions when the number of PRACH transmissions determined in the initial RACH attempt is not able to meet the performance requirements.Especially when the transmission power of the UE PRACHs reaches a maximum transmission power and there is no extra power to increase coverage, increasing the number of PRACH transmissions in multiple PRACH transmissions to achieve fusion gain is an effective solution. As another example, the 3GPP RAN2#122 conference also agreed to discuss in more depth a fallback mechanism from the smaller number of PRACH transmissions to the larger number of PRACH transmissions in multiple PRACH transmissions.

[0076] However, increasing the number of PRACH transmissions from multiple PRACH transmissions in the retransmission may consume extra time-frequency resources and increase the probability of PRACH preamble collisions. When the number of transmissions of Petition 870250075828, dated 08 / 27 / 2025, page 28 / 151 20 / 64 The number of PRACH transmissions from multiple PRACH retransmissions performed by the UE in a previous RACH attempt is already relatively large. Increasing the number of PRACH transmissions from multiple PRACH retransmissions in multiple retransmissions can cause high resource consumption and increase the probability of preamble collisions. Especially if the UE access failure is caused by preamble collisions, increasing the number of PRACH transmissions at the cost of resource consumption is an inefficient and wasteful solution. In this case, a good solution is to restart another random access procedure and reselect the random access resources and PRACH preambles.

[0077] Therefore, in the scenario of running multiple PRACH retransmissions, how to allocate PRACH multiple retransmission resources and how to balance the resource consumption of multiple PRACH retransmissions and the effectiveness of random access are problems that need to be solved.

[0078] To solve the above problems, the forms of disclosure provide a method and a device for use in nodes for wireless communication, which can reduce the resource consumption of multiple PRACH retransmissions, balance the resource consumption of multiple PRACH retransmissions and the effectiveness of random access, and contribute to reducing random access delay and improving the efficiency of random access resource utilization, while improving the performance gain of multiple PRACH transmissions and increasing coverage range.

[0079] The methods of carrying out the present disclosure can be applied to a retransmission scenario based on multiple transmissions of PRACHs, i.e., repeated transmissions of multiple PRACHs (multiple retransmissions of PRACHs) can be adopted in multiple attempts to Petition 870250075828, dated 08 / 27 / 2025, page 29 / 151 21 / 64 RACH to carry out the improvement of PRACH coverage.

[0080] In some embodiments, the multiple PRACH transmissions mentioned in the embodiments of this disclosure may refer to multiple PRACH transmissions using the same beam, to obtain a signal-to-noise ratio gain by performing repeated transmissions of multiple PRACHs on the same beam. In some embodiments, the multiple PRACH transmissions mentioned in the embodiments of this disclosure may refer to multi-PRACH transmissions using different beams, to obtain diversity gain by performing repeated transmissions of multiple PRACHs on the different beams.

[0081] It should be noted that the beam mentioned in the embodiments of this disclosure may be replaced by other terms, such as an antenna port, a spatial filter, a spatial parameter, etc., which may have identical meanings, and the embodiments of this disclosure do not distinguish between them.

[0082] The embodiments of this disclosure can be applied to an initial access procedure or to a beam failure recovery procedure. Taking the initial access procedure as an example, the embodiments of this disclosure can be applied to a four-step random access procedure (i.e., Type 1 random access procedure) or they can also be applied to a two-step random access procedure (i.e., Type 2 random access procedure), which is not limited to the embodiments of this disclosure.

[0083] The embodiments of the method of the present disclosure are described in detail below, with reference to the accompanying drawings. Figure 2 is a flowchart of a method for use in a first wireless communication node, according to an embodiment of the present disclosure. Petition 870250075828, dated 08 / 27 / 2025, page 30 / 151 22 / 64 disclosure. The method is used for interaction between the first node and a second node.

[0084] As one embodiment, the first node can be a network-controlled repeater (NCR).

[0085] As one embodiment, the first node can be a UE, such as the UE (120) shown in Figure 1.

[0086] As one embodiment, the first node can be a relay, such as a relay terminal.

[0087] As one embodiment, the second node can be a network device, such as network device (110) shown in Figure 2.

[0088] The method shown in Figure 2 includes operations on (S210, S220 and S230), which are described below.

[0089] In (S210), the first node transmits X1 first random access (RA) preambles, where X1 is a positive integer greater than 1.

[0090] The random access preamble (RA preamble) can be replaced by the PRACH preamble described above. The first RA preamble refers to an RA preamble generated by the first node via an RA sequence.

[0091] In some embodiments, the first RA preamble is an RA preamble sent by the first node in an ongoing RA process (also known as an RA procedure). The ongoing RA procedure may be called the first RA procedure. The first RA procedure may include multiple random access channel attempts (RACH attempts) by the first node. The first RA preamble is a preamble transmitted in an ongoing RACH attempt.

[0092] As a form of implementation, the first RA procedure includes the transmission of the X1 RA preambles.

[0093] As a form of accomplishment, an attempt at RACH Petition 870250075828, dated 08 / 27 / 2025, p. 31 / 151 The 23 / 64 currently performed by the first node includes the transmission of the first X1 RA preambles. The RACH attempt currently performed can be any of the multiple RACH attempts in the first RA procedure. For example, the X1 RA preambles currently transmitted by the first node can be X1 RA preambles transmitted for the first time or for the Nth time (N>1).

[0094] In some embodiments, the number of RA preambles transmitted by the first node is related to the number of PRACH transmissions of the multiple PRACH transmissions. For example, the first X1 RA preambles may indicate that the number of PRACH transmissions of the multiple PRACH transmissions currently performed by the first node is X1.

[0095] In some embodiments, the number of RA preambles transmitted by the first node is related to the number of ROs in a ROG occupied by multiple PRACH transmissions. For example, the first X1 AR preambles may indicate that the number of ROs in the ROG occupied by multiple PRACH transmissions currently performed by the first node is X1.

[0096] As one embodiment, the first node may transmit the same number or different numbers of RA preambles in multiple RACH attempts. For example, the first node transmits X1 RA preambles in the current RACH attempt, and the number of RA preambles to be transmitted by the first node in the next RACH attempt is different from X1.

[0097] In some embodiments, the first node can determine X1 by receiving the first information. For example, the first information is set up to determine a plurality of candidate values, the plurality of candidate values ​​including X1. Petition 870250075828, dated 08 / 27 / 2025, page 32 / 151 24 / 64

[0098] As a realization, the plurality of candidate values ​​for X1 includes at least one from {2, 4, 8}.

[0099] For the second node, the second node may receive the first X1 RA preambles. In some embodiments, the second node may receive one or more of the first X1 RA preambles. In some embodiments, the second node may not receive any first RA preambles.

[00100] In (S220), a control signal for a first RAR is monitored during a first time window.

[00101] The first time window may be a time window in which the first node monitors a random access response (RAR) for the X1 RA preambles.

[00102] As a form of implementation, a media access control (MAC) entity may initiate / begin a first time window on a first occasion of physical downlink control channel (PDCCH) after the termination of the transmission of the first RA preambles.

[00103] The control signaling for the first RAR can be carried by a PDCCH associated with the first RAR.

[00104] As a way of implementing this, for the initial access procedure, the first node that monitors the control signaling for the first RAR includes monitoring the PDCCH for the RAR during the execution of the first time window.

[00105] As an embodiment, for the beam fault recovery procedure, the first node that monitors the control signaling for the first RAR includes monitoring PDCCH transmissions in a search space indicated by recoverySearchSpaceld during the execution of the first time window.

[00106] As a form of implementation, the first procedure Petition 870250075828, dated 08 / 27 / 2025, page 33 / 151 25 / 64 RA includes monitoring of the control signaling for the first RAR during the first time window.

[00107] As a form of accomplishment, the first RA procedure includes receiving the first RAR.

[00108] As a form of implementation, the first RA procedure includes the transmission of a first shared physical uplink channel (PUSCH), with the first PUSCH being scheduled by an uplink grant (UL grant) on the first RAR.

[00109] As a form of implementation, the first RA procedure includes reception of the first shared physical downlink channel (PDSCH), with the first PDSCH configured for collision resolution.

[00110] The first RAR corresponds to the first X1 RA preambles. That is, the first RAR is a RAR sent by the second node to one or more of the first X1 RA preambles. The second node can determine, within the first time window, whether to transmit the control signal to the first RAR according to the result of receiving the first X1 RA preambles.

[00111] In some embodiments, the result of receiving the first RA preambles may include the number of at least one first RA preamble, out of the X1 first RA preambles, that was received, or it may also include whether there is any RA preamble out of the X1 first RA preambles colliding with other RA preambles, which is not limited to here.

[00112] As a form of implementation, the second node may transmit, within the first time window, the first RAR when at least one first RA preamble received by the second node satisfies a condition for RAR transmission. Conversely, if no first RA preamble is received by the second node, or if at least one first Petition 870250075828, dated 08 / 27 / 2025, p. 34 / 151 26 / 64 preamble of received RA does not satisfy the condition for RAR transmission, the second node does not transmit the first RAR.

[00113] In (S230), if the first time window expires and no first RAR is received (the first RAR reception is unsuccessful), a current value of a first counter is incremented by X2 to obtain an updated value of the first counter, where X2 is a positive integer greater than or equal to X1.

[00114] The reception of the first RAR not being successful means that when the first time window expires, the first node does not receive the first RAR corresponding to the first X1 RA preambles, or the first node fails to receive the first RAR.

[00115] As a way of realizing this, when the first time window expires, if the first node does not receive any PDCCH transmissions in the search space indicated by recoverySearchSpaceld in a service cell where the first node transmitted the first RA preambles, this indicates that the first node did not receive the first RAR.

[00116] As a way of realizing this, when the first time window expires, if the first node does not receive the RAR or an identity of an RA preamble contained in a received RAR does not match a transmitted preamble index, this indicates that the first RAR was not successfully received.

[00117] The first counter is configured for the first node to count the number of PRACH transmissions from all multiple PRACH transmissions in multiple RACH attempts, or to count the number of ROs occupied by all multiple PRACH transmissions, or to count the number of RA preambles transmitted.

[00118] In some embodiments, the first counter may be a conventional first preamble transmission counter. Petition 870250075828, dated 08 / 27 / 2025, page 35 / 151 27 / 64 node or a newly configured PRACH transmission counter from the first node, which is not limited here.

[00119] As one embodiment, the first counter can be PREAMBLE_TRANSMISSION_COUNTER, that is, the conventional preamble transmission counter is reused.

[00120] In some embodiments, an initial value of the first counter is defined as the number of PRACH transmissions in multiple first-time PRACH transmissions, or the number of ROs, in the ROG, occupied by multiple first-time PRACH transmissions, or the number of RA preambles transmitted in an initial RACH attempt. It should be understood that, in embodiments of the present disclosure, the number of PRACH transmissions, the number of ROs, and the number of transmitted RA preambles may be equal to each other.

[00121] As a way of realizing this, the initial value of the first counter is defined as X0, and X0 is a positive integer greater than 1. For example, X0 can be at least one of {2, 4, 8}.

[00122] As a form of implementation, the initial value of the first counter is defined as a maximum value of the number of RA preambles, or a maximum value of the number of PRACH transmissions, or a maximum value of the number of ROs occupied by multiple PRACH transmissions.

[00123] In some embodiments, when the initial value of the first counter is a parameter of the initial RACH attempt, the initial value of the first counter is less than or equal to a current value of the first counter. The current value of the first counter may be a cumulative value of the first counter when the first node is making a current RACH attempt. For example, when the first node makes the initial RACH attempt, the current value of the first counter is equal to the initial value of the first counter. As another example, after an (N+1)-th (N>1) RACH attempt made by the first node, Petition 870250075828, dated 08 / 27 / 2025, page 36 / 151 28 / 64 the current value of the first counter may be a cumulative value based on N previous attempts of RACH and, in this case, the current value of the first counter is greater than the initial value of the first counter.

[00124] The updated value of the first counter is the value of the first counter after being updated once based on the current value of the first counter. The value of the first counter may be updated according to the result of receiving a channel access response after the transmission of the RA preambles or before the planned start of the next RACH attempt. For example, the value of the first counter may be updated in a scenario where the first RAR corresponding to the first X1 RA preambles is not successfully received.

[00125] In some embodiments, when the initial value of the first counter is the parameter in the initial RACH attempt, the value of the first counter is updated incrementally, that is, the value of the first counter is increased when the value of the first counter needs to be updated. A value to be increased from the first counter can be the number of RA preambles corresponding to the next RACH attempt.

[00126] The current value of the first counter is increased by X2 to obtain the updated value of the first counter, meaning that the sum of the current value of the first counter plus X2 is considered the updated value of the first counter. X2 is equal to the number of PRACH transmissions in the multiple PRACH transmissions of the first node in the next moment.

[00127] As a way of realizing this, the first node can determine X2 upon receiving the first information. For example, the first information is configured to determine a plurality of candidate values, the plurality of candidate values ​​including X2.

[00128] As a realization, the plurality of candidate values ​​for X2 includes at least one from {2, 4, 8}. Petition 870250075828, dated 08 / 27 / 2025, p. 37 / 151 29 / 64

[00129] As a form of implementation, the first information is set up to determine a plurality of candidate values, the plurality of candidate values ​​including X1 and X2.

[00130] As a form of realization, the plurality of candidate values ​​includes at least two of {2, 4, 8}.

[00131] As a embodiment, X1 equals 2, and X2 is one of {4, 8}.

[00132] As a form of realization, X1 equals 4 and X2 equals 8.

[00133] In some embodiments, the number of PRACH transmissions in the current PRACH multiple transmissions in multiple retransmissions may be different from or equal to the number of PRACH transmissions in the previous PRACH multiple transmissions.

[00134] As a way of achieving improved coverage, the number of PRACH transmissions from multiple retransmissions of current PRACHs may be greater than the number of PRACH transmissions from multiple transmissions of previous PRACHs. For example, X2 is greater than X1.

[00135] As a form of embodiment, the number of PRACH transmissions of the multiple retransmissions of the current PRACH may also be equal to the number of PRACH transmissions of the multiple transmissions of the previous PRACH. For example, X2 is equal to X1.

[00136] As a way of implementing this, if the first time window expires and the first node does not successfully receive the RAR, the preamble transmission counter may increase the number of PRACH transmissions in the next multiple PRACH transmissions for retransmissions, or the number of ROs in the ROG occupied by the next multiple PRACH transmissions for retransmissions. For example, if the number of transmissions Petition 870250075828, dated 08 / 27 / 2025, page 38 / 151 30 / 64 of the PRACH of the next multiple transmissions of the PRACH from the first node is X2, the first counter increments X2 based on the current value to obtain the updated value.

[00137] As a way of implementing this, when the initial value of the first counter is the maximum number of PRACH transmissions or the maximum number of ROs, the value of the first counter is decreased during the update. That is, when the value of the first counter needs to be updated, the value of the first counter is decreased. The value to be decreased from the first counter can be equal to the number of RA preambles corresponding to a next RACH attempt.

[00138] In some embodiments, the first node can select a PRACH occasion based on an update result of the first counter's value. The PRACH occasion is also represented by RO.

[00139] In some embodiments, after the initial value of the first counter is set to X0, the first node can select X0 ROs, and the X0 ROs are set for the first RA procedure.

[00140] As a form of implementation, the X0 ROs are configured to transmit X0 third-party RA preambles.

[00141] As a form of implementation, the first RA procedure includes the transmission of the X0 third RA preambles.

[00142] As a form of realization, the X0 third preambles of RA are the same as the X1 first preambles of RA.

[00143] As a form of embodiment, the third X0 preambles of AR are different from the first X1 preambles of AR.

[00144] As a way of implementing this, when the first counter is incremented by X2 based on the current value, if the updated value of the first counter is less than a first limit, the first node can select Petition 870250075828, dated 08 / 27 / 2025, p. 39 / 151 31 / 64 X2 ROs for transmission of X2 seconds RA preambles.

[00145] As a form of realization, the X2 second preambles of RA are the same as the X1 first preambles of RA.

[00146] As a form of realization, the X2 second preambles of RA are different from the X1 first preambles of RA.

[00147] A magnitude relationship between the updated value of the first counter and the first threshold is set up to determine whether the X2 second RA preambles should be transmitted. That is, the first node can determine whether to continue making a new RACH attempt based on the updated value of the first counter obtained by the first counter in the operations in (S230) and the first threshold.

[00148] In some embodiments, the transmission of the X2-second RA preambles by the first node means that multiple PRACH transmissions will be performed next time based on the X2-second RA preambles after multiple PRACH transmissions based on the first X1 RA preambles. If the X2-second RA preambles are to be transmitted by the first node, this also means that multiple PRACH retransmissions are to be performed by the first node. If the first node transmits the X2-second RA preambles, this is equivalent to indicating that it should continue to perform multiple PRACH retransmissions. If the first node discards a transmission of the X2-second RA preambles, it is equivalent to abandoning the multiple PRACH retransmissions.

[00149] As a form of implementation, the magnitude ratio between the updated value of the first counter and the first limit is set to determine if the first RA procedure was not completed successfully, with the first limit set by upper-layer signaling.

[00150] As a form of accomplishment, the transmission of X2 Petition 870250075828, dated 08 / 27 / 2025, p. 40 / 151 32 / 64 seconds of RA preamble is equivalent to the successful completion of the first RA procedure.

[00151] As a form of implementation, the second RA preambles can be the same as the first RA preambles. That is, the preambles configured for multiple transmissions of PRACHs in retransmissions can be the same as the preambles in the multiple transmissions of PRACHs the last time. For example, the second RA preambles are generated by the same sequence of RA preambles as the first RA preambles.

[00152] As a way of doing this, the second RA preambles can be different from the first RA preambles. That is, the preambles configured for multiple PRACH transmissions for retransmission can be different from the preambles for the last multiple PRACH transmissions. For example, the first node again selects a different preamble from the first RA preamble as the second RA preamble.

[00153] As a way of implementing this, when the value of the first counter is updated by decreasing the value of the first counter, the initial value of the first counter is the first limit, and a magnitude relationship between the updated value of the first counter and 0 is set to determine whether the X2 second RA preambles should be transmitted.

[00154] The first limit is set by upper-layer signaling. Upper-layer signaling can be radio resource control (RRC) signaling. RRC signaling indicates configuration parameters of an RRC information element (IE).

[00155] As a way of implementing this, the first limit is set by “preambleTransMax” in the RRC IE RACH - ConfigGeneric.

[00156] As a form of realization, the first limit is indicated Petition 870250075828, dated 08 / 27 / 2025, page 41 / 151 33 / 64 for a second piece of information. The second piece of information can be “preambleTransMax” in RRC IE, or the second piece of information includes “preambleTransMax”.

[00157] As a way of implementing this, the first limit is set by newly introduced / configured RRC IE parameters.

[00158] In some embodiments, the first limit is a maximum total number of PRACH transmissions, or a maximum total number of ROs, or a maximum total number of RA preambles transmitted.

[00159] The magnitude relationship between the updated value of the first counter and the first limit is configured to determine whether the X2-second RA preambles should be transmitted, including: transmitting the X2-second RA preambles when the updated value of the first counter is less than the first limit, and not transmitting the X2-second RA preambles (discarding the transmission of the X2-second RA preambles) when the updated value of the first counter is greater than the first limit.

[00160] As a way of implementing this, transmit the X2-second RA preambles when the updated value of the first counter is less than or equal to the first limit. When the updated value of the first counter is greater than the first limit, the X2-second RA preambles are not transmitted (the transmission of the X2-second RA preambles is discarded).

[00161] As a way of implementing this, transmit the X2-second RA preambles when the updated value of the first counter is less than the first limit. When the updated value of the first counter is equal to or greater than the first limit, the X2-second RA preambles are not transmitted.

[00162] As a form of accomplishment, the transmission of the X2 seconds RA preambles being discarded is equivalent to the unsuccessful completion of the first RA procedure. Petition 870250075828, dated 08 / 27 / 2025, p. 42 / 151 34 / 64

[00163] For the second node, when the first node transmits the X2-second RA preambles, the second node can receive the X2-second RA preambles. When the first node stops transmitting the X2-second RA preambles, the second node stops receiving the X2-second RA preambles.

[00164] In some embodiments, when the updated value of the first counter is greater than the first threshold, the first node needs to notify the upper layers so that the upper layers can determine whether the first RA procedure was successful.

[00165] As a way of realizing this, when the updated value of the first counter is greater than the first limit, an RA problem is indicated for the upper layers.

[00166] As a way of doing this, indicating the RA problem to the upper layers is equivalent to interrupting the transmission of the X2-second RA preambles.

[00167] As a way of implementing this, if the value of the first counter exceeds the maximum total number of PRACH transmissions or the maximum total number of ROs indicated by the second piece of information, an RA problem (i.e., the retransmission of multiple PRACH transmissions is abandoned) is indicated to the upper layers. If the value of the first counter does not exceed the maximum total number of PRACH transmissions or the maximum total number of ROs indicated by the second piece of information, the retransmission of multiple PRACH transmissions is performed.

[00168] In some embodiments, if the first node successfully receives the first RAR during the first time window, this indicates that the first RA procedure was completed successfully.

[00169] As a form of implementation, when the first RAR is successfully received during the first time window, it is discarded. Petition 870250075828, dated 08 / 27 / 2025, p. 43 / 151 35 / 64 For example, the MAC entity determines whether the first time window is started or discarded based on the result of executing the first RA procedure.

[00170] As a way of doing this, stopping the first time window refers to the fact that the MAC entity stops monitoring the time window for the first RAR.

[00171] For the second node, when the first RAR is successfully transmitted during the first time window, the first time window is interrupted.

[00172] As can be seen in Figure 2, in the embodiments of the present disclosure, no matter how many PRACH transmissions there are in the multiple PRACH transmissions, the first node can control the total number of PRACH transmissions or the total number of occupied ROs, thus reducing unnecessary resource waste in multiple PRACH retransmissions as much as possible and avoiding causing unnecessary conflict in PRACH preambles, in order to optimize resource allocation.

[00173] To facilitate understanding, a scheme in which the total number of PRACH transmissions of all multiple PRACH transmissions in multiple PRACH attempts is configured to determine whether multiple PRACH retransmissions should be performed is illustrated below in conjunction with Figure 3. Figure 3 is a flowchart of a possible implementation of the method of performing the present disclosure by the first node.

[00174] Referring to Figure 3, in (S302), a first RA procedure is initiated.

[00175] In (S304), the value of a preamble transmission counter is defined as the number of PRACH transmissions in multiples Petition 870250075828, dated 08 / 27 / 2025, p. 44 / 151 36 / 64 PRACH transmissions for the first time. The preamble transmission counter is a first counter.

[00176] In (S306), the method proceeds to a process of selecting AR features.

[00177] In (S308), a plurality of preambles is transmitted in a plurality of ROs in a ROG, respectively. Preambles transmitted at different times are either different or the same.

[00178] In (S310), it is determined whether a RAR was successfully received within a RAR time window. If the RAR is successfully received, the method proceeds to the operations in (S316). If the RAR is not successfully received within the RAR time window, the method proceeds to the operations in (S312).

[00179] In (S312), the value of the preamble transmission counter is updated. An updated value of the preamble transmission counter is the sum of the number of PRACH transmissions in multiple PRACH transmissions for retransmission with an original value of the preamble transmission counter. The number of PRACH transmissions in multiple PRACH transmissions for retransmission may be different from or equal to the number of PRACH transmissions in multiple PRACH transmissions last time.

[00180] In (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, the method proceeds to the operations in (S318). Otherwise, the method proceeds to the operations from (S306) to (S310).

[00181] In (S316), if the RAR is successfully received within the RAR time window, the RA procedure will be considered successfully completed, then the first RA procedure terminates. Petition 870250075828, dated 08 / 27 / 2025, p. 45 / 151 37 / 64

[00182] In (S318), if the RAR is not successfully received during the RAR time window, and the updated value of the preamble transmission counter exceeds the maximum total number of PRACH transmissions, the multiple PRACH transmissions for retransmission will be discarded. In this case, an RA problem is indicated to the upper layers, the RA procedure is considered to have completed unsuccessfully, and the first RA procedure is terminated.

[00183] The method for determining whether multiple PRACH retransmissions should be performed based on the total number of PRACH transmissions was previously described in conjunction with Figures 2 and 3. Examples in this disclosure further provide a method in which the total number of PRACH transmissions of all multiple PRACH transmissions and the maximum number of transmissions are configured to determine whether multiple PRACH retransmissions should be performed. For the sake of brevity, terms already explained in Figure 2 will not be repeated in the examples of this method.

[00184] After the operations in (S230) shown in Figure 2, a current value of a second counter is incremented by 1 to obtain an updated value of the second counter.

[00185] The second counter is configured for the first node to count the number of times all multiple PRACH transmissions in multiple RACH attempts are made (the number of transmissions), that is, the number of times the first node transmits RA preambles or the number of times RACH attempts are made.

[00186] As a form of implementation, the first counter and the second counter cooperate with each other, so that the first node comprehensively considers the number of PRACH transmissions and the number of times multiple PRACH transmissions are made when determining whether to Petition 870250075828, dated 08 / 27 / 2025, page 46 / 151 38 / 64 execute multiple retransmissions of PRACH.

[00187] As a form of embodiment, when the first counter is a conventional preamble transmission counter from the first node, the second counter is a newly configured transmission time counter from the first node.

[00188] As an embodiment, when the first counter is a newly configured PRACH transmission counter from the first node, the second counter is a conventional preamble transmission counter, and the preamble transmission counter configuration does not need to be adjusted.

[00189] The second counter may be PREAMBLE_TRANSMISSION_COUNTER.

[00190] As a way of doing this, an initial value for the second counter is set to 1, which is consistent with a conventional preamble transmission counter configuration.

[00191] As a way of implementing this, the initial value of the second counter is set to a maximum number of transmissions.

[00192] 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 a cumulative number of RACH attempts, including a current RACH attempt made by the first node. For example, when the first node makes the initial RACH attempt, the current value of the second counter is equal to 1. The initial value of the second counter is equal to the current value of the second counter. As another example, when the first node makes an Nth (N > 1) RACH attempt, the current value of the second counter may be N, and in this case, the current value of the second counter is greater than the initial value of the second counter.

[00193] The updated value of the second counter is the value of Petition 870250075828, dated 08 / 27 / 2025, page 47 / 151 39 / 64 second counter after a single update, based on the current value of the second counter. The value of the second counter may be updated according to the result of receiving a channel access response after the transmission of the RA preambles, or updated before the planned start of the next RACH attempt, or updated in a scenario where the updated value of the first counter is less than the first threshold. For example, in a scenario where the first RAR corresponding to the first X1 RA preambles is not successfully received, if the updated value of the first counter is less than the first threshold, the value of the second counter will be updated.

[00194] In some embodiments, when the initial value of the second counter is 1, the value of the second counter is updated by increasing the value of the second counter.

[00195] The current value of the first counter is increased by 1 to obtain an updated value for the first counter, which means that the first counter takes the sum of the current value and 1 as the updated value of the first counter.

[00196] As a way of implementing this, if the first time window expires, the first node does not successfully receive a RAR, the value of the second counter (e.g., the preamble transmission counter) is incremented by 1, and the value of the first counter (e.g., the PRACH transmission counter) is incremented by the number of PRACH transmissions in multiple PRACH transmissions in a subsequent retransmission, or incremented by the number of ROs, in the ROG, occupied by multiple PRACH transmissions in the subsequent retransmission.

[00197] As a way of implementing this, when the initial value of the second counter is the maximum number of transmissions, the value of the second counter is updated by decreasing, that is, the value of the second counter is Petition 870250075828, dated 08 / 27 / 2025, page 48 / 151 40 / 64 reduced by 1 during the update.

[00198] A magnitude relationship between the updated value of the second counter and the second threshold is set to determine whether the X2-second RA preambles should be transmitted. That is, the first node can determine whether to continue making another RACH attempt based on the updated value of the second counter and the second threshold. The second threshold is set by upper-layer signaling.

[00199] In some embodiments, the magnitude ratio between the updated value of the second counter and the sum of the second limit plus 1 is configured to determine whether the X2-second RA preambles should be transmitted. Alternatively, the configuration to determine whether the updated value of the second counter is equal to the sum of the second limit plus 1 is made to determine whether the X2-second RA preambles should be transmitted.

[00200] As a way of implementation, the magnitude ratio between the updated value of the second counter and the sum of the second limit plus 1 is set to determine if the first RA procedure was not completed successfully. The second limit is set by upper-layer signaling.

[00201] As a way of implementing this, when the value of the second counter is updated by decreasing the value of the second counter, the initial value of the second counter is the second limit, and a magnitude relationship between the updated value of the second counter and 0 is set to determine whether to transmit X2 seconds of RA preambles.

[00202] The second limit is set by upper-layer signaling. Upper-layer signaling can be RRC signaling.

[00203] As a way of implementing this, when the second counter is a preamble transmission counter, for the configuration of the second limit, one can refer to the configuration of the transmission counter. Petition 870250075828, dated 08 / 27 / 2025, page 49 / 151 41 / 64 preamble. For example, the second limit is set by “preambleTransMax” in the RRC IE RACH-ConfigGeneric, and the first limit is set by newly configured RRC IE parameters.

[00204] As a form of implementation, the second limit is indicated by the second piece of information. The second piece of information may be “preambleTransMax” in RRC IE. When the second piece of information includes “preambleTransMax”, the first limit is indicated by the third piece of information. For example, the second piece of information indicates the maximum number of transmissions and the third piece of information indicates the maximum number of transmissions for PRACH.

[00205] As a way of implementing this, when the first limit is set by “preambleTransMax”, the second limit is set by newly configured IE RRC parameters.

[00206] As a way of realizing this, the first limit is indicated by the second piece of information described above, and the second limit is indicated by the third piece of information.

[00207] As a form of implementation, the second limit is equal to the maximum number of transmissions for all multiple transmissions of PRACH.

[00208] The magnitude ratio between the updated value of the second counter and the sum of the second limit plus 1 is used to determine whether the X2-second RA preambles should be transmitted, including: interrupting the transmission of the X2-second RA preambles when the updated value of the second counter is greater than the second limit. Alternatively, the magnitude ratio between the updated value of the second counter and the second limit and the magnitude ratio between the updated value of the first counter and the first limit are used to determine whether the X2-second RA preambles should be transmitted.

[00209] As a form of accomplishment, transmit the X2 seconds Petition 870250075828, dated 08 / 27 / 2025, page 50 / 151 42 / 64 RA preambles when the updated value of the first counter is less than the first limit and the updated value of the second counter is not equal to the sum of the second limit plus 1. When the updated value of the first counter is greater than the first limit or the updated value of the second counter is equal to the sum of the second limit plus 1, the transmission of the X2 second RA preambles will be discarded.

[00210] As a way of implementing this, transmit the X2-second RA preambles when the updated value of the first counter is less than or equal to the first limit and the updated value of the second counter is not equal to the sum of the second limit plus 1. When the updated value of the first counter is greater than the first limit or the updated value of the second counter is equal to the sum of the second limit plus 1, the transmission of the X2-second RA preambles will be discarded.

[00211] As a way of implementing this, transmit the X2-second RA preambles when the updated value of the first counter is less than the first limit and the updated value of the second counter is not equal to the sum of the second limit plus 1. When the updated value of the first counter is equal to or greater than the first limit, or the updated value of the second counter is equal to the sum of the second limit plus 1, the transmission of the X2-second RA preambles will be discarded.

[00212] As a way of implementing this, transmit the X2-second RA preambles when the updated value of the first counter is less than the first limit and the updated value of the second counter is less than the sum of the second limit plus 1. When the updated value of the first counter is greater than the first limit or the updated value of the second counter is equal to the sum of the second limit plus 1, the transmission of the X2-second RA preambles will be discarded.

[00213] As a form of accomplishment, transmit the X2 seconds Petition 870250075828, dated 08 / 27 / 2025, p. 51 / 151 43 / 64 RA preambles when the updated value of the first counter is less than or equal to the first limit and the updated value of the second counter is less than the sum of the second limit plus 1. When the updated value of the first counter is greater than the first limit or the updated value of the second counter is equal to the sum of the second limit plus 1, the transmission of the X2 second RA preambles will be discarded.

[00214] As a way of implementing this, transmit the X2-second RA preambles when the updated value of the first counter is less than the first limit and the updated value of the second counter is less than the sum of the second limit plus 1. When the updated value of the first counter is equal to or greater than the first limit or the updated value of the second counter is equal to the sum of the second limit plus 1, the transmission of the X2-second RA preambles will be discarded.

[00215] In some embodiments, when the updated value of the second counter is greater than the second threshold, the first node needs to notify the upper layers so that the upper layers can determine whether the first RA procedure was successful.

[00216] As a way of realizing this, an RA problem is indicated for the upper layers when the updated value of the second counter is equal to the sum of the second limit plus 1.

[00217] As a form of realization, an RA problem is indicated for the upper layers when the updated value of the first counter is greater than the first limit or the updated value of the second counter is equal to the sum of the second limit plus 1.

[00218] As a form of embodiment, an RA problem is indicated for the upper layers when the updated value of the first counter is equal to or greater than the first limit or the updated value of the second counter is equal to the sum of the second limit plus 1. Petition 870250075828, dated 08 / 27 / 2025, page 52 / 151 44 / 64

[00219] As a way of implementing this, if the value of the second counter (e.g., the preamble transmission counter) exceeds the maximum number of transmissions, or if the value of the first counter (e.g., the PRACH transmission counter) exceeds the maximum total number of PRACH transmissions or the maximum total number of ROs, an RA problem is indicated for the upper layers (i.e., multiple PRACH transmissions for retransmissions are dropped). If the value of the second counter (e.g., the preamble transmission counter) does not exceed the maximum number of transmissions and the value of 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, multiple PRACH transmissions for retransmission are performed.

[00220] In embodiments of the method described above, regardless of the number of PRACH transmissions or multiple PRACH transmissions, the first node can control the maximum number of transmissions and the total number of PRACH transmissions or the total number of occupied ROs, which is beneficial for balancing the resource consumption of multiple PRACH retransmissions and the validity of the RA.

[00221] To facilitate understanding, a scheme in which the total number of PRACH transmissions of all multiple PRACH transmissions and the maximum number of times all multiple PRACH transmissions are made in multiple PRACH attempts are collectively configured to determine whether multiple PRACH retransmissions should be performed is illustrated below in conjunction with Figure 4. Figure 4 is a flowchart illustrating another possible implementation of the method of performing the present disclosure by the first node.

[00222] Referring to Figure 4, in (S402), a first RA procedure is initiated. Petition 870250075828, dated 08 / 27 / 2025, page 53 / 151 45 / 64

[00223] In (S404), the value of a preamble transmission counter is set to 1. The preamble transmission counter is a second counter.

[00224] In (S406), the value of a PRACH transmission counter is defined as the number of PRACH transmissions in multiple PRACH transmissions for the first time. The PRACH transmission counter is a first counter.

[00225] In (S408), an AR feature selection process is executed.

[00226] In (S410), multiple preambles are transmitted in a plurality of ROs in a ROG, respectively. The preambles transmitted at different times are either different or the same.

[00227] In (S412), whether the RAR was successfully received during the RAR time window is determined. If the RAR is successfully received, the method proceeds to the operations in (S422). If the RAR is not successfully received during the RAR time window, the method proceeds to the operations in (S414).

[00228] In (S414), the PRACH transmission counter value is updated. The updated PRACH transmission counter value is the sum of the number of PRACH transmissions in multiple PRACH transmissions for retransmission and an original PRACH transmission counter value. The number of PRACH transmissions in multiple PRACH transmissions for retransmission may be different from or equal to the number of PRACH transmissions in multiple PRACH transmissions last time.

[00229] In (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, the method proceeds to the Petition 870250075828, dated 08 / 27 / 2025, page 54 / 151 46 / 64 operations in (S424). Otherwise, the method proceeds to the operations in (S418).

[00230] In (S418), the value of the preamble transmission counter is updated. The updated value of the preamble transmission counter is the sum of the original value of the preamble transmission counter plus 1.

[00231] In (S420), it is determined whether the updated value of the preamble transmission counter is greater than the maximum number of transmissions. If so, the method proceeds to the operations in (S424). Otherwise, the method proceeds to the operations from (S408) to (S412).

[00232] In (S422), if the RAR is successfully received within the RAR time window, the RA procedure will be considered successfully completed, then the first RA procedure terminates.

[00233] In (S424), if the RAR is not successfully received within the RAR time window, and the value of the PRACH transmission counter exceeds the maximum total number of PRACH transmissions or the value of the preamble transmission counter exceeds the maximum number of transmissions, the multiple PRACH transmissions for retransmission are abandoned. In this case, an RA problem is indicated to the upper layers, the RA procedure is considered to have completed unsuccessfully, and the first RA procedure is terminated.

[00234] With the method implementation methods described above, the total resources occupied by multiple PRACH transmissions / retransmissions can be controlled, thus avoiding invalid repeated transmissions, avoiding the consumption of a large amount of resources and avoiding the aggravation of preamble collisions.

[00235] The embodiments of the method of the present disclosure are described in detail above with reference to Figures 1 to 4, and the forms Petition 870250075828, dated 08 / 27 / 2025, page 55 / 151 47 / 64 embodiments of the device in this disclosure are described in detail below with reference to Figures 5 to 8. It should be understood that the description of the embodiments of the method and the description of the embodiments of the device correspond to each other. Therefore, for the part of the embodiments of the device not described in detail, reference may be made to the embodiments of the method described above.

[00236] Figure 5 is a schematic structural diagram of a first node for wireless communication, according to one embodiment of the present disclosure. As shown in Figure 5, the first node (500) includes a first transmitter (510), a first receiver (520) and a first counter (530).

[00237] The first transmitter (510) is configured to transmit X1 first RA preambles, where X1 is a positive integer greater than 1.

[00238] The first receiver (520) is configured to monitor / receive a control signal for a first RAR during a first time window, where the first RAR corresponds to the first X1 RA preambles.

[00239] The first counter (530) is configured to increment, in response to the unsuccessful reception of the first RAR and the expiration of the first time window, a current value of the first counter (530) in X2 to obtain an updated value of the first counter (530), where X2 is a positive integer greater than or equal to X1.

[00240] The magnitude relationship between the updated value of the first counter (530) and the first limit is configured to determine whether X2 seconds of RA preambles should be transmitted, with the first limit configured by upper layer signaling.

[00241] As a form of achievement, the first transmitter Petition 870250075828, dated 08 / 27 / 2025, page 56 / 151 48 / 64 (510) is further configured to transmit the X2 second RA preambles when the updated value of the first counter (530) is less than or equal to the first limit, and to discard the transmission of the X2 second RA preambles when the updated value of the first counter (530) is greater than the first limit.

[00242] As an embodiment, the first node (500) further includes a second counter configured to increment the current value of the second counter by 1 to obtain an updated value of the second counter. A magnitude ratio between the updated value of the second counter and the sum of the second limit plus 1 is configured to determine whether the X2-second RA preambles should be transmitted. Alternatively, if the updated value of the second counter is equal to the sum of the second limit plus 1, it is configured to determine whether the X2-second RA preambles should be transmitted, where the second limit is configured by upper-layer signaling.

[00243] As a way of implementing this, an initial value for the second counter is configured to be set to 1, where the initial value of the second counter is less than or equal to a current value of the second counter.

[00244] As an embodiment, the first transmitter (510) is further configured to transmit the X2 second RA preambles when the updated value of the first counter is less than the first limit and the updated value of the second counter is not equal to the sum of the second limit plus 1. The first transmitter (510) is further configured to interrupt the transmission of the X2 second RA preambles when the updated value of the first counter is greater than the first limit or the updated value of the second counter is equal to the sum of the second limit plus 1.

[00245] As a way of implementing this, the first node (500) also includes a first processor configured to indicate an RA problem to the upper layers when the updated value of the second counter is Petition 870250075828, dated 08 / 27 / 2025, page 57 / 151 49 / 64 equals the sum of the second limit plus 1.

[00246] As a form of implementation, an initial value of the first counter (530) is configured to be set to X0, and X0 is a positive integer greater than 1. The initial value of the first counter (530) is less than or equal to a current value of the first counter (530). The first node (500) further includes a second processor. The second processor is configured to select X0 RACH occasions (ROs), where the X0 ROs are configured for the first RA procedure.

[00247] As a way of implementing this, the first node (500) also includes a third processor. The third processor is configured to indicate an RA problem to the upper layers when the updated value of the first counter (530) is greater than the first limit.

[00248] As a form of implementation, the first node (500) also includes a fourth processor. The fourth processor is configured to interrupt the first time window when the first RAR is successfully received during the first time window.

[00249] As a form of embodiment, the first receiver (520) is further configured to receive first information, where the first information is configured to determine a plurality of candidate values, including X1 and X2.

[00250] As one embodiment, the first transmitter (510) and the first receiver (520) can be a transceiver (730). The first node (500) can also include a processor (710) and a memory (720), as illustrated in particular in Figure 7.

[00251] Figure 6 is a schematic structural diagram of a second node for wireless communication, according to an embodiment of the present disclosure. As shown in Figure 6, the second node (600) includes a second receiver (610) and a fifth processor (620). Petition 870250075828, dated 08 / 27 / 2025, page 58 / 151 50 / 64

[00252] The second receiver (610) is configured to receive the first X1 RA preambles, where X1 is a positive integer greater than 1.

[00253] The fifth processor (620) is configured to determine whether to transmit a control signal for a first RAR during the first time window based on a result of receiving the first X1 RA preambles, where the first RAR corresponds to the first X1 RA preambles.

[00254] When the first time period expires, and the control signaling for the first RAR is not successfully transmitted, the magnitude ratio between the updated value of the first counter of the first node transmitting the first X1 RA preambles and the first threshold is set to determine whether to receive second X2 RA preambles, X2 being a positive integer greater than or equal to X1, the first threshold being set by upper-layer signaling.

[00255] As a form of embodiment, the second receiver (610) is further configured to perform reception of the X2 second RA preambles when the updated value of the first counter is less than the first limit, and to interrupt reception of the X2 second RA preambles when the updated value of the first counter is greater than the first limit.

[00256] As a form of implementation, the magnitude ratio between the updated value of the second counter of the first node and the sum of the second limit plus 1 is configured to determine whether to receive the X2 second RA preambles, or whether the updated value of the second counter of the first node is equal to the sum of the second limit plus 1 is configured to determine whether to receive the X2 second RA preambles, the second limit being configured by upper layer signaling.

[00257] As a form of realization, the second receiver (610) Petition 870250075828, dated 08 / 27 / 2025, page 59 / 151 51 / 64 is also configured to execute the reception of the X2-second RA preambles when the updated value of the first counter is less than the first limit and the updated value of the second counter is not equal to the sum of the second limit plus 1. The second receiver (610) is also configured to interrupt the reception of the X2-second RA preambles when the updated value of the first counter is greater than the first limit or the updated value of the second counter is equal to the sum of the second limit plus 1.

[00258] As a form of implementation, the fifth processor (620) is further configured to stop the first time window when the control signal for the first RAR is successfully transmitted during the first time window.

[00259] As an embodiment, the second node (600) also includes a second transmitter. The second transmitter is configured to transmit the first information. The first information is configured to determine a plurality of candidate values. The plurality of candidate values ​​includes X1 and X2.

[00260] As one embodiment, the second receiver (610) can be a transceiver (730) and the fifth processor (620) can be a processor (710). The second node (600) can also include a memory (720), as shown in Figure 7 in particular.

[00261] Figure 7 is a schematic structural diagram of a communication device according to an embodiment of the present disclosure. The dashed line in Figure 7 indicates that the unit or module is optional. The device (700) can be configured to implement the methods described in the method embodiments above. The device (700) can be a chip, a UE, or a network device.

[00262] The device (700) may include one or more processors (710). The processor (710) may support the device (700) to implement Petition 870250075828, dated 08 / 27 / 2025, page 60 / 151 52 / 64 the methods described above in the embodiments of the method. The processor (710) can be a general-purpose processor or a special-purpose processor. For example, the processor can be a central processing unit (CPU). Alternatively, the processor can also be other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs) or other programmable logic devices, discrete gate logic devices or transistors, discrete hardware components and the like. The general-purpose processor can be a microprocessor or any conventional or similar processor.

[00263] The device (700) may also include one or more memories (720). The memory (720) stores a program that can be executed by the processor (710), so that the processor (710) executes the methods described earlier in the method embodiments. The memory (720) may be independent of the processor (710) or may be integrated into the processor.

[00264] The device (700) may also include a transceiver (730). The processor (710) may communicate with other devices or chips by means of the transceiver (730). For example, the processor (710) may transmit and receive data with other devices or chips by means of the transceiver (730).

[00265] Figure 8 is a schematic diagram of a hardware module of a communication device, according to an embodiment of the present disclosure. Specifically, Figure 8 illustrates a block diagram of a first communication device (850) and a second communication device (810) communicating with each other on an access network.

[00266] The first communication device (850) includes a controller / processor (859), a memory (860), a data source (867), Petition 870250075828, dated 08 / 27 / 2025, page 61 / 151 53 / 64 a transmission processor (868), a reception processor (856), a multi-antenna transmission processor (857), a multi-antenna reception processor (858), a transmitter / receiver (854) and an antenna (852).

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

[00268] In the transmission from the second communication device (810) to the first communication device (850), on the second communication device (810), data packets from the upper layer of the main network or data packets from the upper layer of the data source (877) are provided to the controller / processor (875). The main network and the data source (877) represent all protocol layers above the L2 layer. The controller / processor (875) implements the functionality of the L2 layer. In transmissions from the second communication device (810) to the first communication device (850), the controller / processor (875) is configured to provide header compression, encryption, packet segmentation and reordering, multiplexing between logical and transport channels, and allocation of radio resources to the first communication device (850) based on various priority metrics.The controller / processor (875) is also responsible for retransmitting lost packets and signaling to the first communication device (850). The transmission processor (816) and the multi-antenna transmission processor (871) implement various signal processing functions for the L1 layer (i.e., the physical layer). The transmission processor (816) implements encoding and interleaving to facilitate early error correction in the second communication device (810), as well as signal cluster mapping based on various factors. Petition 870250075828, dated 08 / 27 / 2025, page 62 / 151 54 / 64 modulation schemes (e.g., binary phase-shift keying, quadrature phase-shift keying, multiple phase-shift keying, multiple quadrature amplitude modulation). The multi-antenna transmission processor (871) performs digital spatial precoding, including codebook-based and non-codebook-based precoding, and beamforming processing on the encoded and modulated symbols to generate one or more spatial streams. The transmission processor (816) then maps each spatial stream to subcarriers, multiplexes the modulated symbols with reference signals (e.g., pilots) in the time domain and / or frequency domain, and then performs the inverse fast Fourier transform to generate a physical channel carrying multicarrier symbol streams in the time domain.The multiantenna transmission processor (871) then performs an analog transmission pre-coding / beamforming operation on the multicarrier symbol streams in the time domain. Each transmitter (818) converts a baseband multicarrier symbol stream provided by the multiantenna transmission processor (871) into a radio frequency stream to be provided to different antennas (820).

[00269] In the transmission from the second communication device (810) to the first communication device (850), in the first communication device (850), each receiver (854) receives signals through a respective antenna (852). Each receiver (854) recovers modulated information on the RF carrier and converts the RF stream into a baseband multicarrier symbol stream for delivery to a receiving processor (856). The receiving processor (856) and the multiantenna receiving processor (858) implement various L1 layer signal processing functions. The multiantenna receiving processor (858) performs a received analog pre-coding / beamforming operation on a stream of Petition 870250075828, dated 08 / 27 / 2025, page 63 / 151 55 / 64 baseband multicarrier symbols from a receiver (854). The receiving processor (856) performs Fast Fourier Transform (FFT) to convert the received analog time-domain to frequency-domain multicarrier symbol stream subjected to pre-coding / beamforming operation. In the frequency domain, the data signal and the physical layer reference signal are demultiplexed by the receiving processor (856), where the reference signal is used for channel estimation, and the data signal is recovered from any spatial stream destined for the first communication device (850) after being detected by multiple antennas in the multiantenna receiving processor (858). The symbols in each spatial stream are demodulated and recovered in the receiving processor (856) to generate a smooth decision.The soft decision is then decoded and deinterleaved by the receiving processor (856) to retrieve 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 L2 layer functions. The controller / processor (859) can be associated with a memory (860) that stores program code and data. The memory (860) can be called a computer-readable storage medium.In transmissions from the second communication device (810) to the first communication device (850), the controller / processor (859) provides demultiplexing between transmission and logical channels, packet reassembly, decryption, header decompression, and control signal processing to recover data packets from the upper layer of the second communication device (810). Packets from the upper layers are then provided to all protocol layers above layer L2. Various control signals may also be provided to layer L3 for processing at layer L3. Petition 870250075828, dated 08 / 27 / 2025, page 64 / 151 56 / 64

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

[00271] In the transmission of the first communication device Petition 870250075828, dated 08 / 27 / 2025, page 65 / 151 57 / 64 (850) for the second communication device (810), the function in the second communication device (810) is similar to the reception function in the first communication device (850) described in the transmission from the second communication device (810) to the first communication device (850). Each receiver (818) receives a radio frequency signal through a respective antenna (820), converts the received radio frequency signal into a baseband signal, and provides the baseband signal to a multi-antenna reception processor (872) and the reception processor (870). The reception processor (870) and the multi-antenna reception processor (872) jointly implement the L1 layer function. The controller / processor (875) implements L2 layer functions. The controller / processor (875) can be associated with memory (876) that stores program code and data. The memory (876) can be called a computer-readable storage medium.In transmissions from the first communication device (850) to the second communication device (810), the controller / processor (875) provides demultiplexing between transmission and logical channels, packet reassembly, decryption, header decompression, and control signal processing to recover data packets from the upper layer of the first communication device (850). The data packets from the upper layer of the controller / processor (875) can be provided to the main network or to all protocol layers above layer L2, and various control signals can be provided to the main network or to layer L3 for L3 processing.

[00272] As an embodiment, the first communication device (850) includes at least one processor and at least one memory, with at least one memory containing computer program codes. The at least one memory and the computer program codes are configured for use with the at least one processor, Petition 870250075828, dated 08 / 27 / 2025, page 66 / 151 58 / 64 wherein the first communication device (850) at least: transmits X1 first RA preambles, where X1 is a positive integer greater than 1; monitors a control signal for a first RAR during a first time window, where the first RAR corresponds to the X1 first RA preambles; and increments the current value of the first counter by X2 to obtain an updated value of the first counter when the first time window expires and the first RAR is not successfully received, where X2 is a positive integer greater than or equal to X1. A magnitude relationship between the updated value of the first counter and a first threshold is set to determine whether X2 second RA preambles should be transmitted, where the first threshold is set by the upper layer signaling.

[00273] As an embodiment, the first communication device (850) includes: a memory that stores a computer-readable instruction program that, when executed by at least one processor, generates actions that include: transmitting X1 first RA preambles, where X1 is a positive integer greater than 1; monitoring a control signal for a first RAR during a first time window, with the first RAR corresponding to the X1 first RA preambles; and incrementing the current value of the first counter by X2 to obtain an updated value of the first counter when the first time window expires and reception of the first RAR is unsuccessful, where X2 is a positive integer greater than or equal to X1. A magnitude relationship between the updated value of the first counter and a first threshold is set to determine whether X2 second RA preambles should be transmitted, with the first threshold set by upper-layer signaling.

[00274] As a form of embodiment, the first communication device (850) corresponds to the first node in the present disclosure.

[00275] As a form of implementation, the second device of Petition 870250075828, dated 08 / 27 / 2025, page 67 / 151 59 / 64 communication (810) corresponds to the second node in this disclosure.

[00276] As an embodiment, the first communication device (850) is a UE that can act as a relay node.

[00277] As an embodiment, the first communication device (850) is a V2X-enabled UE that can act as a relay node.

[00278] As an embodiment, the first communication device (850) is a D2D-enabled UE that can act as a relay node.

[00279] As an embodiment, the first communication device (850) is an NCR network control relay.

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

[00281] As a form of embodiment, the first communication device (850) is a relay.

[00282] As a form of embodiment, the second communication device (810) is a base station.

[00283] As an embodiment, the antenna (852), the transmitter (854), the multi-antenna transmission processor (857), the transmission processor (868) and the controller / processor (859) are configured to transmit the first X1 RA preambles of this disclosure.

[00284] 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 configured to perform the reception of the first X1 RA preambles in the present disclosure.

[00285] As an embodiment, the antenna (852), the receiver (854), the multi-antenna reception processor (858), the reception processor Petition 870250075828, dated 08 / 27 / 2025, page 68 / 151 60 / 64 (856) and the controller / processor (859) are configured to monitor a first RAR in the present disclosure within a first time window.

[00286] As an embodiment, the antenna (820), the transmitter (818), the multi-antenna transmission processor (871), the transmission processor (816) and the controller / processor (875) are configured to determine whether to transmit the first RAR of this disclosure within a first time window.

[00287] The embodiments of this disclosure further provide a computer-readable storage medium for storing programs. The computer-readable storage medium can be applied to a terminal or network device, according to an embodiment of this disclosure, and the programs cause a computer to execute the method executed by the terminal or network device in various embodiments of this disclosure.

[00288] The embodiments of this disclosure further provide a computer program product. The computer program product includes programs. The computer program product can be applied to a terminal or network device provided by the embodiments of this disclosure, and the programs cause a computer to execute the method executed by the terminal or network device in various embodiments of this disclosure.

[00289] The embodiments of this disclosure also provide a computer program. The computer program can be applied to a terminal or network device, according to an embodiment of this disclosure, and the computer program causes a computer to execute the method executed by the terminal or network device in various embodiments of this disclosure.

[00290] It should be understood that the terms “system” and “network” in this Petition 870250075828, dated 08 / 27 / 2025, page 69 / 151 61 / 64 disclosure terms may be used interchangeably. Furthermore, the terms used herein are used only to explain specific embodiments of this disclosure and are not intended to be limiting. The terms “first,” “second,” “third,” “fourth,” and similar terms in the descriptive report and claims of this disclosure and in the accompanying drawings are used to distinguish different objects and not to describe a specific order. Additionally, the terms “including / comprising” and “having” and any variations thereof are intended to encompass non-exclusive inclusion.

[00291] In embodiments of the present disclosure, the reference to “indication” may be a direct indication, an indirect indication or an association. For example, A indicates B, which may mean that A indicates B directly, for example, B can be obtained through A. It is also indicated that A indicates B indirectly, for example, A indicates C, and B can be obtained through C. It is also said that A and B.

[00292] In embodiments of the present disclosure, “B corresponding to A” means that B is associated with A from which B can be determined. It should be understood, however, that determining B according to A does not mean determining B only according to A, and B can also be determined according to A and / or other information.

[00293] In the purposes of this disclosure, the term “correspondent” may mean a direct or indirect relationship of correspondence between the two, a relationship of association between the two, indicating and being indicated between the two, configuring and being configured between the two, and the like.

[00294] In embodiments of the present disclosure, “default / preset” or “pre-configured” may be achieved by pre-storing codes, tables or other corresponding means that can be used to indicate relevant information on devices (by Petition 870250075828, dated 08 / 27 / 2025, page 70 / 151 62 / 64 example, including UEs and network devices), and whose specific implementation is not limited here. For example, “default / preset” or “preconfigured” can refer to what is defined in the protocol.

[00295] In embodiments of the present disclosure, the “protocol” may refer to a standard protocol in the field of communication, for example, it may include an LTE protocol, an NR protocol, and related protocols applied in future communication systems, which are not limited to the present disclosure.

[00296] The term “and / or” in the embodiment of this disclosure is merely an association relation describing an associated object, indicating that there may be three relations, for example, A and / or B, which may indicate the existence of three situations: A alone, A and B simultaneously, and B alone. Furthermore, the character “ / ” here generally indicates that the related objects are of an “or” type relation.

[00297] In various embodiments of this disclosure, the sequence number size of the processes mentioned above does not signify the order of execution, and the order of execution of each process shall be determined by its inherent function and logic, and shall not constitute any limitation in the process of implementing the embodiment of this disclosure.

[00298] In the various embodiments presented here, it should be understood that the systems, devices, and methods disclosed may be implemented in other ways. For example, the embodiments of the device described above are only schematic; for instance, the division of the unit is only a logical function division, and in practice, there may be other modes of division, for example, multiple units or components may be combined or integrated into another system, or some functions may be ignored or not executed. On the other hand, coupling or coupling Petition 870250075828, dated 08 / 27 / 2025, page 71 / 151 The direct 63 / 64 communication connection shown or discussed may be an indirect coupling or communication connection via some interfaces, devices or units, and may be electrical, mechanical or otherwise.

[00299] The units described as separate components may or may not be physically separated; the components illustrated as units may or may not be physical units, i.e., they may be in the same location or may be distributed across various network elements. All or part of the units may be selected according to the actual needs to achieve the objective of the technical solutions of the implementations.

[00300] Furthermore, the functional units in various implementations of this disclosure may be integrated into a processing unit, or each unit may be physically present, or two or more units may be integrated into one unit. The integrated unit mentioned above may be implemented in the form of a hardware or software functional unit.

[00301] In the embodiments described above, implementation may be wholly or partially by software, hardware, firmware, or any combination thereof. When implemented in software, it may be wholly or partially implemented in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, the processes or functions described in accordance with the embodiments of this disclosure are generated wholly or partially. The computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions may be stored on computer-readable storage media or transmitted from a medium Petition 870250075828, dated 08 / 27 / 2025, page 72 / 151 64 / 64 computer-readable storage to another computer-readable storage medium. For example, computer instructions can be transmitted from one site, computer, server, or data center to another site, computer, server, or data center via a wired network (e.g., coaxial cable, fiber optic, digital subscriber line (DSL)) or wireless network (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any usable medium that a computer can read or a data storage device, such as a server, data center, or similar, that includes one or more integrations of usable storage media. The usable storage medium can be magnetic media (e.g., floppy disk, hard disk, magnetic tape), optical media (e.g., digital video disc (DVD)), or semiconductor media (e.g., solid-state drive (SSD)), etc.

[00302] The foregoing is only the specific implementation of this disclosure, but the scope of protection of this disclosure is not limited to it. Any person skilled in the art familiar with the technical area who can easily imagine changes or substitutions within the technical scope disclosed in this disclosure shall be covered by the scope of protection of this disclosure. Therefore, the scope of protection of this application shall be subject to the scope of protection of the claims. Petition 870250075828, dated 08 / 27 / 2025, page 73 / 151

Claims

1 / 4 Claims 1. METHOD FOR USE IN NODES FOR WIRELESS COMMUNICATION, characterized by comprising: transmitting (S210), by a first node (500), X1 first random access (RA) preambles, where X1 is a positive integer greater than 1; monitoring (S220) a control signal for a first random access response (RAR) during a first time window, where the first RAR corresponds to the first X1 RA preambles; updating (S230) a current value of a first counter (530) to obtain an updated value of the first counter (530) when the reception of the first RAR is unsuccessful while the first time window expires; and performing at least one of the following: - transmitting X2 second RA preambles in response to the updated value of the first counter (530) being less than a first threshold, where X2 is a positive integer greater than or equal to X1;or - discard the transmission of X2 seconds RA preambles in response to the updated value of the first counter (530) being greater than the first limit.; 2. METHOD, according to claim 1, characterized by comprising: defining an initial value of the first counter (530) for X0, wherein 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); and selecting X0 instances of physical random access channel (PRACH) (ROs); wherein the X0 ROs are configured for a first Petition 870250075828, dated 08 / 27 / 2025, page 74 / 151 2 / 4 RA procedure.

3. METHOD, according to claim 1, characterized by comprising: indicating an RA problem for upper layers in response to the updated value of the first counter (530) being greater than the first limit.

4. METHOD, according to claim 1, characterized by comprising: receiving first information, wherein the first information indicates a plurality of candidate values, the plurality of candidate values ​​including X1 and X2.

5. METHOD FOR USE IN NODES FOR WIRELESS COMMUNICATION, characterized by comprising: performing, by a second node (600), the reception of X1 first random access preambles (RA), where X1 is a positive integer greater than 1; and determining whether to transmit a control signal for a first random access response (RAR) according to a result of the reception of the X1 first RA preambles during a first time window, where the first RAR corresponds to the X1 first RA preambles; and when the control signal for the first RAR is not successfully transmitted while the first time window expires, performing at least one of the following procedures: - performing the reception of X2 second RA preambles in response to an updated value of a first counter (530) being less than a first limit, where X2 is a positive integer greater than or equal to X1;or - discard the receipt of X2 seconds preambles of RA Petition 870250075828, of 08 / 27 / 2025, page 75 / 151 3 / 4 in response to the updated value of the first counter (530) being greater than the first limit.; 6. METHOD, according to claim 5, characterized by comprising: interrupting the first time window, in response to the control signal for the first RAR being successfully transmitted during the first time window.

7. METHOD, according to claim 5, characterized by comprising: transmitting initial information, the initial information being configured to determine a plurality of candidate values, the plurality of candidate values ​​including X1 and X2.

8. FIRST NODE (500) FOR WIRELESS COMMUNICATION, characterized by comprising: at least one processor (710); and one or more memories (720) coupled to at least one processor (710) and storing instructions for execution by at least one processor (720) to cause the first node (500) to perform operations comprising: - transmitting X1 first random access (RA) preambles, where X1 is a positive integer greater than 1; - monitoring a control signal for a first random access response (RAR) during a first time window, where the first RAR corresponds to the X1 first RA preambles; - updating a current value of a first counter (530) to obtain an updated value of the first counter (530) when reception of the first RAR is unsuccessful while the first time window expires; and Petition 870250075828, dated 08 / 27 / 2025, page.76 / 151 4 / 4 - perform at least one of the following: transmit X2 seconds of RA preambles in response to the updated value of the first counter (530) being less than a first limit, where X2 is a positive integer greater than or equal to X1; or discard the transmission of X2 seconds of RA preambles in response to the updated value of the first counter (530) being greater than the first limit.

9. FIRST NODE (500), according to claim 8, characterized in that the operations comprise: setting an initial value of the first counter (530) for X0, wherein 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); and selecting X0 instances of physical random access channel (PRACH) (ROs); wherein the X0 ROs are set up for a first RA procedure.

10. FIRST NODE (500), according to claim 8, characterized in that the operations comprise: indicating an RA problem to higher layers in response to the updated value of the first counter (530) being greater than the first limit.

11. FIRST NODE (500), according to claim 8, characterized by operations comprising: receiving the first information, wherein the first information indicates a plurality of candidate values, the plurality of candidate values ​​including X1 and X2. Petition 870250075828, dated 27 / 08 / 2025, p. 77 / 151

Images