Communication method and communication device

Abstract

The invention discloses a communication method and a communication device, and relates to the technical field of communication. In the method, a first node (which is a source node of a network wave) in a transmission path corresponding to the network wave broadcasts a first frame to a node on the transmission path, and the first frame is used for requesting to establish the network wave; the first frame comprises identification information of a network wave, an address of a first node, reserved resource information of the first node and an address of a second node (the second node is a next hop node of the first node), and the second node forwards the first frame to a third node (which is a next hop node of the second node) after receiving the first frame, the forwarded first frame comprises the identification information of the network wave, the address of the first node, the reserved resource information of the second node and the address of the third node, so that the configuration of communication resources according to the reserved resource information of each node on the transmission path can be supported, and the uncertainty of resource utilization can be reduced; and the service quality of the communication service can be ensured.

Description

Technical Field

[0001] This application relates to the field of communication technology, and more specifically, to a communication method and a communication device. Background Technology

[0002] A multi-hop network is a network in which information is forwarded from the source node to the destination node in a hop-by-hop manner. The applications of multi-hop networks are becoming increasingly widespread, including but not limited to: drone networking and satellite network communication.

[0003] In multi-hop networks, nodes typically decide how to use communication resources based solely on their own needs. For example, nodes may access channels and occupy communication resources through random contention protocols such as carrier sense multiple access (CSMA). This increases the uncertainty of communication resource utilization and may consequently reduce network throughput and latency.

[0004] As the number of nodes in a multi-hop network increases, the aforementioned uncertainty in the utilization of communication resources will be further amplified, which will affect the quality of service (GSS) of communication services. Therefore, ensuring the GSS of communication services is a pressing technical problem that needs to be solved. Summary of the Invention

[0005] This application provides a communication method and a communication device that can guarantee the quality of service for communication services.

[0006] In a first aspect, a communication method is provided, comprising: sending a first frame, the first frame being used to request the establishment of a network wave, the first frame including identification information of the network wave, reserved resource information of a first node, address of the first node and address of a second node, wherein the second node and the first node are both nodes in the transmission path corresponding to the network wave, and the second node is the next-hop node of the first node; and receiving a second frame, the second frame being used to respond to the first frame, the second frame including identification information of the network wave and resource usage information of each node in the transmission path.

[0007] The solution described in the first aspect can be executed by a first node-side device, which can be a first node, a functional module (such as a chip system or integrated circuit), or a logic node, logic module, or software capable of implementing all or part of the functions of the first node. For ease of description, the following description uses a first node as an example.

[0008] In the above scheme, the first node carries the network wave identifier, the first node's reserved resource information, the address of the second node, and the address of the first node in the first frame used to request the establishment of the network wave. It then receives a second frame used to respond to the first frame, which includes the network wave identifier and the resource usage information of each node on the transmission path corresponding to the network wave. This reduces the uncertainty of communication resource utilization, thereby ensuring the quality of service for communication services. For example, after the first node reports its reserved resource information, the node used to determine the resource usage of each node can configure the corresponding resources for the first node based on the reserved resource information. Other nodes can determine the first node's resource usage through the second frame and will not choose to occupy the first node's resources, thus reducing the probability of resource conflicts and ensuring the quality of service for communication services.

[0009] In some implementations of the first aspect, the first frame includes a first field, a second field, a third field, and a fourth field, wherein the first field indicates the identification information of the network wave, the second field indicates the reserved resource information of the first node, the third field indicates the address of the first node, and the fourth field indicates the address of the second node.

[0010] The above fields enable the indication of the corresponding information in the first frame, thereby enabling the configuration of corresponding communication resources for each node on the transmission path corresponding to the network wave.

[0011] In some implementations of the first aspect, the identification information of the network wave includes the address of the source node of the network wave, the address of the destination node of the network wave, the identifier of the transmission path, and the sequence number of the network wave.

[0012] In this way, this can uniquely identify network waves.

[0013] In some implementations of the first aspect, the first frame also includes a fifth field, which indicates the resource parameters of the first node. The resource parameters of the first node include: the address of the first node, information on unavailable resources of the first node, a list of neighboring nodes of the first node, and information on the resource requirements of the first node.

[0014] In this way, it is possible to configure the corresponding communication resources for the first node based on the resource parameters of the first node.

[0015] In some implementations of the first aspect, the first frame also includes a sixth field, which indicates whether the transmission direction of the main service flow of the network wave and the transmission direction of at least one secondary service flow of the network wave are the same.

[0016] This can thus support indicating whether the aforementioned network waves support bidirectional transmission.

[0017] In some implementations of the first aspect, the first frame also includes a seventh field, which indicates the working period parameter of the network wave.

[0018] This allows for the indication of network wave cycle parameters. Furthermore, it enables the guarantee of quality of service for communication services in periodic transmission scenarios.

[0019] In some implementations of the first aspect, the second frame also includes the working period parameters of the network wave.

[0020] This allows for the indication of network wave cycle parameters. Furthermore, it enables the guarantee of quality of service for communication services in periodic transmission scenarios.

[0021] In some implementations of the first aspect, the working period parameter of the network wave includes at least one of the following: network wave state parameter, network wave start position parameter, duration parameter, period parameter, or number of repetitions.

[0022] By using at least one of the above parameters, it is beneficial to support the quality of service of communication services in scenarios with periodic transmission.

[0023] In some implementations of the first aspect, the method further includes: sending a third frame, the third frame being used to request the dismantling of the network wave, the third frame including identification information of the network wave, the address of the second node, and the address of the first node.

[0024] This would enable the completion of the process of dismantling network waves.

[0025] Secondly, a communication method is provided, comprising: receiving a first frame, the first frame being used to request the establishment of a network wave, the first frame including identification information of the network wave, reservation resource information of a first node, address of the first node and address of a second node, the first node being the node that sends the first frame and the second node being the next-hop node of the first node; and sending a fourth frame, the fourth frame including identification information of the network wave, reservation resource information of the first node, reservation resource information of the second node, address of the first node and address of a third node, the third node being the next-hop node of the second node, the fourth frame being obtained by processing the first frame.

[0026] The solution described in the second aspect can be executed by a second node-side device, which can be a second node, a functional module (such as a chip system or integrated circuit), or a logic node, logic module, or software capable of implementing all or part of the functions of the second node. For ease of description, the following description uses a second node as an example.

[0027] In the above scheme, after receiving the first frame, the second node determines itself as the next-hop node of the first node based on its address in the first frame. The second node then performs framing processing on the first frame, embedding its reserved resource information and the address of the third node into the first frame to obtain the fourth frame, which is then sent. This reduces the uncertainty of communication resource utilization, thereby ensuring the quality of service for communication services. For example, after the second node reports its reserved resource information, the node used to determine the resources used by each node can configure the corresponding resources for the second node based on the reserved resource information of the second node and the first node. Other nodes will not occupy the resources used by the first node, thus reducing the probability of resource conflicts and ensuring the quality of service for communication services.

[0028] In some implementations of the second aspect, the fourth frame includes a first field, a second field, a third field, a fourth field, and a fifth field. The first field indicates the identification information of the network wave, the second field indicates the reserved resource information of the first node, the third field indicates the address of the second node, the fourth field indicates the address of the third node, and the fifth field indicates the reserved resource information of the second node.

[0029] The above fields enable the indication of corresponding information in the fourth frame, thereby enabling the configuration of corresponding communication resources for each node on the transmission path corresponding to the network wave.

[0030] In some implementations of the second aspect, the identification information of the network wave includes the address of the source node of the network wave, the address of the destination node of the network wave, the identifier of the transmission path, and the sequence number of the network wave.

[0031] In this way, this can uniquely identify network waves.

[0032] In some implementations of the second aspect, the fourth frame also includes a sixth field and a seventh field, where the sixth field indicates the resource parameters of the first node, and the seventh field indicates the resource parameters of the second node. The resource parameters of the first node include: the address of the first node, information on unavailable resources of the first node, a list of neighboring nodes of the first node, and resource requirement information of the first node. The resource parameters of the second node include: the address of the second node, information on unavailable resources of the second node, a list of neighboring nodes of the second node, and resource requirement information of the second node.

[0033] In this way, it is possible to configure the corresponding communication resources for the first node and the second node respectively based on the resource parameters of the first node and the resource parameters of the second node.

[0034] In some implementations of the second aspect, the fourth frame also includes an eighth field, which indicates whether the transmission direction of the main traffic flow of the network wave and the transmission direction of at least one secondary traffic flow of the network wave are the same.

[0035] This can thus support indicating whether the aforementioned network waves support bidirectional transmission.

[0036] In some implementations of the second aspect, the first frame also includes a ninth field, which indicates the working period parameter of the network wave.

[0037] This allows for the indication of network wave cycle parameters. Furthermore, it enables the guarantee of quality of service for communication services in periodic transmission scenarios.

[0038] In some implementations of the second aspect, the working period parameter of the network wave includes at least one of the following: network wave state parameter, network wave start position parameter, duration parameter, period parameter, or number of repetitions.

[0039] By using at least one of the above parameters, it is beneficial to support the quality of service of communication services in scenarios with periodic transmission.

[0040] In some implementations of the second aspect, the method further includes: receiving a second frame, the second frame being used to respond to the first frame, the second frame including identification information of the network wave and resource usage information of each node in the transmission path; and sending a fifth frame, the fifth frame being used to respond to the first frame, the fifth frame being obtained by processing the second frame, the fifth frame including identification information of the network wave and resource usage information of each node in the transmission path.

[0041] In this way, it can support the completion of framing and forwarding of the second frame, and thus enable nodes on the transmission path that do not belong to the network wave to choose not to occupy the resources used by each node on the transmission path according to the fourth frame, thereby reducing the probability of resource conflicts and ensuring the quality of service of communication services.

[0042] In some implementations of the second aspect, the method further includes: receiving a third frame, the third frame being used to request the dismantling of the network wave, the third frame including identification information of the network wave, the address of the second node, and the address of the first node; and sending a sixth frame, the sixth frame including identification information of the network wave, the address of the second node, and the address of the third node. The sixth frame is obtained by processing the third frame. The sixth frame is also used to request the dismantling of the network wave.

[0043] This would enable the completion of the process of dismantling network waves.

[0044] For a description of the first frame in the second aspect, please refer to the description of the first frame in the first aspect, which will not be repeated here.

[0045] Thirdly, a communication method is provided, comprising: receiving a fourth frame, the fourth frame being used to request the establishment of a network wave, the fourth frame including identification information of the network wave, reserved resource information of each node on the transmission path corresponding to the network wave, the address of a second node and the address of a third node, the third node being the next-hop node of the second node and the third node being the destination node of the network wave; and sending a second frame according to the fourth frame, the second frame being used to respond to the fourth frame, the second frame including identification information of the network wave and the resources used by each node on the transmission path.

[0046] The solution described in the third aspect can be executed by a third-node side device, which can be a second node, a functional module (such as a chip system or integrated circuit), or a logic node, logic module, or software capable of implementing all or part of the functions of the third node. For ease of description, the following description uses a third node as an example.

[0047] In the above scheme, after receiving the fourth frame, the third node determines itself as the next-hop node and destination node of the second node based on its address in the fourth frame. The third node then obtains and sends the second frame based on the fourth frame. This reduces the uncertainty of communication resource utilization, thereby ensuring the quality of service for communication services. For example, the third node can configure resource usage for each node on the transmission path corresponding to the network wave based on the information in the fourth frame. When the third node sends the second frame, other nodes can see that the second frame will not occupy the resources used by each node on the transmission path corresponding to the network wave, thus reducing the probability of resource conflicts and ensuring the quality of service for communication services.

[0048] In some implementations of the third aspect, sending the second frame according to the fourth frame includes: sending the fourth frame to a control node; receiving the second frame from the control node, which is used to determine the reserved resources of each node on the transmission path; and sending the second frame.

[0049] Optionally, the third node sends a fourth frame to the control node, including: the third node sends the fourth frame to the control node through the proxy node.

[0050] Optionally, the third node sends a fourth frame to the control node, including: the third node directly sends the fourth frame to the control node.

[0051] This allows the control node to determine the second frame, which can reduce the processing power consumption of the third node.

[0052] In some implementations of the third aspect, the method further includes receiving a fifth frame, which is used to request the dismantling of the network wave. The fifth frame includes identification information of the network wave, the address of the second node, and the address of the third node.

[0053] This would enable the completion of the process of dismantling network waves.

[0054] For a description of the fourth frame in the third aspect, please refer to the description of the fourth frame in the second aspect, which will not be repeated here.

[0055] Fourthly, a communication method is provided, comprising: receiving a fourth frame, the fourth frame being used to request the establishment of a network wave, the fourth frame including identification information of the network wave, reservation resource information of a first node, reservation resource information of a second node, the address of the first node, and the address of a third node, the third node being the next-hop node of the second node, the third node being the destination node of the network wave, and the first node being the source node of the network wave; when it is determined that a node does not belong to the transmission path corresponding to the network wave, establishing reservation information based on the identification information of the network wave, the reservation information being used to instruct the node on the transmission path corresponding to the network wave to reserve communication resources.

[0056] The solution described in the fourth aspect can be executed by a fourth node-side device. This third node-side device can be a fourth node, a functional module (such as a chip system or integrated circuit), or a logic node, logic module, or software capable of implementing all or part of the functions of the fourth node. For ease of description, the following description uses a fourth node as an example.

[0057] In the above scheme, after the fourth node receives the fourth frame, when the fourth node determines that it is an external node of the transmission path corresponding to the network wave, the fourth node can determine not to occupy the communication resources indicated by the reservation resource information of the first node and the reservation resource information of the second node in the fourth frame, thereby reducing the probability of resource conflicts and ensuring the service quality of communication services.

[0058] It should be noted that the fourth node can also receive the first and second frames.

[0059] For a description of the fourth frame in the fourth aspect, please refer to the description of the fourth frame in the second aspect, which will not be repeated here.

[0060] Fifthly, a communication device is provided, which may be a first node, or a device or module for performing the functions of the first node.

[0061] One possible implementation is that the communication device may include modules or units corresponding to the methods / operations / steps / actions described in the first aspect, which may be hardware circuits, software, or a combination of hardware circuits and software.

[0062] For example, the communication device includes a transceiver unit and a processing unit.

[0063] In a sixth aspect, a communication device is provided, which may be a second node, or a device or module for performing the functions of a second node.

[0064] One possible implementation is that the communication device may include modules or units corresponding to the methods / operations / steps / actions described in the second aspect, which may be hardware circuits, software, or a combination of hardware circuits and software.

[0065] For example, the communication device includes a transceiver unit and a processing unit.

[0066] In a seventh aspect, a communication device is provided, which may be a third node, or a device or module for performing the functions of a third node.

[0067] One possible implementation is that the communication device may include modules or units corresponding to the methods / operations / steps / actions described in the third aspect, which may be hardware circuits, software, or a combination of hardware circuits and software.

[0068] For example, the communication device includes a transceiver unit and a processing unit.

[0069] Eighthly, a communication device is provided, which may be a fourth node, or a device or module for performing the functions of a fourth node.

