Network node management method and system based on digital networking

Abstract

The invention provides a network node management method and system based on a digital network, and relates to the technical field of the digital network, and the method comprises the steps: determining a root node according to the node state information in the digital network; according to the received registration request information of all the nodes, the root node creates a node information list and distributes the node information list to other nodes; the node sends a discovery message and updates a self one-hop neighbor node list and a self two-hop neighbor node list based on the received discovery message; updating a relay node list of the node according to the one-hop neighbor node list and the two-hop neighbor node list of the node; sending a topology control message through a relay node, and updating a self network topology table based on the received topology control message; according to the network topology table of the node, determining an optimal path from the node to other nodes and updating a routing table; and according to the node information list, determining a target node where the requested data is located through the data request node, and requesting the data to the target node based on a self routing table. The invention aims to improve the stability of a digital networking system.

Description

Technical Field

[0001] This application relates to the technical field of the Internet of Data (IOD), and in particular, to a method and system for network node management based on the Internet of Data. Background Art

[0002] With the development of information technology, the Internet of Data (IOD) has become the infrastructure connecting various digital devices and systems. Internet of Data nodes (NOIODs), such as sensors, smart terminals, servers, etc., are the infrastructure of various digital devices and systems. These nodes are usually distributed in different geographical regions and have a high degree of mobility and dynamics. At present, most of the management schemes for Internet of Data nodes (NOIODs) rely on a centralized management server. This method has many limitations in a large-scale and highly dynamic network environment. For example, the centralized management server is prone to single-point failures. Once the central node fails, the management and data transmission of the entire network will be affected, resulting in system paralysis. When the network topology changes frequently, the centralized management server needs to update the node status frequently, resulting in high communication overhead and latency. This not only increases the network burden but also reduces the system response speed. At the same time, as the number of Internet of Data nodes (NOIODs) increases, the load on the centralized management server will increase sharply, making it difficult to meet the expansion requirements of large-scale networks. Summary of the Invention

[0003] In view of this, this application provides a method and system for network node management based on the Internet of Data. The aim is to manage Internet of Data nodes in a decentralized manner to overcome or at least partially solve the above problems.

[0004] In the first aspect of this application, a method for network node management based on the Internet of Data is provided. The method includes: Determine the root node according to the status information of nodes in the Internet of Data; Create a node information list through the root node according to the received registration request information of all other nodes and distribute it to other nodes; Send discovery messages through each node, and based on the received discovery messages, the first receiving node updates its one-hop neighbor node list and two-hop neighbor node list; Determine the relay node of the node according to the one-hop neighbor node list and two-hop neighbor node list of the node and update the relay node list of the node; Send topology control messages through each relay node, and based on the received topology control messages, the second receiving node updates its network topology table; Determine the best path from the node to other nodes according to the network topology table of the node and update the routing table of the node; According to the node information list, determine the target node where the requested data is located through the data request node, and send a data request to the target node based on its own routing table.

[0005] Optionally, determine the root node according to the status information of the nodes in the data network, including: Determine the priority information of the node according to the first status information of the node, where the priority information includes a priority value, the node identifier of the node to which it belongs, and the node address of the node to which it belongs; Each node sends the determined priority information of itself to the elected priority confirmation node; Determine the target priority information with the highest priority value through the priority confirmation node; Determine the node corresponding to the target priority information as the root node.

[0006] Optionally, determining the target priority information with the highest priority value through the priority confirmation node includes: In the case where there are multiple pieces of priority information with the highest priority value, through the node identifier recorded in the priority information with the highest priority value, and send a priority confirmation request to the node corresponding to the node identifier; In response to the priority confirmation request, the node corresponding to the node identifier returns new priority information to the priority confirmation node for secondary priority confirmation, and the new priority information is determined by the node based on its own second status information; According to the received new priority information, determine the target priority information with the highest priority value among them.

[0007] Optionally, each node sends a discovery message, and based on the received discovery message, the first receiving node updates its one-hop neighbor node list and two-hop neighbor node list, including: Each node sends a discovery message, and the discovery message includes: the node identifier of the sending node, the message sequence number, the one-hop neighbor node list, and the resource status of the sending node; According to the received discovery message, determine whether the sending node that sent the discovery message exists in the one-hop neighbor node list of the first receiving node through the first receiving node; In the case where the sending node does not exist, record the sending node in the one-hop neighbor node list of the first receiving node, and update the two-hop neighbor node list of the first receiving node according to the one-hop neighbor node list of the sending node; In the case where the sending node exists, update the two-hop neighbor node list of the first receiving node according to the one-hop neighbor node list of the sending node.

[0008] Optionally, determining the relay node of the node and updating the relay node list of the node according to the one-hop neighbor node list and two-hop neighbor node list of the node includes: According to the one-hop neighbor node list and two-hop neighbor node list of the node, determining a target neighbor node in the one-hop neighbor node list that can cover the most uncovered two-hop neighbor nodes, where the two-hop neighbor nodes are the nodes in the two-hop neighbor node list; Determining the target neighbor node as the relay node of the node, and marking the two-hop neighbor nodes covered by the relay node as the covered state; Determining whether there are any uncovered two-hop neighbor nodes in the two-hop neighbor node list; If there are, determining a target neighbor node in the remaining one-hop neighbor nodes of the one-hop neighbor node list that can cover the most uncovered two-hop neighbor nodes; If not, ending the determination of the relay node of the node and obtaining the final relay node list of the node.

[0009] Optionally, determining the target neighbor node as the relay node of the node includes: Determining whether the target neighbor node is in a two-way link with the node; If the target neighbor node is in a two-way link with the node, determining the target neighbor node as the relay node of the node.

[0010] Optionally, according to the node information list, determining the target node where the requested data is located through the data request node, and making a data request to the target node based on its own routing table includes: Determining the target node where the requested data is located according to the resource information and address information of all nodes in the node information list; Determining the first best path between the data request node and the target node through the routing table of the data request node; Initiating a data request to the target node through the first best path; Based on the received data request, determining the second best path between itself and the data request node through the routing table of the target node; Returning the requested target data to the data request node through the second best path.

[0011] Optionally, the method further includes: Determining the corresponding survival time according to the transmission path length of the first best path; If the target data is not returned to the data request node within the survival time, ending the current request process.

[0012] Optionally, the method further includes: Determining whether discovery messages of neighbor nodes in the one-hop neighbor node list of a node are received within a preset time period; In the case where the discovery messages of the neighbor nodes are not received within the preset time period, removing the neighbor nodes from the one-hop neighbor node list of the node.

[0013] Optionally, the method further includes: In the case where a new node requests to join the digital networking, sending registration request information to any known registered node through the new node; According to the received registration request information, any registered node sends a discovery message to the new node; According to the received discovery message, the new node sends a discovery message to any registered node for registration and two-way link confirmation.

[0014] Optionally, the method further includes: Sending a time synchronization message to a relay node through a root node; Sending the time synchronization message through the relay node to synchronize the time of all nodes.

[0015] Optionally, the method further includes: Determining whether the root node in the digital networking fails; In the case where the root node fails, determining the node with the highest priority among the remaining nodes in the digital networking as the root node.

[0016] Optionally, the topology control message includes: the node identifier, message sequence number, and topology information of the relay node that sends the topology control message; the topology information includes: neighbor nodes covered by the relay node and link state information between the relay node and the covered neighbor nodes, and metadata information in the relay node.

