Center-free Mesh networking method, communication node and storage medium

Abstract

The invention belongs to the field of communication, and particularly relates to a centerless Mesh networking method, a communication node and a storage medium, and in the method, the communication node can join a corresponding network topology by sending a request of joining the network topology to any node of the network topology. When information needs to be transmitted to other nodes, the optimal transmission path can be automatically searched and determined for information transmission; in the application, the communication node can realize various node functions without being controlled by any central node, so that the excessive dependence of the communication node on a certain node is avoided, and the problem that each node in the network topology cannot work normally due to the fault of the certain node can be further avoided.

Description

Technical Field

[0001] The present application relates to the field of communications, and in particular to a decentralized Mesh networking method, communication nodes, and storage media. Background Art

[0002] Mesh networking technology is a wireless network system that connects multiple nodes to form a mesh network structure (i.e., network topology) to improve network coverage and transmission efficiency.

[0003] There is often a central node in the existing network topology. Other nodes in the network topology need to be connected to the central node, and information propagation between other nodes also needs to be managed by the central node. In addition, new nodes need to be authorized by the central node to join the network topology. That is, the entire network topology is too dependent on the central node. Once the central node fails, it will be difficult for the nodes in the entire network topology to communicate normally. Summary of the invention

[0004] In view of this, an embodiment of the present application provides a decentralized Mesh networking method, communication nodes and storage medium, which can solve the above technical problems.

[0005] A first aspect of an embodiment of the present application provides a decentralized Mesh networking method, which is applied to a communication node. The decentralized Mesh networking method includes:

[0006] S1: When the communication node is started, it sends a joining request to other nodes to apply to join the network topology where other nodes are located;

[0007] S2: After receiving the response information from the response node, join the network topology where the response node is located;

[0008] S3: when receiving a task instruction to transmit information to a target node in the added network topology, determining whether the communication node is directly connected to the target node, and if so, directly transmitting information to the target node;

[0009] S4: If not, identify each transmission path leading to the target node;

[0010] S5: Determine a most efficient transmission path from each identified transmission path;

[0011] S6: Transmit information to the target node via the most efficient transmission path.

[0012] A second aspect of an embodiment of the present application provides a communication node, including a memory and a processor, wherein the memory stores a computer program, and when the computer program is executed by the processor, the processor executes the steps of the decentralized Mesh networking method.

[0013] A third aspect of an embodiment of the present application provides a terminal-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, the processor executes the steps of the decentralized Mesh networking method.

[0014] Compared with the prior art, the embodiments of the present application have the following beneficial effects: the method provided by the present invention includes, when a communication node is started, sending a joining request to other nodes to apply to join the network topology where the other nodes are located; after receiving the response information of the responding node, joining the network topology where the responding node is located; when receiving a task instruction to transmit information to a target node in the joined network topology, determining whether the communication node is directly connected to the target node, and if so, directly transmitting information to the target node; if not, identifying each transmission path leading to the target node; determining the most efficient transmission path from each identified transmission path; transmitting information to the target node via the most efficient transmission path; in the present application, the communication node can join the corresponding network topology by sending a request to join the network topology to any node in the network topology, and when it is necessary to transmit information to other nodes, it can find and determine the optimal transmission path for information transmission by itself, that is, various node functions can be realized without being controlled by any central node, avoiding excessive dependence of the communication node on a certain node, and thus avoiding the problem of each node in the network topology failing to work normally due to the failure of a certain node. BRIEF DESCRIPTION OF THE DRAWINGS

[0015] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative labor.

[0016] Figure 1 It is a schematic diagram of the implementation process of the decentralized Mesh networking method provided in the embodiment of the present application;

[0017] Figure 2 It is a transmission path diagram of the decentralized Mesh networking method provided in an embodiment of the present application;

[0018] Figure 3 It is a schematic diagram of a communication node provided in an embodiment of the present application. DETAILED DESCRIPTION

[0019] In the following description, specific details such as specific system structures, technologies, etc. are provided for the purpose of illustration rather than limitation, so as to provide a thorough understanding of the embodiments of the present application. However, it should be clear to those skilled in the art that the present application may also be implemented in other embodiments without these specific details. In other cases, detailed descriptions of well-known systems, devices, circuits, and methods are omitted to prevent unnecessary details from obstructing the description of the present application.

[0020] In order to illustrate the technical solution described in this application, a specific embodiment is provided below for illustration.

[0021] Figure 1 A decentralized Mesh networking method provided in Embodiment 1 of the present application is shown, which is applied to a communication node. The decentralized Mesh networking method includes:

[0022] S1: When the communication node is started, it sends a joining request to other nodes to apply to join the network topology where other nodes are located;

[0023] S2: After receiving the response information from the response node, join the network topology where the response node is located;

[0024] S3: when receiving a task instruction to transmit information to a target node in the added network topology, determining whether the communication node is directly connected to the target node, and if so, directly transmitting information to the target node;

[0025] S4: If not, identify each transmission path leading to the target node;

[0026] S5: Determine a most efficient transmission path from each identified transmission path;

[0027] S6: Transmit information to the target node via the most efficient transmission path.

[0028] In this embodiment, this method is executed in a communication node, which may be a router, a gateway, or other device having the function of sending and receiving signals and being able to dynamically maintain connection with other nodes to form a network topology; the other nodes and target nodes mentioned in this embodiment are all communication nodes, and these communication nodes can independently execute this method, that is, each node can join the network topology by running this method, communicate with other nodes in the network topology, etc., without the need for management and regulation by any central node.

[0029] In this embodiment, network topology refers to the physical or logical layout of each node in the network, and the way they are connected, including tree topology, ring topology, mesh topology, etc.; the communication node that executes this method is referred to as this communication node below. This communication node sends joining information by broadcasting, and then transmits the joining request to other nodes. The node that receives the joining request will reply with response information to this communication node. The response information includes the node information of the responding node itself (such as node ID) and the network topology information (including the node information of each node in the network topology). Then, this communication node can join the network topology (connect with the responding node, thereby making the whole network topology). The communication node is used to transmit information to a target node in the network topology, and the communication node is used to transmit information to the target node directly connected to the communication node. If so, the information can be directly transmitted to the target node. If not, the communication node spontaneously searches for a transmission path in the network topology that can transmit the information to the target node (i.e., searches for a path composed of intermediate nodes that can forward information), and selects the optimal transmission path for information transmission.

[0030] In the present application, a communication node can join the corresponding network topology by sending a request to join the network topology to any node in the network topology, and when it is necessary to transmit information to other nodes, it can independently find and determine the optimal transmission path for information transmission, that is, various node functions can be realized without being controlled by any central node, avoiding excessive dependence of the communication node on a certain node, and further avoiding the problem of the nodes in the network topology not being able to work normally due to the failure of a certain node.

[0031] As a preferred embodiment, the response information includes the node information of the response node itself and the node information of each node in the network topology where the response node is located;

[0032] After receiving the response information of the response node, the network topology where the response node is added includes:

[0033] S21: taking a received response message, sending a joining message to all nodes of the network topology corresponding to the response message, so as to join the network topology and update the network topology;

[0034] S22: Take another received response message and determine whether it has joined the network topology corresponding to the response message. If not, send a joining message to all nodes of the network topology corresponding to the response message to join the network topology. If so, do not repeatedly join the network topology corresponding to the response message. Repeat this step until the judgment is completed for each response message.

[0035] After adding any network topology, it also includes:

[0036] Monitor the heartbeat information sent by other nodes in the network topology;

[0037] For each other node in the network topology, judging whether the other node is a faulty node according to the heartbeat information sent by the other node;

[0038] All faulty nodes are removed from the network topology to update the network topology.

[0039] Judging whether the other node is a faulty node according to the heartbeat information sent by the other node includes:

[0040] Determine the heartbeat time point corresponding to the latest heartbeat information of the other node in the node status table of the network topology, wherein the node status table records the heartbeat time point of each heartbeat information sent by each other node;

[0041] It is determined whether the interval between the heartbeat time point and the current time point exceeds the preset time length. If so, the other node is a faulty node; if not, the other node is not a faulty node.

[0042] In this embodiment, the response information includes the type of network topology and the node information of each node in the network topology, and the node information includes the node ID and the node address. After receiving the response information, the communication node can know the position of each node in the network topology and the connection relationship between them. The communication node can join multiple network topologies at the same time. Therefore, when receiving multiple response information, it can be determined whether there is a duplication in the network topology corresponding to each response information. For repeated network topologies, it only needs to join once. After joining any network topology, other nodes of the network topology will send heartbeat information (information indicating that the node status is normal) to the communication node at intervals (for example, 20 seconds). After receiving the heartbeat information, the communication node will mark the status of the corresponding node as normal in the node status table, and mark the time point when the heartbeat information is received. If the time point when the heartbeat information of the node is last received exceeds a preset time (for example, 1 minute) from the current time point, the node can be regarded as a faulty node, and the node is marked as faulty in the node status table, and then the network topology is updated (the faulty node is removed from the original network topology).

