Communication method and device

Abstract

The invention relates to a communication method and device, in the communication method, a first node can generate an empty data packet during a period of time, such as when data from terminal equipment is not received within a first time period, so that the empty data packet can be sent. Namely, even if the first node does not have uplink data to be reported to the upper-level node of the first node, the null data packet can be sent to the upper-level node of the first node, so that the upper-level node of the first node can send the data packet in time before waiting for the arrival of the data packet of the first node; for example, a data packet is sent to a node of a higher level. Therefore, the transmission delay can be reduced, so that the time for processing the data by the DU is prolonged, and the communication performance of all areas covered by the network equipment can be improved.

Description

Technical Field

[0001] This application relates to the field of communication technologies, and in particular, to a communication method and apparatus. Background Art

[0002] In the 5th generation mobile networks (5G), an architecture with separation of the central unit (CU), distributed unit (DU), and radio unit (RU) is proposed. In such a separated architecture, multiple RUs can be used for networking, such as RU cascade networking or RU aggregation networking. In the case of using such a networking method, the upper-level RU can receive data packets from the lower-level RU, so that the data packets can be first unpacked, and then the unpacked data and the data generated by itself are encapsulated together, and finally delivered to a higher-level RU or DU, etc. That is to say, in the uplink transmission based on RU cascade networking or RU aggregation networking, there may be a problem that the time for the DU to process data is insufficient due to excessive transmission delay. This may affect the communication performance of all areas covered by the network device. Summary of the Invention

[0003] This application provides a communication method and apparatus, which can reduce the transmission delay, thereby increasing the time for the DU to process data, and further improving the communication performance of all areas covered by the network device.

[0004] In a first aspect, a communication method is provided. This method 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, when no data from the terminal device is received 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 for the first node to report an uplink data packet. Thus, the first data packet can be sent.

[0005] It can be seen that in the above embodiment, when the first node does not receive data from the terminal device within a period of time, such as the first time period, an empty data packet can be generated, so that the empty data packet can be sent. That is to say, even if the first node has no uplink data to report to the upper-level node of the first node, an empty data packet can be sent to the upper-level node of the first node, so that the upper-level node of the first node can send a data packet in time before waiting for the data packet of the first node to arrive, such as sending a data packet to a higher-level node. Therefore, this can reduce the transmission delay, thereby increasing the time for the DU to process data, and further improving the communication performance of all areas covered by the network device.

[0006] In a second aspect, a communication method is provided. This method can be executed by a second node, or by a module applied to the second node (such as a processor, a chip, or a chip system, etc.), or can also be implemented by a logical node, a logical module, or software that can implement all or part of the functions of the second node. In this communication method, at a first moment, a first data packet is received. The first moment is earlier than the maximum moment when 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, at a second moment, a second data packet is sent. The second moment is later than the first moment and earlier than the maximum moment when the second node waits for the data packet of the first node to arrive.

[0007] It can be seen that in the above embodiments, 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 a second data packet at the second moment. Among them, the first moment is earlier than the maximum moment when the second node waits for the data packet of the first node to arrive, the second moment is later than the first moment, and the second moment is earlier than the maximum moment when the second node waits for the data packet of the first node to arrive. That is to say, the second node can send a data packet in time before waiting for the data packet of the first node to arrive, such as sending a data packet to a higher-level node. Therefore, this can reduce the transmission delay, thereby increasing the time for the DU to process data, and further improving the communication performance of all areas covered by the network device.

[0008] In a third aspect, a communication method is provided. This method can be executed by a first node, or by a module applied to the first node (such as a processor, a chip, or a chip system, etc.), or can also be implemented 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, and thus a first indication message can be sent. 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, and the second indication message is used to indicate that the second node does not wait for the data packet of the first node. The first node is the lower-level node of the second node.

[0009] It can be seen that in the above embodiments, when there is no uplink data to be sent, the first node can send the first indication information, enabling the DU to learn from the first indication information that the first node is in an idle state. Subsequently, the DU can send the second indication information to the upper-level node of the first node, such as the second node, allowing the second node to know not to wait for the data packet of the first node. In this way, the second node can send a data packet, such as sending a data packet to a higher-level node, in a timely manner before waiting for the data packet of the first node to arrive. Therefore, this can reduce the transmission delay, thereby increasing the time for the DU to process data, and further improving the communication performance of all areas covered by the network device.

[0010] In combination with the third aspect, optionally, the first node determines that there is no uplink data to be sent, including: when the 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 the first time period.

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

[0012] It can be seen that in the above embodiments, the DU can learn from the first indication information that the first node is in an idle state. Subsequently, the DU can send the second indication information to the upper-level node of the first node, such as the second node, allowing the second node to know not to wait for the data packet of the first node. In this way, the second node can send the first data packet, such as sending the first data packet to a higher-level node, in a timely manner before waiting for the data packet of the first node to arrive. Therefore, this can reduce the transmission delay, thereby increasing the time for the DU to process data, and further improving the communication performance of all areas covered by the network device.

[0013] 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 relationships between multiple nodes, and the multiple nodes include the first node and the second node.

[0014] It can be seen that in the above embodiments, the DU can accurately obtain the upper-level node of the first node, such as the second node, through the topology information and the first indication information, and then can send the second indication information to the second node, so that the second node can know not to wait for the data packet of the first node. In this way, the second node can send the first data packet in time before waiting for the data packet of the first node to arrive, such as sending the first data packet to a higher-level node. Therefore, this can reduce the transmission delay, thereby increasing the time for the DU to process data, and further improving the communication performance of all areas covered by the network device.

[0015] In a fifth aspect, a communication method is provided. This method can be executed by the second node, or by a module (such as a processor, a chip, or a chip system, etc.) applied to the second node, or by a logical node, a logical module, or software that can implement all or part of the functions of the second node. In this communication method, the second indication information can be received. The second indication information is used to indicate that the second node does not wait for the data packet of the first node. 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 moment when the second node waits for the data packet of the first node to arrive.

[0016] It can be seen that in the above embodiments, after the second node can know not to wait for the data packet of the first node through the second indication information, it can send the data packet at the first moment. Among them, the first moment is earlier than the maximum moment when the second node waits for the data packet of the first node to arrive. That is to say, the second node can send the first data packet in time before waiting for the data packet of the first node to arrive, such as sending the first data packet to a higher-level node. Therefore, this can reduce the transmission delay, thereby increasing the time for the DU to process data, and further improving the communication performance of all areas covered by the network device.

[0017] In a sixth aspect, a communication method is provided. This method can be executed by the first node, or by a module (such as a processor, a chip, or a chip system, etc.) 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, the first indication information can be sent. The first indication information is used to indicate that the maximum moment when the first node waits for the data packet of the second node to arrive is earlier than the arrival moment of the data packet of the second node. The first node is the upper-level node of the second node. The first indication information is used to determine the second indication information, and the second indication information is used to indicate that the first node does not wait for the data packet of the second node. Thus, the second indication information can be received. Further, the first data packet can be sent at the first moment, and the first moment is earlier than the maximum moment when the first node waits for the data packet of the second node to arrive.

