Communication method and communication apparatus

Abstract

A communication method and a communication apparatus, which relate to the technical field of communications. In the method, in a transmission path corresponding to a network wave, a first node (the first node being the source node of the network wave) broadcasts a first frame to nodes on the transmission path, the first frame being used for requesting establishment of the network wave, and the first frame comprising identifier information of the network wave, an address of the first node, reserved resource information of the first node, and an address of a second node (the second node being the next-hop node of the first node). After receiving the first frame, the second node forwards the first frame to a third node (the third node being the next-hop node of the second node), the forwarded first frame comprising the identifier information of the network wave, the address of the first node, a reserved resource information of the second node, and an address of the third node. This configuration supports configuring communication resources on the basis of reserved resource information of each node on the transmission path, and reduces the uncertainty of resource utilization, thereby ensuring the service quality of communication services.

Description

Communication method and communication apparatus

[0001] This application claims priority to the Chinese Patent Application No. 202411101968.3, filed on August 12, 2024, and entitled "Communication method and communication apparatus", the content of which is incorporated herein by reference in its entirety. TECHNICAL FIELD

[0002] The present application relates to the field of communication technology, and more particularly, to a communication method and a communication apparatus. BACKGROUND

[0003] A multi-hop network refers to a network in which information is transmitted from a source node to a destination node in a hop-by-hop manner. Multi-hop networks are increasingly widely used in various scenarios, including but not limited to unmanned aerial vehicle networking and satellite network communication scenarios.

[0004] In a multi-hop network, a node usually decides to use a communication resource based on its own needs. For example, a node accesses a channel and occupies a communication resource through a random contention protocol such as carrier sense multiple access (CSMA), which increases the uncertainty of the use of the communication resource, and thus can reduce the performance of the network, such as throughput and latency.

[0005] With an increase in the number of nodes in a multi-hop network, the uncertainty of the use of the communication resource described above can be further exacerbated, which can affect the quality of service of a communication service. Therefore, how to guarantee the quality of service of a communication service is a technical problem to be solved.

[0006] SUMMARY

[0007] The present application provides a communication method and a communication apparatus, which can guarantee the quality of service of a communication service.

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

[0009] The scheme 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 an integrated circuit, etc.), and can also be a logic node, a logic module, or software, etc. that can realize all or part of the functions of the first node. For ease of description, the first node is described below as an example.

[0010] In the scheme, the first node carries the identification information of the network wave, the reservation resource information of the first node, the address of the second node, and the address of the first node in the first frame used for requesting to establish the network wave, and receives the second frame used for responding to the first frame, the second frame including the identification information of the network wave and the use resource information of each node on the transmission path corresponding to the network wave. In this way, this can reduce the uncertainty of the use of communication resources, thereby being able to guarantee the service quality of the communication service. For example, after the first node reports the reservation resource information of the first node, the node used for determining the use resource of each node can configure the corresponding use resource for the first node according to the reservation resource information of the first node, and other nodes can determine the use resource of the first node through the second frame, and will not select to occupy the use resource of the first node, thereby being able to reduce the probability of resource conflict, and further being able to guarantee the service quality of the communication service.

[0011] In some implementation forms of the first aspect, the first frame includes a first field, a second field, a third field, and a fourth field, the first field indicating the identification information of the network wave, the second field indicating the reservation resource information of the first node, the third field indicating the address of the first node, and the fourth field indicating the address of the second node.

[0012] Through the above fields, this can support the indication of the corresponding information in the first frame, thereby being able to support the configuration of the corresponding communication resource for each node on the transmission path corresponding to the network wave.

[0013] In some implementation forms 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 identification of the transmission path, and the sequence number of the network wave.

[0014] In this way, this can uniquely identify the network wave.

[0015] In some implementation forms of the first aspect, the first frame further includes a fifth field, the fifth field indicating the resource parameter of the first node, the resource parameter of the first node including the address of the first node, the unavailable resource information of the first node, the neighbor node list of the first node, and the resource requirement information of the first node.

[0016] In this way, this can support the configuration of the corresponding communication resource for the first node according to the resource parameter of the first node.

[0017] In some implementations of the first aspect, the first frame further includes a sixth field, the sixth field indicating whether a transmission direction of a primary traffic flow of the network wave and a transmission direction of at least one secondary traffic flow of the network wave are the same.

[0018] In this way, this can support indicating whether the network wave supports bidirectional transmission as described above.

[0019] In some implementations of the first aspect, the first frame further includes a seventh field, the seventh field indicating a duty cycle parameter of the network wave.

[0020] In this way, this can support implementing indication of the duty cycle parameter of the network wave. In addition, this can also support guaranteeing quality of service of communication traffic in a periodic transmission scenario.

[0021] In some implementations of the first aspect, the second frame further includes the duty cycle parameter of the network wave.

[0022] In this way, this can support implementing indication of the duty cycle parameter of the network wave. In addition, this can also support guaranteeing quality of service of communication traffic in a periodic transmission scenario.

[0023] In some implementations of the first aspect, the duty cycle parameter of the network wave includes at least one of a network wave state parameter, a network wave start position parameter, a duration parameter, a periodicity parameter, or a number of repeated work times.

[0024] Through the at least one parameter described above, this is conducive to supporting guaranteeing quality of service of communication traffic in a periodic transmission scenario.

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

[0026] In this way, this can support completing a tearing down process of the network wave.

[0027] In a second aspect, a communication method is provided, including: receiving a first frame, the first frame being used to request establishing a network wave, the first frame including identification information of the network wave, reservation resource information of a first node, an address of the first node, and an address of a second node, the first node being a node sending the first frame, and the second node being a next hop node of the first node; and sending a fourth frame, the fourth frame including the identification information of the network wave, the reservation resource information of the first node, reservation resource information of the second node, the address of the first node, and an address of a third node, the third node being a next hop node of the second node, and the fourth frame being obtained after processing the first frame.

[0028] The scheme 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 an integrated circuit, etc.), and can also be a logic node, a logic module, or software, etc. capable of implementing all or part of the functions of the second node. For ease of description, the second node is taken as an example for description hereinafter.

[0029] In the scheme, after receiving the first frame, the second node determines, according to the address of the second node in the first frame, that the second node is the next hop node of the first node, and performs framing processing on the first frame, that is, carries the reservation resource information of the second node and the address of the third node in the first frame, thereby obtaining the fourth frame, and sends the fourth frame. In this way, this can reduce the uncertainty of the utilization of the communication resources, thereby being capable of guaranteeing the service quality of the communication service. For example, after the second node reports the reservation resource information of the second node, the node used for determining the use resources of each node can configure corresponding use resources for the second node according to the reservation resource information of the second node and the reservation resource information of the first node, and other nodes will not occupy the use resources of the first node, thereby being capable of reducing the probability of resource conflict, and further being capable of guaranteeing the service quality of the communication service.

[0030] 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 reservation 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 reservation resource information of the second node.

[0031] Through the above fields, this can support the indication of the corresponding information in the fourth frame, thereby being capable of supporting the configuration of corresponding communication resources for each node on the transmission path corresponding to the network wave.

[0032] 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 identification of the transmission path, and the sequence number of the network wave.

[0033] In this way, this can uniquely identify the network wave.

[0034] In some implementations of the second aspect, the fourth frame further includes a sixth field and a seventh field, the sixth field indicates the resource parameter of the first node, and the seventh field indicates the resource parameter of the second node. The resource parameter of the first node includes the address of the first node, the unavailable resource information of the first node, the neighbor node list of the first node, and the resource requirement information of the first node. The resource parameter of the second node includes the address of the second node, the unavailable resource information of the second node, the neighbor node list of the second node, and the resource requirement information of the second node.

[0035] Thus, this can support configuring corresponding communication resources for the first node and the second node respectively according to the resource parameter of the first node and the resource parameter of the second node.

[0036] In some implementations of the second aspect, the fourth frame further comprises an eighth field, the eighth field indicating whether the transmission direction of the primary service flow of the network wave and the transmission direction of the at least one secondary service flow of the network wave are the same.

[0037] Thus, this can support indicating whether the network wave supports bidirectional transmission.

[0038] In some implementations of the second aspect, the first frame further comprises a ninth field, the ninth field indicating the duty cycle parameter of the network wave.

[0039] Thus, this can support realizing the indication of the duty cycle parameter of the network wave. In addition, this can also support guaranteeing the service quality of the communication service in the periodic transmission scenario.

[0040] In some implementations of the second aspect, the duty cycle parameter of the network wave comprises at least one of the following: a network wave state parameter, a network wave starting position parameter, a duration parameter, a period parameter or a number of repeated work times.

[0041] Through the at least one parameter described above, this is conducive to supporting guaranteeing the service quality of the communication service in the periodic transmission scenario.

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

[0043] Thus, this can support completing the framing and forwarding processing of the second frame, and thus can support that the nodes not belonging to the transmission path corresponding to the network wave can not select to occupy the usage resource of each node on the transmission path according to the fourth frame, thereby being able to reduce the probability of resource conflict, and further being able to guarantee the service quality of the communication service.

[0044] In some implementations of the second aspect, the method further includes: receiving a third frame, the third frame being used to request tearing down 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; and sending a sixth frame, the sixth frame including 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 after processing the third frame. The sixth frame is also used to request tearing down the network wave.

[0045] In this way, this can support completing the tearing down process of the network wave.

[0046] The description of the first frame in the second aspect can refer to the description of the first frame in the first aspect, and will not be repeated here.

[0047] In a third aspect, a communication method is provided, including: receiving a fourth frame, the fourth frame being used to request establishing a network wave, the fourth frame including identification information of the network wave, reservation resource information of each node on a transmission path corresponding to the network wave, an address of a second node, and an address of a third node, the third node being a next-hop node of the second node, and the third node being a destination node of the network wave; and sending a second frame according to the fourth frame, the second frame being used to reply to the fourth frame, the second frame including the identification information of the network wave and usage resource of each node on the transmission path.

[0048] The solution of the third aspect can be executed by a third node side device, which can be the second node, or a functional module (such as a chip system or an integrated circuit, etc.), or a logic node, a logic module, or software, etc. that can realize all or part of the functions of the third node. For ease of description, the third node is taken as an example in the following description.

[0049] In the above solution, after receiving the fourth frame, the third node determines, according to the address of the third node in the fourth frame, that the third node is the next-hop node of the second node and is the destination node, and the third node obtains and sends the second frame according to the fourth frame. In this way, this can reduce the uncertainty of the utilization of communication resources, thereby being able to guarantee the service quality of the communication service. For example, the third node can configure usage resource for each node on the transmission path corresponding to the network wave according to the information of the fourth frame, and after the third node sends the second frame, other nodes can not occupy the usage resource of each node on the transmission path corresponding to the network wave through the second frame, thereby being able to reduce the probability of resource conflict, and further being able to guarantee the service quality of the communication service.

[0050] In some implementations of the third aspect, the sending of 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, the control node being used to determine the reservation resource of each node on the transmission path; and sending the second frame.

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

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

[0053] In this way, this can support the second frame determined by the control node, which can reduce the processing power consumption of the third node.

[0054] In some implementations of the third aspect, the method further includes: receiving a fifth frame, the fifth frame being used to request to tear down the network wave. The fifth frame includes the identification information of the network wave, the address of the second node, and the address of the third node.

[0055] In this way, this can support the completion of the tearing down process of the network wave.

[0056] The description of the fourth frame in the third aspect can refer to the description of the fourth frame in the second aspect, and will not be repeated here.

[0057] In a fourth aspect, a communication method is provided, including: receiving a fourth frame, the fourth frame being used to request to establish 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, an address of the first node, and an address of a third node, the third node being a next hop node of the second node, the third node being a destination node of the network wave, and the first node being a source node of the network wave; when determining that the fourth node is not a node on a transmission path corresponding to the network wave, establishing reservation information according to the identification information of the network wave, the reservation information being used to indicate that the nodes on the transmission path corresponding to the network wave reserve communication resources.

[0058] The solution of the fourth aspect can be executed by a fourth node side device, which can be a fourth node, or a functional module (such as a chip system or an integrated circuit, etc.), or a logic node, a logic module, or software, etc. that can realize all or part of the functions of the fourth node. For ease of description, the fourth node is taken as an example for description hereinafter.

[0059] In the above solution, after receiving the fourth frame, when the fourth node determines that the fourth node is a path-out 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 according to the reservation resource information of the first node and the reservation resource information of the second node in the fourth frame, so as to reduce the probability of resource conflict, and further to guarantee the service quality of the communication service.

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

[0061] The description of the fourth frame in the fourth aspect can refer to the description of the fourth frame in the second aspect, and will not be repeated.

[0062] In a fifth aspect, a communication apparatus is provided, which can be the first node, or a device or module for performing the functions of the first node.

[0063] In a possible implementation, the communication apparatus can include modules or units corresponding to the methods / operations / steps / actions described in the first aspect, which can be hardware circuits, software, or a combination of hardware circuits and software.

[0064] For example, the communication apparatus includes a transceiver unit and a processing unit.

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

[0066] In a possible implementation, the communication apparatus can include modules or units corresponding to the methods / operations / steps / actions described in the second aspect, which can be hardware circuits, software, or a combination of hardware circuits and software.

[0067] For example, the communication apparatus includes a transceiver unit and a processing unit.

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

[0069] In a possible implementation, the communication apparatus can include modules or units corresponding to the methods / operations / steps / actions described in the third aspect, which can be hardware circuits, software, or a combination of hardware circuits and software.

[0070] For example, the communication apparatus includes a transceiver unit and a processing unit.

[0071] In an eighth aspect, a communication apparatus is provided, which can be the fourth node, or a device or module for performing the functions of the fourth node.