[0043] As a preferred embodiment, Figure 2 As shown, identifying each transmission path leading to the target node includes:

[0044] Sending a transmission request to an intermediate node connected to the communication node in the network topology where the target node is located, so that the intermediate node forwards the transmission request to the target node;

[0045] Receive all reply messages sent back from the target node and identify the forwarding path, i.e., the transmission path, in each reply message, wherein the target node sends a corresponding reply message for the transmission request transmitted through each different forwarding path, and the reply message includes the corresponding transmission path.

[0046] Each reply message also includes the real-time bandwidth of each intermediate node of the corresponding forwarding path; determining a most efficient transmission path from each identified transmission path includes:

[0047] S51: for each reply message, determine the real-time bandwidth of each intermediate node in the reply message, and then determine the minimum bandwidth corresponding to the reply message;

[0048] S52: Compare the minimum bandwidth values ​​corresponding to the reply information, and then determine the reply information corresponding to the highest minimum bandwidth value as the target reply information.

[0049] S53: Taking the forwarding path corresponding to the target reply information as the most efficient transmission path.

[0050] In this embodiment, a transmission request is a request to transmit information to a certain node, including a target node to which the information needs to be transmitted; after sending the transmission request to the intermediate node connected to the present communication node, the intermediate node will forward the transmission request to the target node (when the target node is connected to the node), or transmit the transmission request to the target node through multiple forwardings through other intermediate nodes (when the target node is not connected to the intermediate node); therefore, the target node may receive transmission requests forwarded from multiple paths, and for each forwarding path, the target node will correspondingly send back reply information via the path, and when forwarding the reply information, the intermediate node will attach the real-time bandwidth of the node to the reply information, and then the present communication node can determine the minimum bandwidth of each transmission path according to the received reply information (which can represent the transmission capacity of the transmission path, and the larger the minimum bandwidth, the stronger the transmission capacity), and then determine the most efficient transmission path for information transmission.

[0051] As a preferred embodiment, transmitting information to a target node using the most efficient transmission path includes:

[0052] Transmit information to the target node through the most efficient transmission path;

[0053] During the information transmission process, the bandwidth changes of each transmission path are monitored in real time to determine whether the most efficient transmission path has changed;

[0054] If the most efficient transmission path changes, the information is transmitted by switching to the new most efficient transmission path.

[0055] Real-time monitoring of bandwidth changes of each transmission path to determine whether the most efficient transmission path has changed includes:

[0056] For each transmission path, query information is sent to the intermediate nodes on the transmission path in real time through the transmission path to determine the real-time bandwidth of each intermediate node, and then determine the latest minimum bandwidth value of the transmission path;

[0057] Compare the latest minimum bandwidth values ​​corresponding to each transmission path to determine the new most efficient transmission path;

[0058] It is determined whether the new most efficient transmission path is consistent with the current transmission path. If they are consistent, the most efficient transmission path has not changed. Otherwise, the most efficient transmission path has changed.

[0059] In this embodiment, during the process of transmitting information, for each transmission path, the communication node can query the real-time bandwidth of each intermediate node in the transmission path in real time through the corresponding transmission path, so as to determine whether the most efficient transmission path has changed. If it has changed, the transmission path is switched in real time, so as to ensure the efficiency of the entire process of transmitting information.

[0060] A communication node provided in a first embodiment of the present application includes a memory and a processor, wherein a computer program is stored in the memory, and when the computer program is executed by the processor, the processor executes the steps of the decentralized Mesh networking method, specifically including:

[0061] S1: When the communication node is started, it sends a joining request to other nodes to apply to join the network topology where other nodes are located;

[0062] S2: After receiving the response information from the response node, join the network topology where the response node is located;

[0063] S3: when receiving a task instruction to transmit information to a target node in the added network topology, determining whether the communication node is directly connected to the target node, and if so, directly transmitting information to the target node;

[0064] S4: If not, identify each transmission path leading to the target node;

[0065] S5: Determine a most efficient transmission path from each identified transmission path;

[0066] S6: Transmit information to the target node via the most efficient transmission path.

[0067] A terminal-readable storage medium is provided in a second embodiment of the present application. A computer program is stored on the terminal-readable storage medium. When the computer program is executed by a processor, the processor executes the steps of the decentralized Mesh networking method, specifically including:

[0068] S1: When the communication node is started, it sends a joining request to other nodes to apply to join the network topology where other nodes are located;

[0069] S2: After receiving the response information from the response node, join the network topology where the response node is located;

