Networking communication method and device and electronic equipment

Abstract

The invention provides a networking communication method and device and electronic equipment. The method comprises the following steps: all network nodes perform traversal search from a head node according to a predetermined sequence, so that each network node obtains corresponding rear node information, and under the condition that the network nodes have corresponding rear nodes, the rear node information of the network nodes further comprises rear node information of rear-stage nodes; the head node forwards the full-node information to other network nodes; and under the condition that the source network node receives a transmission request for transmitting the data packet to the target network node, the source network node determines a target transmission path from the source network node to the target network node according to the full node information, and transmits the data packet according to the target transmission path, and the method solves the problem of low networking efficiency in the prior art.

Description

Technical Field

[0001] The present application relates to the field of Internet of Things communication transmission, and specifically, to a networking communication method, device and electronic equipment. Background Art

[0002] With the continuous development and progress of IoT ranging and positioning technology, its IoT positioning technology is gradually moving towards high precision, low power consumption, miniaturization, high capacity and large-scale use. Many wireless sub-devices need to realize more complex data transmission communications such as point-to-point, point-to-many and many-to-many in order to obtain better transmission efficiency.

[0003] In the existing technology, the networking mechanism can be used to optimize the communication and transmission of data in the time domain. However, the traditional networking communication idea requires a coordinator as the central coordination of all communications. When the number of nodes increases, a large number of coordinators are needed to solve the problem, which increases the construction complexity and reduces the transmission efficiency.

[0004] Therefore, there is an urgent need for an efficient networking communication method. Summary of the invention

[0005] The main purpose of the present application is to provide a networking communication method, device and electronic device to at least solve the problem of low networking efficiency in the prior art.

[0006] In order to achieve the above-mentioned purpose, according to one aspect of the present application, a networking communication method is provided, comprising: all network nodes traversing and searching in a predetermined order starting from a head node, so that each of the network nodes obtains corresponding subsequent node information, the subsequent node information of the network node includes at least node information of a communication node, and when the network node has a corresponding subsequent node, the subsequent node information of the network node also includes the subsequent node information of a subsequent node, and the node information includes at least identification information and received signal strength of the network node, the communication node is a node that directly communicates with the corresponding network node, and the subsequent node refers to the network node at the subsequent level of the communication node; the head node forwards all node information to each of the other network nodes, and the all node information includes the subsequent node information of the head node; when a source network node receives a transmission request to transmit a data packet to a target network node, the source network node determines a target transmission path from the source network node to the target network node according to the all node information, and transmits the data packet according to the target transmission path, and the source network node is any one of the network nodes except the target network node.

[0007] Optionally, the head node initiates a broadcast search instruction to search all the network nodes within the first communication range; the head node sequentially receives reply instructions sent by the network nodes that receive the broadcast search instruction, and records the node information of each network node to obtain the node information of the communication node of the head node.

[0008] Optionally, in the search step, the communication node of the head node initiates a broadcast search instruction to search all the network nodes within the second communication range; in the recording step, the communication node of the head node sequentially receives the reply instructions sent by all the network nodes that have received the broadcast search instruction, and records the node information of each network node to obtain the node information of the communication node of the head node; in the feedback step, the communication node of the head node sends the node information of the communication node obtained in the recording step to the head node; the repetitive process is repeated at least once in sequence until the last network node returns the corresponding node information of the communication node to the head node, so that the head node obtains the corresponding subsequent node information. After all the communication nodes of the previous level have completed the repetitive process, the communication nodes of the subsequent level execute the repetitive process again. The repetitive process includes the search step, the recording step and the feedback step.

[0009] Optionally, when the network node receives the broadcast search instruction issued by the network node at the upper level, the current time is recorded as the reference time; the minimum beat period for the network node to send instruction data is obtained; based on the reference time and the minimum beat period, the beat time for the network node to send the reply instruction is calculated; the network node sends the reply instruction to the network node at the upper level that issued the broadcast search instruction according to the beat time.

[0010] Optionally, the network nodes at the same level initiate the broadcast search instructions in sequence according to the beat time from short to long.

[0011] Optionally, the identification information and the received signal strength of each network node are recorded to obtain record information; the received signal strengths are sorted in descending order to obtain sorting information; the node information of the network nodes whose received signal strength is less than a strength threshold is deleted from the record information to obtain updated record information, and the updated record information and the sorting information constitute the communication node of the head node or the node information of the communication node of the head node.

[0012] Optionally, the head node constructs a network node topology table based on the corresponding post-node information, and the network node topology table includes identification information of the communication node of each of the network nodes and the received signal strength; the head node forwards the network node topology table to each of the other network nodes.

[0013] Optionally, edge nodes and farthest nodes are determined according to the network node topology table, wherein the edge node is the network node with only one level of communication node, and the farthest node is the network node that needs to pass through the most levels to receive data from the head node; multiple optimal paths are determined with the edge node and the farthest node as stop nodes and the head node as the start node, any two of the optimal paths pass through different intermediate network nodes, and all the network nodes passed through by the optimal paths cover all the network nodes, and the intermediate network nodes are the other network nodes on the optimal path except the head node and the stop node; the head node forwards the network node topology table to all the stop nodes simultaneously according to the multiple optimal paths.

[0014] Optionally, when the source network node receives a transmission request to transmit data to the target network node, the source network node determines multiple communicative paths based on the local full-node information; calculates the number of the network nodes of each communicative path to obtain multiple node numbers; determines a preliminary target transmission path based on at least the multiple node numbers; when the source network node receives only one transmission request, determines the preliminary target transmission path as the target transmission path; when the source network node receives multiple transmission requests, determines the target transmission path based on the multiple preliminary target transmission paths corresponding to the multiple transmission requests.

[0015] Optionally, compare the number of nodes of multiple communicative paths; in the case where there is only one communicative path with the least number of nodes, determine the communicative path with the least number of nodes as the prepared target transmission path; in the case where there are multiple communicative paths with the least number of nodes, calculate the sum of the received signal strengths of all node pairs of the communicative paths with the least number of nodes to obtain multiple signal strength sums, wherein the node pair is two adjacent network nodes on the communicative path; compare the multiple signal strength sums, and determine the communicative path with the largest signal strength sum as the prepared target transmission path.

[0016] Optionally, a data sending node table is generated according to the target transmission path, and the data sending node table includes the network nodes at each level in the target transmission path; the data sending node table is loaded in front of the packet header of the data packet to form a loaded data packet; the loaded data packet is transmitted according to the target transmission path, and during the transmission process, after each of the network nodes receives the loaded data packet, it is determined according to the data sending node table whether the data packet is the data packet that the current network node should receive; when it is determined that the data packet is the data packet that the current network node should receive, the loaded data packet is sent to the network node at the next level according to the data sending node table.

[0017] Optionally, the network node detects whether there is a radio frequency signal within a preset distance range; if the radio frequency signal exists within the preset distance range, the network node continues to detect until the radio frequency signal no longer exists within the preset distance range, and the network node sends the data packet to the network node at the next level according to the target transmission path; if the radio frequency signal does not exist within the preset distance range, the network node sends the data packet to the network node at the next level according to the target transmission path.

[0018] Optionally, in the case that the source network node receives multiple transmission requests, the multiple prepared target transmission paths are merged into the target transmission path, the non-public network nodes with the same ranking on the prepared target transmission path are the network nodes at the same level of the target transmission path, and the multiple data packets corresponding to the multiple transmission requests are merged into one data packet to obtain a merged data packet; and the merged data packet is transmitted according to the target transmission path.

[0019] Optionally, when any one instruction receives a network access request from a newly added network node, the full node information is sent to the newly added network node; the newly added network node initiates a broadcast search instruction to search for all the network nodes within a third communication range; the newly added network node sequentially receives reply instructions sent in turn by the network nodes that have received the broadcast search instruction, records the node information of each network node and updates it to the full node information to obtain first updated full node information; the newly added network node forwards the first updated full node information to each of the network nodes, and each of the network nodes updates the full node information to the first updated full node information when receiving the first updated full node information.

[0020] Optionally, when a predetermined network node sends information to the next network node and does not receive confirmation information returned by the next network node, it is determined that the next network node is a faulty node, and the predetermined network node is any one of the network nodes; the predetermined network node deletes the relevant information of the faulty node in the full node information to obtain a second updated full node, and the relevant information includes the node information of the faulty node and the information of the communication node representing the faulty node and the node information of the communication node; the predetermined network node forwards the second updated full node information to each of the network nodes, and each of the network nodes updates the full node information to the second updated full node information when receiving the second updated full node information.

[0021] According to another aspect of the present application, a networking communication device is provided, comprising:

[0022] A search unit, all network nodes are traversed and searched in a predetermined order starting from the head node, so that each network node obtains corresponding subsequent node information, the subsequent node information of the network node includes at least node information of a communication node, and in the case where the network node has a corresponding subsequent node, the subsequent node information of the network node also includes the subsequent node information of a subsequent node, the node information includes at least identification information and received signal strength of the network node, the communication node is a node that directly communicates with the corresponding network node, and the subsequent node refers to the network node at the subsequent level of the communication node;

[0023] A forwarding unit, wherein the head node forwards all node information to other network nodes, wherein the all node information includes the subsequent node information of the head node;

[0024] A determination unit, in the case where a source network node receives a transmission request to transmit a data packet to a target network node, the source network node determines a target transmission path from the source network node to the target network node based on the all-node information, and transmits the data packet along the target transmission path, the source network node being any one of the network nodes except the target network node.

[0025] According to another aspect of the present application, an electronic device is provided, comprising: one or more processors, a memory, and one or more programs, wherein the one or more programs are stored in the memory and are configured to be executed by the one or more processors, and the one or more programs include methods for executing any one of the methods described above.