[0017] A second aspect of the present application provides a network node management system based on digital networking, and the system includes: A root node determination module, configured to determine a root node according to the status information of nodes in the digital networking; A node information list creation module, configured to create a node information list according to the received registration request information of all other nodes and distribute it to other nodes; A discovery message distribution and neighbor node update module, configured to send discovery messages and update the one-hop neighbor node list and two-hop neighbor node list of the first receiving node itself based on the received discovery messages; A relay node list determination and update module, configured to determine relay nodes of the node and update the relay node list of the node according to the one-hop neighbor node list and two-hop neighbor node list of the node; A topology control message sending and topology update module, configured to send topology control messages and update the network topology table of the second receiving node itself based on the received topology control messages; A routing table update module, configured to determine the best path from the node to other nodes according to the network topology table of the node and update the routing table of the node; A data request module, configured to determine the target node where the requested data is located through a data request node according to the node information list and send a data request to the target node based on its own routing table.

[0018] Regarding the prior art, the present application has the following advantages: A network node management method based on a data network provided by the present application. First, according to the status information of nodes in the data network, a root node is determined; according to the received registration request information of all other nodes, a node information list is created by the root node and distributed to other nodes; discovery messages are sent by each node, and based on the received discovery messages, the first receiving node updates its one-hop neighbor node list and two-hop neighbor node list; according to the one-hop neighbor node list and two-hop neighbor node list of the node, relay nodes of the node are determined and the relay node list of the node is updated; topology control messages are sent by each relay node, and based on the received topology control messages, the second receiving node updates its network topology table; according to the network topology table of the node, the best path from the node to other nodes is determined and the routing table of the node is updated; according to the node information list, the target node where the requested data is located is determined through a data request node and a data request is sent to the target node based on its own routing table. Thus, by a decentralized method, relay nodes are selected from the data network node cluster to send topology control messages so that the entire data network can establish the network topology of the entire system. At the same time, the sending of topology control messages through relay nodes not only reduces the broadcast volume of the control topology messages of the entire system and improves network efficiency, but also the network topology and routing relationship of the entire system are jointly maintained with the participation of distributed nodes in the entire system, which can avoid the impact on the entire system after the central node fails in the centralized management method. At the same time, after the node status changes, the status is continuously propagated in the entire system with the joint participation of the neighboring nodes and relay nodes around the node. Compared with the prior art where the node status is updated by a centralized management server, the communication overhead and delay can be effectively reduced. At the same time, this method distributes the load of the entire system to each node in the system, so it can effectively meet the expansion requirements of large-scale networks.

[0019] The above description is only an overview of the technical solution of this application. In order to better understand the technical means of this application, it can be implemented according to the content of the specification. In order to make the above and other purposes, features, and advantages of this application more obvious and understandable, the following specific embodiments of this application are specifically given. Brief Description of the Drawings

[0020] In order to more clearly illustrate the technical solutions in the embodiments of this application or in the prior art, the following will briefly introduce the drawings required for use in the description of the embodiments or the prior art.

[0021] Figure 1 It is a flowchart of a method for managing network nodes based on the Internet of Data provided by an embodiment of this application; Figure 2 It is an architecture diagram of the Internet of Data system to which a method for managing network nodes based on the Internet of Data provided by an embodiment of this application is applied; Figure 3 It is a schematic diagram of node registration in a method for managing network nodes based on the Internet of Data provided by an embodiment of this application; Figure 4 It is a schematic diagram of the broadcast of topology control messages in a method for managing network nodes based on the Internet of Data provided by an embodiment of this application; Figure 5 It is a schematic diagram of the broadcast of discovery messages in a method for managing network nodes based on the Internet of Data provided by an embodiment of this application; Figure 6 It is a schematic diagram of new node registration in a method for managing network nodes based on the Internet of Data provided by an embodiment of this application; Figure 7 It is a schematic diagram of time synchronization in a method for managing network nodes based on the Internet of Data provided by an embodiment of this application; Figure 8 It is a flowchart of the operation of nodes in a method for managing network nodes based on the Internet of Data provided by an embodiment of this application; Figure 9 It is a schematic diagram of a system for managing network nodes based on the Internet of Data provided by an embodiment of this application. Detailed Embodiments

[0022] For ease of understanding, the relevant terms involved are first explained.

[0023] Internet of Data (IOD): It is a virtual data network based on the Internet. Through an open software architecture and standardized protocols, it efficiently connects various data platforms and systems, supports the interconnection, interoperability, and mutual operation of heterogeneous, different-domain, and different-owner data, and forms a data space of "data interconnection, on-demand scheduling, intra-domain autonomy, and inter-domain collaboration".

[0024] Digital Object (DO): It is a data structure for abstractly describing data resources, organizing and recording the data in a computer system according to basic elements such as identification, metadata, and data entities.

[0025] Node of Internet of Data (NOIOD): The Internet of Data is composed of multiple NOIODs. A NOIOD is a platform that includes software and services such as identification resolution and warehouses. A single NOIOD can provide application services for all users within this node and provide resolution services for other NOIODs.

[0026] Hello Message (Hello): Hello messages are used for neighbor discovery and neighbor status update. Each node periodically sends Hello messages to inform the neighboring nodes around it that it is still online and can communicate. Hello messages contain the node identification of the sending node, a list of neighbor nodes, and link quality information.

[0027] Topology Control Message (TC): Topology control messages are used to propagate network topology information. Each relay node periodically sends TC messages, which contain the node identification of this node, a list of neighbors, and their link quality information.

[0028] Exemplary embodiments of the present application will be described in more detail below with reference to the accompanying drawings.

[0029] Figure 1 It is a flowchart of a network node management method based on the Internet of Data provided for the embodiments of the present application. As Figure 1 shown, the method includes: Step S1: Determine the root node according to the status information of the nodes in the Internet of Data.

[0030] In this embodiment, as Figure 2 shown, Figure 2This is an architecture diagram of the digital networking system to which the network node management method based on digital networking provided by the embodiments of the present application is applied. The network node management method based on digital networking provided by the present application is applied to a digital networking constructed based on the digital object architecture. The digital networking consists of a large number of heterogeneous nodes, and the node forms include but are not limited to mobile terminals, sensors, embedded systems (such as smart home devices, industrial control devices, etc.). Each node includes a digital object (Digital Object, DO) identification system, a digital object registration system, and a digital object warehouse system. Nodes use the topology control messages sent and propagated between each other to ensure the connectivity and real-time performance of the entire network. According to the status information of each node in the digital networking, a node with the optimal status is determined as the root node to register other nodes. The status information includes but is not limited to the remaining resources of the node, the connection stability of the node, the degree centrality of the node in the network, etc.

[0031] Step S2: According to the received registration request information of all other nodes, create a node information list through the root node and distribute it to other nodes.

[0032] In this embodiment, as Figure 3 shown, Figure 3 This is a schematic diagram of node registration in the network node management method based on digital networking provided by the embodiments of the present application. The root node determined through step S1 receives the registration request information of all other nodes, and based on the information recorded in the registration request information, organizes and statistics the node information to create a node information list. The node information list records the address information of all nodes. The address information at least includes: node identification, which is the ID that uniquely identifies the node; node address, which is the network address of the node (such as IP address, port number); resource information, which is the digital object metadata managed by the node (such as data type, access permission, etc.). The root node distributes the created node information list to all registered nodes in the digital networking through broadcasting.

[0033] In this embodiment, to prevent abnormal nodes from registering to the digital networking system, the present application adds authentication information to the registration request information sent by other nodes to the root node. After the root node authenticates and passes the authentication information in the received registration request information, it registers the node corresponding to the registration request information to the digital networking system and records the address information of the node in the node information list. An optional implementation method is to generate tokens in advance and distribute them to legitimate nodes. When a node sends registration request information to the root node, add its own token as authentication information to the registration request information.

[0034] Step S3: Send discovery messages through each node, and based on the received discovery messages, the first receiving node updates its one-hop neighbor node list and two-hop neighbor node list.