[0072] In a possible implementation, the communication apparatus can include modules or units corresponding to the methods / operations / steps / actions described in the fourth aspect, which can be hardware circuits, software, or a combination of hardware circuits and software.

[0073] For example, the communication apparatus includes a transceiver unit and a processing unit.

[0074] In a ninth aspect, a communication apparatus is provided, comprising a processor configured to cause the communication apparatus to perform the method of the first aspect and any possible implementation of the first aspect; or the method of the second aspect and any possible implementation of the second aspect; or the method of the third aspect and any possible implementation of the third aspect; or the method of the fourth aspect and any possible implementation of the fourth aspect, by executing computer program or instructions, or by logic circuit.

[0075] In a possible implementation, the communication apparatus further comprises a memory configured to store the computer program or instructions.

[0076] In a possible implementation, the communication apparatus further comprises a communication interface configured to input and / or output a signal.

[0077] In a tenth aspect, a communication apparatus is provided, comprising a logic circuit and an input / output interface configured to input and / or output a signal, and the logic circuit is configured to perform the method of the first aspect and any possible implementation of the first aspect; or the method of the second aspect and any possible implementation of the second aspect; or the method of the third aspect and any possible implementation of the third aspect; or the method of the fourth aspect and any possible implementation of the fourth aspect.

[0078] In an eleventh aspect, a computer readable storage medium is provided, having stored thereon computer programs or instructions that, when executed on a computer, cause the method of the first aspect and any possible implementation of the first aspect to be performed; or the method of the second aspect and any possible implementation of the second aspect to be performed; or the method of the third aspect and any possible implementation of the third aspect to be performed; or the method of the fourth aspect and any possible implementation of the fourth aspect to be performed.

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

[0080] 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, so that the chip or chip system implements the method in the first aspect and any possible implementation of the first aspect; or so that the chip or chip system implements the method in the second aspect and any possible implementation of the second aspect; or so that the chip or chip system implements the method in the third aspect and any possible implementation of the third aspect; or so that the chip or chip system implements the method in the fourth aspect and any possible implementation of the fourth aspect.

[0081] The beneficial effects of any of the fifth aspect to the thirteenth aspect can be referred to the description of the beneficial effects of the first aspect to the fourth aspect, and will not be repeated here. BRIEF DESCRIPTION OF DRAWINGS

[0082] FIG. 1 is a schematic diagram of a transmission path in a multi-hop network.

[0083] FIG. 2 is a schematic diagram of a multi-hop network comprising a control node.

[0084] FIG. 3 is a schematic diagram of a network wave status information entry.

[0085] FIG. 4 is a schematic diagram of a working information entry.

[0086] FIG. 5 is a schematic diagram of an indication information entry.

[0087] FIG. 6 is a schematic diagram of a reservation information entry.

[0088] FIG. 7 is a schematic diagram of an interaction flow of a communication method according to an embodiment of the present application.

[0089] FIG. 8 is a schematic diagram of a structure of a first frame according to an embodiment of the present application.

[0090] FIG. 9 is a schematic diagram of a reserved information field according to an embodiment of the present application.

[0091] FIG. 10 is a schematic diagram of a second frame according to an embodiment of the present application.

[0092] FIG. 11 is a schematic diagram of a third frame according to an embodiment of the present application.

[0093] FIG. 12 is a schematic diagram of simulation results according to an embodiment of the present application.

[0094] FIG. 13 is a schematic block diagram of a communication apparatus according to an embodiment of the present application.

[0095] FIG. 14 is a schematic block diagram of another communication apparatus according to an embodiment of the present application. DETAILED DESCRIPTION

[0096] In order to facilitate the understanding of the embodiments of the present application, the following points are first explained.

[0097] I. Unless otherwise stated, the meaning of "plurality" is two or more. The meaning of "at least one" refers to one or more.

[0098] II. If there is no special description and logical conflict, the terms and / or descriptions between different embodiments of the present application are consistent and can be mutually referred to. The technical features in different embodiments can be combined to form new embodiments according to their inherent logical relationship.

[0099] III. The various digital numbers involved in the present application are only for the convenience of differentiation, and do not limit the protection scope of the present application. The size of the serial number involved in the present application does not mean the execution order. The execution order of each process should be determined according to its function and inherent logic. For example, the terms "first", "second", "third", "fourth" and other various term labels in the specification and claims of the present application and the drawings (if any) are used to distinguish similar objects, and do not have to be used to describe a specific order or sequence. Among them, the data thus used can be interchanged under appropriate circumstances, so that the embodiments described herein can be implemented in an order other than that illustrated or described herein.

[0100] At the same time, any embodiment or design scheme described as "exemplary" or "for example" in the embodiments of the present application should not be interpreted as more preferred or more advantageous than other embodiments or design schemes. Rather, the use of "exemplary" or "for example" and the like is intended to present the relevant concept in a specific manner for ease of understanding.

[0101] IV. The terms "include" and "have" 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 does not have to be limited to those steps or units clearly listed, but can include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0102] V. In the embodiments of the present application, "for indicating" can be understood as "enabling", and "enabling" includes direct enabling and indirect enabling. When describing that a certain information is used to enable A, it can include that the information directly enables A or indirectly enables A, and it does not mean that A must be carried in the information.

[0103] If the information enabled by the information is referred to as to-be-enabled information, there are many ways to enable the to-be-enabled information in the implementation process, for example, but not limited to, the to-be-enabled information can be directly enabled, such as the to-be-enabled information itself or an index of the to-be-enabled information. The to-be-enabled information can also be indirectly enabled by enabling other information, where the other information and the to-be-enabled information have an association relationship. Only a part of the to-be-enabled information can be enabled, and the other part of the to-be-enabled information is known or agreed in advance. For example, the enabling of specific information can also be implemented by means of the arrangement order of each information agreed in advance (for example, defined by a protocol), thereby reducing the enabling overhead to a certain extent. Meanwhile, the common part of each information can be identified and uniformly enabled to reduce the enabling overhead caused by separately enabling the same information.

[0104] In addition, the indication can include direct indication, indirect indication, display indication, and implicit indication. When it is described that certain indication information is used to indicate A, it can be understood that the indication information carries A, directly indicates A, or indirectly indicates A.

[0105] In the embodiments of the present application, the information indicated by the indication information is referred to as to-be-indicated information. In the implementation process, there are many ways to indicate the to-be-indicated information, for example, but not limited to, the to-be-indicated information can be directly indicated, such as the to-be-indicated information itself or an index of the to-be-indicated information. The to-be-indicated information can also be indirectly indicated by indicating other information, where the other information and the to-be-indicated information have an association relationship. Only a part of the to-be-indicated information can be indicated, and the other part of the to-be-indicated information is known or agreed in advance. For example, the indication of specific information can also be implemented by means of the arrangement order of each information agreed in advance (for example, defined by a protocol), thereby reducing the indication overhead to a certain extent. In addition, the to-be-indicated information can be sent as a whole, or can be sent separately in multiple sub-information, and the sending period and / or sending time of the sub-information can be the same or different.

[0106] Sixth, in the embodiments of the present application, "pre-configuration" can include pre-definition, for example, protocol definition. The "pre-definition" can be implemented by pre-storing corresponding codes, tables or other information indicating methods in the node, and the present application does not limit the specific implementation method.

[0107] Seven, the "storage" or "save" involved in the embodiments of the present application can refer to saving in one or more memories. The one or more memories can be separately arranged or integrated in the encoder or decoder, processor, or communication device. The one or more memories can also be partially separately arranged and partially integrated in the decoder, processor, or communication device. The type of memory can be any form of storage medium, which is not limited.

[0108] Eight, the "protocol" involved in the embodiments of the present application can refer to a standard protocol in the field of communication, which can include, for example, fourth generation (4 th generation, 4G) network, fifth generation (5 th generation, 5G) network protocol, NR protocol, 5.5G network protocol, and related protocols applied to future communication networks, which are not limited by the present application.

[0109] Nine, the arrows or blocks shown by dashed lines in the schematic diagrams in the drawing part of the present application specification represent optional steps or optional modules.

[0110] Ten, unless otherwise specified, " / " represents that the objects associated before and after are in an "or" relationship, for example, A / B can represent A or B; "and / or" in the present application is only a description of the association relationship of the associated objects, which means that there can be three kinds of relationships, for example, A and / or B, which can represent: A exists alone, A and B exist together, and B exists alone, where A and B can be singular or plural.

[0111] Eleven, in the present application, "sending" and "receiving" represent the direction of signal transmission. For example, "sending information to XX" can be understood as that the destination of the information is XX, which can include direct sending through the air interface, and also includes indirect sending through the air interface by other units or modules. "Receiving information from YY" can be understood as that the source of the information is YY, which can include direct receiving from YY through the air interface, and also includes indirect receiving from YY through the air interface from other units or modules. "Sending" can also be understood as "output" of the chip interface, and "receiving" can also be understood as "input" of the chip interface. In other words, sending and receiving can be carried out between devices, for example, between a first node and a second node, or can be carried out within a node, for example, between components, modules, chips, software modules or hardware modules in a device through a bus, wire or interface.

[0112] The technical solutions of the embodiments of the present application can be applied to various wireless network scenarios or wired network scenarios, for example, the institute of electrical and electronics engineers (IEEE) 802.11 series standards or other series standards of wireless local area network (WLAN), 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, starlink short-distance wireless networks, wireless self-organizing networks, wireless sensor networks, wireless internet of things (IoT), vehicle to x (V2X), satellite networks, and the like.

[0113] Although the embodiments of the present application are mainly described by taking the deployment of WLAN networks, especially the networks applying IEEE 802.11 system standards as examples, it is easy for those skilled in the art to understand that various aspects involved in the embodiments of the present application can be extended to other networks using various standards or protocols, for example, bluetooth, high performance radio local area network (HIPERLAN), and wide area network (WAN), personal area network (PAN) or other now known or later developed networks. Therefore, regardless of the coverage range and wireless access protocol used, various aspects provided by the embodiments of the present application can be applied to any suitable wireless network.

[0114] The technical solutions of the embodiments of the present application can be applied to various communication systems, including but not limited to: a global system for mobile communication (GSM) system, a code division multiple access (CDMA) system, a wideband code division multiple access (WCDMA) system, a general packet radio service (GPRS), a long term evolution (LTE) system, an LTE frequency division duplex (FDD) system, an LTE time division duplex (TDD), a universal mobile telecommunication system (UMTS), a worldwide interoperability for microwave access (WiMAX) system, a 5G system, and the like wireless local area network system.

[0115] The above communication system to which the present application is applied is only illustrative, and the communication system to which the present application is applied is not limited thereto.

[0116] In the embodiments of the present application, a terminal can refer to a user equipment (UE), an access terminal, a user unit, a user station, a mobile station, a mobile station, a remote station, a remote terminal, a mobile device, a user terminal, a terminal, a wireless device, a user agent, or a user apparatus. The terminal can also be a cellular phone, a cordless phone, a session initiation protocol (SIP) phone, a wireless local loop (WLL) station, a personal digital assistant (PDA), a handheld device with communication function, a computing device, or other processing device connected to a wireless modem, a vehicle-mounted device, a wearable device, a terminal in a 5G network, a terminal in a future communication network, or a terminal in a public land mobile network (PLMN), and the like, without limitation.

[0117] In the embodiments of the present application, the network device can be a device for communicating with a terminal, can be a base station (base transceiver station, BTS) in a GSM system or a CDMA system, a base station (nodeB, NB) in a WCDMA system, an evolved nodeB (eNB or eNodeB) in an LTE system, can also be a wireless controller in a cloud radio access network (CRAN) scenario, or can be a relay station, an access point, a vehicle-mounted device, a wearable device, a network device in a 5G network, a network device in a future communication network, or a network device in a PLMN network, and the like, and is not limited in this regard.

[0118] FIG. 1 is a schematic diagram of a transmission path in a multi-hop network. In FIG. 1, a network wave for transmitting a service flow is established based on a transmission path including a plurality of nodes. Taking transmission path 1 and transmission path 2 as examples, transmission path 1 and transmission path 2 correspond to different network waves (a network wave can be used for data transmission) respectively. Transmission path 1 includes node 1 to node N (N is a positive integer greater than 1), and transmission path 2 includes node 2 to node N+1.

[0119] It should be noted that the multi-hop network described in the embodiments of the present application can be one hop or more than one hop. One hop means that a transmission path includes only one source node and one destination node, and data is transmitted directly from the source node to the destination node. More than one hop means that a transmission path includes more than two 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), and transmission path 2 includes N nodes, and the multi-hop network corresponding to transmission path 2 is an N-1 hop network (N is a positive integer greater than 1).

[0120] When node 1 has a service to be transmitted to node N, node 1 is the source node of transmission path 1, node N is the destination node of transmission path 1, and node 2 to node N-1 are intermediate nodes of transmission path 1. Node N+1 is not part of transmission path 1, and node N+1 is a path-outside node of transmission path 1. When node 2 has a service to be transmitted 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, and node 3 to node N are intermediate nodes of transmission path 2. Node N+2 is not part of transmission path 2, and node N+2 is a path-outside node of transmission path 2.

[0121] There can be at least one slave service flow on the same transmission path. The transmission direction of the slave service flow can be the same as or different from that of the master service flow. For example, the transmission direction of the master service flow is from a source node (e.g., node 1) to a destination node (e.g., node N), and the transmission direction of the slave service flow is from the source node to the destination node or from the destination node to the source node.

