Communication method and communication device

Abstract

The invention discloses a communication method and a communication device. The communication method and the communication device can be applied to a communication scene supporting a random access process and a multi-node resource reuse scene. The method includes: receiving a first message, the first message including a first random access preamble (preamble); the resource of the downlink transmission does not comprise a downlink resource in a first window or a downlink resource in the first window in a beam direction where the first message is located, and the first window comprises k time units used for sending a second message in a cell to which the first random access preamble belongs, the second message and the first message belong to the same random access process, and k is an integer greater than 0. Since the resource for downlink transmission does not include the downlink resource in the first window or the downlink resource in the first window in the beam direction of the first message, the interference of the downlink transmission on the transmission of the second message can be avoided, thereby improving the success rate of random access.

Description

Technical Field

[0001] The present application relates to the field of communications, and in particular to a communication method and a communication device. Background Art

[0002] Random access is the process of establishing a connection between user equipment (UE) and a cell (or network) and achieving uplink synchronization. After random access is completed, data interoperability can be performed between the base station and the UE. The UE can achieve three basic functions through random access: 1) obtain uplink synchronization with the base station (such as gNB) through timing advance (TA); 2) apply for uplink resources (UL_GRANT): used to send Msg3; 3) assign a unique identifier to the UE: cell radio network temporary identifier (C-RNTI). The purpose of random access is to establish an uplink synchronization relationship between the UE and the cell and request the cell to allocate dedicated resources to the UE so that the UE can transmit services.

[0003] At present, the existing technical solutions have the problem of low random access success rate. Therefore, it is necessary to study a technical solution to improve the random access success rate. Summary of the invention

[0004] The embodiments of the present application disclose a communication method and a communication device, in order to improve the success rate of random access.

[0005] In a first aspect, an embodiment of the present application provides a communication method, the method comprising: receiving a first message, the first message comprising a first random access preamble; performing downlink transmission, the downlink transmission resources do not include downlink resources within a first window or downlink resources within the first window in the beam direction where the first message is located, the first window comprising k time units used by the cell to which the first random access preamble belongs to send a second message, the second message and the first message belong to the same random access process, and k is an integer greater than 0.

[0006] The resources for the downlink transmission do not include the downlink resources in the first window or the downlink resources in the first window in the beam direction where the first message is located. It can be replaced by: the resources for the downlink transmission do not include all beam directions in the first window or the downlink resources in the beam direction where the first message is located. Downlink transmission is performed, and the resources for the downlink transmission do not include the downlink resources in the first window or the downlink resources in the beam direction where the first message is located in the first window. It can be replaced by: no downlink transmission is performed in the first window or no downlink transmission is performed in the beam direction where the first message is located in the first window. Optionally, the first window is used for monitoring the physical downlink control channel (PDCCH) corresponding to the second message. For example, the terminal device sending the first message monitors the PDCCH corresponding to the second message in the first window, and receives the second message. In this application, the time unit can be a time slot, a subframe, or other time length (for example, a certain time length defined by a future communication standard), which is not limited in this application. The subframe can be 1ms, and the time slot can be 1ms, 0.5ms, 0.25ms, 0.125ms, 0.0625, etc. The subframes and time slots in the present application may conform to the definitions in one or more existing communication standards, and may also change with the subsequent evolution of the communication standards.

[0007] In an embodiment of the present application, the first window includes k time units used by the cell to which the first random access preamble belongs to send the second message, and the resources for downlink transmission do not include downlink resources within the first window or downlink resources within the first window in the beam direction where the first message is located. This can avoid interference of the downlink transmission with the transmission of the second message, thereby improving the success rate of random access.

[0008] In a possible implementation manner, the method is applied to an entity corresponding to a first cell, and the first random access preamble does not belong to a random access preamble of the first cell.

[0009] In this implementation, the first random access preamble does not belong to the random access preamble of the first cell, indicating that the downlink transmission of the entity corresponding to the first cell within the first window may interfere with the transmission of the second message. The resources for downlink transmission by the entity corresponding to the first cell do not include the downlink resources within the first window or the downlink resources within the first window in the beam direction where the first message is located, which can avoid interference with the transmission of the second message.

[0010] In a possible implementation manner, the method further includes: using a logical root sequence other than the first cell (ie, not the current cell) to detect the received first message.

[0011] In this implementation, by detecting the received message (or signal) using the logical root sequence of a non-cell, it can be known that a random access preamble belonging to other cells is received, thereby avoiding interference with the random access process of other cells.

[0012] In a possible implementation manner, the time domain position of the first window and the time domain position of the first message satisfy a predefined relationship.

[0013] In this implementation, the time domain position of the first window and the time domain position of the first message satisfy a predefined relationship, so that the first cell obtains the time domain position of the first window based on the predefined relationship and the time domain position of the first message, and then avoids interference with the transmission of the second message by not using the downlink resources in the first window or the downlink resources in the first window in the beam direction where the first message is located during downlink transmission.

[0014] In a possible implementation manner, the method further includes: obtaining the time domain position of the first window based on the predefined relationship and the time domain position of the first message.

[0015] In this implementation, the time domain position of the first window can be obtained without increasing signaling overhead, thereby avoiding interference with the transmission of the second message based on the first window.

[0016] In a possible implementation, the second message is a random access response (RAR) message or a contention resolution message, and the first time unit in the first window is offset by f time units from the time unit where the first random access preamble is located or the time unit where the last symbol of the first random access preamble is located, where f is a predefined integer greater than 0. The first time unit in the first window is offset by f time units from the time unit where the first random access preamble is located or the time unit where the last symbol of the first random access preamble is located, which can be an example of the above-mentioned predefined relationship. In other words, the above-mentioned predefined relationship can include: the first time unit in the first window is offset by f time units from the time unit where the first random access preamble is located or the time unit where the last symbol of the first random access preamble is located. In the present application, the random access preamble can be referred to as Msg1, the random access response message can be referred to as Msg2, and the contention resolution message can be referred to as Msg4; or, the random access preamble can be referred to as MsgA, and the random access response message can be referred to as MsgB.

[0017] In this implementation, the first time unit in the first window is predefined to be offset by f time units from the time unit where the first random access preamble is located or the time unit where the last symbol of the first random access preamble is located. In this way, the first cell can obtain the first time unit in the first window based on the time domain position of the first message and the predefined relationship, and then avoid interference with the transmission of the second message by not using the downlink resources in the first window or the downlink resources in the first window in the beam direction where the first message is located during downlink transmission.

[0018] In a possible implementation, the second message is a contention resolution message, the first time unit among the k time units is offset by h time units from the time unit where the random access response message is located or the time unit where the last symbol of the random access response message is located, the random access response message and the second message belong to the same random access process, and h is a predefined integer greater than 0. The first time unit among the k time units may be the first time unit used to send (or transmit) the second message. The above-mentioned predefined relationship may include: the first time unit among the k time units is offset by h time units from the time unit where the random access response message is located or the time unit where the last symbol of the random access response message is located. In other words, the first time unit among the k time units is offset by h time units from the time unit where the random access response message is located or the time unit where the last symbol of the random access response message is located, which is included in the above-mentioned predefined relationship.

[0019] In this implementation, the first time unit for sending the second message is predefined to be offset by h time units from the time unit where the random access response message is located or the time unit where the last symbol of the random access response message is located; in this way, the first cell can obtain the first time unit for sending the second message based on the time domain position of the random access response message and the predefined relationship, thereby avoiding interference with the transmission of the second message.

[0020] In a possible implementation, the first time unit used by the cell to which the first random access preamble belongs to send the random access response message is offset by g time units from the time unit where the first random access preamble is located or the time unit where the last symbol of the first random access preamble is located, where g is a predefined integer greater than 0. The above-mentioned predefined relationship may also include: the first time unit used by the cell to which the first random access preamble belongs to send the random access response message is offset by g time units from the time unit where the first random access preamble is located or the time unit where the last symbol of the first random access preamble is located. In other words, the first time unit used by the cell to which the first random access preamble belongs to send the random access response message is offset by g time units from the time unit where the first random access preamble is located or the time unit where the last symbol of the first random access preamble is located, which is included in the above-mentioned predefined relationship.

[0021] In this implementation, the first time unit for sending a random access response message by the cell to which the first random access preamble belongs is predefined to be offset by g time units from the time unit where the first random access preamble is located or the time unit where the last symbol of the first random access preamble is located; in this way, the first cell can obtain the first time unit for sending a random access response message by the cell based on the time domain position of the first random access preamble and the predefined relationship, thereby avoiding interference with the transmission of the second message.

[0022] In a possible implementation manner, the first window is a random access response window, and the second message is a random access response message.

[0023] In a possible implementation, the second message is a random access response message, the first window also includes s time units used by the cell to which the first random access preamble belongs to send a contention resolution message, the contention resolution message and the first message belong to the same random access process, and s is an integer greater than 0. Optionally, the first window is also used to monitor the PDCCH corresponding to the contention resolution message. For example, the terminal device that sends the first message also monitors the PDCCH corresponding to the contention resolution message within the first window, and receives the contention resolution message.

[0024] In this implementation, the first window also includes s time units used by the cell to which the first random access preamble belongs to send a contention resolution message. The resources for downlink transmission by the entity corresponding to the first cell do not include downlink resources within the first window or downlink resources within the first window in the beam direction where the first message is located, which can avoid interference caused by downlink transmission by the first cell to the transmission of the second message and the contention resolution message, thereby improving the success rate of random access.

[0025] In a possible implementation, the starting position of the first window is offset by t time units from the time unit where the first random access preamble is located or the time unit where the last symbol of the first random access preamble is located, where t is a predefined integer greater than 0, or the starting position of the first window is the first downlink time unit after the cell to which the first random access preamble belongs sends the first message. The starting position of the first window can be replaced by the first time unit in the first window.

[0026] In this implementation, the starting position of the first window is predefined to be offset by t time units from the time unit where the first random access preamble is located or the time unit where the last symbol of the first random access preamble is located, so that the first cell determines the starting position of the first window based on the time domain position of the first random access preamble and the predefined time offset relationship, thereby avoiding interference with the transmission of the second message.

[0027] In a possible implementation, the method is applied to a communication scenario including a plurality of network devices, and at least two of the plurality of network devices cannot directly exchange information. Exemplarily, each network device in the communication scenario cannot exchange information. The inability to directly exchange information between two network devices may be that the two network devices have no wired connection, and there is no wireless interface or backhaul interface.

[0028] If two network devices cannot directly exchange information, then when there is an overlapping coverage area between the two network devices, the random access process initiated by the two network devices for the UE in the overlapping coverage area cannot be coordinated between cells to avoid interference. In this implementation, the resources for downlink transmission by the entity (a network device) corresponding to the first cell do not include the downlink resources within the first window or the downlink resources within the first window in the beam direction where the first message is located, which can avoid interference with the transmission of the second message, and does not need to interact with the entities corresponding to other cells, solving the problem that the entities corresponding to other cells cannot avoid interference through information exchange.

[0029] In a possible implementation, the method is applied to any of the following multi-node resource reuse scenarios: relay, wireless mesh network, integrated access & backhaul (IAB), ad hoc network, and communication scenarios including mobile IAB and / or mobile base station. The multi-node resource reuse scenario refers to a networking scenario of multi-node resource reuse (or multiplexed resources).

[0030] In this implementation, the entity corresponding to the first cell avoids interference with the transmission of the second message by not using the downlink resources in the first window or the downlink resources in the first window in the beam direction where the first message is located during downlink transmission. The entity corresponding to the first cell does not need to exchange information with entities corresponding to other cells (such as base stations) to achieve interference coordination, which can save signaling overhead.

[0031] In a second aspect, an embodiment of the present application provides another communication method, the method comprising: receiving a first message, the first message comprising a first random access preamble; sending a second message within a first window, the second message and the first message belonging to the same random access process, the time domain position of the first window and the time domain position of the first message satisfy a predefined relationship, and the second message is a contention resolution message. Optionally, the first window is used for monitoring a PDCCH corresponding to the second message.

[0032] In an embodiment of the present application, the time domain position of the first window and the time domain position of the first message satisfy a predefined relationship, so that a network device (such as a base station) that receives the first message can obtain the time domain position of the first window based on the time domain position of the first message and the predefined relationship, and then avoid interference with the transmission of the second message by not using the downlink resources in the first window or the downlink resources in the first window in the beam direction where the first message is located during downlink transmission.

[0033] In a possible implementation manner, the method further includes: sending a random access response message within the first window, where the random access response message and the first message belong to the same random access process.

[0034] In this implementation, a random access response message and a contention resolution message (i.e., the second message) are sent within the first window. After the network device (e.g., a base station) that receives the first message obtains the time domain position of the first window based on the time domain position of the first message and the predefined relationship, it can avoid interfering with the transmission of the random access response message and the contention resolution message by not using the downlink resources within the first window or the downlink resources within the first window in the beam direction where the first message is located during downlink transmission.

[0035] In a third aspect, an embodiment of the present application provides another communication method, the method comprising: sending a first message, the first message comprising a first random access preamble; receiving a second message, the second message and the first message belonging to the same random access process, the second message being sent by the cell to which the first random access preamble belongs within a first window, the time domain position of the first window and the time domain position of the first message satisfy a predefined relationship, and the second message is a contention resolution message. Optionally, the first window is used for monitoring the PDCCH corresponding to the second message.

[0036] In an embodiment of the present application, the time domain position of the first window and the time domain position of the first message satisfy a predefined relationship, so that a network device (such as a base station) that receives the first message can obtain the time domain position of the first window based on the time domain position of the first message and the predefined relationship, and then avoid interference with the transmission of the second message by not using the downlink resources in the first window or the downlink resources in the first window in the beam direction where the first message is located during downlink transmission.

[0037] In a possible implementation manner of the third aspect, the method further includes: receiving a random access response message, where the random access response message is sent by the cell to which the first random access preamble belongs within the first window, and the random access response message and the first message belong to the same random access process.

[0038] In this implementation, a random access response message and a contention resolution message sent by a cell to which a first random access preamble belongs within a first window are received. Since the random access response message and the contention resolution message sent by the cell within the first window, after a network device (e.g., a base station) receiving the first message obtains the time domain position of the first window based on the time domain position of the first message and the predefined relationship, interference with the transmission of the random access response message and the contention resolution message can be avoided by not using downlink resources within the first window or downlink resources within the first window in the beam direction where the first message is located during downlink transmission.

[0039] In a possible implementation manner of the second aspect or the third aspect, the first time unit in the first window is offset by f time units from the time unit where the first random access preamble is located or the time unit where the last symbol of the first random access preamble is located, where f is a predefined integer greater than 0, and k is an integer greater than 0. The predefined relationship may include: the first time unit in the first window is offset by f time units from the time unit where the first random access preamble is located or the time unit where the last symbol of the first random access preamble is located.