[0035] In this embodiment, each node periodically sends a Hello message (i.e., a discovery message) to the neighbor nodes within its one-hop range. The discovery message carries at least the node identifier of the node itself and the one-hop neighbor node list of the node itself. Each node will receive the discovery messages sent by the neighbor nodes within its one-hop range. For the sake of description, the node that receives the discovery message is called the first receiving node. After receiving the discovery message, the first receiving node updates its one-hop neighbor node list and two-hop neighbor node list based on the information carried in the discovery message. The one-hop neighbor node list records the neighbor nodes that can reach the first receiving node through one hop, and the two-hop neighbor node list records the nodes that can reach the first receiving node through two hops. The two-hop neighbor node list is updated indirectly through the one-hop neighbor node list of other nodes carried in the discovery messages sent by other nodes received. Among them, the time interval for periodically sending discovery messages can be set according to the actual application scenario and is not specifically limited here.

[0036] Step S4: Determine the relay nodes of the node according to the one-hop neighbor node list and two-hop neighbor node list of the node, and update the relay node list of the node.

[0037] In this embodiment, an alternative implementation for determining the relay node of a node based on the one-hop neighbor list and two-hop neighbor list of the nodes in the digital networking and updating the relay node list of the node is as follows: Select, from the one-hop neighbor node list of the node, a one-hop neighbor node that can reach as many two-hop neighbor nodes of the node as possible in one hop as a relay node of the node. Herein, the one-hop neighbor node refers to a node in the one-hop neighbor node list of the node, and the two-hop neighbor node refers to a node in the two-hop neighbor node list of the node. While considering selecting a one-hop neighbor node that can cover as many two-hop neighbor nodes of the node as possible as the relay node during the process of selecting the relay node, the communication quality is also considered. That is, if there are multiple one-hop neighbor nodes of the node whose deviation in the number of two-hop neighbor nodes that can be covered by them is within a set range (such as a difference of 1 or a difference of 2, etc.), then the communication quality of these multiple one-hop neighbor nodes is further determined, and the one-hop neighbor node with the highest communication quality is selected as the relay node of the node. Herein, the one-hop neighbor node that can cover the two-hop neighbor node of the node mentioned herein means that when a one-hop neighbor node of the node (such as node A) can reach a two-hop neighbor node of the node (such as node B) in one hop, it is said that this two-hop neighbor node (i.e., node B) is covered by this one-hop neighbor node (i.e., node A). After determining the relay node of the node, it is determined whether the relay node exists in the relay node list of the node. If it does not exist, the relay node is added to the relay node list of the node. At the same time, when the one-hop neighbor list and two-hop neighbor list of the node change, the relay node is determined again through the same implementation for determining the relay node, and the relay node newly determined and not existing in the previous relay node list of the node is added to the relay node list of the node, while the node that exists in the previous relay node list of the node but is not determined as a relay node during the current process of re-determining the relay node is deleted from the relay node list.

[0038] Step S5: Send topology control messages through each relay node, and based on the received topology control messages, the second receiving node updates its own network topology table.

[0039] In this embodiment, as Figure 4 shown, Figure 4A schematic diagram of topology control message broadcasting in a network node management method based on a digital network provided in an embodiment of the present application, wherein each node determined as a relay node sends a topology control message, and each relay node sends a topology control message to its own one-hop neighbor node, and the topology control message sent by the relay node carries at least the connection topology relationship between the nodes in the digital network known to itself. The node that receives the topology control message is referred to as the second receiving node. It should be understood that the present application refers to the node that receives the discovery message as the first receiving node, and the node that receives the topology control message as the second receiving node is only for the convenience of description. In the case where a node in the digital network receives both the discovery message and the topology control message, the node belongs to both the first receiving node that receives the discovery message and the second receiving node that receives the topology control message. For the second receiving node that receives the topology control message sent by the relay node, it will update its own network topology table based on the received topology control message, and the network topology table records the connection topology relationship between the nodes in the digital network known to itself. In the case that the second receiving node that receives the topology control message is a relay node, the second receiving node not only updates its own network topology table, but also continues to forward the topology control message to its one-hop neighbor node to realize the diffusion of the topology control message; in the case that the second receiving node that receives the topology control message is not a relay node, the second receiving node only updates its own network topology table, and does not diffuse the topology control message.

[0040] In this embodiment, in the Internet of Things (IOD) system, the network carriers are various, so there is a situation where a certain node cannot directly reach another node, and the information must be transmitted through the node's transit mechanism. Simple broadcasting wastes too much resources and is not desirable. Therefore, this application transmits information by forming corresponding routing information, and the establishment of routing needs to be established by sending corresponding control messages. Since the number of network nodes in the Internet of Things (IOD) system is huge and widely distributed, this application further introduces relay nodes, selects key nodes among all nodes in the Internet of Things as relay nodes, and sends topology control messages through relay nodes, reducing unnecessary broadcasts, thereby optimizing the use of network resources, and achieving the purpose of establishing efficient routing according to the corresponding shortest path algorithm.

[0041] Step S6: Determine the best path from the node to other nodes according to the network topology table of the node, and update the routing table of the node.

[0042] In this embodiment, each node maintains a routing table corresponding to itself. The routing table records the best paths from the node itself to other nodes. The determination of the best paths needs to be calculated based on the network topology table of the node. Therefore, after the network topology table of the node changes, the best paths between the node and other nodes will be updated based on the updated network topology table of the node through corresponding algorithms. Among them, the algorithm is preferably the SPF (Shortest Path First) algorithm, and it can also be other alternative algorithms such as the Dijkstra shortest path algorithm. The node regularly checks whether the paths in the routing table are still valid. When it is found that a certain path is unreachable, the node recalculates the route and updates its own routing table.

[0043] Step S7: According to the node information list, the data request node determines the target node where the requested data is located and makes a data request to the target node based on its own routing table.

[0044] In this embodiment, the data request node queries the resource information in the node information list based on the data it wants to request to locate the target node. The target node refers to the node storing the data it wants to request. Subsequently, the best path between the data request node and the target node is determined according to the routing table of the data request node, and a data request is initiated to the target node through this best path. The data transmission adopts the Digital Object Interface Protocol (DOIP) to ensure the standardization of data encapsulation, parsing, and transmission.

[0045] A network node management method based on the digital networking provided by the present application. First, according to the status information of nodes in the digital networking, the root node is determined; according to the received registration request information of all other nodes, a node information list is created through the root node and distributed to other nodes; discovery messages are sent by each node, and based on the received discovery messages, the first receiving node updates its one-hop neighbor node list and two-hop neighbor node list; according to the one-hop neighbor node list and two-hop neighbor node list of the node, the relay node of the node is determined and the relay node list of the node is updated; topology control messages are sent by each relay node, and based on the received topology control messages, the second receiving node updates its network topology table; according to the network topology table of the node, the best path from the node to other nodes is determined and the routing table of the node is updated; according to the node information list, the data request node determines the target node where the requested data is located and makes a data request to the target node based on its own routing table. Thus, by a decentralized method, relay nodes are selected from the digital networking node cluster to send topology control messages so that the entire digital networking can establish the network topology of the entire system. At the same time, the sending of topology control messages through relay nodes not only reduces the broadcast volume of the control topology messages of the entire system, improves network efficiency, but also the network topology and routing relationship of the entire system are jointly maintained with the participation of distributed nodes in the entire system, which can avoid the impact on the entire system after the central node fails in the centralized management method. At the same time, after the node status changes, it is jointly participated by the neighbor nodes and relay nodes around the node to continuously spread its status in the entire system. Compared with the previous method where the centralized management server is used to update the node status, the communication overhead and delay can be effectively reduced. At the same time, this method distributes the load of the entire system to each node in the system, so it can effectively meet the expansion requirements of large-scale networks. Nodes dynamically update the neighbor node list based on discovery messages, update the network relay node based on the updated neighbor node list, dynamically update the network topology table based on the topology control messages of the relay node, and update the routing table of the node based on the updated network topology table, so as to be able to monitor the changes in the network topology of the digital networking in real time, and quickly adjust the routing strategy when a node failure is detected to ensure network connectivity and service quality, so that when a node fails, it is ensured that the failed node will not affect the communication between other nodes in the digital networking, thus achieving the effect of self-recovery.

