Method for use in node for wireless communication and apparatus

Abstract

The present application provides a method for use in a node for wireless communication and an apparatus, to reduce resource consumption of multiple PRACH retransmissions. The method comprises: sending X1 first random access preambles, wherein X1 is a positive integer; monitoring control signaling of a first random access response within a first time window, wherein the first random access response corresponds to the X1 first random access preambles; incrementing the value of a first counter by X1, and / or incrementing the value of a second counter by 1; and sending X2 second random access preambles, wherein X2 is a positive integer greater than or equal to X1; a first parameter is used for determining X2; or, whether the value of the first counter is greater than a first threshold is used for determining X2, and the first threshold is a positive integer greater than 1; or, whether the value of the second counter is greater than a second threshold is used for determining X2, and the second threshold is a positive integer; or, whether the value of the first counter is greater than a first threshold and whether the value of the second counter is greater than a second threshold are jointly used for determining X2.

Description

Method and apparatus in a node for wireless communication Technical Field

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

[0002] To enhance random access coverage, some communication systems (e.g., new radio (NR) systems) plan to introduce retransmissions based on multiple physical random access channels (PRACHs). They have also discussed increasing the number of PRACH transmissions during retransmissions through a fallback mechanism. However, when multiple nodes increase the number of PRACH transmissions from a smaller number to a larger number based on the fallback mechanism, resource conflicts may arise due to resource allocation for the multiple PRACH retransmissions. This can also lead to conflicts in the fallback mechanism for the multiple PRACH transmissions, severely impacting system access performance.

[0003] Summary of the Invention

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0055] In the embodiment of the present application, after monitoring the first random access responses corresponding to the X1 first random access preambles, the first node determines the number X2 of second random access preambles to be sent based on the first parameter or the first / second counter. Thus, the first node can determine the number of PRACH transmissions for multiple PRACH retransmissions based on the first parameter or the counter, rather than directly increasing the number of PRACH transmissions. This optimizes the fallback mechanism for multiple PRACH transmissions and helps reduce resource consumption for multiple PRACH retransmissions.

[0056] In the embodiment of the present application, when a conflict occurs in PRACH transmissions performed by multiple first nodes using X1 first random access preambles, X2 can be determined based on the first parameter or counter, rather than all being increased to the same number at the next level. Thus, the probability of multiple first nodes selecting the same number of PRACH transmissions when sending second random access preambles is reduced, thereby avoiding or reducing resource conflicts in multiple PRACH transmissions.

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

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

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

[0060] FIG3 is a flow chart of a possible implementation of step S240 in FIG2 .

[0061] FIG4 is a flow chart of another possible implementation of step S240 in FIG2 .

[0062] FIG5 is a schematic diagram of another possible implementation of step S240 in FIG2 .

[0063] FIG6 is a flowchart illustrating another possible implementation of step S240 in FIG2 .

[0064] FIG7 is a flowchart illustrating another possible implementation of step S240 in FIG2 .

[0065] FIG8 is a flowchart illustrating another possible implementation of step S240 in FIG2 .

[0066] FIG9 is a flowchart illustrating another possible implementation of step S240 in FIG2 .

[0067] FIG10 is a flow chart of a possible implementation of the method shown in FIG2 .

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

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

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

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

[0072] Communication system architecture

[0073] FIG1 is a diagram illustrating an exemplary system architecture of a wireless communication system 100 to which embodiments of the present application may be applied. The wireless communication system 100 may include a network device 110 and a user device 120. The network device 110 may be a device that communicates with the user device 120. The network device 110 may provide communication coverage for a specific geographic area and may communicate with the user device 120 located within the coverage area.

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

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

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

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

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

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

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

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

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

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

[0084] Coverage enhancement of PRACH transmission

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

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

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

[0088] In related technologies, coverage enhancement solutions already exist for certain uplink channels. For example, NR Release 17 (Rel-17) has designed coverage enhancement solutions for the physical uplink shared channel (PUSCH), the physical uplink control channel (PUCCH), and message 3 (Msg3) in the random access procedure.

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

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

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

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

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

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

[0095] The fallback mechanism for multiple PRACH transmissions refers to the process of falling back from a multiple PRACH transmission containing a smaller number of PRACH transmissions to a multiple PRACH transmission containing a larger number of PRACH transmissions when performing retransmissions of multiple PRACH transmissions. For example, the fallback mechanism involves falling back from a multiple PRACH transmission containing two PRACH transmissions to a multiple PRACH transmission containing four PRACH transmissions. Another example involves falling back from a multiple PRACH transmission containing four PRACH transmissions to a multiple PRACH transmission containing eight PRACH transmissions. Another example involves falling back from a multiple PRACH transmission containing two PRACH transmissions to a multiple PRACH transmission containing eight PRACH transmissions.

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

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

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

