Communication method and apparatus

Abstract

The present application relates to a communication method and apparatus. The communication method comprises: when failing to receive data from a terminal device in a period of time, such as a first time period, a first node can generate an empty data packet, so that the empty data packet can be sent. That is to say, even if the first node does not have uplink data packet to be reported to the previous-level node of the first node, the first node can still send the empty data packet to the previous-level node of the first node, so that the previous-level node of the first node can send a data packet in time before waiting for the arrival of the data packet of the previous-level node of the first node, for example, the previous-level node sends a data packet to the previous-level node thereof. Therefore, the transmission delay can be reduced, so that the time of processing data by a DU is prolonged, thereby improving the communication performance of all areas covered by a network device.

Description

Communication method and device

[0001] This application claims priority to the Chinese patent application with application number 202311588907.X filed with the State Intellectual Property Office of China on November 25, 2023, and priority to the Chinese patent application with the invention name “A Communication Method and Device”, all contents of which are incorporated by reference into this application. Technical Field

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

[0003] In the fifth generation mobile communication technology (5G), an architecture with separation of centralized units (CU), distributed units (DU) and radio units (RU) is proposed. In this separation architecture, multiple RUs can be used for networking, such as RU cascade networking or RU convergence networking. When such a networking method is adopted, the upper-level RU can receive data packets from the lower-level RU, so that the upper-level RU can first decapsulate the data packet, and then encapsulate the decapsulated data together with the data generated by itself, and finally submit it to the higher-level RU or DU. In other words, the uplink transmission based on RU cascade networking or RU convergence networking may have the problem of insufficient time for DU to process data due to excessive transmission delay. This may affect the communication performance of all areas covered by the network equipment.

[0004] Summary of the Invention

[0005] The present application provides a communication method and apparatus that can reduce transmission delay, thereby increasing the time it takes for a DU to process data, and thereby improving communication performance in all areas covered by network equipment.

[0006] In a first aspect, a communication method is provided. The method can be executed by a first node, or by a module (e.g., a processor, chip, or chip system) applied to the first node, or by a logical node, logical module, or software that implements all or part of the functions of the first node. In this communication method, if no data is received from a terminal device within a first time period, a first data packet can be generated, the first data packet being an empty data packet, and the end time of the first time period being earlier than the latest time at which the first node reports an uplink data packet. Thus, the first data packet can be sent.

[0007] It can be seen that in the above embodiment, the first node can generate an empty data packet when no data is received from the terminal device within a period of time, such as within a first time period, so that an empty data packet can be sent. That is to say, even if the first node has no uplink data to report to the first node's upper-level node, an empty data packet can be sent to the first node's upper-level node. This allows the first node's upper-level node to send a data packet in a timely manner before it waits for the first node's data packet to arrive, such as sending a data packet to a higher-level node. Therefore, this can reduce transmission delay, thereby increasing the time for DU to process data, and thus can improve the communication performance of all areas covered by the network device.

[0008] In a second aspect, a communication method is provided. The method can be executed by a second node, or by a module (such as a processor, chip, or chip system) applied to the second node. It can also be implemented by a logical node, logical module, or software that can implement all or part of the functions of the second node. In this communication method, a first data packet can be received at a first moment. The first moment is earlier than the maximum time that the second node waits for the data packet of the first node to arrive, the first data packet is an empty data packet, and the second node is the upper-level node of the first node. In this way, a second data packet can be sent at a second moment. The second moment is later than the first moment, and the second moment is earlier than the maximum time that the second node waits for the data packet of the first node to arrive.

[0009] It can be seen that in the above embodiment, the upper-level node of the first node, such as the second node, can receive an empty data packet at the first moment, and thus can send the second data packet at the second moment. The first moment is earlier than the maximum time that the second node waits for the data packet from the first node to arrive, the second moment is later than the first moment, and the second moment is earlier than the maximum time that the second node waits for the data packet from the first node to arrive. In other words, the second node can send a data packet in a timely manner, such as sending a data packet to a higher-level node, before it waits for the data packet from the first node to arrive. Therefore, this can reduce transmission delay, thereby increasing the time it takes for the DU to process data, and thus can improve communication performance in all areas covered by the network device.

[0010] In a third aspect, a communication method is provided. The method can be executed by a first node, or by a module (e.g., a processor, a chip, or a chip system) applied to the first node, or by a logical node, a logical module, or software that can implement all or part of the functions of the first node. In this communication method, it can be determined that there is no uplink data to be sent, so that first indication information can be sent. The first indication information is used to indicate that the first node is in an idle state, the first indication information is used to determine second indication information, and the second indication information is used to indicate that the second node is not waiting for a data packet from the first node, and the first node is a next-level node of the second node.

[0011] It can be seen that in the above embodiment, the first node can send a first indication message when there is no uplink data to be sent, so that the DU can know that the first node is in an idle state through the first indication message, and then send a second indication message to the node above the first node, such as the second node, so that the second node can know that it is not waiting for the data packet from the first node. In this way, the second node can send a data packet in time before the data packet it is waiting for from the first node arrives, such as sending a data packet to a node above the first node. Therefore, this can reduce the transmission delay, thereby increasing the time it takes for the DU to process data, and thus improving the communication performance of all areas covered by the network device.

[0012] In combination with the third aspect, optionally, the first node determines that there is no uplink data to be sent, including: when a first condition is met, the first node determines that there is no uplink data to be sent; wherein the first condition includes that no data from the terminal device is detected within a first time period.

[0013] In a fourth aspect, a communication method is provided. The method can be executed by a DU, or by a module applied to the DU (such as a processor, chip, or chip system, etc.), or by a logical node, logic module, or software that can implement all or part of the DU functions. In this communication method, a first indication message can be received, and the first indication message is used to indicate that the first node is in an idle state. Based on the first indication message, a second indication message can be sent, and the second indication message is used to indicate that the second node does not wait for the data packet of the first node, and the second node is the upper-level node of the first node.

[0014] As can be seen in the above embodiment, the DU can use the first indication information to learn that the first node is in an idle state, and can then send a second indication information to the first node's parent node, such as the second node, so that the second node can be informed that it is not waiting for the first node's data packet. In this way, the second node can send the first data packet in a timely manner, such as sending the first data packet to the next parent node, before it is waiting for the data packet from the first node to arrive. Therefore, this can reduce transmission latency, thereby increasing the time the DU takes to process data, and thus improving communication performance in all areas covered by the network device.

[0015] In combination with the fourth aspect, optionally, sending the second indication information based on the first indication information includes: sending the second indication information based on the topology information and the first indication information; the topology information includes the connection relationship between multiple nodes, and the multiple nodes include the first node and the second node.

[0016] As can be seen in the above embodiment, the DU can accurately obtain the first node's upper-level node, such as the second node, through topology information and the first indication information, and can then send the second indication information to the second node, so that the second node can know that it is not waiting for the first node's data packet. In this way, the second node can send the first data packet in a timely manner before it waits for the data packet from the first node to arrive, such as sending the first data packet to the upper-level node. Therefore, this can reduce transmission latency, thereby increasing the time it takes for the DU to process data, and thus improve communication performance in all areas covered by the network device.

[0017] In a fifth aspect, a communication method is provided, which can be executed by a second node, or by a module (such as a processor, chip, or chip system) applied to the second node, or by a logical node, logical module, or software that can implement all or part of the functions of the second node. In this communication method, a second indication message can be received, and the second indication message is used to instruct the second node not to wait for the data packet of the first node, and the second node is the upper-level node of the first node. Thus, the first data packet can be sent at a first moment, and the first moment is earlier than the maximum time when the second node waits for the data packet of the first node to arrive.

[0018] As can be seen in the above embodiment, after the second node learns through the second indication information that it does not wait for the data packet from the first node, it can send the data packet at the first moment. The first moment is earlier than the maximum time the second node can wait for the data packet from the first node to arrive. In other words, the second node can send the first data packet in a timely manner, such as by sending the first data packet to a higher-level node, before it waits for the data packet from the first node to arrive. Therefore, this can reduce transmission latency, thereby increasing the time the DU takes to process data, and thus improving communication performance in all areas covered by the network device.