[0122] The source node corresponding to the master service flow is the source node of the transmission path, and the destination node corresponding to the master service flow is the destination node of the transmission path. When the source node corresponding to the slave service flow is the source node of the transmission path, the destination node corresponding to the slave service flow is not the destination node of the transmission path; or when the destination node corresponding to the slave service flow is the destination node of the transmission path, the source node corresponding to the slave 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 master service flow on the transmission path 1 is node 1, and the destination node corresponding to the master service flow is node N. The source node corresponding to the slave service flow on the transmission path 1 is node 3, and the destination node corresponding to the slave service flow is node N-1 (the transmission direction of the slave service flow is the same as that of the master service flow); or the source node corresponding to the slave service flow on the transmission path 1 is node N-1, and the destination node corresponding to the slave service flow is node 3 (the transmission direction of the slave service flow is different from that of the master service flow).

[0123] For a specific transmission path, a node has four roles: a source node, a destination node, an intermediate node, and a node outside the path. The same node can have different roles for different transmission paths. For example, node N is a destination node for transmission path 1 and an intermediate node for transmission path 2.

[0124] The transmission paths shown in FIG. 1 can be applied to an architecture without a control node or an architecture with a control node. The control node refers to a node that can collect relevant information of all ordinary nodes in the network, calculate relevant parameters of network waves, and issue network wave reservation resources. In addition, the control node can master all routing paths in the network, the interference node list of each node, and the resource reservation situation of existing network waves. The control node can be a node in the transmission path or a node outside the transmission path.

[0125] FIG. 2 is a schematic diagram of a multi-hop network including a control node (the control node is located outside the transmission path). For example:

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

[0127] In (b) of Fig. 2, the control node communicates with the nodes in the transmission path through the proxy nodes, and all the proxy nodes are not the nodes in the transmission path.

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

[0129] In (d) of Fig. 2, the control node communicates with the nodes in the transmission path through the proxy nodes, and part of the proxy nodes are the nodes in the transmission path, and the other part of the proxy nodes are the nodes out of the transmission path.

[0130] Each node in Fig. 1 can be a device with wireless communication capability, and the node can be a station (STA) or an access point (AP) or the like. The AP can be a communication server, a router, a switch, or any of the network devices described above. The STA can be a mobile phone, a computer, or any of the terminals described above. The embodiments of the present application are not limited in this regard.

[0131] For example, the AP can be an access point for terminals to enter a wired (or wireless) network, and is mainly deployed in a home, a building, and a park, and has a typical coverage radius of tens of meters to hundreds of meters. Of course, the AP can also be deployed outdoors. The AP is equivalent to a bridge connecting a wired network and a wireless network, and mainly functions to connect various wireless network clients together and then access the wireless network to an Ethernet.

[0132] 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 example, the STA can be a mobile phone supporting Wi-Fi communication function, a tablet computer supporting Wi-Fi communication function, a set-top box supporting Wi-Fi communication function, a smart television supporting Wi-Fi communication function, a smart wearable device supporting Wi-Fi communication function, a vehicle-mounted communication device supporting Wi-Fi communication function, and a computer supporting Wi-Fi communication function, and the like.

[0133] It can be understood that the above description of the AP, the STA, and the node is only an example and is not limited in this regard.

[0134] It should be noted that the content described in FIG. 1 and FIG. 2 can be applied to the following scenarios: a unidirectional transmission scenario (including a unidirectional transmission scenario with a control node and a unidirectional transmission scenario without a control node), a bidirectional transmission scenario (including a bidirectional transmission scenario with a control node and a bidirectional transmission scenario without a control node), and a periodic transmission scenario (including a periodic transmission scenario with a control node and a periodic transmission scenario without a control node).

[0135] Specifically, the unidirectional transmission scenario is a scenario in which the transmission direction of the primary service flow on the transmission path and the transmission direction of all the secondary service flows on the transmission path are the same. The bidirectional transmission scenario is a scenario in which the transmission direction of the primary service flow on the transmission path and the transmission direction of at least one secondary service flow on the transmission path are different. The periodic transmission scenario is a scenario in which the transmission path can be periodically used for data transmission.

[0136] For ease of description, the following describes the unidirectional transmission scenario as an example, and describes the difference between the unidirectional transmission scenario and the periodic transmission scenario and the difference between the unidirectional transmission scenario and the bidirectional transmission scenario. Therefore, the following content about the unidirectional transmission scenario is also applicable to the bidirectional transmission scenario and the periodic transmission scenario, which will not be described again hereinafter.

[0137] In order to facilitate understanding of the technical solutions of the embodiments of the present application, the following briefly describes some terms. The terms are applicable to the above three scenarios. It should be noted that the following content is only used as an example and is not the final limitation.

[0138] I. Network wave state table

[0139] Each node can store a respective network wave state table, for example, the first node stores a first network wave state table, the second node stores a second network wave state table, the third node stores a third network wave state table, and the fourth node stores a fourth network wave state table. The network wave state table includes at least one network wave state information entry. The network wave state table can be used by the node to query the establishment state of the network wave. In addition, each node can update, delete, or add, etc. the network wave state information in the network wave state table stored by itself according to the information related to the network wave included in the received frame.

[0140] FIG. 3 is a schematic diagram of a network wave state information entry. For example, the network wave state information entry includes but is not limited to: a source node address, a destination node address, a path identifier, a network wave sequence number, a network wave state, and a state parameter.

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

[0142] Source node address: address of the source node of the network wave to be established. The address refers to information capable of distinguishing different nodes, including but not limited to: media access control (MAC) address, internet protocol (IP) address, node identifier (ID), etc.

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

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

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

[0146] Network wave state: including a requesting state and an established state. The requesting state indicates that the source node has initiated a network wave establishment request and is waiting for a response from the destination node. The established state indicates that the source node has currently established a network wave.

[0147] State parameter: when the network wave state is the requesting state, the source node starts a network wave request timer and fills in the timer time (which can be used to indicate the time for which the network wave request is valid) in this field. When the network wave state is the established state, the source node fills in the lifetime of the current network wave (which can also be understood as the planned duration of the network wave) in this field. The lifetime is an optional field, and the source node can not fill it or fill it with a default value. When the establishment time of the current network wave exceeds the lifetime, the source node performs a network wave teardown process.

[0148] When the first node (as the source node) wants to establish a network wave 1, the first node can look up the first network wave state table according to the identification information of the network wave 1 (including: the source node address of the network wave 1, the destination node address of the network wave 1, the path identification of the transmission path corresponding to the network wave 1, and the network wave sequence number of the network wave 1), and take corresponding operations:

[0149] Case 1:

[0150] If the network wave state information entry of the network wave 1 is not queried, the first node adds one to the value of the network wave sequence number counter of the first node, and establishes the network wave state information entry of the network wave 1 in the first network wave state table, and inputs the related information, such as the value of the current network wave sequence number counter, the network wave 1 being requested, and the timing time.

[0151] Case 2:

[0152] If the network wave state information entry of the network wave 1 is queried, and the network wave state is being requested, if the timing time is not reached, the first node waits for the response from the third node (as the destination node).

[0153] When the network wave state in the network wave state information entry of the network wave 1 is being requested, and the timing time is reached, the first node reinitiates the network wave establishment request, adds one to the value of the network wave sequence number counter, fills the value of the current network wave sequence number counter into the network wave sequence number field in the network wave state information entry of the network wave 1, and starts a new network wave request timer to update the timing time.

[0154] Case 3:

[0155] If the network wave state information entry of the network wave 1 is queried, and the network wave state is already established, the first node directly performs service transmission.

[0156] II. Working information table

[0157] Each node can store a respective 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 is used to indicate that the node needs to transmit data to a specific receiving node on a specific communication resource (the communication resource includes one or more of the time domain resource, the frequency domain resource, and the code domain resource). The working information table is composed of one or more working information entries. In addition, each node can update or delete or add and the like operations on the working information entries in the working information table stored by itself according to the information related to the communication resource included in the received frame.

[0158] Figure 4 is a schematic diagram of a work information entry. Exemplarily, the work information entry includes, but is not limited to, a source node address, a destination node address, a path identification, a network wave sequence number, a communication node address, and indication information.

[0159] The descriptions of the source node address, the destination node address, the path identification, and the network wave sequence number can be found in the foregoing.

[0160] The communication node address: indicates that the data is transmitted to the corresponding node under the indication of the current work information entry.

[0161] In the one-way transmission scenario, the communication node is the receiving node, i.e., the communication node is the next hop node of the node. In the two-way transmission scenario, the communication node includes the previous hop node and the next hop node. When the node does not have the previous hop node or the next hop node in the current transmission path, an invalid field can be filled in the corresponding field.

[0162] The indication information: indicates the communication resource of the specific work of the node. For the convenience of description, the present application takes a time slot as an example.

[0163] Figure 5 is a schematic diagram of the indication information. Exemplarily:

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

[0165] In (b) of Figure 5, the time slot bitmap represents the time slot reservation situation, and the i-th bit represents whether the i-th time slot in the superframe is a working time slot, for example, a value of “1” represents that the i-th time slot is a working time slot, and a value of “0” represents that the i-th time slot is a non-working time slot, and vice versa.

[0166] In (c) of Figure 5, the time slots with the same working frequency band are combined, and the “working frequency band”, the “time slot number”, and the “time slot sequence number” indicate the number and the specific sequence number of a group of time slots under a specific working frequency band.

[0167] In (d) of Figure 5, the time slot-frequency band bitmap represents the working record of a time slot on a frequency band, and the binary tuple (i, j) composed of the time slot i and the frequency band j represents whether the i-th time slot is a working time slot on the j-th frequency band, for example, a value of “1” represents that the i-th time slot is a working time slot on the j-th frequency band, and a value of “0” represents that the i-th time slot is a non-working time slot on the j-th frequency band, and vice versa.

[0168] Three, reservation information table

[0169] Each node can store a respective 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, the fourth node stores a fourth reservation information table, and so on. The reservation information table can be used to indicate the resources that cannot be used by the node, or the resources that are occupied by other nodes. The reservation information table includes at least one reservation information entry, which indicates the resources that are occupied by other nodes. In addition, each node can update, add or delete the reservation information entries in the respective stored reservation information table according to the information related to the communication resources included in the received frame.

[0170] Fig. 6 is a schematic diagram of a reservation information entry. For example, the reservation information entry includes but is not limited to: source node address, destination node address, path identification, network wave sequence number, and resource reservation information (the number of resource reservation information fields is not limited)

[0171] As shown in Fig. 6(a), the resource reservation information includes: reservation receiving node address, reservation time slot number, and reservation time slot sequence number. The reservation receiving node address is the address of the data receiving node in the reservation time slot, the reservation time slot number 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 the reservation time slots in the superframe.

[0172] As shown in Fig. 6(b), the resource reservation information includes: reservation receiving node address, reservation time slot group number, operating frequency band, reservation time slot group time slot number, and reservation time slot group time slot sequence number. Among them, the reservation receiving node address is the address of the data receiving node in the reservation time slot, the reservation time slot group number indicates the number of reservation time slot groups in the reservation information field (related to the number of operating frequency bands, one operating frequency band corresponds to one group of time slots), and the operating frequency band, time slot number, and time slot sequence number respectively indicate the operating frequency band, time slot number, and specific sequence number of each group of reservation time slots.

[0173] Among them, the storage form of the communication resources in the working information table and the reservation information table can be consistent (for example, the indication information in the working information table adopts a bitmap form, and the resource reservation information in the reservation information table adopts a non-bitmap form, which can be converted between the bitmap form and the non-bitmap form), or can be inconsistent (for example, the indication information in the working information table adopts a bitmap form, and the resource reservation information in the reservation information table adopts a bitmap form). In addition, the representation of the communication resources appearing in the following text can refer to the content described in Fig. 5, which will not be repeated hereinafter.

[0174] It should be noted that all the nodes maintain a synchronous clock and divide a working period into periodic superframes, each of which contains a plurality of time periods (referred to as time slots). The start time, the end time, the number of time slots contained in each superframe of each node are the same and remain synchronous. After the same clock and superframe are maintained in each node, a time slot in a superframe can be represented by the sequence number of the time slot in the superframe.

[0175] IV. Path table

[0176] Each node can establish a transmission path through different routing protocols, and store the related information of the transmission path into the path table during the establishment of the transmission path. In the embodiment of the present application, the establishment of the end-to-end transmission path between nodes has been completed through the existing routing technology, and the nodes will maintain the related path table. The specific implementation of the process is not limited in the embodiment of the present application.

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

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

[0179] The path identification is used to identify the path composed of different nodes with the same path source node and destination node.

[0180] The path source node, the path destination node and the path sequence number can uniquely distinguish a transmission path. The next hop node address is the receiving node of the next hop when the node transmits data to the path destination node through the transmission path. The previous hop node address is the node that sends data to the node when the node transmits data to the path destination node through the transmission path.

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

[0182] V. Greedy reservation table

[0183] Each node can store a respective 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. Among them, the node can determine whether it can reserve the communication resource according to whether there is greedy reservation indication information in the greedy reservation table. In addition, each node can update or add or delete the greedy reservation indication information entry in the respective stored greedy reservation table according to the information related to the network wave included in the received frame.

[0184] In the embodiment, the greedy reservation indication information includes but is not limited to the source node address, the destination node address, the path identifier, the network wave sequence number, the greedy reservation establishment node address and the timing time.

[0185] The source node address, the destination node address, the path identifier and the greedy reservation establishment node address in the greedy reservation indication information can be understood as a greedy reservation indication four-tuple.

[0186] When the greedy reservation table of a node contains the greedy reservation indication information reaching the timing time, the node searches for the corresponding reservation information entry in the reservation information table of the node according to the source node address, the destination node address, the path identifier and the network wave sequence number corresponding to the timing time, and deletes the corresponding reservation information entry and the corresponding greedy reservation indication information in the greedy reservation table.

[0187] The source node address, the destination node address, the path identifier and the network wave sequence number are described above.

[0188] The greedy reservation establishment node address is used to indicate the node in the path indicated by the path identifier that is establishing the greedy reservation. The timing time can indicate the valid time length of the greedy reservation indication information, or in other words, when the timing time reaches (the starting time of the timing time is the time when the node establishes the greedy reservation indication information), the node can delete the greedy reservation indication information.