[0040] In this implementation, the first time unit in the first window is predefined to be offset by f time units from the time unit where the first random access preamble is located or the time unit where the last symbol of the first random access preamble is located, so that the network device that receives the first message can obtain the first time unit in the first window based on the time domain position of the first message and the predefined relationship, and then avoid interference with the transmission of the second message by not using the downlink resources in the first window or the downlink resources in the first window in the beam direction where the first message is located during downlink transmission.

[0041] In a possible implementation manner of the second aspect or the third aspect, the method is applied to a communication scenario including multiple network devices, and at least two of the multiple network devices cannot directly exchange information.

[0042] In this implementation, the time domain position of the first window and the time domain position of the first message satisfy a predefined relationship, so that the network device that receives the first message obtains the time domain position of the first window based on the time domain position of the first message and the predefined relationship, without the need to interact with network devices corresponding to other cells, thereby solving the problem that entities corresponding to other cells cannot avoid interference through information interaction.

[0043] In a possible implementation manner of the second aspect or the third aspect, the method is applied to any of the following multi-node resource reuse scenarios: relay, wireless mesh network (mesh), IAB, ad hoc network, and communication scenario including mobile IAB and / or mobile base station.

[0044] In this implementation, the time domain position of the first window and the time domain position of the first message satisfy a predefined relationship, so that the network device that receives the first message obtains the time domain position of the first window based on the time domain position of the first message and the predefined relationship, without the need to interact with the network devices corresponding to other cells, thereby saving signaling overhead.

[0045] In a fourth aspect, an embodiment of the present application provides another communication method, the method comprising: receiving a first message, the first message comprising a first random access preamble; sending a random access response message and a contention resolution message within a first window, the first message, the random access response message, and the contention resolution message belonging to the same random access process, and the time domain position of the first window and the time domain position of the first message satisfy a predefined relationship. Sending the random access response message and the contention resolution message within the first window can be understood as: limiting the sending of the random access response message and the contention resolution message within the first window.

[0046] In an embodiment of the present application, the time domain position of the first window and the time domain position of the first message satisfy a predefined relationship, so that the network device (such as a base station) that receives the first message can obtain the time domain position of the first window based on the time domain position of the first message and the predefined relationship, and then avoid interference with the transmission of random access response messages and contention resolution messages by not using the downlink resources in the first window or the downlink resources in the first window in the beam direction where the first message is located during downlink transmission.

[0047] In a fifth aspect, an embodiment of the present application provides another communication method, which includes: sending a first message, the first message including a first random access preamble; receiving a random access response message and a contention resolution message within a first window, the first message, the random access response message, and the contention resolution message belong to the same random access process, and the time domain position of the first window and the time domain position of the first message satisfy a predefined relationship.

[0048] In an embodiment of the present application, the time domain position of the first window and the time domain position of the first message satisfy a predefined relationship, so that the network device (such as a base station) that receives the first message can obtain the time domain position of the first window based on the time domain position of the first message and the predefined relationship, and then avoid interference with the transmission of random access response messages and contention resolution messages by not using the downlink resources in the first window or the downlink resources in the first window in the beam direction where the first message is located during downlink transmission.

[0049] In a possible implementation manner of the fourth aspect or the fifth aspect, the starting position of the first window is offset by w time units from the time unit where the first random access preamble is located or the time unit where the last symbol of the first random access preamble is located, where w is a predefined integer greater than 0, or the starting position of the first window is the first time unit after the cell to which the first random access preamble belongs sends the first message. The predefined relationship may include: the starting position of the first window is spaced by w time units from the time unit where the first random access preamble is located or the time unit where the last symbol of the first random access preamble is located, where w is a predefined integer greater than 0, or the starting position of the first window is the first time unit after the cell to which the first random access preamble belongs sends the first message.

[0050] In this implementation, the network device that receives the first message can obtain the starting position within the first window based on the time domain position of the first message and the predefined relationship.

[0051] In a sixth aspect, an embodiment of the present application provides another communication method, the method comprising: receiving a first message, the first message comprising a first random access preamble; sending a second message, the second message and the first message belonging to the same random access process, the time domain position of the second message and the time domain position of the first message satisfy a predefined relationship.

[0052] In an embodiment of the present application, the time domain position of the second message satisfies a predefined relationship with the time domain position of the first message, so that a network device (such as a base station) that receives the first message can obtain the time domain position of the second message based on the time domain position of the first message and the predefined relationship, thereby avoiding interference with the transmission of the second message.

[0053] In one possible implementation, the second message is a random access response message; the method also includes: sending a contention resolution message, the contention resolution message and the first message belong to the same random access process, the time domain position of the contention resolution message and the time domain position of the first message satisfy a predefined relationship, or the time domain position of the contention resolution message and the time domain position of the second message satisfy a predefined relationship.

[0054] In this implementation, the time domain position of the contention resolution message and the time domain position of the first message satisfy a predefined relationship; the network device (e.g., a base station) that receives the first message can obtain the time domain position of the contention resolution message based on the time domain position of the first message and the predefined relationship, thereby avoiding interference with the transmission of the contention resolution message. The time domain position of the contention resolution message and the time domain position of the second message satisfy a predefined relationship, thereby avoiding interference with the transmission of the contention resolution message (e.g., a base station) that receives the first message can obtain the time domain position of the contention resolution message based on the time domain position of the second message and the predefined relationship.

[0055] In the seventh aspect, an embodiment of the present application provides another communication method, which includes: sending a first message, the first message including a first random access preamble; receiving a second message, the second message and the first message belong to the same random access process, and the time domain position of the second message and the time domain position of the first message satisfy a predefined relationship.

[0056] In an embodiment of the present application, the time domain position of the second message satisfies a predefined relationship with the time domain position of the first message, so that a network device (such as a base station) that receives the first message can obtain the time domain position of the second message based on the time domain position of the first message and the predefined relationship, thereby avoiding interference with the transmission of the second message.

[0057] In one possible implementation, the second message is a random access response message; the method also includes: receiving a contention resolution message, the contention resolution message and the first message belong to the same random access process, the time domain position of the contention resolution message and the time domain position of the first message satisfy a predefined relationship, or the time domain position of the contention resolution message and the time domain position of the second message satisfy a predefined relationship.

[0058] In this implementation, the time domain position of the contention resolution message and the time domain position of the first message satisfy a predefined relationship; the network device (e.g., a base station) that receives the first message can obtain the time domain position of the contention resolution message based on the time domain position of the first message and the predefined relationship, thereby avoiding interference with the transmission of the contention resolution message. The time domain position of the contention resolution message and the time domain position of the second message satisfy a predefined relationship, thereby avoiding interference with the transmission of the contention resolution message (e.g., a base station) that receives the first message can obtain the time domain position of the contention resolution message based on the time domain position of the second message and the predefined relationship.

[0059] In a possible implementation manner of the fourth aspect or the fifth aspect, the time domain position of the second message and the time domain position of the first message satisfy a predefined relationship, including: a first time unit for transmitting the second message and a time unit where the first random access preamble is located or a time unit where the last symbol of the first random access preamble is located are offset by y time units, where y is a predefined integer greater than 0. For example, y is a predefined integer greater than 0.

[0060] In an eighth aspect, an embodiment of the present application provides a communication device, which has the function of implementing the behavior in the method embodiment of the first aspect, the second aspect, the fourth aspect, or the sixth aspect. The communication device can be a network device, or a component of a network device (such as a processor, a chip, or a chip system, etc.), or a logic module or software that can implement all or part of the functions of the network device. The functions of the communication device can be implemented by hardware, or by hardware executing corresponding software, and the hardware or software includes one or more modules or units corresponding to the above functions.

[0061] In one possible implementation, the communication device includes a transceiver module and a processing module, wherein: the transceiver module is used to receive a first message, the first message includes a first random access preamble; the processing module is used to parse the first message; the transceiver module is also used to perform downlink transmission, the downlink transmission resources do not include downlink resources within a first window or downlink resources within the first window in the beam direction where the first message is located, the first window includes k time units used by the cell to which the first random access preamble belongs to send a second message, the second message and the first message belong to the same random access process, and k is an integer greater than 0.

[0062] In a possible implementation manner, the processing module is further configured to detect the received first message using a logical root sequence that is not the first cell (ie, not the current cell).

[0063] In a possible implementation, the time domain position of the first window and the time domain position of the first message satisfy a predefined relationship; the processing module is further used to obtain the time domain position of the first window based on the predefined relationship and the time domain position of the first message.

[0064] In one possible implementation, the communication device includes a transceiver module and a processing module, wherein: the transceiver module is used to receive a first message, the first message includes a first random access preamble; the processing module is used to parse the first message; the transceiver module is also used to send a second message within a first window, the second message and the first message belong to the same random access process, the time domain position of the first window and the time domain position of the first message satisfy a predefined relationship, and the second message is a contention resolution message.

[0065] In a possible implementation manner, the transceiver module is further configured to send a random access response message within the first window, and the random access response message and the first message belong to the same random access process.

[0066] In one possible implementation, the communication device includes a transceiver module and a processing module, wherein: the transceiver module is used to receive a first message, the first message including a first random access preamble; the processing module is used to generate a random access response message and a contention resolution message; the transceiver module is also used to send the random access response message and the contention resolution message within a first window, the first message, the random access response message, and the contention resolution message belong to the same random access process, and the time domain position of the first window and the time domain position of the first message satisfy a predefined relationship.

[0067] In one possible implementation, the communication device includes a transceiver module and a processing module, wherein: the transceiver module is used to receive a first message, the first message includes a first random access preamble; the processing module is used to generate a second message; the transceiver module is also used to send the second message, the second message and the first message belong to the same random access process, and the time domain position of the second message and the time domain position of the first message satisfy a predefined relationship.

[0068] In one possible implementation, the second message is a random access response message; the transceiver module is also used to send a contention resolution message, the contention resolution message and the first message belong to the same random access process, the time domain position of the contention resolution message and the time domain position of the first message satisfy a predefined relationship, or the time domain position of the contention resolution message and the time domain position of the second message satisfy a predefined relationship.

[0069] Possible implementations of the communication device of the eighth aspect may refer to various possible implementations of the first aspect, the second aspect, the fourth aspect, or the sixth aspect.

[0070] For the technical effects brought about by various possible implementation methods of the eighth aspect, reference may be made to the introduction to the technical effects of various possible implementation methods of the first aspect, the second aspect, the fourth aspect, or the sixth aspect.

[0071] In the ninth aspect, an embodiment of the present application provides a communication device, which has the function of implementing the behavior in the method embodiment of the third aspect, the fifth aspect, or the seventh aspect. The communication device may be a terminal device, or a component of a terminal device (such as a processor, a chip, or a chip system, etc.), or a logic module or software that can implement all or part of the functions of the terminal device. The function of the communication device may be implemented by hardware, or may be implemented by hardware executing corresponding software, and the hardware or software includes one or more modules or units corresponding to the above functions. In a possible implementation, the communication device includes a transceiver module and a processing module, wherein: the processing module is used to generate a first message; the transceiver module is used to send the first message, the first message includes a first random access preamble; receive a second message, the second message and the first message belong to the same random access process, the second message is sent by the cell to which the first random access preamble belongs within the first window, the time domain position of the first window and the time domain position of the first message meet a predefined relationship, and the second message is a contention resolution message.

[0072] In a possible implementation manner, the transceiver module is further used to receive a random access response message, where the random access response message is sent by the cell to which the first random access preamble belongs within the first window, and the random access response message and the first message belong to the same random access process.

[0073] In one possible implementation, the communication device includes a transceiver module and a processing module, wherein: the processing module is used to generate a first message; the transceiver module is used to send a first message, the first message includes a first random access preamble; a random access response message and a contention resolution message are received within a first window, the first message, the random access response message, and the contention resolution message belong to the same random access process, and the time domain position of the first window and the time domain position of the first message satisfy a predefined relationship.

[0074] In one possible implementation, the communication device includes a transceiver module and a processing module, wherein: the processing module is used to generate a first message; the transceiver module is used to send the first message, the first message includes a first random access preamble; receive a second message, the second message and the first message belong to the same random access process, and the time domain position of the second message and the time domain position of the first message satisfy a predefined relationship.

[0075] In one possible implementation, the second message is a random access response message; the transceiver module is also used to receive a contention resolution message, the contention resolution message and the first message belong to the same random access process, the time domain position of the contention resolution message and the time domain position of the first message satisfy a predefined relationship, or the time domain position of the contention resolution message and the time domain position of the second message satisfy a predefined relationship.

[0076] Possible implementations of the communication device of the ninth aspect may refer to various possible implementations of the third aspect, the fifth aspect, or the seventh aspect.

[0077] Regarding the technical effects brought about by various possible implementation methods of the ninth aspect, reference may be made to the introduction to the technical effects of various possible implementation methods of the third aspect, the fifth aspect, or the seventh aspect.

[0078] In the tenth aspect, an embodiment of the present application provides another communication device, which includes one or more processors, and the one or more processors are used to process data and / or information so that the method in any one of the first to seventh aspects mentioned above is implemented.

[0079] Optionally, the communication device further includes a memory storing a program or instruction, and when the program or instruction is executed by the processor, the communication device executes the method as shown in any one of the first aspect to the seventh aspect. Exemplarily, the communication device may be a chip, the processor may be a processing circuit in the chip, and the memory may be a random access memory or a cache in the chip.

[0080] In the embodiment of the present application, in the process of executing the above method, the process of sending information (or signal) in the above method can be understood as the process of outputting information based on the instructions of the processor. When outputting information, the processor outputs the information to the transceiver so that it can be transmitted by the transceiver. After the information is output by the processor, it may also be processed in other ways before reaching the transceiver. Similarly, when the processor receives input information, the transceiver receives the information and inputs it into the processor. Furthermore, after the transceiver receives the information, the information may be processed in other ways before being input into the processor.

[0081] For operations such as sending and / or receiving involved by the processor, unless otherwise specified or unless they conflict with the actual function or internal logic in the relevant description, they can be generally understood as instructions output based on the processor.

[0082] During the implementation process, the processor may be a processor specifically used to execute these methods, or may be a processor that executes computer instructions in a memory to execute these methods, such as a general-purpose processor, etc. For example, the processor may also be used to execute a program stored in the memory, and when the program is executed, the communication device executes the method as shown in the first aspect or any possible implementation of the first aspect.

[0083] In a possible implementation, the memory is located outside the communication device. In a possible implementation, the memory is located inside the communication device.

[0084] In a possible implementation, the processor and the memory may also be integrated into one device, that is, the processor and the memory may also be integrated together.