[0018] It can be seen that in the above embodiments, the first node can send first indication information, so that the DU can learn from the first indication information that the maximum time for the first node to wait for the arrival of the data packet of the second node is earlier than the arrival time of the data packet of the second node, and based on the first indication information, send second indication information, so that the first node can learn from the second indication information not to wait for the data packet of 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 higher-level node. Therefore, this can reduce the transmission delay, thereby increasing the time for the DU to process data, and further improving the communication performance of all areas covered by the network device.

[0019] In combination with the sixth aspect, optionally, the method further includes: sending third indication information, where the third indication information is used to indicate that the maximum time for the first node to wait for the arrival of the data packet of the second node is later than the arrival time of the data packet of the second node, and the third indication information is used to determine fourth indication information, where the fourth indication information is used to indicate that the first node waits for the data packet of the second node. Receiving the fourth indication information.

[0020] It can be seen that in the above embodiments, the first node can send third indication information, so that the DU can learn from the third indication information that the maximum time for the first node to wait for the arrival of the data packet of the second node is later than the arrival time of the data packet of the second node, and based on the third indication information, send fourth indication information, so that the first node can learn from the fourth indication information to wait for the data packet of the second node. That is to say, when the first node learns that the maximum time for it to wait for the arrival of the data packet of the second node is later than the arrival time of the data packet of the second node, it can re-wait for the data packet of the second node, reducing the situation of data loss, thereby improving the transmission reliability.

[0021] In a seventh aspect, a communication method is provided. This method can be executed by the DU, or by a module applied to the DU (such as a processor, a chip, or a chip system, etc.), or by a logical node, a logical module, or software that can implement all or part of the DU functions. In this communication method, first indication information can be received, where the first indication information is used to indicate that the maximum time for the first node to wait for the arrival of the data packet of the second node 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. Thus, based on the first indication information, second indication information can be sent, where the second indication information is used to indicate that the first node does not wait for the data packet of the second node.

[0022] It can be seen that in the above embodiments, the DU can receive the first indication information, so that the DU learns from the first indication information that the maximum time for the first node to wait for the arrival of the data packet of the second node is earlier than the arrival time of the data packet of the second node, and based on the first indication information, sends the second indication information, so that the first node learns from the second indication information not to wait for the data packet of 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 higher-level node. This can reduce the transmission delay, thereby increasing the time for the DU to process data, and further improving the communication performance of all areas covered by the network device.

[0023] Combined with the seventh aspect, optionally, the method further includes: receiving fifth indication information, where the fifth indication information is used to indicate that the maximum time for the third node to wait for the arrival of the data packet of the fourth node 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. Based on the first indication information, sending the second 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.

[0024] It can be seen that in the above embodiments, the DU can also receive the fifth indication information, so that the DU learns from the fifth indication information that the maximum time for the third node to wait for the arrival of the data packet of the fourth node 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. In this way, the DU can learn the node with the last transmission problem 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 upper-level node of this node, such as the first node, so that the first node learns from the second indication information not to wait for the data packet of the second node. Therefore, the first node can send the data packet to a higher-level node in a timely manner. In this way, the transmission delay can be reduced, thereby increasing the time for the DU to process data, and further improving the communication performance of all areas covered by the network device.

[0025] Combined with the seventh aspect, optionally, the method further includes: receiving third indication information, where the third indication information is used to indicate that the maximum time for the first node to wait for the arrival of the data packet of the second node is later than the arrival time of the data packet of the second node. Based on the third indication information, sending fourth indication information, where the fourth indication information is used to indicate that the first node waits for the data packet of the second node.

[0026] It can be seen that in the above embodiments, the DU can receive the third indication information, so that the DU learns through the third indication information that the maximum time for the first node to wait for the data packet of the second node to arrive is later than the arrival time of the data packet of the second node, and 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 of the second node. That is to say, when the first node learns that the maximum time for it to wait for the data packet of the second node to arrive is later than the arrival time of the data packet of the second node, it can wait for the data packet of the second node again, reducing the situation of data loss, thereby improving the transmission reliability.

[0027] In combination with the seventh aspect, optionally, the method further includes: sending a sixth indication information. 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. The area covered by the first cell includes the area covered by the second node.

[0028] In an eighth aspect, a communication device is provided, including units or modules for implementing the method according to any one of the first aspect to the seventh aspect.

[0029] In a ninth aspect, a communication device is provided. The communication device includes at least one processor; wherein, the at least one processor is used to execute the method according to any one of the first aspect to the seventh aspect. The at least one processor can execute computer programs or instructions in the memory to cause the above method to be executed. The memory can be included in the communication device or located outside the communication device. In addition, the communication device can further include an interface.

[0030] In a tenth aspect, a computer-readable storage medium is provided. The computer-readable storage medium stores computer instructions, and when the computer instructions are executed, the computer is caused to execute the method according to any one of the first aspect to the seventh aspect.

[0031] In an eleventh aspect, a computer program product is provided. The computer program product includes: computer program code, and when the computer program code is run by a computer, the computer is caused to execute the method according to any one of the first aspect to the seventh aspect.

[0032] In a twelfth aspect, a chip is provided. The chip includes at least one processor and an interface. The processor is used to read and execute instructions stored in the memory, and when the instructions are run, the chip is caused to execute the method according to any one of the first aspect to the seventh aspect. Description of the Drawings

[0033] Figure 1 It is the infrastructure of a communication system provided by an embodiment of the present application;

[0034] Figure 2 It is a schematic diagram of RU cascade networking;

[0035] Figure 3 It is a schematic diagram of RU aggregation networking;

[0036] Figure 4 It is a schematic flow chart of a communication method provided by an embodiment of the present application;

[0037] Figure 5 It is a schematic flow chart of another communication method provided by an embodiment of the present application;

[0038] Figure 6 It is a schematic flow chart of another communication method provided by an embodiment of the present application;

[0039] Figure 7 It is a schematic diagram for determining a faulty node in RU cascade networking provided by an embodiment of the present application;

[0040] Figure 8 It is a schematic diagram for determining a faulty node in RU aggregation networking provided by an embodiment of the present application;

[0041] Figure 9 It is a schematic structural diagram of a communication device provided by an embodiment of the present application;

[0042] Figure 10 It is a schematic structural diagram of another communication device provided by an embodiment of the present application. Detailed implementation manners