[0026] By applying the technical solution of the present application, first, all network nodes perform traversal search starting from the head node in a predetermined order, so that each of the above network nodes obtains the corresponding subsequent node information. In the case where the above network node has a corresponding subsequent node, the above subsequent node information of the above network node also includes the above subsequent node information of the subsequent node; secondly, the above head node forwards the full node information to each of the other above network nodes; finally, in the case where the source network node receives a transmission request to transmit a data packet to the target network node, the above source network node determines the target transmission path from the above source network node to the above target network node according to the above full node information, and transmits the above data packet according to the above target transmission path. Compared with the prior art, the solution of the present application traverses the network nodes in a predetermined order to search and obtain the rear node information. After the head node obtains the full node information, the full node information is forwarded to other network nodes. That is, all network nodes can obtain the full node information. When any network node needs to transmit data, the point-to-point target transmission path can be determined according to the full node information, and the transmission data packet can be sent to the target node. That is, this method can realize point-to-point transmission and does not need to rely on the intermediate coordination equipment, thereby improving the communication efficiency and solving the problem of low communication efficiency caused by the inability to transmit point-to-point in the prior art. BRIEF DESCRIPTION OF THE DRAWINGS

[0027] The drawings constituting part of the present application are used to provide a further understanding of the present application. The exemplary embodiments and descriptions of the present application are used to explain the present application and do not constitute an improper limitation on the present application. In the drawings:

[0028] Figure 1 A hardware structure block diagram of a mobile terminal for executing a networking communication method provided in an embodiment of the present application is shown;

[0029] Figure 2 A schematic diagram of a process flow of a networking communication method provided according to an embodiment of the present application is shown;

[0030] Figure 3 A schematic diagram showing a head node searching for nodes within a communication range according to a networking communication method provided in an embodiment of the present application;

[0031] Figure 4 A schematic diagram showing a communication node of a head node searching for nodes within a communication range according to a networking communication method provided in an embodiment of the present application;

[0032] Figure 5 A schematic diagram of network topology nodes of a networking communication method provided according to an embodiment of the present application is shown;

[0033] Figure 6A schematic diagram of synchronization node information of a networking communication method provided according to an embodiment of the present application is shown;

[0034] Figure 7 A schematic diagram showing the main steps of a networking communication method provided according to an embodiment of the present application is shown;

[0035] Figure 8 A structural block diagram of a networking communication device provided according to an embodiment of the present application is shown. DETAILED DESCRIPTION

[0036] It should be noted that, in the absence of conflict, the embodiments and features in the embodiments of the present application can be combined with each other. The present application will be described in detail below with reference to the accompanying drawings and in combination with the embodiments.

[0037] In order to enable those skilled in the art to better understand the solution of the present application, the technical solution in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work should fall within the scope of protection of the present application.

[0038] It should be noted that the terms "first", "second", etc. in the specification and claims of the present application and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequential order. It should be understood that the data used in this way can be interchanged where appropriate, so that the embodiments of the present application described here. In addition, the terms "including" and "having" and any of their variations are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device comprising a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0039] As introduced in the background technology, the prior art has the problem of low networking efficiency. To solve the above problem, an embodiment of the present application provides a networking communication method.

[0040] The technical solutions in the embodiments of the present invention will be described clearly and completely below in conjunction with the accompanying drawings in the embodiments of the present invention.

[0041] The method embodiments provided in the embodiments of the present application can be executed in a mobile terminal, a computer terminal or a similar computing device. Taking running on a mobile terminal as an example, Figure 1 FIG. 1 is a hardware structure diagram of a mobile terminal of a networking communication method according to an embodiment of the present invention. Figure 1As shown, the mobile terminal may include one or more ( Figure 1 Only one is shown in the figure) a processor 102 (the processor 102 may include but is not limited to a processing device such as a microprocessor MCU or a programmable logic device FPGA) and a memory 104 for storing data, wherein the mobile terminal may also include a transmission device 106 and an input / output device 108 for communication functions. It can be understood by those skilled in the art that Figure 1 The structure shown is only for illustration and does not limit the structure of the mobile terminal. Figure 1 More or fewer components as shown, or with Figure 1 Different configurations are shown.

[0042] The memory 104 can be used to store computer programs, for example, software programs and modules of application software, such as the computer program corresponding to the display method of device information in the embodiment of the present invention. The processor 102 executes various functional applications and data processing by running the computer program stored in the memory 104, that is, the above method is implemented. The memory 104 may include a high-speed random access memory, and may also include a non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some examples, the memory 104 may further include a memory remotely arranged relative to the processor 102, and these remote memories can be connected to the mobile terminal via a network. Examples of the above-mentioned network include but are not limited to the Internet, an intranet, a local area network, a mobile communication network, and a combination thereof. The transmission device 106 is used to receive or send data via a network. The above-mentioned specific examples of the network may include a wireless network provided by a communication provider of the mobile terminal. In one example, the transmission device 106 includes a network adapter (Network Interface Controller, referred to as NIC), which can be connected to other network devices through a base station so as to communicate with the Internet. In one example, the transmission device 106 may be a radio frequency (RF) module, which is used to communicate with the Internet wirelessly.

[0043] In this embodiment, a networking communication method running on a mobile terminal, a computer terminal or a similar computing device is provided. It should be noted that the steps shown in the flowchart of the accompanying drawings can be executed in a computer system such as a set of computer executable instructions, and although a logical order is shown in the flowchart, in some cases, the steps shown or described can be executed in an order different from that shown here.

[0044] Figure 2 1 is a flow chart of a networking communication method according to an embodiment of the present application. Figure 2As shown, the method comprises the following steps:

[0045] Step S201, all network nodes are traversed and searched in a predetermined order starting from the head node, so that each of the above network nodes obtains the corresponding subsequent node information, the above subsequent node information of the above network node includes at least the node information of the communication node, in the case that the above network node has a corresponding subsequent node, the above subsequent node information of the above network node also includes the above subsequent node information of the subsequent node, the above node information includes at least the identification information and the received signal strength of the above network node, the above communication node is a node that directly communicates with the corresponding above network node, and the above subsequent node refers to the above network node at the subsequent level of the above communication node.

[0046] Specifically, all network nodes actively initiate broadcast search instructions starting from the head node, traversing and searching all nodes within the communication range. Each node that receives the wireless broadcast search instruction will reply with a wireless message to the transmitting node, so that each of the above network nodes obtains the corresponding back-node information. Finally, the head node obtains the communication information of each network node in the entire network and the corresponding received signal strength information.

[0047] Specifically, in the case where the above-mentioned network node has a corresponding subsequent node, the above-mentioned subsequent node information of the above-mentioned network node also includes the above-mentioned subsequent node information of the subsequent node. Suppose there is a network node A, its subsequent node is node B, and the subsequent node of node B is node C. According to the above situation, the subsequent node information of node A includes the information of node B, and the subsequent node information of node B includes the information of node C. Therefore, the subsequent node information of node A also includes the information of node C.

[0048] Step S202: the head node forwards all node information to other network nodes, where the all node information includes the subsequent node information of the head node.

[0049] Specifically, after the head node has all the node information, it will synchronously forward all the node information to other nodes, so that each node can obtain all the node information in the network.

[0050] Step S203, when the source network node receives a transmission request to transmit a data packet to the target network node, the source network node determines the target transmission path from the source network node to the target network node based on the all-node information, and transmits the data packet according to the target transmission path. The source network node is any one of the network nodes except the target network node.

[0051] Specifically, when a source network node receives a request to transmit a data packet to a target network node, the source network node determines a transmission path from itself to the target network node based on all node information, and transmits the data packet to the target network node along the determined transmission path.

[0052] In the above-mentioned embodiment, first, all network nodes perform traversal search starting from the head node in a predetermined order, so that each of the above-mentioned network nodes obtains the corresponding subsequent node information. In the case that the above-mentioned network node has a corresponding subsequent node, the above-mentioned subsequent node information of the above-mentioned network node also includes the above-mentioned subsequent node information of the subsequent node; secondly, the above-mentioned head node forwards the full node information to each of the other above-mentioned network nodes; finally, in the case that the source network node receives a transmission request to transmit a data packet to the target network node, the above-mentioned source network node determines the target transmission path from the above-mentioned source network node to the above-mentioned target network node according to the above-mentioned full node information, and transmits the above-mentioned data packet according to the above-mentioned target transmission path. Compared with the prior art, the solution of the present application traverses the network nodes in a predetermined order to search and obtain the rear node information. After the head node obtains the full node information, the full node information is forwarded to other network nodes. That is, all network nodes can obtain the full node information. When any network node needs to transmit data, the point-to-point target transmission path can be determined according to the full node information, and the transmission data packet can be sent to the target node. That is, this method can realize point-to-point transmission and does not need to rely on the intermediate coordination equipment, thereby improving the communication efficiency and solving the problem of low communication efficiency caused by the inability to transmit point-to-point in the prior art.

[0053] In one embodiment of the present application, all network nodes are traversed and searched in a predetermined order starting from the head node, so that each of the above network nodes obtains the corresponding post-node information, including: the above head node initiates a broadcast search instruction to search all the above network nodes within the first communication range; the above head node sequentially receives the reply instructions sent in turn by the above network nodes that receive the above broadcast search instructions, and records the above node information of each of the above network nodes to obtain the node information of the communication node of the above head node. In this method, the head node can obtain the node information of the communication node, realize the information exchange and data transmission between network nodes, and further avoid the signal conflict problem caused by multiple nodes replying to instructions at the same time.