[0019] In a sixth aspect, a communication method is provided, which can be executed by a first node, or by a module (such as a processor, chip, or chip system, etc.) applied to the first node, or by a logical node, logical module, or software that can implement all or part of the functions of the first node. In this communication method, a first indication message can be sent, and the first indication message is used to indicate that the maximum time at which the first node waits for the data packet of the second node to arrive is earlier than the arrival time of the data packet of the second node, and the first node is the upper-level node of the second node. The first indication message is used to determine the second indication message, and the second indication message is used to indicate that the first node does not wait for the data packet of the second node. Thus, the second indication message can be received. Furthermore, the first data packet can be sent at the first moment, and the first moment is earlier than the maximum time at which the first node waits for the data packet of the second node to arrive.

[0020] As can be seen in the above embodiment, the first node can send a first indication message, so that the DU learns through the first indication message that the maximum time the first node waits for the data packet from the second node to arrive is earlier than the arrival time of the data packet from the second node, and sends a second indication message based on the first indication message, so that the first node learns through the second indication message that it is not waiting for the data packet from the second node. Therefore, the first node can send the first data packet in a timely manner, such as sending the first data packet to a node at a higher level. Therefore, this can reduce transmission latency, thereby increasing the time the DU takes to process data, and thus can improve communication performance in all areas covered by the network device.

[0021] In conjunction with the sixth aspect, optionally, the method further includes: sending third indication information, the third indication information being used to indicate that a maximum time at which the first node waits for a data packet from the second node to arrive is later than an arrival time of the data packet from the second node, the third indication information being used to determine fourth indication information, the fourth indication information being used to instruct the first node to wait for the data packet from the second node, and receiving the fourth indication information.

[0022] As can be seen, in the above embodiment, the first node can send third indication information, so that the DU learns through the third indication information that the maximum time the first node waits for the arrival of the data packet from the second node is later than the arrival time of the data packet from the second node. Based on the third indication information, the first node sends fourth indication information, so that the first node learns through the fourth indication information that it is waiting for the data packet from the second node. In other words, when the first node learns that the maximum time it waits for the arrival of the data packet from the second node is later than the arrival time of the data packet from the second node, it can wait for the data packet from the second node again, thereby reducing data loss and improving transmission reliability.

[0023] In the seventh aspect, a communication method is provided, which can be executed by a DU, or by a module applied to the DU (such as a processor, chip, or chip system, etc.), or by a logical node, logical module, or software that can implement all or part of the DU functions. In this communication method, a first indication message can be received, and the first indication message is used to indicate that the maximum time at which the first node waits for the data packet of the second node to arrive is earlier than the arrival time of the data packet of the second node, and the first node is the upper-level node of the second node. Therefore, based on the first indication message, a second indication message can be sent, and the second indication message is used to indicate that the first node does not wait for the data packet of the second node.

[0024] As can be seen in the above embodiment, the DU can receive the first indication information, so that the DU can learn through the first indication information that the maximum time the first node waits for the data packet from the second node to arrive is earlier than the arrival time of the data packet from the second node. The DU can then send the second indication information based on the first indication information, so that the first node learns through the second indication information that it is not waiting for the data packet from the second node. Therefore, the first node can send the first data packet in a timely manner, such as sending the first data packet to a node at a higher level. This can reduce transmission latency, thereby increasing the time the DU can process data, and thus can improve communication performance in all areas covered by the network device.

[0025] In combination with the seventh aspect, optionally, the method further includes: receiving fifth indication information, the fifth indication information being used to indicate that the maximum time at which the third node waits for the data packet of the fourth node to arrive is earlier than the arrival time of the data packet of the fourth node, and the third node is the upper-level node of the fourth node. Sending second indication information based on the first indication information includes: sending the second indication information based on the topology information, the first indication information, and the fifth indication information. The topology information indicates the connection relationship between multiple nodes, and the multiple nodes include the first node, the second node, the third node, and the fourth node.

[0026] It can be seen that in the above embodiment, the DU can also receive the fifth indication information, so that the DU learns through the fifth indication information that the maximum time that the third node waits for the data packet of the fourth node to arrive is earlier than the arrival time of the data packet of the third node. Therefore, the DU can send the second indication information based on the topology information, the first indication information and the fifth indication information, so that the DU can learn the node with transmission problems at the last level on the link where the first node, the second node, the third node and the fourth node are located, and then send the second indication information to the superior node of the node, such as the first node, so that the first node learns through the second indication information that it does not wait for the data packet of the second node. Therefore, the first node can send the data packet to the node at the next higher level in a timely manner. In this way, the transmission delay can be reduced, thereby increasing the time for the DU to process data, and thus improving the communication performance of all areas covered by the network equipment.

[0027] In conjunction with the seventh aspect, optionally, the method further includes: receiving third indication information, the third indication information being used to indicate that a maximum time at which the first node waits for a data packet from the second node to arrive is later than an arrival time of the data packet from the second node. Based on the third indication information, sending fourth indication information, the fourth indication information being used to instruct the first node to wait for the data packet from the second node.

[0028] As can be seen, in the above embodiment, the DU can receive the third indication information, so that the DU learns through the third indication information that the maximum time at which the first node waits for the arrival of the data packet from the second node is later than the arrival time of the data packet from the second node. The DU then sends the fourth indication information based on the third indication information, so that the first node learns through the fourth indication information that it is waiting for the data packet from the second node. In other words, when the first node learns that the maximum time at which it waits for the arrival of the data packet from the second node is later than the arrival time of the data packet from the second node, it can resume waiting for the data packet from the second node, thereby reducing data loss and thus improving transmission reliability.

[0029] In conjunction with the seventh aspect, optionally, the method further includes: sending sixth indication information. The sixth indication information is used to indicate that there is an abnormality in data transmission of the second node, or the sixth indication information is used to indicate that there is an abnormality in data transmission in an area covered by the first cell. The area covered by the first cell includes an area covered by the second node.

[0030] In an eighth aspect, a communication device is provided, comprising a unit or module for implementing the method as described in any one of the first to seventh aspects.

[0031] In a ninth aspect, a communication device is provided, comprising at least one processor; wherein the at least one processor is configured to execute any of the methods described in any of aspects 1 to 7. The at least one processor can execute a computer program or instructions in a memory to perform the method. The memory can be included in the communication device or can be located externally. The communication device can also include an interface.

[0032] In a tenth aspect, a computer-readable storage medium is provided, wherein the computer-readable storage medium stores computer instructions, and when the computer instructions are executed, the computer executes any one of the methods described in any one of the first to seventh aspects.

[0033] In an eleventh aspect, a computer program product is provided, the computer program product comprising: a computer program code, and when the computer program code is executed by a computer, the computer executes any one of the methods described in any one of the first to seventh aspects.

[0034] In the twelfth aspect, a chip is provided, which includes at least one processor and an interface, the processor is used to read and execute instructions stored in a memory, and when the instructions are executed, the chip executes any method described in any one of the first to seventh aspects. BRIEF DESCRIPTION OF THE DRAWINGS

[0035] FIG1 is a basic architecture of a communication system provided in an embodiment of the present application;

[0036] FIG2 is a schematic diagram of a RU cascade network;

[0037] FIG3 is a schematic diagram of an RU convergence network;

[0038] FIG4 is a flow chart of a communication method provided in an embodiment of the present application;

[0039] FIG5 is a flow chart of another communication method provided in an embodiment of the present application;

[0040] FIG6 is a flow chart of another communication method provided in an embodiment of the present application;

[0041] FIG7 is a schematic diagram of determining a faulty node in a RU cascade network according to an embodiment of the present application;

[0042] FIG8 is a schematic diagram of determining a faulty node in an RU convergence network according to an embodiment of the present application;

[0043] FIG9 is a schematic structural diagram of a communication device provided in an embodiment of the present application;

[0044] FIG10 is a schematic structural diagram of another communication device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0045] The technical solutions in the embodiments of the present application will be described below in conjunction with the accompanying drawings in the embodiments of the present application. In the embodiments of the present application, the terms "system" and "network" can be used interchangeably. Unless otherwise specified, " / " indicates that the objects associated before and after are in an "or" relationship. For example, A / B can represent A or B. "And / or" in this application is only a description of the association relationship of associated objects, indicating that there can be three relationships. For example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone. A and B can be singular or plural. In addition, in the description of this application, unless otherwise specified, "multiple" refers to two or more than two. "At least one of the following" or similar expressions refers to any combination of these items, including any combination of single or plural items. For example, at least one of a, b, or c can represent: a, b, c, ab, ac, bc, or abc, where a, b, c can be one or more. In addition, to facilitate a clear description of the technical solutions of the embodiments of the present application, in the embodiments of the present application, terms such as "first" and "second" are used to distinguish between network elements and identical or similar items with substantially the same functions. Those skilled in the art will understand that terms such as "first" and "second" do not limit the quantity or execution order, and terms such as "first" and "second" do not necessarily limit differences.