[0043] The following will describe the technical solutions in the embodiments of the present application in conjunction with the accompanying drawings in the embodiments of the present application. Among them, the terms "system" and "network" in the embodiments of the present application can be used interchangeably. Unless otherwise specified, " / " means that the objects associated before and after are in an "or" relationship. For example, A / B can mean A or B; "and / or" in the present application is only a description of the association relationship of the associated objects, indicating that there can be three relationships. For example, A and / or B can mean: A exists alone, A and B exist simultaneously, and B exists alone. These three situations, where A and B can be singular or plural. And, in the description of the present application, unless otherwise specified, "a plurality" means two or more than two. "At least one (item)" or its similar expression below refers to any combination of these items, including any combination of single item (item) or plural items (items). For example, at least one (item) of a, b, or c can mean: a, b, c, a - b, a - c, b - c, or a - b - c, where a, b, c can be one or multiple. In addition, in order to clearly describe the technical solutions in the embodiments of the present application, in the embodiments of the present application, terms such as "first" and "second" are used to distinguish the same items or similar items with basically the same functions of network elements. Those skilled in the art can understand that terms such as "first" and "second" do not limit the quantity and execution order, and terms such as "first" and "second" do not necessarily limit to be different.

[0044] The reference to "one embodiment" or "some embodiments" etc. described in the embodiments of the present application means that a specific feature, structure, or characteristic described in conjunction with the embodiment is included in one or more embodiments of the present application. Thus, the statements "in one embodiment", "in some embodiments", "in other some embodiments", "in still other embodiments", etc. that appear in different places in this specification do not necessarily all refer to the same embodiment, but mean "one or more but not all embodiments", unless otherwise specifically emphasized in another way. The terms "include", "comprise", "have" and their variants all mean "including but not limited to", unless otherwise specifically emphasized in another way.

[0045] The following specific implementation manners further elaborate on the objectives, technical solutions, and beneficial effects of the present application. It should be understood that the following is only the specific implementation manner of the present application and is not used to limit the protection scope 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 protection scope of the present application.

[0046] In various embodiments of the present application, if there is no special indication and logical conflict, the terms and / or descriptions between different embodiments are consistent and can be referenced to each other, and the technical features in different embodiments can be combined to form new embodiments according to their internal logical relationships.

[0047] 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), etc. The technical solutions of the embodiments of the present application can also be applied to other future communication systems, such as 6G communication systems, etc. In future communication systems, the functions may remain the same, but the names may change.

[0048] The following introduces the infrastructure of the communication system provided by the embodiments 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.

[0049] The following takes Figure 1 the shown system architecture as an example for explanation. As Figure 1 shown, the communication system includes a network device 10 and one or more terminal devices (such as the terminal device 20 in Figure 1 ) that communicate with the network device 10. It should be noted that Figure 1 the numbers of network devices and terminal devices in

[0050] I. Terminal Device

[0051] A terminal device is an entity on the user side that is used to receive signals, or transmit signals, or receive and transmit signals. The terminal device is used to provide one or more of voice services and data connectivity services to users. The terminal device can be a device that includes wireless transceiver functions and can cooperate with network devices to provide communication services to users. Specifically, the terminal device can refer to user equipment (UE), access terminal, user unit, user station, mobile station, mobile terminal, remote station, remote terminal, mobile device, terminal, wireless communication device, user agent, user device, or roadside unit (RSU). The terminal device can 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 functions, a computing device, or other processing devices connected to a wireless modem, an in-vehicle device, a wearable device (which can also be called a wearable intelligent device), a virtual reality (VR) terminal, an augmented reality (AR) terminal, a wireless terminal in remote medical, a wireless terminal in industrial control, a wireless terminal in self-driving, a wireless terminal in a smart grid, a wireless terminal in transportation safety, a wireless terminal in a smart city, a wireless terminal in a smart home, etc. The terminal device can 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 this application.

[0052] Embodiments of this application do not limit the form of the terminal device. The device for implementing the functions of the terminal device may be the terminal device; or it may be a device capable of supporting the terminal device to implement such functions, such as a chip system. This device may be installed in the terminal device or used in combination with the terminal device. In embodiments of this application, the chip system may be composed of chips or may include chips and other discrete devices.

[0053] II. Network Device

[0054] A network device is an entity on the network side for sending signals, or receiving signals, or sending and receiving signals. A network device may be a device deployed in a radio access network (RAN) to provide wireless communication functions for a terminal device.

[0055] In a possible scenario, multiple network devices cooperate to assist a terminal device in achieving wireless access, and different network devices respectively implement some functions of a base station. For example, a network device may include a central unit (CU), a distributed unit (DU), a CU-control plane (CP), a CU-user plane (UP), or a radio unit (RU), etc. The CU and the DU may be set separately or may also be included in the same network element, such as a baseband unit (BBU). The RU may be included in a radio frequency device or a radio frequency unit, such as included in a remote radio unit (RRU), an active antenna unit (AAU), or a remote radio head (RRH). It can be understood that the network device may be a CU node, or a DU node, or a device including a CU node and a DU node. In addition, the CU may be classified as a network device in the access network RAN or the CU may be classified as a network device in the core network CN, which is not limited herein.

[0056] In different systems, the 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 RAN (O-RAN or ORAN) system, the CU may also be referred to as O-CU (open CU), the DU may also be referred to as O-DU, the CU-CP may also be referred to as O-CU-CP, the CU-UP may also be referred to as O-CU-UP, and the RU may also be referred to as O-RU. For ease of description, in this application, the CU, CU-CP, CU-UP, DU, and RU are used as examples for description. Any one of the CU (or CU-CP, CU-UP), DU, and RU in this application may be implemented by a software module, a hardware module, or a combination of a software module and a hardware module.

[0057] In the embodiments of this application, the form of the network device is not limited. The device for implementing the functions of the network device may be the network device; or it may be a device capable of supporting the network device to implement such functions, such as a chip system. This device may be installed in the network device or used in matching with the network device.

[0058] To facilitate understanding of the content of this solution, some terms involved in the embodiments of this application are further explained below, so as 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 to this application.

[0059] 1. Data packet

[0060] The data packet may be an operation, administration, and maintenance (OAM) data packet. It can be understood that the data packet is a data packet on the management plane. Or, the data packet may be a data packet in a radio bearer (RB). For example, the RB may be a data radio bearer (DRB), and it can be understood that the data packet is a data packet on the user plane; or the RB may be a signaling radio bearer (SRB), and it can be understood that the data packet is a data packet on the control plane.

[0061] Generally, the data packet may carry identification information. For example, the packet header of the data packet may carry such identification information. This identification information is used to identify the type of the data packet. That is to say, through the identification information, it can be known whether the data packet is a data packet on the management plane, a data packet on the user plane, or a data packet on the control plane, etc. The specific differentiation method is not limited.

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

[0063] 2. Multi-RU Distributed Cell

[0064] A multi-RU distributed cell means that the signal of the cell covers multiple areas through multiple RUs. Among them, one RU can cover at least one area.

[0065] Generally, multiple RUs covering multiple areas can be achieved through RU cascade networking or RU aggregation networking.

[0066] In the case of RU cascade networking, it may include a DU and at least one RU. There is a superior-subordinate relationship among at least one RU. For example Figure 2 in, the 1st-level RU is the upper-level node of the 2nd-level RU, the 2nd-level RU is the upper-level node of the 3rd-level RU, and the 3rd-level RU is the upper-level node of the 4th-level RU. It can also be said that the 2nd-level RU is the lower-level node of the 1st-level RU, the 3rd-level RU is the lower-level node of the 2nd-level RU, and the 4th-level RU is the lower-level node of the 3rd-level RU. The description method of this application is not limited.