[0054] In order to further ensure the accuracy and completeness of the communication node information obtained by the head node, in one embodiment of the present application, all network nodes perform traversal search starting from the head node in a predetermined order so that each of the above network nodes obtains the corresponding post-node information, and also includes: a search step, in which the communication node of the above head node initiates a broadcast search instruction to search all the above network nodes within the second communication range; a recording step, in which the communication node of the above head node sequentially receives the reply instructions sent by all the above network nodes that have received the above broadcast search instruction, and records the above node information of each of the above network nodes to obtain the node information of the communication node of the above head node; a feedback step, in which the communication node of the above head node sends the node information of the above communication node obtained in the above recording step to the above head node; and the repetitive process is repeated at least once in sequence until the last network node sends the corresponding node information of the above communication node according to the above recording step. The information is transmitted back to the head node in a tree form, so that the head node obtains the corresponding information of the rear node. After all the communication nodes of the previous level have completed the above-mentioned repetitive process, the communication nodes of the next level execute the above-mentioned repetitive process again. The above-mentioned repetitive process includes the above-mentioned search step, the above-mentioned recording step and the above-mentioned return step. In this method, a broadcast search instruction is initiated by the communication node of the head node to search all nodes within the communication range. Each node that receives the wireless broadcast search instruction replies to the communication node of the head node in turn. At this time, the communication node of the head node can receive the reply instructions of all nodes within the communication range in turn. At this time, the communication node of the head node can record each node and the corresponding node information, and send the node information recorded by the communication node of the head node to the head node, and repeat the sending in turn until the last network node sends the node information of its corresponding communication node to the head node, so that the head node can obtain the rear node information.

[0055] In order to further enable network nodes to send reply instructions to transmitting nodes in an orderly manner, thereby further reducing the conflict problem caused by multiple nodes replying to instructions at the same time, in one embodiment of the present application, the above-mentioned network nodes start from the head node and perform traversal search in a predetermined order, so that each of the above-mentioned network nodes obtains the corresponding post-node information, and also includes: when the above-mentioned network node receives the above-mentioned broadcast search instruction issued by the above-mentioned network node at the upper level, recording the current time as the reference time; obtaining the minimum beat period for the above-mentioned network node to send instruction data; calculating the beat time for the above-mentioned network node to send the above-mentioned reply instruction based on the above-mentioned reference time and the minimum beat period; the above-mentioned network node sends the above-mentioned reply instruction to the above-mentioned network node at the upper level that issued the above-mentioned broadcast search instruction according to the above-mentioned beat time.

[0056] Specifically, when the above-mentioned network node receives the above-mentioned broadcast search instruction issued by the above-mentioned network node at the upper level, the current time is recorded as the reference time. As long as the nodes that can receive the search instruction within the communication range will use the time T0 of the transmitting node receiving the instruction as the same reference time, and obtain the minimum beat period T of the network node transmitting the instruction data. Each node that receives the instruction will calculate the beat time Tx of the reply instruction based on the reference time T0 and the minimum beat period T, where Tx=T0+T*i, where * represents multiplication. Each node that receives the wireless broadcast search instruction can reply instructions to the network node that issued the broadcast search instruction at the upper level in turn according to the beat time. This method further solves the signal conflict problem caused by multiple nodes replying to instructions at the same time by calculating the beat time and replying instructions to the network node that issued the broadcast search instruction at the upper level according to the calculated beat time.

[0057] In another embodiment, all network nodes perform traversal search starting from the head node in a predetermined order, so that each of the above network nodes obtains the corresponding post-node information, and also includes: the above network nodes at the same level initiate the above broadcast search instructions in sequence according to the above beat time from short to long. In this method, the orderly networking is further ensured, thereby improving the efficiency and stability of the entire network system.

[0058] Specifically, each node that receives the broadcast search command will calculate the beat time Tx j (j=0,1,2,3...) as the new wireless broadcast search command initiator, use the same method to obtain all node information within the communication range in turn, and then send the information back to the upper-level node, thereby further solving the signal conflict problem caused by multiple nodes initiating broadcast search commands at the same time.

[0059] like Figure 3 , Figure 4 and Figure 5As shown, taking 16 nodes as an example, the head node 0 broadcasts and searches for nodes 1, 2, and 3 within the communication range, and then nodes 1, 2, and 3 return to the head node 0, and then according to the second beat time, node 1 is used as a new node to broadcast and search for nodes 4, 5, 6, and 7 within the communication range, and node 1 will send node 4, 5, 6, and 7 signals back to node 0, and then according to the next beat time, node 2 is used as a new node to broadcast and search for nodes 5, 6, and 7 within the communication range, and node 2 will send node 5, 6, and 7 information back to node 0, and then node 4 continues to broadcast and search for communication nodes 8, 9, and 5 as a new node, and then node 4 also sends information back to node 1, and node 1 forwards it to the head node 0, and then node 4 continues to broadcast and search for communication nodes as a new node, and the same goes for the last node 16. At this point, each node from 0 to 16 has obtained the communication node within the communication range.

[0060] In order to further improve the communication effect and further ensure the effectiveness of communication, in an embodiment of the present application, the node information of each of the above-mentioned network nodes is recorded to obtain the node information of the communication node of the above-mentioned head node or the communication node of the above-mentioned head node, and also includes: recording the identification information and the above-mentioned received signal strength of each of the above-mentioned network nodes to obtain record information; sorting in descending order according to the above-mentioned received signal strength to obtain sorting information; deleting the node information of the above-mentioned network nodes whose received signal strength is less than the strength threshold from the above-mentioned record information to obtain the updated record information, and the updated record information and the above-mentioned sorting information constitute the node information of the communication node of the above-mentioned head node or the communication node of the above-mentioned head node.

[0061] Specifically, the identification information of each node and the corresponding received signal strength are recorded, the received signal strengths are sorted from large to small, and all nodes with received signal strengths less than -90dbm are filtered out. At this point, the traversal search of this node is completed, and then the traversal search of the next node is continued until the traversal search of the last node is completed. After the traversal search of the entire network node is completed, the head node will obtain all node information and corresponding received signal strengths of the entire network, thereby further improving the networking efficiency.

[0062] In another embodiment, the head node forwards the full node information to the other network nodes, and the full node information includes the post-node information of the head node, including: the head node constructs a network node topology table based on the corresponding post-node information, and the network node topology table includes the identification information of the communication node of each network node and the received signal strength; the head node forwards the network node topology table to the other network nodes. In this method, a more efficient network system is further constructed by representing the full node information in the form of a table.

[0063] Specifically, the head node establishes a large network node topology table with the number of network nodes, communication information and corresponding received signal strength. As shown in Table 1, this table has the topological link relationship connecting each network node and the corresponding received signal strength information, and contains the topological link diagram of each node. Through the network topology node relationship, any point-to-point, point-to-multipoint, and multi-point communication can be realized. Through the connection relationship between nodes, all optional situations of the node communication path can be found, so that the optimal communication path and the nodes passed can be calculated, further improving the networking efficiency.

[0064] Table 1

[0065]

[0066] In order to forward information as quickly as possible, thereby further improving networking efficiency, in one embodiment of the present application, the head node forwards the network node topology table to each of the other network nodes, including: determining edge nodes and farthest nodes according to the network node topology table, wherein the edge node is the network node having only one level of communication nodes, and the farthest node is the network node that needs to pass through the most levels to receive data from the head node; determining multiple optimal paths with the edge node and the farthest node as stop nodes and the head node as start node, any two of the optimal paths passing through different intermediate network nodes, and all of the optimal paths passing through the network nodes cover all of the network nodes, and the intermediate network nodes are the other network nodes on the optimal path except the head node and the stop node; the head node forwards the network node topology table to all of the stop nodes simultaneously according to the multiple optimal paths.

[0067] Specifically, the edge nodes and the farthest nodes are determined according to the network node topology table. The nodes with only one level of communication topology connection are found out through a queue loop based on the data in the node topology table, which are edge nodes. The nodes with the farthest communication distance from the head node are found out, which are the farthest nodes. The optimal path table is calculated by combining the permutation and sorting algorithms, and then the topology node information table is forwarded to each node according to the optimal node path, thereby realizing the synchronization of the entire network topology node information and further improving the networking efficiency.

[0068] like Figure 5 As shown, nodes 8, 9, 14 and 15 are only first-level communication nodes, indicating that they are edge nodes. Nodes 15 and 16 have passed through four nodes and are indicated as the farthest nodes. Only these edge nodes and the farthest nodes need to be used as destination nodes to perform data synchronization communication in a one-to-many manner.

[0069] like Figure 6As shown, the entire network topology node information synchronization can be completed by the optimal route and the fastest speed. For example, the first level: node 0 sends to nodes 1, 2, and 3; the second level: node 3 to 13, node 2 to nodes 5 and 7, node 1 to node 4; the third level: node 4 to nodes 8 and 9, node 5 to nodes 10 and 11, node 7 to nodes 6 and 12, and node 13 to 14; the fourth level: node 11 to node 16, node 6 to node 15. Each level of transmission is synchronized in parallel, receiving data from the previous level at the same time, and then sending it to the next level at the same time. This can reduce the time required for node traversal synchronization and achieve optimal path synchronization.

[0070] In another embodiment, when the source network node receives a transmission request to transmit data to the target network node, the source network node determines the target transmission path from the source network node to the target network node based on the full node information, including: when the source network node receives a transmission request to transmit data to the target network node, the source network node determines multiple communicative paths based on the local full node information; calculates the number of the network nodes of each of the communicative paths to obtain multiple node numbers; determines a preliminary target transmission path based on at least the multiple node numbers; and determines the preliminary target transmission path when the source network node receives only one transmission request. for the target transmission path; in the case that the source network node receives multiple transmission requests, the target transmission path is determined according to the multiple prepared target transmission paths corresponding to the multiple transmission requests. In this method, when the source network node receives a data transmission request, the step of determining the target transmission path according to the full-node information includes determining a communicable path, calculating the number of nodes, determining the prepared target transmission path, and finally determining the target transmission path. If there is only one-level transmission request, the prepared target transmission path is directly determined as the target transmission path. If there are multiple transmission requests, the final target transmission path is determined according to different prepared target transmission paths, thereby ensuring that data transmission is more stable and further improving data transmission efficiency.