[0046] Combined with the above embodiments, in an implementation manner, the embodiments of the present application further provide a network node management method based on the digital networking. In this network node management method based on the digital networking, step S1 may include steps S11 to S14: Step S11: Determine the priority information of a node according to the first status information of the node. The priority information includes a priority value, a node identifier of the node to which it belongs, and a node address of the node to which it belongs.

[0047] In this embodiment, an optional implementation manner for determining a root node based on the status information of nodes in the data networking is as follows: Based on its own first status information, a node calculates its own first status information through a corresponding priority determination algorithm to determine its own priority level, and generates the priority information of the node based on the determined priority level. The priority information of the node will record the priority value of the node, the node identifier of the node, and the node address of the node.

[0048] In this embodiment, the first status information at least includes: the remaining resources of the node, the connection stability of the node, and the degree centrality of the node in the network. It should be understood that the first status information may also include other status information that affects the performance of the node and thus affects its being determined as the root node. The expression of the priority determination algorithm is: , where P represents the priority value of the node, represents the weight corresponding to the i-th status information in the first status information of the node, represents the value of the i-th status information in the first status information of the node.

[0049] Step S12: Each node sends the determined priority information of itself to the elected priority confirmation node.

[0050] In this embodiment, a node is randomly elected from each node in the data networking as the priority confirmation node, and then each node sends the determined priority information of itself to the priority confirmation node.

[0051] Step S13: Determine the target priority information with the highest priority value through the priority confirmation node.

[0052] In this embodiment, after receiving the priority information of all nodes, the priority confirmation node determines one priority information with the highest priority value among them as the target priority information. The priority information of all nodes will include the priority information of the priority confirmation node.

[0053] Step S14: Determine the node corresponding to the target priority information as the root node.

[0054] In this embodiment, the node corresponding to the node identifier recorded in the determined target priority information is determined as the root node.

[0055] Combined with the above embodiments, in one implementation manner, the embodiments of the present application further provide a network node management method based on the data networking. In this network node management method based on the data networking, step S13 may include steps S131 to S133: Step S131: When it is determined that the priority information with the highest priority value includes multiple items, through the node identifier recorded in the priority information with the highest priority value, and send a priority confirmation request to the node corresponding to the node identifier.

[0056] In this embodiment, after the priority confirmation node receives the priority information of all nodes, it determines the priority information with the highest priority value among them. If it is determined that the priority values recorded in multiple pieces of priority information are the same and are all the highest priority values, at this time, the priority confirmation node will, based on the node addresses recorded in these pieces of priority information with the highest priority value, send a priority confirmation request to each node pointed to by these pieces of priority information.

[0057] Step S132: In response to the priority confirmation request, the node corresponding to the node identifier returns new priority information to the priority confirmation node for secondary priority confirmation, and the new priority information is determined by the node based on its own second status information.

[0058] In this embodiment, each node, in response to the priority confirmation request sent by the priority confirmation node, each node determines new priority information based on its own second status information. The new priority information will also record the priority value, node identifier, and node address, and send the determined new priority information to the priority confirmation node. Among them, the second status information includes various types of information involved in the first status information, and at least one of the computing power of the node, the reliability of the node, the stability of the node, and the response time of the node. By enriching the type of status information in the priority calculation process of the node, the calculation accuracy of the priority is improved.

[0059] Step S133: According to the received new priority information, determine the target priority information with the highest priority value among them.

[0060] In this embodiment, the priority confirmation node further determines the target priority information with the highest priority value among these new priority information according to the received new priority information. The present application first determines the priority value of the node through a small part of the status information, so as to effectively improve the efficiency of the root node determination process. And after there are multiple nodes with the same priority value, further and more accurate priority determination is performed on the multiple nodes with the same priority value, so as to ensure the accuracy of the root node determination.

[0061] Combined with the above embodiments, in one implementation, the embodiments of the present application further provide a method for managing network nodes based on the data networking. In the method for managing network nodes based on the data networking, step S3 may include steps S31 to S34: Step S31: Send discovery messages through each node. The discovery messages include: the node identifier of the sending node, the message sequence number, the list of one-hop neighbor nodes, and the resource status of the sending node.

[0062] In this embodiment, as Figure 5 shown, Figure 5 FIG. 9 is a schematic diagram of the discovery message broadcast in the method for managing network nodes based on the data networking provided by the embodiments of the present application. Each node periodically sends a Hello message (i.e., a discovery message) to the neighbor nodes within its one-hop range. The node that sends the discovery message is called the sending node. The discovery message includes the node identifier of the sending node, the message sequence number, the list of one-hop neighbor nodes, and the resource status of the sending node. Each node has a unique node identifier; the message sequence number is used to identify the newness of the message, and the receiving node will update the neighbor node list based on the latest received message; the list of one-hop neighbor nodes records the one-hop neighbor nodes of the node to which the list belongs; the resource status of the sending node includes at least the CPU utilization rate, the memory usage, etc.

[0063] Step S32: According to the received discovery message, determine whether the sending node that sends the discovery message exists in the list of one-hop neighbor nodes of the first receiving node.

[0064] In this embodiment, after the first receiving node receives the discovery message sent by the sending node, it parses the discovery message, determines the node identifier recorded therein, and further determines whether the sending node that sends the discovery message exists in the list of one-hop neighbor nodes of the first receiving node.

[0065] Step S33: In the case where the sending node does not exist, record the sending node in the list of one-hop neighbor nodes of the first receiving node, and update the list of two-hop neighbor nodes of the first receiving node according to the list of one-hop neighbor nodes of the sending node.

[0066] In this embodiment, in the case where the node identifier recorded in the discovery message does not exist in the list of one-hop neighbor nodes of the first receiving node, record the sending node corresponding to the node identifier in the list of one-hop neighbor nodes of the first receiving node, and record the relevant data recorded in the discovery message of the sending node. At the same time, update the list of two-hop neighbor nodes of the first receiving node based on the list of one-hop neighbor nodes in the discovery message.

[0067] Step S34: In the presence of the sending node, update the two-hop neighbor node list of the first receiving node according to the one-hop neighbor node list of the sending node.

[0068] In this embodiment, when the node identifier recorded in the discovery message exists in the one-hop neighbor node list of the first receiving node, the one-hop neighbor node list of the sending node may have changed compared with before. At this time, this application will also update the two-hop neighbor node list of the first receiving node based on the one-hop neighbor node list in the discovery message. At the same time, update the node status of the sending node in the one-hop neighbor node list of the first receiving node based on the discovery message of the sending node.

[0069] Combined with the above embodiments, in one implementation manner, the embodiments of this application further provide a network node management method based on the digital networking. In this network node management method based on the digital networking, step S4 may include steps S41 to S45: Step S41: According to the one-hop neighbor node list and the two-hop neighbor node list of the node, determine a target neighbor node in the one-hop neighbor node list that can cover the most uncovered two-hop neighbor nodes, where the two-hop neighbor nodes are the nodes in the two-hop neighbor node list.