[0067] In the case of RU aggregation networking, it may include a DU, at least one RU, and at least one fronthaul aggregation device. The fronthaul aggregation device in this application may be a fronthaul multiplexer (FHM), or other modules with the function of aggregating multiple fronthaul signals. It can be understood that in this application, it is described with an FHM, but the specific module name of the fronthaul aggregation device is not limited.

[0068] Optionally, there may be a superior-subordinate relationship between at least one of at least one RU and at least one FHM, etc. For example Figure 3In it, the level-1 aggregation FHM is the upper-level node of branch 1-1-level RUs and branch 2-1-level RUs, and the branch 2-1-level RU is the upper-level node of branch 2-2-level RUs. It can also be said that branch 1-1-level RUs and branch 2-1-level RUs are the lower-level nodes of the level-1 aggregation FHM, and branch 2-2-level RUs are the lower-level nodes of branch 2-1-level RUs. The description method of this application is not limited. Optionally, there may be RUs at the same level in at least one RU, and there may also be no RUs at the same level in at least one RU. Among them, there is no direct communication between RUs at the same level. As Figure 3 In it, branch 1-1-level RUs and branch 2-1-level RUs may be RUs at the same level. Optionally, there may be FHMs at the same level in at least one FHM, and there may also be no FHMs at the same level in at least one FHM. Among them, there is no direct communication between FHMs at the same level.

[0069] It should be understood that in the case of RU cascade networking or RU aggregation networking, uplink transmission and / or downlink transmission can be performed. This solution mainly introduces the scenario of uplink transmission. The following combines Figure 2 and Figure 3 to illustrate the uplink transmission scenarios of RU cascade networking and RU aggregation networking respectively. Among them, in Figure 2 and Figure 3 the arrow direction is the uplink transmission direction.

[0070] Generally, for data packets on the management plane, in RU cascade networking or RU aggregation networking, RUs or FHMs are used for transparent transmission. Exemplarily, in Figure 2 a level-4 RU can send a data packet to a level-3 RU, and this data packet is a data packet on the management plane. After receiving the data packet from the level-4 RU, the level-3 RU can deliver this data packet to the level-2 RU. After receiving the data packet from the level-3 RU, the level-2 RU can deliver this data packet to the level-1 RU. After receiving the data packet from the level-2 RU, the level-1 RU can deliver this data packet to the DU. Another example is that in Figure 3 a branch 1-1-level RU can send a data packet to a level-1 aggregation FHM, and this data packet is a data packet on the management plane. After receiving the data packet from the branch 1-1-level RU, the level-1 aggregation FHM can deliver this data packet to the DU.

[0071] For data packets that are user-plane data packets or control-plane data packets, in RU cascaded networking or RU aggregation networking, the RU or FHM may have the function of data processing and / or data transmission. In this case, after receiving a data packet from a lower-level RU, the upper-level RU can de-encapsulate the data packet, then encapsulate the de-encapsulated data together with the data generated by itself, and finally deliver it to a higher-level RU, FHM, or DU. Additionally, in RU aggregation networking, after receiving a data packet from a lower-level RU or FHM, the upper-level FHM can also de-encapsulate the data packet, then encapsulate the de-encapsulated data together with the data generated by itself, and finally deliver it to a higher-level FHM or DU. That is to say, for the former, the upper-level RU needs to wait for the data packet from the lower-level RU; for the latter, the upper-level FHM needs to wait for the data packet from the lower-level RU or FHM. For ease of description, here the upper-level RU can be referred to as the upper-level node, and the lower-level RU as the lower-level node; or, the upper-level FHM can be referred to as the upper-level node, and the lower-level RU or FHM as the lower-level node. The time for the upper-level node to wait for the data packet from the lower-level node can be called the maximum waiting time. For example, at the end moment of the maximum waiting time (which can also be described as the maximum moment for the upper-level node to wait for the data packet from the lower-level node) when the upper-level node does not receive the data packet from the lower-level node, the upper-level node gives up waiting for the data packet from the lower-level node and delivers the data generated by itself to a higher-level node.

[0072] It should be noted that at least one of any RU in RU cascaded networking, any RU or FHM in RU aggregation networking, etc. can be set with a maximum waiting time. Optionally, the last-level RU in RU cascaded networking can not be set with a maximum waiting time. Similarly, the last-level RU on any link in RU aggregation networking can not be set with a maximum waiting time. Here, the link refers to the link between the DU and the last-level RU. For example Figure 3 in, there can be a link between DU -> 1-level aggregated 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 aggregated FHM -> branch 2-1-level RU -> branch 2-2-level RU, and the last-level RU is the branch 2-2-level RU.

[0073] Optionally, the maximum waiting times of different RUs in RU cascaded networking can be the same or different. The maximum waiting times of different RUs in RU aggregation networking 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 RU aggregation networking can be the same or different, without limitation.

[0074] The embodiments of the present application will be introduced in detail below. Specifically, the terminal device involved hereinafter may be Figure 1 the terminal device involved, and the node involved hereinafter may be Figure 1 、 Figure 2 and Figure 3 the RU or DU in Figure 3 or the FHM in

[0075] It should be noted that the message names or the names of each parameter in the message involved in the following embodiments are only examples, and in specific implementations, they may also be other names. The embodiments of the present application do not make specific limitations on this. In addition, in the following embodiments, the data packets that are not explained can all be understood as the data packets in the RB.

[0075] As Figure 4 shown, a communication method provided by an embodiment of the present application includes but is not limited to the following steps:

[0076] 401. When no data from the terminal device is received within the first time period, the first node generates a first data packet, and the first data packet is an empty data packet. The end time of the first time period is earlier than the latest time for the first node to report the uplink data packet.

[0077] Optionally, the first time period is a predefined or (pre)configured time period. For example, 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). The present application does not limit the magnitude of the duration of the first time period.

[0078] Among them, the data of the terminal device in step 401 may include user plane data and / or control plane data. Optionally, not receiving data from the terminal device within the first time period can be understood as one of the following:

[0079] 1. No data from the terminal device is detected in multiple first time periods. For example, the first time period is 500 ms. No data from the terminal device is detected in the first 500 ms; no data from the terminal device is detected in the second 500 ms; no data from the terminal device is detected in the third 500 ms. In this way, it can be considered that no data from the terminal device is detected within the first time period.

[0080] Optionally, there is an association relationship between multiple first time periods. For example, after one first time period ends, another time period can start. That is to say, the end time of one first time period is earlier than the start time of another time period.

[0081] 2. The number of the first time periods in which no data is detected among multiple first time periods is greater than the number of the first time periods in which data is detected among multiple first time periods. For example, assuming there are a total of 10 first time periods, data from the terminal device is not detected in 8 first time periods, and data from the terminal device is detected in 2 first time periods. In this way, it can be considered that no data from the terminal device is detected within the first time period.

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

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