[0189] In one possible implementation, when the greedy reservation table of a node does not contain any greedy reservation indication information, the node can perform the greedy reservation on the communication resource.

[0190] In another possible implementation, when the greedy reservation table of a node contains only the greedy reservation indication information corresponding to the network wave to which the node belongs, the node can perform the greedy reservation on the communication resource. For example, when node 1 belongs to network wave 1, and the greedy reservation table of node 1 contains the 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), node 1 can perform the reservation on the communication resource.

[0191] The working information table, the reservation information table, the greedy reservation table, the network wave state table and the like can be updated or deleted or added and the like. For example, the node can update or delete or add and the like the working information table, the reservation information table, the greedy reservation table, the network wave state table and the like according to the relevant information in the received frame, which can be seen from the following description.

[0192] As indicated in the background section, existing solutions can result in the service quality of a communication service being unable to be guaranteed. In view of this, the present application provides a communication method and a communication device, which can support guaranteeing the service quality of a communication service.

[0193] The communication method of the embodiments of the present application is described below in conjunction with the accompanying drawings.

[0194] For ease of understanding and description, the communication method of the embodiments of the present application is described below by taking a first node, a second node and a third node as examples, but this should not constitute any limitation on the execution subject of the communication method. For example, a node (such as the first node, the second node or the third node) can be the node itself or a functional module (such as a circuit, a chip or a chip system, etc.) or a logical node, a logical module or software capable of realizing all or part of the functions of the node.

[0195] When a step involving sending or receiving is performed by a module (such as a circuit, a chip or a chip system, etc.), a logical node, a logical module or software, etc. in the first node, the second node and the third node, the sending / receiving can be understood as communication through a communication interface, an input / output interface, a pin or a circuit, etc.

[0196] It should be noted that the content described below can be applied to the aforementioned unidirectional transmission scenario, bidirectional transmission scenario and periodic transmission scenario. For ease of description, the unidirectional transmission scenario is taken as an example below, and the content is also applicable to the bidirectional transmission scenario and the periodic transmission scenario.

[0197] FIG. 7 is an interaction flow diagram of a communication method according to an embodiment of the present application. FIG. 7 is described by taking the first node as a source node, the second node as an intermediate node and the third node as a destination node as an example. As shown in FIG. 7, the method comprises:

[0198] S701, the first node determines a first frame.

[0199] The first frame is used to request establishment of a network wave 1 (the transmission path corresponding to the network wave 1 comprises the first node, the second node and the third node). The first frame can be a wireless frame or a wired frame, which is not limited. The first frame can also be replaced by other terms, such as a network wave establishment request frame, etc., which is not limited.

[0200] The first node can determine the establishment state of the network wave 1 according to a first network wave state table. For details, refer to the description of the network wave state table.

[0201] In one possible implementation, the first frame comprises but is not limited to: identification information of the network wave 1, reservation resource information of the first node, an address of the first node and an address of the second node.

[0202] For example, the identification information of the network wave 1 is used to identify the network wave 1. In this way, the node receiving the first frame can determine whether to process the first frame according to the identification information of the network wave 1 in the first frame, for example, the node receiving the first frame can determine whether it is on the transmission path corresponding to the network wave 1 according to the identification information of the network wave 1 in the first frame, if it is a node on the transmission path corresponding to the network wave 1, it processes the framing and forwarding processing, if it is not a node on the transmission path corresponding to the network wave 1, it does not process the framing and forwarding processing.

[0203] For example, the reservation resource information of the first node is used to indicate the communication resource that the first node hopes to use for data transmission. In this way, this can support configuring the communication resource for the first node to use for data transmission according to the reservation resource information of the first node.

[0204] For example, the address of the second node is determined by the first node according to the next hop node address in the first path table. In this way, the second node can determine to process the first frame, such as framing and forwarding processing, according to the address of the second node in the first frame.

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

[0206] One possible implementation, 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 the network wave 1, the second field indicates the reservation resource information of the first node (which can also be referred to 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.

[0207] Through the above fields, this can support the indication of the corresponding information in the first frame, so as to support the configuration of the corresponding communication resource for each node on the transmission path corresponding to the network wave.

[0208] One possible implementation, the first frame can also include a fifth field, the fifth field indicating the resource parameter of the first node. The resource parameter of the first node includes: the address of the first node, the unavailable resource information of the first node (which can also be referred to as reserved resource information or used resource information), the neighbor node list of the first node (when there is a control node, the first frame can not include the neighbor node list of the first node), and the resource requirement information of the first node.

[0209] In this way, this can support configuring the corresponding communication resource for the first node according to the resource parameter of the first node.

[0210] 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, this can support configuring the corresponding communication resources for the first node according to the unavailable resources of the first node.

[0211] The neighbor node list of the first node can indicate the neighbor nodes of the first node. In this way, this can determine the nodes having an interference relationship with the first node (it can be understood that: two nodes in the same time tick are in an active state, one node will interfere with the correct reception of the corresponding information block receiving node of the other node) according to the neighbor node list of the first node.

[0212] The resource requirement information of the first node can indicate the resource requirement of the first node. In this way, this can support configuring the corresponding communication resources for the first node according to the resource requirement of the first node.

[0213] In one possible implementation, the first frame can further include a sixth field, and the sixth field indicates whether the transmission direction of the main service flow of the network wave 1 and the transmission direction of at least one slave service flow of the network wave 1 are consistent.

[0214] When the sixth field indicates that the transmission direction of the main service flow of the network wave 1 and the transmission direction of at least one slave service flow of the network wave 1 are inconsistent, it means that the network wave 1 can perform bidirectional transmission. When the sixth field indicates that the transmission direction of the main service flow of the network wave 1 and the transmission direction of the slave service flow of the network wave 1 are consistent, it means that the network wave 1 can perform unidirectional transmission.

[0215] In this way, this can support indicating whether the network wave described above supports bidirectional transmission.

[0216] The description of the first frame can be referred to FIG. 8.

[0217] FIG. 8 is a structure diagram of the first frame of the embodiment of the present application. As shown in FIG. 8, the first frame includes but is not limited to:

[0218] frame type, receiving address, sending address, source node address, destination node address, path identification, network wave sequence number, lifetime, multi-directional enablement, greedy reservation information, source node resource request information.

[0219] It should be noted that part of the fields in the above first frame is optional (such as lifetime, etc.). In addition, the first frame can further include a plurality of resource request information fields (one resource request information field corresponds to one node).

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

[0221] Receiving address: the address of the next-hop receiving node of the first frame, i.e., the address of the second node. The receiving address field can be the third field.

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

[0223] The descriptions of the source node address, the destination node address, the path identifier, and the network wave sequence number can be found in the foregoing. The source node address, the destination node address, the path identifier, and the network wave sequence number fields can be the first fields.

[0224] Lifetime: indicates the planned duration of use after the establishment of the network wave 1.

[0225] Multi-directional enable: indicates whether the transmission direction of the slave traffic stream is allowed to be opposite to the transmission direction of the master traffic stream. For example, a value of 1 indicates that multi-directional transmission is allowed, i.e., the transmission direction of the slave traffic stream is allowed to be opposite to the transmission direction of the master traffic stream, and a value of 0 indicates that multi-directional transmission is not allowed, i.e., the transmission direction of the slave traffic stream is not allowed to be opposite to the transmission direction of the master traffic stream. It should be noted that this field can also be replaced by a multi-directional disable field, a value of 1 of which indicates that multi-directional transmission is disabled, and a value of 0 of which indicates that multi-directional transmission is allowed. The multi-directional enable field can be the sixth field.

[0226] Greedy reservation information: indicates the communication resources on which the first node performs greedy reservation. The greedy reservation can be understood as a process in which the first node establishes reservations on some communication resources. The embodiments of the present application do not limit the determination method of the greedy reservation resources.

[0227] Optionally, when only time slots are introduced, the node establishes reservations on all idle time slots that are not reserved by itself; and when time slots and frequency bands are introduced, the node establishes reservations on all idle time slots and idle frequency bands that are not reserved by itself. The greedy reservation information field can be the second field. The description of the greedy reservation information can be found in the foregoing description of the reservation information table, and will not be repeated here.

[0228] Source node resource request information: including resource request node address, neighbor node list of source node, reserved information and resource requirement. The source node resource request information can be used to calculate the reserved resource (time slot and bandwidth, etc.) required by network wave 1. The source node resource request information field can be the fifth field.

[0229] Resource request node address: the address of the first node, indicating the node adding the "resource request information";

[0230] Neighbor node list: including the number of neighbor nodes and the address of the neighbor nodes, indicating the neighbor node information within one hop range of the first node, which will be the interference node of the first node. It should be noted that the first node can record the one-hop neighbor node information by listening to the packets sent by the surrounding nodes.

[0231] Resource requirement field: including resource requirement quantity, destination node address of service flow 1, resource requirement 1 corresponding to service flow 1, destination node address of service flow 2, resource requirement 2 corresponding to service flow 2, etc. The "resource requirement quantity" indicates the number of services that the first node needs to transmit through the network wave 1, the "destination node address of service flow 1" represents the destination node address of service flow 1, and the "resource requirement 1 corresponding to service flow 1" field represents the specific resource required for the transmission of service flow 1, which can be represented by bandwidth or other forms.

[0232] Reserved information field: please refer to FIG. 9.

[0233] FIG. 9 is a schematic diagram of the reserved information field of the embodiment of the present application. Exemplarily:

[0234] As shown in (a) of FIG. 9, the "reserved time slot quantity" field indicates the number of all reserved time slots, and the "reserved time slot sequence number" indicates the specific sequence number of the reserved time slot in the superframe.

[0235] As shown in (b) of FIG. 9, the "network wave reservation quantity" field indicates the total number of network wave reservation periods stored by 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", and the "reserved time slot quantity" and "reserved time slot sequence number" are the number of time slots and the specific time slot sequence number reserved by the network wave in the superframe.

[0236] As shown in (c) of FIG. 9, the specific information of the existing network waves is not distinguished, and only the total bitmap information of the network wave reservation is recorded (the ith bit indicates whether the ith time slot in the superframe is a reserved time slot, for example, the value "1" indicates that the time slot is reserved, and the value "0" indicates that the time slot is not reserved, and vice versa. The total bitmap information of the network wave reservation can be obtained by taking the union of the bitmap of each network wave reservation, and the final total bitmap can be obtained by performing a "bitwise OR" operation on each bitmap).

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

[0238] As shown in (e) of FIG. 9, the reservation time slots of the network waves with the same reservation frequency band are combined, the "reservation time slot group number" indicates the number of groups of the reservation time slots according to different working frequency bands, and the "reservation time slot group frequency band" and the "reservation time slot group number" and the "reservation time slot group serial number" indicate the number and specific serial number of a group of the reservation time slots in a specific reservation frequency band.

[0239] As shown in (f) of FIG. 9, the reservation time slots of each network wave are grouped according to different reservation frequency bands, the "reservation time slot group number" indicates the number of groups of the reservation time slots according to different frequency bands, and the "reservation time slot group frequency band" and the "reservation time slot group number" and the "reservation time slot group serial number" indicate the number and specific serial number of a group of the reservation time slots in a specific reservation frequency band.

[0240] As shown in (g) of FIG. 9, the specific information of the existing network waves is not distinguished, and the total time slot-frequency band two-dimensional bitmap information of all network waves is recorded, each bit of the two-dimensional bitmap indicates whether a time slot in a frequency band has been reserved, and the two-element group of the time slot and the frequency band indicates whether the ith time slot in the jth frequency band has been reserved, for example, the value "1" indicates that the ith time slot in the jth frequency band has been reserved, and the value "0" indicates that the ith time slot in the jth frequency band has not been reserved, and vice versa.

[0241] As shown in (h) of FIG. 9, the specific reservation resource information of each network wave is also represented by a time slot-frequency band two-dimensional bitmap.

[0242] Specifically, the first node can fill in the "source node address", "destination node address", "path identification" and "network wave sequence number" corresponding to network wave 1 in the first frame by querying the first network wave state table, and fill in all the remaining free resources (i.e. the remaining resources not recorded in the reserved information table and the working information table) in the "greedy reservation information" in the first frame according to the records in the first reservation information table and the first working information table. In addition, the first node can add the neighbor node list of the first node, the reserved information (i.e. the information of the resources indicated in the first working information table and the first reservation information table) and the resource requirements and the like in the source node resource request information.

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

[0244] The first node can broadcast the first frame, and a plurality of nodes receive the first frame, including the second node, the third node and the fourth node. The fourth node is a path-out node of network wave 1.

[0245] When any node receives the first frame, the node can determine the node type of the node according to the content in the first frame. For example, if the node address is the same as the "receiving address" of the first frame and the same as the "destination node address" of the first frame, it is the next hop and the destination node. If the node address is the same as the "receiving address" of the first frame and different from the "destination node address" of the first frame, it is the next hop and the non-destination node. If the node address is different from the "receiving address" of the first frame, the node queries whether the "source node", "destination node" and "path identification" information are stored according to the stored path table. If the corresponding information is stored, it is a non-next-hop and path-in node. The node that does not belong to the above three types is a non-next-hop and path-out node.

[0246] Different nodes have different processing methods for the received first frame. The third node does not process the first frame, and the processing method of the second node for the first frame is different from that of the fourth node for the first frame.

[0247] The processing method of the fourth node for the first frame is described below.

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

[0249] (1) If the greedy reservation indication information is not stored in the fourth greedy reservation table, go to step (3).

[0250] (ii) If the fourth greedy reservation table stores the greedy reservation indication information corresponding to the source node address, the destination node address, the path identifier and the address of the first node in the first frame, the second node compares 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 found greedy reservation indication information is smaller than the network wave sequence number in the first frame, the second node deletes the found greedy reservation indication information, and turns to step (iii).

[0251] (iii) According to the identification information of the network wave 1 in the first frame, the second node searches the fourth reservation information table for the reservation information entry of the network wave 1. If the second node does not find the reservation information entry of the network wave 1, the second node establishes the reservation information entry of the network wave 1 in the fourth reservation information table with the identification information of the network wave 1, and supplements the resource reservation information of the network wave 1 in the reservation information entry of the network wave 1. If the second node finds the reservation information entry of the network wave 1, the second node updates the resource reservation information of the network wave 1 in the reservation information entry of the network wave 1.

[0252] The fourth node can supplement or update the specific content of the resource reservation information of the network wave 1 according to the greedy reservation information in the first frame. For example, the "reservation receiving node address" is filled with the address of the first node, the "reservation time slot quantity" and the "reservation time slot sequence number" are filled with the "reservation time slot quantity" and the "reservation time slot sequence number" in the greedy reservation information in the first frame.

[0253] Optionally, the fourth node adds a greedy reservation indication information corresponding to the identification information of the network wave 1 in the fourth greedy reservation table, and starts the greedy reservation timer, and fills in the "timing time".

[0254] S703, the second node determines the fourth frame according to the first frame.

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

[0256] (i) If the second greedy reservation table does not store the greedy reservation indication information, the second node queries the second network wave state table according to the "source node", the "destination node" and the "path identifier" in the first frame, and determines the establishment of the network wave 1. If there is no network wave state information of the network wave 1, the second node turns to step (iii). If there is the network wave state information of the network wave 1, the second node compares the size relationship between the network wave sequence number in the network wave state information of the network wave 1 in the second network wave state table and the "network wave sequence number" in the first frame. If the network wave sequence number in the network wave state information of the network wave 1 in the second network wave state table is smaller than the "network wave sequence number" in the first frame, the second node deletes the network wave state information of the network wave 1 in the second network wave state table, and turns to step (iii).

[0257] If the second greedy reservation table stores the greedy reservation indication information, the second node executes step (three) after determining that the greedy reservation indication information in the second greedy reservation table reaches the corresponding timing time. It should be noted that, alternatively, when the second greedy reservation table only stores the greedy reservation indication information corresponding to the network wave 1 (the greedy reservation establishment node address in the greedy reservation indication information is the address of the second node, such as the address of the first node, etc.), the second node can also perform the greedy reservation, and can execute step (three).

[0258] The second node performs framing processing on the first frame to obtain a fourth frame. The framing processing can be understood as a process in which the second node adds the related information of the second node to the first frame. For example, the second node adds the reservation resource information of the second node and the address of the third node to the first frame. For example, the second node modifies the receiving address field in the first frame and fills in the address of the third node, and adds the reservation resource information of the second node in the greedy reservation information field. Therefore, the fourth frame includes the identification information of the 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.

[0259] Specifically, the second node can determine all the remaining available free resources according to the resource information in the second reservation information table and the second working information table, fill the information of the free resources in the "greedy reservation information" in the first frame, and add the second node resource request information after the source node resource request information in the first frame. The second node resource request information includes the second node address, the neighbor node list of the second node (when there is a control node, the first frame can not include the neighbor node list of the second node), the reserved information of the second node, and the resource demand of the second node.

[0260] The second node can store the network wave state information of the network wave 1 in the second network wave state table according to the identification information of the network wave 1. The "network wave state" in the network wave state information of the network wave 1 in the second network wave state table is "being requested", and the network wave request timer is started. The "timing time" is filled in the "state parameter". When the timing time of the network wave request timer is reached, the second node deletes the network wave state information of the network wave 1 in the second network wave state table.

[0261] The second node can query and determine the "next hop node address" of the second node in the second path table according to the "source node", "destination node", and "path identification", and fill it into the "receiving address" of the first frame, and forward the fourth frame (obtained based on the first frame).

[0262] In one possible implementation, the fourth frame comprises 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 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.

[0263] Through the above fields, the indication of the corresponding information in the fourth frame can be supported, so that the corresponding communication resource can be configured for each node on the transmission path corresponding to the network wave.

[0264] In one possible implementation, the fourth frame further comprises a sixth field and a seventh field, the sixth field indicates the resource parameter of the first node, and the seventh field indicates the resource parameter of the second node. The description of the resource parameter of the node can be referred to the foregoing, and will not be repeated here.

[0265] In this way, the corresponding communication resource can be configured for the first node and the second node respectively according to the resource parameter of the first node and the resource parameter of the second node.

[0266] In one possible implementation, the fourth frame further comprises an eighth field, the eighth field indicates whether the transmission direction of the primary service flow of the network wave 1 and the transmission direction of at least one secondary service flow of the network wave 1 are the same.

[0267] In this way, it can be indicated whether the network wave supports bidirectional transmission.

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

[0269] For example, the second node broadcasts the fourth frame, and a plurality of nodes receive the fourth frame, the plurality of nodes comprising the first node, the third node and a fourth node.

[0270] When any node receives the fourth frame, the node judges the node type of the node according to the content in the fourth frame. For example, if the node address is the same as the “receiving address” of the fourth frame and the same as the “destination node address” of the fourth frame, the node is the next hop and the destination node. If the node address is the same as the “receiving address” of the fourth frame and different from the “destination node address” of the fourth frame, the node is the next hop and the non-destination node. If the node address is different from the “receiving address” of the fourth frame, the node queries whether the “source node”, “destination node” and “path identification” information are stored according to the stored path table, if the corresponding information is stored, the node is the non-next hop and the in-path node. The node not belonging to the above three types is the non-next hop and the out-of-path node.

[0271] The fourth frame is processed differently by different nodes. The first node does not process the fourth frame. The third node processes the fourth frame differently from the fourth node. The fourth node processes the fourth frame in the same way as the first node, and will not be described again.

[0272] The processing of the fourth frame by the third node is described below.

[0273] When the third node receives the fourth frame, the third node processes as follows:

[0274] (I) If the third greedy reservation table does not store greedy reservation indication information, the third node queries the establishment of network wave 1 in the third network wave state table according to the identification information of network wave 1 in the fourth frame. When the third node does not query the network wave state information of network wave 1, step (III) is executed. When the third node queries the network wave state information of network wave 1, if the network wave sequence number of the network wave state information of network wave 1 in the third network wave state table is less than the network wave sequence number in the fourth frame, the third node can delete the state information of network wave 1 in the third network wave state table, and execute step (III).

[0275] (II) If the third greedy reservation table stores greedy reservation indication information, the third node stores the fourth frame, and executes step (III) after all greedy reservation indication information in the third greedy reservation table reaches the corresponding timing time. It should be noted that, optionally, when the third 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 the address of a node 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).