[0046] References to "one embodiment" or "some embodiments" in the embodiments of the present application mean that one or more embodiments of the present application include specific features, structures or characteristics described in conjunction with the embodiment. Therefore, the phrases "in one embodiment", "in some embodiments", "in some other embodiments", "in some other embodiments", etc. that appear in different places in this specification do not necessarily refer to the same embodiment, but mean "one or more but not all embodiments", unless otherwise specifically emphasized. The terms "including", "comprising", "having" and their variations all mean "including but not limited to", unless otherwise specifically emphasized.

[0047] The following specific implementation methods further describe in detail the objectives, technical solutions and beneficial effects of the present application. It should be understood that the following are only specific implementation methods of the present application and are not intended to limit the scope of protection of the present application. Any modifications, equivalent replacements, improvements, etc. made on the basis of the technical solutions of the present application should be included in the scope of protection of the present application.

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

[0049] It should be understood that the technical solutions of the embodiments of the present application can be applied to the fifth generation mobile communication technology (5G) and the like. The technical solutions of the embodiments of the present application can also be applied to other future communication systems, such as 6G communication systems. In future communication systems, the functions may remain the same, but the names may change.

[0050] The following describes the infrastructure of the communication system provided by the embodiment of the present application. The communication system provided by the present application may include one or more network devices and one or more terminal devices.

[0051] The following is an illustrative explanation using the system architecture shown in Figure 1. As shown in Figure 1, the communication system includes a network device 10 and one or more terminal devices (such as terminal device 20 in Figure 1) that communicate with the network device 10. It should be noted that the number of network devices and terminal devices in Figure 1 is only illustrative and should not be considered as a specific limitation of this application. The following is a detailed description of each device involved in the system architecture.

[0052] 1. Terminal Equipment

[0053] A terminal device is an entity on the user side that is used to receive signals, or send signals, or both receive and send signals. The terminal device is used to provide one or more of voice services and data connectivity services to the user. The terminal device may be a device that includes wireless transceiver functions and can cooperate with network equipment to provide communication services to the user. Specifically, the terminal device may refer to user equipment (UE), access terminal, user unit, user station, mobile station, mobile station, remote station, remote terminal, mobile device, terminal, wireless communication device, user agent, user device or road side unit (RSU). The terminal device may also be a drone, an Internet of Things (IoT) device, a station (ST) in a wireless local area network (WLAN), a cellular phone, a smart phone, a cordless phone, a wireless data card, a tablet computer, a session initiation protocol (SIP) phone, a wireless local loop (WLL) station, a personal digital assistant (PDA) device, a laptop computer, a machine type communication (MTC) terminal, a handheld device with wireless communication capabilities, a computing device or other processing device connected to a wireless modem, an in-vehicle device, a wearable device (also referred to as a wearable smart device), a virtual reality (VR) terminal, an augmented reality (AR) terminal, a wireless terminal in remote medical care, a wireless terminal in industrial control, a wireless terminal in self-driving, a wireless terminal in a smart grid, a transportation security system, or a similar device. The terminal device may also be a terminal in a 5G system or a terminal in a next-generation communication system, which is not limited in the embodiments of the present application.

[0054] The embodiments of this application do not limit the device form factor of the terminal device. The device used to implement the functions of the terminal device can be the terminal device; it can also be a device that supports the terminal device to implement the functions, such as a chip system. The device can be installed in the terminal device or used in conjunction with the terminal device. In the embodiments of this application, the chip system can be composed of a chip or include a chip and other discrete components.

[0055] 2. Network Equipment

[0056] A network device is an entity on the network side that is used to send signals, receive signals, or both send and receive signals. A network device can be a device deployed in a radio access network (RAN) to provide wireless communication functions for terminal devices.

[0057] In one possible scenario, multiple network devices collaborate to assist terminal devices in achieving wireless access, and different network devices respectively implement part of the functions of a base station. For example, the network devices may include a centralized unit (CU), a distributed unit (DU), a CU-control plane (CP), a CU-user plane (UP), or a radio unit (RU). The CU and DU may be separately configured, or may be included in the same network element, such as a baseband unit (BBU). The RU may be included in a radio frequency device or radio frequency unit, such as a remote radio unit (RRU), an active antenna unit (AAU), or a remote radio head (RRH). It is understood that the network device may be a CU node, a DU node, or a device including a CU node and a DU node. In addition, the CU may be divided into a network device in the access network RAN, or the CU may be divided into a network device in the core network CN, without limitation herein.