[0071] In order to ensure that data transmission is more efficient and reliable and further improve networking efficiency, in one embodiment of the present application, a preliminary target transmission path is determined based on at least a plurality of the above-mentioned node numbers, including: comparing the above-mentioned node numbers of the above-mentioned plurality of communicative paths; in the case where there is only one above-mentioned communicative path with the least number of nodes, determining the above-mentioned communicative path with the least number of nodes as the above-mentioned preliminary target transmission path; in the case where there are multiple above-mentioned communicative paths with the least number of nodes, calculating the sum of the received signal strengths of all node pairs of the above-mentioned communicative paths with the least number of nodes, and obtaining multiple signal strength sums, the above-mentioned node pair being two adjacent network nodes on the above-mentioned communicative paths; comparing the above-mentioned signal strength sums, and determining the above-mentioned communicative path with the largest signal strength sum as the above-mentioned preliminary target transmission path.

[0072] As shown in Table 2, it can be generally considered that the fewer the total number of communication nodes passed, the shorter the communication path is, and the better the communication path is. By sorting the total number of communication nodes from small to large, the optional communication paths can be obtained from good to bad. If there are the same cumulative number of communication nodes, they are re-sorted from large to small according to the received signal strength, and all optional situations from the best to the worst communication paths can be obtained. Each transmission communication uses the first optimal path as the preferred path. If the transmission node detects that the next node has a fault, it will quickly bypass the faulty node according to the sorted Table 2 and select the node with the suboptimal path for transmission, which can ensure the stability of the system.

[0073] Table 2

[0074]

[0075] like Figure 5 As shown, if node 5 is the source node and node 12 is the destination node, the routes from 5 to 12 are optimally sorted in order: the first optional route: 5, 6, 12; the second optional route: 5, 2, 7, 12; the third optional route: 5, 2, 6, 12; the fourth optional route: 5, 6, 7, 12; the fifth optional route: 5, 6, 2, 7, 12; the ...th optional route: ...; the first optional path 5, 6, 12 after sorting is the shortest optimal communication path, and will be used as the preferred data transmission communication.

[0076] In order to ensure that the loading data packet is sent accurately and further ensure the accuracy of transmission, in one embodiment of the present application, the above-mentioned data packet is transmitted according to the above-mentioned target transmission path, including: generating a data sending node table according to the above-mentioned target transmission path, the above-mentioned data sending node table includes the above-mentioned network nodes at each level in the above-mentioned target transmission path; loading the above-mentioned data sending node table before the packet header of the above-mentioned data packet to form a loading data packet; transmitting the above-mentioned loading data packet according to the above-mentioned target transmission path, during the transmission process, after each of the above-mentioned network nodes receives the above-mentioned loading data packet, it determines whether the above-mentioned data packet is the above-mentioned data packet that should be received by the current above-mentioned network node according to the above-mentioned data sending node table, and when it is determined that it is the above-mentioned data packet that should be received by the current above-mentioned network node, the above-mentioned loading data packet is sent to the above-mentioned network node at the next level according to the above-mentioned data sending node table.

[0077] In order to further improve the transmission success rate of data packets, thereby making data transmission more efficient, in one embodiment of the present application, the data packets are transmitted according to the target transmission path, including: the network node detects whether there is a radio frequency signal within a preset distance range; when the radio frequency signal exists within the preset distance range, the network node continues to detect until the radio frequency signal does not exist within the preset distance range, and the network node sends the data packet to the network node of the next level according to the target transmission path; when the radio frequency signal does not exist within the preset distance range, the network node sends the data packet to the network node of the next level according to the target transmission path.

[0078] Specifically, when there are many data packets in the air, each level of node needs to obtain whether there are radio frequency transmission waves in the air through sniffing reception before forwarding data. It can make judgments and reactions in a very short time. If a radio frequency signal is detected in the air, it means that other data packets are being transmitted in the air within the preset range. The current node continues to sniff and wait for the data packet to be transmitted. Once it detects that there is no radio frequency transmission wave signal in the air, the current node immediately transmits data to the next node to ensure that it is transmitted at the fastest speed without signal conflict. This can reduce the problem of air data congestion and achieve low-latency communication transmission, thereby further improving transmission efficiency and networking efficiency.

[0079] In order to further improve the transmission efficiency, in one embodiment of the present application, in the case that the source network node receives multiple transmission requests, the target transmission path is determined according to the multiple prepared target transmission paths corresponding to the multiple transmission requests, including: in the case that the source network node receives multiple transmission requests, the multiple prepared target transmission paths are merged into the target transmission path, the non-public network nodes with the same ranking on the prepared target transmission path are the network nodes at the same level of the target transmission path, and the data packets are transmitted according to the target transmission path, including: the multiple data packets corresponding to the multiple transmission requests are merged into one data packet to obtain a merged data packet; and the merged data packet is transmitted according to the target transmission path.

[0080] As shown in Table 3, if it is a one-to-one transmission communication, then each level has only one sending node and one receiving node. If it is a node-to-multi-node transmission communication, then each level may have only multiple sending nodes and multiple receiving nodes. The transmission of each level is only responsible for the next node. The nodes at the same level will simultaneously send data packets to the corresponding next node. The specific details are determined according to the node path passed. The node needs to add the communication path table 3 before the data packet header to ensure that the data can be correctly forwarded after each node. After each level of forwarding, the forwarding level is automatically increased by 1. After each node receives the data packet, it determines whether it is the data packet of the current node. If it is, it will be forwarded to the next level. If not, the transmission at the node will be terminated to avoid unnecessary waste caused by multi-path forwarding. Each node forwards one by one, and the data packet header contains information about all the nodes passed.

[0081] Table 3

[0082]

[0083] like Figure 5As shown in the figure, for one-to-many communication, if node 5 needs to transmit two data messages to different destination nodes 7 and 12 respectively, the traditional approach is to send them in sequence through the optimal paths 5, 6, 7 and the optimal paths 5, 6, 12. This seems to be the optimal route, but it can be seen carefully that the two data packets have the same path 5, 6. The two data packets can be merged into one data packet and sent in parallel, that is, the route is optimized to 5, 6, 7 and 12. 7 and 12 will receive the data at the same time and then parse to obtain their own data packets, so that the route optimization is reduced from 4 transmissions to 2 transmissions, which greatly reduces the number of transmissions and increases communication efficiency; if node 2 needs to transmit two data messages to different destination nodes 8 and 12 respectively, the optimal paths are 2, 5, 4, 8 and the optimal paths 2, 7, 12 respectively. The two paths do not have a common transmission node. The traditional approach requires a total of 5 transmissions to forward them separately. This approach can still merge messages and send them simultaneously. The messages become synchronous forwarding, that is, 2, 5 (7), 10 (12), 8, and are only transmitted 3 times. Therefore, compared with the traditional approach, this method can improve transmission efficiency.

[0084] In order to enable the nodes in the network to establish more effective communication connections, thereby further ensuring the real-time and accuracy of the network topology, in one embodiment of the present application, the above-mentioned method also includes: when any instruction receives a network access request from a newly added network node, the above-mentioned full-node information is sent to the above-mentioned newly added network node; the above-mentioned newly added network node initiates a broadcast search instruction to search for all the above-mentioned network nodes within the third communication range; the above-mentioned newly added network node sequentially receives reply instructions sent sequentially by the above-mentioned network nodes that have received the above-mentioned broadcast search instructions, records the above-mentioned node information of each of the above-mentioned network nodes and updates it to the above-mentioned full-node information to obtain the first updated full-node information; the above-mentioned newly added network node forwards the above-mentioned first updated full-node information to each of the above-mentioned network nodes, and each of the above-mentioned network nodes, upon receiving the above-mentioned first updated full-node information, updates the above-mentioned full-node information to the above-mentioned first updated full-node information.

[0085] In order to help network nodes discover and handle faulty nodes more promptly, thereby further ensuring the stable operation of the network, in one embodiment of the present application, the above method also includes: when a predetermined network node sends information to the next network node and does not receive confirmation information returned by the next network node, determining that the next network node is a faulty node, and the above predetermined network node is any one of the network nodes; the above predetermined network node deletes the relevant information of the faulty node in the above full node information to obtain a second updated full node, and the above relevant information includes the node information of the faulty node and the information of the communication node representing the faulty node and the node information of the communication node; the above predetermined network node forwards the above second updated full node information to each of the above network nodes, and each of the above network nodes updates the above full node information to the above second updated full node information when receiving the above second updated full node information.

[0086] In order to enable those skilled in the art to more clearly understand the technical solution of the present application, the implementation process of the networking communication method of the present application will be described in detail below in conjunction with specific embodiments.

[0087] This embodiment relates to a specific networking communication method, including the following steps:

[0088] Step 1: The communication node of the head node initiates a broadcast search command, traverses all nodes in the search network, and when the network node receives the broadcast command issued by the network node at the upper level, it records the current time as the reference time, obtains the minimum beat cycle of the network node to transmit the command data, and calculates the beat time of the network node to send the reply command according to the reference time and the minimum beat cycle. The network node sends the reply command to the network node at the upper level that issued the broadcast command according to the beat time, and the network node sends the search command to the next level network node according to the beat time;

[0089] Step 2: The communication node of the head node receives the reply instructions sent by all network nodes of the broadcast search instruction in turn, and records the node information of each network node to obtain the node information of the communication node of the head node. The communication node of the head node sends the node information of the communication node obtained in the recording step to the head node, and repeats the repetitive process at least once in turn until the last network node transmits the node information of the corresponding communication node back to the head node in a tree shape, records the identification information and received signal strength of the network node, sorts the received signal strength from large to small, and deletes the nodes with signal strength less than -90dm to obtain updated record information;

[0090] Each node obtains the communication nodes within the communication range, and the head node obtains the communication information of each network node in the entire network and the corresponding received signal strength information. The head node establishes a network node topology node table based on the number of each network node, communication information and corresponding received signal strength;

[0091] Step 3: Find the edge nodes and the farthest nodes according to the data in the node topology table, and calculate multiple optimal paths by combining the permutation and sorting algorithms. Then, forward the topology node information table to all stop nodes according to the multiple optimal paths to synchronize the topology network node information.