[0070] S3: when receiving a task instruction to transmit information to a target node in the added network topology, determining whether the communication node is directly connected to the target node, and if so, directly transmitting information to the target node;

[0071] S4: If not, identify each transmission path leading to the target node;

[0072] S5: Determine a most efficient transmission path from each identified transmission path;

[0073] S6: Transmit information to the target node via the most efficient transmission path.

[0074] It should be understood that the size of the serial numbers of the steps in the above embodiments does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.

[0075] It should be understood that when used in the present application specification, the term "comprising" indicates the presence of described features, wholes, steps, operations, elements and / or components, but does not exclude the presence or addition of one or more other features, wholes, steps, operations, elements, components and / or combinations thereof.

[0076] It should also be understood that the term “and / or” used in the specification of the present application refers to any combination and all possible combinations of one or more of the associated listed items, and includes these combinations.

[0077] As used in the present specification, the term "if" can be interpreted as "when" or "uponce" or "in response to determining" or "in response to detecting" depending on the context. Similarly, the phrase "if it is determined" or "if [the described condition or event] is detected" can be interpreted as meaning "uponce it is determined" or "in response to determining" or "uponce [the described condition or event] is detected" or "in response to detecting [the described condition or event]" depending on the context.

[0078] In addition, in the description of the present specification, the terms "first", "second", "third", etc. are only used to distinguish descriptions, and cannot be understood as indicating or implying relative importance. It should also be understood that although the terms "first", "second", etc. are used to describe various elements in some embodiments of the present application in the text, these elements should not be limited by these terms. These terms are only used to distinguish one element from another element. For example, the first table can be named as the second table, and similarly, the second table can be named as the first table, without departing from the scope of the various described embodiments. The first table and the second table are both tables, but they are not the same table.

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

[0080] Figure 3 Schematic diagram of the structure of a communication node provided by an embodiment of the present application. Figure 3 As shown, the communication node of this embodiment includes: at least one processor and a memory, wherein the memory stores a computer program that can be run on the processor. When the processor executes the computer program, the steps in the above-mentioned decentralized Mesh networking method embodiments are implemented, such as Figure 1 Steps S1 to S6 are shown.

[0081] The communication node may be a computing device such as a desktop computer, a notebook, a PDA, or a cloud server. The communication node may include, but is not limited to, a processor and a memory. Those skilled in the art will understand that Figure 3It is only an example of a communication node and does not constitute a limitation of the communication node. It may include more or fewer components than shown in the figure, or a combination of certain components, or different components. For example, the communication node may also include an input sending device, a network access device, a bus, etc.

[0082] The processor may be a central processing unit (CPU), other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor may be a microprocessor or any conventional processor, etc.

[0083] In some embodiments, the memory may be an internal storage unit of the communication node, such as a hard disk or memory of the communication node. The memory may also be an external storage device of the communication node, such as a plug-in hard disk, a smart memory card (Smart Media Card, SMC), a secure digital (Secure Digital, SD) card, a flash card (Flash Card), etc. equipped on the communication node. Further, the memory may also include both an internal storage unit of the communication node and an external storage device. The memory is used to store an operating system, an application program, a boot loader (BootLoader), data and other programs, such as the program code of the computer program, etc. The memory may also be used to temporarily store data that has been sent or is to be sent.

[0084] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.

[0085] An embodiment of the present application provides a computer program product. When the computer program product runs on a mobile communication node, the mobile communication node can implement the steps in the above-mentioned method embodiments when executing the computer program product.

[0086] If the integrated module / unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the present application implements all or part of the processes in the above-mentioned embodiment method, and can also be completed by instructing the relevant hardware through a computer program. The computer program can be stored in a computer-readable storage medium, and the computer program can implement the steps of the above-mentioned various method embodiments when executed by the processor. Among them, the computer program includes computer program code, and the computer program code can be in source code form, object code form, executable file or some intermediate form. The computer-readable medium may include: any entity or device capable of carrying the computer program code, recording medium, U disk, mobile hard disk, disk, optical disk, computer memory, read-only memory (ROM), random access memory (RAM), electric carrier signal, telecommunication signal and software distribution medium, etc.

[0087] In the above embodiments, the description of each embodiment has its own emphasis. For parts that are not described or recorded in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.

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

[0089] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0090] The embodiments described above are only used to illustrate the technical solutions of the present application, rather than to limit them. Although the present application has been described in detail with reference to the aforementioned embodiments, a person skilled in the art should understand that the technical solutions described in the aforementioned embodiments may still be modified, or some of the technical features may be replaced by equivalents. Such modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present application, and should all be included in the protection scope of the present application.

Claims