[0070] One possible implementation is that the communication device may include modules or units corresponding to the methods / operations / steps / actions described in the fourth aspect, which may be hardware circuits, software, or a combination of hardware circuits and software.

[0071] For example, the communication device includes a transceiver unit and a processing unit.

[0072] A ninth aspect provides a communication device including a processor configured to, by executing a computer program or instructions, or by logic circuitry, cause the communication device to perform the method described in the first aspect and any possible mode of the first aspect; or cause the communication device to perform the method described in the second aspect and any possible mode of the second aspect; or cause the communication device to perform the method described in the third aspect and any possible mode of the third aspect; or cause the communication device to perform the method described in the fourth aspect and any possible mode of the fourth aspect.

[0073] In one possible implementation, the communication device also includes a memory for storing the computer program or instructions.

[0074] In one possible implementation, the communication device also includes a communication interface for inputting and / or outputting signals.

[0075] A tenth aspect provides a communication device including logic circuitry and an input / output interface for inputting and / or outputting signals. The input / output interface is configured to perform the method described in the first aspect and any possible mode of the first aspect; or, the logic circuitry is configured to perform the method described in the second aspect and any possible mode of the second aspect; or, the logic circuitry is configured to perform the method described in the third aspect and any possible mode of the third aspect; or, the logic circuitry is configured to perform the method described in the fourth aspect and any possible mode of the fourth aspect.

[0076] Eleventhly, a computer-readable storage medium is provided, on which a computer program or instructions are stored, which, when executed on a computer, cause the method described in the first aspect and any possible manner of the first aspect to be executed; or cause the method described in the second aspect and any possible manner of the second aspect to be executed; or cause the method described in the third aspect and any possible manner of the third aspect to be executed; or cause the method described in the fourth aspect and any possible manner of the fourth aspect to be executed.

[0077] In a twelfth aspect, a computer program product is provided, comprising instructions that, when executed on a computer, cause the method described in the first aspect and any possible mode of the first aspect to be executed; or cause the method described in the second aspect and any possible mode of the second aspect to be executed; or cause the method described in the third aspect and any possible mode of the third aspect to be executed; or cause the method described in the fourth aspect and any possible mode of the fourth aspect to be executed.

[0078] In a thirteenth aspect, a chip or chip system is provided, comprising: one or more processors configured to execute computer programs or instructions in the memory, such that the chip or chip system implements the methods of the first aspect and any possible implementation thereof; or, such that the chip or chip system implements the methods of the second aspect and any possible implementation thereof; or, such that the chip or chip system implements the methods of the third aspect and any possible implementation thereof; or, such that the chip or chip system implements the methods of the fourth aspect and any possible implementation thereof.

[0079] For a description of the beneficial effects of any of the fifth to thirteenth aspects, please refer to the description of the beneficial effects of the first to fourth aspects, which will not be repeated here. Attached Figure Description

[0080] Figure 1 This is a schematic diagram of the transmission path in a multi-hop network.

[0081] Figure 2 This is a schematic diagram of a multi-hop network including control nodes.

[0082] Figure 3 This is a schematic diagram of network wave state information entries.

[0083] Figure 4 This is a diagram illustrating job information entries.

[0084] Figure 5 This is a diagram illustrating the information entries.

[0085] Figure 6 This is a diagram illustrating the reservation information entries.

[0086] Figure 7 This is a schematic diagram of the interaction flow of a communication method according to an embodiment of this application.

[0087] Figure 8 This is a structural schematic diagram of the first frame of an embodiment of this application.

[0088] Figure 9 This is a schematic diagram of the reserved information field in an embodiment of this application.

[0089] Figure 10 This is a schematic diagram of the second frame of an embodiment of this application.

[0090] Figure 11 This is a schematic diagram of the third frame of an embodiment of this application.

[0091] Figure 12 This is a schematic diagram of the simulation results of an embodiment of this application.

[0092] Figure 13 This is a schematic block diagram of a communication device according to an embodiment of this application.

[0093] Figure 14 This is a schematic block diagram of another communication device according to an embodiment of this application. Detailed Implementation

[0094] To facilitate understanding of the embodiments of this application, the following points will be explained first.

[0095] 1. Unless otherwise stated, "multiple" means two or more. "At least one" means one or more.

[0096] 2. Unless otherwise specified or in case of logical conflict, the terms and / or descriptions in different embodiments of this application are consistent and can be referenced in each other. The technical features in different embodiments can be combined to form new embodiments according to their inherent logical relationships.

[0097] III. The various numerical designations used in this application are merely for descriptive convenience and are not intended to limit the scope of protection of this application. The magnitude of the serial numbers used in this application does not imply a sequential order of execution; the execution order of each process should be determined by its function and internal logic. For example, the terms "first," "second," "third," "fourth," and other various terminology (if present) in the specification, claims, and drawings of this application are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. Such data can be interchanged where appropriate so that the embodiments described herein can be implemented in a sequence other than that illustrated or described herein.

[0098] Furthermore, any embodiment or design described as "exemplary" or "for example" in this application should not be construed as being more preferred or advantageous than other embodiments or designs. Specifically, the use of terms such as "exemplary" or "for example" is intended to present the relevant concepts in a concrete manner for ease of understanding.

[0099] IV. The terms “comprising” and “having” and any variations thereof are intended to cover non-exclusive inclusion, for example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to those steps or units that are expressly listed, but may include other steps or units that are not expressly listed or that are inherent to such process, method, product or device.

[0100] V. In the embodiments of this application, "used for indication" can be understood as "enabling". "Enabling" includes direct enabling and indirect enabling. When describing information used to enable A, it may include the information directly enabling A or indirectly enabling A, but does not necessarily mean that the information carries A.

[0101] The information that enables the information is called the information to be enabled. In the specific implementation process, there are many ways to enable the information to be enabled, such as, but not limited to, directly enabling the information to be enabled, such as the information to be enabled itself or its index. It can also be indirectly enabled by enabling other information, where there is a relationship between the other information and the information to be enabled. It can also enable only a part of the information to be enabled, while the other parts are known or pre-agreed upon. For example, enabling specific information can be achieved by using a pre-agreed (e.g., protocol-defined) arrangement of various pieces of information, thereby reducing enabling overhead to some extent. Simultaneously, common parts of various pieces of information can be identified and enabled uniformly to reduce the enabling overhead caused by individually enabling the same information.

[0102] In addition, "instruction" can include direct instruction, indirect instruction, explicit instruction, and implicit instruction. When describing a certain instruction information to indicate A, it can be understood that the instruction information carries A, directly indicates A, or indirectly indicates A.

[0103] In this embodiment, the information indicated by the instruction information is called the information to be instructed. In specific implementations, there are many ways to indicate the information to be instructed, such as, but not limited to, directly indicating the information to be instructed, such as the information to be instructed itself or its index. It can also indirectly indicate the information to be instructed by indicating other information, where there is a correlation between the other information and the information to be instructed. It can also indicate only a part of the information to be instructed, while the other parts are known or pre-agreed upon. For example, the instruction of specific information can be achieved by using a pre-agreed (e.g., protocol-defined) arrangement of various pieces of information, thereby reducing instruction overhead to some extent. Furthermore, the information to be instructed can be sent as a whole or divided into multiple sub-information pieces, and the sending period and / or timing of these sub-information pieces can be the same or different.

[0104] VI. In the embodiments of this application, "pre-configuration" may include pre-defined features, such as protocol definitions. The "pre-defined features" can be implemented by pre-saving corresponding code, tables, or other means that can be used to indicate relevant information in the nodes; this application does not limit the specific implementation method.

[0105] VII. The term "storage" or "preservation" in the embodiments of this application can refer to storage in one or more memory devices. These memory devices can be separately configured or integrated into an encoder, decoder, processor, or communication device. Alternatively, some memory devices can be separately configured, while others can be integrated into a decoder, processor, or communication device. The type of memory can be any form of storage medium, and this is not limited.

[0106] 8. The "protocol" involved in the embodiments of this application may refer to standard protocols in the field of communication, for example, it may include fourth-generation (4G) protocols. th Generation 4G network, fifth generation (5G) network th This application does not limit the scope to network protocols such as generation (5G), NR, 5.5G, and related protocols applied in future communication networks.

[0107] 9. The arrows or boxes indicated by dashed lines in the schematic diagrams in the accompanying drawings of this application represent optional steps or optional modules.

[0108] 10. Unless otherwise stated, " / " indicates that the objects before and after are in an "or" relationship. For example, A / B can mean A or B. In this application, "and / or" is merely a description of the relationship between the related 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. A and B can be singular or plural.

[0109] XI. In this application, "send" and "receive" indicate the direction of signal transmission. For example, "send information to XX" can be understood as the destination of the information being XX, which may include direct transmission via the air interface or indirect transmission by other units or modules via the air interface. "Receive information from YY" can be understood as the source of the information being YY, which may include direct reception from YY via the air interface or indirect reception from YY by other units or modules via the air interface. "Send" can also be understood as the "output" of the chip interface, and "receive" can also be understood as the "input" of the chip interface. In other words, sending and receiving can occur between devices, such as between a first node and a second node, or within a node, such as between components, modules, chips, software modules, or hardware modules within a device via a bus, trace, or interface.

[0110] The technical solutions of this application embodiment can be applied to various wireless network scenarios or wired network scenarios, such as the Institute of Electrical and Electronics Engineers (IEEE) 802.11 series standards or other series standards for wireless local area networks (WLANs), such as the IEEE 802.11be standard, the IEEE 802.11bn / UHR / Wi-Fi 8 standard, the IEEE Integrated mmWave standard, the IEEE 802.15 standard, or the IEEE 802.11bf / sensing standard, future communication networks, short-range wireless networks, wireless ad hoc networks, wireless sensor networks, wireless Internet of Things (IoT), vehicle-to-everything (V2X) networks, satellite networks, etc.

[0111] Although the embodiments of this application are primarily illustrated using the deployment of WLAN networks, particularly those employing the IEEE 802.11 system standard, those skilled in the art will readily understand that the various aspects involved in the embodiments of this application can be extended to other networks employing various standards or protocols, such as Bluetooth, high-performance radio local area networks (HIPERLANs), wide area networks (WANs), personal area networks (PANs), or other networks now known or developed in the future. Therefore, regardless of the coverage area and wireless access protocol used, the various aspects provided in the embodiments of this application can be applied to any suitable wireless network.

[0112] The technical solutions of this application can be applied to various communication systems, including but not limited to: Global System for Mobile Communication (GSM), Code Division Multiple Access (CDMA), Wideband Code Division Multiple Access (WCDMA), General Packet Radio Service (GPRS), Long Term Evolution (LTE), LTE Frequency Division Duplex (FDD), LTE Time Division Duplex (TDD), Universal Mobile Telecommunication System (UMTS), Worldwide Interoperability for Microwave Access (WiMAX), 5G systems, and other wireless local area network systems.

[0113] The communication systems described above that are applicable to this application are merely illustrative examples, and the communication systems applicable to this application are not limited thereto.

[0114] In this application embodiment, a terminal can refer to user equipment (UE), access terminal, user unit, user station, mobile station, mobile station, remote station, remote terminal, mobile device, user terminal, terminal, wireless device, user agent, or user equipment. A terminal can also be a cellular phone, cordless phone, session initiation protocol (SIP) phone, wireless local loop (WLL) station, personal digital assistant (PDA), handheld device with communication capabilities, computing device or other processing device connected to a wireless modem, vehicle-mounted device, wearable device, terminal in a 5G network, terminal in a future communication network, or terminal in a public land mobile network (PLMN), etc., and is not limited thereto.

[0115] In this embodiment, the network device can be a device used for communicating with the terminal, such as a base station (BTS) in a GSM or CDMA system, a base station (nodeB, NB) in a WCDMA system, or an evolved NodeB (eNB or eNodeB) in an LTE system. It can also be a wireless controller in a cloud radio access network (CRAN) scenario, or a relay station, access point, vehicle-mounted device, wearable device, network device in a 5G network, network device in a future communication network, or network device in a PLMN network, etc., and is not limited thereto.

[0116] Figure 1 This is a schematic diagram of the transmission path in a multi-hop network. Figure 1 In this context, network waves used to transmit service flows are established based on transmission paths that include multiple nodes. Taking transmission path 1 and transmission path 2 as examples, transmission path 1 and transmission path 2 correspond to different network waves (network waves can be used for data transmission). Transmission path 1 includes nodes 1 to N (N is a positive integer greater than 1), and transmission path 2 includes nodes 2 to N+1.

[0117] It should be noted that the multi-hop network described in this application embodiment can be one-hop or more than one-hop. A single hop refers to a transmission path containing only one source node and one destination node, with the source node directly transmitting data to the destination node. More than one hop refers to a transmission path containing two or more nodes. For example, transmission path 1 includes N nodes, and the multi-hop network corresponding to transmission path 1 is an N-1 hop network (N is a positive integer greater than 1). Transmission path 2 includes N nodes, and the multi-hop network corresponding to transmission path 2 is also an N-1 hop network (N is a positive integer greater than 1).

[0118] When node 1 transmits a service to node N, node 1 is the source node of transmission path 1, node N is the destination node of transmission path 1, nodes 2 to N-1 are intermediate nodes of transmission path 1, and node N+1 does not belong to transmission path 1 and is an external node of transmission path 1. When node 2 transmits a service to node N+1, node 2 is the source node of transmission path 2, node N+2 is the destination node of transmission path 2, nodes 3 to N are intermediate nodes of transmission path 2, and node N+2 does not belong to transmission path 2 and is an external node of transmission path 2.

[0119] A primary service flow and at least one secondary service flow can exist on the same transmission path. The transmission direction of the secondary service flow can be the same as or different from that of the primary service flow. For example, the primary service flow can be transmitted from the source node (e.g., node 1) to the destination node (e.g., node N), while the secondary service flow can be transmitted from the source node to the destination node, or from the destination node to the source node.

[0120] When the source node corresponding to the main service flow is the source node of the transmission path, and the destination node corresponding to the main service flow is the destination node of the transmission path, and the source node corresponding to the secondary service flow is the source node of the transmission path, the destination node corresponding to the secondary service flow is not the destination node of the transmission path; or, when the destination node corresponding to the secondary service flow is the destination node of the transmission path, the source node corresponding to the secondary service flow is not the source node of the transmission path. For example, taking transmission path 1 as an example, the source node corresponding to the main service flow on transmission path 1 is node 1, and the corresponding destination node is node N; the source node corresponding to the secondary service flow on transmission path 1 is node 3, and the corresponding destination node is node N-1 (the transmission direction of the secondary service flow is the same as the transmission direction of the main service flow); or, the source node corresponding to the secondary service flow on transmission path 1 is node N-1, and the corresponding destination node is node 3 (the transmission direction of the secondary service flow is different from the transmission direction of the main service flow).

[0121] For a specific transmission path, nodes have four roles: source node, destination node, intermediate node, and node outside the path. The same node may play different roles for different transmission paths; for example, node N is the destination node for transmission path 1, and an intermediate node for transmission path 2.