[0276] (III) The third node performs framing processing on the fourth frame to obtain a processed fourth frame. The framing processing can be that the third node adds relevant information of the third node in the fourth frame, for example, the third node adds the reservation resource information of the third node in the greedy reservation information of the third node 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.

[0277] Specifically, the third node supplements the specific content of the "network wave 1 resource reservation information" as follows according to the "greedy reservation information" in the fourth frame: the "reservation receiving node address" is filled with the address of the first node, and the "reservation time slot quantity" and the "reservation time slot sequence number" are filled with the "reservation time slot quantity" and the "reservation time slot sequence number" in the "greedy reservation information" in the fourth frame, taking the time slot resource as an example. The neighbor node list, the already reserved information, and the resource demand of the third node are added in the "node resource request information".

[0278] In addition, the third node stores the network wave state information of the network wave 1 in the third network wave state table, the "request state" is "requesting", and the network wave request timer is started, and the "timing time" is filled in the "state parameter". When the timing time of the current network wave request timer is reached, the third node will delete the network wave state information of the network wave 1.

[0279] When the third node completes the framing processing of the fourth frame, the third node broadcasts the processed fourth frame. In this way, this can support other nodes to obtain the resource reservation situation of the network wave 1.

[0280] S705, the third node determines the second frame according to the fourth frame.

[0281] The second frame is used to reply to the first frame, and the second frame includes the identification information of the network wave 1 and the used resource information of each node on the transmission path corresponding to the network wave 1 (which can also be the configuration resource information or the available resource information or the final transmission resource information and other terms, not limited). Among them, the third node can determine the second frame by itself, or the second frame can be determined by the control node. Hereinafter, the third node determines the second frame by itself as an example for description. The content of the second frame determined by the control node can be referred to in the following description.

[0282] The third node can calculate the communication resource used by the network wave 1 according to the information in the fourth frame, including the following processes:

[0283] 1. Determine the interference relationship table according to the neighbor node list of each node in the fourth frame;

[0284] 2. Calculate the interference distance distribution table;

[0285] 3. Calculate the inherent period;

[0286] 4. Divide the equal-interval concurrent node list;

[0287] 5. Allocate the final resource.

[0288] For example, the third node determines the interference relation table according to the neighbor node list of each node in the fourth frame. The interference relation table is a storage form of an interference relation matrix in network wave theory, and embodiments of the present application do not make specific limitation on the storage form of the interference relation matrix. The description of the interference relation table can refer to Table 1.

[0289] Table 1

[0290] As shown in Table 1, the interference relation 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 node of node j+1, or node j is a neighbor node of node i+1, then (i, j)=1; if node i is not a neighbor node of node j+1 and node j is not a neighbor node of node i+1, then (i, j)=0; for (i, j) (i=j), 0 can be uniformly filled in.

[0291] A possible example is that the third node performs the calculation of the interference relation table according to the algorithm shown in Table 2.

[0292] Table 2

[0293] In this way, the third node can perform the calculation of the interference relation table according to the content shown in Table 2.

[0294] For example, the third node obtains the interference distance distribution table according to the interference relation table. The interference distance distribution table is a storage form of an interference distance distribution spectrum in network wave theory, and embodiments of the present application do not make specific limitation on the storage form. Table 3 can be referred to. In Table 3, the number of node pairs with interference distance i (1≤i≤N-2) is the spectral line intensity of the spectrum of the interference distance spectrum in network wave theory.

[0295] Table 3

[0296] A possible example is that the third node can perform the calculation of the interference distance distribution table according to the algorithm shown in Table 4.

[0297] Table 4

[0298] In this way, the third node can perform the calculation of the interference distance distribution table according to the content shown in Table 4.

[0299] For example, the third node can determine the inherent period according to the interference distance distribution table described above. One possible example, the minimum period of the equal interval zero point of the interference distance distribution table described above can be regarded as the inherent period described above. For example, the third node divides each node in the transmission path corresponding to the network wave 1 according to the inherent period and the address of each node into equal interval concurrent node subsets. Please refer to Table 5.

[0300] Table 5

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

[0302] One possible example, the third node can determine the equal interval concurrent subset according to the content shown in Table 6.

[0303] Table 6

[0304] In this way, the third node can calculate the equal interval concurrent subset according to the content shown in Table 6.

[0305] Tables 1 to 6 are described by taking the unidirectional transmission as an example. The content about bidirectional transmission can be referred to Tables 7 to 12.

[0306] Table 7

[0307] 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).

[0308] For the bidirectional transmission scenario, there are bidirectional service flows. When 2≤j≤N-2, the receiving node of node j is node j+1 and node 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 node of node i is node i+1 and node 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), node i is the neighbor node of node j (including node j-1 and node j+1), or node j is the neighbor node of node i (including node i-1 and node i+1), then (i, j)=1; if node i is not the neighbor node of node j, and node j is not the neighbor node of node i, then (i, j)=0; for (i, j) (i=j), 0 can be uniformly filled. One possible example, the third node can calculate the interference relationship table described above according to the algorithm shown in Table 8.

[0309] Table 8

[0310] Thus, the third node can perform the calculation of the interference relationship table according to the content shown in Table 8.

[0311] For example, the third node obtains the interference distance distribution table according to the above interference relationship table. Please refer to Table 9. The number of node pairs with an interference distance of i (1≤i≤N-1) is the spectral line intensity of the interference distance spectrum in network wave theory

[0312] Table 9

[0313] For example, the third node can perform the calculation of the interference distance distribution table according to the content shown in Table 10.

[0314] Table 10

[0315] Thus, the third node can perform the calculation of the interference distance distribution table according to the content shown in Table 10.

[0316] For example, the third node can determine the intrinsic period according to the above interference distance distribution table. For example, the third node can regard the minimum period equal interval zero point of the above interference distance distribution table as the above intrinsic period. For example, the third node divides the equal interval concurrent node subsets according to the intrinsic period and the address of each node in the transmission path corresponding to the network wave 1. Please refer to Table 11.

[0317] Table 11

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

[0319] For example, the third node can perform the determination of the equal interval concurrent subset according to the content shown in Table 12.

[0320] Table 12

[0321] Thus, the third node can perform the calculation of the equal interval concurrent subset according to the content shown in Table 12.

[0322] When the third node determines the above information, the third node can determine the final transmission resource of each concurrent node subset according to the above equal interval concurrent subset, the resource requirement of each service flow, and the reservation resource information of each node, including the reservation time slot and frequency band, and requires the reservation time slot and frequency band to be used together to indicate the fluctuation transmission of the corresponding node. The following content is applicable to both the unidirectional transmission scenario and the bidirectional transmission scenario.

[0323] The third node can follow the following principles when allocating the reserved time slots and frequency bands:

[0324] 1) When each concurrent node subset performs the fluctuation transmission in the respective reserved working time slots and working frequency bands, the resource requirements of each service flow need to be met. If the requirements cannot be met, some resource requirements of the slave service flows can be discarded according to different processing methods.