[0099] To address the above issues, embodiments of the present application provide a method and apparatus for use in a node of wireless communication. This method optimizes the fallback mechanism for multiple PRACH transmissions to minimize resource conflicts during multiple PRACH retransmissions. Furthermore, by optimizing resource allocation, the method improves multiple PRACH transmission performance gain and coverage while reducing random access delay and increasing the utilization efficiency of random access resources.

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

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

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

[0103] It should be noted that the beam mentioned in the embodiment of the present application may include or be replaced by at least one of the following: beam, physical beam, logical beam, spatial filter, spatial domain filter, spatial domain transmission filter, spatial domain reception filter, antenna port.

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

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

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

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

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

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

[0110] The method shown in FIG2 includes steps S210 to S240 , which are described below.

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

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

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

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

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

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

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

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

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

[0120] As an implementation, X1 is equal to 2.

[0121] As an implementation, X1 is equal to 4.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0143] The first time window may be a time window for monitoring corresponding random access responses (RARs) after the first node sends X1 first random access preambles.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0161] Incrementing the second counter by 1 is equivalent to incrementing the first counter based on the number of multiple PRACH transmissions sent. The number of multiple PRACH transmissions sent is related to the number of random access channel attempts made by the first node.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0181] In some embodiments, after the first node sends X2 second random access preambles, it may monitor for a second random access response within a second time window. This will be exemplified below with reference to the flowchart shown in FIG4 .

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0211] In some embodiments, the first node may obtain the first parameter in various ways. For example, the first parameter may be configured via top-level signaling. In another example, control signaling in a first random access response sent by the second node may be used to indicate the first parameter. In another example, control signaling in a third random access response sent by the second node may be used to indicate the first parameter. In another example, the third random access response sent by the second node may be used to indicate the first parameter.

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

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

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

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

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

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

[0218] For ease of understanding, a method for determining X2 according to the first parameter is exemplarily described below with reference to Figure 3. Figure 3 shows a possible implementation of step S240 in Figure 2 .

[0219] 3 , in step S310 , the first node determines a first parameter according to control signaling of the first random access response or the third random access response or control signaling of the third random access response.

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

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

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

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

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

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

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

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

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

[0229] As an embodiment, the plurality of candidate integers are configurable.

[0230] As an embodiment, the plurality of candidate integers are preconfigured.

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

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

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

[0234] For ease of understanding, another method for determining X2 according to the first parameter is exemplarily described below with reference to Figure 4. Figure 4 shows another possible implementation of step S240 in Figure 2 .

[0235] 4 , in step S410 , the first node randomly selects a first parameter from a plurality of candidate integers of X2.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0251] For ease of understanding, a method for determining X2 is exemplarily described below with reference to the transmission order of multiple preamble groups in the complex PRACH retransmission shown in Figure 5. Figure 5 is a schematic diagram of a possible implementation of step S240 in Figure 2 .

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

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

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

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

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

[0257] For ease of understanding, the method for determining X2 based on the first counter and the first threshold is exemplarily described below with reference to Figure 6. Figure 6 shows another possible implementation of step S240 in Figure 2 .

[0258] 6 , in step S610 , the first node determines whether the first counter is greater than a first threshold value. If the first counter is greater than the first threshold value, step S620 is executed; if the first counter is not greater than the first threshold value, step S630 is executed.

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

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

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

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

[0263] For ease of understanding, the method for determining X2 based on the second counter and the second threshold is exemplarily described below with reference to Figure 7. Figure 7 shows another possible implementation of step S240 in Figure 2 .

[0264] 7 , in step S710 , the first node determines whether the second counter is greater than a second threshold value. If the second counter is greater than the second threshold value, step S720 is executed; if the second counter is not greater than the second threshold value, step S730 is executed.

[0265] Steps S720 to S740 are the same as steps S620 to S640 in FIG6 , and are not described again here.

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

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

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

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

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

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

[0272] For ease of understanding, the method for determining X2 based on the first / second counter and the first parameter is exemplarily described below with reference to Figure 8. Figure 8 shows another possible implementation of step S240 in Figure 2 .

[0273] Referring to Figure 8, in step S810, the first node determines whether the first counter is greater than a first threshold or whether the second counter is greater than a second threshold. If the first counter is greater than the first threshold or the second counter is greater than the second threshold, step S820 is executed. If the first counter is not greater than the first threshold and the second counter is not greater than the second threshold, step S830 is executed.

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