[0070] In this embodiment, for each registered node, an alternative implementation of determining the relay node of the node according to the one-hop neighbor node list and the two-hop neighbor node list of the node is as follows: According to the one-hop neighbor node list and the two-hop neighbor node list of the node, determine a one-hop neighbor node in the one-hop neighbor node list that can cover the most uncovered two-hop neighbor nodes as the target neighbor node, where the two-hop neighbor nodes refer to the nodes in the two-hop neighbor node list of the node. That the one-hop neighbor node of the node can cover the two-hop neighbor node means that: if the one-hop neighbor node of the node (such as node A) can reach the two-hop neighbor node of the node (such as node B) in one hop, then it is determined that the one-hop neighbor node (i.e., node A) can cover the two-hop neighbor node (i.e., node 2). The uncovered two-hop neighbor nodes refer to: in any previous relay node determination process, the two-hop neighbor node has not been covered by the determined relay node, and at this time the state of the two-hop neighbor node is uncovered. For example, node a has two one-hop neighbor nodes b and c, and at the same time has three two-hop neighbor nodes d, e, and f. In the process of determining the one-hop neighbor node b as the relay node, the one-hop neighbor node can reach the two-hop neighbor node d in one hop, and the two-hop neighbor node d has not been determined to be covered by any other relay node. At this time, the state of the two-hop neighbor node d is uncovered. After determining the one-hop neighbor node b as the relay node, the two-hop neighbor node d will be determined to be covered by the one-hop neighbor node b, and the coverage state of the two-hop neighbor node d will become covered. At this time, the two-hop neighbor node d is no longer an uncovered node.

[0071] Step S42: Determine the target neighbor node as the relay node of the node, and mark the two-hop neighbor nodes covered by the relay node as the covered state.

[0072] In this embodiment, after determining the target neighbor node of the node through step S41, determine the target neighbor node as the relay node of the node, and mark the two-hop neighbor nodes covered by the new relay node determined through step S41 as the covered state.

[0073] Step S43: Determine whether there are any uncovered two-hop neighbor nodes in the two-hop neighbor node list.

[0074] In this embodiment, continue to determine whether there are still any uncovered two-hop neighbor nodes in the two-hop neighbor node list of the node.

[0075] Step S44: If any exist, determine a target neighbor node among the remaining one-hop neighbor nodes in the one-hop neighbor node list that can cover the most uncovered two-hop neighbor nodes.

[0076] In this embodiment, when it is determined that there are still uncovered two-hop neighbor nodes in the list of two-hop neighbor nodes of a node, one one-hop neighbor node that can cover the most uncovered two-hop neighbor nodes among the remaining one-hop neighbor nodes in the list of one-hop neighbor nodes of this node is also determined as the target neighbor node, and this two-hop neighbor node is also a node in the list of two-hop neighbor nodes of this node. The determined target neighbor node will also be determined as the relay node of this node (abbreviated as relay node X), and the two-hop neighbor nodes covered by the newly determined relay node (i.e., relay node X) are marked as covered.

[0077] Step S45: If not, end the determination of the relay node of the node and obtain the final relay node list of the node.

[0078] In this embodiment, when it is determined that there are no longer uncovered two-hop neighbor nodes in the list of two-hop neighbor nodes of a node, the determination process of the relay node of this node is completed at this time. All the newly determined relay nodes corresponding to this node can cover all the two-hop neighbor nodes of this node. At this time, a relay node list belonging to this node composed of all the determined new relay nodes is obtained.

[0079] In this embodiment, if multiple one-hop neighbor nodes can cover the same number of uncovered two-hop neighbor nodes, one of them is selected as the relay node according to a preset rule (such as the one with a smaller node identifier is preferred, node stability is preferred, etc.). When there are two-hop neighbor nodes that cannot be covered by any one-hop neighbor node (for example, due to a link problem), then these two-hop neighbor nodes may not be covered, and link recovery is performed at this time.

[0080] Combined with the above embodiments, in one implementation, the embodiments of the present application also provide a network node management method based on a digital networking. In this network node management method based on a digital networking, determining a target neighbor node as the relay node of the node includes: determining whether the target neighbor node is in a two-way link with the node; when the target neighbor node is in a two-way link with the node, determining the target neighbor node as the relay node of the node.

[0081] In this embodiment, in order to avoid problems in data transmission, the present application ensures that the one-hop neighbor node is in a two-way link state with the node when determining a one-hop neighbor node of the node as a relay node. If a one-hop neighbor node meets all other conditions that can be determined as a relay node, and the one-hop neighbor node does not maintain a two-way link state with the node, then the one-hop neighbor node will not be determined as a relay node. The determination method of the two-way link is: the node determines whether the one-hop neighbor node is in its one-hop neighbor node list. If it is determined that there is the one-hop neighbor node, it indicates that the node has received the one-hop neighbor node list of the one-hop neighbor node through a discovery message. The node will further determine whether the one-hop neighbor node is recorded in the one-hop neighbor node list of the one-hop neighbor node. If the node is recorded, it is determined that the one-hop neighbor node is in a two-way link state with the node. Specifically, after determining the target neighbor node of a node, it is further determined whether the target neighbor node is bidirectionally linked to the node; when the target neighbor node is bidirectionally linked to the node, the target neighbor node is determined to be the relay node of the node; if the target neighbor node is not bidirectionally linked to the node, a new relay node is re-determined, and the target neighbor node will not be determined as the relay node of the node.

[0082] In combination with the above embodiments, in one implementation, the present application embodiment further provides a network node management method based on a data network. In the network node management method based on a data network, step S7 may include steps S71 to S75: Step S71: Determine the target node where the requested data is located according to the resource information and address information of all nodes in the node information list.

[0083] In this embodiment, the data requesting node that initiates the request determines the metadata corresponding to the target data based on the target data it requests, and based on the metadata, determines the node pointed to by the metadata and the node address of the node by querying the node information list stored in itself, and determines the node pointed to by the metadata as the target node.

[0084] Step S72: Determine a first optimal path between the data requesting node and the target node through the routing table of the data requesting node.

[0085] In this embodiment, after determining the target node where the target data requested by itself is located, the best path from the data requesting node to the target node is found through the best path between itself and other nodes recorded in the routing table of the data requesting node. This best path is the first best path between the data requesting node and the target node.

[0086] Step S73: Initiate a data request to the target node via the first optimal path.

[0087] In this embodiment, based on the first best path between the determined data request node and the target node, a data request is initiated to the target node through the first best path to request and obtain target data.

[0088] Step S74: Based on the received data request, determine the second best path between itself and the data request node through the routing table of the target node.

[0089] In this embodiment, the target node responds to the data request initiated by the received data request node, finds the target data requested by the data request node, and at the same time, based on this data request, the target node finds the best path from itself to the data request node through the best paths between itself and each other node recorded in its routing table. This best path is the second best path between the target node and the data request node. Since the states of each node in the data networking are constantly changing and the routing tables of the nodes will also change accordingly, the first best path and the second best path may be the same or different.

[0090] Step S75: Return the requested target data to the data request node through the second best path.

[0091] In this embodiment, based on the determined second best path, the target node returns the target data requested by the data request node to the data request node.

[0092] Combined with the above embodiments, in one implementation, the embodiments of the present application further provide a method for managing network nodes based on a data networking. In this method for managing network nodes based on a data networking, the method further includes: determining the corresponding survival time according to the transmission path length of the first best path; ending the current request process in the case where the target data is not returned to the data request node within the survival time.

[0093] In this embodiment, to prevent network congestion and resource waste caused by infinite packet loops, after determining the first best path between the data request node and the target node, the present application determines the survival time corresponding to the first best path based on the first best path. This survival time takes into account not only the first best path but also the second best path for the target node to return the target data. Since the data request node cannot know the transmission path length of the second best path for the target node to return the target data, the way to consider the second best path for the target node to return the target data in this survival time is to estimate the transmission path length of the possible second best path based on the first best path. An optional implementation is to use the transmission path length of the first best path as the base number, and multiply the base number by a preset percentage to obtain the result as the transmission path length of the second best path. Then, based on the transmission path length of the first best path and the estimated transmission path length of the second best path, the number of hops greater than or equal to the sum of the transmission path length of the first best path and the estimated transmission path length of the second best path is determined as the corresponding survival time. This survival time is recorded in the data request initiated by the data request node. At the same time, after the data request reaches the target node, the remaining survival time is recorded in the target data. If the target data has not been returned to the data request node after the survival time is consumed, the current request process is ended.