[0085] In a possible implementation, the communication device further includes a transceiver, and the transceiver is used to receive a signal or send a signal.

[0086] In the eleventh aspect, the present application provides another communication device, which includes a processing circuit and an interface circuit, wherein the interface circuit is used to acquire a signal or output a signal; the processing circuit is used to execute the method shown in any one of the first to seventh aspects above.

[0087] In the twelfth aspect, the present application provides a computer-readable storage medium, in which a computer program is stored. The computer program includes program instructions, which, when executed, enable the computer to execute the method shown in any one of the above-mentioned first to seventh aspects.

[0088] In a thirteenth aspect, the present application provides a computer program product, which includes a computer program, and the computer program includes program instructions, which, when executed, enable the computer to execute the method shown in any one of the above-mentioned first to seventh aspects.

[0089] In a fourteenth aspect, the present application provides a chip comprising a communication interface and a processor; the communication interface is used for sending and receiving signals of the chip; the processor is used for executing computer program instructions so that a communication device including the chip executes a method as shown in any one of the above-mentioned first to seventh aspects.

[0090] In the fifteenth aspect, an embodiment of the present application provides a communication system, comprising a communication device for implementing the first aspect or any possible implementation of the first aspect, a communication device for implementing the second aspect or any possible implementation of the second aspect, and a communication device for implementing the third aspect or any possible implementation of the third aspect.

[0091] In a sixteenth aspect, an embodiment of the present application provides a communication system, comprising a communication device for implementing the fourth aspect or any possible implementation of the fourth aspect, and a communication device for implementing the fifth aspect or any possible implementation of the fifth aspect. Optionally, the communication system also includes a communication device for implementing the first aspect or any possible implementation of the first aspect.

[0092] In a seventeenth aspect, an embodiment of the present application provides a communication system, comprising a communication device for implementing the sixth aspect or any possible implementation of the sixth aspect, and a communication device for implementing the seventh aspect or any possible implementation of the seventh aspect. Optionally, the communication system also includes a communication device for implementing the first aspect or any possible implementation of the first aspect. BRIEF DESCRIPTION OF THE DRAWINGS

[0093] In order to more clearly illustrate the technical solutions in the embodiments of the present application or the background technology, the drawings required for use in the embodiments of the present application or the background technology will be described below.

[0094] Figure 1 is a schematic diagram of a contention-based random access process;

[0095] Figure 2 is a schematic diagram of a non-contention based random access process;

[0096] Figure 3 A schematic diagram of a multi-node resource reuse scenario provided in an embodiment of the present application;

[0097] Figure 4A It is a schematic diagram of the architecture of a communication system to which the embodiments of the present application can be applied;

[0098] Figure 4B is a schematic diagram of the architecture of another communication system to which the embodiments of the present application can be applied;

[0099] Figure 4C A possible application framework diagram in a communication system;

[0100] Figure 5 A flow chart of a communication method provided in an embodiment of the present application;

[0101] Fig. 6A A schematic diagram of a time unit for transmitting Msg1, Msg2, and Msg4 provided in an embodiment of the present application;

[0102] Figure 6B A schematic diagram of another time unit for transmitting Msg1, Msg2, and Msg4 provided in an embodiment of the present application;

[0103] Fig. 7A An example of a comparison diagram of a first window determined by a network device #1 and a first window determined by a network device #2 provided in an embodiment of the present application;

[0104] Figure 7B An example of a comparison diagram of a second window determined by a network device #1 and a second window determined by a network device #2 provided in an embodiment of the present application;

[0105] Figure 8 A flow chart of another communication method provided in an embodiment of the present application;

[0106] Fig. 9 A flow chart of another communication method provided in an embodiment of the present application;

[0107] Fig.10 A flow chart of another communication method provided in an embodiment of the present application;

[0108] Fig.11 An example of the time domain position of the first window and the time domain position of Msg1 provided in an embodiment of the present application;

[0109] Fig.12 Another example of the time domain position of the first window and the time domain position of Msg1 provided in the embodiment of the present application;

[0110] Fig.13 A schematic diagram of the structure of a communication device 1300 provided in an embodiment of the present application;

[0111] Fig.14 A schematic diagram of the structure of another device 140 provided in an embodiment of the present application. DETAILED DESCRIPTION

[0112] The terms "first" and "second" in the specification, claims and drawings of the present application are only used to distinguish different objects, rather than to describe a specific order. It is understood that the various digital numbers involved in the embodiments of the present application are only for the convenience of description and are not used to limit the scope of the embodiments of the present application. The size of the sequence number of the above-mentioned processes does not mean the order of execution, and the execution order of each process should be determined by its function and inherent logic. In addition, the terms "including" and "having" and any of their variations are intended to cover non-exclusive inclusions. For example, a process, method, system, product or equipment, etc., comprising a series of steps or units, is not limited to the listed steps or units, but optionally also includes steps or units that are not listed, etc., or optionally also includes other steps or units inherent to these processes, methods, products or equipment, etc.

[0113] The "embodiment" mentioned in this article means that the specific features, structures or characteristics described in conjunction with the embodiment can be included in at least one embodiment of the present application. The appearance of this phrase in various places in the specification does not necessarily refer to the same embodiment, nor is it an independent or alternative embodiment that is mutually exclusive with other embodiments. It can be explicitly and implicitly understood by those skilled in the art that the embodiments described herein can be combined with other embodiments.

[0114] The terms used in the following embodiments of the present application are only for the purpose of describing specific embodiments, and are not intended to be used as limitations to the present application. As used in the specification and the appended claims of the present application, the singular expressions "one", "a kind of", "said", "above", "the" and "this" are intended to also include plural expressions, unless there is a clear contrary indication in its context. It should also be understood that the term "and / or" used in the present application refers to and includes any or all possible combinations of one or more listed items. For example, "A and / or B" can represent: only A exists, only B exists, and A and B exist at the same time, wherein A, B can be singular or plural. The term "multiple" used in the present application refers to two or more. In the textual description of the present application, the character " / " generally indicates that the front and back associated objects are a kind of "or" relationship.

[0115] It can be understood that in each embodiment of the present application, "A corresponds to B" means that there is a corresponding relationship between A and B, and B can be determined according to A. However, it should also be understood that determining (or generating) B according to (or based on) A does not mean that B is determined (or generated) only according to (or based on) A, and B can also be determined (or generated) according to (or based on) A and / or other information.

[0116] It should be understood that in the present application, indication includes direct indication (also called explicit indication) and implicit indication. Wherein, direct indication of information A means including the information A; implicit indication of information A means indicating information A through the correspondence between information A and information B and direct indication of information B. Wherein, the correspondence between information A and information B can be predefined, pre-stored, pre-burned, or pre-configured.

[0117] It should be understood that in the present application, information C is used to determine information D, which includes information D being determined based only on information C, and information D being determined based on information C and other information. In addition, information C is used to determine information D, and it can also be indirectly determined, for example, information D is determined based on information E, and information E is determined based on information C.

[0118] In addition, "network element A sends information A to network element B" in each embodiment of the present application can be understood as the destination end of the information A or the intermediate network element in the transmission path between the destination end and the network element B, which may include directly or indirectly sending information to network element B. "Network element B receives information A from network element A" can be understood as the source end of the information A or the intermediate network element in the transmission path between the source end and the network element A, which may include directly or indirectly receiving information from network element A. The information may be processed as necessary between the source end and the destination end of the information transmission, such as format changes, etc., but the destination end can understand the valid information from the source end. Similar expressions in the present application can be understood similarly and will not be repeated here.

[0119] To facilitate understanding of the solutions of the present application, the following first introduces the terms and technical solutions involved in the embodiments of the present application.

[0120] Random Access

[0121] Random access is the process of establishing a connection between a user equipment (UE) and a cell (or network) and achieving uplink synchronization. It is also a necessary process for establishing a wireless link between a UE and a cell (such as a 4G network or a 5G network). After the UE completes random access, data can be interoperated between the base station and the UE. The UE can achieve the following three basic functions through random access:

[0122] 1) Obtain uplink synchronization with network equipment (such as gNB) through timing advance (TA). Once the uplink is out of sync, that is, the UE fails to obtain uplink synchronization with the network equipment, the UE can only transmit signals in the physical random access channel (PRACH). The downlink synchronization between the UE and the network equipment is achieved through a special synchronization channel. Specifically, the network equipment broadcasts the downlink synchronization signal to each UE through a special synchronization channel, and the network equipment continuously broadcasts the downlink synchronization signal at a certain interval. If the UE uses this broadcast synchronization mechanism in the uplink, it will actually waste energy and cause a lot of interference to other UEs.

[0123] 2) UL_GRANT: includes uplink resources used by the UE to send Msg3. Msg3 refers to the message sent by the UE in the third step of the contention-based random access process.

[0124] 3) Assign a unique identifier to the UE: cell radio network temporary identifier (C-RNTI). The purpose of random access is to establish an uplink synchronization relationship between the UE and the cell and request the cell to allocate dedicated resources to the UE, so as to carry out normal service transmission.

[0125] Some examples of random access usage scenarios are as follows:

[0126] Scenario Example (Case) 1: Initial radio resource control (RRC) connection establishment. When the UE transitions from the RRC idle state (RRC-IDLE) to the RRC connected state (RRC-CONNECTED), the UE initiates a random access, such as an initial access.

[0127] Scenario Example 2: RRC Connection Reestablishment: When the radio link failure (RLF) between the UE and the cell fails and the UE needs to re-establish the RRC connection with the cell, the UE will initiate a random access.

[0128] Scenario Example 3: Cell Handover When the UE performs cell handover, the UE initiates random access in the target cell (the cell to which the UE will be handed over).

[0129] Scenario Example 4: Downlink data arrival. When the UE is in a connected state, the network device (e.g., eNodeB) has downlink data to transmit to the UE, but finds that the UE is in an uplink out-of-sync state. The network device will control the UE to initiate random access, thereby transmitting the corresponding acknowledgement character (ACK) / negative acknowledgement character (NACK) in the uplink.

[0130] Scenario Example 5: Uplink data arrival. When the UE is in a connected state, the UE has uplink data to transmit to the network device, but finds itself in an uplink out-of-sync state or no available physical uplink control channel (PUCCH) resources for scheduling request (SR) transmission (UEs that are already in uplink synchronization are allowed to use random access channels (RACH) to replace the role of SR), then the UE will initiate random access.

[0131] There are two modes of random access procedure: contention based random access procedure (implies inherent conflict risk) and non-contentionbased random access procedure.

[0132] Figure 1 is a schematic diagram of the contention-based random access process. Figure 1 The contention-based random access procedure shown in FIG. 1 may be referred to as a four-step random access procedure. Figure 1 As shown, the contention-based random access process is divided into the following four steps:

[0133] The first step (or step 1): The UE sends a random access preamble on the physical random access channel (PRACH). The base station obtains the random access preamble identifier (RAPID) and the downlink transmission beam (Tx Beam) by detecting the random access preamble, and estimates the transmission delay. The random access preamble can be called Msg1. The principle of the base station detecting the random access preamble is to use the logical root sequence of the cell to calculate the correlation peak of the random access preamble in the detection interval, and send the identifier (preambleID) of the random access preamble to the UE through the RAR. If the preambleID in the RAR received by the UE is consistent with the sent preambleID, it is considered that Msg2 is received successfully; if not, it is considered that Msg2 reception fails, and the UE will re-initiate random access on the next PRACH after the RAR detection window.

[0134] The second step (or step 2): the base station sends a random access response (RAR) (also called Msg2) on the physical downlink shared channel (PDSCH). The RAR carries the TA, RAPID, temporary cell radio network temporary identifier (TC-RNTI) corresponding to the transmission delay estimated in the first step, and the uplink grant (UL Grant) sent by Msg3 in step 3. UL is the abbreviation of uplink. The UE uses the TA to adjust the uplink timing. Msg2 is sent on the downlink transmission beam determined in the first step.

[0135] Step 3 (or step 3): the UE schedules to send Msg3 according to the uplink authorization in the RAR, and Msg3 carries the identification information of the UE.

[0136] Step 4 (or Step 4): The base station sends a contention resolution message (also called Msg4) to the UE on the PDSCH. The fourth step resolves the contention and conflict caused by multiple UEs trying to access the same random access resource and the same random access preamble. Msg4 is sent on the downlink transmission beam determined in the first step.

[0137] Figure 2 is a schematic diagram of a non-contention-based random access process. Figure 1 The non-contention-based random access procedure shown in FIG. 1 may be referred to as a two-step random access procedure. Figure 2 As shown in FIG. 1 , the non-contention-based random access process is divided into the following two steps:

[0138] In step A, the UE sends a random access preamble (also called MsgA) to the first network device.

[0139] In step A, the random access preamble and the content sent through the physical uplink shared channel (PUSCH) ("PUSCH payload") are generally referred to as MsgA. Among them, "PUSCH payload" is generally considered to be the content carried by PUSCH similar to Msg3 of the four-step random access process, that is, "ScheduledTransmission". Here, in MsgA, that is, "PUSCH payload" can carry RRC messages such as RRCSetupRequest, RRCResumeRequest, RRCResumeRequest1, etc.

[0140] Step B: After successfully receiving the random access preamble, the first network device returns a random access response message (also called MsgB) to the UE.

[0141] Step B, the random access response message is generally called MsgB, and generally carries the content of the RAR message in the second step and the contention resolution message in the fourth step of the four-step random access process.

[0142] Non-contention-based random access uses dedicated random access resources and random access preambles, and there is no contention conflict, so the third and fourth steps are not required.

[0143] In a multi-node networking scenario, in order to improve the system spectrum efficiency, nodes usually reuse resources (including frequency resources). Hereinafter, a multi-node resource reuse scenario refers to a networking scenario of multi-node resource reuse (or multiplexing resources). Figure 3 A schematic diagram of a multi-node resource reuse scenario provided in an embodiment of the present application. Figure 3As shown, node 1 and node 2 multiplex resources, that is, the resources used for the downlink transmission of node 1 and the downlink transmission of node 2 are the same. After node 3 in the overlapping coverage area of ​​node 1 and node 2 initiates random access to node 1, Msg2 / Msg4 sent by node 1 to node 3 will be interfered by the downlink transmission of node 2. The interference will cause node 3 to fail to decode Msg2 / Msg4, and then cause the random access failure. Exemplarily, node 3 needs to join the self-organizing network associated with node 1, and node 3 initiates random access to node 1. Exemplarily, node 3 initiates random access to node 1 after RLF occurs. Exemplarily, node 3 initiates random access to node 1 when switching from the cell corresponding to node 2 to the cell corresponding to node 1. The present application does not limit the triggering conditions for node 3 to initiate random access to node 1.