[0084] In a possible implementation manner, the first time period can be less than the maximum time period for the first node to wait for the data packet of the third node to arrive. The third node is the next-level node of the first node. That is, when there is a next-level node (such as the third node, etc.) of the first node on the link where the first node is located, the first time period can be less than the maximum time period for the first node to wait for the data packet of the third node to arrive. In this case, the latest time for the first node to report the uplink data packet is earlier than or equal to the maximum time for the first node to wait for the data packet of the third node to arrive.

[0085] Optionally, the payload length of the first data packet is 0 or the payload is empty. That is to say, the first data packet does not include uplink user plane data and / or uplink control plane data.

[0086] Optionally, the first data packet can also carry identification information. For example, the packet header of the first data packet can carry identification information. Regarding the identification information, reference can be made to the above relevant description, which will not be elaborated herein.

[0087] 402. The second node receives the first data packet at the first moment. The first moment is earlier than the maximum moment for the second node to wait for the data packet of the first node to arrive. The second node is the upper-level node of the first node.

[0088] Correspondingly, the first node sends the first data packet.

[0089] Optionally, at a first moment, the second node receives a first data packet, which may include: at the first moment, the second node receives the first data packet from the first node. That is to say, the first node sends the first data packet to the second node.

[0090] 403. At a second moment, the second node sends a second data packet. The second moment is later than the first moment and earlier than the maximum moment when the second node waits for the data packet from the first node to arrive.

[0091] Correspondingly, the third node receives the second data packet. In a possible implementation, 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 perform decapsulation on the second data packet, then encapsulate the decapsulated data together with the data generated by itself, and finally deliver it to a higher-level RU, FHM, or DU. In another possible implementation, 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 perform decapsulation on the second data packet.

[0092] The above only gives some examples of the third node, the second node, and the first node, and there are other combination ways, which are not limited here.

[0093] Optionally, step 403 may include: at the second moment, the second node sends the second data packet to the third node. That is to say, the third node receives the second data packet from the second node.

[0094] Optionally, the second moment is earlier than the maximum moment when the second node waits for the data packet from the first node to arrive, and it can also be described as: the second moment is earlier than the end moment of the maximum waiting time of the second node. The maximum waiting time of the second node is the maximum time for the second node to wait for the data packet from the first node to arrive. The present application does not limit its description method.

[0095] It can be seen that in the above embodiments, even if the first node has no uplink data to report to the upper-level node of the first node, it can send an empty data packet to the upper-level node of the first node, so that the upper-level node of the first node can send a data packet to a higher-level node in time before it waits for the data packet from the first node to arrive. Therefore, this can reduce the transmission delay, thereby increasing the time for the DU to process data, and further improving the communication performance of all areas covered by the network device.

[0096] Such asFigure 5 As shown in the figure, another communication method provided by an embodiment of the present application includes but is not limited to the following steps:

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

[0098] Among them, the uplink data may include uplink user plane data and / or uplink control plane data.

[0099] Optionally, the first node determines that there is no uplink data to be sent, including: when the 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 the first time period.

[0100] Optionally, the first time period is a pre-defined or (pre)-configured time period. For example, the first time period is indicated by the DU to the first node, etc. Optionally, the duration of the first time period may be greater than 0, such as 500 milliseconds (ms). The present application does not limit the size of the duration of the first time period.

[0101] Optionally, no data from the terminal device is detected within the first time period, which can be understood as one of the following:

[0102] 1. No data from the terminal device is detected within multiple first time periods. For example, the first time period is 500 ms. No data from the terminal device is detected within the first 500 ms; no data from the terminal device is detected within the second 500 ms; no data from the terminal device is detected within the third 500 ms. In this way, it can be considered that no data from the terminal device is detected within the first time period.

[0103] Optionally, there is an association relationship between multiple first time periods. For example, after one first time period ends, another time period can start. That is to say, the end time of one first time period is earlier than the start time of another time period.

[0104] 2. The number of first time periods in which no data is detected among multiple first time periods is greater than the number of first time periods in which data is detected. For example, assume that there are a total of 10 first time periods, and no data from the terminal device is detected in 8 first time periods, and data from the terminal device is detected in 2 first time periods. In this way, it can be considered that no data from the terminal device is detected within the first time period.

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

[0106] Optionally, the first ratio can be a predefined or preconfigured value. For example, the first ratio is indicated by the DU to the first node, etc. The second ratio can be a predefined or preconfigured value. For example, the second ratio is indicated by the DU to the first node, etc. This application does not limit the magnitudes of the first ratio and the second ratio.

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

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

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

[0110] It should be noted that the indication information (such as the first indication information, etc.) mentioned in this application can be understood as a management plane data packet. That is, assuming there are other nodes between the destination node and the source node, the other nodes are used to transparently transmit the management plane data packet. Here, the destination node refers to the destination node that receives the management plane data packet. The source node refers to the source node that generates the management plane data packet. 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: the first node -> the second node -> the DU. The second node forwards the first indication information.

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

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

[0113] 503. Based on the first indication information, the DU sends second indication information, and the second indication information is used to indicate that the second node does not wait for the data packet of the first node. The second node is the upper-level node of the first node.

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

[0115] Optionally, step 503 may include: The DU sends the second indication information based on the topology information and the first indication information. The topology information includes the connection relationships between multiple nodes, and the multiple nodes include the first node and the second node. It should be noted that the connection relationships between nodes mentioned in the embodiments of the present application include direct connections and / or indirect connections. Herein, "connection" does not limit whether the connection between nodes is a physical connection or a logical connection. For two directly connected nodes, communication is directly established between them. For two indirectly connected nodes, communication between them needs to be forwarded by other nodes, which belongs to indirect communication.

[0116] 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, which can be understood as: The DU can determine the second node, which is the node at the upper level of 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. That is to say, the second node can receive the second indication information from the DU.

[0117] 504. The second node sends the first data packet at the first moment. The first moment is earlier than the maximum moment when the second node waits for the data packet of the first node to arrive.

[0118] Correspondingly, the third node receives the first data packet. In a possible implementation manner, the third node is the node at the upper level of the second node. For example, the third node is the RU, the second node is the RU, and the first node is the RU; or, the third node is the FHM, the second node is the RU, and the first node is the RU; or, the third node is the FHM, the second node is the FHM, and the first node is the RU. In this case, the third node can perform decapsulation on the first data packet, then encapsulate the decapsulated data together with the data generated by itself, and finally deliver it to a higher-level RU, FHM, or DU. In another possible implementation manner, the third node is the DU, the second node is the RU, and the first node is the RU; or, the third node is the DU, the second node is the FHM, and the first node is the RU; or, the third node is the DU, the second node is the FHM, and the first node is the FHM. In this case, the third node can perform decapsulation on the first data packet.