[0094] Combined with the above embodiments, in one implementation, the embodiments of the present application also provide a network node management method based on the data network. In this network node management method based on the data network, the method further includes: determining whether a discovery message of a neighbor node in the one-hop neighbor node list of the node is received within a preset duration; in the case where the discovery message of the neighbor node is not received within the preset duration, removing the neighbor node from the one-hop neighbor node list of the node.

[0095] In this embodiment, the node monitors the status of the one-hop neighbor nodes in its own one-hop neighbor node list to determine whether a discovery message of a one-hop neighbor node in its own one-hop neighbor node list is received within the preset duration. In the case where the discovery message sent by a one-hop neighbor node in its own one-hop neighbor node list is not received within the preset duration, it is determined that the one-hop neighbor node may be offline, and the one-hop neighbor node is removed from the one-hop neighbor node list of the node. Wherein, the preset duration is greater than the periodic duration for the node to send periodic discovery messages. Or the node status is monitored through a heartbeat mechanism. In the case where it is determined through the heartbeat mechanism that a one-hop neighbor node in its own one-hop neighbor node list is offline, the one-hop neighbor node is removed from the one-hop neighbor node list of the node.

[0096] Combined with the above embodiments, in one implementation manner, the embodiments of the present application further provide a method for managing network nodes based on the Internet of Data. In this method for managing network nodes based on the Internet of Data, the method further includes: when a new node requests to join the Internet of Data, sending a registration request message to any known registered node through the new node; according to the received registration request message, the any registered node sends a discovery message to the new node; according to the received discovery message, the new node sends a discovery message to the any registered node for registration and two-way link confirmation.

[0097] In this embodiment, as Figure 6 shown, Figure 6 is a schematic diagram of new node registration in a method for managing network nodes based on the Internet of Data provided by the embodiments of the present application. When a new node requests to join the Internet of Data, the new node sends a registration request message to any registered node that it knows and has been registered in the Internet of Data. After receiving the registration request message, the any registered node sends a discovery message to the new node, and the new node responds to the received discovery message by sending a discovery message to the any registered node to achieve registration of the new node and two-way link confirmation. After the new node completes registration, the new node will establish neighbor relationships with other nodes in the Internet of Data and store a node information list, which is a new node information list including the address information of the new node. After the addition of a new node, the node information lists of all nodes in the Internet of Data will be updated.

[0098] In this embodiment, the new node has established connections with at least one node in the Internet of Data, and this node will broadcast the existence and status information of the new node to the entire network through periodic topology control messages. Each node that receives the topology control message will update its routing table according to the information of the new node contained therein to ensure that all nodes can correctly forward data to the new node. As the topology control messages continue to spread, eventually all nodes in the entire network will be aware of the addition of the new node and will be able to communicate with it directly or indirectly when necessary.

[0099] Combined with the above embodiments, in one implementation manner, the embodiments of the present application further provide a method for managing network nodes based on the Internet of Data. In this method for managing network nodes based on the Internet of Data, the method further includes: sending a time synchronization message to a relay node through a root node; sending the time synchronization message through the relay node to synchronize the time of all nodes.

[0100] In this embodiment, in the Internet of Data (IOD), some scenarios especially focus on the time consistency between nodes (such as financial transactions, real-time communication, etc.). Therefore, the present application performs time synchronization operations through the root node. Specifically: asFigure 7 As shown Figure 7 FIG. is a schematic diagram of time synchronization in a network node management method based on a data network provided by an embodiment of the present application. The root node periodically sends time synchronization messages to the relay node for time synchronization, and the relay node broadcasts the received time synchronization messages to other nodes in the entire data network, so that all nodes in the entire data network can perform time synchronization, which not only improves the overall performance of the system, but also enhances the user experience. Another optional time synchronization method is to use NTP (Network Time Protocol) for time synchronization.

[0101] Combined with the above embodiments, in one implementation, the embodiment of the present application further provides a network node management method based on a data network. In the network node management method based on the data network, the method further includes: determining whether the root node in the data network fails; in the case where the root node fails, determining the node with the highest priority among the remaining nodes in the data network as the root node.

[0102] In this embodiment, since the root node in the data network needs to perform time synchronization periodically, it is necessary to ensure the normal operation of the root node. The present application monitors the status of the root node in real time. In the case where it is determined that the root node fails, a node with the highest priority value is selected from the remaining nodes in the data network as the new root node to implement the functions of the root node. Among them, the implementation manner of selecting the node with the highest priority value is the same as the above implementation manner, that is, the priority confirmation node is first elected, and then the elected priority confirmation node compares and confirms the priority values of each node, so as to obtain the node with the highest priority value through comparison.

[0103] Combined with the above embodiments, in one implementation, the embodiment of the present application further provides a network node management method based on a data network. In the network node management method based on the data network, the topology control message includes: the node identifier of the relay node sending the topology control message, the message sequence number, and the topology information; the topology information includes: the neighbor nodes covered by the relay node and the link state information between itself and the covered neighbor nodes, and the metadata information in the relay node.

[0104] In this embodiment, the topology control message sent by the relay node includes: the node identifier of the relay node, the message sequence number, and the topology information. The topology information includes: the neighbor nodes covered by the relay node sending the topology control message and the link state information (such as link bandwidth, link delay) between itself and the covered neighbor nodes, and the metadata information in the relay node. The metadata information in the relay node includes the metadata information of all neighbor nodes covered by itself and itself.

[0105] In this embodiment, as Figure 8 shown, Figure 8 Figure 0000304 is a flowchart of the operation of a node in a network node management method based on a digital network provided by an embodiment of the present application. After the node is started, the registration request function is enabled, and then it is determined whether the node itself belongs to the selected root node. When the node belongs to the root node, it receives the registration request information sent by other nodes to create a node information list and distributes it to other nodes. When the node does not belong to the root node, it sends the registration request information to the root node for node registration. When the registration of all nodes in the digital network is completed, each node in the digital network periodically sends discovery messages to its one-hop neighbor nodes. After the node receives the discovery messages sent by other nodes, it parses the discovery messages and updates its one-hop neighbor node list and two-hop neighbor node list based on the information carried in the discovery messages. Then, the node determines its relay nodes based on its latest one-hop neighbor node list and two-hop neighbor node list and updates its relay node list. The nodes determined as relay nodes periodically send topology control messages to their one-hop neighbor nodes. When a node receives the topology control messages sent by other nodes, it updates its network topology table based on the topology control messages and updates its routing table based on the updated network topology table. When a node receives the topology control messages sent by other nodes and the node belongs to a relay node, the node not only updates its network topology table based on the received topology control messages and updates its routing table based on the updated network topology table, but also continues to broadcast the received topology control messages to its one-hop neighbor nodes. The node receives the time synchronization messages broadcast by other nodes and performs time synchronization based on the received time synchronization messages. It determines whether the node itself has a service request (such as a data request service, etc.). If there is a service request, it executes the corresponding service request.

[0106] Based on the same inventive concept, the present application provides a network node management system based on a digital network, as Figure 9 shown. The system 900 includes: A root node determination module 901, configured to determine a root node according to the status information of nodes in the digital network; A node information list creation module 902, configured to create a node information list according to the registration request information received from all other nodes and distribute it to other nodes; A discovery message distribution and neighbor node update module 903, configured to send discovery messages and update the one-hop neighbor node list and two-hop neighbor node list of the first receiving node itself based on the received discovery messages; The relay node list determination and update module 904 is configured to determine the relay nodes of the node according to the one-hop neighbor node list and two-hop neighbor node list of the node, and update the relay node list of the node; The topology control message sending and topology update module 905 is configured to send topology control messages, and update the network topology table of the second receiving node itself based on the received topology control messages; The routing table update module 906 is configured to determine the best paths from the node to other nodes according to the network topology table of the node, and update the routing table of the node; The data request module 907 is configured to determine the target node where the requested data is located through the data request node according to the node information list, and send a data request to the target node based on its own routing table.