[0092] Step 4: When the source network node receives a transmission request to transmit data to the target network node, the source network node determines multiple communicative paths based on the local full-node information, calculates the number of network nodes in each communication path, obtains multiple node numbers, determines a preliminary target transmission path based on at least the multiple node numbers, compares the node numbers of the multiple communicative paths, and in the case where there is only one communicative path with the least number of nodes, determines the communicative path with the least number of nodes as the preliminary target transmission path; in the case where there are multiple communicative paths with the least number of nodes, calculates the sum of the received signal strengths of all node pairs of each communicative path with the least number of nodes, obtains multiple signal strength sums, compares the multiple signal strength sums, determines the communicative path with the largest signal strength sum as the preliminary target transmission path, and in the case where the source network node receives only one transmission request, determines the preliminary target transmission path as the target transmission path; in the case where the source network node receives multiple transmission requests, merges the multiple preliminary target transmission paths into the target transmission path, thereby completing the topological network node networking;

[0093] Step 5: Generate a data sending node table according to the target transmission path, load the data sending node table before the header of the data packet to form a loaded data packet, and merge multiple loaded data packets corresponding to multiple transmission requests into one data packet to obtain a merged data packet, and transmit the merged data packet according to the target transmission path. During the transmission process, after each network node receives the loaded data packet, it determines whether the data packet is a data packet that should be received by the current network node according to the data sending node table. If it is determined that it is a data packet that the current network node should receive, the loaded data packet is sent to the next level of network node according to the data sending node table, and at the same time, it is determined whether the network node detects a radio frequency signal within a preset distance range. If there is a radio frequency signal within the preset distance range, the network node continues to detect until there is no radio frequency signal within the preset distance range. The network node sends the data packet to the next level of network node according to the target transmission path. If there is no radio frequency signal within the preset distance range, the network node sends the data packet to the next level of network node according to the target transmission path, thereby completing the data packet transmission communication and node forwarding;

[0094] Step 6: When a network node sends information to the next node, if it does not receive confirmation information, it determines that the next node is a faulty node. When a faulty node is found, the predetermined network node will delete the information related to the faulty node in the full node information, obtain the updated full node information, and then forward this information to other network nodes. After receiving this information, other network nodes will update their own full node information. When a network node receives a new node access request, it broadcasts a search instruction to obtain all network nodes within the communication range and updates the full node information process, thereby completing the new node access mechanism and network node fault detection mechanism.

[0095] Step 7: Determine whether the network topology table has changed. If so, re-execute the synchronization topology node information and the following process. Figure 7 shown.

[0096] It should be noted that Figures 3 to 6 The rectangular box in does not have any actual meaning. It is just a shape that frames all the network nodes together. It can also be other shapes.

[0097] It should be noted that the steps shown in the flowcharts of the accompanying drawings can be executed in a computer system such as a set of computer executable instructions, and that, although a logical order is shown in the flowcharts, in some cases, the steps shown or described can be executed in an order different from that shown here.

[0098] The embodiment of the present application also provides a networking communication device. It should be noted that the networking communication device of the embodiment of the present application can be used to execute the networking communication method provided by the embodiment of the present application. The device is used to implement the above-mentioned embodiments and preferred implementation modes, and the descriptions have been made and will not be repeated. As used below, the term "module" can implement a combination of software and / or hardware of a predetermined function. Although the device described in the following embodiments is preferably implemented in software, the implementation of hardware, or a combination of software and hardware, is also possible and conceived.

[0099] The following is an introduction to the networking communication device provided in the embodiments of the present application.

[0100] Figure 8 Schematic diagram of a networking communication device according to an embodiment of the present application. Figure 8 As shown, the device comprises:

[0101] The search unit 10 traverses and searches all network nodes starting from the head node in a predetermined order, so that each of the above network nodes obtains the corresponding subsequent node information. The above subsequent node information of the above network node includes at least the node information of the communication node. In the case that the above network node has a corresponding subsequent node, the above subsequent node information of the above network node also includes the above subsequent node information of the subsequent node. The above node information includes at least the identification information and the received signal strength of the above network node. The above communication node is a node that directly communicates with the corresponding above network node. The above subsequent node refers to the above network node at the subsequent level of the above communication node.

[0102] Specifically, all network nodes actively initiate broadcast search instructions starting from the head node, traversing and searching all nodes within the communication range. Each node that receives the wireless broadcast search instruction will reply with a wireless message to the transmitting node, so that each of the above network nodes obtains the corresponding back-node information. Finally, the head node obtains the communication information of each network node in the entire network and the corresponding received signal strength information.

[0103] Specifically, in the case where the above-mentioned network node has a corresponding subsequent node, the above-mentioned subsequent node information of the above-mentioned network node also includes the above-mentioned subsequent node information of the subsequent node. Suppose there is a network node A, its subsequent node is node B, and the subsequent node of node B is node C. According to the above situation, the subsequent node information of node A includes the information of node B, and the subsequent node information of node B includes the information of node C. Therefore, the subsequent node information of node A also includes the information of node C.

[0104] The forwarding unit 20, the head node forwards the full node information to the other network nodes, and the full node information includes the subsequent node information of the head node.

[0105] Specifically, after the head node has all the node information, it will synchronously forward all the node information to other nodes, so that each node can obtain all the node information in the network.

[0106] Determination unit 30, when the source network node receives a transmission request to transmit a data packet to the target network node, the source network node determines the target transmission path from the source network node to the target network node according to the all-node information, and transmits the data packet according to the target transmission path. The source network node is any one of the network nodes except the target network node.

[0107] Specifically, when a source network node receives a request to transmit a data packet to a target network node, the source network node determines a transmission path from itself to the target network node based on the global network topology information, and transmits the data packet to the target network node along the determined transmission path.

[0108] In the above-mentioned embodiment, first, all network nodes perform traversal search starting from the head node in a predetermined order, so that each of the above-mentioned network nodes obtains the corresponding subsequent node information. In the case that the above-mentioned network node has a corresponding subsequent node, the above-mentioned subsequent node information of the above-mentioned network node also includes the above-mentioned subsequent node information of the subsequent node; secondly, the above-mentioned head node forwards the full node information to each of the other above-mentioned network nodes; finally, in the case that the source network node receives a transmission request to transmit a data packet to the target network node, the above-mentioned source network node determines the target transmission path from the above-mentioned source network node to the above-mentioned target network node according to the above-mentioned full node information, and transmits the above-mentioned data packet according to the above-mentioned target transmission path. Compared with the prior art, the solution of the present application traverses the network nodes in a predetermined order to search and obtain the rear node information. After the head node obtains the full node information, the full node information is forwarded to other network nodes. That is, all network nodes can obtain the full node information. When any network node needs to transmit data, the point-to-point target transmission path can be determined according to the full node information, and the transmission data packet can be sent to the target node. That is, this method can realize point-to-point transmission and does not need to rely on the intermediate coordination equipment, thereby improving the communication efficiency and solving the problem of low communication efficiency caused by the inability to transmit point-to-point in the prior art.

[0109] In one embodiment of the present application, the search unit includes a first search module and a first recording module, wherein the first search module is used for the head node to initiate a broadcast search instruction to search for all the network nodes within the first communication range; the first recording module is used for the head node to sequentially receive the reply instructions sequentially sent by the network nodes that have received the broadcast search instruction, and record the node information of each network node to obtain the node information of the communication node of the head node. In this solution, the head node can obtain the node information of the communication node, realize the information exchange and data transmission between network nodes, and further avoid the signal conflict problem caused by multiple nodes replying to the instruction at the same time.

[0110] In order to further ensure the accuracy and completeness of the communication node information obtained by the head node, in one embodiment of the present application, the search unit also includes a second search module, a second recording module, a feedback module and an execution module, wherein the second search module is used for the search step, and the communication node of the above-mentioned head node initiates a broadcast search instruction to search all the above-mentioned network nodes within the second communication range; the second recording module is used for the recording step, and the communication node of the above-mentioned head node sequentially receives the reply instructions sent by all the above-mentioned network nodes that have received the above-mentioned broadcast search instruction, and records the above-mentioned node information of each of the above-mentioned network nodes to obtain the node information of the communication node of the above-mentioned head node; the feedback module is used for the feedback step, and the communication node of the above-mentioned head node sends the node information of the above-mentioned communication node obtained in the above-mentioned recording step to the above-mentioned head node; the execution module is used to repeat the repetitive process in sequence at least once until the last one of the above-mentioned network nodes sends the node information of the corresponding communication node The information is transmitted back to the head node in the tree form, so that the head node obtains the corresponding rear node information. After all the communication nodes of the previous level have completed the repetitive process, the communication nodes of the next level execute the repetitive process again. The repetitive process includes the search step, the recording step and the return step. In this scheme, a broadcast search instruction is initiated by the communication node of the head node to search all nodes within the communication range. Each node that receives the wireless broadcast search instruction replies to the communication node of the head node in turn. At this time, the communication node of the head node can receive the reply instructions of all nodes within the communication range in turn. At this time, the communication node of the head node can record each node and the corresponding node information, and send the node information recorded by the communication node of the head node to the head node, and repeat the sending in turn until the last network node sends the node information of its corresponding communication node to the head node. In this way, the head node can obtain the rear node information.

[0111] In order to further enable the network nodes to send reply instructions to the transmitting nodes in an orderly manner, thereby further reducing the conflict problem caused by multiple nodes replying to instructions at the same time, in one embodiment of the present application, the search unit also includes a third recording module, an acquisition module, a first calculation module and a first sending module, wherein the third recording module is used to record the current time as the reference time when the above-mentioned network node receives the above-mentioned broadcast search instruction issued by the above-mentioned network node at the upper level; the acquisition module is used to obtain the minimum beat period for the above-mentioned network node to send instruction data; the first calculation module is used to calculate the beat time for the above-mentioned network node to send the above-mentioned reply instruction based on the above-mentioned reference time and the minimum beat period; the first sending module is used for the above-mentioned network node to send the above-mentioned reply instruction to the above-mentioned network node at the upper level that issued the above-mentioned broadcast search instruction according to the above-mentioned beat time.