[0122] Figure 1 The transmission path shown can be applied to architectures without control nodes or with control nodes. A control node is a node capable of collecting information about all ordinary nodes in the network, calculating network wave parameters, and issuing network wave resource reservations. Furthermore, the control node can monitor all existing routing paths in the network, the list of interfering nodes for each node, and the resource reservation status of existing network waves. The control node can be a node within the transmission path or a node outside the transmission path.

[0123] Figure 2 This is a schematic diagram of a multi-hop network that includes a control node (located outside the transmission path). An example is:

[0124] Figure 2 In (a), the control node communicates directly with all nodes in the network without the need for a proxy node to transmit data.

[0125] Figure 2 In (b), the control node communicates with the nodes in the transmission path through proxy nodes, and none of the proxy nodes are nodes in the transmission path.

[0126] Figure 2 In (c), the control node communicates with the nodes in the transmission path through proxy nodes, and all proxy nodes are nodes in the transmission path.

[0127] Figure 2 In (d), the control node communicates with the nodes in the transmission path through proxy nodes. Some of the proxy nodes are nodes in the transmission path, and the other part are nodes outside the transmission path.

[0128] Figure 1 Each node in the network can be a device with wireless communication capabilities. A node can be a station (STA) or an access point (AP), etc. An AP can be a communication server, router, switch, or any of the above-mentioned network devices. A STA can be a mobile phone, computer, or any of the above-mentioned terminals. This application does not limit the implementation of the embodiments.

[0129] For example, an AP can serve as an access point for terminals to enter a wired (or wireless) network. It is primarily deployed in homes, buildings, and campuses, with a typical coverage radius of tens to hundreds of meters. Of course, it can also be deployed outdoors. An AP acts as a bridge connecting wired and wireless networks, its main function being to connect various wireless network clients together and then connect the wireless network to the Ethernet.

[0130] For example, the STA can be a wireless communication chip, a wireless sensor, or a wireless communication terminal, and can also be referred to as a user. For instance, the STA can be a mobile phone that supports Wi-Fi communication, a tablet computer that supports Wi-Fi communication, a set-top box that supports Wi-Fi communication, a smart TV that supports Wi-Fi communication, a smart wearable device that supports Wi-Fi communication, an in-vehicle communication device that supports Wi-Fi communication, and a computer that supports Wi-Fi communication, etc.

[0131] It is understood that the above descriptions of AP, STA, and nodes are only examples and not final limitations.

[0132] It should be noted that, Figure 1 and Figure 2The content can be applied to the following scenarios: one-way transmission scenarios (including one-way transmission scenarios with and without control nodes), two-way transmission scenarios (including two-way transmission scenarios with and without control nodes), and periodic transmission scenarios (including periodic transmission scenarios with and without control nodes).

[0133] Specifically, a unidirectional transmission scenario is one where the transmission direction of the main service flow on the transmission path is the same as the transmission direction of all secondary service flows on that path. A bidirectional transmission scenario is one where the transmission direction of the main service flow on the transmission path is different from the transmission direction of at least one secondary service flow on that path. A periodic transmission scenario is one where the transmission path can be used for data transmission periodically.

[0134] For ease of description, the following text uses a unidirectional transmission scenario as an example, and describes the differences between unidirectional and periodic transmission scenarios, as well as between unidirectional and bidirectional transmission scenarios. Therefore, the content regarding unidirectional transmission scenarios below also applies to bidirectional and periodic transmission scenarios, and will not be repeated hereafter.

[0135] To facilitate understanding of the technical solutions in the embodiments of this application, some terms are briefly described below. These terms apply to the three scenarios mentioned above. It should be noted that the content appearing below is for illustrative purposes only and is not intended as a final limitation.

[0136] I. Network Wave State Table

[0137] Each node can store its own network wave state table. For example, the first node stores the first network wave state table, the second node stores the second network wave state table, the third node stores the third network wave state table, and the fourth node stores the fourth network wave state table. Each network wave state table includes at least one entry for network wave state information. The network wave state table can be used by nodes to query the establishment status of a network wave. Furthermore, each node can update, delete, or add network wave state information in its stored network wave state table based on network wave-related information included in received frames.

[0138] Figure 3 This is a schematic diagram of network wave state information entries. For example, network wave state information entries include, but are not limited to: source node address, destination node address, path identifier, network wave sequence number, network wave state, and state parameters.

[0139] The source node address, destination node address, path identifier, and network wave sequence number can be understood as the identification information of the network wave.

[0140] Source node address: The address of the source node of the proposed network wave. Here, "address" refers to information that distinguishes different nodes, including but not limited to: Media Access Control (MAC) address, Internet Protocol (IP) address, node identifier (ID), etc.

[0141] Destination node address: The address of the destination node of the network wave to be established.

[0142] Path identifier: Used to indicate a specific transmission path among multiple transmission paths between the source node and the destination node. For example, if node 1 is the source node and node 10 is the destination node, there are multiple transmission paths between node 1 and node 10, such as transmission path a (including node 1, node 3, node 4, and node 10) and transmission path b (including node 1, node 2, node 6, and node 10).

[0143] Network wave sequence number: Used to distinguish a specific network wave request among multiple network wave requests for the same transmission path between the same source and destination nodes. Each node can store and maintain a network wave sequence number counter, and can change the value of this counter as the network wave sequence number in the network wave request initiated by this node.

[0144] Network wave status includes two states: Requesting and Established. Requesting indicates that the source node has initiated a network wave establishment request and is waiting for a response from the destination node. Established indicates that the source node has already established the network wave.

[0145] Status Parameters: When the network wave status is "Requesting," the source node will start a network wave request timer and enter the timer duration in this field (this can be used to indicate how long the network wave request will remain valid). When the network wave status is "Established," the source node will enter the lifecycle of this network wave (which can also be understood as the planned duration of the network wave) in this field. The lifecycle is an optional field; the source node can leave it blank or enter a default value. If the establishment time of this network wave exceeds the lifecycle,

[0146] The source node performs a network wave teardown process.

[0147] When the first node (the source node) wants to establish network wave 1, it can look up the first network wave state table based on the identification information of network wave 1 (including: the source node address of network wave 1, the destination node address of network wave 1, the path identifier of the transmission path corresponding to network wave 1, and the network wave sequence number of network wave 1), and take the corresponding operation:

[0148] Scenario 1:

[0149] If no network wave status information entry for network wave 1 is found, the first node increments its own network wave sequence number counter by one, creates a network wave status information entry for network wave 1 in the first network wave status table, and inputs relevant information such as the current value of the network wave sequence number counter, the request being made, and the timeout period.

[0150] Scenario 2:

[0151] If the network wave status information entry for network wave 1 is found and the network wave status is "requesting", the first node will wait for a response from the third node (the destination node) if the timeout period has not been reached.

[0152] When the network wave status in the network wave status information entry of network wave 1 is "Requesting" and the timeout period has expired, the first node re-initiates the network wave establishment request, increments the value of the network wave sequence number counter by one, fills the current value of the network wave sequence number counter in the network wave sequence number field of the status information entry of network wave 1, starts a new network wave request timer, and updates the timeout period.

[0153] Scenario 3:

[0154] If the network wave status information entry for network wave 1 is found, and the network wave status is established, the first node directly performs service transmission.

[0155] II. Work Information Form

[0156] Each node can store its own working information table. For example, the first node stores a first working information table, the second node stores a second working information table, the third node stores a third working information table, the fourth node stores a fourth working information table, and so on. The working information table indicates to the node that it needs to transmit data to a specific receiving node on a specific communication resource (communication resources include one or more of time-domain resources, frequency-domain resources, and code-domain resources). The working information table consists of one or more working information entries. Furthermore, each node can update, delete, or add working information entries in its stored working information table based on information related to communication resources included in the received frame.

[0157] Figure 4This is a schematic diagram of a working information entry. For example, working information entries include, but are not limited to: source node address, destination node address, path identifier, network wave sequence number, communication node address, and indication information.

[0158] For descriptions of source node address, destination node address, path identifier, and network wave sequence number, please refer to the previous text.

[0159] Communication node address: Indicates the node to which data should be transmitted under the guidance of the current work information entry.

[0160] In a unidirectional transmission scenario, the communication node is the receiving node, meaning it is the next-hop node. In a bidirectional transmission scenario, the communication node includes both a previous-hop node and a next-hop node. When a node does not have a previous-hop node or a next-hop node in the current transmission path, the corresponding field can be filled with an invalid field.

[0161] Instruction information: Indicates the communication resources for the specific operation of this node. For ease of description, this application uses a time slot as an example.

[0162] Figure 5 This is a schematic diagram indicating the information. For example:

[0163] Figure 5 In (a), the number of time slots indicates the number of time slots that this node needs to transmit in the corresponding transmission path, and the time slot sequence number indicates the specific sequence number of the time slot that needs to be transmitted in the superframe.

[0164] Figure 5 In (b), the time slot bitmap represents the time slot reservation status. The i-th bit indicates whether the i-th time slot in the superframe is a working time slot. For example, a value of "1" indicates that the i-th time slot is a working time slot, and "0" indicates that the i-th time slot is a non-working time slot, and vice versa.

[0165] Figure 5 In (c), time slots with the same operating frequency band are combined. "Operating frequency band", "number of time slots", and "time slot number" indicate the number and specific number of time slots in a group under a specific operating frequency band.

[0166] Figure 5 In (d), the time slot-frequency band bitmap represents the working record of a time slot in a frequency band. The tuple (i, j) composed of time slot i and frequency band j indicates whether the i-th time slot is a working time slot in the j-th frequency band. For example, a value of "1" indicates that the i-th time slot is a working time slot in the j-th frequency band, and a value of "0" indicates that the i-th time slot is a non-working time slot in the j-th frequency band, and vice versa.

[0167] III. Reservation Information Form

[0168] Each node can store its own reservation information table. For example, the first node stores a first reservation information table, the second node stores a second reservation information table, the third node stores a third reservation information table, and the fourth node stores a fourth reservation information table, etc. The reservation information table can be used to indicate resources that the node cannot use, or the resources indicated by the reservation information table are resources occupied by other nodes. The reservation information table includes at least one reservation information entry, and the resource indicated by this entry is a resource occupied by another node. Furthermore, each node can update, add, or delete reservation information entries in its stored reservation information table based on information related to communication resources included in the received frames.

[0169] Figure 6 This is a schematic diagram of the reservation information entries. For example, the reservation information entries include, but are not limited to: source node address, destination node address, path identifier, network wave sequence number, and resource reservation information (the number of resource reservation information fields is not limited).

[0170] like Figure 6 As shown in (a), the resource reservation information includes: the address of the reservation receiving node, the number of reservation time slots, and the reservation time slot sequence number. The address of the reservation receiving node is the address of the data receiving node within the reserved time slot, the number of reservation time slots indicates the number of time slots reserved by the reservation receiving node, and the reservation time slot sequence number is the specific sequence number of these reservation time slots in the superframe.

[0171] like Figure 6 As shown in (b), the resource reservation information includes: the address of the reservation receiving node, the number of reservation time slot groups, the working frequency band, the number of time slots in the reservation time slot group, and the time slot sequence number of the reservation time slot group. The address of the reservation receiving node is the address of the data receiving node within the reserved time slot. The number of reservation time slot groups indicates the number of reservation time slot groups in this reservation information field (related to the number of working frequency bands; one working frequency band corresponds to one time slot). The working frequency band, the number of time slots, and the time slot sequence number respectively indicate the working frequency band, the number of time slots, and the specific time slot sequence number for each group of reservation time slots.

[0172] The storage format of communication resources in the work information table and the reservation information table can be consistent (e.g., the indication information in the work information table uses a bitmap format, while the resource reservation information in the reservation information table uses a non-bitmap format, and the bitmap and non-bitmap formats can be converted to each other) or inconsistent (e.g., the indication information in the work information table uses a bitmap format, while the resource reservation information in the reservation information table uses a bitmap format). Furthermore, the representation of communication resources mentioned below can be found in [reference needed]. Figure 5 The content mentioned above will not be repeated hereafter.

[0173] It should be noted that all nodes maintain a synchronized clock and divide their working periods into superframes with the same period. Each superframe contains several time segments (called time slots). The start time, end time, number of time slots, and duration of each time slot are the same and synchronized across all nodes for each superframe. After all nodes maintain the same clock and superframes, a particular time slot within a superframe can be represented by its index within the superframe.

[0174] IV. Path Table

[0175] Each node can establish a transmission path using different routing protocols, and during the path establishment process, it stores the relevant information of the transmission path in its respective path table. In this embodiment, the nodes have already established end-to-end transmission paths using existing routing technologies, and each node maintains the relevant path table. This embodiment does not limit the specific implementation of this process.

[0176] In this embodiment of the application, the path table includes, but is not limited to: path source node address, path destination node address, path identifier, previous hop node address, and next hop node address.

[0177] The source node address and destination node address of the path are the source node and destination node of this path.

[0178] Path identifiers are used to identify paths that consist of different nodes that share the same source and destination nodes.

[0179] A path source node, a path destination node, and a path sequence number can uniquely identify a transmission path. The next-hop node address is the receiving node at the next hop when this node transmits data to the path destination node through this transmission path. The previous-hop node address is the node that sent data to this node when transmitting data to the path destination node through this transmission path.

[0180] For the source node or destination node of the path, there is no previous hop node address and next hop node address respectively, and the corresponding fields can be filled with fields indicating invalid addresses.

[0181] V. Greedy Reservation Form

[0182] Each node can store its own greedy reservation table. For example, the first node stores a first greedy reservation table, the second node stores a second greedy reservation table, the third node stores a third greedy reservation table, the fourth node stores a fourth greedy reservation table, and so on. A node can determine whether it can reserve communication resources based on the presence of greedy reservation indication information in its greedy reservation table. Furthermore, each node can update, add, or delete entries in its stored greedy reservation table based on information related to network waves included in received frames.

[0183] In this embodiment of the application, the greedy reservation instruction information includes, but is not limited to: source node address, destination node address, path identifier, network wave sequence number, greedy reservation establishment node address, and timing time.

[0184] Among them, the source node address, destination node address, path identifier, and greedy reservation establishment node address in the greedy reservation instruction information can be understood as a greedy reservation instruction quadruple.

[0185] When a node's greedy reservation table contains a greedy reservation indication that has reached its scheduled time, the node searches for the corresponding reservation information entry in its reservation information table based on the source node address, destination node address, path identifier, and network wave sequence number corresponding to that scheduled time, deletes it, and simultaneously deletes the corresponding greedy reservation indication information from the greedy reservation table.

[0186] For descriptions of source node address, destination node address, path identifier, and network wave sequence number, please refer to the previous text.

[0187] The greedy reservation establishment node address is used to indicate the node in the path indicated by the path identifier that is establishing a greedy reservation. The timeout period indicates the validity period of the greedy reservation indication information, or in other words, when the timeout period expires (the start time of the timeout period is the moment when the node establishes the greedy reservation indication information), the node can delete the greedy reservation indication information.