[0107] Optionally, the root node determination module 901 includes: The priority determination module is configured to determine the priority information of the node according to the first status information of the node, where the priority information includes a priority value, the node identifier of the belonging node, and the node address of the belonging node; The information sending module is configured to send the determined priority information of itself to the elected priority confirmation node; The target priority information determination module is configured to determine the target priority information with the highest priority value through the priority confirmation node; wherein, each node has a target priority information determination module, and this module is enabled to determine the target priority information after the node is elected as the priority confirmation node; The root node determination sub-module is configured to determine the node corresponding to the target priority information as the root node, where each node has a root node determination sub-module, and this module is enabled to determine the root node after the node is elected as the priority confirmation node.

[0108] Optionally, the target priority information determination module includes: The request module is configured to, when there are multiple priority information with the highest priority value, send a priority confirmation request to the node corresponding to the node identifier recorded in the priority information with the highest priority value; The response module is configured to, in response to the priority confirmation request, return new priority information from the node corresponding to the node identifier to the priority confirmation node for secondary priority confirmation, where the new priority information is determined by the node based on its own second status information; The target priority information determination module is configured to determine the target priority information with the highest priority value among the received new priority information.

[0109] Optionally, the discovery message distribution and neighbor node update module 903 includes: A discovery message distribution module for sending discovery messages, where the discovery messages include: the node identifier of the sending node, the message sequence number, the list of one-hop neighbor nodes, and the resource status of the sending node; A first update module for determining whether the sending node that sent the discovery message exists in its own list of one-hop neighbor nodes according to the received discovery message; A second update module for, in the case where the sending node does not exist, recording the sending node in the list of one-hop neighbor nodes of the first receiving node, and updating the list of two-hop neighbor nodes of the first receiving node according to the list of one-hop neighbor nodes of the sending node; A third update module for, in the case where the sending node exists, updating the list of two-hop neighbor nodes of the first receiving node according to the list of one-hop neighbor nodes of the sending node.

[0110] Optionally, the relay node list determination and update module 904 includes: A target neighbor node determination module for determining a target neighbor node in the list of one-hop neighbor nodes that can cover the most uncovered two-hop neighbor nodes according to the list of one-hop neighbor nodes and the list of two-hop neighbor nodes of the node, where the two-hop neighbor nodes are the nodes in the list of two-hop neighbor nodes; A first relay node determination module for determining that the target neighbor node is the relay node of the node and marking the two-hop neighbor nodes covered by the relay node as the covered state; A coverage determination module for determining whether there are uncovered two-hop neighbor nodes in the list of two-hop neighbor nodes; A target neighbor node determination module for, in the case where there are, determining a target neighbor node in the remaining one-hop neighbor nodes of the list of one-hop neighbor nodes that can cover the most uncovered two-hop neighbor nodes; A relay node list update module for, in the case where there are not, ending the determination of the relay nodes of the node and obtaining the final relay node list of the node.

[0111] Optionally, the first relay node determination module includes: A two-way link determination module for determining whether the target neighbor node and the node are in a two-way link; A first relay node determination sub-module for, in the case where the target neighbor node and the node are in a two-way link, determining that the target neighbor node is the relay node of the node.

[0112] Optionally, the data request module 907 includes: A target node determination module, configured to determine a target node where the requested data is located according to the resource information and address information of all nodes in the node information list; A first optimal path determination module, configured to determine a first optimal path between the data request node and the target node through the routing table of the data request node; A data request initiation module, configured to initiate a data request to the target node through the first optimal path; A second optimal path determination module, configured to determine a second optimal path between itself and the data request node through the routing table of the target node based on the received data request; A data feedback module, configured to return the requested target data to the data request node through the second optimal path.

[0113] Optionally, the system 900 further includes: A survival time determination module, configured to determine a corresponding survival time according to the transmission path length of the first optimal path; A request end module, configured to end the current request process if the target data is not returned to the data request node within the survival time.

[0114] Optionally, the system 900 further includes: A discovery message determination module, configured to determine whether a discovery message of a neighbor node in the one-hop neighbor node list of a node is received within a preset duration; A node removal module, configured to remove the neighbor node from the one-hop neighbor node list of the node if the discovery message of the neighbor node is not received within the preset duration.

[0115] Optionally, the system 900 further includes: A registration module for a new node, configured to send a registration request message to any known registered node when a new node requests to join the data network; A discovery message sending module of the any registered node, configured to send a discovery message to the new node according to the received registration request message; A discovery message sending module of the new node, configured to send a discovery message to the any registered node for registration and two-way link confirmation according to the received discovery message.

[0116] Optionally, the system 900 further includes: A first time synchronization module, configured to send a time synchronization message to a relay node through a root node; A second time synchronization module, configured to send the time synchronization message through the relay node to synchronize the time of all nodes.

[0117] Optionally, the system 900 further includes: A node failure determination module, configured to determine whether the root node in the digital network is faulty; A root node determination module, configured to determine the node with the highest priority among the remaining nodes in the digital network as the root node in the case where the root node is faulty.

[0118] Optionally, the topology control message in the topology control message sending and topology update module 905 includes: the node identifier of the relay node sending the topology control message, the message sequence number, and topology information; the topology information includes: the neighbor nodes covered by the relay node and the link state information between the relay node and the covered neighbor nodes, as well as the metadata information in the relay node.

[0119] For the system embodiment, since it is basically similar to the method embodiment, the description is relatively simple. For related parts, refer to the partial description of the method embodiment.

[0120] It should be noted that, for the method embodiment, for simplicity of description, it is all expressed as a series of action combinations. However, those skilled in the art should know that the embodiments of the present application are not limited by the described action sequence, because according to the embodiments of the present application, certain steps can be performed in other sequences or simultaneously. Secondly, those skilled in the art should also know that the embodiments described in the specification are all preferred embodiments, and the actions involved are not necessarily required by the embodiments of the present application.

[0121] Each embodiment in this specification is described in a progressive manner. The key point of each embodiment is to illustrate the differences from other embodiments. The same or similar parts among the embodiments can be referred to each other.

[0122] Those skilled in the art should understand that the embodiments of the present application can be provided as a method, a system, or a computer program product. Therefore, the embodiments of the present application can take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware aspects. Moreover, the embodiments of the present application can take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0123] Embodiments of the present application are described with reference to the flowcharts and / or block diagrams of methods, terminal devices (systems), and computer program products according to embodiments of the present application. It should be understood that each flow and / or block in the flowchart and / or block diagram, as well as the combination of flows and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to the processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing terminal devices to generate a machine, such that the instructions executed by the processor of the computer or other programmable data processing terminal devices generate a device for implementing the functions specified in one flow Figure 1 one flow or multiple flows and / or blocks Figure 1 or multiple blocks.

[0124] These computer program instructions can also be stored in a computer-readable memory that can direct a computer or other programmable data processing terminal device to work in a specific manner, such that the instructions stored in the computer-readable memory generate a manufactured article including an instruction device that implements the functions specified in one flow Figure 1 one flow or multiple flows and / or blocks Figure 1 or multiple blocks.

[0125] These computer program instructions can also be loaded onto a computer or other programmable data processing terminal device, such that a series of operation steps are executed on the computer or other programmable terminal device to generate a computer-implemented process, and thus the instructions executed on the computer or other programmable terminal device provide steps for implementing the functions specified in one flow Figure 1 one flow or multiple flows and / or blocks Figure 1 or multiple blocks.

[0126] Although the preferred embodiments of the embodiments of the present application have been described, those skilled in the art can make additional changes and modifications once they learn the basic creative concepts. Therefore, the appended claims are intended to be construed as including the preferred embodiments and all changes and modifications falling within the scope of the embodiments of the present application.