[0112] Specifically, when the above-mentioned network node receives the above-mentioned broadcast search instruction issued by the above-mentioned network node at the upper level, the current time is recorded as the reference time. As long as the nodes that can receive the search instruction within the communication range will use the time T0 of receiving the instruction of the transmitting node as the same reference time, and obtain the minimum beat period T of the network node transmitting the instruction data. Each node that receives the instruction will calculate the beat time Tx of the reply instruction based on the reference time T0 and the minimum beat period T, where Tx=T0+T*i. Each node that receives the wireless broadcast search instruction can reply instructions to the network node that issued the broadcast search instruction at the upper level in turn according to the beat time. This method further solves the signal conflict problem caused by multiple nodes replying to instructions at the same time by calculating the beat time and replying instructions to the network node that issued the broadcast search instruction at the upper level according to the calculated beat time.

[0113] In another embodiment, the search unit also includes a third search module, wherein the third search module is used for the above-mentioned network nodes at the same level to initiate the above-mentioned broadcast search instructions in sequence according to the above-mentioned beat time from short to long. In this scheme, the orderly networking is further ensured, thereby improving the efficiency and stability of the entire network system.

[0114] Specifically, each node that receives the broadcast search command will calculate the beat time Tx j (j=0,1,2,3...) as the new wireless broadcast search command initiator, use the same method to obtain all node information within the communication range in turn, and then send the information back to the upper-level node, thereby further solving the signal conflict problem caused by multiple nodes initiating broadcast search commands at the same time.

[0115] In order to further improve the communication effect and further ensure the effectiveness of communication, in one embodiment of the present application, the first recording module also includes a recording submodule, a sorting submodule and a deleting submodule, wherein the first recording submodule is used to record the identification information of each of the above-mentioned network nodes and the above-mentioned received signal strength to obtain recording information; the sorting submodule is used to sort the above-mentioned received signal strength in descending order to obtain sorting information; the deleting submodule is used to delete the node information of the above-mentioned network nodes whose received signal strength is less than the strength threshold from the above-mentioned recording information to obtain the updated above-mentioned recording information, and the updated above-mentioned recording information and the above-mentioned sorting information constitute the node information of the communication node of the above-mentioned head node or the communication node of the above-mentioned head node.

[0116] Specifically, the identification information of each node and the corresponding received signal strength are recorded, the received signal strengths are sorted from large to small, and all nodes with received signal strengths less than -90dbm are filtered out. At this point, the traversal search of this node is completed, and then the traversal search of the next node is continued until the traversal search of the last node is completed. After the traversal search of the entire network node is completed, the head node will obtain all node information and corresponding received signal strengths of the entire network, thereby further improving the networking efficiency.

[0117] In another embodiment, the forwarding unit includes a construction module and a forwarding module, wherein the construction module is used by the above-mentioned head node to construct a network node topology table based on the corresponding above-mentioned post-node information, and the above-mentioned network node topology table includes the identification information of the communication node of each of the above-mentioned network nodes and the received signal strength; the forwarding module is used by the above-mentioned head node to forward the above-mentioned network node topology table to the above-mentioned other network nodes. In this scheme, by representing the full node information in the form of a table, a more efficient network system is further constructed.

[0118] Specifically, the head node establishes the number of each network node, communication information and corresponding received signal strength into a large network node topology table.

[0119] In order to forward information as quickly as possible, thereby further improving networking efficiency, in one embodiment of the present application, the forwarding unit includes a first determination module, wherein the first determination module is used to determine edge nodes and farthest nodes according to the above-mentioned network node topology table, wherein the above-mentioned edge node is the above-mentioned network node with only one level of the above-mentioned communication node, and the above-mentioned farthest node is the above-mentioned network node that needs to pass through the most levels to receive the data of the above-mentioned head node; determine multiple optimal paths with the above-mentioned edge node and the above-mentioned farthest node as stop nodes and the above-mentioned head node as the start node, any two of the above-mentioned optimal paths pass through different intermediate network nodes, and all of the above-mentioned optimal paths pass through the above-mentioned network nodes covering all of the above-mentioned network nodes, and the above-mentioned intermediate network nodes are the other above-mentioned network nodes on the above-mentioned optimal path except the above-mentioned head node and the above-mentioned stop node; the above-mentioned head node forwards the above-mentioned network node topology table to all of the above-mentioned stop nodes according to the multiple above-mentioned optimal paths at the same time.

[0120] Specifically, the edge nodes and the farthest nodes are determined according to the network node topology table. The nodes with only one level of communication topology connection are found out through a queue loop based on the data in the node topology table, which are edge nodes. The nodes with the farthest communication distance from the head node are found out, which are the farthest nodes. The optimal path table is calculated by combining the permutation and sorting algorithms, and then the topology node information table is forwarded to each node according to the optimal node path, thereby realizing the synchronization of the entire network topology node information and further improving the networking efficiency.

[0121] In another embodiment, the determination unit includes a second determination module, a second calculation module, a third determination module, a fourth determination module and a fifth determination module, wherein the second determination module is used for, when the source network node receives a transmission request to transmit data to the target network node, the source network node determines a plurality of communicative paths according to the local full-node information; the second calculation module is used for calculating the number of the network nodes of each of the communicative paths to obtain a plurality of node numbers; the third determination module is used for determining a prepared target transmission path at least based on the plurality of node numbers; the fourth determination module is used for determining the prepared target transmission path as the target node when the source network node receives only one transmission request. The fifth determination module is used to determine the target transmission path according to the multiple prepared target transmission paths corresponding to the multiple transmission requests when the source network node receives multiple transmission requests. In this scheme, when the source network node receives a data transmission request, the step of determining the target transmission path according to the full-node information includes determining the communicable path, calculating the number of nodes, determining the prepared target transmission path, and finally determining the target transmission path. If there is only one level of transmission request, the prepared target transmission path is directly determined as the target transmission path. If there are multiple transmission requests, the final target transmission path is determined according to different prepared target transmission paths, thereby ensuring that data transmission is more stable and further improving data transmission efficiency.

[0122] In order to ensure that data transmission is more efficient and reliable and further improve networking efficiency, in one embodiment of the present application, the third determination module includes a first comparison submodule, a determination submodule, a calculation submodule and a second comparison submodule, wherein the first comparison submodule is used to compare the number of nodes of the above-mentioned multiple communicative paths; the determination submodule is used to determine that the above-mentioned communicative path with the least number of nodes is the above-mentioned prepared target transmission path when there is only one above-mentioned communicative path with the least number of nodes; the calculation submodule is used to calculate the sum of the received signal strengths of all node pairs of the above-mentioned communicative paths with the least number of nodes when there are multiple above-mentioned communicative paths with the least number of nodes, and obtain multiple signal strength sums, wherein the above-mentioned node pair is two adjacent network nodes on the above-mentioned communicative path; the second comparison submodule is used to compare the sums of the above-mentioned signal strengths and determine that the above-mentioned communicative path with the largest sum of the signal strengths is the above-mentioned prepared target transmission path.

[0123] In order to ensure that the loading data packet is sent accurately and further ensure the accuracy of transmission, in one embodiment of the present application, the determination unit includes a second sending module, a loading module and a first transmission module, wherein the second sending module is used to generate a data sending node table according to the above-mentioned target transmission path, and the above-mentioned data sending node table includes the above-mentioned network nodes at each level in the above-mentioned target transmission path; the loading module is used to load the above-mentioned data sending node table before the packet header of the above-mentioned data packet to form a loading data packet; the first transmission module is used to transmit the above-mentioned loading data packet according to the above-mentioned target transmission path. During the transmission process, after each of the above-mentioned network nodes receives the above-mentioned loading data packet, it determines whether the above-mentioned data packet is the above-mentioned data packet that should be received by the current above-mentioned network node according to the above-mentioned data sending node table. When it is determined that it is the above-mentioned data packet that should be received by the current above-mentioned network node, the above-mentioned loading data packet is sent to the above-mentioned network node at the next level according to the above-mentioned data sending node table.

[0124] In order to further improve the transmission success rate of data packets, thereby making data transmission more efficient, in one embodiment of the present application, the determination unit includes a judgment module, a detection module and a third sending module, wherein the judgment module is used by the above-mentioned network node to detect whether there is a radio frequency signal within a preset distance range; the detection module is used for, when the above-mentioned radio frequency signal exists within the above-mentioned preset distance range, the above-mentioned network node continues to detect until the above-mentioned radio frequency signal does not exist within the above-mentioned preset distance range, and the above-mentioned network node sends the above-mentioned data packet to the above-mentioned network node at the next level according to the above-mentioned target transmission path; the third sending module is used for, when the above-mentioned radio frequency signal does not exist within the above-mentioned preset distance range, the above-mentioned network node sends the above-mentioned data packet to the above-mentioned network node at the next level according to the above-mentioned target transmission path.

[0125] Specifically, when there are many data packets in the air, each level of node needs to obtain whether there are radio frequency transmission waves in the air through sniffing reception before forwarding data. It can make judgments and reactions in a very short time. If a radio frequency signal is detected in the air, it means that other data packets are being transmitted in the air within the preset range. The current node continues to sniff and wait for the data packet to be transmitted. Once it detects that there is no radio frequency transmission wave signal in the air, the current node immediately transmits data to the next node to ensure that it is transmitted at the fastest speed without signal conflict. This can reduce the problem of air data congestion and achieve low-latency communication transmission, thereby further improving transmission efficiency and networking efficiency.

[0126] In order to further improve the transmission efficiency, in one embodiment of the present application, the fifth determination module includes a merging sub-module, wherein the merging sub-module is used to merge the multiple above-mentioned prepared target transmission paths into the above-mentioned target transmission path when there are multiple above-mentioned transmission requests received by the above-mentioned source network node, and the above-mentioned non-public network nodes with the same ranking on the above-mentioned prepared target transmission path are the above-mentioned network nodes at the same level of the above-mentioned target transmission path; the determination unit includes a merging module and a second transmission module, wherein the merging module is used to merge the multiple above-mentioned data packets corresponding to the multiple above-mentioned transmission requests into one data packet to obtain a merged data packet; the second transmission module is used to transmit the above-mentioned merged data packet according to the above-mentioned target transmission path.