[0325] 2) The final transmission resources of each node in a concurrent node subset: there is no limitation on whether the serial numbers of the reserved time slots are continuous; the reserved time slots and frequency bands of the 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 a specific node in a concurrent node subset are different from those of the remaining nodes in the subset.

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

[0327] 4) The final transmission resources of each node in the network wave 1 cannot have intersection with the transmission resources recorded in the reserved information table and the working information table of each node itself.

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

[0329] The following gives an algorithm example of a determined frequency band and only reserved time slots:

[0330] 1) The bandwidth required by the service flow is used to represent its demand for transmission resources, the bandwidth demand is converted into the demand for the number of transmission time slots, and the maximum value of the number of required time slots in all service flows is taken as the target time slot number.

[0331] 2) For the equal-interval concurrent node subset i (1≤i≤K), take the intersection S of the free time slots of all nodes in the subset, and the intersection G of the free time slots of the corresponding receiving nodes (i.e., the next hop nodes) of each node, and take the intersection of S and G as the final available free time slot set S i (1≤i≤K).

[0332] 3) According to the order of the serial numbers of the equal-interval concurrent node subsets from small to large, the free time slots in S iThe third node determines a time slot and ensures that the time slot numbers are different, as a reservation time slot. Repeat the process until the number of time slots meets the requirement of the number of time slots, if the available time slots are used up, the number of time slots cannot meet the requirement, and the third node can discard the slave service flow with the largest number of time slot requirements one by one under the premise of ensuring that the demand of the master service flow from the source node to the destination node is met first, until the reservation time slot can meet the demand of the remaining service flow.

[0333] When the third node completes the above content, the third node can determine a second frame according to the above content, and the second frame is used to reply to the first frame.

[0334] FIG. 10 is a schematic diagram of the second frame according to an embodiment of the present application. The second frame includes but is not limited to:

[0335] Frame type, receiving address, sending address, source node address, destination node address, path identifier, network wave sequence number, life cycle, multi-directional enablement, network wave reservation information, and node resource information.

[0336] As shown in (a) of FIG. 10, the node resource information can be represented as concurrent subset reservation information (which can include multiple concurrent subset reservation information, depending on the number of concurrent subsets that can be divided by the nodes in the transmission path corresponding to the network wave 1), and the concurrent subset reservation information includes a concurrent subset sequence number, a concurrent subset node number, a concurrent subset node address, and resource reservation information. Among them, the resource reservation information in the concurrent subset reservation information is applicable to all nodes in the concurrent subset corresponding to the concurrent subset sequence number in the concurrent subset reservation information, or in other words, the nodes in the concurrent subset can perform concurrent data transmission, that is, transmission on the same resource at the same time.

[0337] As shown in (b) of FIG. 10, the node resource information can be represented as node reservation information, and the node reservation information includes a node address and resource reservation information. Among them, the number of node reservation information depends on the number of nodes in the transmission path corresponding to the network wave 1.

[0338] Receiving address: The address of the next hop receiving node of the second frame. The third node queries the "previous hop node address" of the path indicated by the source node, the destination node, and the path identifier in the third path table according to the identification information of the network wave 1 to determine the receiving address, that is, the address of the second node.

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

[0340] The source node address, the destination node address, the path identifier, the network wave sequence number, the life cycle, and the multi-directional enabling field in the second frame correspond to the same source node address, the same destination node address, the same path identifier, the same network wave sequence number, the same life cycle, and the same multi-directional enabling field in the first frame, respectively.

[0341] The network wave reservation information (which is an optional field) has the same form as the "greedy reservation information" in the first frame. It should be noted that if the network wave reservation information is in the form of a bitmap, the node should convert it into a non-bitmap form when storing the relevant reservation information entry in the reservation information table according to the network wave reservation information.

[0342] Specifically, the resource indicated by the network wave reservation information in the second frame is the resource configured by the third node for the second node. The nodes receiving the second frame can update the reservation information entries in their respective reservation information tables according to the resource indicated by the network wave reservation information.

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

[0344] Optionally, the network wave reservation information described above can include an index corresponding to a concurrent subset in the concurrent subset reservation information, and the nodes receiving the second frame can query the resource information of the corresponding concurrent subset from the concurrent subset reservation information according to the index.

[0345] Optionally, the network wave reservation information described above can include an index corresponding to a node reservation information in the node reservation information, and the nodes receiving the second frame can query the resource information of the corresponding node reservation information from the node reservation information according to the index.

[0346] When the second frame is in the form of (a) in FIG. 10, the concurrent subset reservation information indicates the reservation information of all equal-interval concurrent subsets in the network wave 1 transmission, which is used by the nodes in the network wave 1 to query the reservation information of the corresponding concurrent subset. If the nodes in the transmission path corresponding to the network wave 1 are divided into K equal-interval concurrent subsets, for the equal-interval concurrent subset i (1≤i≤K), the concurrent subset sequence number is the sequence number i of the equal-interval concurrent subset; the concurrent subset node number is the number of nodes included in the subset i; the concurrent subset node address is the address of each node in the subset i; and the reservation information is the reservation information of the subset i in the network wave 1, which has the same form as the "network wave reservation information" field described above. It should be noted that when the second frame is in the form of (a) in FIG. 10, the reservation information of the nodes in each concurrent subset is consistent.

[0347] When the second frame adopts the form as shown in Fig. 10(b), the node reservation information is used to indicate the reservation information of each node in the transmission path of the network wave 1, which is composed of "node address" and "reservation information". The "reservation information" refers to the reservation information of the node corresponding to the "node address", and the representation method is the same as the aforementioned "network wave reservation information". When the second frame adopts the form as shown in Fig. 10(b), the reservation information of the nodes within each concurrent node subset can be inconsistent, that is, the reservation period and frequency band of a specific node within a concurrent node subset are different from those of the remaining nodes in the subset, and the reservation information of each node needs to be stored separately using the form as shown in Fig. 10(b).

[0348] When the third node determines the resource of each node, the third node updates the third reservation information table, which can be referred to the foregoing. When the second frame adopts the form as shown in Fig. 10(a), the third node unifies the reservation information of all concurrent node subsets as a "total reservation information", and fills the "reservation receiving node address" with the address of the third node. When the second frame adopts the form as shown in Fig. 10(b), the third node unifies the reservation information of all nodes as a "total reservation information", and fills the "reservation receiving node address" with the address of the third node.

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

[0350] The third node updates the state information of the network wave 1 in the third network wave state table according to the second frame, which can be referred to the foregoing description.

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

[0352] The third node broadcasts the second frame, and a plurality of nodes receive the second frame, the plurality of nodes including the first node, the second node and the fourth node.

[0353] When any node receives the second frame, the node can determine the node type of the node according to the content in the second frame. For example, if the node address is the same as the "receiving address" of the second frame and the same as the "source node address" of the second frame, the node is the next hop and the source node. If the node address is the same as the "receiving address" of the second frame and different from the "source node address" of the second frame, the node queries whether the "source node", "destination node" and "path identifier" information are stored according to the stored path table, and if the corresponding information is stored, the node is a non-next-hop and in-path node. The node not belonging to the above three types is a non-next-hop and out-of-path node.

[0354] Different nodes have different processing manners for the received second frame. The first node does not process the second frame, the second node has a different processing manner for the second frame than the fourth node has for the second frame.

[0355] The processing manner of the fourth node for the second frame is described below.

[0356] When the fourth node receives the second frame, the fourth node processes as follows:

[0357] (I) According to the identification information of network wave 1 in the second frame, the fourth node looks up the reservation information entry of network wave 1 in the fourth reservation information table, further looks up the reservation information with the address of the third node as the “reservation receiving node address” in the reservation information entry, deletes the “resource reservation information” in the found reservation information entry, and fills in the network wave reservation information of the received second frame, the resource indicated by the network wave reservation information being the resource used by the second node.

[0358] (II) According to the identification information of network wave 1 in the second frame, the fourth node queries the corresponding greedy reservation indication information in the fourth greedy reservation table, and if the greedy reservation indication information of network wave 1 is found, deletes it. If the greedy reservation indication information of network wave 1 is not found, no operation is performed.

[0359] (III) The fourth node checks whether there is other greedy reservation indication information in the fourth greedy reservation table. If there is no other greedy reservation indication information in the fourth greedy reservation table, the fourth node checks whether there is a frame for performing greedy reservation, such as the first frame or the second frame. If there is, the fourth node can perform the processing behavior of the second node for the first frame or the processing behavior of the third node for the fourth frame. If there is no, no operation is performed. If there is other greedy reservation indication information in the fourth greedy reservation table, no operation is performed.

[0360] In one possible implementation, the fourth node can fill the resource information in the concurrent subset reservation information or the node reservation information in the second frame into the fourth reservation information table. Correspondingly, the second frame can not include the network wave reservation information, which can reduce the signaling overhead of the second frame.

[0361] S707, the second node determines a fifth frame according to the second frame.

[0362] When the second node receives the second frame, the second node performs grouping processing on the second frame to obtain the fifth frame. The grouping processing can be that the second node fills the resource information of the first node in the second frame into the network wave reservation information in the second frame.

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

[0364] For example, when the second frame is in the form of (b) of Fig. 10, the second node fills the node reservation information of the first node into the network wave reservation information.

[0365] The second node can also query the state information of the network wave 1 in the second network wave state table according to the identification information of the network wave 1 in the second frame, and if the state information of the network wave 1 is found, change the "request state" to "has been established", and fill the "lifetime" of the fifth frame into the "state parameter". If the state record of the network wave 1 is not found, the second node creates a state information entry of the network wave 1 in the network wave state table of the second node according to the identification information of the network wave 1, and fills "has been established" into the "request state" in the newly created network wave state information, and fills the "lifetime" of the second frame into the "state parameter".

[0366] The second node can also update the second working information table and the second reservation information table according to the second frame (or the fifth frame).

[0367] When the form of the second frame is (a) of Fig. 10:

[0368] The second node adds a new working information entry in the second working information table, and fills in the "source node", "destination node", "path identification" and "network wave sequence number"; the "receiving node" is the "next hop node address" of the transmission path of the network wave 1 in the second path table; the "indication information" is the final transmission resource reservation information of the equal-interval concurrent subset to which the second node belongs in the "concurrent subset reservation information" field in the second frame.

[0369] The second node adds a new reservation information entry in the second reservation information table, and fills in the "source node", "destination node", "path identification" and "network wave sequence number"; the reservation information of the remaining equal-interval concurrent node subsets except the equal-interval concurrent node subset to which the second node belongs is uniformly regarded as a "total reservation information". The "reservation receiving node address" of the newly added reservation information entry is filled with the address of the second node.

[0370] When the form of the second frame is (b) of Fig. 10:

[0371] The second node adds a new working information entry in the second working 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.

[0372] The second node adds a new reservation information entry in the second reservation information table, and fills in "source node", "destination node", "path identifier" and "network wave sequence number"; the reservation information of the remaining subset except the second node is uniformly taken as a "sum reservation information". The "reservation receiving node address" of the new reservation information entry is filled with the second node address.

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

[0374] When the first node receives the fifth frame, the first node processes the fifth frame, for example, the first node updates the corresponding network wave state information in the first network wave state 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, and the specific process can be referred to the above, and will not be repeated.

[0375] In this way, this can support the completion of the framing and forwarding processing of the second frame, and can further support that the nodes not belonging to the transmission path corresponding to the network wave can not select to occupy the use resource of each node on the transmission path according to the fourth frame, so as to reduce the probability of resource conflict, and further to guarantee the service quality of the communication service.

[0376] When the first node completes the framing processing of the fifth frame, the first node broadcasts the processed fifth frame, which can be referred to the description of the third node broadcasting the processed fourth frame in the foregoing, and will not be repeated.

[0377] In the above scheme, the first node carries the identification information of the network wave, the reservation resource information of the first node, the address of the second node and the address of the first node in the first frame, and receives the second frame used for replying the first frame, the second frame including the identification information of the network wave and the usage resource information of each node on the transmission path corresponding to the network wave. In this way, the uncertainty of the utilization of the communication resource can be reduced, so as to guarantee the service quality of the communication service. For example, the third node or the control node can configure the corresponding usage resource for the first node according to the reservation resource information of the first node, and other nodes (not belonging to the nodes on the transmission path corresponding to the network wave) can determine the usage resource of the first node through the second frame, and will not select to occupy the usage resource of the first node, so as to reduce the probability of resource conflict, and further guarantee the service quality of the communication service. In addition, after receiving the first frame, the second node determines that the second node is the next hop node of the first node according to the address of the second node in the first frame, and performs framing processing on the first frame, that is, carries the reservation resource information of the second node and the address of the third node in the first frame, so as to obtain the fourth frame, and sends the fourth frame. In this way, the uncertainty of the utilization of the communication resource can be reduced, so as to guarantee the service quality of the communication service. For example, the third node or the control node can configure the corresponding usage resource for the second node according to the reservation resource information of the second node and the reservation resource information of the first node, and other nodes will not occupy the usage resource of the first node, so as to reduce the probability of resource conflict, and further guarantee the service quality of the communication service.

[0378] Meanwhile, after receiving the fourth frame, the third node determines that the third node is the next hop node of the second node and is the destination node according to the address of the third node in the fourth frame, and obtains and sends the second frame according to the fourth frame. In this way, the uncertainty of the utilization of the communication resource can be reduced, so as to guarantee the service quality of the communication service. For example, other nodes can not occupy the usage resource of each node on the transmission path corresponding to the network wave 1 through the second frame, so as to reduce the probability of resource conflict, and further guarantee the service quality of the communication service.

[0379] Specifically, each node on the transmission path corresponding to the network wave 1 can determine the final usage resource according to the second frame, and can perform the transmission of the service through the corresponding communication resource. Some nodes on the transmission path corresponding to the network wave 1 can perform concurrent transmission, and some nodes can not perform concurrent transmission, which is not limited.