[0188] One possible implementation is that a node can greedily reserve communication resources when there is no greedy pre-indication information in its greedy reservation table.

[0189] Another possible implementation is that a node can greedily reserve communication resources when its greedy reservation table only contains greedy reservation indication information corresponding to the network wave to which it belongs. For example, if node 1 belongs to network wave 1, and node 1's greedy reservation table includes greedy reservation indication information corresponding to network wave 1 (the greedy reservation establishment node address in the greedy reservation indication information is the address of node 2), then node 1 can reserve communication resources.

[0190] The aforementioned work information table, reservation information table, greedy reservation table, and network wave status table can all be updated, deleted, or added. For example, a node can update, delete, or add to the work information table, reservation information table, greedy reservation table, and network wave status table based on relevant information in the received frame, as described below.

[0191] As described in the background section, existing solutions often result in compromised quality of service (QoS) for communication services. Therefore, this application provides a communication method and apparatus capable of supporting and ensuring QoS for communication services.

[0192] The communication method of the present application embodiment is described below with reference to the accompanying drawings.

[0193] For ease of understanding and explanation, the communication method of this application embodiment is described below using a first node, a second node, and a third node as examples, but this should not constitute any limitation on the subject executing the communication method. For example, a node (such as a first node, a second node, or a third node) can be the node itself, a functional module (such as a circuit, a chip, or a chip system), or a logical node, logical module, or software that can implement all or part of the node's functions.

[0194] When the steps involving sending or receiving are performed by modules (such as circuits, chips, or chip systems), logic nodes, logic modules, or software in the first, second, and third nodes, sending / receiving can be understood as communicating through communication interfaces, input / output interfaces, pins, or circuits.

[0195] It should be noted that the content described below can be applied to the aforementioned one-way transmission scenario, two-way transmission scenario, and periodic transmission scenario. For ease of description, the following text uses the one-way transmission scenario as an example, but the content is also applicable to two-way transmission scenario and periodic transmission scenario.

[0196] Figure 7 This is a schematic diagram of the interaction flow of a communication method according to an embodiment of this application. Figure 7 This description uses the example of the first node as the source node, the second node as the intermediate node, and the third node as the destination node. Figure 7 As shown, the method includes:

[0197] S701, The first node determines the first frame.

[0198] The first frame is used to request the establishment of network wave 1 (the transmission path corresponding to network wave 1 includes the first node, the second node, and the third node). The first frame can be a wireless frame or a wired frame, without limitation. The first frame can also be replaced with other terms, such as network wave establishment request frame, without limitation.

[0199] The first node can determine the establishment state of network wave 1 based on the first network wave state table, which can be found in the description of the network wave state table.

[0200] One possible implementation is that the first frame includes, but is not limited to: the identification information of network wave 1, the reservation resource information of the first node, the address of the first node, and the address of the second node.

[0201] For example, the identification information of network wave 1 is used to identify network wave 1. Thus, the node that receives the first frame can determine whether to process the first frame based on the identification information of network wave 1 in the first frame. For example, the node that receives the first frame can determine whether it is located on the transmission path corresponding to network wave 1 based on the identification information of network wave 1 in the first frame. If it is a node on the transmission path corresponding to network wave 1, it will perform framing and forwarding processing; if it is not a node on the transmission path corresponding to network wave 1, it will not perform framing and forwarding processing.

[0202] For example, the reserved resource information of the first node is used to indicate the communication resources that the first node wishes to use for data transmission. In this way, it is possible to configure the communication resources for data transmission for the first node based on its reserved resource information.

[0203] For example, the address of the second node is determined by the first node based on the address of the next-hop node in the first path table. Thus, the second node can determine how to process the first frame based on the address of the second node in the first frame, such as framing and forwarding.

[0204] One possible implementation is that the identification information of network wave 1 includes the source node address, the destination node address, the path identifier, and the network wave sequence number. In this way, network wave 1 can be uniquely identified using the above information.

[0205] One possible implementation is that the first frame includes: a first field, a second field, a third field, and a fourth field. Specifically, the first field indicates the identification information of network wave 1, the second field indicates the reserved resource information of the first node (or it can be terms such as unreserved resource information or available resource information), the third field indicates the address of the first node, and the fourth field indicates the address of the second node.

[0206] The above fields enable the indication of the corresponding information in the first frame, thereby enabling the configuration of corresponding communication resources for each node on the transmission path corresponding to the network wave.

[0207] In one possible implementation, the first frame may also include a fifth field, which indicates the resource parameters of the first node. The resource parameters of the first node include: the address of the first node, the unavailable resource information of the first node (which can be terms such as reserved resource information or used resource information), the list of neighboring nodes of the first node (the list of neighboring nodes of the first node may not be included in the first frame when a control node exists), and the resource requirement information of the first node.

[0208] In this way, it is possible to configure the corresponding communication resources for the first node based on the resource parameters of the first node.

[0209] The unavailable resource information of the first node can indicate the resources indicated in the first working information table and the resources indicated in the first reservation information table. In this way, it is possible to support configuring the corresponding communication resources for the first node based on the unavailable resources of the first node.

[0210] The list of neighboring nodes of the first node can indicate the neighboring nodes of the first node. In this way, it is possible to determine the nodes that have an interference relationship with the first node based on the list of neighboring nodes of the first node (which can be understood as: two nodes that are active in the same time tick, one node will interfere with the correct reception of the corresponding information block receiving node of the other node).

[0211] The resource requirement information of the first node can indicate its resource needs. This allows for the configuration of appropriate communication resources for the first node based on its resource requirements.

[0212] One possible implementation is that the first frame may also include a sixth field, which indicates whether the transmission direction of the main service flow of network wave 1 is consistent with the transmission direction of at least one secondary service flow of network wave 1.

[0213] When the sixth field indicates that the transmission direction of the primary service flow of network wave 1 is inconsistent with the transmission direction of at least one secondary service flow of network wave 1, it indicates that network wave 1 can perform bidirectional transmission. When the sixth field indicates that the transmission direction of the primary service flow of network wave 1 is consistent with the transmission direction of the secondary service flow of network wave 1, it indicates that network wave 1 can perform unidirectional transmission.

[0214] This can thus support indicating whether the aforementioned network waves support bidirectional transmission.

[0215] For a description of the first frame, please refer to [link / reference]. Figure 8 .

[0216] Figure 8 This is a structural schematic diagram of the first frame of an embodiment of this application. For example... Figure 8 As shown, the first frame includes, but is not limited to:

[0217] Frame type, receive address, send address, source node address, destination node address, path identifier, network wave sequence number, lifecycle, multi-directional enable, greedy reservation information, and source node resource request information.

[0218] It should be noted that some fields in the first frame above are optional (such as lifecycle). Additionally, the first frame may include multiple resource request information fields (one resource request information field corresponds to one node).

[0219] Frame Type: Indicates the type of the first frame. Different values ​​for this field correspond to different frame types. For example, a value of 0 indicates that the first frame is a network wave request (NWREQ) frame, a value of 1 indicates that the first frame is a network wave response (NWREP) frame, a value of 2 indicates that the first frame is a network wave remove (NWREM) frame, and a value of 3 indicates that the first frame is a network wave reservation (NWRES) frame.

[0220] Receive address: The address of the next-hop receiving node in the first frame, i.e., the address of the second node. The receive address field can be a third field.

[0221] Sending address: The sending address of the first frame, i.e., the address of the first node. The sending address field can be the fourth field.

[0222] The descriptions of the source node address, destination node address, path identifier, and network wave sequence number can be found above. Among these, the source node address, destination node address, path identifier, and network wave sequence number can be the first field.

[0223] Lifecycle: Indicates the planned duration of use after network wave 1 is established.

[0224] Multidirectional Enable: Indicates whether the transmission direction of the slave service flow is allowed to be opposite to that of the master service flow. For example, a value of 1 indicates that multidirectional transmission is allowed, meaning that the transmission direction of the slave service flow is allowed to be opposite to that of the master service flow, and a value of 0 indicates that multidirectional transmission is not allowed, meaning that the transmission direction of the slave service flow is not allowed to be opposite to that of the master service flow. It should be noted that this field can also be replaced by a multidirectional disable field, with a value of 1 indicating that multidirectional transmission is disabled, and a value of 0 indicating that multidirectional transmission is allowed. The multidirectional enable field can be the sixth field.

[0225] Greedy reservation information: Indicates the communication resources for which the first node makes a greedy reservation. Greedy reservation can be understood as the process by which the first node establishes a reservation for some communication resources. This application embodiment does not limit the method for determining the greedy reservation resources.

[0226] Optionally, when only time slots are introduced, a node reserves all available time slots that it has not yet reserved; when both time slots and frequency bands are introduced, a node reserves all available time slots and frequency bands that it has not yet reserved. The greedy reservation information field can be the second field. For a description of the greedy reservation information, please refer to the aforementioned description of the reservation information table, which will not be repeated here.

[0227] Source node resource request information includes the resource requesting node address, the source node's neighbor node list, reserved information, and resource requirements. This information can be used to calculate the reserved resources (time slots and bandwidth, etc.) needed for network wave 1. The source node resource request information field can be the fifth field.

[0228] Resource request node address: The address of the first node, indicating the node to add "resource request information";

[0229] Neighbor list: This includes information such as the number and addresses of neighboring nodes, indicating the information of neighboring nodes within one hop of the first node. These neighboring nodes will act as interference nodes for the first node. It should be noted that the first node can record one-hop neighbor information by listening to packets sent by surrounding nodes.

[0230] The resource requirement field includes the resource requirement quantity, the destination node address of service flow 1, resource requirement 1 corresponding to service flow 1, the destination node address of service flow 2, and resource requirement 2 corresponding to service flow 2. "Resource requirement quantity" indicates the number of services that the first node needs to transmit via network wave 1. "Destination node address of service flow 1" represents the destination node address of service flow 1. The "Resource requirement 1 corresponding to service flow 1" field indicates the specific resources required for the transmission of service flow 1, which can be expressed in bandwidth or other forms.

[0231] The booked information field can be found here: Figure 9 .

[0232] Figure 9 This is a schematic diagram of the reserved information field in an embodiment of this application. Example:

[0233] like Figure 9 As shown in (a), the "Number of Reservation Slots" field indicates the total number of reservation slots, and the "Reservation Slot Sequence Number" field indicates the specific sequence number of the reservation slot in the superframe.

[0234] like Figure 9 As shown in (b), the "Network Wave Reservation Quantity" field indicates the total number of network wave reservation time slots stored in the node. The "Network Wave Reservation Information" distinguishes different network wave information through "Source Node Address", "Destination Node Address", "Path Identifier" and "Network Wave Sequence Number". The "Reservation Time Slot Quantity" and "Reservation Time Slot Sequence Number" are the number of time slots reserved for this network wave in the superframe and the specific time slot sequence number.

[0235] like Figure 9 As shown in (c), without distinguishing the specific information of existing network waves, only the total bitmap information of each network wave reservation is recorded (the i-th bit indicates whether the i-th time slot in the superframe is a reserved time slot; for example, a value of "1" indicates that the time slot has been reserved, and "0" indicates that the time slot has been reserved).

[0236] This indicates that the time slot has not been reserved, and vice versa. Taking the union of the bitmaps of each network wave reservation yields the total bitmap information for all network wave reservations. (This can be achieved by performing a bitwise OR operation on each bitmap to obtain the final total bitmap.)

[0237] like Figure 9 As shown in (d), the specific reservation time slot information for each network wave is also represented by a bitmap.

[0238] like Figure 9 As shown in (e), network wave reservation slots with the same reservation frequency band are combined. "Number of reservation slot groups" refers to the number of reservation slots grouped according to different operating frequency bands. "Reservation slot group frequency band", "Number of reservation slot groups", and "Reservation slot group number" indicate the number and specific number of reservation slots in a group under a specific reservation frequency band.

[0239] like Figure 9 As shown in (f), the reservation slots for each network wave are grouped according to different reservation frequency bands, and the number of reservation slot groups is...

[0240] This refers to the number of time slots grouped according to different frequency bands. "Time slot group frequency band", "number of time slot groups", and "time slot group number" indicate the number and specific number of time slots in a group under a specific reservation frequency band.

[0241] like Figure 9 As shown in (g), without distinguishing the specific information of existing network waves, the total time slot-frequency band two-dimensional bit map information of all network waves is recorded. Each bit of the two-dimensional bit map indicates whether a time slot has been reserved in a frequency band. The tuple composed of time slot and frequency band indicates whether the i-th time slot has been reserved in the i-th frequency band. For example, a value of "1" indicates that the i-th time slot has been reserved in the i-th frequency band, and a value of "0" indicates that the i-th time slot has not been reserved in the i-th frequency band, and vice versa.

[0242] like Figure 9 As shown in (h), the specific reservation resource information for each network wave is also represented by a two-dimensional bit map of time slots and frequency bands.

[0243] Specifically, the first node can query the first network wave state table and fill in the "source node address", "destination node address", "path identifier" and "network wave sequence number" corresponding to network wave 1 in the first frame. Based on the records in the first reservation information table and the first working information table, it can determine all remaining available idle resources (i.e., remaining resources not recorded in the reserved information table and the working information table) and fill in these idle resources in the "greedy reservation information" of the first frame. Additionally, the first node can add information such as its neighbor node list, reserved information (i.e., information about the resources indicated in the first working information table and the first reservation information table), and resource requirements to the source node resource request information.

[0244] S702, the first node sends the first frame. Correspondingly, the second node receives the first frame.

[0245] The first node can broadcast the first frame, which is received by multiple nodes, including the second, third, and fourth nodes. Among them, the fourth node is an external node of network wave 1.

[0246] When any node receives the first frame, it can determine its node type based on the content of the first frame. For example, if the node's address is the same as both the "receive address" and the "destination node address" of the first frame, it is a next-hop and destination node. If the node's address is the same as the "receive address" but different from the "destination node address," it is a next-hop but not a destination node. If the node's address is different from the "receive address" of the first frame, the node checks its stored path table to see if the "source node," "destination node," and "path identifier" information are stored. If the corresponding information is found, it is a non-next-hop and in-path node. Nodes that do not belong to any of the above three types are non-next-hop and out-of-path nodes.

[0247] Different nodes process the first frame differently. The third node does not process the first frame, and the second node processes the first frame differently than the fourth node.

[0248] The following describes how the fourth node processes the first frame.

[0249] When the fourth node receives the first frame, it queries the fourth greedy reservation table and performs the following operations:

[0250] (i) If the fourth greedy reservation table does not contain greedy reservation instruction information, proceed to step (iii).

[0251] (ii) If the fourth greedy reservation table stores greedy reservation indication information corresponding to the source node address, destination node address, path identifier and the address of the first node in the first frame, then compare the network wave sequence number in the found greedy reservation indication information with the network wave sequence number in the first frame. If the network wave sequence number in the greedy reservation indication information is less than the network wave sequence number in the first frame, then delete the found greedy reservation indication information and proceed to step (iii).