[0119] The above are only some examples of the third node, the second node, and the first node, and there are other combination ways, which are not limited herein.

[0120] Optionally, step 504 may include: The second node sends the first data packet to the third node at the first moment. That is to say, the third node receives the first data packet from the second node.

[0121] Optionally, the first moment is earlier than the maximum moment when the second node waits for the data packet of the first node to arrive, which can also be described as: the first moment is earlier than the end moment of the maximum waiting time of the second node. The maximum waiting time of the second node is the maximum time for the second node to wait for the data packet of the first node to arrive. The present application does not limit its description method.

[0122] It can be seen that in the above embodiments, when the first node has no uplink data to be sent, it can send the first indication information, so that the DU can learn from the first indication information that the first node is in an idle state, and then can send the second indication information to the upper-level node of the first node, such as the second node, so that the second node can learn not to wait for the data packet of the first node. In this way, the second node can send the first data packet to a higher-level node in time before waiting for the data packet of the first node to arrive. Therefore, this can reduce the transmission delay, thereby increasing the time for the DU to process data, and further improving the communication performance of all areas covered by the network device.

[0123] As Figure 6 shown, another communication method provided by the embodiment of the present application includes but is not limited to the following steps:

[0124] 601. The first node sends the first indication information. The first indication information is used to indicate that the maximum moment when the first node waits for the data packet of the second node to arrive is earlier than the arrival moment of the data packet of the second node, and the first node is the upper-level node of the second node.

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

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

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

[0128] Optionally, before step 601, the first node may also, within the first time period, count the number of times the data packet of the second node is obtained and / or the number of times the data packet of the second node is not obtained before the maximum moment when waiting for the data packet of the second node to arrive at the first node. In this way, the first node may determine, based on the number of times the data packet of the second node is obtained and / or the number of times the data packet of the second node is not obtained, that the maximum moment when the first node waits for the data packet of the second node to arrive is earlier than the arrival moment of the data packet of the second node. For example, if the number of times the data packet of the second node is obtained is less than or equal to the first number, it may be considered that the maximum moment when the first node waits for the data packet of the second node to arrive is earlier than the arrival moment of the data packet of the second node. Or, if the number of times the data packet of the second node is not obtained is greater than or equal to the second number, it may be considered that the maximum moment when the first node waits for the data packet of the second node to arrive is earlier than the arrival moment of the data packet of the second node. Or, if the ratio of the number of times the data packet of the second node is obtained to the number of times the data packet of the second node is not obtained is greater than or equal to the first ratio, it may be considered that the maximum moment when the first node waits for the data packet of the second node to arrive is earlier than the arrival moment of the data packet of the second node. Or, if the number of times the data packet of the second node is obtained is less than the number of times the data packet of the second node is not obtained, it may be considered that the maximum moment when the first node waits for the data packet of the second node to arrive is earlier than the arrival moment of the data packet of the second node. Here are only examples of some methods, and there are other implementation methods, which will not be listed one by one here.

[0129] Optionally, the first time period is a pre-defined or (pre-)configured time period. For example, the first time period is indicated by the DU to the first node, etc. 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, and the maximum waiting time is the maximum time for the first node to wait for the data packet of the second node to arrive. The present application does not limit the size of the duration of the first time period.

[0130] Optionally, the first number may be a pre-defined or pre-configured value. For example, the first number is indicated by the DU to the first node, etc. The second number may be a pre-defined or pre-configured value. For example, the second number is indicated by the DU to the first node, etc. The present application does not limit the sizes of the first number and the second number.

[0131] 602. The DU sends a second indication message based on the first 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.

[0132] Correspondingly, the first node receives the second indication message.

[0133] Optionally, the DU may also receive fifth indication information. For example, the DU receives the fifth indication information from a third node. The fifth indication information is used to indicate that the maximum time for the third node to wait for the arrival of the data packet of the fourth node 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 the 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 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.

[0134] The following uses a specific example to illustrate the process of "the DU sending the second indication information". Exemplarily, Figure 7 or Figure 8 As shown, the DU can learn from the first indication information that the maximum time for the first node to wait for the arrival of the data packet of the second node is earlier than the arrival time of the data packet of the second node. At the same time, the DU can learn from the fifth indication information that the maximum time for the third node to wait for the arrival of the data packet of the fourth node is earlier than the arrival time of the data packet of the fourth node. Therefore, based on the topology information, the first indication information, and the fifth indication information, the DU determines that the first node, the second node, the third node, and the fourth node are on the same link, and the last-level node with a transmission failure on this link is the second node. Therefore, the DU sends the second indication information to the upper-level node of the second node, that is, the first node. That is to say, since the second node does not send the data packet at the latest time when it reports the data packet, the first node cannot obtain the data packet of the second node before the maximum time for it to wait for the arrival of the data packet of the second node. In this way, it is very likely that the first node does not send the data packet at the latest time when it reports the data packet, resulting in the fourth node not sending the data packet at the latest time when it reports the data packet, and further the third node cannot obtain the data packet of the fourth node before the maximum time for it to wait for the arrival of the data packet of the fourth node. Therefore, if the first node is instructed not to wait for the data packet of the second node, the first node can send the data packet to the fourth node in time, so that the fourth node can send the data packet to the third node in time. In this way, the transmission delay can be reduced, thereby improving the time for the DU to process data, and further improving the communication performance of all areas covered by the network device.

[0135] It should be noted that the method for the third node to determine that the maximum time for the third node to wait for the arrival of the data packet of the fourth node is earlier than the arrival time of the data packet of the fourth node may refer to the process of the first node determining that the maximum time for the first node to wait for the arrival of the data packet of the second node is earlier than the arrival time of the data packet of the second node, which will not be elaborated here.

[0136] 603. At the first moment, the first node sends the first data packet. The first moment is earlier than the maximum moment when the first node waits for the data packet of the second node to arrive.

[0137] Correspondingly, the fifth node receives the first data packet. In a possible implementation manner, the fifth node is the upper-level node of the first node. Optionally, the fifth node and the fourth node may be the same node or different nodes.

[0138] Optionally, step 603 may include: at the first moment, the first node sends the first data packet to the fifth node. That is to say, the fifth node receives the first data packet from the first node.

[0139] Optionally, the first moment being earlier than the maximum moment when the first node waits for the data packet of the second node to arrive may also be described as: the first moment is earlier than the end moment of the maximum waiting time of the first node. The maximum waiting time of the second node is the maximum time when the first node waits for the data packet of the second node to arrive. The present application does not limit the description manner thereof.

[0140] It can be seen that in the above embodiments, the first node may send the first indication information, so that the DU learns through the first indication information that the maximum moment when the first node waits for the data packet of the second node to arrive is earlier than the arrival moment of the data packet of the second node, and based on the first indication information, sends the second indication information, so that the first node learns through the second indication information not to wait for the data packet of the second node. Therefore, the first node can timely send the data packet to a higher-level node. Therefore, this can reduce the transmission delay, thereby increasing the time for the DU to process data, and further improving the communication performance of all areas covered by the network device.