[0275] Step S830 and step S840 are consistent with step S630 and step S640 in FIG6 , and are not described again here.

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

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

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

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

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

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

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

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

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

[0285] As an embodiment, the second threshold is not greater than 32.

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

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

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

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

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

[0291] For ease of understanding, the method of determining the first threshold or the second threshold according to the first parameter and then determining X2 according to the threshold and the counter is described below with reference to Figure 9. Figure 9 shows another possible implementation of step S240 in Figure 2 .

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

[0293] In step S920 , the first node determines X2 according to the first counter and / or the second counter, as shown in FIG. 6 or FIG. 7 .

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

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

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

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

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

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

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

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

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

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

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

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

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

[0307] As an embodiment, the multiple second-type thresholds are respectively multiple positive integers.

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

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

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

[0311] Table 1

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

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

[0314] Table 2

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

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

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

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

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

[0320] As can be seen from Figures 2 to 9, in the embodiments of the present application, the first node can determine the number of transmissions when repeatedly sending multiple PRACH transmissions using a first parameter or a first / second counter. It should be understood that the various methods of Figures 3 to 9 can be used in combination without conflict. When multiple first nodes adopt any one or more of the above methods, different first nodes can adjust to different numbers of PRACH transmissions when repeatedly sending multiple PRACH transmissions, thereby using separate PRACH resources to avoid or reduce re-conflicts of multiple PRACH transmissions.

[0321] The above text introduces various methods for determining X2 in conjunction with Figures 2 to 9. For ease of understanding, a possible implementation of the embodiment of the present application is described below in conjunction with the schematic diagram of the interaction between the first node and the second node shown in Figure 10.

[0322] Referring to FIG. 10 , in step S1010 , the first node sends X1 first random access preambles to the second node.

[0323] In step S1020 , the second node receives X1 first random access preambles.

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

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

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

[0327] In step S1060 , the second node receives X2 second random access preambles.

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

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

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

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

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

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

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

[0335] The method embodiment of the present application is described in detail above in conjunction with Figures 1 to 10 . The device embodiment of the present application is described in detail below in conjunction with Figures 11 to 14 . It should be understood that the description of the method embodiment corresponds to the description of the device embodiment. Therefore, for parts not described in detail, reference can be made to the above method embodiment.

[0336] FIG11 is a diagram of a first node for wireless communication provided by an embodiment of the present application. As shown in FIG11 , the first node 1100 includes a first transmitter 1110 , a first receiver 1120 , a first processor 1130 , and a second transmitter 1140 .

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0352] FIG12 is a diagram of a second node for wireless communication provided by an embodiment of the present application. As shown in FIG12 , the second node 1200 includes a second receiver 1210 , a second processor 1220 , and a third receiver 1230 .

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0371] Figure 14 is a block diagram of a hardware module of a communication device provided in an embodiment of the present application. Specifically, Figure 14 shows a block diagram of a first communication device 1450 and a second communication device 1410 communicating with each other in an access network.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Claims

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

2. The method according to claim 1, characterized in that include: monitoring control signaling of a second random access response within a second time window; The second random access response corresponds to the X2 second random access preambles.

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

4. The method according to any one of claims 1 to 3, characterized in that The control signaling of the first random access response or the control signaling of the third random access response or the third random access response is used to indicate the first parameter.

5. The method according to any one of claims 1 to 3, characterized in that: The X2 is one of a plurality of candidate integers, any integer among the plurality of candidate integers is not less than the X1; the X2 is equal to the first parameter, the first parameter is randomly selected from the plurality of candidate integers, and the plurality of candidate integers are configured by higher layer signaling.

6. The method according to any one of claims 1 to 5, characterized in that The X2 is one of a plurality of candidate integers, any integer of the plurality of candidate integers is not less than the X1; the first parameter is used to determine the X2 including the X2 being equal to the first parameter, or the first parameter being the index of the X2 in the plurality of candidate integers.

7. The method according to any one of claims 1 to 5, characterized in that When the first counter is greater than the first threshold, X2 is a multiple of X1; when the first counter is not greater than the first threshold, X2 is equal to X1.

8. The method according to any one of claims 1 to 5, characterized in that When the second counter is greater than the second threshold, X2 is a multiple of X1; when the second counter is not greater than the second threshold, X2 is equal to X1.

9. The method according to any one of claims 1 to 6, characterized in that: When the first counter is greater than the first threshold or the second counter is greater than the second threshold, the first parameter is used to determine the X2; when the first counter is not greater than the first threshold or the second counter is not greater than the second threshold, the X2 is equal to the X1.