[0252] (iii) Based on the identification information of network wave 1 in the first frame, search for the reservation information entry of network wave 1 in the fourth reservation information table. If no reservation information entry of network wave 1 is found, create a reservation information entry of network wave 1 in the fourth reservation information table with the identification information of network wave 1, and supplement the reservation information entry of network wave 1 with "resource reservation information of network wave 1"; if a reservation information entry of network wave 1 is found, update the reservation information entry of network wave 1 with "resource reservation information of network wave 1".

[0253] The fourth node can supplement or update the specific content of "resource reservation information of network wave 1" based on the "greedy reservation information" in the first frame: fill in the address of the first node in "reservation receiving node address", and take time slot resources as an example, fill in the "reservation time slot quantity" and "reservation time slot sequence number" in the "greedy reservation information" in the first frame in "reservation time slot quantity" and "reservation time slot sequence number".

[0254] Optionally, the fourth node adds a greedy reservation instruction to the fourth greedy reservation table that corresponds to the identification information of network wave 1, and starts the greedy reservation timer, filling in the "timer duration".

[0255] S703, the second node determines the fourth frame based on the first frame.

[0256] When the second node receives the first frame, it queries the second greedy reservation table and performs the following operations:

[0257] (i) If the second greedy reservation table does not store greedy reservation instruction information, the second node queries the second network wave status table based on the "source node", "destination node" and "path identifier" in the first frame to determine the establishment status of network wave 1. If there is no network wave status information for network wave 1, proceed to step (iii). If there is network wave status information for network wave 1, the second node compares the network wave sequence number in the network wave status information of network wave 1 in the second network wave status table with the "network wave sequence number" in the first frame. If the network wave sequence number in the network wave status information of network wave 1 in the second network wave status table is less than the "network wave sequence number" in the first frame, the second node deletes the network wave status information of network wave 1 in the second network wave status table and proceeds to step (iii).

[0258] (ii) If the second greedy reservation table stores greedy reservation indication information, the second node executes step (iii) after determining that all the greedy reservation indication information in the second greedy reservation table has reached its corresponding timing time. It should be noted that, optionally, when the second greedy reservation table only stores the greedy reservation indication information corresponding to network wave 1 (the greedy reservation establishment node address in the greedy reservation indication information is not the address of the second node, such as the address of the first node, etc.), the second node can also perform greedy reservation and execute step (iii).

[0259] (III) The second node performs frame assembly processing on the first frame to obtain the fourth frame. This frame assembly processing can be understood as the process by which the second node adds its own relevant information to the first frame. For example, the second node adds its own reserved resource information and the address of the third node to the first frame. For instance, the second node modifies the receiving address field in the first frame and fills in the missing information.

[0260] The fourth frame includes the address of the third node, and the reservation resource information of the second node is added to the greedy reservation information field. Therefore, the fourth frame includes the identification information of network wave 1, the reservation resource information of the first node, the address of the first node, the address of the third node, and the reservation resource information of the second node.

[0261] Specifically, the second node can determine all remaining available free resources based on the resource information in the second reservation information table and the second work information table, and fill in the information of the free resource in the "greedy reservation information" in the first frame. The second node also adds the resource request information of the second node after the resource request information of the source node in the first frame. The resource request information of the second node includes the address of the second node, the list of neighboring nodes of the second node (when there is a control node, the list of neighboring nodes of the second node may not be included in the first frame), the reservation information of the second node, and the resource requirements of the second node.

[0262] The second node can store the network wave status information of network wave 1 in the second network wave status table based on the identification information of network wave 1. The "Network Wave Status" in the network wave status information of network wave 1 in the second network wave status table is "Requesting". The second node starts the network wave request timer and fills in the "Timer Duration" in the "Status Parameter". When the timer duration of this network wave request is reached, the second node will delete the network wave status information of network wave 1 in the second network wave status table.

[0263] The second node can query and determine the "next-hop node address" of the second node in the second path table based on the "source node", "destination node" and "path identifier", fill it into the "receive address" of the first frame, and forward the fourth frame (which is obtained based on the first frame).

[0264] One possible implementation is that the fourth frame includes: a first field, a second field, a third field, a fourth field, and a fifth field. The first field indicates the identification information of network wave 1, the second field indicates the reserved resource information of the first node, the third field indicates the address of the first node, the fourth field indicates the address of the third node, and the fifth field indicates the reserved resource information of the second node.

[0265] The above fields enable the indication of corresponding information in the fourth frame, thereby enabling the configuration of corresponding communication resources for each node on the transmission path corresponding to the network wave.

[0266] One possible implementation is that the fourth frame also includes a sixth field and a seventh field. The sixth field indicates the resource parameters of the first node, and the seventh field indicates the resource parameters of the second node. A description of the node resource parameters can be found above and will not be repeated here.

[0267] In this way, it is possible to configure the corresponding communication resources for the first node and the second node respectively based on the resource parameters of the first node and the resource parameters of the second node.

[0268] One possible implementation is that the fourth frame also includes an eighth field, which indicates whether the transmission direction of the main service flow of network wave 1 is the same as the transmission direction of at least one secondary service flow of network wave 1.

[0269] This can thus support indicating whether the aforementioned network waves support bidirectional transmission.

[0270] S704, the second node sends the fourth frame. Correspondingly, the third node receives the fourth frame.

[0271] For example, the second node broadcasts the fourth frame, and multiple nodes receive the fourth frame, including the first node, the third node, and the fourth node.

[0272] When any node receives the fourth frame, it determines its node type based on the content of the fourth frame. For example, if the node's address is the same as both the "receive address" and the "destination node address" of the fourth frame, it is a next-hop and destination node. If the node's address is the same as the "receive address" but different from the "destination node address," it is a next-hop but not a destination node. If the node's address is different from the "receive address" of the fourth frame, the node checks its stored path table to see if the "source node," "destination node," and "path identifier" information are stored. If the corresponding information is found, it is a non-next-hop and in-path node. Nodes that do not belong to any of the above three types are non-next-hop and out-of-path nodes.

[0273] Different nodes process the received fourth frame differently. The first node does not process the fourth frame, the third node processes the fourth frame differently than the fourth node. The fourth node processes the fourth frame in the same way as it processes the first frame, so it will not be described again.

[0274] The following describes how the third node processes the fourth frame.

[0275] When the third node receives the fourth frame, it performs the following processing:

[0276] (i) If the third greedy reservation table does not store greedy reservation instruction information, the third node queries the establishment status of network wave 1 in the third network wave status table based on the identification information of network wave 1 in the fourth frame. When the third node does not find the network wave status information of network wave 1, it executes step (iii). When the third node finds the network wave status information of network wave 1, if the network wave sequence number of the network wave status information of network wave 1 in the third network wave status table is less than the network wave sequence number in the fourth frame, the third node can delete the status information of network wave 1 in the third network wave status table and execute step (iii).

[0277] (ii) If the third greedy reservation table stores greedy reservation indication information, the third node stores the fourth frame, and executes step (iii) only after all greedy reservation indication information in the third greedy reservation table has reached its corresponding timeout. It should be noted that, optionally, when the third greedy reservation table only stores greedy reservation indication information corresponding to network wave 1 (the greedy reservation establishment node address in this greedy reservation indication information is an address other than the third node, such as the address of the second node or the first node, etc.), the third node can also perform greedy reservation and execute step (iii).

[0278] (III) The third node performs frame assembly processing on the fourth frame to obtain the processed fourth frame. This frame assembly processing can be a process where the third node adds its own relevant information to the fourth frame. For example, the third node adds its own reservation resource information to the greedy reservation information in the fourth frame. Therefore, the processed fourth frame includes the identification information of network wave 1, the reservation resource information of the first node, the address of the first node, the address of the third node, the reservation resource information of the second node, and the reservation resource information of the third node.

[0279] Specifically, based on the "greedy reservation information" in the fourth frame, the third node supplements the "resource reservation information for network wave 1" with the following: The "Reservation Receiving Node Address" is entered with the address of the first node. Taking time slot resources as an example, the "Number of Reserved Time Slots" and "Reserved Time Slot Sequence Number" are entered with the "Number of Reserved Time Slots" and "Reserved Time Slot Sequence Number" from the "greedy reservation information" in the fourth frame. The "Node Resource Request Information" is then supplemented with the third node's list of neighboring nodes, reservation information, and resource requirements.

[0280] Additionally, the third node stores the network wave status information of network wave 1 in the third network wave status table, with the "request status" set to "in progress" and starts a network wave request timer, entering the "timeout period" in the "status parameters". When the timeout period of this network wave request timer is reached, the third node will delete the network wave status information of network wave 1.

[0281] Once the third node completes the framing process for the fourth frame, it broadcasts the processed fourth frame. This allows other nodes to obtain information about resource reservations for network wave 1.

[0282] S705, the third node determines the second frame based on the fourth frame.

[0283] The second frame is used to respond to the first frame. The second frame includes the identification information of network wave 1 and the resource usage information of each node on the transmission path corresponding to network wave 1 (this can also be termed configuration resource information, available resource information, or final transmission resource information for each node, etc., without limitation). The third node can determine the second frame itself, or the control node can determine the second frame. The following description uses the example of the third node determining the second frame itself. For details on the content of the second frame determined by the control node, please refer to the following description.

[0284] The third node can calculate the communication resources used by network wave 1 based on the information in the fourth frame, specifically including the following process:

[0285] 1. Determine the interference relationship table based on the list of neighboring nodes for each node in the fourth frame;

[0286] 2. Calculate the interference spacing distribution table;

[0287] 3. Calculate the natural period;

[0288] 4. Divide the concurrent nodes into equally spaced lists;

[0289] 5. Allocate final resources.

[0290] For example, the third node determines the interference relationship table based on the list of neighboring nodes of each node in the fourth frame. The interference relationship table is a storage format of the interference relationship matrix in network wave theory; however, this application does not impose specific limitations on the storage format of the interference relationship matrix. A description of the interference relationship table can be found in Table 1.

[0291] Table 1

[0292]

[0293] As shown in Table 1, the interference relationship between node i (1≤i≤N-1) and node j (1≤j≤N-1) is represented by (i,j). For (i,j) (i≠j), if node i is a neighbor of node j+1, or node j is a neighbor of node i+1, then (i,j)=1; if node i is not a neighbor of node j+1 and node j is not a neighbor of node i+1, then (i,j)=0; for (i,j) (i=j), 0 can be filled in uniformly.

[0294] One possible example is that the third node calculates the aforementioned interference relationship table according to the algorithm shown in Table 2.

[0295] Table 2

[0296] IcSuqare[N-1][N-1] = Initial(); / / Initialize all elements of the two-dimensional array interference relation table to 0. for i = 1:N-1 / / Iterate through the nodes and select the sending nodes List[i+1] = GetList(i+1); / / Get the list of neighboring nodes of node i that receive node i+1, List[i+1] M = GetListNum(List[i+1]); / / Get the number of nodes in the neighbor node list List[i+1]; for j = 1:M / / Iterate through the list of neighboring nodes and select the nodes. if i == j / / If node i and node j have the same index, skip this step. Continue; else for k = 1:N / / Iterate through the nodes in the current path and compare them with the nodes in the neighbor list. if List[i+1][j] == k / / Node k is a one-hop neighbor of node i+1, and they interfere with each other. IcSuqare[i][k]=1; / / (i,k)=1 IcSuqare[k][i]=1; / / (k,i)=1 end if end for end if end for end for

[0297] Thus, the third node can calculate the interference relationship table based on the content shown in Table 2.

[0298] For example, the third node obtains the interference spacing distribution table based on the aforementioned interference relationship table. The interference spacing distribution table is a storage format of the interference spacing distribution spectrum in network wave theory; this application embodiment does not impose specific limitations on the storage format. See Table 3. In this table, the number of node pairs with interference spacing of i (1≤i≤N-2) is equivalent to the spectral line intensity of the interference spacing spectrum in network wave theory.

[0299] Table 3

[0300] Number of node pairs with an interference spacing of 1 Number of node pairs with an interference spacing of 2 … Number of node pairs with an interference spacing of N-2

[0301] One possible example is that the third node can calculate the above interference spacing distribution table according to the algorithm shown in Table 4.

[0302] Table 4

[0303]

[0304] Thus, the third node can calculate the interference spacing distribution table based on the content shown in Table 4.

[0305] For example, the third node can determine the inherent period based on the interference spacing distribution table described above. One possible example is that the minimum period of the equally spaced zeros in the interference spacing distribution table can be considered as the inherent period. For instance, the third node can divide the concurrent nodes into equally spaced subsets based on the inherent period and the address of each node in the transmission path corresponding to network wave 1. See Table 5.

[0306] Table 5

[0307] Concurrent subset 1 node 1 address Concurrent subset 1 node 2 address … Concurrent subset 2 nodes 1 address Concurrent subset 2 nodes 2 addresses … Concurrent subset K node 1 address Concurrent subset K node 2 address …

[0308] As shown in Table 5, the first node of each concurrent subset can be determined as i (1≤i≤K), and the index of the concurrent subset is also i (1≤i≤K).

[0309] One possible example is that the third node can be determined based on the content shown in Table 6, which represents the equally spaced concurrent subsets.

[0310] Table 6

[0311] Nodes[N-1] = GetNodes(); / / Get the non-network target nodes in this path, assuming the natural period is K. Subset[K][] = Initial(); / / Initialize the equally spaced concurrent subset table for i = 1:K / / Iterate through and select the first node of each equally spaced concurrent subset. n＝0； while((i+n*K)<N) AddNodes(Subset[i],(i+n*K)) / / Adds the node with index i+n*K to the concurrent subset i. n++； end while end for

[0312] Thus, the third node can calculate equally spaced concurrent subsets based on the content shown in Table 6.

[0313] Tables 1 to 6 describe the process using unidirectional transmission as an example. For information on bidirectional transmission, please refer to Tables 7 to 12.

[0314] Table 7

[0315]

[0316] As shown in Table 7, the interference relationship between node i (1≤i≤N-1) and node j (1≤j≤N-1) is represented by (i,j).

[0317] For bidirectional transmission scenarios, there are bidirectional service flows. When 2≤j≤N-2, the receiving nodes of node j are nodes j+1 and j-1; when j=1, the receiving node of node j is node j+1; when j=N, the receiving node of node j is node j-1. When 2≤i≤N-2, the receiving nodes of node i are nodes i+1 and i-1; when i=1, the receiving node of node i is node i+1; when i=N, the receiving node of node i is node i-1. For (i, j) (i≠j), if node i is a neighbor of node j (including nodes j-1 and j+1), or node j is a neighbor of node i (including nodes i-1 and i+1), then (i, j) = 1; if node i is not a neighbor of node j, and node j is not a neighbor of node i, then (i, j) = 0; for (i, j) (i=j), 0 can be uniformly filled in. One possible example is that the third node calculates the aforementioned interference relationship table according to the algorithm shown in Table 8.

[0318] Table 8