[0141] Optionally, in Figure 6 the embodiment shown, the method may further include: the DU receives the third indication information, and the third indication information is used to indicate that the maximum moment when the first node waits for the data packet of the second node to arrive is later than the arrival moment of the data packet of the second node. The DU, based on the third indication information, sends the fourth indication information, and the fourth indication information is used to indicate that the first node waits for the data packet of the second node. That is to say, when the first node learns that the maximum moment when it waits for the data packet of the second node to arrive is later than the arrival moment of the data packet of the second node, it can re-wait for the data packet of the second node, reducing the situation of data loss, thereby improving the transmission reliability.

[0142] Among them, the DU receiving the third indication information may include: the DU receives the third indication information from the first node. That is to say, the first node sends the third indication information to the DU. Optionally, the third indication information may include the identification information of the first node.

[0143] Optionally, the DU sends a fourth indication message based on the third indication message, which may include: the DU sends the fourth indication message based on the topology information and the third indication message. For example, the fourth indication message is sent to the first node. That is to say, the first node receives the fourth indication message from the DU.

[0144] Optionally, in Figure 6 the embodiment shown, the method may further include: the DU sends a sixth indication message. For example, the DU sends the sixth indication message to the network management device. 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. The area covered by the first cell includes the area covered by the second node.

[0145] It should be noted that Figure 6 the embodiment shown exemplarily gives an implementation manner. In the case of RU aggregation networking, there may be problems with transmission failures of nodes (such as RUs or FHMs) on different links, and a similar Figure 6 way shown can still be used to solve this problem, and the specific process will not be elaborated here.

[0146] It can be understood that, in order to implement the above functions, the above devices include the corresponding hardware structures and / or software modules for executing each function. Those skilled in the art should easily realize that, combining the units and algorithm steps of each example described in the embodiments disclosed in this article, this application can be implemented in the form of hardware or a combination of hardware and computer software. Whether a certain function is executed in the way of hardware or computer software driving hardware depends on the specific application and design constraints of the technical solution. Professional technicians can use different methods to implement the described functions for each specific application, but such implementation should not be considered to exceed the scope of this application. The embodiments of this application can divide functional modules for nodes (such as the first node, the second node, etc.) or DUs 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 integrated module can be implemented in the form of hardware or in the form of a software functional module. It should be noted that the division of modules in the embodiments of this application is illustrative, only a logical function division, and there may be other division methods in actual implementation.

[0147] See Figure 9 , Figure 9 which is a schematic structural diagram of a communication device provided by an embodiment of this application. The communication device 900 can be applied to the method shown in any of the above Figures 4 to 6 embodiments, such as Figure 9As shown in the figure, the communication device 900 includes a processing module 901 and a transceiver module 902. The processing module 901 may be one or more processors, and the transceiver module 902 may be a transceiver or a communication interface. The communication device can be used to implement the functions of the node (such as the first node, the second node, etc.) or the DU involved in any of the above method embodiments, or to implement the functions of the network element involved in any of the above method embodiments. The network element or network function can be either a network element in a hardware device, a software function running on dedicated hardware, or a virtualized function instantiated on a platform (such as a cloud platform). Optionally, the communication device 900 may further include a storage module 903 for storing the program code and data of the communication device 900.

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

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

[0150] Another example, the transceiver module 902 is used to: at a first moment, receive a first data packet; the first moment is earlier than the maximum moment for the second node to wait 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; at a second moment, send a second data packet; the second moment is later than the first moment and earlier than the maximum moment for the second node to wait for the data packet of the first node to arrive.

[0151] 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, 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 first node is the lower-level node of the second node.

[0152] Exemplarily, the transceiver module 902 is configured to: receive second indication information for indicating that a second node does not wait for a data packet of a first node, where the second node is a higher-level node of the first node; and send a first data packet at a first moment earlier than the maximum moment when the second node waits for the data packet of the first node to arrive.

[0153] Exemplarily, the transceiver module 902 is configured to: send first indication information for indicating that the maximum moment when a first node waits for a data packet of a second node is earlier than the arrival moment of the data packet of the second node, where the first node is a higher-level node of the second node; the first indication information is used to determine second indication information for indicating that the first node does not wait for the data packet of the second node; receive the second indication information; and send a first data packet at a first moment earlier than the maximum moment when the first node waits for the data packet of the second node to arrive.

[0154] Optionally, the transceiver module 902 is further configured to: send third indication information for indicating that the maximum moment when the first node waits for the data packet of the second node is later than the arrival moment of the data packet of the second node; the third indication information is used to determine fourth indication information for indicating that the first node waits for the data packet of the second node; and receive the fourth indication information.

[0155] In another example, when the communication device acts as a DU or is a chip applied to a DU and executes the steps performed by the DU in the above method embodiments. The transceiver module 902 is specifically configured to execute Figures 4 to 6 the sending and / or receiving actions performed by the DU in any of the embodiments, such as supporting other processes of the DU to execute the technologies described herein. The processing module 901 can be used to support the communication device 900 to execute the processing actions in the above method embodiments, for example, supporting other processes of the DU to execute the technologies described herein.

[0156] Exemplarily, the transceiver module 902 is configured to: receive first indication information for indicating that a first node is in an idle state; and based on the first indication information, send second indication information for indicating that a second node does not wait for a data packet of the first node, where the second node is a higher-level node of the first node.

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

[0158] Exemplarily, the transceiver module 902 is configured to: receive first indication information for indicating that the maximum time for a first node to wait for a data packet of a second node to arrive is earlier than the arrival time of the data packet of the second node, where the first node is a higher-level node of the second node; and based on the first indication information, send second indication information for indicating that the first node does not wait for the data packet of the second node.

[0159] Optionally, the transceiver module 902 is further configured to receive fifth indication information for indicating that the maximum time for a third node to wait for a data packet of a fourth node to arrive is earlier than the arrival time of the data packet of the fourth node, where the third node is a higher-level node of the fourth node; and when sending the second indication information based on the first indication information, the transceiver module 902 is configured to send the second indication information based on topology information, the first indication information, and the fifth indication information; the topology information indicates the connection relationships between multiple nodes, and the multiple nodes include the first node, the second node, the third node, and the fourth node.

[0160] Optionally, the transceiver module 902 is further configured to: receive third indication information for indicating that the maximum time for the first node to wait for the data packet of the second node to arrive is later than the arrival time of the data packet of the second node; and based on the third indication information, send fourth indication information for indicating that the first node waits for the data packet of the second node.

[0161] Optionally, the transceiver module 902 is further configured to: send sixth indication information for indicating 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.

[0162] In a possible implementation manner, when a node (such as the first node, the second node, etc.) or a DU is a chip, the transceiver module 902 may be a communication interface, a pin, or a circuit, etc. The communication interface can be used to input data to be processed to the processor and can output the processing result of the processor outward. In a specific implementation, the communication interface can be a general-purpose input / output (GPIO) interface and can be connected to multiple peripheral devices (such as a display (LCD), a camera, a radio frequency (RF) module, an antenna, etc.). The communication interface is connected to the processor through a bus.

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