[0127] Finally, it should also be noted that in this text, relational terms such as first and second are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any actual relationship or order between these entities or operations. Moreover, the term "comprising", "including" or any other variant thereof is intended to cover non-exclusive inclusion, such that a process, method, article or terminal device comprising a series of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such process, method, article or terminal device. Without further limitation, an element defined by the statement "comprising an..." does not exclude the presence of additional identical elements in the process, method, article or terminal device comprising the element.

[0128] The above provides a detailed introduction to a network node management method and system based on the digital internetwork. Specific examples are used in this text to elaborate on the principles and implementation manners of the present application. The description of the above embodiments is only used to help understand the method and its core idea of the present application; at the same time, for those of ordinary skill in the art, according to the idea of the present application, there will be changes in the specific implementation manners and application scopes. In summary, the content of this specification should not be construed as a limitation to the present application.

Claims

1. A network node management method based on digital networking, characterized in that: The method comprises: Determine the root node based on the status information of the nodes in the data network; According to the registration request information received from all other nodes, a node information list is created through the root node and distributed to other nodes; The discovery message is sent by each node, and based on the received discovery message, the first receiving node updates its own one-hop neighbor node list and two-hop neighbor node list; Determine the relay node of the node and update the relay node list of the node according to the one-hop neighbor node list and the two-hop neighbor node list of the node; The topology control message is sent through each relay node, and based on the received topology control message, the second receiving node updates its own network topology table; Determine the best path from the node to other nodes according to the network topology table of the node, and update the routing table of the node; According to the node information list, the data requesting node determines the target node where the requested data is located, and makes a data request to the target node based on its own routing table.

2. A network node management method based on digital networking according to claim 1, characterized in that: According to the status information of the nodes in the data network, the root node is determined, including: Determine, according to the first state information of the node, priority information of the node, wherein the priority information includes a priority value, a node identifier of the node to which it belongs, and a node address of the node to which it belongs; Each node sends its determined priority information to the elected priority confirmation node; Determine the target priority information with the highest priority value through the priority confirmation node; The node corresponding to the target priority information is determined as the root node.

3. A network node management method based on digital networking according to claim 2, characterized in that: Determining the target priority information with the highest priority value through the priority confirmation node includes: In the case where it is determined that the priority information with the highest priority value includes multiple items, using the node identifier recorded in the priority information with the highest priority value, and sending a priority confirmation request to the node corresponding to the node identifier; In response to the priority confirmation request, the node corresponding to the node identifier returns new priority information to the priority confirmation node for secondary priority confirmation, wherein the new priority information is determined by the node based on its own second state information; According to each piece of new priority information received, target priority information with the highest priority value is determined.

4. A network node management method based on digital networking according to claim 1, characterized in that: The discovery message is sent by each node, and based on the received discovery message, the first receiving node updates its own one-hop neighbor node list and two-hop neighbor node list, including: Sending discovery messages through each node, wherein the discovery messages include: a node identifier of the sending node, a message sequence number, a one-hop neighbor node list, and a resource status of the sending node; According to the received discovery message, determining, by the first receiving node, whether there is a sending node that sends the discovery message in its own one-hop neighbor node list; In the case where the sending node does not exist, recording the sending node in a one-hop neighbor node list of the first receiving node, and updating a two-hop neighbor node list of the first receiving node according to the one-hop neighbor node list of the sending node; In the case where the sending node exists, the two-hop neighbor node list of the first receiving node is updated according to the one-hop neighbor node list of the sending node.

5. The network node management method based on digital networking according to claim 1 is characterized in that: Determining a relay node of the node and updating the relay node list of the node according to a one-hop neighbor node list and a two-hop neighbor node list of the node includes: Determine, according to a one-hop neighbor node list and a two-hop neighbor node list of a node, a target neighbor node in the one-hop neighbor node list that can cover the most uncovered two-hop neighbor nodes, wherein the two-hop neighbor node is a node in the two-hop neighbor node list; Determine that the target neighbor node is a relay node of the node, and mark the two-hop neighbor nodes covered by the relay node as being in a covered state; Determine whether there is any uncovered two-hop neighbor node in the two-hop neighbor node list; If so, determining a target neighbor node that can cover at most uncovered two-hop neighbor nodes among the remaining one-hop neighbor nodes in the one-hop neighbor node list; If not present, the determination of the relay node of the node is terminated, and a final relay node list of the node is obtained.

6. A network node management method based on digital networking according to claim 5, characterized in that: Determining that the target neighbor node is a relay node of the node includes: Determine whether the target neighbor node is bidirectionally linked to the node; In the case that the target neighbor node and the node are bidirectionally linked, the target neighbor node is determined to be a relay node of the node.

7. A network node management method based on digital networking according to claim 1, characterized in that: According to the node information list, the data requesting node determines the target node where the requested data is located, and makes a data request to the target node based on its own routing table, including: Determine the target node where the requested data is located based on the resource information and address information of all nodes in the node information list; Determining a first optimal path between the data requesting node and the target node through a routing table of the data requesting node; Initiate a data request to the target node through the first optimal path; Based on the received data request, determine a second best path between itself and the data requesting node through the routing table of the target node; The requested target data is returned to the data requesting node via the second optimal path.

8. A network node management method based on digital networking according to claim 7, characterized in that: The method further comprises: Determining a corresponding survival time according to the transmission path length of the first optimal path; If the target data is not returned to the data requesting node within the survival time, the current request process is terminated.

9. A network node management method based on digital networking according to claim 1, characterized in that: The method further comprises: Determine whether a discovery message of a neighbor node in a one-hop neighbor node list of the node is received within a preset time period; If the discovery message of the neighbor node is not received within a preset time period, the neighbor node is removed from the one-hop neighbor node list of the node.

10. A network node management method based on digital networking according to claim 1, characterized in that: The method further comprises: In the case where a new node requests to join the data network, a registration request message is sent to any known registered node through the new node; According to the received registration request information, any registered node sends a discovery message to the new node; According to the received discovery message, the new node sends a discovery message to any registered node for registration and bidirectional link confirmation.

11. A network node management method based on digital networking according to claim 1, characterized in that: The method further comprises: Sending time synchronization messages to relay nodes via the root node; The time synchronization message is sent through the relay node to perform time synchronization on all nodes.

12. A network node management method based on digital networking according to claim 1, characterized in that: The method further comprises: Determine whether the root node in the data network is faulty; In the event of a root node failure, a node with the highest priority among the remaining nodes in the data network is determined as the root node.

13. A network node management method based on digital networking according to claim 1, characterized in that: The topology control message includes: the node identifier of the relay node that sends the topology control message, the message sequence number, and the topology information; the topology information includes: the neighbor nodes covered by the relay node and the link status information between itself and the covered neighbor nodes, as well as the metadata information in the relay node.

14. A network node management system based on a data network, characterized in that: The system comprises: A root node determination module is used to determine the root node according to the status information of the nodes in the data network; A node information list creation module is used to create a node information list and distribute it to other nodes based on the registration request information received from all other nodes; A discovery message distribution and neighbor node update module, used to send a discovery message and update a one-hop neighbor node list and a two-hop neighbor node list of the first receiving node itself based on the received discovery message; A relay node list determination and updating module, used to determine the relay node of the node and update the relay node list of the node according to the one-hop neighbor node list and the two-hop neighbor node list of the node; A topology control message sending and topology updating module, used to send a topology control message and update the network topology table of the second receiving node itself based on the received topology control message; A routing table updating module, used to determine the best path from the node to other nodes according to the network topology table of the node, and update the routing table of the node; The data request module is used to determine the target node where the requested data is located through the data request node according to the node information list, and make a data request to the target node based on its own routing table.

Images