[0127] In order to enable the nodes in the network to establish more effective communication connections, thereby further ensuring the real-time and accuracy of the network topology, in one embodiment of the present application, the above scheme also includes: a fourth sending module, a fourth search module, a second recording module, and a first update module, wherein the fourth sending module is used to send the above-mentioned full-node information to the above-mentioned newly added network node when any instruction receives a network access request from the newly added network node; the fourth search module is used for the above-mentioned newly added network node to initiate a broadcast search instruction to search for all the above-mentioned network nodes within the third communication range; the second recording module is used for the above-mentioned newly added network node to sequentially receive the reply instructions sent in sequence by the above-mentioned network nodes that have received the above-mentioned broadcast search instructions, record the above-mentioned node information of each of the above-mentioned network nodes and update it to the above-mentioned full-node information to obtain the first updated full-node information; the first update module is used for the above-mentioned newly added network node to forward the above-mentioned first updated full-node information to each of the above-mentioned network nodes, and each of the above-mentioned network nodes, when receiving the above-mentioned first updated full-node information, updates the above-mentioned full-node information to the above-mentioned first updated full-node information.

[0128] In order to help network nodes discover and handle faulty nodes more promptly, thereby further ensuring the stable operation of the network, in one embodiment of the present application, the above scheme also includes a sixth determination module, a deletion module and a second update module, wherein the sixth determination module is used to determine that the next network node is a faulty node when the predetermined network node sends information to the next network node and does not receive confirmation information returned by the next network node, and the above predetermined network node is any one of the above network nodes; the deletion module is used for the predetermined network node to delete the relevant information of the faulty node in the above full node information to obtain a second updated full node, and the above relevant information includes the node information of the faulty node and the information of the communication node representing the faulty node and the node information of the communication node; the second update module is used for the predetermined network node to forward the second updated full node information to each of the above network nodes, and each of the above network nodes updates the above full node information to the second updated full node information when receiving the second updated full node information.

[0129] The above networking communication device includes a processor and a memory, and the above searching unit, forwarding unit and determination unit are all stored in the memory as program units, and the processor executes the above program units stored in the memory to implement corresponding functions. The above modules are all located in the same processor; or, the above modules are located in different processors in any combination.

[0130] The processor contains a kernel, which calls the corresponding program unit from the memory. One or more kernels can be set, and the networking efficiency can be improved by adjusting the kernel parameters.

[0131] The memory may include non-permanent memory in a computer-readable medium, random access memory (RAM) and / or non-volatile memory, such as read-only memory (ROM) or flash RAM, and the memory includes at least one memory chip.

[0132] An embodiment of the present invention provides a computer-readable storage medium, wherein the computer-readable storage medium includes a stored program, and when the program is executed, the device where the computer-readable storage medium is located is controlled to execute the network communication method, the method including:

[0133] Step S201, all network nodes are traversed and searched in a tree form in a predetermined order starting from the head node, so that each of the above network nodes obtains the corresponding back node information, the above back node information of the above network node includes at least the node information of the communication node, in the case that the above network node has a corresponding back node, the above back node information of the above network node also includes the above back node information of the back-level node, the above node information includes at least the identification information and the received signal strength of the above network node, the above communication node is a node that directly communicates with the corresponding above network node, and the above back-level node refers to the above network node at the next level of the above communication node.

[0134] Step S202: the head node forwards all node information to other network nodes, where the all node information includes the subsequent node information of the head node.

[0135] Step S203, when the source network node receives a transmission request to transmit a data packet to the target network node, the source network node determines the target transmission path from the source network node to the target network node based on the all-node information, and transmits the data packet according to the target transmission path. The source network node is any one of the network nodes except the target network node.

[0136] An embodiment of the present invention provides a processor, the processor is used to run a program, wherein the network communication method is executed when the program is running, and the method includes:

[0137] Step S201, all network nodes are traversed and searched in a tree form in a predetermined order starting from the head node, so that each of the above network nodes obtains the corresponding back node information, the above back node information of the above network node includes at least the node information of the communication node, in the case that the above network node has a corresponding back node, the above back node information of the above network node also includes the above back node information of the back-level node, the above node information includes at least the identification information and the received signal strength of the above network node, the above communication node is a node that directly communicates with the corresponding above network node, and the above back-level node refers to the above network node at the next level of the above communication node.

[0138] Step S202: the head node forwards all node information to other network nodes, where the all node information includes the subsequent node information of the head node.

[0139] Step S203, when the source network node receives a transmission request to transmit a data packet to the target network node, the source network node determines the target transmission path from the source network node to the target network node based on the all-node information, and transmits the data packet according to the target transmission path. The source network node is any one of the network nodes except the target network node.

[0140] An embodiment of the present invention provides a device, the device comprising a processor, a memory, and a program stored in the memory and executable on the processor, and when the processor executes the program, at least the following steps are implemented:

[0141] Step S201, all network nodes are traversed and searched in a tree form in a predetermined order starting from the head node, so that each of the above network nodes obtains the corresponding back node information, the above back node information of the above network node includes at least the node information of the communication node, in the case that the above network node has a corresponding back node, the above back node information of the above network node also includes the above back node information of the back-level node, the above node information includes at least the identification information and the received signal strength of the above network node, the above communication node is a node that directly communicates with the corresponding above network node, and the above back-level node refers to the above network node at the next level of the above communication node.

[0142] Step S202: the head node forwards all node information to other network nodes, where the all node information includes the subsequent node information of the head node.

[0143] Step S203, when the source network node receives a transmission request to transmit a data packet to the target network node, the source network node determines the target transmission path from the source network node to the target network node based on the all-node information, and transmits the data packet according to the target transmission path. The source network node is any one of the network nodes except the target network node.

[0144] The devices in this article can be servers, PCs, PADs, mobile phones, etc.

[0145] The present application also provides a computer program product, which, when executed on a data processing device, is suitable for executing a program for initializing at least the following method steps:

[0146] Step S201, all network nodes are traversed and searched in a tree form in a predetermined order starting from the head node, so that each of the above network nodes obtains the corresponding back node information, the above back node information of the above network node includes at least the node information of the communication node, in the case that the above network node has a corresponding back node, the above back node information of the above network node also includes the above back node information of the back-level node, the above node information includes at least the identification information and the received signal strength of the above network node, the above communication node is a node that directly communicates with the corresponding above network node, and the above back-level node refers to the above network node at the next level of the above communication node.

[0147] Step S202: the head node forwards all node information to other network nodes, where the all node information includes the subsequent node information of the head node.

[0148] Step S203, when the source network node receives a transmission request to transmit a data packet to the target network node, the source network node determines the target transmission path from the source network node to the target network node based on the all-node information, and transmits the data packet according to the target transmission path. The source network node is any one of the network nodes except the target network node.

[0149] Obviously, those skilled in the art should understand that the above modules or steps of the present invention can be implemented by a general computing device, they can be concentrated on a single computing device, or distributed on a network composed of multiple computing devices, they can be implemented by a program code executable by a computing device, so that they can be stored in a storage device and executed by the computing device, and in some cases, the steps shown or described can be executed in a different order than here, or they can be made into individual integrated circuit modules, or multiple modules or steps therein can be made into a single integrated circuit module for implementation. Thus, the present invention is not limited to any specific combination of hardware and software.

[0150] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented in one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that include computer-usable program code.

[0151] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0152] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0153] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0154] In a typical configuration, a computing device includes one or more processors (CPU), input / output interfaces, network interfaces, and memory.

[0155] The memory may include non-permanent memory in a computer-readable medium, random access memory (RAM) and / or non-volatile memory in the form of read-only memory (ROM) or flash RAM. The memory is an example of a computer-readable medium.

[0156] Computer readable media include permanent and non-permanent, removable and non-removable media that can be implemented by any method or technology to store information. Information can be computer readable instructions, data structures, program modules or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, compact disk read-only memory (CD-ROM), digital versatile disk (DVD) or other optical storage, magnetic cassettes and other magnetic storage devices or any other non-transmission media that can be used to store information that can be accessed by a computing device. As defined herein, computer readable media does not include temporary computer readable media (transitory media), such as modulated data signals and carrier waves.

[0157] It should also be noted that the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, commodity or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, commodity or device. In the absence of more restrictions, the elements defined by the sentence "comprises a ..." do not exclude the existence of other identical elements in the process, method, commodity or device including the elements.

[0158] From the above description, it can be seen that the above embodiments of the present application achieve the following technical effects:

[0159] In the above-mentioned embodiment, first, all network nodes perform traversal search starting from the head node in a predetermined order, so that each of the above-mentioned network nodes obtains the corresponding subsequent node information. In the case that the above-mentioned network node has a corresponding subsequent node, the above-mentioned subsequent node information of the above-mentioned network node also includes the above-mentioned subsequent node information of the subsequent node; secondly, the above-mentioned head node forwards the full node information to each of the other above-mentioned network nodes; finally, in the case that the source network node receives a transmission request to transmit a data packet to the target network node, the above-mentioned source network node determines the target transmission path from the above-mentioned source network node to the above-mentioned target network node according to the above-mentioned full node information, and transmits the above-mentioned data packet according to the above-mentioned target transmission path. Compared with the prior art, the solution of the present application traverses the network nodes in a predetermined order to search and obtain the rear node information. After the head node obtains the full node information, the full node information is forwarded to other network nodes. That is, all network nodes can obtain the full node information. When any network node needs to transmit data, the point-to-point target transmission path can be determined according to the full node information, and the transmission data packet can be sent to the target node. That is, this method can realize point-to-point transmission and does not need to rely on the intermediate coordination equipment, thereby improving the communication efficiency and solving the problem of low communication efficiency caused by the inability to transmit point-to-point in the prior art.