[0164] Figure 10 This is a schematic structural diagram of another communication device provided by an embodiment of the present application. It can be understood that the communication device 1010 includes necessary forms of means such as modules, units, components, circuits, or interfaces, which are appropriately configured together to execute the present solution. The communication device 1010 may be the above-mentioned node (such as the first node, the second node, etc.) or DU, or a component (such as a chip) in these devices, for implementing the method described in the above method embodiments. The communication device 1010 includes one or more processors 1011. The processor 1011 may be a general-purpose processor or a dedicated processor, etc. For example, it may be a baseband processor or a central processing unit. The baseband processor may be used to process communication protocols and communication data, and the central processing unit may 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 software programs, and process the data of the software programs.

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

[0166] Optionally, data may also be stored in the processor 1011 and / or the memory 1012. The processor and the memory can 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 is sometimes also referred to as a processing unit, which controls the communication device (such as the above nodes (such as the first node, the second node, etc.) or DU). The transceiver 1015 is sometimes also 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.

[0167] An embodiment of the present application further provides a communication device, which includes at least one processor; wherein, the at least one processor is configured to execute Figures 4 to 6 the method described in any item of any embodiment in

[0168] An embodiment of the present application further provides a computer-readable storage medium, which stores computer instructions, and when the computer instructions are executed, the computer is caused to execute as described in Figure 3 , Figure 7 , Figure 8 and Figure 9 the method described in any item of any embodiment in

[0169] An embodiment of the present application further provides a computer program product, which includes: computer program code, and when the computer program code is run on a computer, the computer is caused to execute as described in Figure 3 , Figure 7 , Figure 8 and Figure 9 the method described in any item of any embodiment in

[0170] An embodiment of the present application further provides a chip, 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 run, the chip is caused to execute as described in Figure 3 , Figure 7 , Figure 8 and Figure 9 the method described in any item of any embodiment in

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

[0172] If the above-mentioned integrated units are implemented in the form of software network element units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on such an 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. The computer software product is stored in a storage medium and includes several instructions for causing a computer device (which can be a personal computer, a terminal device, a cloud server, or a network device, etc.) to execute all or part of the steps of the above-mentioned methods in the various embodiments of the present application. The foregoing storage medium includes: USB flash drives, mobile hard disks, read-only memories (ROM, Read-Only Memory), random access memories (RAM, Random Access Memory), magnetic disks, or optical discs and other various media that can store program codes. The above is only the specific implementation manner of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art within the technical scope disclosed by the present application can easily think of various equivalent modifications or substitutions, and these modifications or substitutions should all be covered by the protection scope of the present application. Therefore, the protection scope of the present application should be subject to the protection scope of the claims.

Claims

1. A communication method, characterized in that, applied to a first node, the method includes: generating a first data packet when no data from a terminal device is received 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 for the first node to report an uplink data packet; sending the first data packet.

2. A communication method, characterized in that, applied to a second node, the method includes: receiving a first data packet at a first moment; the first moment is earlier than the maximum moment for the second node to wait for the arrival of a data packet from the first node, the first data packet is an empty data packet, and the second node is the upper-level node of the first node; sending a second data packet at a second moment; the second moment is later than the first moment and earlier than the maximum moment for the second node to wait for the arrival of the data packet from the first node.

3. A communication method, characterized in that, applied to a first node, the method includes: determining that there is no uplink data to be sent; sending first indication information, 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 a second node does not wait for a data packet from the first node, and the first node is the lower-level node of the second node.

4. A communication method, characterized in that, applied to a distributed unit DU, the method includes: receiving first indication information, the first indication information is used to indicate that a first node is in an idle state; based on the first indication information, sending second indication information, the second indication information is used to indicate that a second node does not wait for a data packet from the first node, and the second node is the upper-level node of the first node.

5. The method according to claim 4, characterized in that, the sending the second indication information based on the first indication information includes: sending the second indication information based on 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.

6. A communication method, characterized in that, applied to a second node, the method includes: receiving second indication information, the second indication information is used to indicate that the second node does not wait for a data packet from a first node, and the second node is the upper-level node of the first node; sending a first data packet at a first moment, the first moment is earlier than the maximum moment for the second node to wait for the arrival of the data packet from the first node.

7. A communication method, characterized in that, applied to a first node, the method includes: sending first indication information, the first indication information is used to indicate that the maximum moment for the first node to wait for the arrival of a data packet from a second node is earlier than the arrival moment of the data packet of the second node, and the first node is the upper-level node of the second node; the first indication information is used to determine second indication information, and 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 moment, a first data packet is sent, and the first moment is earlier than the maximum moment when the first node waits for the data packet of the second node to arrive.

8. The method according to claim 7, wherein, the method further includes: sending third indication information, where the third indication information is used to indicate that the maximum moment when the first node waits for the data packet of the second node to arrive is later than the arrival moment of the data packet of the second node; the third indication information is used to determine fourth indication information, and the fourth indication information is used to indicate that the first node waits for the data packet of the second node; receiving the fourth indication information.

9. A communication method, wherein, applied to a distributed unit DU, the method includes: receiving first indication information, where the first indication information is used to indicate that the maximum moment when a first node waits for a data packet of a second node to arrive is earlier than the arrival moment of the data packet of the second node, and the first node is a higher-level node of the second node; based on the first indication information, sending second indication information, where the second indication information is used to indicate that the first node does not wait for the data packet of the second node.

10. The method according to claim 9, wherein, the method further includes: receiving fifth indication information, where the fifth indication information is used to indicate that the maximum moment when a third node waits for a data packet of a fourth node to arrive is earlier than the arrival moment of the data packet of the fourth node, and the third node is a higher-level node of the fourth node; based on the first indication information, sending the second indication information includes: based on topology information, the first indication information, and the fifth indication information, sending the second 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.

11. The method according to claim 9 or 10, wherein, the method further includes: receiving third indication information, where the third indication information is used to indicate that the maximum moment when the first node waits for the data packet of the second node to arrive is later than the arrival moment of the data packet of the second node; based on the third indication information, sending fourth indication information, where the fourth indication information is used to indicate that the first node waits for the data packet of the second node.

12. The method according to any one of claims 9-11, wherein, the method further includes: sending 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 a first cell, and the area covered by the first cell includes the area covered by the second node.

13. A communication device, wherein, includes units or modules for implementing the method according to any one of claims 1 to 12.

14. A communication device, wherein, the communication device includes 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, and when the computer instructions are executed, the computer is caused to execute the method according to any one of claims 1 to 12.

16. A computer program product, characterized in that, the computer program product includes: computer program code, and when the computer program code is run by a computer, the computer is caused to execute 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, the processor is configured to read and execute instructions stored in a memory, and when the instructions are run, the chip is caused to execute the method according to any one of claims 1 to 12.

Images