[0058] 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 access network (open RAN, O-RAN or 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. For the convenience of description, this application takes CU, CU-CP, CU-UP, DU and RU as examples for description. Any unit of CU (or CU-CP, CU-UP), DU and RU in this application can be implemented by a software module, a hardware module, or a combination of a software module and a hardware module.

[0059] In the embodiments of the present application, the form of the network device is not limited. The device used to implement the function of the network device can be a network device; it can also be a device that can support the network device to implement the function, such as a chip system. The device can be installed in the network device or used in conjunction with the network device.

[0060] In order to facilitate understanding of the contents of this solution, some of the terms involved in the embodiments of this application are explained below to facilitate understanding by those skilled in the art. This part is only for ease of understanding and cannot be regarded as a specific limitation of this application.

[0061] 1. Data Packet

[0062] The data packet may be an operation, administration, and maintenance (OAM) data packet, which can be understood as a data packet on the management plane. Alternatively, the data packet may be a data packet in a radio bearer (RB). For example, the RB may be a data radio bearer (DRB), which can be understood as a data packet on the user plane; or the RB may be a signaling radio bearer (SRB), which can be understood as a data packet on the control plane.

[0063] Generally, a data packet can carry identification information. For example, the packet header can carry this identification information. This identification information is used to identify the type of the data packet. In other words, the identification information can be used to determine whether the data packet is a management plane data packet, a user plane data packet, or a control plane data packet, etc. The specific method of distinguishing is not limited.

[0064] The identification information may be one or more of a cell identifier or a time unit identifier. The cell identifier may be one or more of a cell global identifier (CGI) or a physical cell identifier (PCI) of a candidate cell. The time unit may be one or more of a frame, a subframe, a time slot, or a symbol. Optionally, the time unit identifier may also be described as an index of the time unit or a number of the time unit, which is not limited here.

[0065] 2. Multi-RU distributed cells

[0066] A multi-RU distributed cell refers to a cell whose signal covers multiple areas through multiple RUs, where one RU can cover at least one area.

[0067] Generally, multiple RUs can cover multiple areas through RU cascading networking or RU aggregation networking.

[0068] In the case of a cascaded RU network, it may include a DU and at least one RU. At least one RU has a superior-subordinate relationship. As shown in Figure 2, a Level 1 RU is the upper-level node of a Level 2 RU, a Level 2 RU is the upper-level node of a Level 3 RU, and a Level 3 RU is the upper-level node of a Level 4 RU. In other words, a Level 2 RU is the lower-level node of a Level 1 RU, a Level 3 RU is the lower-level node of a Level 2 RU, and a Level 4 RU is the lower-level node of a Level 3 RU. This application does not limit the description method.

[0069] In the case of RU aggregation networking, it can include DU, at least one RU, and at least one fronthaul aggregation device. The fronthaul aggregation device in this application can be a fronthaul aggregation multiplexer (FHM) or other modules that have the function of aggregating multiple fronthaul signals. It is understood that this application uses the FHM for description, but does not limit the specific module name of the fronthaul aggregation device.

[0070] Optionally, at least one RU and at least one FHM may have a hierarchical relationship. As shown in Figure 3 , the level 1 convergence FHM is the upper-level node of the branch 1-1 level RU and the branch 2-1 level RU, and the branch 2-1 level RU is the upper-level node of the branch 2-2 level RU. Alternatively, the branch 1-1 level RU and the branch 2-1 level RU are the lower-level nodes of the level 1 convergence FHM, and the branch 2-2 level RU is the lower-level node of the branch 2-1 level. This application does not limit the description method. Optionally, at least one RU may contain RUs at the same level, or at least one RU may not contain RUs at the same level. RUs at the same level do not directly communicate with each other. As shown in Figure 3 , the branch 1-1 level RU and the branch 2-1 level RU may be RUs at the same level. Optionally, at least one FHM may contain FHMs at the same level, or at least one FHM may not contain FHMs at the same level. FHMs at the same level do not directly communicate with each other.

[0071] It should be understood that in the case of RU cascade networking or RU convergence networking, uplink transmission and / or downlink transmission can be performed. This solution mainly introduces the uplink transmission scenario. The following describes the uplink transmission scenarios of RU cascade networking and RU convergence networking respectively with reference to Figures 2 and 3. In Figures 2 and 3, the arrow direction indicates the uplink transmission direction.

[0072] Generally, for data packets that are data packets on the management plane, in RU cascade networking or RU convergence networking, RU or FHM is used for transparent transmission. For example, in Figure 2, the level 4 RU can send a data packet to the level 3 RU, and the data packet is a data packet on the management plane. After the level 3 RU receives the data packet from the level 4 RU, it can deliver the data packet to the level 2 RU. After the level 2 RU receives the data packet from the level 3 RU, it can deliver the data packet to the level 1 RU. After the level 1 RU receives the data packet from the level 2 RU, it can deliver the data packet to the DU. As another example, in Figure 3, the branch 1-1 level RU can send a data packet to the level 1 convergence FHM, and the data packet is a data packet on the management plane. After the level 1 convergence FHM receives the data packet from the branch 1-1 level RU, it can deliver the data packet to the DU.

[0073] For data packets that are user-plane data packets or control-plane data packets, in RU cascade networking or RU convergence networking, the RU or FHM can have the function of data processing and / or data transmission. In this case, after receiving the data packet from the RU of the next level, the RU of the upper level can decapsulate the data packet, and then encapsulate the decapsulated data with the data generated by itself, and finally submit it to the RU, FHM or DU of the next level. In addition, in the RU convergence networking, the FHM of the upper level can also decapsulate the data packet after receiving the data packet from the RU or FHM of the next level, and then encapsulate the decapsulated data with the data generated by itself, and finally submit it to the FHM or DU of the next level. That is to say, for the former, the RU of the upper level needs to wait for the data packet from the RU of the next level; for the latter, the FHM of the upper level needs to wait for the data packet from the RU or FHM of the next level. For ease of description, the RU of the previous level can be referred to as the previous level node, and the RU of the next level can be referred to as the next level node; or, the FHM of the previous level can be referred to as the previous level node, and the RU or FHM of the next level can be referred to as the next level node. The time that the previous level node waits for the data packet of the next level node can be referred to as the maximum waiting time. For example, at the end of the maximum waiting time (which can also be described as the maximum time that the previous level node waits for the data packet of the next level node to arrive), the previous level node has not received the data packet of the next level node, and the previous level node gives up waiting for the data packet of the next level node and submits the data generated by itself to the node at the next level.

[0074] It should be pointed out that at least one of any RU in the RU cascade network, any RU in the RU convergence network, or FHM, etc., can be set with a maximum waiting time. Optionally, the last-level RU in the RU cascade network may not be set with a maximum waiting time. Similarly, the last-level RU on any link in the RU convergence network may not be set with a maximum waiting time. The link here refers to the link between the DU and the last-level RU. As shown in Figure 3, there can be a link between DU->1-level convergence FHM->branch 1-1-level RU, and the last-level RU is the branch 1-1-level RU; there can be a link between DU->1-level convergence FHM->branch 2-1-level RU->branch 2-2-level RU, and the last-level RU is the branch 2-2-level RU.

[0075] Optionally, the maximum waiting times of different RUs in a cascaded RU network can be the same or different. In a converged RU network, the maximum waiting times of different RUs can be the same or different, and the maximum waiting times of different FHMs can be the same or different. Optionally, the maximum waiting times of RUs and FHMs in a converged RU network can be the same or different, without limitation.

[0076] The embodiments of the present application are described in detail below. Specifically, the terminal device involved in the following text may be the terminal device involved in Figure 1, and the node involved in the following text may be the RU or DU in Figures 1, 2 and 3, or the FHM in Figure 3, etc. It should be pointed out that the message name or the name of each parameter in the message involved in the following embodiments is only an example, and other names may also be used in the specific implementation. The embodiments of the present application do not specifically limit this. In addition, in the following embodiments, uninterpreted data packets can be understood as data packets in the RB.

[0077] As shown in FIG4 , a communication method is provided in an embodiment of the present application, which includes but is not limited to the following steps:

[0078] 401. When no data is received from the terminal device within the first time period, the first node generates a first data packet, which is an empty data packet. The end time of the first time period is earlier than the latest time when the first node reports an uplink data packet.

[0079] Optionally, the first time period is a predefined or (pre) configured time period, such as the first time period is indicated by the DU to the first node. Optionally, the duration of the first time period may be greater than 0, such as 500 milliseconds (ms). This application does not limit the length of the first time period.

[0080] The data from the terminal device in step 401 may include user plane data and / or control plane data. Optionally, the failure to receive data from the terminal device within the first time period may be understood as one of the following:

[0081] 1. No data from the terminal device is detected during multiple first time periods. For example, the first time period is 500ms. If no data from the terminal device is detected during the first 500ms, the second 500ms, and the third 500ms, then it can be determined that no data from the terminal device is detected during the first time period.

[0082] Optionally, multiple first time periods are associated with each other. For example, after a first time period ends, another time period may begin. In other words, the end time of a first time period is earlier than the start time of another time period.

[0083] 2. The number of first time periods in which no data is detected among the multiple first time periods is greater than the number of first time periods in which data is detected. For example, suppose there are 10 first time periods in total, 8 of which do not detect data from the terminal device, while 2 do detect data from the terminal device. In this case, it can be considered that no data from the terminal device was detected during the first time period.

[0084] Optionally, the above-described method 2 can also be understood as: the ratio of the number of first time periods in which no data is detected in the multiple first time periods to the number of first time periods in which data is detected in the multiple first time periods is greater than or equal to a first ratio, or the ratio of the number of first time periods in which no data is detected in the multiple first time periods to the total number of first time periods is greater than or equal to a second ratio. Of course, other description methods are also possible and are not limited here.

[0085] It should be noted that a certain ratio (such as the first ratio or the second ratio, etc.) mentioned in this application may be a predefined or preconfigured value, such as the ratio indicated by the DU to the first node, etc. This application does not limit the size of the ratio.

[0086] In one possible implementation, the first time period may be less than the maximum time period that the first node waits for a data packet from the third node to arrive. The third node is a node that is a next-level node of the first node. That is, if there is a next-level node of the first node (such as a third node) on the link where the first node is located, the first time period may be less than the maximum time period that the first node waits for a data packet from the third node to arrive. In this case, the latest time that the first node reports an uplink data packet is earlier than or equal to the maximum time that the first node waits for a data packet from the third node to arrive.

[0087] Optionally, the payload length of the first data packet is 0 or the payload is empty. In other words, the first data packet does not include uplink user plane data and / or uplink control plane data.

[0088] Optionally, the first data packet may further carry identification information. For example, the header of the first data packet may carry identification information. For details about the identification information, please refer to the above description and will not be elaborated here.

[0089] 402. The second node receives a first data packet at a first time. The first time is earlier than the maximum time the second node waits for the data packet from the first node to arrive. The second node is an upper-level node of the first node.

[0090] Correspondingly, the first node sends a first data packet.

[0091] Optionally, the second node receiving the first data packet at the first moment may include: the second node receiving the first data packet from the first node at the first moment. That is, the first node sends the first data packet to the second node.

[0092] 403. The second node sends a second data packet at a second time. The second time is later than the first time, and earlier than the maximum time that the second node waits for the data packet from the first node to arrive.

[0093] Correspondingly, the third node receives the second data packet. In one possible embodiment, the third node is the upper-level node of the second node. For example, the third node is an RU, the second node is an RU, and the first node is an RU; or, the third node is an FHM, the second node is an RU, and the first node is an RU; or, the third node is an FHM, the second node is an FHM, and the first node is an RU. In this case, the third node can decapsulate the second data packet, then encapsulate the decapsulated data together with the data generated by itself, and finally submit it to the upper-level RU, FHM, or DU. In another possible embodiment, the third node is a DU, the second node is an RU, and the first node is an RU; or, the third node is a DU, the second node is an FHM, and the first node is an RU; or, the third node is a DU, the second node is an FHM, and the first node is an FHM. In this case, the third node can decapsulate the second data packet.

[0094] The above only gives some examples of the third node, the second node and the first node. There are other combinations, which are not limited here.

[0095] Optionally, step 403 may include: the second node sending the second data packet to the third node at the second moment, that is, the third node receives the second data packet from the second node.

[0096] Optionally, the second moment is earlier than the maximum time that the second node waits for the data packet from the first node to arrive. This can also be described as: the second moment is earlier than the end time of the maximum waiting time of the second node. The maximum waiting time of the second node is the maximum time that the second node waits for the data packet from the first node to arrive. This application does not limit the description of this method.

[0097] As can be seen in the above embodiment, even if the first node has no uplink data to report to its parent node, it can still send an empty data packet to the parent node. This allows the parent node to promptly send a data packet to the higher-level node before waiting for the first node's data packet to arrive. Therefore, this can reduce transmission latency, thereby increasing the time it takes for the DU to process data, and thus improving communication performance in all areas covered by the network device.

[0098] As shown in FIG5 , another communication method provided in an embodiment of the present application includes but is not limited to the following steps:

[0099] 501. The first node determines that there is no uplink data to be sent.

[0100] The uplink data may include uplink user plane data and / or uplink control plane data.

[0101] Optionally, the first node determines that there is no uplink data to be sent, including: when a first condition is met, the first node determines that there is no uplink data to be sent, and the first condition includes that no data from the terminal device is detected within a first time period.

[0102] Optionally, the first time period is a predefined or (pre) configured time period, such as the first time period is indicated by the DU to the first node. Optionally, the duration of the first time period may be greater than 0, such as 500 milliseconds (ms). This application does not limit the length of the first time period.

[0103] Optionally, the fact that no data from the terminal device is detected within the first time period may be understood as one of the following:

[0104] 1. No data from the terminal device is detected during multiple first time periods. For example, the first time period is 500ms. If no data from the terminal device is detected during the first 500ms, the second 500ms, and the third 500ms, then it can be determined that no data from the terminal device is detected during the first time period.

[0105] Optionally, multiple first time periods are associated with each other. For example, after a first time period ends, another time period may begin. In other words, the end time of a first time period is earlier than the start time of another time period.

[0106] 2. The number of first time periods in which no data is detected among the multiple first time periods is greater than the number of first time periods in which data is detected. For example, suppose there are 10 first time periods in total, 8 of which do not detect data from the terminal device, while 2 do detect data from the terminal device. In this case, it can be considered that no data from the terminal device was detected during the first time period.

[0107] Optionally, the above-described method 2 can also be understood as: the ratio of the number of first time periods in which no data is detected in the multiple first time periods to the number of first time periods in which data is detected in the multiple first time periods is greater than or equal to a first ratio, or the ratio of the number of first time periods in which no data is detected in the multiple first time periods to the total number of first time periods is greater than or equal to a second ratio. Of course, other description methods are also possible and are not limited here.

[0108] Optionally, the first ratio may be a predefined or preconfigured value, such as the first ratio indicated by the DU to the first node. The second ratio may be a predefined or preconfigured value, such as the second ratio indicated by the DU to the first node. This application does not limit the values ​​of the first ratio and the second ratio.

[0109] 502. The DU receives first indication information. The first indication information is used to indicate that the first node is in an idle state.

[0110] Correspondingly, the first node sends first indication information.

[0111] Optionally, step 502 may include: the DU receives first indication information from the first node. That is, the first node sends the first indication information to the DU.

[0112] It should be pointed out that the indication information mentioned in this application (such as the first indication information, etc.) can be understood as a data packet on the management plane. That is to say, assuming that there are other nodes between the destination node and the source node, the other nodes are used to transparently transmit the data packet on the management plane. The destination node here refers to the destination node that receives the data packet on the management plane. The source node refers to the source node that generates the data packet on the management plane. Exemplarily, the destination node can refer to the DU, the source node can refer to the first node, and the other nodes can refer to the second node. That is, the transmission path of the first indication information is: first node -> second node -> DU. The second node forwards the first indication information.

[0113] Optionally, the first indication information is used to indicate that the first node is in an idle state, which can also be understood as: the first indication information is used to indicate that the first node has no uplink data to report.

[0114] Optionally, the first indication information may include identification information of the first node. The identification information of the first node may be an Internet Protocol (IP) address. Alternatively, the identification information of the first node may be an IP address and a port number.

[0115] 503. The DU sends second indication information based on the first indication information. The second indication information is used to instruct the second node not to wait for the data packet of the first node. The second node is the upper-level node of the first node.

[0116] Correspondingly, the second node receives the second indication information.

[0117] Optionally, step 503 may include: DU sends second indication information based on the topology information and the first indication information. The topology information includes the connection relationship between multiple nodes, and the multiple nodes include a first node and a second node. It should be noted that the connection relationship between the nodes mentioned in the embodiments of the present application includes a direct connection and / or an indirect connection. The "connection" does not limit the nodes to a physical connection or a logical connection. Communication is established directly between two directly connected nodes, and communication between two indirectly connected nodes needs to rely on other nodes for forwarding, which is indirect communication.

[0118] Optionally, the first indication information may include the identification information of the first node. In this case, the DU sends the second indication information based on the topology information and the first indication information. This can be understood as follows: the DU can determine a second node that is a node higher than the first node based on the topology information and the identification information of the first node, and send the second indication information to the second node. In other words, the second node can receive the second indication information from the DU.

[0119] 504. The second node sends a first data packet at a first time. The first time is earlier than the maximum time the second node waits for the data packet from the first node to arrive.

[0120] Correspondingly, the third node receives the first data packet. In one possible embodiment, the third node is the upper-level node of the second node. For example, the third node is an RU, the second node is an RU, and the first node is an RU; or, the third node is an FHM, the second node is an RU, and the first node is an RU; or, the third node is an FHM, the second node is an FHM, and the first node is an RU. In this case, the third node can decapsulate the first data packet, then encapsulate the decapsulated data together with the data generated by itself, and finally submit it to the upper-level RU, FHM, or DU. In another possible embodiment, the third node is a DU, the second node is an RU, and the first node is an RU; or, the third node is a DU, the second node is an FHM, and the first node is an RU; or, the third node is a DU, the second node is an FHM, and the first node is an FHM. In this case, the third node can decapsulate the first data packet.

[0121] The above only gives some examples of the third node, the second node and the first node. There are other combinations, which are not limited here.

[0122] Optionally, step 504 may include: the second node sending a first data packet to the third node at the first moment, that is, the third node receives the first data packet from the second node.

[0123] Optionally, the first moment being earlier than the maximum time the second node waits for the first node's data packet to arrive can also be described as: the first moment being earlier than the end time of the second node's maximum waiting time. The second node's maximum waiting time is the maximum time the second node waits for the first node's data packet to arrive. This application does not limit the manner in which this description is used.

[0124] It can be seen that in the above embodiment, the first node can send a first indication message when there is no uplink data to be sent, so that the DU can know that the first node is in an idle state through the first indication message, and then send a second indication message to the node above the first node, such as the second node, so that the second node can know that it is not waiting for the data packet from the first node. In this way, the second node can send the first data packet to the node above it in a timely manner before the data packet from the first node arrives. Therefore, this can reduce the transmission delay, thereby increasing the time it takes for the DU to process data, and thus improving the communication performance of all areas covered by the network device.

[0125] As shown in FIG6 , another communication method provided in an embodiment of the present application includes but is not limited to the following steps:

[0126] 601. A first node sends first indication information. The first indication information is used to indicate that the maximum time the first node waits for a data packet from a second node to arrive is earlier than the arrival time of the data packet from the second node, and the first node is an upper-level node of the second node.

[0127] Correspondingly, the DU receives the first indication information.

[0128] Optionally, step 601 may include: the first node sends first indication information to the DU. That is, the DU receives the first indication information from the first node.

[0129] Optionally, the first indication information may include identification information of the first node. The identification information of the first node may be an IP address. Alternatively, the identification information of the first node may be an IP address and a port number.

[0130] Optionally, before step 601, the first node may further count the number of times the first node obtained a data packet from the second node and / or the number of times the first node failed to obtain a data packet from the second node within the first time period before the maximum time the first node waited for the data packet from the second node to arrive. In this way, the first node can determine, based on the number of times the first node obtained a data packet from the second node and / or the number of times the first node failed to obtain a data packet from the second node, that the maximum time the first node waited for the data packet from the second node to arrive is earlier than the arrival time of the data packet from the second node. For example, if the number of times the first node obtained a data packet from the second node is less than or equal to the first number, it can be considered that the maximum time the first node waited for the data packet from the second node to arrive is earlier than the arrival time of the data packet from the second node. Alternatively, if the number of times the first node failed to obtain a data packet from the second node is greater than or equal to the second number, it can be considered that the maximum time the first node waited for the data packet from the second node to arrive is earlier than the arrival time of the data packet from the second node. Alternatively, if the ratio of the number of times the first node obtained a data packet from the second node to the number of times the first node failed to obtain a data packet from the second node is greater than or equal to the first ratio, it can be considered that the maximum time the first node waited for the data packet from the second node to arrive is earlier than the arrival time of the data packet from the second node. Alternatively, if the number of times the first node acquires data packets from the second node is less than the number of times the first node fails to acquire data packets from the second node, it can be considered that the maximum time the first node waits for the data packet from the second node to arrive is earlier than the arrival time of the data packet from the second node. These are just some examples, and there are other implementations that are not listed here.

[0131] Optionally, the first time period is a predefined or (pre)configured time period, e.g., the first time period is indicated to the first node by the DU. Optionally, the duration of the first time period may be greater than 0. For example, the first time period may include at least one maximum waiting time, where the maximum waiting time is the maximum time the first node waits for a data packet from the second node to arrive. This application does not impose any restrictions on the duration of the first time period.

[0132] Optionally, the first number may be a predefined or preconfigured value, such as the first number indicated by the DU to the first node. The second number may be a predefined or preconfigured value, such as the second number indicated by the DU to the first node. This application does not limit the values ​​of the first number and the second number.

[0133] 602. The DU sends second indication information based on the first indication information. The second indication information is used to instruct the first node not to wait for the data packet from the second node.

[0134] Correspondingly, the first node receives the second indication information.

[0135] Optionally, the DU may also receive fifth indication information. For example, the DU receives fifth indication information from a third node, etc. The fifth indication information is used to indicate that the maximum time that the third node waits for the data packet of the fourth node to arrive is earlier than the arrival time of the data packet of the fourth node, and the third node is the upper-level node of the fourth node. Optionally, the fifth indication information may include identification information of the third node. The identification information of the third node may be an IP address. Or, the identification information of the third node may be an IP address and a port number. In this case, step 602 may include: the DU sends the second indication information based on the topology information, the first indication information and the fifth indication information. The topology information indicates the connection relationship between multiple nodes, and the multiple nodes include a first node, a second node, a third node and a fourth node.

[0136] The following describes the process of "a DU sending second indication information" using specific examples. For example, as shown in Figures 7 or 8, the DU can learn from the first indication information that the maximum time the first node can wait for the second node's data packet to arrive is earlier than the arrival time of the second node's data packet. Simultaneously, the DU can learn from the fifth indication information that the maximum time the third node can wait for the fourth node's data packet to arrive is earlier than the arrival time of the fourth node's data packet. Therefore, based on the topology information, the first indication information, and the fifth indication information, the DU determines that the first, second, third, and fourth nodes are located on the same link, and that the last node on this link with a transmission failure is the second node. Therefore, the DU sends the second indication information to the first node, the node immediately above the second node. In other words, because the second node did not send a data packet at the latest time it reported its data packet, the first node was unable to obtain the second node's data packet before the maximum time it had to wait for the second node's data packet to arrive. This is likely to result in the first node not sending a data packet at the latest time it reported its data packet, which in turn causes the fourth node not to send a data packet at the latest time it reported its data packet, and consequently, the third node was unable to obtain the fourth node's data packet before the maximum time it had to wait for the fourth node's data packet to arrive. Therefore, if the first node is instructed not to wait for the data packet from the second node, the first node can send the data packet to the fourth node in a timely manner, which in turn can enable the fourth node to send the data packet to the third node in a timely manner. This can reduce transmission latency, thereby increasing the time it takes for the DU to process data, and thus improving communication performance in all areas covered by the network device.

[0137] It should be pointed out that the way in which the third node determines that the maximum time when the third node waits for the data packet of the fourth node to arrive is earlier than the arrival time of the data packet of the fourth node can refer to the above-mentioned process in which the first node determines that the maximum time when the first node waits for the data packet of the second node to arrive is earlier than the arrival time of the data packet of the second node, and it will not be repeated here.

[0138] 603. The first node sends a first data packet at a first time. The first time is earlier than the maximum time the first node waits for the data packet from the second node to arrive.

[0139] Accordingly, the fifth node receives the first data packet. In one possible implementation, the fifth node is a node one level above the first node. Optionally, the fifth node and the fourth node may be the same node or different nodes.

[0140] Optionally, step 603 may include: the first node sending the first data packet to the fifth node at the first moment, that is, the fifth node receiving the first data packet from the first node.

[0141] Optionally, the first moment being earlier than the maximum time the first node waits for a data packet from the second node to arrive can also be described as: the first moment being earlier than the end time of the maximum waiting time for the first node. The maximum waiting time for the second node is the maximum time the first node waits for a data packet from the second node to arrive. This application does not limit the description of this.

[0142] As can be seen in the above embodiment, the first node can send a first indication message, so that the DU learns through the first indication message that the maximum time the first node waits for the second node's data packet to arrive is earlier than the arrival time of the second node's data packet. Based on the first indication message, the first node sends a second indication message, so that the first node learns through the second indication message that it is not waiting for the second node's data packet. Therefore, the first node can send data packets to the node at the next higher level in a timely manner. Therefore, this can reduce transmission latency, thereby increasing the time the DU takes to process data, and thus improving communication performance in all areas covered by the network device.

[0143] Optionally, in the embodiment shown in FIG6 , the method may further include: the DU receives third indication information, the third indication information being used to indicate that the maximum time at which the first node waits for the data packet from the second node to arrive is later than the arrival time of the data packet from the second node. Based on the third indication information, the DU sends fourth indication information, the fourth indication information being used to indicate that the first node waits for the data packet from the second node. In other words, when the first node learns that the maximum time at which it waits for the data packet from the second node to arrive is later than the arrival time of the data packet from the second node, it may wait for the data packet from the second node again, thereby reducing the possibility of data loss and thus improving transmission reliability.

[0144] The DU receiving the third indication information may include: the DU receiving the third indication information from the first node. That is, the first node sends the third indication information to the DU. Optionally, the third indication information may include identification information of the first node.

[0145] Optionally, the DU sending the fourth indication information based on the third indication information may include: the DU sending the fourth indication information based on the topology information and the third indication information. For example, the DU sends the fourth indication information to the first node. That is, the first node receives the fourth indication information from the DU.

[0146] Optionally, in the embodiment shown in FIG6 , the method may further include: the DU sending sixth indication information. For example, the DU sending the sixth indication information to the network management device. The sixth indication information is used to indicate that a data transmission anomaly exists at the second node, or the sixth indication information is used to indicate that a data transmission anomaly exists in an area covered by the first cell. The area covered by the first cell includes an area covered by the second node.

[0147] It should be noted that the embodiment shown in Figure 6 is an exemplary implementation. In the case of RU convergence networking, there may be transmission failures at nodes on different links (such as RUs or FHMs). This problem can still be solved using a method similar to that shown in Figure 6. The specific process is not repeated here.

[0148] It is understandable that, in order to implement the above functions, the above-mentioned device includes a hardware structure and / or software module for executing each function. It should be easily appreciated by those skilled in the art that, in combination with the units and algorithm steps of each example described in the embodiments disclosed herein, the present application can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is executed in the form of hardware or computer software driving hardware depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application. The embodiment of the present application can divide the nodes (such as the first node, the second node, etc.) or DU into functional modules according to the above method examples. For example, each functional module can be divided corresponding to each function, or two or more functions can be integrated into one processing module. The above-mentioned integrated module can be implemented in the form of hardware or in the form of software functional modules. It should be noted that the division of modules in the embodiment of the present application is schematic and is only a logical function division. There may be other division methods in actual implementation.

[0149] Refer to Figure 9, which is a structural diagram of a communication device provided in an embodiment of the present application. The communication device 900 can be applied to the method shown in any of the embodiments in Figures 4 to 6 above. As shown in Figure 9, the communication device 900 includes: a processing module 901 and a transceiver module 902. The processing module 901 can be one or more processors, and the transceiver module 902 can be a transceiver or a communication interface. The communication device can be used to implement the functions of the nodes (such as the first node, the second node, etc.) or DUs involved in any of the above method embodiments, or to implement the functions of the network elements involved in any of the above method embodiments. The network element or network function can be a network element in a hardware device, a software function running on dedicated hardware, or a virtualization function instantiated on a platform (for example, a cloud platform). Optionally, the communication device 900 can also include a storage module 903 for storing program code and data of the communication device 900.

[0150] In one embodiment, when the communication device acts as a node (such as a first node, a second node, etc.) or is a chip applied to a node (such as a first node, a second node, etc.), and executes the steps performed by the node (such as a first node, a second node, etc.) in the above method embodiment. The transceiver module 902 is used to specifically execute the sending and / or receiving actions performed by the node (such as a first node, a second node, etc.) in any embodiment of Figures 4 to 6, for example, to support the node (such as a first node, a second node, etc.) to execute other processes of the technology described herein. The processing module 901 can be used to support the communication device 900 to execute the processing actions in the above method embodiment, for example, to support the node (such as a first node, a second node, etc.) to execute other processes of the technology described herein.

[0151] Exemplarily, the processing module 901 is used to generate a first data packet when no data is received from the terminal device within a first time period; the first data packet is an empty data packet, and the end time of the first time period is earlier than the latest time when the first node reports the uplink data packet; the transceiver module 902 is used to send the first data packet.

[0152] Also illustratively, the transceiver module 902 is used to: receive a first data packet at a first moment; the first moment is earlier than the maximum moment that the second node waits for the data packet from the first node to arrive, the first data packet is an empty data packet, and the second node is the upper-level node of the first node; send a second data packet at a second moment; the second moment is later than the first moment, and the second moment is earlier than the maximum moment that the second node waits for the data packet from the first node to arrive.

[0153] Exemplarily, the processing module 901 is used to determine that there is no uplink data to be sent; the transceiver module 902 is used to send a first indication message, the first indication message is used to indicate that the first node is in an idle state, the first indication message is used to determine a second indication message, the second indication message is used to indicate that the second node is not waiting for the data packet of the first node, and the first node is the next-level node of the second node.

[0154] Also exemplarily, the transceiver module 902 is used to: receive a second indication message, the second indication message is used to indicate that the second node does not wait for the data packet from the first node, the second node being the upper-level node of the first node; and send a first data packet at a first moment, the first moment being earlier than the maximum moment at which the second node waits for the data packet from the first node to arrive.

[0155] As another example, the transceiver module 902 is used to: send a first indication message, the first indication message is used to indicate that the maximum time when the first node waits for the data packet of the second node to arrive is earlier than the arrival time of the data packet of the second node, and the first node is the upper-level node of the second node; the first indication message is used to determine the second indication message, the second indication message is used to indicate that the first node does not wait for the data packet of the second node; receive the second indication message; at a first moment, send the first data packet, and the first moment is earlier than the maximum time when the first node waits for the data packet of the second node to arrive.

[0156] Optionally, the transceiver module 902 is also used to: send a third indication message, the third indication message is used to indicate that the maximum time when the first node waits for the data packet of the second node to arrive is later than the arrival time of the data packet of the second node; the third indication message is used to determine a fourth indication message, the fourth indication message is used to indicate that the first node waits for the data packet of the second node; and receive the fourth indication message.

[0157] In another example, when the communication device functions as a DU or a chip used in a DU, and executes the steps performed by the DU in the above-described method embodiments, the transceiver module 902 is configured to specifically execute the sending and / or receiving actions performed by the DU in any of the embodiments shown in Figures 4 to 6 , such as supporting the DU in executing other processes related to the technology described herein. The processing module 901 may be configured to support the communication device 900 in executing the processing actions described in the above-described method embodiments, such as supporting the DU in executing other processes related to the technology described herein.

[0158] Exemplarily, the transceiver module 902 is used to: receive first indication information, the first indication information is used to indicate that the first node is in an idle state; based on the first indication information, send second indication information, the second indication information is used to indicate that the second node does not wait for the data packet of the first node, and the second node is the upper-level node of the first node.

[0159] Optionally, when sending the second indication information based on the first indication information, the transceiver module 902 is used to send the second indication information based on the topology information and the first indication information; the topology information includes the connection relationship between multiple nodes, and the multiple nodes include a first node and a second node.

[0160] Also exemplarily, the transceiver module 902 is used to: receive a first indication message, the first indication message is used to indicate that the maximum time when the first node waits for the data packet of the second node to arrive is earlier than the arrival time of the data packet of the second node, and the first node is the upper-level node of the second node; based on the first indication message, send a second indication message, the second indication message is used to indicate that the first node does not wait for the data packet of the second node.

[0161] Optionally, the transceiver module 902 is also used to receive fifth indication information, where the fifth indication information is used to indicate that the maximum time that the third node waits for the data packet of the fourth node to arrive is earlier than the arrival time of the data packet of the fourth node, and the third node is the upper-level node of the fourth node; when sending the second indication information based on the first indication information, the transceiver module 902 is used to send the second indication information based on the topology information, the first indication information and the fifth indication information; the topology information indicates the connection relationship between multiple nodes, and the multiple nodes include the first node, the second node, the third node and the fourth node.

[0162] Optionally, the transceiver module 902 is also used to: receive a third indication message, the third indication message is used to indicate that the maximum time when the first node waits for the data packet of the second node to arrive is later than the arrival time of the data packet of the second node; based on the third indication message, send a fourth indication message, the fourth indication message is used to indicate that the first node waits for the data packet of the second node.

[0163] Optionally, the transceiver module 902 is also used to: send a sixth indication message, the sixth indication message is used to indicate that there is an abnormality in the data transmission of the second node, or the sixth indication message is used to indicate that there is an abnormality in the data transmission in the area covered by the first cell, and the area covered by the first cell includes the area covered by the second node.

[0164] In one possible embodiment, when the node (such as the first node, the second node, etc.) or the DU is a chip, the transceiver module 902 can be a communication interface, a pin, or a circuit. The communication interface can be used to input data to be processed into the processor and can output the processing results of the processor to the outside. In a specific implementation, the communication interface can be a general purpose input and output (GPIO) interface, which can be connected to multiple peripheral devices (such as a display (LCD), a camera (camera), a radio frequency (RF) module, an antenna, etc.). The communication interface is connected to the processor via a bus.

[0165] The processing module 901 can be a processor that can execute computer-executable instructions stored in the storage module to cause the chip to perform the method involved in any of the embodiments shown in Figures 4 to 6. Furthermore, the processor can include a controller, an arithmetic unit, and registers. For example, the controller is primarily responsible for decoding instructions and issuing control signals for operations corresponding to the instructions. The arithmetic unit is primarily responsible for performing fixed-point or floating-point arithmetic operations, shift operations, and logical operations, and can also perform address operations and conversions. The registers are primarily responsible for storing register operands and intermediate operation results temporarily stored during instruction execution. In a specific implementation, the processor hardware architecture can be an ASIC architecture, a microprocessor without interlocked piped stages architecture (MIPS) architecture, an advanced RISC machine (ARM) architecture, or a network processor (NP) architecture, etc. The processor can be single-core or multi-core. The storage module can be a storage module within the chip, such as a register or cache. The storage module may also be a storage module located outside the chip, such as a ROM or other type of static storage device capable of storing static information and instructions, RAM, etc. It should be noted that the functions corresponding to the processor and the interface may be implemented through hardware design, software design, or a combination of hardware and software, and this is not limited here.

[0166] Figure 10 is a schematic diagram of the structure of another communication device provided in an embodiment of the present application. It is understandable that the communication device 1010 includes necessary means such as modules, units, elements, circuits, or interfaces, which are appropriately configured together to implement this solution. The communication device 1010 can be the above-mentioned node (such as the first node, the second node, etc.) or DU, or it can be a component (such as a chip) in these devices to implement the method described in the above-mentioned method embodiment. The communication device 1010 includes one or more processors 1011. The processor 1011 can be a general-purpose processor or a dedicated processor, etc. For example, it can be a baseband processor or a central processing unit. The baseband processor can be used to process the communication protocol and communication data, and the central processing unit can be used to control the communication device (such as the above-mentioned node (such as the first node, the second node, etc.), DU, or chip, etc.), execute the software program, and process the data of the software program.

[0167] Optionally, in one design, the processor 1011 may include a program 1013 (sometimes also referred to as code or instruction), and the program 1013 may be run on the processor 1011, so that the communication device 1010 performs the method described in the above embodiment. In another possible design, the communication device 1010 includes a circuit (not shown in Figure 10), which is used to implement the functions of the above-mentioned nodes (such as the first node, the second node, etc.) or DU in the above embodiment. Optionally, the communication device 1010 may include one or more memories 1012, on which a program 1014 (sometimes also referred to as code or instruction) is stored, and the program 1014 can be run on the processor 1011, so that the communication device 1010 performs the method described in the above method embodiment.

[0168] Optionally, data may also be stored in the processor 1011 and / or the memory 1012. The processor and the memory may be provided separately or integrated together. Optionally, the communication device 1010 may further include a transceiver 1015 and / or an antenna 1016. The processor 1011 may sometimes also be referred to as a processing unit, which controls the communication device (e.g., the above-mentioned node (e.g., the first node, the second node, etc.) or the DU). The transceiver 1015 may sometimes also be referred to as a transceiver unit, a transceiver, a transceiver circuit, or a transceiver, etc., and is used to implement the transceiver function of the communication device through the antenna 1016.

[0169] An embodiment of the present application further provides a communication device, comprising at least one processor; wherein the at least one processor is configured to execute any one of the methods described in any one of the embodiments in FIG. 4 to FIG. 6 .

[0170] An embodiment of the present application further provides a computer-readable storage medium, which stores computer instructions. When the computer instructions are executed, the computer executes any method described in any of the embodiments in Figures 3, 7, 8 and 9.

[0171] An embodiment of the present application further provides a computer program product, which includes: a computer program code, and when the computer program code is executed by a computer, the computer executes the method described in any one of the embodiments shown in Figures 3, 7, 8 and 9.

[0172] An embodiment of the present application also provides a chip, which includes at least one processor and an interface, wherein the processor is used to read and execute instructions stored in a memory, and when the instructions are executed, the chip executes any method described in any of the embodiments in Figures 3, 7, 8 and 9.

[0173] The units described above as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed across multiple network units. Some or all of the units may be selected according to actual needs to achieve the objectives of the embodiments of the present application. In addition, the network element units in the various embodiments of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated units may be implemented in the form of hardware or in the form of software network element units.

[0174] If the above-mentioned integrated unit is implemented in the form of a software network element unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the part that essentially contributes to the technical solution of the present application, or all or part of the technical solution can be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for enabling a computer device (which can be a personal computer, terminal device, cloud server, or network device, etc.) to perform all or part of the steps of the above-mentioned methods in each embodiment of the present application. The aforementioned storage medium includes various media that can store program code, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk. The above is only a specific embodiment of the present application, but the scope of protection of the present application is not limited thereto. Any person skilled in the art can easily think of various equivalent modifications or replacements within the technical scope disclosed in the present application, and these modifications or replacements should be included in the scope of protection of the present application. Therefore, the scope of protection of the present application shall be based on the scope of protection of the claims.

Claims

1. A communication method, characterized in that: Applied to the first node, the method comprises: If no data is received from the terminal device within a first time period, a first data packet is generated; the first data packet is an empty data packet, and the end time of the first time period is earlier than the latest time when the first node reports an uplink data packet; The first data packet is sent.

2. A communication method, characterized in that: Applied to the second node, the method comprises: At a first moment, receiving a first data packet; the first moment is earlier than a maximum moment at which the second node waits for a data packet from the first node to arrive, the first data packet is an empty data packet, and the second node is an upper-level node of the first node; At a second moment, a second data packet is sent; the second moment is later than the first moment, and the second moment is earlier than the maximum time that the second node waits for the data packet from the first node to arrive.

3. A communication method, characterized in that: Applied to the first node, the method comprises: Determine that there is no uplink data to be sent; Sending first indication information, wherein the first indication information is used to indicate that the first node is in an idle state, the first indication information is used to determine second indication information, the second indication information is used to indicate that the second node does not wait for a data packet from the first node, and the first node is a next-level node of the second node.

4. A communication method, characterized in that: Applied to a distributed unit DU, the method comprises: receiving first indication information, where the first indication information is used to indicate that the first node is in an idle state; Based on the first indication information, second indication information is sent, where the second indication information is used to instruct a second node not to wait for a data packet from the first node, and the second node is an upper-level node of the first node.

5. The method according to claim 4, characterized in that The sending second indication information based on the first indication information includes: Sending the second indication information based on the topology information and the first indication information; The topology information includes connection relationships between multiple nodes, and the multiple nodes include the first node and the second node.

6. A communication method, characterized in that: Applied to the second node, the method comprises: receiving second indication information, where the second indication information is used to instruct the second node not to wait for a data packet from the first node, and the second node is an upper-level node of the first node; At a first time, a first data packet is sent, and the first time is earlier than a maximum time that the second node waits for the data packet of the first node to arrive.

7. A communication method, characterized in that: Applied to the first node, the method comprises: Sending first indication information, where the first indication information is used to indicate that the maximum time at which the first node waits for a data packet from the second node to arrive is earlier than the arrival time of the data packet from the second node, and the first node is an upper-level node of the second node; the first indication information is used to determine second indication information, where the second indication information is used to indicate that the first node does not wait for the data packet from the second node; receiving the second indication information; At a first time, a first data packet is sent, and the first time is earlier than a maximum time that the first node waits for the data packet of the second node to arrive.

8. The method according to claim 7, characterized in that The method further comprises: Sending third indication information, wherein the third indication information is used to indicate that the maximum time when the first node waits for the data packet of the second node to arrive is later than the arrival time of the data packet of the second node; the third indication information is used to determine fourth indication information, wherein the fourth indication information is used to indicate that the first node waits for the data packet of the second node; The fourth indication information is received.

9. A communication method, characterized in that: Applied to a distributed unit DU, the method comprises: Receive first indication information, where the first indication information is used to indicate that a maximum time at which the first node waits for a data packet of the second node to arrive is earlier than an arrival time of the data packet of the second node, and the first node is an upper-level node of the second node; Based on the first indication information, second indication information is sent, where the second indication information is used to instruct the first node not to wait for the data packet of the second node.

10. The method according to claim 9, characterized in that The method further comprises: Receive fifth indication information, where the fifth indication information is used to indicate that the maximum time at which the third node waits for a data packet of the fourth node to arrive is earlier than the arrival time of the data packet of the fourth node, and the third node is an upper-level node of the fourth node; Sending second indication information based on the first indication information includes: Sending the second indication information based on the topology information, the first indication information and the fifth indication information; The topology information indicates a connection relationship between a plurality of nodes, where the plurality of nodes include the first node, the second node, the third node, and the fourth node.

11. The method according to claim 9 or 10, characterized in that: The method further comprises: receiving third indication information, wherein the third indication information is used to indicate that the maximum time when the first node waits for the data packet of the second node to arrive is later than the arrival time of the data packet of the second node; Based on the third indication information, fourth indication information is sent, where the fourth indication information is used to instruct the first node to wait for the data packet of the second node.

12. The method according to any one of claims 9 to 11, characterized in that: The method further comprises: Send sixth indication information, where the sixth indication information is used to indicate that there is an abnormality in the data transmission of the second node, or the sixth indication information is used to indicate that there is an abnormality in the data transmission in the area covered by the first cell, and the area covered by the first cell includes the area covered by the second node.

13. A communication device, characterized in that: The method comprises a unit or a module for implementing the method according to any one of claims 1 to 12.

14. A communication device, characterized in that: The communication device comprises at least one processor; wherein the at least one processor is configured to execute the method according to any one of claims 1 to 12.

15. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer instructions, which, when executed, cause the computer to perform the method according to any one of claims 1 to 12.

16. A computer program product, characterized in that The computer program product comprises: a computer program code, and when the computer program code is executed by a computer, the computer is caused to perform the method according to any one of claims 1 to 12.

17. A chip, characterized in that: The chip includes at least one processor and an interface, wherein the processor is used to read and execute instructions stored in a memory, and when the instructions are executed, the chip executes the method according to any one of claims 1 to 12.

Images