10. The method according to any one of claims 1 to 9, characterized in that The first threshold is configured by higher-layer signaling, or the second threshold is configured by higher-layer signaling, or both the first threshold and the second threshold are configured by higher-layer signaling.

11. The method according to any one of claims 1 to 9, characterized in that The first parameter is used to determine the first threshold, or the second threshold, or the first threshold and the second threshold.

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

13. The method according to claim 12, characterized in that include: Determining whether to send control signaling of a second random access response within a second time window; The second random access response corresponds to the X2 second random access preambles.

14. The method according to claim 12 or 13, characterized in that include: A third random access response is sent, where the third random access response includes at least one random access preamble identifier, and any random access preamble identifier of the at least one random access preamble identifier included in the third random access response does not match a preamble index corresponding to the X1 first random access preambles.

15. The method according to any one of claims 12 to 14, characterized in that: The control signaling of the first random access response or the control signaling of the third random access response or the third random access response is used to indicate the first parameter.

16. The method according to any one of claims 12 to 14, characterized in that: The X2 is one of a plurality of candidate integers, any integer among the plurality of candidate integers is not less than the X1; the X2 is equal to the first parameter, the first parameter is randomly selected from the plurality of candidate integers, and the plurality of candidate integers are configured by higher layer signaling.

17. The method according to any one of claims 12 to 16, characterized in that: The X2 is one of a plurality of candidate integers, any integer of the plurality of candidate integers is not less than the X1; the first parameter is used to determine the X2 including the X2 being equal to the first parameter, or the first parameter being the index of the X2 in the plurality of candidate integers.

18. The method according to any one of claims 12 to 16, characterized in that: When the first counter is greater than the first threshold, X2 is a multiple of X1; when the first counter is not greater than the first threshold, X2 is equal to X1.

19. The method according to any one of claims 12 to 17, characterized in that: When the second counter is greater than the second threshold, X2 is a multiple of X1; when the second counter is not greater than the second threshold, X2 is equal to X1.

20. The method according to any one of claims 12 to 17, characterized in that When the first counter is greater than the first threshold or the second counter is greater than the second threshold, the first parameter is used to determine the X2; when the first counter is not greater than the first threshold or the second counter is not greater than the second threshold, the X2 is equal to the X1.

21. The method according to any one of claims 12 to 20, characterized in that The first threshold is configured by higher-layer signaling, or the second threshold is configured by higher-layer signaling, or both the first threshold and the second threshold are configured by higher-layer signaling.

22. The method according to any one of claims 12 to 20, characterized in that The first parameter is used to determine the first threshold, or the second threshold, or the first threshold and the second threshold.

23. A first node for wireless communication, characterized in that: include: A first transmitter, configured to send X1 first random access preambles, where X1 is a positive integer; a first receiver, configured to monitor control signaling of a first random access response within a first time window, the first random access response corresponding to the X1 first random access preambles; A first processor, configured to increment a first counter by X1, and / or increment a second counter by 1; A second transmitter, configured to send X2 second random access preambles, where X2 is a positive integer greater than or equal to X1; Among them, the first parameter is used to determine the X2; or, whether the first counter is greater than a first threshold is used to determine the X2, and the first threshold is a positive integer greater than 1; or, whether the second counter is greater than a second threshold is used to determine the X2, and the second threshold is a positive integer; or, whether the first counter is greater than the first threshold and whether the second counter is greater than the second threshold are jointly used to determine the X2.

24. The first node according to claim 23, characterized in that include: The first receiver is further configured to monitor control signaling of a second random access response within a second time window; The second random access response corresponds to the X2 second random access preambles.

25. The first node according to claim 23 or 24, characterized in that: include: The first receiver is further used to receive a third random access response, the third random access response including at least one random access preamble identifier, and any random access preamble identifier of the at least one random access preamble identifier included in the third random access response does not match the preamble index corresponding to the X1 first random access preambles.

26. The first node according to any one of claims 23-25, characterized in that: The control signaling of the first random access response or the control signaling of the third random access response or the third random access response is used to indicate the first parameter.

27. The first node according to any one of claims 23-25, characterized in that: The X2 is one of a plurality of candidate integers, any integer among the plurality of candidate integers is not less than the X1; the X2 is equal to the first parameter, the first parameter is randomly selected from the plurality of candidate integers, and the plurality of candidate integers are configured by higher layer signaling.

28. The first node according to any one of claims 23-27, characterized in that: The X2 is one of a plurality of candidate integers, any integer of the plurality of candidate integers is not less than the X1; the first parameter is used to determine the X2 including the X2 being equal to the first parameter, or the first parameter being the index of the X2 in the plurality of candidate integers.