1. A decentralized Mesh networking method, applied to communication nodes, characterized in that: The decentralized Mesh networking method includes: S1: When the communication node is started, it sends a joining request to other nodes to apply to join the network topology where other nodes are located; S2: After receiving the response information from the response node, join the network topology where the response node is located; S3: when receiving a task instruction to transmit information to a target node in the added network topology, determining whether the communication node is directly connected to the target node, and if so, directly transmitting information to the target node; S4: If not, identify each transmission path leading to the target node; S5: Determine a most efficient transmission path from each identified transmission path; S6: Transmit information to the target node via the most efficient transmission path.

2. The method for implementing a telephone conference according to claim 1, characterized in that: The response information includes the node information of the response node itself and the node information of each node in the network topology where the response node is located; After receiving the response information of the response node, the network topology where the response node is added includes: S21: taking a received response message, sending a joining message to all nodes of the network topology corresponding to the response message, so as to join the network topology and update the network topology; S22: Take another received response message and determine whether it has joined the network topology corresponding to the response message. If not, send a joining message to all nodes of the network topology corresponding to the response message to join the network topology. If so, do not repeatedly join the network topology corresponding to the response message. Repeat this step until the judgment is completed for each response message.

3. The method for implementing a telephone conference according to claim 2, characterized in that: After adding any network topology, it also includes: Monitor the heartbeat information sent by other nodes in the network topology; For each other node in the network topology, judging whether the other node is a faulty node according to the heartbeat information sent by the other node; All faulty nodes are removed from the network topology to update the network topology.

4. The method for implementing a telephone conference according to claim 3, characterized in that: Judging whether the other node is a faulty node according to the heartbeat information sent by the other node includes: Determine the heartbeat time point corresponding to the latest heartbeat information of the other node in the node status table of the network topology, wherein the node status table records the heartbeat time point of each heartbeat information sent by each other node; It is determined whether the interval between the heartbeat time point and the current time point exceeds the preset time length. If so, the other node is a faulty node; if not, the other node is not a faulty node.

5. The method for implementing a telephone conference according to claim 3, characterized in that: Identifying each transmission path to the target node includes: Sending a transmission request to an intermediate node connected to the communication node in the network topology where the target node is located, so that the intermediate node forwards the transmission request to the target node; Receive all reply messages sent back from the target node and identify the forwarding path, i.e., the transmission path, in each reply message, wherein the target node sends a corresponding reply message for the transmission request transmitted through each different forwarding path, and the reply message includes the corresponding transmission path.

6. The method for implementing a telephone conference according to claim 5, characterized in that: Each reply message also includes the real-time bandwidth of each intermediate node of the corresponding forwarding path; determining a most efficient transmission path from each identified transmission path includes: S51: for each reply message, determine the real-time bandwidth of each intermediate node in the reply message, and then determine the minimum bandwidth corresponding to the reply message; S52: Compare the minimum bandwidth values ​​corresponding to the reply information, and then determine the reply information corresponding to the highest minimum bandwidth value as the target reply information. S53: Taking the forwarding path corresponding to the target reply information as the most efficient transmission path.

7. The method for implementing a telephone conference according to claim 6, characterized in that: Transmitting information to the target node using the most efficient transmission path includes: Transmit information to the target node through the most efficient transmission path; During the information transmission process, the bandwidth changes of each transmission path are monitored in real time to determine whether the most efficient transmission path has changed; If the most efficient transmission path changes, the information is transmitted by switching to the new most efficient transmission path.

8. The method for implementing a telephone conference according to claim 7, characterized in that: Real-time monitoring of bandwidth changes of each transmission path to determine whether the most efficient transmission path has changed includes: For each transmission path, query information is sent to the intermediate nodes on the transmission path in real time through the transmission path to determine the real-time bandwidth of each intermediate node, and then determine the latest minimum bandwidth value of the transmission path; Compare the latest minimum bandwidth values ​​corresponding to each transmission path to determine the new most efficient transmission path; It is determined whether the new most efficient transmission path is consistent with the current transmission path. If they are consistent, the most efficient transmission path has not changed. Otherwise, the most efficient transmission path has changed.

9. A communication node, characterized in that: It comprises a memory and a processor, wherein a computer program is stored in the memory, and when the computer program is executed by the processor, the processor executes the steps of the decentralized Mesh networking method according to any one of claims 1 to 8.

10. A terminal-readable storage medium, characterized in that: The terminal-readable storage medium stores a computer program, and when the computer program is executed by the processor, the processor executes the steps of the decentralized Mesh networking method according to any one of claims 1 to 8.

Images