[0144] The node in this application can be a network device (such as a gNB), a terminal device, a node with some or all functions of a network device, or a node with wireless backhaul function and / or wireless access function (such as an IAB node). Figure 3 An example of a multi-node resource reuse scenario is as follows: Node 1, Node 2, and Node 3 all include gNB and customer premise equipment (CPE). Customer premise equipment can also be called user terminal equipment. CPE refers to hardware physically located on the user side, such as servers, workstations, modems, hubs, bridges, switches, routers, mobile terminals (mobile termination, MT) in IAB nodes, etc. In this application, gNB is used as an example of network equipment. When node 3 includes gNB and CPE, node 3 initiating random access to node 1 can be the CPE included in node 3 initiating random access to node 1. See Figure 3 Another example of a multi-node resource reuse scenario is as follows: Node 1 and Node 2 both include gNB and CPE, and Node 3 is a terminal device. Figure 3 Another example of a multi-node resource reuse scenario is as follows: Node 1 and Node 2 are both gNBs, and Node 3 is a terminal device. Figure 3 ,Another example of a multi-node resource reuse scenario is as follows: one of node 1 and node 2 is a gNB, the other of node 1 and node 2 includes a gNB and a CPE, and node 3 is a terminal device.

[0145] In a multi-node resource reuse scenario, when a terminal device initiates a random access process in the overlapping coverage area of ​​multiple nodes (such as base stations), due to the resource reuse between nodes, downlink interference may occur, causing the terminal device to fail to decode Msg2 or Msg4, thereby causing random access failure. Figure 3, Msg2 / Msg4 sent by node 1 to node 3 will be interfered by the downlink transmission of node 2, and the interference will cause node 3 to fail to decode Msg2 / Msg4, which will lead to random access failure. In a multi-node resource reuse scenario, since Msg2 / Msg4 sent by a network device to a terminal device will be interfered by the downlink transmission of other network devices, the existing technical solutions have the problem of low random access success rate. Therefore, it is necessary to study a technical solution suitable for a multi-node resource reuse scenario, so as to improve the random access success rate. The present application provides a technical solution suitable for a multi-node resource reuse scenario, which can improve the random access success rate.

[0146] The technical solution provided by this application is intended to reduce or avoid interference from downlink transmission of other network devices to Msg2 / Msg4 sent by a network device to a terminal device in a multi-node resource reuse scenario. Figure 3 , reduce or avoid the interference of the downlink transmission of node 2 on Msg2 / Msg4 sent by node 1 to node 3. An example of the technical solution provided by the present application is: in the process of node 1 sending a RAR message (Mg2) to node 3, node 2 does not perform downlink transmission (or downlink scheduling) or does not perform downlink transmission in the beam direction corresponding to the RAR message. The beam direction corresponding to the RAR message can be the beam direction of the random access preamble (Msg1) associated with the RAR message, that is, the beam direction of the random access preamble sent by the terminal device. In other words, an example of the technical solution provided by the present application is: refer to Figure 3 , node 1 sends a RAR message to node 3, and the resources for downlink transmission by node 2 do not include: the downlink resources within the time window in which node 1 sends the RAR message (for example, the first window below), or, within the time window in which node 1 sends the RAR message, the downlink resources in the beam direction corresponding to the RAR message.