[0380] In one possible implementation, the method can further include:

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

[0382] When the first node no longer uses the network wave 1 to transmit service, the first node looks up the network wave state information of the network wave 1 in the first network wave state table according to the source node address, the destination node address, the path identifier and the network wave sequence number of the network wave 1, and if the network wave state information does not exist, no operation is performed; if the network wave state information exists, a third frame is generated and sent.

[0383] The description of the third frame can refer to FIG. 11.

[0384] FIG. 11 is a schematic diagram of the third frame according to an embodiment of the present application. As shown in FIG. 11, the third frame includes but is not limited to:

[0385] The frame type, the receiving address, the sending address, the source node address, the destination node address, the path identifier and the network wave sequence number.

[0386] The description of the above fields can refer to the foregoing description and will not be repeated here.

[0387] The first node can delete the state information of the network wave 1 in the first network wave state table, delete the working information entry corresponding to the network wave 1 in the first working information table, and delete the working information entry corresponding to the network wave 1 in the first reservation information.

[0388] It can be understood that the first node broadcasts and sends the third frame, and a plurality of nodes receive the third frame, the plurality of nodes including the second node, the third node and the fourth node.

[0389] When any node receives the third frame, the node judges the node type according to the content in the third frame. For example, if the node address is the same as the receiving address of the third frame and is the same as the destination node address of the third frame, the node is the next hop and the destination node. If the node address is the same as the receiving address of the third frame and is different from the destination node address of the third frame, the node is the next hop and the non-destination node. If the node address is different from the receiving address of the third frame, the node queries whether the source node, the destination node and the path identifier information are stored according to the stored path table, and if the corresponding information is stored, the node is the non-next hop and the in-path node. The node not belonging to the above three types is the non-next hop and the out-of-path node.

[0390] The processing manner of the third frame received by different nodes is different. The third node does not process the first frame, the processing manner of the third frame by the second node is different from the processing manner of the third frame by the fourth node.

[0391] The processing manner of the third frame by the fourth node is described below.

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

[0393] S710, the second node determines a sixth frame according to the third frame.

[0394] When the second node receives the third frame, the second node performs framing processing on the third frame to obtain the sixth frame. The framing processing can be understood as that the second node modifies the receiving address in the third frame and fills in the address of the third node to obtain the sixth frame.

[0395] According to the identification information of network wave 1 in the third frame, the second node deletes the state information of network wave 1 in the second network wave state table, deletes the working information entry corresponding to network wave 1 in the second working information table, and deletes the reservation information entry corresponding to network wave 1 in the second reservation information table.

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

[0397] After receiving the sixth frame, the third node deletes the state information of network wave 1 in the third network wave state table, deletes the working information entry corresponding to network wave 1 in the third working information table, and deletes the reservation information entry corresponding to network wave 1 in the third reservation information table according to the identification information of network wave 1 in the sixth frame. Then, the third node can fill in the broadcast address or the address of the third node in the receiving address field in the sixth frame and forwards the sixth frame.

[0398] Through the above S709 to S711, the embodiment of the application can complete the network wave removal process.

[0399] The above description of the second frame and the third frame is described by taking the propagation in a hop-by-hop manner as an example, but the second frame and the third frame are not limited to being sent according to the broadcast manner, that is, the node receiving the second frame and the third frame can update and delete the working information table, the reservation information table, the network wave state table, and the greedy reservation information table according to the content included in the second frame and the third frame, and does not need to perform framing and forwarding processing on the second frame and the third frame by the node receiving the second frame and the third frame. In this way, this can reduce the processing power consumption and signaling interaction overhead of the node.

[0400] In the bidirectional transmission scenario, the first node, the second node or the third node can have an upper hop node and a lower hop node. Therefore, when the first node, the second node or the third node processes the received second frame, the first node, the second node or the third node can query the upper hop node address and the lower hop node address according to the respective path table, and fill the final transmission resource reservation information of the equal-interval concurrent subset to which the upper hop node belongs (or the node reservation information of the upper hop node) and the final transmission resource reservation information of the equal-interval concurrent subset to which the lower hop node belongs (or the node reservation information of the lower hop node) into the network wave reservation information in the second frame, and forward the second frame. For details, refer to the foregoing description, which will not be described herein again.

[0401] In one possible implementation, the first frame and the fourth frame (or the second frame) can each include a working period parameter of the network wave. For example, the first frame includes a seventh field, and the seventh field indicates the working period parameter of the network wave. For example, the fourth frame (or the second frame) includes a ninth field, and the ninth field indicates the working period parameter of the network wave.

[0402] For example, the working period parameter of the network wave includes at least one of a network wave state, a network wave start position, a duration, a period or a number of repeated works.

[0403] The network wave state indicates a use state of the network wave 1 related reservation information. When the network wave 1 is in a periodic working state, the field is in an “active” state; when the network wave 1 is in a periodic inactivation state, the field is in a “sleep” state.

[0404] The network wave start position indicates a superframe start time at which the network wave 1 works for the first time. According to different scenarios, the field has the following several representation manners:

[0405] ◆Indicates a superframe number of a superframe in which the network wave 1 works for the first time. In this manner, all nodes in the network need to maintain the same superframe sequence number and perform synchronous counting.

[0406] ◆Indicates a superframe interval number between a superframe in which the network wave 1 works for the first time and a current superframe.

[0407] ◆Indicates a time slot interval number between a time slot at which the network wave 1 works for the first time and a time slot at which a current superframe starts.

[0408] ◆Indicates a time difference between a start time of a superframe in which the network wave 1 works for the first time and a start time of a current superframe.

[0409] The duration indicates a duration length of running of the network wave 1, for example, 5 superframes.

[0410] Period: The time interval from the start of the network wave 1 to the next restart, for example, an interval of 7 superframes.

[0411] Repeat times: used to indicate the number of times the network wave 1 repeats according to the period.

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

[0413] Specifically, the node can calculate the working time period and the pause time period of the network wave 1 according to the first superframe information in the working time period of the network wave 1 and in combination with the working period parameter. In the working time period, the node sets the related reservation information state in the reservation information table and the working information table to “active” to make it work, and the working information entry instructs the node to transmit data using the communication resources recorded in the working information entry. The reservation information entry in the reservation information table instructs the node not to work in the communication resources recorded therein. When the network wave 1 is temporarily disabled, the reservation information state related to the network wave 1 in the reservation information table and the working information table is changed to “sleep” to temporarily not work and not affect other transmissions of the node in the related communication resources. At the same time, the node calculates the network wave start position of the next network wave 1 using the network wave 1 in combination with the working period parameter, and updates the “network wave start position” of the network wave 1 related entry in the reservation information table and the working information table.

[0414] The working information table, the reservation information table, and the reserved information described above can all include the working period parameter of the network wave described above.

[0415] For the periodic transmission scenario, the third node can determine the communication resources of each concurrent node subset corresponding to the network wave 1 according to the concurrent node subset of the transmission path corresponding to the network wave 1, the resource requirements of each service flow, and the reserved information of each node, and the working period parameter of the network wave 1. The reservation working time slot and the period working parameter can be stored in the working information table of the node in the corresponding concurrent node subset, and the reservation working time slot and the working frequency band are used together to indicate the periodic fluctuation transmission of the node. The allocation principle of the communication resources is the same as that in the unidirectional transmission scenario.

[0416] Exemplarily:

[0417] The resource requirement is expressed in the number of time slots required by the service flow, and the maximum value of the number of time slots required by all service flows is taken as the target time slot number.

[0418] According to the target time slot number requirement, the reserved time slot of the network wave 1 can be selected from two types of time slots: the first type is the time slot not recorded in the reservation information of each node (referred to as an idle time slot), and the second type is the time slot recorded in the reservation information and having a periodic working parameter.

[0419] When the reserved time slot is selected from the first type of idle time slot, since the idle time slot does not have a periodic working parameter, the selection can be directly performed.

[0420] When the reserved time slot is selected from the second type of time slot, it should be ensured that the periodic working parameter of the reserved time slot finally selected by the network wave 1 cannot conflict with the second type of time slot (i.e., simultaneously in an "active" state), causing the network wave 1 to be established to conflict with the already established network wave.

[0421] The reserved time slot selected from the first type or the second type of time slot should have the same periodic working parameter.

[0422] The embodiments of the present application do not make specific limitations on the method of coordinating the periodic working parameters of the network wave 1 and the already established network wave.

[0423] When the method shown in FIG. 7 is applied to the architecture in which the control node exists, the control node can determine the second frame. For example, the third frame is transmitted to the control node (which can be directly transmitted or transmitted through the proxy node) through the architecture shown in FIG. 2, the control node determines the second frame according to the contents shown in Tables 1 to 6, and can transmit the second frame to each node on the transmission path corresponding to the network wave 1 (which can be directly transmitted or transmitted through the proxy node), or can transmit the second frame through the hop-by-hop manner, for example, the control node transmits the second frame to the third node (which can be directly transmitted or transmitted through the proxy node), the third node transmits the second frame to the second node according to the foregoing manner, and the second node transmits the second frame to the first node, and the like, which are not limited.

[0424] When the method shown in FIG. 7 is applied to the architecture in which the control node exists, the first node and the control node can interact the third frame, and the specific manner is not limited, for example, the first node directly transmits the third frame to the control node, and the control node forwards the third frame to other nodes, and the like, which are not limited.

[0425] When the method shown in FIG. 7 is applied to the architecture in which the control node exists, the source node resource request information in the first frame includes the source node address and the resource demand information, and does not include the neighbor node list of the source node and the like.

[0426] The beneficial effects brought by the application of the method shown in FIG. 7 are further described below. Please refer to FIG. 12.

[0427] Figure 12 is a schematic diagram of simulation results of embodiments of the present application. In the figure, network wave refers to the method of embodiments of the present application, and CSMA protocol refers to the method of each node channel access and transmission using CSMA. The examples are as follows:

[0428] As shown in (a) of Figure 12, taking the existence of a transmission path in a multi-hop network as an example, when the transmission path includes different numbers of nodes, it can correspond to different end-to-end throughputs respectively. Specifically, when the service rate reaches 7 Mbps, the average throughput of the CSMA protocol reaches saturation and presents 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 sparse, so various protocols can basically serve. When the service rate is greater than 7 Mbps, by improving the order of end-to-end multi-hop transmission, the conflict between nodes is avoided, and the performance (referring to throughput) of the network wave is better than that of the CSMA protocol. In this way, this can support the quality of service of the communication service.

[0429] As shown in (b) of Figure 12, taking the existence of a transmission path in a multi-hop network as an example, when the transmission path includes different numbers of nodes, it can correspond to different end-to-end delays respectively. Specifically, as the number of nodes contained in the transmission path increases, the conflict of the intermediate nodes intensifies, and the average delay of the CSMA protocol increases obviously. Among them, after using the network wave, the number of time slots required for completing one end-to-end transmission of a data packet is fixed, so the end-to-end average delay does not change with the increase of the service rate, and under the same number of hops, the end-to-end average delay of the network wave is lower than that of the CSMA protocol. In this way, this can support the quality of service of the communication service.

[0430] As shown in (c) of FIG. 12, taking an example of a transmission path existing in a multi-hop network, when the transmission path includes different numbers of nodes, it can correspond to different end-to-end cumulative distribution functions (CDFs) respectively. From left to right, the first solid curve represents a 3-hop path-CSMA, the second solid curve represents a 6-hop path-CSMA, the third solid curve represents a 9-hop path-CSMA, the fourth solid curve represents a 27-hop path-CSMA, the first piecewise curve represents a 3-hop path-network wave, the second piecewise curve represents a 6-hop path-network wave, the third piecewise curve represents a 9-hop path-network wave, and the fourth piecewise curve represents 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 smaller than that of the CSMA protocol. In this way, this can support guaranteeing the service quality of the communication service.

[0431] In summary, through the method described in FIG. 7, the embodiments of the present application can support guaranteeing the service quality of the communication service.

[0432] To implement the functions in the method provided in the present application, the first node, the second node, the third node, or the fourth node can include a hardware structure and / or a software module to implement the above functions in the form of hardware structure, software module, or hardware structure plus software module. Whether a certain function in the above functions is implemented in the form of hardware structure, software module, or hardware structure plus software module depends on the specific application and design constraints of the technical solution.

[0433] FIG. 13 is a schematic block diagram of a communication device according to an embodiment of the present application. The communication device includes processing circuitry 1310 and transceiver circuitry 1320, which can be connected or coupled to each other, such as through a bus 1330. The communication device can be the first node, the second node, the third node, or the fourth node, etc.

[0434] Optionally, the communication device can further include a memory 1340. The memory 1340 includes, but is not limited to, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read only memory (EPROM), or a 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 and that can be accessed by a computer, but is not limited thereto. The memory in the embodiments of the present application can also be a circuit or any other device capable of realizing a storage function, used for storing computer programs or instructions, and / or data.

[0435] The processing circuit 1310 can be all or part of one or more processors, or be one or more processors. The processor can be a central processing unit (CPU). In the case of the processing circuit 1310 being a CPU, the CPU can be a single core CPU, or a multi-core CPU. The processing circuit 1310 can be a signal processor, a chip, or other integrated circuit capable of implementing the methods of the present application, or a part of the foregoing processor, chip, or integrated circuit for processing functions. In addition, the transceiver circuit 1320 can also be a transceiver, or an input / output interface, an input / output interface for input or output of signals or data, and can also be referred to as an input / output circuit.

[0436] When the communication device is the first node, the second node, the third node, or the fourth node, the processing circuit 1310 is configured to perform the following operations, for example: receiving the first information; detecting the first network problem by running the automated function example 1, determining the repair method of the first network problem according to the repair strategy, etc.

[0437] When the communication device is the first node, the processing circuit 1310 is configured to perform the following operations, for example: determining the first frame; transmitting the first frame, etc.