[0319] IcSuqare[N][N] = Initial(); / / Initialize all elements of the two-dimensional array interference relation table to 0. for i = 1:N / / Iterate through and select sending nodes GetNighborNodes(i); / / Get the list of neighboring nodes of node i. for j=1:N if node i and node j have the same index Continue; else If node j is a neighbor of the receiving node of node i. IcSuqare[i][j]=1; / / (i,j)=1 IcSuqare[j][i]=1; / / (j,i)=1 else continue; end if end if end for end for

[0320] Thus, the third node can calculate the interference relationship table based on the content shown in Table 8.

[0321] For example, the third node obtains the interference spacing distribution table based on the interference relationship table mentioned above. See Table 9. The number of node pairs with interference spacing of i (1≤i≤N-1) is equivalent to the spectral intensity of the interference spacing spectrum in network wave theory. .

[0322] Table 9

[0323] Number of node pairs with an interference spacing of 1 Number of node pairs with an interference spacing of 2 … Number of node pairs with an interference spacing of N-2

[0324] One possible example is that the third node can calculate the above interference spacing distribution table according to the algorithm shown in Table 10.

[0325] Table 10

[0326]

[0327] Thus, the third node can calculate the interference spacing distribution table based on the content shown in Table 10.

[0328] For example, the third node can determine the inherent period based on the interference spacing distribution table described above. One possible example is that the minimum period of the equally spaced zeros in the interference spacing distribution table can be considered as the inherent period. For instance, the third node can divide the concurrent nodes into equally spaced subsets based on the inherent period and the address of each node in the transmission path corresponding to network wave 1. See Table 11.

[0329] Table 11

[0330] Concurrent subset 1 node 1 address Concurrent subset 1 node 2 address … Concurrent subset 2 nodes 1 address Concurrent subset 2 nodes 2 addresses … Concurrent subset K node 1 address Concurrent subset K node 2 address …

[0331] As shown in Table 11, the first node of each concurrent subset can be determined as i (1≤i≤K), and the index of the concurrent subset is also i (1≤i≤K).

[0332] One possible example is that the third node can be determined as an equally spaced concurrent subset based on the content shown in Table 12.

[0333] Table 12

[0334] Nodes[N] = GetNodes(); / / Get the non-network target nodes in this path, assuming the natural period is K. Subset[K][] = Initial(); / / Initialize the equally spaced concurrent subset table for i = 1:K / / Iterate through and select the first node of each equally spaced concurrent subset. n＝0； while((i+n*K)<N) AddNodes(Subset[i],(i+n*K)) / / Adds the node with index i+n*K to the concurrent subset i. n++； end while end for

[0335] Thus, the third node can calculate equally spaced concurrent subsets based on the content shown in Table 12.

[0336] Once the third node determines the above information, it can determine the final transmission resources for each concurrent node subset based on the equally spaced concurrent subsets, the resource requirements of each service flow, and the reserved resource information of each node. This includes reserved time slots and frequency bands, which are required to be used together to indicate the fluctuating transmission of the corresponding node. The following content applies to both unidirectional and bidirectional transmission scenarios.

[0337] The third node may follow these principles when allocating reserved time slots and frequency bands:

[0338] 1) When each subset of concurrent nodes performs fluctuating transmission in its respective scheduled working time slot and working frequency band, it is necessary to meet the resource requirements of each service flow. If this cannot be met, the resource requirements of some service flows can be discarded according to different processing methods.

[0339] 2) For the final transmission resources of each node within a concurrent node subset: there is no restriction on whether the sequence number of the reserved time slot is consecutive; the reserved time slots and frequency bands of nodes belonging to the same concurrent node subset should be as consistent as possible, but it is not excluded that the reserved time slots and frequency bands of specific nodes within a concurrent node subset are different from those of the other nodes in the subset.

[0340] 3) Final transmission resources for different concurrent node subsets: The reserved time slots and frequency bands of each concurrent node subset should have as little overlap as possible (i.e., the reserved time slots of each concurrent node subset should not be the same as the other, and the frequency bands should not overlap as much as possible).

[0341] 4) The final transmission resources of each node in network wave 1 cannot overlap with the transmission resources recorded in the reservation information table and working information table of each node.

[0342] The third node can allocate final transmission resources to network wave 1 according to the above principles, without limiting the specific method.

[0343] The following is an example of an algorithm where the frequency band is fixed and only reserved time slots are allocated:

[0344] 1) Express the bandwidth required by the service flow in terms of its demand for transmission resources, convert the bandwidth demand into the demand for the number of transmission time slots, and take the maximum number of time slots required among all service flows as the target number of time slots.

[0345] 2) For a subset i of equally spaced concurrent nodes (1≤i≤K), take the intersection S of the idle time slots of all nodes in the subset, and the intersection G of the idle time slots of the corresponding receiving node (i.e., the next-hop node) of each node. Take the intersection of S and G again, and use it as the final set of available idle time slots S for the equally spaced concurrent node subset. i (1≤i≤K).

[0346] 3) Following the ascending order of the indices of the equally spaced concurrent node subsets, sequentially in S... i A time slot is determined, and these time slots are guaranteed to have different sequence numbers; this is used as a reserved time slot. This process is repeated until the number of time slots meets the target time slot requirement. If the time slot requirement cannot be met even when all available time slots are used up, then, while prioritizing the main business flow from the source node to the destination node,

[0347] The business flow with the largest demand for time slots is discarded one by one until the scheduled time slots can meet the needs of the remaining business flows.

[0348] Once the third node has completed the above steps, it can determine the second frame based on the above content. The second frame is used to respond to the first frame.

[0349] Figure 10This is a schematic diagram of the second frame in an embodiment of this application. Exemplary examples include, but are not limited to:

[0350] Frame type, receive address, send address, source node address, destination node address, path identifier, network wave sequence number, lifecycle, multi-directional enable, network wave reservation information, and node resource information.

[0351] like Figure 10 As shown in (a), node resource information can be represented as concurrent subset reservation information (which may include multiple concurrent subset reservation information, depending on the number of concurrent subsets that can be divided in the transmission path corresponding to network wave 1). The concurrent subset reservation information includes concurrent subset number, number of concurrent subset nodes, concurrent subset node address, and resource reservation information. The resource reservation information in the concurrent subset reservation information applies to all nodes in the concurrent subset corresponding to the concurrent subset number in the concurrent subset reservation information; in other words, nodes within this concurrent subset can perform concurrent data transmission, i.e., transmit simultaneously on the same resource.

[0352] like Figure 10 As shown in (b), node resource information can be represented as node reservation information, which includes node address and resource reservation information. The number of node reservations depends on the number of nodes in the transmission path corresponding to network wave 1.

[0353] Receive address: The address of the next-hop receiving node in the second frame. The third node queries the third path table based on the identification information of network wave 1 to find the "previous hop node address" of the path indicated by the source node, destination node, and path identifier, and determines the receive address, which is the address of the second node.

[0354] Sending address: The sending address of the second frame, that is, the address of the third node.

[0355] The source node address, destination node address, path identifier, network wave sequence number, lifecycle, and multi-directional enable fields correspond to the same fields as those in the first frame.

[0356] Network wave reservation information (optional field): The representation is the same as the "greedy reservation information" in the first frame. It should be noted that if the network wave reservation information is represented as a bitmap, the node should convert it to a non-bitmap representation before storing it in the relevant reservation information entry of the reservation information table.

[0357] Specifically, the resources indicated by the network wave reservation information in the second frame are resources configured by the third node for the second node. The node receiving the second frame can update the reservation information entries in its respective reservation information table based on the resources indicated in the network wave reservation information.

[0358] In addition, the nodes that receive the second frame can also update the reservation information entries in their respective reservation information tables according to the resources indicated by the node resource information (including concurrent subset reservation information or node reservation information) in the second frame.

[0359] Optionally, the network wave reservation information mentioned above may include an index corresponding to a certain concurrent subset in the concurrent subset reservation information. The node that receives the second frame can query the resource information of the corresponding concurrent subset from the concurrent subset reservation information based on the index.

[0360] Optionally, the network wave reservation information mentioned above may include an index corresponding to a certain node reservation information in the node reservation information. The node that receives the second frame can query the resource information of the corresponding node reservation information from the node reservation information according to the index.

[0361] When the second frame adopts as follows Figure 10 When in form (a), the concurrent subset reservation information refers to the reservation information of all equally spaced concurrent subsets in the transmission of network wave 1, used by nodes in network wave 1 to query the reservation information of their respective concurrent subsets. If the nodes in the transmission path corresponding to network wave 1 are divided into K equally spaced concurrent subsets, then for equally spaced concurrent subset i (1≤i≤K), the concurrent subset index is the index i of that equally spaced concurrent subset; the number of concurrent subset nodes is the number of nodes included in subset i; the concurrent subset node address is the address of each node in subset i; and the reservation information is the reservation information of subset i in network wave 1, which is represented in the same way as the aforementioned "network wave reservation information" field. It should be noted that when the second frame adopts the following... Figure 10 When it is in the form of (a), the reservation information of the nodes within each subset of concurrent nodes is consistent.

[0362] When the second frame adopts as follows Figure 10 In form (b), the node reservation information is used to indicate the reservation information of each node in the transmission path of network wave 1, and consists of "node address" and "reservation information". "Reservation information" refers to the reservation information of the node corresponding to the "node address", and its representation method is the same as the aforementioned "network wave reservation information". The second frame uses the following... Figure 10 In the form of (b), the reservation information of nodes within each concurrent node subset can be inconsistent. That is, when a specific node within a concurrent node subset has a reservation time period and frequency band that differs from the other nodes in the subset, it is necessary to use... Figure 10The reservation information for each node is stored separately in the form of (b).

[0363] Once the third node determines the resources for each node, it updates the third reservation information table, as detailed above. When the second frame uses... Figure 10 When in form (a), the third node unifies the reservation information of all concurrent node subsets into a single "total reservation information" and fills in the address of the third node in the "reservation receiving node address". When the second frame adopts the form (a)... Figure 10 In the form of (b), the third node treats all node reservation information as a "total reservation information" and fills in the address of the third node in the "reservation receiving node address".

[0364] One possible implementation is that after the third node determines the resources of each node, the third node fills in the communication resources used by the second node in the network wave reservation information in the second frame, and fills in the address of the second node in the receiving address in the second frame.

[0365] The third node updates the state information of network wave 1 in the third network wave state table based on the second frame, as described above.

[0366] S706, the third node sends the second frame. Correspondingly, the second node receives the second frame.

[0367] The third node broadcasts the second frame, and multiple nodes receive the second frame, including the first node, the second node, and the fourth node.

[0368] When any node receives the second frame, it can determine its node type based on the content of the second frame. For example, if the node's address is the same as both the "receive address" and the "source node address" of the second frame, it is a next-hop and source node. If the node's address is the same as the "receive address" but different from the "source node address," it is a next-hop and non-source node. If the node's address is different from the "receive address," the node checks its stored path table to see if the "source node," "destination node," and "path identifier" information are stored. If the corresponding information is found, it is a non-next-hop and in-path node. Nodes that do not belong to any of the above three types are non-next-hop and out-of-path nodes.

[0369] Different nodes process the received second frame in different ways. The first node does not process the second frame, while the second node processes the second frame in a different way than the fourth node.

[0370] The following describes how the fourth node processes the second frame.

[0371] After the fourth node receives the second frame, it performs the following processing:

[0372] (i) Based on the identification information of network wave 1 in the second frame, search for the reservation information entry of network wave 1 in the fourth reservation information table, and further search for the reservation information in the reservation information entry where the "reservation receiving node address" is the address of the third node. Delete the "resource reservation information" in the found reservation information entry and fill in the network wave reservation information of the received second frame. The resource indicated by the network wave reservation information is the resource used by the second node.

[0373] (ii) Based on the identifier information of network wave 1 in the second frame, query the corresponding greedy reservation instruction information in the fourth greedy reservation table. If the greedy reservation instruction information for network wave 1 is found, delete it. If the greedy reservation instruction information for network wave 1 is not found,

[0374] No action will be taken.

[0375] (iii) Check if there are any other greedy reservation instructions in the fourth greedy reservation table. If there are no other greedy reservation instructions in the fourth greedy reservation table, check if there is a frame stored for executing greedy reservations, such as the first frame or the second frame. If so, the processing behavior of the second node on the first frame or the processing behavior of the third node on the fourth frame, as described above, can be executed. If not, no operation is performed. If there are other greedy reservation instructions in the fourth greedy reservation table, no operation is performed.

[0376] One possible implementation is that the fourth node can fill the fourth reservation information table with the concurrent subset reservation information or the resource information from the node reservation information in the second frame. Accordingly, the second frame may not include network wave reservation information, which can reduce the signaling overhead of the second frame.

[0377] S707, the second node determines the fifth frame based on the second frame.

[0378] When the second node receives the second frame, it performs frame reassembly processing on the second frame to obtain the fifth frame. This frame reassembly processing can involve the second node filling the network wave reservation information in the second frame with the resource information of the first node from the second frame.

[0379] For example, when the second frame is in the form of Figure 10 When (a) occurs, the second node fills the reservation information of the concurrent subset to which the first node belongs into the network wave reservation information.

[0380] For example, when the second frame is in the form of Figure 10 In (b), the second node fills the first node's node reservation information into the network wave reservation information.

[0381] The second node can also query the status information of network wave 1 in the second network wave status table based on the identification information of network wave 1 in the second frame. If the status information of network wave 1 is found, the "Request Status" is changed to "Established", and the "Lifetime" of the fifth frame is entered in the "Status Parameters". If the status record of network wave 1 is not found, the second node creates a new status information entry for network wave 1 in the second node's network wave status table based on the identification information of network wave 1, and enters "Established" in the "Request Status" of the new network wave status information and enters the "Lifetime" of the second frame in the "Status Parameters".

[0382] The second node can also update the second job information table and the second appointment information table based on the second frame (or the fifth frame).

[0383] In the form of the second frame Figure 10 As shown in (a):

[0384] The second node adds a new work information entry to the second work information table and fills in "source node", "destination node", "path identifier" and "network wave sequence number"; "receiving node" is the "next hop node address" of the network wave 1 transmission path queried by the second node in the second path table; "indication information" is the final transmission resource reservation information of the equally spaced concurrent subset to which the second node belongs in the "concurrent subset reservation information" field in the second frame.

[0385] The second node adds a reservation information entry to the second reservation information table, and fills in the "source node", "destination node", and "path identifier".