[0147] Under the above idea, a possible implementation of the technical solution provided by the present application is as follows: predefine the relationship between the time domain position of Msg1 and the time domain position of the first window, or in other words, the time domain position of Msg1 and the time domain position of the first window satisfy the predefined relationship, and the first window includes the time unit for the cell to which the Msg1 belongs to send the Msg2 and / or Msg4 associated with the Msg1; the network device (for example, Figure 3Node 2 in the example obtains the time domain position of the first window based on the time domain position of Msg1; the resources for downlink transmission by the network device do not include the downlink resources in the first window or the downlink resources in the beam direction of the Msg1 in the first window. The first window can be regarded as the time window for the cell to which Msg1 belongs to send Msg2 and / or Msg4. Since the resources for downlink transmission by the network device that receives the Msg1 do not include the downlink resources in the first window or the downlink resources in the beam direction of the Msg1 in the first window, the downlink transmission of the network device will not interfere with the transmission of Msg2 and / or Msg4 associated with the Msg1. In this possible implementation, the network device obtains the time domain position of the first window based on the time domain position of the received Msg1, and does not need to interact with the network device corresponding to the cell to which the Msg1 belongs. That is to say, in the technical solution provided in the present application, network devices do not need to interact with each other to reduce or avoid interference to Msg2 / Msg4, which can save signaling overhead. The technical solution provided by the present application is applicable to multi-node resource reuse scenarios where network devices cannot directly exchange information. In addition, the technical solution provided by the present application can also be applied to multi-node resource reuse scenarios where network devices can directly exchange information, which can reduce signaling overhead.

[0148] The following introduces a communication system to which the technical solution provided by this application is applicable.

[0149] The technical solution provided in this application can be applied to various communication systems, such as: long term evolution (LTE) system, LTE frequency division duplex (FDD) system, LTE time division duplex (TDD) system, worldwide interoperability for microwave access (WiMAX) communication system, fifth generation (5G) or new radio (NR) system, wireless local area network (WLAN) system, satellite communication system, future communication system, such as sixth generation (6G) mobile communication system, or a fusion system of multiple systems and other communication systems that support random access procedures.

[0150] The technical solution provided in the embodiment of the present application is also applicable to other communication systems involving support for random access procedures. The above communication system applicable to the technical solution provided in the embodiment of the present application is only an example, and the communication system applicable to the power control solution provided in the present application is not limited thereto. It is uniformly described here and will not be repeated below.

[0151] A first device in a communication system may send a signal to a second device or receive a signal from a third device. The signal may include information, signaling, or data, etc. The device may also be replaced by an entity, a network entity, a communication device, a communication module, a node, a communication node, etc., and the network element is used as an example for description in the present disclosure. The first device may be a network device or a terminal device, the second device may be a network device or a terminal device, and the third device may be a network device or a terminal device. For example, the communication system may include at least one terminal device and at least one network device. The network device may send a downlink signal to the terminal device, and / or the terminal device may send an uplink signal to the network device. It is understandable that the terminal device in the present disclosure may be replaced by the first device, and the network device may be replaced by the second device, and the two perform the corresponding communication method in the present disclosure.

[0152] The technical solution provided in the present application can be applied to any of the following scenarios: relay, wireless mesh network, integrated access & backhaul (IAB), mobile IAB, ad hoc network, mobile base station and other scenarios. The networking nodes in the above scenarios include nodes with all or part of the functions of a base station, or nodes with wireless backhaul function and wireless access function. For scenarios such as mobile base stations and mobile IAB, the cells are not fixed and static, there is no wired connection between base stations, and there are no wireless interfaces and backhaul interfaces. The base stations cannot directly exchange information, so the random access process initiated by the base station for the terminal equipment in the overlapping coverage area cannot be coordinated between cells to avoid interference. The technical solution provided in the present application does not require direct information exchange between base stations, so it is suitable for scenarios such as mobile base stations and mobile IAB. For communication scenarios where there is a wired connection or a wireless interface between at least two base stations, in order to reduce the overhead of information exchange between base stations, it is also possible not to transmit information between base stations to achieve interference coordination. The technical solution provided in the present application is applied to communication scenarios where there is a wired connection or a wireless interface between at least two base stations, which can save signaling overhead.

[0153] Figure 4A Schematic diagram of a communication system architecture to which the present application embodiment can be applied. Figure 4A As shown, the communication system includes network device 110, network device 120, terminal device 130 and terminal device 140. The communication system to which the embodiment of the present application can be applied includes one or more terminal devices, with terminal device 130 and terminal device 140 being examples of terminal devices in the communication system. Figure 4AThis is only a schematic diagram, and the embodiment of the present application does not limit the number of network devices and terminal devices included in the communication system. The terminal device 130 can access the network device 110 and communicate with the network device 110. The terminal device 140 can access the network device 120 and communicate with the network device 120. Exemplarily, the terminal device 130 is located in the overlapping coverage area of ​​the network device 110 and the network device 120.

[0154] Figure 4B FIG. 1 is a schematic diagram of another architecture of a communication system to which the present application embodiment can be applied. Figure 4B As shown, the communication system includes a network device 110, a terminal device 130, a terminal device 140 and a plurality of relay nodes ( Figure 4B Only relay nodes #1 to #7 are shown.) The communication system to which the embodiment of the present application can be applied includes one or more terminal devices, with terminal device 130 and terminal device 140 being taken as examples of terminal devices in the communication system. Figure 4B This is only a schematic diagram, and the embodiment of the present application does not limit the number of network devices, terminal devices, and relay nodes included in the communication system. Terminal devices 130 and 140 can access network device 110 through the relay node and communicate with network device 110. Exemplarily, the relay node is an IAB node or an AP, and terminal device 130 can be located in the overlapping coverage area of ​​relay node #1 and relay node #2.

[0155] In the embodiments of the present application, terminal equipment may also be referred to as user equipment (UE), access terminal, subscriber unit, user station, mobile station, mobile station (MS), remote station, remote terminal, mobile device, user terminal, terminal, wireless communication device, user agent or user device.

[0156] The terminal device may be a device that provides a wireless communication function, for example, a handheld device with a wireless connection function, a vehicle-mounted device, etc. At present, some examples of terminal devices are: mobile phones, cellular phones, smart phones, tablet computers, laptop computers, PDAs, mobile internet devices (MID), wearable devices, virtual reality (VR) devices, augmented reality (AR) devices, wireless terminals in industrial control, wireless terminals in self-driving, wireless terminals in remote medical surgery, wireless terminals in smart grids, wireless terminals in transportation safety, wireless terminals in smart cities, wireless terminals in smart homes, cellular phones, cordless phones, session initiation protocol (SIP) phones, wireless local loop (WLL) stations, personal digital assistants (PDAs), and wireless terminals in smart cities. assistant, PDA), handheld devices with wireless communication capabilities, computing devices or other processing devices connected to a wireless modem, wearable devices, terminal devices in a 5G network, or terminal devices in a future evolved public land mobile network (public land mobile network, PLMN), etc., and the embodiments of the present application are not limited to this.

[0157] As an example but not a limitation, in the embodiment of the present application, the terminal device may also be a mobile terminal (MT) in the IAB node. Figure 4B ,The relay node can be an IAB node. When the IAB node faces its parent node, it can be regarded as a terminal device. At this time, the IAB node plays the role of MT.

[0158] As an example but not limitation, in the embodiments of the present application, the terminal device may also be a wearable device. Wearable devices may also be referred to as wearable smart devices, which are a general term for wearable devices that are intelligently designed and developed using wearable technology for daily wear, such as glasses, gloves, watches, clothing, and shoes. A wearable device is a portable device that is worn directly on the body or integrated into the user's clothes or accessories. Wearable devices are not only hardware devices, but also powerful functions achieved through software support, data interaction, and cloud interaction. Broadly speaking, wearable smart devices include full-featured, large-sized, and fully or partially independent of smartphones, such as smart watches or smart glasses, as well as devices that only focus on a certain type of application function and need to be used in conjunction with other devices such as smartphones, such as various types of smart bracelets and smart jewelry for vital sign monitoring.

[0159] In the embodiment of the present application, the device for realizing the function of the terminal device may be a terminal device, or a device capable of supporting the terminal device to realize the function, such as a chip system, which may be installed in the terminal device or used in combination with the terminal device. In the embodiment of the present application, the chip system may be composed of a chip, or may include a chip and other discrete devices. In the embodiment of the present application, only the device for realizing the function of the terminal device is used as an example for explanation, and the scheme of the embodiment of the present application is not limited.

[0160] The network device in the embodiment of the present application may be a device for communicating with a terminal device, and the network device may also be referred to as an access network device or a wireless access network device, such as a base station. The network device in the embodiment of the present application may refer to a wireless access network (RAN) node (or device) that connects a terminal device to a wireless network. The base station can broadly cover various names as follows, or be replaced with the following names, such as: RAN node, NodeB, evolved NodeB (eNB), next generation NodeB (gNB), base station controller (BSC), base transceiver station (BTS), home base station (for example, home evolved NodeB, or home Node B, HNB), baseband unit (BBU), wireless relay node, wireless backhaul node, relay station, transmission point (transmitting and receiving point, TRP), IAB node, transmitting point (transmitting point, TP), primary station, secondary station, multi-standard wireless (motorslide retainer, MSR) node, network controller, access node, wireless node, access point (AP), transmission node, transceiver node, remote radio unit (RRU), active antenna unit (AAU), remote radio head (RRH), central unit (central unit (CU), distributed unit (DU), radio unit (RU), positioning node, one or a group (including multiple antenna panels) of antenna panels of a base station in a 5G system, etc.

[0161] The IAB node integrates two parts: a mobile termination (MT) and a distributed unit (DU). An IAB node may include three parts: an MT, a DU, and a central unit (CU). A centralized unit may be referred to as a central unit or central unit. An IAB node may include a CU and one or more DUs. When an IAB node includes a CU, the IAB node is an IAB donor node, and the CU in the IAB donor node accesses the core network through a next generation application protocol (NG) interface. When an IAB node faces its parent node, it can be regarded as a terminal, in which case the IAB node plays the role of an MT; when an IAB node faces its child node (the child node may be a terminal or the MT of another IAB node), the IAB node can be regarded as a network device. An IAB node can establish a backhaul connection with at least one parent node of the IAB node through the MT part. The DU part of an IAB node can provide access services to the MT part of a terminal or other IAB nodes.

[0162] The base station may be a macro base station, a micro base station, a relay node, a donor node or the like, or a combination thereof. The base station may also refer to a communication module, a modem or a chip used to be arranged in the aforementioned device or apparatus. The base station may also be a mobile switching center and a device that performs the base station function in device to device (D2D), vehicle to everything (V2X), and machine to machine (M2M) communications, a network side device in a 6G network, and a device that performs the base station function in future communication systems. The base station may support networks with the same or different access technologies. Optionally, the RAN node may also be a server, a wearable device, a vehicle or an on-board device, etc. For example, the access network device in the V2X technology may be a road side unit (RSU). The embodiments of the present application do not limit the specific technology and specific device form adopted by the network equipment.

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

[0164] In some deployments, the network device mentioned in the embodiments of the present application may be a device including a CU, or a DU, or a device including a CU and a DU, or a control plane CU node (central unit control plane (central unit-control plane, CU-CP)) and a user plane CU node (central unit user plane (central unit-user plane, CU-UP)) and a DU node. For example, the network device may include a gNB-CU-CP, a gNB-CU-UP, and a gNB-DU.

[0165] In some deployments, multiple RAN nodes collaborate to assist the terminal in achieving wireless access, and different RAN nodes implement part of the functions of the base station. For example, the RAN node can be a CU, DU, CU-CP, CU-UP, or RU. The CU and DU can be set separately, or can also be included in the same network element, such as a BBU. The RU can be included in a radio frequency device, such as an RRU, AAU, or RRH.

[0166] The RAN node may support one or more types of fronthaul interfaces, and different fronthaul interfaces correspond to DUs and RUs with different functions. If the fronthaul interface between the DU and the RU is a common public radio interface (CPRI), the DU is configured to implement one or more baseband functions, and the RU is configured to implement one or more radio frequency functions. If the fronthaul interface between the DU and the RU is another interface, relative to the CPRI, part of the downlink and / or uplink baseband functions, such as, for downlink, one or more of precoding, digital beamforming (BF), or inverse fast Fourier transform (IFFT) / cyclic prefix (CP) are moved from the DU to the RU for implementation, and for uplink, one or more of digital beamforming (BF), or fast Fourier transform (FFT) / cyclic prefix (CP) are moved from the DU to the RU for implementation. In a possible implementation, the interface may be an enhanced common public radio interface (eCPRI). In the eCPRI architecture, the division between DU and RU is different, corresponding to different types (category, Cat) of eCPRI, such as eCPRI Cat A, B, C, D, E, F.

[0167] Taking eCPRI Cat A as an example, for downlink transmission, based on layer mapping, the DU is configured to implement one or more functions before layer mapping (i.e., one or more functions of coding, rate matching, scrambling, modulation, and layer mapping), while other functions after layer mapping (e.g., one or more functions of resource element (RE) mapping, digital beamforming (BF), or inverse fast Fourier transform (IFFT) / adding cyclic prefix (CP)) are moved to the RU for implementation. For uplink transmission, based on de-RE mapping, the DU is configured to implement one or more functions before de-mapping (i.e., one or more functions of decoding, de-rate matching, de-scrambling, demodulation, inverse discrete Fourier transform (IDFT), channel equalization, and de-RE mapping), while other functions after de-mapping (e.g., one or more functions of digital BF or fast Fourier transform (FFT) / removing CP) are moved to the RU for implementation. It can be understood that for the functional description of DU and RU corresponding to various types of eCPRI, reference can be made to the eCPRI protocol and will not be repeated here.

[0168] In one possible design, the processing unit for implementing the baseband function in the BBU is called a baseband high layer (BBH) unit, and the processing unit for implementing the baseband function in the RRU / AAU / RRH is called a baseband low layer (BBL) unit.

[0169] In different systems, CU (or CU-CP and CU-UP), DU or RU may also have different names, but those skilled in the art can understand their meanings. For example, in an open radio access network (ORAN) system, CU may also be called O-CU (open CU), DU may also be called O-DU, CU-CP may also be called O-CU-CP, CU-UP may also be called O-CU-UP, and RU may also be called O-RU. Any unit in the CU (or CU-CP, CU-UP), DU and RU in this application may be implemented by a software module, a hardware module, or a combination of a software module and a hardware module.

[0170] In the embodiments of the present application, the device for realizing the function of the network device may be a network device; or it may be a device capable of supporting the network device to realize the function, such as a chip system, a hardware circuit, a software module, or a hardware circuit plus a software module. The device may be installed in the network device or used in combination with the network device. In the embodiments of the present application, only the device for realizing the function of the network device is a network device as an example for explanation, and the scheme of the embodiments of the present application is not limited.

[0171] The network device and / or terminal device can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; it can also be deployed on the water surface; it can also be deployed on aircraft, balloons and satellites in the air. The scenarios in which the network device and the terminal device are located are not limited in the embodiments of the present application. In addition, the terminal device and the network device can be hardware devices, or they can be software functions running on dedicated hardware, software functions running on general-purpose hardware, such as virtualization functions instantiated on a platform (e.g., a cloud platform), or entities including dedicated or general-purpose hardware devices and software functions. The present application does not limit the specific forms of the terminal device and the network device.

[0172] It should be noted that the network architecture described in the embodiment of the present application is to more clearly illustrate the technical solution of the embodiment of the present application, and does not constitute a limitation on the technical solution provided in the embodiment of the present application. It is known to those skilled in the art that with the evolution of the network architecture and the emergence of new business scenarios, the technical solution provided in the embodiment of the present application is also applicable to similar technical problems. In the following embodiments, the device for implementing the function of the network device is a network device, and the network device is a base station as an example to describe the technical solution provided in the embodiment of the present application.

[0173] Figure 4C Figure 1 is a possible application framework diagram in a communication system. Figure 4C As shown, the communication system includes: core network equipment, access network nodes, operation administration and maintenance (OAM) network elements, and terminal equipment. The network elements in the communication system are connected through interfaces (such as NG, Xn) or air interfaces. The access network node can be a separate RAN node, or it can include multiple RAN nodes, for example, including CU and DU. The CU and / or DU can also be set with one or more AI modules. Optionally, the CU can also be split into CU-CP and CU-UP. One or more AI models are set in the CU-CP and / or CU-UP.

[0174] It is to be understood that the present application does not specifically limit the specific structure of the execution subject of the method provided in the embodiment of the present application, as long as it can communicate according to the method provided in the embodiment of the present application by running a program that records the code of the method provided in the embodiment of the present application. The method provided in the embodiment of the present application can be applied to the communication between the terminal device and the network device. The interaction between the terminal device and the network device (taking the base station as an example) is used as an example to illustrate.

[0175] Figure 5 A flow chart of a communication method provided in an embodiment of the present application. Figure 5 As shown, the method includes:

[0176] 501. The terminal device sends a first message to the network device #1.

[0177] Correspondingly, network device #1 receives the first message from the terminal device, and network device #2 receives the first message from the terminal device. Figure 5 The dotted arrow in indicates that network device #2 receives the first message from the terminal device. Exemplarily, the terminal device may be located in the overlapping coverage area of ​​network device #1 and network device #2, and network device #1 and network device #2 share resources. The message sent by network device #1 to the terminal device (such as the second message below) may be interfered with by the downlink transmission of network device #2. Network device #2 may be an example of a network device (excluding network device #1) that receives the first message. If multiple network devices (including network device #2) receive the first message, the operations performed by the multiple network devices may be similar to the operations performed by network device #2 after receiving the first message. Figure 5 Taking network device #2 as an example, the operation performed by the network device (excluding network device #1) that receives the first message after receiving the first message is described.

[0178] The first message may include a first random access preamble. The first message may be Msg1, or MsgA, or other messages having similar functions to Msg1 / MsgA, such as messages sent by a terminal device in a random access process defined by subsequent communication standards. The entity corresponding to the cell to which the first random access preamble belongs may be network device #1. In other words, the first random access preamble is included in the preamble sequence associated with the cell managed by network device #1. The first random access preamble does not belong to the random access preamble of the first cell supported by network device #2. In other words, the first random access preamble is not included in the preamble sequence associated with the cell managed by network device #2.

[0179] 502. Network device #1 sends a second message to the terminal device in the first window.

[0180] The second message may be a random access response message (i.e., Msg2), or a contention resolution message (i.e., Msg4), or MsgB, or a message having a similar function to Msg2. The second message and the first message belong to the same random access process. The first window includes k time units used by the cell to which the first random access preamble belongs to send the second message. The second message and the first message belong to the same random access process, and k is an integer greater than 0. Optionally, the first window is used to monitor the PDCCH corresponding to the second message. For example, the terminal device monitors the PDCCH corresponding to the second message in the first window, and receives the second message. The length (or size) of the first window may be a predefined fixed value or a plurality of predefined optional values. The length of the first window used by the network device #1 may be any one of a plurality of predefined optional values. For example, the network device #1 determines the length of the first window based on the channel quality, and the length of the first window determined by the network device #1 when the channel quality is poor (e.g., below a threshold value) is greater than the length of the first window determined when the channel quality is good (e.g., above a threshold value). Network device #1 may also determine the length of the first window in other ways, which is not limited in this application. For example, the first window includes v time units, where v is a predefined integer greater than 0, such as v is 1. For another example, the first window is a RAR window, and the second message is Msg2. For another example, the first window includes multiple time units included in the RAR window and s time units for sending a contention resolution message, and the contention resolution message and the first message belong to the same random access process, and s is an integer greater than 0. The multiple time units in the first window may be continuous in time or discontinuous in time. For example, the first window includes a first sub-window and a second sub-window, and the time unit in the first sub-window is the time unit used by network device #1 to transmit the second message, and the time unit in the second sub-window is the time unit used by network device #1 to transmit the contention resolution message, and the time unit in the first sub-window is discontinuous in time with the time unit in the second sub-window. Among them, the RAR window refers to the window in which the terminal device receives the RAR, and all or part of the time domain resources in the window are actually used by the network device to transmit the RAR or at least one of the PDCCHs of the RAR. The length of the window can be configured by the network device to the terminal device, such as 1, 2, 4, 8, 10, 20, 40, or 80 time slots. For details, please refer to the definition in the existing 3GPP protocol, which will not be repeated here.

[0181] In a possible implementation, the time domain position of the first window and the time domain position of the first message satisfy a predefined relationship. Exemplarily, the network device #1 may store the predefined relationship or be pre-configured with the predefined relationship. After receiving the first message, the network device #1 may obtain the time domain position of the first window based on the time domain position of the first message and the predefined relationship. After obtaining the time domain position of the first window, the network device #1 executes step 502.

[0182] In a possible implementation manner, the first window is a random access response window, and the second message is a random access response message.

[0183] In a possible implementation, the first window is a time window used by network device #1 to send a second message, and the first window may include one or more time units. The time domain position of the first window may be the time domain position of the above-mentioned second message. The time domain position of the second message (i.e., the time domain position of the first window) satisfies a predefined relationship with the time domain position of the first message. Exemplarily, the time domain position of the second message satisfies the predefined relationship with the time domain position of the first message may be: the first time unit used to transmit the second message (i.e., the first time unit used by network device #1 to transmit the second message) is offset by y time units from the time unit where the first random access preamble is located or the time unit where the last symbol of the first random access preamble is located, and y is a predefined integer greater than 0. 502 may be replaced by: network device #1 sends a second message to the terminal device. The second message is a random access response message or a contention resolution message.

[0184] 503. Network device #2 performs downlink transmission, and the resources of the downlink transmission do not include downlink resources in the first window or downlink resources in the first window in the beam direction where the first message is located.

[0185] The first window includes k time units used by the cell to which the first random access preamble belongs to send the second message. The second message belongs to the same random access process as the above-mentioned first message. k is an integer greater than 0. For example, k is 1, 2, 3, 4, 5, 6, 8, etc. In the present application, a time unit may be one or more subframes, one or more time slots, one or more mini time slots or other time lengths, which are not limited in the present application. Step 503 may be replaced by: network device #2 does not perform downlink transmission within the first window or does not perform downlink transmission in the beam direction where the above-mentioned first message is located within the first window, and the first window includes k time units used by the cell to which the first random access preamble belongs to send the second message.

[0186] Fig. 6A A schematic diagram of a time unit for transmitting Msg1, Msg2, and Msg4 is provided in an embodiment of the present application. Fig. 6AIn the example, each rectangular box represents a time unit. The terminal device sends Msg1 at the time unit indicated by arrow 601 (hereinafter referred to as time unit #1), the network device #1 sends Msg2 at the time unit indicated by arrow 602 (hereinafter referred to as time unit #2), and the network device #1 sends Msg4 at the time unit indicated by arrow 603 (hereinafter referred to as time unit #3). Exemplarily, the first window includes time unit #2 and / or time unit #3. Fig. 6A An example of step 503 is: network device #2 performs downlink transmission, and the resources of the downlink transmission do not include downlink resources within time unit #2 (i.e., the first window) or downlink resources within time unit #2 in the beam direction where the first message is located. Fig. 6A Another example of step 503 is: network device #2 performs downlink transmission, and the resources of the downlink transmission do not include downlink resources in time unit #3 (i.e., the first window) or downlink resources in the beam direction where the first message is located in time unit #3. Fig. 6A Another example of step 503 is: network device #2 performs downlink transmission, and the resources of the above downlink transmission do not include downlink resources within time unit #2 or downlink resources within time unit #2 in the beam direction where the first message is located, and downlink resources within time unit #3 or downlink resources within time unit #3 in the beam direction where the first message is located. Fig. 6A This is just an example, and the present embodiment does not limit the offset between time unit #1 and time unit #2, and the offset between time unit #2 and time unit #3. Fig. 6A There is no restriction on whether each time unit corresponds to uplink or downlink.

[0187] Figure 6B A schematic diagram of another time unit for transmitting Msg1, Msg2, and Msg4 provided in an embodiment of the present application. Figure 6B In the example, each rectangular box represents a time unit. The terminal device sends Msg1 in j1 time units (hereinafter referred to as time unit #4) indicated by arrow 604, the network device #1 sends Msg2 in j2 time units (hereinafter referred to as time unit #5) indicated by arrow 605, and the network device #1 sends Msg4 in j3 time units (hereinafter referred to as time unit #6) indicated by arrow 606. j1, j2, and j3 are all integers greater than 0, and at least one of j1, j2, and j3 is greater than 1. Exemplarily, the first window includes time unit #5 and / or time unit #6. Figure 6B Another example of step 503 is: network device #2 performs downlink transmission, and the resources of the downlink transmission do not include downlink resources within time unit #5 (i.e., the first window) or downlink resources within time unit #5 in the beam direction where the first message is located. Figure 6BAnother example of step 503 is: network device #2 performs downlink transmission, and the resources of the above downlink transmission do not include downlink resources within time unit #5 or downlink resources within time unit #5 in the beam direction where the first message is located, and downlink resources within time unit #6 or downlink resources within time unit #6 in the beam direction where the first message is located. Figure 6B This is just an example. The embodiment of the present application does not limit the offset between the first time unit in time unit #4 and the first time unit in time unit #5, and the offset between the first time unit in time unit #5 and the first time unit in time unit #6. Figure 6B There is no restriction on whether each time unit corresponds to uplink or downlink.

[0188] In a possible implementation, the time domain position of the first window and the time domain position of the first message satisfy a predefined relationship. Exemplarily, network device #2 may store the predefined relationship or be pre-configured with the predefined relationship. After receiving the first message, network device #2 may obtain the time domain position of the first window based on the time domain position of the first message and the predefined relationship. After obtaining the time domain position of the first window, network device #2 executes step 503. The first window obtained by network device #2 based on the time domain position of the first message and the predefined relationship may be the same as the first window obtained by network device #1 based on the time domain position of the first message and the predefined relationship. Alternatively, the first window obtained by network device #2 based on the time domain position of the first message and the predefined relationship may include the first window obtained by network device #1 based on the time domain position of the first message and the predefined relationship.

[0189] In a possible implementation, after receiving the first message, network device #2 performs the following operation before executing step 503: by using the logical root sequence of the cell not managed by network device #2 to detect the received first message, it is determined that a random access preamble that does not belong to the cell (i.e., the cell managed by network device #2) is received. In other words, network device #2 detects the received first message using the logical root sequence of the cell not managed by network device #2, and determines that a random access preamble that does not belong to the cell (i.e., the cell managed by network device #2) is received. Exemplarily, network device #2 first detects the received first message using the logical root sequence of the cell; after failing to successfully detect the random access preamble belonging to the cell, the received first message is detected using the logical root sequence of the cell managed by network device #1, and it is determined that a random access preamble that does not belong to the cell (i.e., the cell managed by network device #2) is received. Network device #2 may store the logical root sequence of the cell managed by network device #1. Network device #2 can obtain the logical root sequence of the cell managed by network device #1 by interacting with network device #1; it can also be obtained based on the physical cell identifier (PCI) of the cell managed by network device #1, for example, the logical root sequence supported by the cell managed by network device #1 is the product of the PCI of the cell managed by network device #1 and a predefined sequence; the logical root sequence of the cell managed by network device #1 can also be obtained by other means. For example, cell #2 managed by network device #2 is adjacent to cell #1 managed by network device #1, that is, network device #2 and network device #1 are adjacent, network device #2 can store the logical root sequence of cell #1, and network device #1 can store the logical root sequence of cell #2. In this implementation, by detecting the received message (or signal) using the logical root sequence of a non-cell, it can be known that a random access preamble belonging to other cells is received, thereby avoiding interference with the random access process of other cells.

[0190] In an embodiment of the present application, the first window includes k time units used by the cell to which the first random access preamble belongs to send the second message, and the resources for downlink transmission by network device #2 do not include downlink resources within the first window or downlink resources within the first window in the beam direction where the first message is located. This can avoid interference of the downlink transmission with the transmission of the second message, thereby improving the success rate of random access.

[0191] The following introduces possible implementation methods in which the time domain position of the first window and the time domain position of the above-mentioned first message satisfy the predefined relationship, as well as an example of network device #1 or network device #2 obtaining the first window based on the first message and the predefined relationship.

[0192] In a possible implementation, the predefined relationship may include a time offset between the first time unit of the first window and the time unit where the first message (or the first random access preamble) is located or the time unit where the last symbol of the first message is located. For example, when the terminal device transmits the first message through one time unit, the predefined relationship includes the time offset between the first time unit in the first window and the time unit where the first random access preamble is located; when the terminal device transmits the first message through multiple time units, the predefined relationship includes the time offset between the first time unit in the first window and the time unit where the last symbol of the first random access preamble is located.

[0193] Example 1: The second message is a random access response message or a contention resolution message, and the above predefined relationship is that the first time unit in the first window is offset by f time units from the time unit where the first random access preamble is located or the time unit where the last symbol of the first random access preamble is located, and f is a predefined integer greater than 0. The first window can be a time window used by network device #1 to transmit the second message. The predefined relationship between the time domain position of the first window and the time domain position of the above first message can be: the time domain position of the above second message and the time domain position of the above first message meet the predefined relationship. For example, the first time unit used by network device #1 to transmit the second message is offset by f time units from the time unit where the first random access preamble is located or the time unit where the last symbol of the first random access preamble is located. In this example, f is a predefined fixed value. For example, f is any one of 5, 6, 8, 9, 10, 12, 15, 20, 30, etc. The first time unit in the first window is offset by f time units from the time unit where the first random access preamble is located, which can be replaced by: the interval between the first time unit in the first window and the time unit where the first random access preamble is located is (f-1) time units. In other words, the predefined relationship is to fix the interval between the first time unit in the first window and the time unit where the random access preamble is located to (f-1) time units. An example of the predefined relationship being the first time unit in the first window and the time unit where the first random access preamble is located offset by f time units is: the second message is Msg2, and the first time unit for transmitting Msg2 (i.e., the first time unit in the first window) is spaced 10 time units from the time unit where the first random access preamble is located, i.e., f is 11. In this example, assuming that the time unit where the first random access preamble is located is the e-th time unit, network device #1 or network device #2 can determine that the first time unit in the first window is the (e+11)-th time unit based on the first message and the predefined relationship, where e is an integer greater than 0. Another example of the predefined relationship that the first time unit in the first window and the time unit where the first random access preamble is located are offset by f time units is as follows: the second message is Msg4, and the first time unit used to transmit Msg4 (i.e., the first time unit in the first window) is separated from the time unit where the first random access preamble is located by 10 time units, i.e., f is 11.

[0194] Example 2: The second message is a random access response message or a contention resolution message, and the above predefined relationship is that the first time unit in the first window is offset from the time unit where the first random access preamble is located or the time unit where the last symbol of the first random access preamble is located by f time units, and the value range of f is f1≤f≤f2, that is, f is greater than or equal to f1, f is less than or equal to f2, and f1 and f2 are integers greater than 0. In other words, the above predefined relationship is that the first time unit in the first window is offset from the time unit where the first random access preamble is located or the time unit where the last symbol of the first random access preamble is located by f1 to f2 time units, that is, the minimum offset is f1 time units and the maximum offset is f2 time units. In other words, the above predefined relationship is that the interval between the first time unit in the first window and the time unit where the first random access preamble is located or the time unit where the last symbol of the first random access preamble is (f1-1) to (f2-1) time units, that is, the minimum interval is (f1-1) time units and the maximum interval is (f2-1) time units. For example, f1 is 5 and f2 is 10. For another example, f1 is 10 and f2 is 20. An example in which the predefined relationship is that the first time unit in the first window is offset from the time unit in which the first random access preamble is located by f (f1≤f≤f2) time units is as follows: the second message is Msg2, and the interval between the first time unit for transmitting MSG2 (i.e., the first time unit in the first window) and the time unit in which the first random access preamble is located is not less than 10 time units and not more than 20 time units, i.e., f1 is 11 and f2 is 21. In this example, assuming that the time unit in which the first random access preamble is located is the e-th time unit, network device #1 or network device #2 can determine, based on the first message and the predefined relationship, that the first time unit in the first window is any one of the (e+11)th time unit to the (e+21)th time unit, where e is an integer greater than 0.

[0195] The first window determined by network device #2 may be different from the first window determined by network device #1. When network device #1 determines that the first time unit in the first window is any one of multiple time units that are continuous in time based on the first message and the predefined relationship, network device #1 may use any one of the multiple time units as the first time unit in the first window. When network device #2 determines that the first time unit in the first window is any one of multiple time units that are continuous in time based on the first message and the predefined relationship, network device #2 may use the first time unit in the multiple time units as the first time unit in the first window, and use the last time unit in the multiple time units as the first time unit in the first window to determine the last time unit in the first window. For example, network device #1 or network device #2 can determine, based on the first message and the predefined relationship, that the first time unit in the first window is any one of the (e+11)th time unit to the (e+21)th time unit, and the first window includes v time units; network device #1 uses the (e+13)th time unit as the first time unit in the first window, and the (e+12+v)th time unit as the last time unit in the first window; network device #2 uses the (e+11)th time unit as the first time unit in the first window, and the (e+20+v)th time unit as the last time unit in the first window. Fig. 7A This is an example of a comparison diagram of a first window determined by a network device #1 and a first window determined by a network device #2 provided in an embodiment of the present application. Fig. 7A , the first time unit in the first window is any one of the (e+11)th time unit to the (e+21)th time unit; 701 represents the first window determined by network device #1, the first time unit in the first window determined by network device #1 is the (e+13)th time unit, and the last time unit is the (e+12+v)th time unit; 702 represents the first window determined by network device #2, the first time unit in the first window determined by network device #2 is the (e+11)th time unit, and the last time unit is the (e+20+v)th time unit.

[0196] Example 3: The second message is a random access response message, and the above predefined relationship is that the first time unit in the first window is offset by g time units from the time unit where the first random access preamble is located or the time unit where the last symbol of the first random access preamble is located, and g is a predefined integer greater than 0, or the value range of g is g1≤g≤g2, and g1 and g2 are integers greater than 0. In this example, the time unit in the first window is the time unit used to transmit the random access response message, and the last time unit in the first window is the time unit where the random access response message is located or the time unit where the last symbol of the above random access response message is located. The second window includes o time units used by the cell to which the above first random access preamble belongs (i.e., the cell managed by network device #1) to send contention resolution messages, and o is an integer greater than 0. In Example 3, the second window can be a time window used by network device #1 to transmit contention resolution messages. The time domain position of the second window satisfies the predefined relationship with the time domain position of the first window. In order to distinguish the predefined relationship satisfied by the time domain position of the second window and the time domain position of the first window, and the predefined relationship satisfied by the time domain position of the first window and the time domain position of the first message, the predefined relationship satisfied by the time domain position of the second window and the time domain position of the first window is named as predefined relationship #1 below. Exemplarily, predefined relationship #1 includes that the first time unit in the second window is offset by h time units from the last time unit in the first window, where h is a predefined integer greater than 0, or the value range of h is h1≤h≤h2, and h1 and h2 are integers greater than 0. For example, the last time unit in the first window is the dth time unit, and the first time unit in the second window is the (d+h)th time unit, where d is an integer greater than 0. For another example, the last time unit in the first window is the dth time unit, and the first time unit in the second window is any one of the (d+h1)th time unit to the (d+h2)th time unit.

[0197] The second window determined by network device #1 may be different from the second window determined by network device #2. When network device #1 determines that the first time unit in the second window is any one of multiple time units that are continuous in time based on the time domain position of the first window and predefined relationship #1, network device #1 may use any one of the multiple time units as the first time unit in the second window. When network device #2 determines that the first time unit in the second window is any one of multiple time units that are continuous in time based on the time domain position of the first window and predefined relationship #1, network device #2 may use the first time unit in the multiple time units as the first time unit in the second window, and use the last time unit in the multiple time units as the first time unit in the second window to determine the last time unit in the second window. For example, network device #1 and network device #2 can determine, based on the first message and the predefined relationship, that the first time unit in the first window is any one of the (e+11)th time unit to the (e+21)th time unit, and the first window includes v time units; network device #1 uses the (e+13)th time unit as the first time unit in the first window, and uses the (e+12+v)th time unit as the last time unit in the first window; network device #2 uses the (e+11)th time unit as the first time unit in the first window, and uses the (e+20+v)th time unit as the last time unit in the first window; network device #1 determines, based on the time domain position of the first window determined by it and the predefined relationship #1, that the first time unit in the second window is any one of the (e+12+v+h1)th time unit to the (e+21+h1)th time unit. The second window includes v1 time units, where v1 is an integer greater than 0; network device #1 uses the (e+13+v+h1)th time unit as the first time unit in the second window, and uses the (e+13+v+h1+v1-1)th time unit as the last time unit in the second window; network device #2 determines that the first time unit in the second window is any one of the (e+10+v+h1)th time unit to the (e+20+v+h2)th time unit based on the time domain position of the first window determined by it and the predefined relationship #1; network device #2 uses the (e+10+v+h1)th time unit as the first time unit in the second window, and uses the (e+20+v+h2+v1-1)th time unit as the last time unit in the second window.

[0198] Figure 7B This is an example of a comparison diagram of a second window determined by a network device #1 and a second window determined by a network device #2 provided in an embodiment of the present application. Figure 7B, the first time unit in the first window is any one of the (e+11)th time unit to the (e+21)th time unit; 701 represents the first window determined by network device #1, the first time unit in the first window determined by network device #1 is the (e+13)th time unit, and the last time unit is the (e+12+v)th time unit; 702 represents the first window determined by network device #2, the first time unit in the first window determined by network device #2 is the (e+11)th time unit, and the last time unit is the (e+2 0+v) time unit; 703 represents the second window determined by network device #1, the first time unit in the second window determined by network device #1 is the (e+13+v+h1)th time unit, and the last time unit is the (e+13+v+h1+v1-1)th time unit; 704 represents the second window determined by network device #2, the first time unit in the second window determined by network device #2 is the (e+10+v+h1)th time unit, and the last time unit is the (e+20+v+h2+v1-1)th time unit.

[0199] Example 4: The second message is a random access response message, and the first window also includes s time units used by the cell to which the first random access preamble belongs to send a contention resolution message, the contention resolution message and the first message belong to the same random access process, and s is an integer greater than 0; the predefined relationship is that the starting position of the first window (i.e., the first time unit in the first window) is offset by t time units from the time unit where the first random access preamble is located or the time unit where the last symbol of the first random access preamble is located, and t is a predefined integer greater than 0, or the value range of t is t1≤t≤t2, t1 and t2 are integers greater than 0, or the starting position of the first window is the first downlink time unit after the cell to which the first random access preamble belongs sends the first message. The starting position of the first window can also be other downlink time units after the cell to which the first random access preamble belongs sends the first message, which is not limited in this application. In this example, network device #1 transmits Msg2 and Msg4 in the first window. In other words, the transmission of Msg2 and Msg4 is completed in the first window. To prevent network device #2 (corresponding to the interference cell of the terminal device) from interfering with the random access process of the terminal device, network device #2 can determine that network device #1 (corresponding to the target service cell of the terminal device) will send Msg2 and Msg4 in the first window based on the first message and the predefined relationship. After network device #2 detects the random access preamble sent by the terminal device and learns that the random access preamble is not a random access preamble of the cell, it does not perform downlink transmission in the first window or does not perform downlink transmission in the first window in the beam direction where the first message is located; it can prevent network device #2 (corresponding to the interference cell of the terminal device) from interfering with the random access process of the terminal device.

[0200] Network device #1 and network device #2 may determine the starting position of the first window based on the first message and the predefined relationship. The length of the first window may be a predefined fixed value or a predefined plurality of optional values. When the length of the first window is a predefined fixed value, the first windows determined by network device #1 and network device #2 based on the first message and the predefined relationship may be the same. When the length of the first window is a predefined plurality of optional values, the first windows determined by network device #1 and network device #2 based on the first message and the predefined relationship may be different. The first window determined by network device #2 based on the first message and the predefined relationship may include the first window determined by network device #1 based on the first message and the predefined relationship. For example, network device #1 determines that the first time unit in the first window is the i-th time unit based on the first message and the predefined relationship, and the length of the first window is a predefined plurality of optional values, the plurality of optional values ​​including optional value #1, optional value #2, ..., optional value #z, i is an integer greater than 0; when network device #1 uses optional value #2 as the length of the first window, the last time unit in the first window is the (i-1+optional value #2)th time unit; network device #2 determines that the first time unit in the first window is the i-th time unit based on the first message and the predefined relationship; network device #2 determines that the last time unit in the first window is the (i-1+optional value #z)th time unit, wherein optional value #z is the largest of the plurality of optional values. That is to say, when the length of the first window is a plurality of optional values, the first window in which network device #2 does not perform downlink transmission is the first window with the longest length. In this way, when network device #1 (the target service cell supporting the terminal device) sends MSG2 and MSG4 to the terminal device, network device #2 will not interfere with the terminal device's reception of MSG2 and MSG4.

[0201] Figure 8 A flow chart of another communication method provided in an embodiment of the present application. Figure 8 The method flow in is Figure 5 A possible implementation of the method described is shown in FIG. Figure 8 As shown, the method includes:

[0202] 801. The terminal device sends a first message to the network device #1.

[0203] Correspondingly, network device #1 receives the first message from the terminal device, and network device #2 receives the first message from the terminal device. Figure 8 The dotted arrow in indicates that the network device #2 receives the first message from the terminal device. Step 801 may refer to step 501. The first message may include a first random access preamble, for example, the first message is Msg1.

[0204] 802. Network device #1 detects the received first message using the logical root sequence of the cell, and determines that a random access preamble belonging to the cell is received.

[0205] The network device #1 detects the received first message using the logical root sequence of the cell, which can be replaced by: the network device #1 detects the received first message using the logical root sequence of the cell it manages. The cell in step 802 refers to the cell managed by the network device #1. Step 802 can be replaced by: the network device #1 detects the random access preamble belonging to the cell using the logical root sequence of the cell.

[0206] 803. Network device #1 obtains the time domain position of the first window based on the time domain position of the first message.

[0207] In a possible implementation, the time domain position of the first window satisfies a predefined relationship with the time domain position of the first message. An example of step 803 is as follows: network device #1 obtains the time domain position of the first window based on the time domain position of the first message and the predefined relationship.

[0208] In a possible implementation, the first window is a time window for network device #1 to send the second message, and the first window may include one or more time units. The time domain position of the first window is the time domain position of the above-mentioned second message. The time domain position of the second message (i.e., the time domain position of the first window) satisfies a predefined relationship with the time domain position of the first message. Step 803 may be replaced by: network device #1 obtains the time domain position of the second message based on the time domain position of the first message.

[0209] 804. Network device #1 sends a second message to the terminal device in the first window.

[0210] Correspondingly, the terminal device receives the second message from the network device #1. Step 804 may refer to step 502. The second message may be a random access response message, ie, Msg2. The first window includes k time units used by the cell to which the first random access preamble belongs to send the second message.

[0211] 805. Network device #2 detects the received first message using a logical root sequence of a non-cell and determines that a random access preamble that does not belong to the cell is received.

[0212] The order of step 805 and step 802 is not limited. In step 805, the logical root sequence of the non-cell may be the logical root sequence of the neighboring cell (including the cell managed by network device #1) of the cell managed by network device #2 and stored or configured by network device #2. Step 805 can be replaced by: network device #2 detects the random access preamble that does not belong to the cell using the logical root sequence of the non-cell. The cell in step 805 refers to the cell managed by network device #2. A possible implementation of step 805 is as follows: network device #2 first detects the received first message using the logical root sequence of the cell; after failing to successfully detect the random access preamble belonging to the cell, it detects the received first message using the logical root sequence of the non-cell (including the cell managed by network device #1), and determines that a random access preamble that does not belong to the cell (i.e., the cell managed by network device #2) is received.

[0213] 806. Network device #2 obtains the time domain position of the first window based on the time domain position of the first message.

[0214] In a possible implementation, the time domain position of the first window satisfies a predefined relationship with the time domain position of the first message. An example of step 806 is as follows: network device #2 obtains the time domain position of the first window based on the time domain position of the first message and the predefined relationship.

[0215] In a possible implementation, the first window is a time window for network device #1 to send the second message, and the first window may include one or more time units. The time domain position of the second message (i.e., the time domain position of the first window) satisfies a predefined relationship with the time domain position of the first message. Step 806 may be replaced by: network device #2 obtains the time domain position of the second message based on the time domain position of the first message.

[0216] 807. Network device #2 performs downlink transmission, and the resources of the downlink transmission do not include the downlink resources in the first window or the downlink resources in the first window in the beam direction where the first message is located.

[0217] Step 807 may refer to step 503 .

[0218] 808. The terminal device sends Msg3 to network device #1.

[0219] Correspondingly, network device #1 receives Msg3 from the terminal device. Msg3 may carry identification information of the terminal device.

[0220] 809. Network device #1 obtains the time domain position of the second window based on the time domain position of the first message or the time domain position of the first window.

[0221] The second window includes o time units used by network device #1 to send Msg4, where o is an integer greater than 0. Step 809 may be an operation in which network device #1 obtains a time window used by network device #1 to send Msg4 based on the time domain position of the first message or the time domain position of the first window. The second window and the first window may be discontinuous in time, which can reduce the impact on the downlink transmission of network device #2. The order of step 809 and step 803 or step 804 is not limited. In one possible implementation, Figure 8 The method does not include step 809, and step 803 is replaced by: network device #1 obtains the time domain position of the first window based on the time domain position of the first message, and obtains the time domain position of the second window based on the time domain position of the first message or the time domain position of the first window.

[0222] In a possible implementation, the time domain position of the second window and the time domain position of the first message satisfy the predefined relationship #2; network device #1 obtains the time domain position of the second window based on the time domain position of the first message, which can be: network device #1 obtains the time domain position of the second window based on the time domain position of the first message and the above-mentioned predefined relationship #2. The second window is a time window for network device #1 to send a contention resolution message. The time domain position of the second window can be the time domain position of the contention resolution message. Exemplarily, the above-mentioned predefined relationship #2 is that the first time unit in the second window (i.e., the first time unit for transmitting Msg4) is offset by c time units from the time unit where the first random access preamble is located or the time unit where the last symbol of the first random access preamble is located, and the value range of c is c1≤c≤c2, that is, c is greater than or equal to c1, c is less than or equal to c2, and c1 and c2 are integers greater than 0. For example, c1 is 5 and c2 is 10. For another example, c1 is 10 and c2 is 20. For another example, c1 is 20 and c2 is 30. An example of the predefined relationship #2 being that the first time unit in the second window is offset from the time unit where the first random access preamble is located or the time unit where the last symbol of the first random access preamble is located by c (c1≤c≤c2) time units is as follows: the interval between the first time unit in the second window and the time unit where the first random access preamble is located is not less than 10 time units and not more than 20 time units, that is, c1 is 11 and c2 is 21. In this example, assuming that the time unit where the first random access preamble is located is the c3th time unit, network device #1 and network device #2 can determine that the first time unit in the second window is any one of the (c3+11)th time unit to the (c3+21)th time unit based on the first message and the predefined relationship #2, and e is an integer greater than 0. Network device #1 can use any one of the (c3+11)th time unit to the (c3+21)th time unit as the first time unit in the second window. Network device #2 may use the (c3+11)th time unit as the first time unit in the second window.

[0223] In a possible implementation, the time domain position of the second window and the time domain position of the first window satisfy the above-mentioned predefined relationship #1; network device #1 obtains the time domain position of the second window based on the time domain position of the first window, which may be: network device #1 obtains the time domain position of the second window based on the time domain position of the first window and the above-mentioned predefined relationship #1, refer to the relevant description of the above-mentioned Example 3. Exemplarily, the first window is a time window for network device #1 to transmit a random access response message, and the second window is a time window for network device #1 to transmit a contention resolution message; the time domain position of the second window and the time domain position of the first window satisfy the above-mentioned predefined relationship #1, which may be: the time domain position of the contention resolution message and the time domain position of the random access response message satisfy the above-mentioned predefined relationship #1; network device #1 obtains the time domain position of the second window based on the time domain position of the first window, which may be: network device #1 obtains the time domain position of the contention resolution message based on the time domain position of the random access response message.

[0224] 810. Network device #1 sends Msg4 to the terminal device in the second window.

[0225] Correspondingly, the terminal device receives Msg4 from network device #1.

[0226] 811. Network device #2 obtains the time domain position of the second window based on the time domain position of the first message or the time domain position of the first window.

[0227] The implementation of step 811 is similar to that of step 809 and will not be described in detail here.

[0228] 812. Network device #2 performs downlink transmission, and the resources of the downlink transmission do not include downlink resources in the second window or downlink resources in the second window in the beam direction where the first message is located.

[0229] The first window is a moment or a time range. The second window is a moment or a time range. Network device #1 sends the second message, Msg2, to the terminal device in the first window; and sends Msg4 to the terminal device in the second window. In other words, network device #1 transmits Msg2 and Msg4 at a fixed moment or a time range.

[0230] In the embodiment of the present application, network device #1 transmits Msg2 and Msg4 at a fixed time or within a time range. Network device #2 detects the random access preamble of the non-cell using the logical root sequence of the non-cell, does not perform downlink transmission at the time or time range corresponding to Msg2 and Msg4, or does not perform downlink transmission in the beam direction where the random access preamble is located, which can avoid interference with the random access process of the terminal device and improve the success rate of random access.

[0231] Fig. 9 A flow chart of another communication method provided in an embodiment of the present application. Fig. 9 The method flow is Figure 5 A possible implementation of the method described. Fig. 9 As shown, the method includes:

[0232] 901. The terminal device sends MsgA to network device #1.

[0233] Accordingly, network device #1 receives MsgA from the terminal device, and network device #2 receives MsgA from the terminal device. Fig. 9 The dotted arrow in FIG. 2 indicates that the network device #2 receives MsgA from the terminal device. MsgA may include the first random access preamble. MsgA may include Figure 5 Steps 901 to 907 can refer to steps 801 to 807, which will not be repeated here.

[0234] 902. Network device #1 detects the received MsgA using the logical root sequence of the cell, and determines that a random access preamble belonging to the cell is received.

[0235] 903. Network device #1 obtains the time domain position of the first window based on the time domain position of MsgA.

[0236] The first window includes k time units used by network device #1 to send MsgB. Step 903 may be an operation in which network device #1 determines the time window used to transmit MsgB. MsgB is Figure 5 An example of the second message in .

[0237] 904. Network device #1 sends MsgB to the terminal device in the first window.

[0238] Correspondingly, the terminal device receives MsgB from network device #1.

[0239] 905. Network device #2 detects the received MsgA using the logical root sequence of the non-cell and determines that a random access preamble that does not belong to the cell is received.

[0240] The order of step 905 and step 902 is not limited.

[0241] 906. Network device #2 obtains the time domain position of the first window based on the time domain position of MsgA.

[0242] 907. Network device #2 performs downlink transmission, and the resources of the downlink transmission do not include the downlink resources in the first window or the downlink resources in the first window in the beam direction where MsgA is located.

[0243] The first window is a time or a time range. Network device #1 sends MsgB to the terminal device within the first window, indicating that network device #1 transmits MsgB at a fixed time or within a time range.

[0244] In the embodiment of the present application, network device #1 transmits MsgB at a fixed time or within a time range. Network device #2 detects the random access preamble of the non-cell using the logical root sequence of the non-cell, does not perform downlink transmission at the time or time range corresponding to MsgB, or does not perform downlink transmission in the beam direction where the random access preamble is located, which can avoid interference with the random access process of the terminal device and improve the success rate of random access.

[0245] Fig.10 A flow chart of another communication method provided in an embodiment of the present application. Fig.10 The method flow in is Figure 5 A possible implementation of the method described is shown in FIG. Fig.10 As shown, the method includes:

[0246] 1001. The terminal device sends Msg1 to network device #1.

[0247] Correspondingly, network device #1 receives Msg1 from the terminal device, and network device #2 receives Msg1 from the terminal device. Fig.10 The dotted arrow in the figure indicates that the network device #2 receives Msg1 from the terminal device. Msg1 may include the first random access preamble. Msg1 may be Figure 5 Step 1001 may be an example of step 501.

[0248] 1002. Network device #1 detects the received Msg1 using the logical root sequence of the cell, and determines that a random access preamble belonging to the cell is received.

[0249] Step 1002 may refer to step 802 .

[0250] 1003. Network device #1 obtains the time domain position of the first window based on the time domain position of Msg1.

[0251] The first window includes k time units used by network device #1 to send Msg2 and s time units used to send Msg4. Exemplarily, the time units in the first window are continuous in time. The first window may include a RAR window.

[0252] The time domain position of the first window and the time domain position of Msg1 satisfy a predefined relationship. For the predefined relationship satisfied by the time domain position of the first window and the time domain position of Msg1, please refer to the description of the predefined relationship in Example 4 above, which will not be repeated here. Fig.11 This is an example of the time domain position of the first window and the time domain position of Msg1 provided in the embodiment of the present application. Fig.11 As shown, the time unit indicated by arrow 1101 is the first random access preamble (i.e. Fig.10 The time unit indicated by arrow 1102 is the first time unit in the first window, and the first time unit in the first window is offset by t time units from the time unit where the first random access preamble is located, that is, the first time unit in the first window and the time unit where the first random access preamble is located are separated by (t-1) time units, and t is a predefined integer greater than 0, for example, t is 3, 4, 5, 6, 10, etc. Fig.12 Another example of the time domain position of the first window and the time domain position of Msg1 provided in the embodiment of the present application. Fig.12 As shown, the time unit indicated by arrow 1201 is the time unit where the first random access preamble (i.e., preamble in the figure) is located, the time unit indicated by arrow 1202 is the first downlink time unit after network device #1 sends Msg1, and the starting position of the first window is the first downlink time unit after network device #1 sends Msg1.

[0253] In the above example 4, the implementation manner in which network device #1 determines the first window based on the first message and the predefined relationship is described, which will not be repeated here.

[0254] 1004. Network device #1 sends Msg2 to the terminal device in the first window.

[0255] Correspondingly, the terminal device receives Msg2 from the network device #1. Step 1004 may refer to step 502. The second message may be a random access response message, namely Msg2.

[0256] 1105. Network device #2 detects the received Msg1 using the logical root sequence of the non-cell and determines that a random access preamble that does not belong to the cell is received.

[0257] Step 1105 may refer to step 805. The order of step 1105 and step 1102 is not limited.

[0258] 1006. Network device #2 obtains the time domain position of the first window based on the time domain position of Msg1.

[0259] In the above example 4, the implementation method of determining the first window based on the first message and the predefined relationship by network device #2 is described, which will not be repeated here. Step 1006 may be an operation of network device #2 obtaining the time window used by network device #1 to transmit Msg1 and Msg2.

[0260] 1007. Network device #2 performs downlink transmission, and the resources of the downlink transmission do not include the downlink resources in the first window or the downlink resources in the first window in the beam direction where Msg1 is located.

[0261] There is no limitation on the order of step 1107 and step 1008. There is no limitation on the order of step 1107 and step 1004.

[0262] 1008. The terminal device sends Msg3 to network device #1.

[0263] Correspondingly, network device #1 receives Msg3 from the terminal device.

[0264] 1009. Network device #1 sends Msg4 to the terminal device in the first window.

[0265] Correspondingly, the terminal device receives Msg4 from network device #1.

[0266] In the embodiment of the present application, the first window is a time window used by network device #1 to transmit Msg1 and Msg2. After detecting a random access preamble of a non-cell, network device #2 does not perform downlink transmission within the first window or does not perform downlink transmission in the beam direction where the random access preamble is located, thereby avoiding interference with the random access process of the terminal device and improving the success rate of random access.

[0267] The structure of a communication device that can implement the communication method provided in the embodiment of the present application is described below in conjunction with the accompanying drawings. The following only briefly describes the communication device. For the implementation details of the solution, please refer to the description of the method embodiment above, which will not be repeated below.

[0268] Fig.13A structural diagram of a communication device 1300 provided in an embodiment of the present application. The communication device 1300 may correspond to the functions or steps implemented by the terminal device in the above-mentioned various method embodiments, may correspond to the functions or steps implemented by the network device #1 in the above-mentioned various method embodiments, and may correspond to the functions or steps implemented by the network device #2 in the above-mentioned various method embodiments. The communication device may include a processing module 1310 and a transceiver module 1320. In a possible implementation, a storage unit may also be included, which may be used to store instructions (codes or programs) and / or data. The processing module 1310 and the transceiver module 1320 may be coupled to the storage unit, for example, the processing module 1310 may read the instructions (codes or programs) and / or data in the storage unit to implement the corresponding method. The above-mentioned various units may be independently arranged, or may be partially or fully integrated. For example, the transceiver module 1320 may include a sending module and a receiving module. The sending module may be a transmitter, and the receiving module may be a receiver. The entity corresponding to the transceiver module 1320 may be a transceiver circuit, such as a transceiver or a communication interface.

[0269] In some possible implementations, the communication device 1300 can implement the behaviors and functions of the terminal device in the above method embodiments. For example, the communication device 1300 can be a terminal device, or a component (such as a chip or circuit) used in the terminal device. The transceiver module 1320 can be used to perform Figure 5 , Figure 8 , Fig. 9 , Fig.10 The processing module 1310 can be used to perform all receiving or sending operations performed by the terminal device in the embodiment of the present invention. Figure 5 , Figure 8 , Fig. 9 , Fig.10 All operations except sending and receiving operations performed by the terminal device in the embodiment.

[0270] In some possible implementations, the communication device 1300 can implement the behaviors and functions of the network device #1 in the above method embodiment. For example, the communication device 1300 can be the network device #1, or a component (such as a chip or circuit) used in the network device #1. The transceiver module 1320 can be used to perform Figure 5 , Figure 8 , Fig. 9 , Fig.10 The processing module 1310 can be used to perform all receiving or sending operations performed by the network device #1 in the embodiment of FIG. Figure 5 , Figure 8 , Fig. 9 , Fig.10All operations except sending and receiving operations performed by network device #1 in the embodiment.

[0271] In some possible implementations, the communication device 1300 can implement the behaviors and functions of the network device #2 in the above method embodiment. For example, the communication device 1300 can be the network device #2, or a component (such as a chip or circuit) used in the network device #2. The transceiver module 1320 can be used to perform Figure 5 , Figure 8 , Fig. 9 , Fig.10 The processing module 1310 can be used to perform all receiving or sending operations performed by the network device #2 in the embodiment of FIG. Figure 5 , Figure 8 , Fig. 9 , Fig.10 All operations except sending and receiving operations performed by network device #2 in the embodiment.

[0272] Fig.14 A schematic diagram of the structure of another device 140 provided in an embodiment of the present application. Fig.14 The device in the embodiment may be the terminal device or a chip used in the terminal device, or the network device #1 or a chip used in the network device #1, or the network device #2 or a chip used in the network device #2. Fig.14 As shown, the device 140 includes a processing circuit 1410 and a transceiver circuit 1420 .

[0273] In some embodiments of the present application, the processing circuit 1410 and the transceiver circuit 1420 may be used to execute functions or operations executed by the terminal device. For example, the transceiver circuit 1420 may be used to execute Figure 5 , Figure 8 , Fig. 9 , Fig.10 The processing circuit 1410 is used, for example, to perform all receiving or sending operations performed by the terminal device in the embodiment of Figure 5 , Figure 8 , Fig. 9 , Fig.10 All operations except sending and receiving operations performed by the terminal device in the embodiment.

[0274] In some embodiments of the present application, the processing circuit 1410 and the transceiver circuit 1420 may be used to execute the functions or operations executed by the network device #1. The transceiver circuit 1420 may be used to execute, for example, Figure 5 , Figure 8 , Fig. 9 , Fig.10 The processing circuit 1410 is used, for example, to perform all receiving or sending operations performed by the network device #1. Figure 5 , Figure 8 , Fig. 9 , Fig.10 All operations except sending and receiving operations performed by network device #1 in the embodiment.

[0275] In some embodiments of the present application, the processing circuit 1410 and the transceiver circuit 1420 may be used to execute the functions or operations executed by the network device #2. The transceiver circuit 1420 may be used to execute, for example, Figure 5 , Figure 8 , Fig. 9 , Fig.10 The processing circuit 1410 is used, for example, to perform all receiving or sending operations performed by the network device #2. Figure 5 , Figure 8 , Fig. 9 , Fig.10 All operations except sending and receiving operations performed by network device #2 in the embodiment.

[0276] In a possible implementation, the transceiver circuit 1420 includes at least one transceiver, and the processing circuit 1410 includes at least one processor, or a circuit in at least one processor for processing or control.

[0277] The transceiver is used to communicate with other devices / apparatuses through a transmission medium. The processor uses the transceiver to send and receive data and / or signaling, and is used to implement the method in the above method embodiment. The processor can implement the function of the processing module 1310, and the transceiver can implement the function of the transceiver module 1320. Optionally, the transceiver may include a radio frequency circuit and an antenna, and the radio frequency circuit is mainly used for converting baseband signals and radio frequency signals and processing radio frequency signals. The antenna is mainly used to send and receive radio frequency signals in the form of electromagnetic waves. Input and output devices, such as touch screens, display screens, keyboards, etc. are mainly used to receive data input by users and output data to users.

[0278] Optionally, the device 140 may also include at least one memory for storing program instructions and / or data. The memory is coupled to the processor. The coupling in the embodiment of the present application is an indirect coupling or communication connection between devices, units or modules, which may be electrical, mechanical or other forms, for information exchange between devices, units or modules. The processor may operate in conjunction with the memory. The processor may execute program instructions stored in the memory. At least one of the at least one memory may be included in the processor.

[0279] The processor can read the software program in the memory, interpret and execute the instructions of the software program, and process the data of the software program. When data needs to be sent wirelessly, the processor performs baseband processing on the data to be sent, and outputs the baseband signal to the RF circuit. The RF circuit performs RF processing on the baseband signal and then sends the RF signal outward in the form of electromagnetic waves through the antenna. When data is sent to the device 140, the RF circuit receives the RF signal through the antenna, converts the RF signal into a baseband signal, and outputs the baseband signal to the processor. The processor converts the baseband signal into data and processes the data.

[0280] In another implementation, the above-mentioned RF circuit and antenna can be set independently of the processor performing baseband processing. For example, in a distributed scenario, the RF circuit and antenna can be independent of the device 140 and arranged in a remote manner.

[0281] The specific connection medium between the above-mentioned transceiver, processor and memory is not limited in the embodiments of the present application.

[0282] In the embodiments of the present application, the processor may be one of the following devices: a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field programmable gate array or other programmable logic device, a discrete gate or transistor logic device, a discrete hardware component, or all or part of the circuits used for processing functions in the aforementioned devices, which may implement or execute the methods, steps and logic block diagrams disclosed in the embodiments of the present application. A general-purpose processor may be a microprocessor or any conventional processor, etc. The steps of the method disclosed in the embodiments of the present application may be directly embodied as being executed by a hardware processor, or may be executed by a combination of hardware and software modules in the processor.

[0283] In a possible implementation, the processing circuit 1410 includes at least one logic circuit, and the transceiver circuit 1420 includes at least one interface. Fig.13 The processing module 1310 in can be implemented by a logic circuit. Fig.13 The transceiver module 1320 in the embodiment can be implemented with an interface. The logic circuit can be a chip, a processing circuit, an integrated circuit or a system on chip (SoC) chip, etc., and the interface can be a communication interface, an input and output interface, etc. In the embodiment of the present application, the logic circuit and the interface can also be coupled to each other. The embodiment of the present application does not limit the specific connection method of the logic circuit and the interface.

[0284] The present application also provides a computer-readable storage medium, in which a computer program or instruction is stored. When the computer program or instruction is executed on a computer, the computer executes the method of the above embodiment.

[0285] The present application also provides a computer program product, which includes instructions or a computer program. When the instructions or the computer program are run on a computer, the method in the above embodiment is executed.

[0286] The present application also provides a communication system, comprising the above-mentioned network device #1, the above-mentioned network device #2 and the above-mentioned terminal device.

[0287] The present application also provides a chip, which includes: a communication interface and a processor; the communication interface is used for sending and receiving signals of the above-mentioned chip; the processor is used to execute computer program instructions so that a communication device including the above-mentioned chip executes the method in the above-mentioned embodiment.

[0288] 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 above computer program product includes one or more computer programs or instructions. When the above computer program or instruction is loaded and executed on a computer, the above process or function of the embodiment of the present application is executed in whole or in part. The above computer may be a general-purpose computer, a special-purpose computer, a computer network, a network device, a user device or other programmable device. The above computer program or instruction may be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, the above computer program or instruction may be transmitted from one website site, computer, server or data center to another website site, computer, server or data center by wired or wireless means. The above computer-readable storage medium may be any available medium that a computer can access or a data storage device such as a server or data center that integrates one or more available media. The above available medium may be a magnetic medium, such as a floppy disk, a hard disk, or a tape; it may also be an optical medium, such as a digital video disc; it may also be a semiconductor medium, such as a solid-state hard disk. The computer-readable storage medium may be a volatile or nonvolatile storage medium, or may include both volatile and nonvolatile types of storage media.

[0289] In the various embodiments of the present application, unless otherwise specified or provided for in any logical conflict, the terms and / or descriptions between the different embodiments are consistent and may be referenced to each other, and the technical features in the different embodiments may be combined to form new embodiments according to their inherent logical relationships.

Claims

1. A communication method, characterized in that: include: receiving a first message, the first message comprising a first random access preamble; Perform downlink transmission, the downlink transmission resources do not include downlink resources within the first window or downlink resources within the first window in the beam direction where the first message is located, the first window includes k time units used by the cell to which the first random access preamble belongs to send a second message, the second message and the first message belong to the same random access process, and k is an integer greater than 0.

2. The method according to claim 1, characterized in that The method is applied to an entity corresponding to a first cell, and the first random access preamble does not belong to a random access preamble of the first cell.

3. The method according to claim 1 or 2, characterized in that: The time domain position of the first window and the time domain position of the first message satisfy a predefined relationship.

4. The method according to claim 3, characterized in that: The second message is a random access response message or a contention resolution message, and the first time unit in the first window is offset by f time units from the time unit where the first random access preamble is located or the time unit where the last symbol of the first random access preamble is located, where f is a predefined integer greater than 0.

5. The method according to claim 1 or 2, characterized in that: The second message is a contention resolution message, the first time unit among the k time units is offset by h time units from the time unit where the random access response message is located or the time unit where the last symbol of the random access response message is located, the random access response message and the second message belong to the same random access process, and h is a predefined integer greater than 0.

6. The method according to claim 5, characterized in that The first time unit in which the cell to which the first random access preamble belongs sends the random access response message is offset by g time units from the time unit in which the first random access preamble is located or the time unit in which the last symbol of the first random access preamble is located, where g is a predefined integer greater than 0.

7. The method according to claim 1 or 2, characterized in that: The first window is a random access response window, and the second message is a random access response message.

8. The method according to claim 1 or 2, characterized in that: The second message is a random access response message, and the first window also includes s time units used by the cell to which the first random access preamble belongs to send a contention resolution message, the contention resolution message and the first message belong to the same random access process, and s is an integer greater than 0.

9. The method according to claim 8, characterized in that The starting position of the first window is offset by t time units from the time unit where the first random access preamble is located or the time unit where the last symbol of the first random access preamble is located, where t is a predefined integer greater than 0, or the starting position of the first window is the first downlink time unit after the cell to which the first random access preamble belongs sends the first message.

10. A communication method, characterized in that: include: receiving a first message, the first message comprising a first random access preamble; A second message is sent within a first window, wherein the second message and the first message belong to the same random access process, a time domain position of the first window and a time domain position of the first message satisfy a predefined relationship, and the second message is a contention resolution message.

11. The method according to claim 10, characterized in that The method further comprises: A random access response message is sent within the first window, where the random access response message and the first message belong to the same random access process.

12. A communication method, characterized in that: include: Sending a first message, wherein the first message includes a first random access preamble; A second message is received, where the second message and the first message belong to the same random access process, the second message is sent by the cell to which the first random access preamble belongs within a first window, the time domain position of the first window and the time domain position of the first message satisfy a predefined relationship, and the second message is a contention resolution message.

13. The method according to claim 12, characterized in that The method further comprises: A random access response message is received, where the random access response message is sent by the cell to which the first random access preamble belongs within the first window, and the random access response message and the first message belong to the same random access process.

14. The method according to any one of claims 10 to 13, characterized in that The first time unit in the first window is offset from the time unit where the first random access preamble is located or the time unit where the last symbol of the first random access preamble is located by f time units, where f is a predefined integer greater than 0.

15. A communication method, characterized in that: include: receiving a first message, the first message comprising a first random access preamble; A second message is sent, where the second message and the first message belong to the same random access process, and the time domain position of the second message satisfies a predefined relationship with the time domain position of the first message. The first time unit used to transmit the second message is offset by y time units from the time unit where the first random access preamble is located or the time unit where the last symbol of the first random access preamble is located, where y is a predefined integer greater than 0.

16. A communication method, characterized in that: include: Sending a first message, wherein the first message includes a first random access preamble; Receive a second message, where the second message and the first message belong to the same random access process, the time domain position of the second message and the time domain position of the first message satisfy a predefined relationship, and the first time unit for transmitting the second message is offset by y time units from the time unit where the first random access preamble is located or the time unit where the last symbol of the first random access preamble is located, where y is a predefined integer greater than 0.

17. A communication device, characterized in that: The method comprises a module for implementing the method of any one of claims 1 to 9, any one of claims 10 to 14, or claim 15, or a module for implementing the method of claim 16.

Images