[0438] When the communication device is the second node, the processing circuit 1310 is configured to perform the following operations, for example: receiving the first frame; determining the fourth frame according to the first frame; transmitting the fourth frame, etc.

[0439] When the communication device is the third node, the processing circuit 1310 is configured to perform the following operations, for example: receiving the fourth frame; determining the second frame, etc.

[0440] When the communication apparatus is the fourth node, the processing circuit 1310 is configured to perform the following operations: receiving the fourth frame; determining that the fourth node does not belong to the nodes on the transmission path corresponding to the network wave; and establishing reservation information according to the identification information of the network wave, the reservation information being used to instruct the nodes on the transmission path corresponding to the network wave to reserve the communication resource, etc.

[0441] When the communication apparatus in FIG. 13 is the first node, the second node, the third node, or the fourth node, the transceiver circuit 1320 can be a transceiver.

[0442] When the communication apparatus in FIG. 13 is a chip for the first node, the second node, the third node, or the fourth node, the transceiver circuit 1320 can be an input / output circuit.

[0443] The above description is only an exemplary description. The specific content can be referred to the content shown in the method embodiments described above.

[0444] The implementation of each operation in FIG. 13 can also correspond to the description of the corresponding method embodiments shown in FIG. 7.

[0445] FIG. 14 is a schematic block diagram of another communication apparatus according to an embodiment of the present application. The communication apparatus can be the first node, the second node, the third node, or the fourth node.

[0446] The communication apparatus includes a transceiving unit 1410 and a processing unit 1420. The transceiving unit 1410 can include a sending unit and a receiving unit. The sending unit is configured to perform the sending action of the communication apparatus, and the receiving unit is configured to perform the receiving action of the communication apparatus. For ease of description, the sending unit and the receiving unit are combined into one transceiving unit in the embodiments of the present application. This is uniformly described here, and will not be described again hereinafter.

[0447] When the communication apparatus is the first node, the transceiving unit 1410 is configured to send the first frame and receive the second frame; and the processing unit 1420 is configured to determine the first frame, etc.

[0448] When the communication apparatus is the second node, the transceiving unit 1410 is configured to receive the first frame and send the fourth frame; and the processing unit 1420 is configured to determine the fourth frame according to the first frame, etc.

[0449] When the communication apparatus is the third node, the transceiving unit 1410 is configured to receive the fourth frame; and the processing unit 1420 is configured to determine the second frame according to the fourth frame, etc.

[0450] When the communication apparatus is the fourth node, the transceiver 1410 is configured to: receive the fourth frame; and the processing unit 1420 is configured to, when determining that the fourth node does not belong to the node on 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 the communication resource, etc.

[0451] When the communication apparatus shown in FIG. 14 is the first node, the second node, the third node, or the fourth node, it will be responsible for performing 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 foregoing method embodiments.

[0452] Optionally, the communication apparatus shown in FIG. 14 further includes a storage unit 1430 configured to store programs or codes used to execute the foregoing methods.

[0453] The transceiver in FIG. 14 can correspond to the transceiver circuit in FIG. 13, and the processing unit in FIG. 14 can correspond to the processing circuit in FIG. 13.

[0454] The apparatus embodiments shown in FIGS. 13 and 14 are used to implement the content described in FIG. 7. The specific execution steps of the apparatus shown in FIGS. 13 and 14 and the method can refer to the content described in the foregoing method embodiments.

[0455] The present application also provides a chip including a processor, which is configured to invoke and run instructions stored in a memory, so that a communication device installed with the chip executes the method in any of the examples described above. The memory can be integrated into the chip, or located outside the chip.

[0456] The present application also provides another chip including: an input interface, an output interface, and a processing circuit, the input interface, the output interface, and the processing circuit being connected through internal connection paths, and the processing circuit being configured to execute codes in a memory, and when the codes are executed, the processing circuit is configured to execute the method in any of the examples described above.

[0457] Optionally, the chip further includes a memory configured to store computer programs or codes. The input interface and the output interface can be independent of each other, or can be integrated into an input / output interface.

[0458] The processing circuit can be all or part of one or more processors, or one or more processors.

[0459] The present application also provides a communication apparatus including a processor coupled with a memory, and the processor is configured to execute computer programs stored in the memory to implement the method and functions related to the first network element or the second network element in any of the method embodiments described above.

[0460] In another embodiment of the present application, a computer program product containing instructions which, when the computer program product is executed by a computer, implements the method of the preceding embodiments is provided.

[0461] The present application also provides a computer program which, when executed by a computer, implements the method of the preceding embodiments.

[0462] In another embodiment of the present application, a computer-readable storage medium is provided, which stores a computer program that, when executed by a computer, implements the method of the preceding embodiments.

[0463] It should be understood that, in the embodiments of the present application, the processor can be a central processing unit (CPU), and the processor 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 gates or transistor logic, discrete hardware components, etc. The general-purpose processor can be a microprocessor or the processor can also be any conventional processor.

[0464] In addition, the processor can include one or a combination of 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 network processor (Neural Processing Unit, NPU).

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

[0466] The above-described embodiments can be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented by software, the above-described embodiments can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions or computer programs. When the computer instructions or computer programs are loaded or executed on a computer, the processes or functions described in the embodiments of the present application are wholly or partially generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable apparatus. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another computer-readable storage medium, for example, the computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center through a wired or wireless (such as infrared, wireless, microwave, etc.) manner. The computer-readable storage medium can be any available medium accessible by a computer or a data storage device such as a server, data center, etc. containing one or more available medium sets. The available medium can be a magnetic medium (such as a floppy disk, a hard disk, a magnetic tape), an optical medium (such as a DVD), or a semiconductor medium. The semiconductor medium can be a solid-state disk.

[0467] It should be understood that the size of the sequence number of each process described above in various embodiments of the present application does not mean the order of execution, and the execution order of each process should be determined by its function and inherent logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.

[0468] Those skilled in the art can appreciate that the units and algorithm steps of the examples described in combination with the embodiments disclosed herein can be realized by electronic hardware or a combination of computer software and electronic hardware. Whether the functions are realized in hardware or software depends on the specific application and design constraints of the technical solutions. Those skilled in the art can use different methods to realize the described functions for each specific application, but such implementation should not be considered beyond the scope of the present application. Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the above-described system, device and unit can refer to the corresponding processes in the foregoing method embodiments, which will not be described here. In several embodiments provided in the present application, it should be understood that the disclosed system, device and method can be implemented in other ways. For example, the above-described device embodiments are only schematic, for example, the division of units is only a logical function division, and actual implementation can have another division manner, for example, a plurality of units or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the coupling or direct coupling or communication connection between the units shown or discussed can be indirect coupling or communication connection through some interface, device or unit, and can be electrical, mechanical or other forms.

[0469] The units described as separate components can or can not be physically separate, and the components shown as units can or can not be physical units, i.e. can be located in one place or can be distributed to multiple network units. Some or all of the units can be selected to achieve the purpose of the embodiment according to actual needs. In addition, the functional units in each embodiment of the present application can be integrated in one processing unit, or each unit can be physically present alone, or two or more units can be integrated in one unit. When the above functions are realized in the form of software function units and sold or used as independent products, they can be stored in a computer readable storage medium. Based on this understanding, the technical solutions of the present application essentially or the parts that make contributions to the prior art or parts of the technical solutions can be embodied in the form of software products, which are stored in a storage medium and include a number of instructions to make a computer device (which can be a personal computer, a server, or a network device, etc.) execute all or part of the steps of the methods described in each embodiment of the present application. The foregoing storage medium includes: U disk, mobile hard disk, read-only memory, random access memory, magnetic disk or optical disk, and various program code storage media.

[0470] Those skilled in the art can realize that the units and algorithm steps of each example described in combination with the embodiments disclosed herein can be realized in electronic hardware, or a combination of computer software and electronic hardware. Whether the functions are realized in hardware or software depends on specific applications and design constraints of the technical solutions. Those skilled in the art can use different methods to realize the described functions for each specific application, but such implementation should not be considered beyond the scope of the present application.

Claims

1. A communication method characterized by comprising: The application is applied to a first node, comprising: sending a first frame, the first frame being used for requesting to establish a network wave, the first frame comprising identification information of the network wave, reservation resource information of the first node, an address of the first node and an address of a second node, the second node and the first node being nodes in a transmission path corresponding to the network wave, the second node being a next-hop node of the first node; receiving a second frame, the second frame being used for responding to the first frame, the second frame comprising the identification information of the network wave and usage resource information of each node in the transmission path.

2. The method of claim 1, wherein, The first frame comprises a first field, a second field, a third field and a fourth field, the first field indicating the identification information of the network wave, the second field indicating the reservation resource information of the first node, the third field indicating the address of the first node, and the fourth field indicating the address of the second node.

3. The method of claim 2, wherein, The identification information of the network wave comprises an address of a source node of the network wave, an address of a destination node of the network wave, a path identifier of the transmission path and a sequence number of the network wave.

4. The method according to claim 2 or 3, characterized in that, The first frame further comprises a fifth field, the fifth field indicating resource parameters of the first node, the resource parameters of the first node comprising: the address of the first node, unavailable resource information of the first node, a neighbor node list of the first node and 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 further comprises a sixth field, the sixth field indicating whether a transmission direction of a main service flow of the network wave and a transmission direction of at least one slave 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 further comprises a seventh field, the seventh field indicating a duty cycle parameter of the network wave.

7. The method of claim 6, wherein, The second frame further comprises the duty cycle parameter of the network wave.

8. The method according to claim 6 or 7, characterized in that, The duty cycle parameter of the network wave comprises at least one of: a network wave state, a network wave starting position, a duration, a period or a number of repeated duties.

9. The method according to any one of claims 1 to 8, characterized in that, The method further comprises: sending a third frame, the third frame being used for requesting to remove the network wave, the third frame comprising 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 by comprising: The application is applied to a second node, comprising: receiving a first frame, the first frame being used for requesting to establish a network wave, the first frame comprising identification information of the network wave, reservation resource information of a first node, an address of the first node and an address of the second node, the first node being a node sending the first frame, the second node and a third node being nodes in a transmission path corresponding to the network wave, the second node being a next-hop node of the first node; sending a fourth frame, the fourth frame comprising 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 an address of a third node, the third node being a next-hop node of the second node, the fourth frame being obtained after processing the first frame.

11. The method of claim 10, wherein, The fourth frame comprises a first field, a second field, a third field, a fourth field and a fifth field, the first field indicates identification information of the network wave, the second field indicates reservation resource information of the first node, the third field indicates an address of the first node, the fourth field indicates an address of the third node, and the fifth field indicates reservation resource information of the second node.

12. The method of claim 11, wherein, The identification information of the network wave comprises an address of a source node of the network wave, an address of a destination node of the network wave, a path identifier of the transmission path, and a sequence number of the network wave.

13. The method according to claim 11 or 12, characterized in that, The fourth frame further comprises a sixth field and a seventh field, the sixth field indicates resource parameters of the first node, and the seventh field indicates resource parameters of the second node. The resource parameters of the first node comprise: an address of the first node, unavailable resource information of the first node, a neighbor node list of the first node, and resource requirement information of the first node; The resource parameters of the second node comprise: an address of the second node, unavailable resource information of the second node, a neighbor node list of the second node, and 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 further comprises an eighth field, the eighth field indicates whether a transmission direction of a primary service flow of the network wave and a 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 further comprises a ninth field, the ninth field indicates a duty cycle parameter of the network wave.

16. The method of claim 15, wherein, The duty cycle parameter of the network wave comprises at least one of: a network wave state, a network wave start position, a duration, a period, or a number of repeated duties.

17. The method according to any one of claims 11 to 16, characterized in that, The method further comprises: receiving a second frame, the second frame is used to reply to the first frame, and the second frame comprises identification information of the network wave and used resource information of each node in the transmission path; sending a fifth frame, the fifth frame is used to reply to the first frame, the fifth frame is obtained by processing the second frame, and the fifth frame comprises identification information of the network wave and used resource information of each node in the transmission path.

18. The method of claim 17, wherein, The method further comprises: receiving a third frame, the third frame is used to request to dismantle the network wave, and the third frame comprises identification information of the network wave, an address of the second node, and an address of the first node; sending a sixth frame, the sixth frame comprises identification information of the network wave, an address of the second node, and an address of the third node, and the sixth frame is obtained by processing the third frame.

19. A method of communication, comprising: Applied to a third node, comprising: receiving a fourth frame, the fourth frame is used to request to establish a network wave, the fourth frame comprises identification information of the network wave, reservation resource information of each node on a transmission path corresponding to the network wave, an address of a second node, and an address of the third node, the third node is a next hop node of the second node, and the third node is a destination node of the network wave; According to the fourth frame, a second frame is sent, the second frame being used to reply to the fourth frame, the second frame comprising identification information of the network wave and used resources of each node on the transmission path.

20. The method of claim 19, wherein, The sending of the second frame according to the fourth frame comprises: sending the fourth frame to a control node; receiving the second frame from the control node, the control node being used to determine the reserved resources of each node on the transmission path; sending the second frame.

21. A communications device, characterized by The communication device comprises units for performing the method according to any one of claims 1 to 20.

22. A communications device, characterized by The communication device comprises a processor for executing computer instructions stored in a memory to cause the communication device to perform the method according to any one of claims 1 to 20.

23. The communication apparatus according to claim 22, wherein, The communication device further comprises the memory.

24. The communication apparatus according to claim 22 or 23, wherein, The communication device further comprises a communication interface coupled with the processor, the communication interface being used to input and / or output information.

25. A computer-readable storage medium, characterized in that, A computer program is stored, the computer program comprising instructions for implementing the method according to any one of claims 1 to 20.

Images