[0386] The "Network Wave Sequence Number" and the reservation information for all other equally spaced concurrent node subsets (excluding the second node's subset) are grouped into a single "Sum Reservation Information". Enter the address of the second node in the "Reservation Receiving Node Address" field of this newly added reservation information entry.

[0387] In the form of the second frame Figure 10 As shown in (b):

[0388] The second node adds a new work information entry to the second work information table and fills in "source node", "destination node", "path identifier" and "network wave sequence number"; "receiving node" is the "next hop node address" of the network wave 1 transmission path queried by the second node in the second path table; "indication information" is the final transmission resource reservation information of the second node in the "node reservation information" in the second frame.

[0389] The second node adds a reservation information entry to the second reservation information table, and fills in the "source node", "destination node", and "path identifier".

[0390] The reservation information for the subset other than the second node is combined into a single "sum reservation information". Enter the address of the second node in the "Reservation Receiving Node Address" field of this newly added reservation information entry.

[0391] S708, the second node sends the fifth frame. Correspondingly, the first node receives the fifth frame.

[0392] When the first node receives the fifth frame, it processes the fifth frame. For example, the first node updates the corresponding network wave status information in the first network wave status table according to the identification information of network wave 1 in the fifth frame, and updates the first working information table and the first reservation information table according to the fifth frame. The specific process can be found above and will not be repeated here.

[0393] In this way, it can support the completion of framing and forwarding of the second frame, and thus enable nodes on the transmission path that do not belong to the network wave to choose not to occupy the resources used by each node on the transmission path according to the fourth frame, thereby reducing the probability of resource conflicts and ensuring the quality of service of communication services.

[0394] After the first node completes the framing process for the fifth frame, the first node broadcasts the processed fifth frame. For details, please refer to the previous description of the third node broadcasting the processed fourth frame, which will not be repeated here.

[0395] In the above scheme, the first node carries the network wave identifier information, the first node's reserved resource information, the address of the second node, and the address of the first node in the first frame. It then receives a second frame as a response to the first frame. The second frame includes the network wave identifier information and the resource usage information of each node on the transmission path corresponding to the network wave. This reduces the uncertainty of communication resource utilization, thereby ensuring the quality of service for communication services. For example, a third node or control node can configure the corresponding resources for the first node based on its reserved resource information. Other nodes (not belonging to the transmission path corresponding to the network wave) can determine the first node's resource usage through the second frame and will not choose to occupy the first node's resources, thus reducing the probability of resource conflicts and ensuring the quality of service for communication services. Furthermore, after receiving the first frame, the second node determines itself as the next-hop node based on its address in the first frame. The second node then performs framing processing on the first frame, carrying its reserved resource information and the address of the third node in the first frame to obtain a fourth frame, which it then sends. This also reduces the uncertainty of communication resource utilization, thereby ensuring the quality of service for communication services. For example, a third node or control node can configure the corresponding resources for the second node based on the reserved resource information of the second node and the reserved resource information of the first node. Other nodes will not occupy the resources used by the first node, thereby reducing the probability of resource conflicts and ensuring the service quality of communication services.

[0396] Simultaneously, after receiving the fourth frame, the third node determines, based on its address in the fourth frame, that it is the next-hop node and destination node of the second node. The third node then obtains and sends the second frame based on the fourth frame. This reduces the uncertainty of communication resource utilization, thereby ensuring the quality of service for communication services. For example, other nodes can use the second frame without occupying the resources used by each node on the transmission path corresponding to network wave 1, thus reducing the probability of resource conflicts and further guaranteeing the quality of service for communication services.

[0397] Specifically, each node on the transmission path corresponding to network wave 1 can determine the final resources to be used based on the second frame, and can transmit services through the corresponding communication resources. Some nodes on the transmission path corresponding to network wave 1 may or may not transmit concurrently; this is not restricted.

[0398] One possible implementation of the above method may also include:

[0399] S709, The first node sends the third frame. Correspondingly, the second node receives the third frame.

[0400] When the first node no longer uses network wave 1 for service transmission, the first node searches for the network wave status information of network wave 1 in the first network wave status table according to the source node address, destination node address, path identifier and network wave sequence number of network wave 1. If it does not exist, no operation is performed; if it exists, the third frame is generated and sent.

[0401] For a description of the third frame, please refer to [link / reference]. Figure 11 .

[0402] Figure 11 This is a schematic diagram of the third frame of an embodiment of this application. (As shown...) Figure 11 As shown, the third frame includes, but is not limited to:

[0403] Frame type, receive address, send address, source node address, destination node address, path identifier, and network wave sequence number.

[0404] For a description of the above fields, please refer to the previous text; it will not be repeated here.

[0405] The first node can delete the status information of network wave 1 in the first network wave status table, delete the work information entry corresponding to network wave 1 in the first work information table, and delete the work information entry corresponding to network wave 1 in the first reservation information.

[0406] It is understandable that the first node broadcasts the third frame, and multiple nodes receive the third frame, including the second node, the third node, and the fourth node.

[0407] When any node receives the third frame, it determines its node type based on the content of the third frame. For example, if the node's address is the same as both the "receive address" and the "destination node address" of the third frame, it is a next-hop and destination node. If the node's address is the same as the "receive address" but different from the "destination node address," it is a next-hop but not a destination node. If the node's address is different from the "receive address" of the third frame, the node checks its stored path table to see if the "source node," "destination node," and "path identifier" information are stored. If the corresponding information is found, it is a non-next-hop and in-path node. Nodes that do not belong to any of the above three types are non-next-hop and out-of-path nodes.

[0408] Different nodes process the received third frame in different ways. The third node does not process the first frame, and the second node processes the third frame in a different way than the fourth node.

[0409] The following describes how the fourth node processes the third frame.

[0410] When the fourth node receives the third frame, it deletes the reservation information entry corresponding to network wave 1 in the fourth reservation information table based on the identification information of network wave 1 in the third frame.

[0411] S710, the second node determines the sixth frame based on the third frame.

[0412] After the second node receives the third frame, it performs frame reassembly processing on the third frame to obtain the sixth frame. This frame reassembly processing can be understood as the second node modifying the receiving address in the third frame and filling in the address of the third node to obtain the sixth frame.

[0413] The second node deletes the status information of network wave 1 in the second network wave status table based on the identification information of network wave 1 in the third frame, and deletes the work information entry corresponding to network wave 1 in the second work information table and the reservation information entry corresponding to network wave 1 in the second reservation information table based on the identification information of network wave 1 in the third frame.

[0414] S711, the second node sends the sixth frame. Correspondingly, the third node receives the sixth frame.

[0415] After receiving the sixth frame, the third node, based on the identification information of network wave 1 in the sixth frame, deletes the status information of network wave 1 in the third network wave status table, deletes the corresponding work information entry for network wave 1 in the third work information table, and deletes the corresponding reservation information entry for network wave 1 in the third reservation information table. Afterwards, the third node can fill in the broadcast address or the third node address in the receive address field of the sixth frame and forward the sixth frame.

[0416] Through the above steps S709 to S711, the embodiments of this application can complete the network wave removal process.

[0417] The above description of the second and third frames uses hop-by-hop propagation as an example. However, it does not limit the second and third frames to be sent via broadcast. That is, the node receiving the second and third frames can update and delete its working information table, reservation information table, network wave status table, and greedy reservation information table based on the content included in the second and third frames, without requiring the receiving node to perform framing and forwarding of the second and third frames. This reduces the node's processing power consumption and signaling interaction overhead.

[0418] In a bidirectional transmission scenario, the first, second, or third node may have a previous-hop node and a next-hop node. Therefore, when the first, second, or third node processes the received second frame, it can look up the addresses of the previous-hop node and the next-hop node according to its respective path table. It then fills the network wave reservation information in the second frame with the final transmission resource reservation information (or the node reservation information of the previous-hop node) of the equally spaced concurrent subset to which the next-hop node belongs, and the final transmission resource reservation information (or the node reservation information of the previous-hop node) of the equally spaced concurrent subset to which the next-hop node belongs, and forwards the second frame. The specific process can be found in the preceding description and will not be repeated here.

[0419] One possible implementation is that both the first and fourth frames (or the second frame) can include the network wave's duty cycle parameter. For example, the first frame could include a seventh field indicating the network wave's duty cycle parameter. Similarly, the fourth frame (or the second frame) could include a ninth field indicating the network wave's duty cycle parameter.

[0420] For example, the working cycle parameters of a network wave include at least one of the following: network wave state, network wave starting position, duration, period, or number of repetitions.

[0421] Network Wave Status: Indicates the usage status of the reservation information related to Network Wave 1. When Network Wave 1 is in a periodic working state, this field is in the "Active" state; when Network Wave 1 is in a periodic deactivated state, this field is in the "Dormant" state.

[0422] Network Wave Start Position: Indicates the start time of the superframe when Network Wave 1 first begins operation. Depending on the scenario, this field can be represented in several ways:

[0423] This indicates the superframe number of the first working superframe of network wave 1. This method requires all nodes in the network to maintain the same superframe sequence number and perform synchronized counting.

[0424] Indicates the number of superframe intervals between the first working superframe of network wave 1 and the current superframe.

[0425] Indicates the number of time slot intervals between the start time slot of the first working superframe of network wave 1 and the start time slot of the current superframe.

[0426] The time difference between the start time of the first working superframe of network wave 1 and the start time of the current superframe.

[0427] Duration: The length of time that network wave 1 runs, for example, 5 superframes.

[0428] Period: The time interval between the start of network wave 1 and the next restart, for example, 7 superframes.

[0429] Number of repetitions: This indicates the number of times network wave 1 repeats its operation according to the period.

[0430] It should be noted that the duration and period can be expressed in terms of absolute time interval, or in terms of the number of time slots or superframes in the time interval. The duration is expressed in terms of the number of time slots, and the period is expressed in terms of the number of superframes.

[0431] Specifically, nodes can calculate the working and pause periods of Network Wave 1 based on the first superframe information within its working period, combined with the "working cycle parameter." During the working period, nodes will set the status of relevant reservation information in the reservation information table and working information table to "active," enabling them to function. Working information entries indicate that nodes can use the communication resources recorded in those entries to transmit data, while reservation information entries in the reservation information table indicate that nodes cannot work within those recorded communication resources. When Network Wave 1 is temporarily suspended, the status of reservation information related to Network Wave 1 in the reservation information table and working information table is changed to "dormant," temporarily inactive and not affecting other transmissions by the node within the relevant communication resources. Simultaneously, nodes will calculate the starting position of the next reuse of Network Wave 1 based on the "working cycle parameter," and update the "Network Wave Starting Position" of the entries related to Network Wave 1 in the reservation information table and working information table.

[0432] The aforementioned work information table, appointment information table, and already booked information can all include the aforementioned network wave work cycle parameters.

[0433] For periodic transmission scenarios, the third node can determine the communication resources of each concurrent node subset corresponding to network wave 1, as well as the working cycle parameters of network wave 1, based on the concurrent node subset of the transmission path corresponding to network wave 1, the resource requirements of each service flow, and the reservation information of each node. The reserved working time slots and periodic working parameters must be stored in the working information table of the corresponding concurrent node subset. The reserved working time slots and working frequency bands are used together to indicate the periodic fluctuation transmission of that node. The principle for allocating communication resources is the same as that for unidirectional transmission scenarios.

[0434] For example:

[0435] Resource requirements are represented by the number of time slots required by the business flow, and the maximum number of time slots required among all business flows is taken as the target number of time slots.

[0436] Based on the target number of time slots, the reserved time slots for network wave 1 can be selected from two types of time slots: the first type is time slots that are not recorded in the reserved information of each node (called idle time slots), and the second type is time slots with periodic working parameters recorded in the reserved information.

[0437] When selecting a reserved time slot in the first type of idle time slot, since the idle time slot does not have periodic working parameters, it can be selected directly.

[0438] When selecting a reserved working time slot in the second type of time slot, it should be ensured that the periodic working parameters of the reserved time slot finally selected by network wave 1 do not conflict with the second type of time slot (i.e., both are in the "active" state at the same time), so as not to cause a conflict between the network wave 1 to be established and the network wave that has already been established.

[0439] The reserved time slots selected from the first or second type of time slots should have the same periodic operating parameters.

[0440] The embodiments of this application do not impose specific limitations on the method for coordinating the periodic operating parameters of network wave 1 with the already established network wave.

[0441] when Figure 7 The method shown applies to architectures with a control node that can determine the second frame. For example, the third frame is determined by... Figure 2 The architecture shown sends the fourth frame to the control node (which can send it directly or through a proxy node). The control node determines the second frame according to the contents shown in Tables 1 to 6, and can send the second frame to each node on the transmission path corresponding to network wave 1 (which can send it directly or through a proxy node), or send the second frame in a hop-by-hop manner. For example, the control node sends the second frame to the third node (which can send it directly or through a proxy node), the third node sends the second frame to the second node in the aforementioned manner, the second node sends the second frame to the first node, and so on. There are no restrictions on this.

[0442] when Figure 7 The method shown is applicable to architectures with control nodes. The first node and the control node can exchange third frames, and the specific method is not limited. For example, the first node can directly send the third frame to the control node, and the control node can then forward the third frame to other nodes, etc.

[0443] when Figure 7When the method shown is applied to an architecture with a control node, the source node resource request information in the first frame includes the source node address and resource requirement information, but does not include information such as the list of neighboring nodes of the source node.

[0444] The following section discusses the application. Figure 7 The beneficial effects of the method described herein will be further described. See also... Figure 12 .

[0445] Figure 12 This is a schematic diagram of simulation results from an embodiment of this application. Here, "network wave" refers to the method of this embodiment, and "CSMA protocol" refers to the method where each node uses CSMA for channel access and transmission. Example:

[0446] Figure 12 As shown in (a), taking a single transmission path in a multi-hop network as an example, different numbers of nodes in this transmission path correspond to different end-to-end throughputs. Specifically, when the service rate reaches 7 Mbps, the average throughput of the CSMA protocol reaches saturation and shows a slight downward trend. When the service rate is less than 7 Mbps, the end-to-end average throughput of the network wave is similar to that of the CSMA protocol, because the service is relatively sparse, so various protocols can generally provide service. When the service rate is greater than 7 Mbps, by improving the orderliness of end-to-end multi-hop transmission and avoiding conflicts between nodes, the performance of the network wave is better than that of the CSMA protocol (referring to throughput). Thus, this can support and guarantee the quality of service of communication services.

[0447] Figure 12 As shown in (b), taking a single transmission path in a multi-hop network as an example, different numbers of nodes in the transmission path correspond to different end-to-end delays. Specifically, as the number of nodes in the transmission path increases, the collisions between intermediate nodes intensify, and the average delay of the CSMA protocol increases significantly. However, with network wave propagation, the number of time slots required to complete one end-to-end transmission of a data packet is fixed. Therefore, the average end-to-end delay does not change with the increase of the service rate. At the same number of hops, the average end-to-end delay of network wave propagation is lower than that of the CSMA protocol. This supports and ensures the quality of service for communication services.

[0448] Figure 12As shown in (c), taking a single transmission path in a multi-hop network as an example, different end-to-end cumulative distribution functions (CDFs) correspond to different numbers of nodes in this transmission path. From left to right, the first solid curve represents a 3-hop path-CSMA, the second a 6-hop path-CSMA, the third a 9-hop path-CSMA, and the fourth a 27-hop path-CSMA. The first multi-segment curve represents a 3-hop path-network wave, the second a 6-hop path-network wave, the third a 9-hop path-network wave, and the fourth a 27-hop path-network wave. Specifically, when the service rate is 7 Mbps, in terms of CDF, the end-to-end delay jitter of the network wave is less than that of the CSMA protocol. This can support and guarantee the quality of service for communication services.

[0449] In conclusion, through Figure 7 The method described in this application embodiment can support and guarantee the quality of service for communication services.

[0450] To achieve the functions of the method provided in this application, the first node, second node, third node, or fourth node may include hardware structures and / or software modules, implementing the above functions in the form of hardware structures, software modules, or a combination of hardware structures and software modules. Whether a particular function is executed in the form of hardware structures, software modules, or a combination of hardware structures and software modules depends on the specific application and design constraints of the technical solution.

[0451] Figure 13 This is a schematic block diagram of a communication device according to an embodiment of this application. The communication device includes a processing circuit 1310 and a transceiver circuit 1320, which can be interconnected or coupled, for example, interconnected via a bus 1330. The communication device can be a first node, a second node, a third node, or a fourth node, etc.

[0452] Optionally, the communication device may further include a memory 1340. The memory 1340 includes, but is not limited to, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM), or compact disc read-only memory (CD-ROM). The memory 1340 is any other medium capable of carrying or storing desired program code in the form of instructions or data structures that can be accessed by a computer, but is not limited thereto. The memory in the embodiments of this application may also be a circuit or any other device capable of implementing storage functions for storing computer programs or instructions, and / or data.