[0160] The above are only preferred embodiments of the present application and are not intended to limit the present application. For those skilled in the art, the present application may have various modifications and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application shall be included in the protection scope of the present application.

Claims

1. A networking communication method, characterized in that: include: All network nodes are traversed and searched in a predetermined order starting from the head node, so that each network node obtains corresponding subsequent node information, the subsequent node information of the network node includes at least node information of the communication node, and in the case where the network node has a corresponding subsequent node, the subsequent node information of the network node also includes the subsequent node information of the subsequent node, the node information includes at least identification information and received signal strength of the network node, the communication node is a node that directly communicates with the corresponding network node, and the subsequent node refers to the network node at the subsequent level of the communication node; The head node forwards the full node information to other network nodes, wherein the full node information includes the subsequent node information of the head node; When a source network node receives a transmission request to transmit a data packet to a target network node, the source network node determines a target transmission path from the source network node to the target network node based on the full node information, and transmits the data packet along the target transmission path. The source network node is any one of the network nodes except the target network node.

2. The networking communication method according to claim 1, characterized in that: All network nodes are searched in a predetermined order starting from the head node, so that each network node obtains corresponding subsequent node information, including: The head node initiates a broadcast search instruction to search for all the network nodes within the first communication range; The head node sequentially receives the reply instructions sequentially sent by the network nodes that have received the broadcast search instruction, and records the node information of each of the network nodes to obtain the node information of the communication node of the head node.

3. The networking communication method according to claim 1, characterized in that: All network nodes are searched in a predetermined order starting from the head node, so that each of the network nodes obtains corresponding subsequent node information, and further includes: A search step, wherein the communication node of the head node initiates a broadcast search instruction to search for all the network nodes within the second communication range; The recording step includes: the communication node of the head node sequentially receiving the reply instructions sent by all the network nodes that have received the broadcast search instruction, and recording the node information of each network node to obtain the node information of the communication node of the head node; A return step, in which the communication node of the head node sends the node information of the communication node obtained in the recording step to the head node; The repetitive process is repeated at least once in sequence until the last network node transmits the node information of the corresponding communication node back to the head node, so that the head node obtains the corresponding rear node information. After all the communication nodes of the previous level have completed the repetitive process, the communication nodes of the next level execute the repetitive process again. The repetitive process includes the searching step, the recording step and the returning step.

4. The networking communication method according to claim 2 or 3, characterized in that: The network nodes perform traversal search from the head node in a predetermined order so that each of the network nodes obtains corresponding subsequent node information, and further includes: When the network node receives the broadcast search instruction sent by the network node at the upper level, recording the current time as the reference time; Obtaining the minimum beat period of the network node transmitting instruction data; Calculate the beat time of the network node sending the reply instruction according to the reference time and the minimum beat period; The network node sends the reply instruction to the upper-level network node that issued the broadcast search instruction according to the takt time.

5. The networking communication method according to claim 4, characterized in that: All network nodes are searched in a predetermined order starting from the head node, so that each of the network nodes obtains corresponding subsequent node information, and further includes: The network nodes at the same level initiate the broadcast search instructions in sequence according to the beat time from short to long.

6. The networking communication method according to claim 1, characterized in that: Recording the node information of each of the network nodes to obtain the node information of the communication node of the head node or the communication node of the head node also includes: Recording the identification information of each of the network nodes and the received signal strength to obtain record information; Sorting the received signal strengths in descending order to obtain sorting information; The node information of the network node whose received signal strength is less than the strength threshold is deleted from the record information to obtain the updated record information. The updated record information and the sorting information constitute the node information of the communication node of the head node or the communication node of the head node.

7. The networking communication method according to claim 1, characterized in that: The head node forwards the full node information to each of the other network nodes, and the full node information includes the post-node information of the head node, including: The head node constructs a network node topology table according to the corresponding back node information, wherein the network node topology table includes identification information of the communication node and received signal strength of each network node; The head node forwards the network node topology table to each of the other network nodes.

8. The networking communication method according to claim 7, characterized in that: The head node forwards the network node topology table to each of the other network nodes, including: Determine the edge node and the farthest node according to the network node topology table, wherein the edge node is the network node with only one level of communication node, and the farthest node is the network node that needs to pass through the most levels to receive the data of the head node; Determine multiple optimal paths with the edge node and the farthest node as stop nodes and the head node as the start node, wherein the intermediate network nodes passed by any two of the optimal paths are different, and the network nodes passed by all the optimal paths cover all the network nodes, and the intermediate network nodes are the other network nodes on the optimal path except the head node and the stop node; The head node forwards the network node topology table to all the stop nodes simultaneously according to the multiple optimal paths.

9. The networking communication method according to claim 1, characterized in that: In a case where a source network node receives a transmission request to transmit data to a target network node, the source network node determines a target transmission path from the source network node to the target network node according to the full node information, including: In the case where the source network node receives a transmission request to transmit data to the target network node, the source network node determines a plurality of communicable paths according to the local full node information; Calculating the number of the network nodes of each of the communicable paths to obtain multiple node numbers; Determining a preliminary target transmission path based at least on the number of the plurality of nodes; In a case where the source network node receives only one transmission request, determining the prepared target transmission path as the target transmission path; In the case that the source network node receives a plurality of the transmission requests, the target transmission path is determined according to a plurality of the prepared target transmission paths corresponding to the plurality of the transmission requests.

10. The networking communication method according to claim 9, characterized in that: Determining a preliminary target transmission path according to at least a plurality of the node quantities comprises: comparing the number of nodes of a plurality of the communicable paths; In the case where there is only one communicable path with the least number of nodes, determining the communicable path with the least number of nodes as the prepared target transmission path; In the case where there are multiple communicative paths with the least number of nodes, the sum of received signal strengths of all node pairs of each communicative path with the least number of nodes is calculated to obtain multiple signal strength sums, wherein the node pair is two adjacent network nodes on the communicative path; Compare the sums of the signal strengths and determine the communicable path with the largest sum of the signal strengths as the prepared target transmission path.

11. The networking communication method according to claim 9, characterized in that: Transmitting the data packet according to the target transmission path includes: Generate a data sending node table according to the target transmission path, wherein the data sending node table includes the network nodes at each level in the target transmission path; Loading the data sending node table before the header of the data packet to form a loading data packet; The loading data packet is transmitted according to the target transmission path. During the transmission process, after each network node receives the loading data packet, it determines whether the data packet is the data packet that the current network node should receive according to the data sending node table. If it is determined that the data packet is the data packet that the current network node should receive, the loading data packet is sent to the network node at the next level according to the data sending node table.

12. The networking communication method according to claim 9, characterized in that: Transmitting the data packet according to the target transmission path includes: The network node detects whether there is a radio frequency signal within a preset distance range; In the case where the radio frequency signal exists within the preset distance range, the network node continues to detect until the radio frequency signal no longer exists within the preset distance range, and the network node sends the data packet to the network node at the next level according to the target transmission path; When the radio frequency signal does not exist within the preset distance range, the network node sends the data packet to the network node at the next level according to the target transmission path.

13. The networking communication method according to claim 9, characterized in that: In the case where the source network node receives multiple transmission requests, determining the target transmission path according to the multiple prepared target transmission paths corresponding to the multiple transmission requests, including: in the case where the source network node receives multiple transmission requests, merging the multiple prepared target transmission paths into the target transmission path, and the non-public network nodes with the same ranking on the prepared target transmission paths are the network nodes at the same level of the target transmission path, Transmitting the data packet according to the target transmission path includes: merging the multiple data packets corresponding to the multiple transmission requests into one data packet to obtain a merged data packet; and transmitting the merged data packet according to the target transmission path.

14. The networking communication method according to claim 1, characterized in that: The method further comprises: In the case where any one of the instructions receives a network access request from a newly added network node, sending the full node information to the newly added network node; The newly added network node initiates a broadcast search instruction to search for all the network nodes within a third communication range; The newly added network node sequentially receives the reply instructions sequentially sent by the network nodes that have received the broadcast search instruction, records the node information of each of the network nodes and updates it to the full node information, to obtain first updated full node information; The newly added network node forwards the first updated full node information to each of the network nodes, and each of the network nodes updates the full node information to the first updated full node information when receiving the first updated full node information.

15. The networking communication method according to claim 1, characterized in that: The method further comprises: When the predetermined network node sends information to the next network node and does not receive confirmation information returned by the next network node, determining that the next network node is a faulty node, and the predetermined network node is any one of the network nodes; The predetermined network node deletes the relevant information of the faulty node in the full node information to obtain a second updated full node, wherein the relevant information includes the node information of the faulty node and the information of the communication node representing the faulty node and the node information of the communication node; The predetermined network node forwards the second updated full node information to each of the network nodes, and each of the network nodes updates the full node information to the second updated full node information when receiving the second updated full node information.

16. A networking communication device, characterized in that: include: A search unit, all network nodes are traversed and searched in a predetermined order starting from the head node, so that each network node obtains corresponding subsequent node information, the subsequent node information of the network node includes at least node information of a communication node, and in the case where the network node has a corresponding subsequent node, the subsequent node information of the network node also includes the subsequent node information of a subsequent node, the node information includes at least identification information and received signal strength of the network node, the communication node is a node that directly communicates with the corresponding network node, and the subsequent node refers to the network node at the subsequent level of the communication node; A forwarding unit, wherein the head node forwards all node information to other network nodes, wherein the all node information includes the subsequent node information of the head node; A determination unit, in the case where a source network node receives a transmission request to transmit a data packet to a target network node, the source network node determines a target transmission path from the source network node to the target network node based on the all-node information, and transmits the data packet along the target transmission path, the source network node being any one of the network nodes except the target network node.

17. An electronic device, characterized in that: include: One or more processors, a memory, and one or more programs, wherein the one or more programs are stored in the memory and are configured to be executed by the one or more processors, and the one or more programs include a method for executing the networking communication method described in any one of claims 1 to 15.

Images