29. The first node according to any one of claims 23-27, characterized in that: When the first counter is greater than the first threshold, X2 is a multiple of X1; when the first counter is not greater than the first threshold, X2 is equal to X1.

30. The first node according to any one of claims 23-27, characterized in that: When the second counter is greater than the second threshold, X2 is a multiple of X1; when the second counter is not greater than the second threshold, X2 is equal to X1.

31. The first node according to any one of claims 23-28, characterized in that: When the first counter is greater than the first threshold or the second counter is greater than the second threshold, the first parameter is used to determine the X2; when the first counter is not greater than the first threshold or the second counter is not greater than the second threshold, the X2 is equal to the X1.

32. The first node according to any one of claims 23 to 31, characterized in that: The first threshold is configured by higher-layer signaling, or the second threshold is configured by higher-layer signaling, or both the first threshold and the second threshold are configured by higher-layer signaling.

33. The first node according to any one of claims 23-31, characterized in that: The first parameter is used to determine the first threshold, or the second threshold, or the first threshold and the second threshold.

34. A second node for wireless communication, characterized in that: include: A second receiver, configured to receive X1 first random access preambles, where X1 is a positive integer; a second processor, configured to determine, within a first time window, whether to send control signaling of a first random access response, where the first random access response corresponds to the X1 first random access preambles; a third receiver, configured to receive X2 second random access preambles, where X2 is a positive integer greater than or equal to X1; Among them, the first parameter is used to determine the X2; or, whether the first counter of the first node that sends the X1 first random access preambles is greater than a first threshold is used to determine the X2, and the first threshold is a positive integer greater than 1; or, whether the second counter of the first node that sends the X1 first random access preambles is greater than a second threshold is used to determine the X2, and the second threshold is a positive integer; or, whether the first counter of the first node that sends the X1 first random access preambles is greater than the first threshold and whether the second counter of the first node is greater than the second threshold are jointly used to determine the X2.

35. The second node according to claim 34, characterized in that: include: The second processor is further configured to determine whether to send control signaling of a second random access response within a second time window; The second random access response corresponds to the X2 second random access preambles.

36. The second node according to claim 34 or 35, characterized in that: The second node also includes: A third transmitter is used to send a third random access response, where the third random access response includes at least one random access preamble identifier, and any random access preamble identifier of the at least one random access preamble identifier included in the third random access response does not match the preamble index corresponding to the X1 first random access preambles.

37. The second node according to any one of claims 34-36, characterized in that: The control signaling of the first random access response or the control signaling of the third random access response or the third random access response is used to indicate the first parameter.

38. The second node according to any one of claims 34-36, characterized in that: The X2 is one of a plurality of candidate integers, any integer among the plurality of candidate integers is not less than the X1; the X2 is equal to the first parameter, the first parameter is randomly selected from the plurality of candidate integers, and the plurality of candidate integers are configured by higher layer signaling.

39. The second node according to any one of claims 34-38, characterized in that: The X2 is one of a plurality of candidate integers, any integer of the plurality of candidate integers is not less than the X1; the first parameter is used to determine the X2 including the X2 being equal to the first parameter, or the first parameter being the index of the X2 in the plurality of candidate integers.

40. The second node according to any one of claims 34-38, characterized in that: When the first counter is greater than the first threshold, X2 is a multiple of X1; when the first counter is not greater than the first threshold, X2 is equal to X1.

41. The second node according to any one of claims 34-38, characterized in that: When the second counter is greater than the second threshold, X2 is a multiple of X1; when the second counter is not greater than the second threshold, X2 is equal to X1.

42. The second node according to any one of claims 34-39, characterized in that: When the first counter is greater than the first threshold or the second counter is greater than the second threshold, the first parameter is used to determine the X2; when the first counter is not greater than the first threshold or the second counter is not greater than the second threshold, the X2 is equal to the X1.

43. The second node according to any one of claims 34-42, characterized in that: The first threshold is configured by higher-layer signaling, or the second threshold is configured by higher-layer signaling, or both the first threshold and the second threshold are configured by higher-layer signaling.

44. The second node according to any one of claims 34-42, characterized in that: The first parameter is used to determine the first threshold, or the second threshold, or the first threshold and the second threshold.

45. A node used for wireless communication, characterized in that: It includes a transceiver, a memory and a processor, wherein the memory is used to store programs, and the processor is used to call the programs in the memory and control the transceiver to receive or send signals so that the node executes the method as described in any one of claims 1-11 or 12-22.

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

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

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

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

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

Images