[0453] The processing circuit 1310 may be all or part of the processing circuitry in one or more processors, or it may be one or more processors. The processor may be a central processing unit (CPU). If the processing circuit 1310 is a CPU, the CPU may be a single-core CPU or a multi-core CPU. The processing circuit 1310 may be a signal processor, a chip, or other integrated circuit capable of implementing the methods of this application, or a portion of the circuitry within the aforementioned processor, chip, or integrated circuit that performs processing functions. Additionally, the transceiver circuit 1320 may be a transceiver, or an input / output interface. An input / output interface is used for inputting or outputting signals or data and may also be referred to as an input / output circuit.

[0454] When the communication device is a first node, a second node, a third node, or a fourth node, for example, the processing circuit 1310 is used to perform the following operations: receive first information; run the automation function example 1 to detect a first network problem, and determine the repair method for the first network problem according to the repair strategy, etc.

[0455] When the communication device is the first node, for example, the processing circuit 1310 is used to perform the following operations: determine the first frame; send the first frame, etc.

[0456] When the communication device is the second node, for example, the processing circuit 1310 is used to perform the following operations: receive a first frame; determine a fourth frame based on the first frame; send the fourth frame, etc.

[0457] When the communication device is a third node, for example, the processing circuit 1310 is used to perform the following operations: receive a fourth frame; determine a second frame, etc.

[0458] When the communication device is the fourth node, for example, the processing circuit 1310 is used to perform the following operations: receive the fourth frame; when it is determined that the node does not belong to the transmission path corresponding to the network wave, establish reservation information according to the identification information of the network wave, the reservation information being used to instruct the node on the transmission path corresponding to the network wave to reserve communication resources, etc.

[0459] when Figure 13 When the communication device is a first node, a second node, a third node, or a fourth node, the transceiver circuit 1320 can be a transceiver.

[0460] when Figure 13 When the communication device is a chip used for the first node, second node, third node or fourth node, the transceiver circuit 1320 can be an input / output circuit.

[0461] The above description is merely exemplary. For details, please refer to the content shown in the above method embodiments.

[0462] Figure 13 The implementation of each operation can also be found by referring to... Figure 7 The corresponding description of the method embodiments shown.

[0463] Figure 14 This is a schematic block diagram of another communication device according to an embodiment of this application. The communication device can be a first node, a second node, a third node, or a fourth node.

[0464] The communication device includes a transceiver unit 1410 and a processing unit 1420. The transceiver unit 1410 may include a sending unit and a receiving unit. The sending unit performs the sending action of the communication device, and the receiving unit performs the receiving action of the communication device. For ease of description, the sending unit and the receiving unit are combined into a single transceiver unit in this embodiment. This will be explained uniformly here and will not be repeated later.

[0465] When the communication device is the first node, for example, the transceiver unit 1410 is used to send a first frame and receive a second frame; the processing unit 1420 is used to determine the first frame, etc.

[0466] When the communication device is a second node, for example, the transceiver unit 1410 is used to: receive a first frame; send a fourth frame; and the processing unit 1420 is used to determine the fourth frame based on the first frame, etc.

[0467] When the communication device is a third node, for example, the transceiver unit 1410 is used to receive the fourth frame; the processing unit 1420 is used to determine the second frame, etc., based on the fourth frame.

[0468] When the communication device is the fourth node, for example, the transceiver unit 1410 is used to: receive the fourth frame; when the processing unit 1420 determines that it does not belong to the node on the transmission path corresponding to the network wave, it establishes reservation information according to the identification information of the network wave, and the reservation information is used to instruct the node on the transmission path corresponding to the network wave to reserve communication resources, etc.

[0469] when Figure 14 When the communication device shown is a first node, a second node, a third node, or a fourth node, it will be responsible for executing one or more of the methods or steps related to the first node, the second node, the third node, or the fourth node in the aforementioned method embodiments.

[0470] Optionally, Figure 14 The communication device shown also includes a storage unit 1430 for storing programs or code for executing the aforementioned methods.

[0471] Figure 14 The transceiver unit in the middle can correspond to Figure 13 The transceiver circuit in the middle, Figure 14 The processing unit in the middle can correspond to Figure 13 The processing circuitry within.

[0472] Figure 13 and Figure 14 The illustrated device embodiment is used to implement Figure 7 The content described. Figure 13 and Figure 14 The specific execution steps and methods of the device shown can be found in the content described in the foregoing method embodiments.

[0473] This application also provides a chip, including a processor, for calling and executing instructions stored in a memory, causing a communication device on which the chip is installed to perform the methods described in the examples above. The memory may be integrated within the chip or located externally.

[0474] This application also provides another chip, including: an input interface, an output interface, and a processing circuit, wherein the input interface, the output interface, and the processor are connected through an internal connection path, and the processing circuit is used to execute code in memory. When the code is executed, the processing circuit is used to execute the methods in the above examples.

[0475] Optionally, the chip also includes a memory for storing computer programs or code. The input and output interfaces can be independent of each other, or they can be integrated into a single input / output interface.

[0476] The processing circuitry can be all or part of the processing circuitry in one or more processors, or one or more processors.

[0477] This application also provides a communication device, including a processor coupled to a memory, the processor being used to execute a computer program stored in the memory to implement the methods and functions involving a first network element or a second network element in any of the above method embodiments.

[0478] In another embodiment of this application, a computer program product containing instructions is provided, which, when run on a computer, enables the implementation of the methods described in the foregoing embodiments.

[0479] This application also provides a computer program that, when run on a computer, enables the implementation of the methods described in the foregoing embodiments.

[0480] In another embodiment of this application, a computer-readable storage medium is provided, which stores a computer program that, when executed by a computer, implements the methods described in the foregoing embodiments.

[0481] It should be understood that in the embodiments of this application, the processor can be a central processing unit (CPU), but it can also be other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor can be a microprocessor or any conventional processor.

[0482] In addition, the processor may include one or more of the following: a central processing unit (CPU), a baseband processor, a digital signal processor (DSP), a microprocessor unit (MPU), a microcontroller unit (MCU), a graphics processing unit (GPU), a field programmable gate array (FPGA), an artificial intelligence processor (AI processor), or a neural processing unit (NPU).

[0483] It should also be understood that the memory in the embodiments of this application can be volatile memory or non-volatile memory, or may include both volatile and non-volatile memory. The non-volatile memory can be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), or flash memory. The volatile memory can be random access memory (RAM), which is used as an external cache. By way of example, but not limitation, many forms of random access memory (RAM) are available, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDR SDRAM), enhanced synchronous SDRAM (ESDRAM), synchronous linked DRAM (SLDRAM), and direct rambus RAM (DR RAM). It should be noted that the memory used in the systems and methods described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0484] The above embodiments can be implemented, in whole or in part, by software, hardware, firmware, or any other combination thereof. When implemented using software, the above embodiments can be implemented, in whole or in part, as a computer program product. A computer program product includes one or more computer instructions or computer programs. When the computer instructions or computer programs are loaded or executed on a computer, all or part of the processes or functions described in the embodiments of this application are generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, the computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wired or wireless (e.g., infrared, wireless, microwave, etc.) means. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that includes one or more sets of available media. The available medium can be a magnetic medium (e.g., floppy disk, hard disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium. A semiconductor medium can be a solid-state drive.

[0485] It should be understood that in the various embodiments of this application, the order of the above-mentioned processes does not imply the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of this application.

[0486] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application. Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here. In the several embodiments provided in this application, it should be understood that the disclosed systems, devices, and methods can be implemented in other ways. For example, the device embodiments described above are merely illustrative; for example, the division of units is merely a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the mutual coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection of devices or units may be electrical, mechanical, or other forms.

[0487] The units described as separate components may or may not be physically separate. 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 to achieve the purpose of this embodiment according to actual needs. Furthermore, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. If the above functions are implemented as software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory, random access memory, magnetic disks, or optical disks.

[0488] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

Claims

1. A communication method, characterized in that, Applied to the first node, including: Send a first frame, which is used to request the establishment of a network wave. The first frame includes the identification information of the network wave, the reserved resource information of the first node, the address of the first node and the address of the second node. The second node and the first node are both nodes in the transmission path corresponding to the network wave, and the second node is the next hop node of the first node. A second frame is received, which is used to respond to the first frame. The second frame includes the identification information of the network wave and the resource usage information of each node in the transmission path.

2. The method according to claim 1, characterized in that, The first frame includes a first field, a second field, a third field, and a fourth field. The first field indicates the identification information of the network wave, the second field indicates the reserved resource information of the first node, the third field indicates the address of the first node, and the fourth field indicates the address of the second node.

3. The method according to claim 2, characterized in that, The identification information of the network wave includes the address of the source node of the network wave, the address of the destination node of the network wave, the path identifier of the transmission path, and the sequence number of the network wave.

4. The method according to claim 2 or 3, characterized in that, The first frame also includes a fifth field, which indicates the resource parameters of the first node, including: The address of the first node, the unavailable resource information of the first node, the list of neighboring nodes of the first node, and the resource requirement information of the first node.

5. The method according to any one of claims 2 to 4, characterized in that, The first frame also includes a sixth field, which indicates whether the transmission direction of the main service flow of the network wave and the transmission direction of at least one secondary service flow of the network wave are the same.

6. The method according to any one of claims 2 to 5, characterized in that, The first frame also includes a seventh field, which indicates the duty cycle parameters of the network wave.

7. The method according to claim 6, characterized in that, The second frame also includes the working period parameters of the network wave.

8. The method according to claim 6 or 7, characterized in that, The working period parameters of the network wave include at least one of the following: Network wave status, network wave starting position, duration, period, or number of repetitions.

9. The method according to any one of claims 1 to 8, characterized in that, The method further includes: A third frame is sent, which is used to request the dismantling of the network wave. The third frame includes the identification information of the network wave, the address of the second node, and the address of the first node.

10. A communication method, characterized in that, Applied to the second node, including: Receive a first frame, which is used to request the establishment of a network wave. The first frame includes the identification information of the network wave, the reservation resource information of the first node, the address of the first node and the address of the second node. The first node is the node that sent the first frame, and the second node and the third node are both nodes in the transmission path corresponding to the network wave. The second node is the next-hop node of the first node. A fourth frame is sent, which includes the identification information of the network wave, the reservation resource information of the first node, the reservation resource information of the second node, the address of the first node, and the address of the third node, wherein the third node is the next-hop node of the second node, and the fourth frame is obtained by processing the first frame.

11. The method according to claim 10, characterized in that, The fourth frame includes a first field, a second field, a third field, a fourth field, and a fifth field. The first field indicates the identification information of the network wave, the second field indicates the reserved resource information of the first node, the third field indicates the address of the first node, the fourth field indicates the address of the third node, and the fifth field indicates the reserved resource information of the second node.

12. The method according to claim 11, characterized in that, The identification information of the network wave includes the address of the source node of the network wave, the address of the destination node of the network wave, the path identifier of the transmission path, and the sequence number of the network wave.

13. The method according to claim 11 or 12, characterized in that, The fourth frame also includes a sixth field and a seventh field, wherein the sixth field indicates the resource parameters of the first node and the seventh field indicates the resource parameters of the second node; The resource parameters of the first node include: The address of the first node, the unavailable resource information of the first node, the list of neighboring nodes of the first node, and the resource requirement information of the first node; The resource parameters of the second node include: The address of the second node, the unavailable resource information of the second node, the list of neighboring nodes of the second node, and the resource requirement information of the second node.

14. The method according to any one of claims 11 to 13, characterized in that, The fourth frame also includes an eighth field, which indicates whether the transmission direction of the main service flow of the network wave and the transmission direction of at least one secondary service flow of the network wave are the same.

15. The method according to any one of claims 11 to 14, characterized in that, The fourth frame also includes a ninth field, which indicates the duty cycle parameters of the network wave.

16. The method according to claim 15, characterized in that, The working period parameters of the network wave include at least one of the following: Network wave status, network wave starting position, duration, period, or number of repetitions.

17. The method according to any one of claims 11 to 16, characterized in that, The method further includes: Receive a second frame, which is used to respond to the first frame. The second frame includes the identification information of the network wave and the resource usage information of each node in the transmission path. A fifth frame is sent, which is used to respond to the first frame. The fifth frame is obtained by processing the second frame. The fifth frame includes the identification information of the network wave and the resource usage information of each node in the transmission path.

18. The method according to claim 17, characterized in that, The method further includes: A third frame is received, the third frame being used to request the dismantling of the network wave, the third frame including the identification information of the network wave, the address of the second node, and the address of the first node; A sixth frame is sent, which includes the identification information of the network wave, the address of the second node, and the address of the third node. The sixth frame is obtained by processing the third frame.

19. A communication method, characterized in that, Applied to the third node, including: Receive a fourth frame, which is used to request the establishment of a network wave. The fourth frame includes the identification information of the network wave, the reservation resource information of each node on the transmission path corresponding to the network wave, the address of the second node and the address of the third node. The third node is the next-hop node of the second node and the destination node of the network wave. Based on the fourth frame, a second frame is sent, which is used to respond to the fourth frame. The second frame includes the identification information of the network wave and the resources used by each node on the transmission path.

20. The method according to claim 19, characterized in that, The step of sending the second frame according to the fourth frame includes: Send the fourth frame to the control node; The second frame is received from the control node, which is used to determine the reserved resources for each node on the transmission path; Send the second frame.

21. A communication device, characterized in that, The communication device includes a unit for performing the method as described in any one of claims 1 to 20.

22. A communication device, characterized in that, Includes a processor for executing computer instructions stored in a memory to cause the communication device to perform the method as described in any one of claims 1 to 20.

23. The communication device according to claim 22, characterized in that, The communication device also includes the memory.

24. The communication device according to claim 22 or 23, characterized in that, The communication device further includes a communication interface coupled to the processor, the communication interface being used for inputting and / or outputting information.

25. A computer-readable storage medium, characterized in that, Used to store a computer program, the computer program including instructions for implementing the method as described in any one of claims 1 to 20.

Images