Method, device, electronic device and storage medium for reducing routing overhead of ad hoc network

By performing cluster processing and election of cluster head nodes on the ad hoc network, routing overhead is reduced, data transmission instability caused by dynamic changes in the ad hoc network is solved, and effective data transmission and dynamic changes are achieved in complex environments adapt.

CN118055473BActive Publication Date: 2024-11-26SHENZHEN CRYSTAL VIDEO TECH
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410084533.6
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-01-19
Publication Date
2024-11-26
Estimated Expiration
2044-01-19

AI Technical Summary

Technical Problem

The routing overhead caused by dynamic changes in existing ad hoc networks is too large, making it difficult to support the stable transmission of data.

Method used

By clustering the ad hoc network, cluster head nodes are selected to obtain fusion data, and the link status table is maintained through cluster head nodes to realize data interaction between node clusters and reduce routing overhead.

Benefits of technology

It realizes effective data transmission and efficient dynamic adaptation of ad hoc networks in complex environments, and solves the problem of instability in data transmission caused by excessive routing overhead.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118055473B_ABST
    Figure CN118055473B_ABST
Patent Text Reader

Abstract

The present application relates to the field of network communication technology, and provides a method, device, electronic device and storage medium for reducing routing overhead of a self-organizing network. The present application performs clustering processing on the self-organizing network according to the node information of the member nodes in the self-organizing network to obtain a node cluster set; determines the cluster head node of each node cluster in the node cluster set, and the cluster head node is used to obtain the fusion data of the corresponding node cluster; and receives the fusion data sent by the cluster head node of the neighboring node cluster through the cluster head node to maintain the link state table of the corresponding node cluster. The present application performs clustering processing on the self-organizing network, selects the cluster head of each node cluster, and performs data interaction between different node clusters through the cluster head, thereby reducing the routing overhead in the self-organizing network, realizing dynamic adaptation of the system overhead, and ensuring effective data transmission of the self-organizing network in a complex environment. It solves the problem that the excessive routing overhead makes it difficult to support the stable transmission of data between self-organizing networks.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of network communication technology, and in particular to a method, device, electronic device and storage medium for reducing routing overhead of an ad hoc network. Background Art

[0002] Wireless ad hoc multi-terminal ad hoc network communication mainly includes single-node neighbor discovery to establish a link and multi-node topology discovery to establish a communication network. Single-node neighbor discovery is the first step of ad hoc networking, which enables the establishment of a communication link between two nodes that have no connection with each other, laying the foundation for the establishment of the entire network topology. Multi-node topology discovery gradually establishes the communication network topology by dynamically updating its own position, status information, neighbor information, etc. in the network through information sharing, so as to support the efficient transmission of network information.

[0003] In existing ad hoc networks, the communication network topology is dynamic. The node status, routing status and topological structure of each node in the ad hoc network change dynamically. When highly dynamic changes occur in the ad hoc network, each node will frequently update data, which will make the routing overhead of the ad hoc network larger. Especially when the dynamic changes are very drastic, the excessive routing overhead makes it difficult to support the stable transmission of data between ad hoc networks. Summary of the invention

[0004] In view of this, the present application provides a method, device, electronic device and storage medium for reducing routing overhead of an ad hoc network, which are used to solve the technical problem that excessive routing overhead makes it difficult to support stable data transmission between ad hoc networks.

[0005] A first aspect of the present application provides a method for reducing routing overhead in an ad hoc network, the method comprising:

[0006] Performing clustering processing on the self-organizing network according to node information of member nodes in the self-organizing network to obtain a node cluster set;

[0007] Determine a cluster head node of each node cluster in the node cluster set, wherein the cluster head node is used to obtain fusion data of the corresponding node cluster;

[0008] The cluster head node receives fusion data sent by the cluster head node of the neighboring node cluster to maintain the link state table of the corresponding node cluster.

[0009] In an optional implementation, clustering the ad hoc network according to the node information of the member nodes in the ad hoc network to obtain the node cluster set includes:

[0010] Obtaining application requirements of the ad hoc network;

[0011] The self-organizing network is clustered according to the node information of the member nodes in the self-organizing network by using a clustering routing algorithm according to the application requirements to obtain the node cluster set.

[0012] In an optional implementation, the determining the cluster head node of each node cluster in the node cluster set includes:

[0013] Determining a plurality of first target nodes according to the topological structure of the node cluster;

[0014] Obtaining a node load status of each of the first target nodes;

[0015] Acquire a plurality of second target nodes whose node load status is less than a preset node load status from the plurality of first target nodes;

[0016] Acquire the routing information interaction data volume of the plurality of second target nodes;

[0017] The second target node with the lowest amount of routing information interaction data is determined as the cluster head node of the node cluster.

[0018] In an optional embodiment, the method further comprises:

[0019] In each election cycle, each member node in the node cluster is periodically and in rotation with equal probability to update the cluster head node of the node cluster.

[0020] In an optional implementation, the cluster head node obtains the fusion data of the corresponding node cluster in the following manner:

[0021] The cluster head node acquires first data monitored by a non-cluster head node in the corresponding node cluster;

[0022] The cluster head node monitors second data;

[0023] The cluster head node obtains the fused data according to the first data and the second data.

[0024] In an optional embodiment, the method further comprises:

[0025] A first distance between a member node and a neighboring member node in the node cluster is calculated, a first information update period is determined according to the first distance, and node information of the member node is updated to the neighboring member node according to the first information update period.

[0026] In an optional embodiment, the method further comprises:

[0027] When it is detected that the node information of any member node changes, the update information of the member node is obtained;

[0028] The node cluster corresponding to any member node is updated according to the update information to obtain an updated node cluster.

[0029] Update any member node according to the update information to obtain an updated routing state and an updated topology structure;

[0030] The node cluster corresponding to any member node is updated according to the updated routing state and the updated topology structure to obtain an updated node cluster.

[0031] A second aspect of the present application provides a device for reducing routing overhead in an ad hoc network, the device comprising:

[0032] The clustering processing module is used to perform clustering processing on the self-organizing network according to the node information of the member nodes in the self-organizing network to obtain a node cluster set.

[0033] The cluster head determination module is used to determine the cluster head node of each node cluster in the node cluster set, and the cluster head node is used to obtain the fusion data of the corresponding node cluster.

[0034] The link maintenance module is used to maintain the link state table of the corresponding node cluster by receiving the fusion data sent by the cluster head node of the neighboring node cluster through the cluster head node.

[0035] The third aspect of the present application provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of the method for reducing routing overhead of the ad hoc network when executing the computer program.

[0036] A fourth aspect of the present application provides a computer-readable storage medium having a computer program stored thereon, and when the computer program is executed, the steps of the method for reducing routing overhead of an ad hoc network are implemented.

[0037] The present application performs clustering processing on the self-organizing network according to the node information of the member nodes in the self-organizing network to obtain a node cluster set; determines the cluster head node of each node cluster in the node cluster set, and the cluster head node is used to obtain the fusion data of the corresponding node cluster; and maintains the link state table of the corresponding node cluster by receiving the fusion data sent by the cluster head node of the neighboring node cluster through the cluster head node. The present application performs clustering processing on the self-organizing network, selects the cluster head of each node cluster, and performs data interaction between different node clusters through the cluster head, thereby reducing the routing overhead in the self-organizing network and realizing dynamic self-adaptation of the system overhead, so that the self-organizing network can ensure effective data transmission in a complex environment and can adapt to the dynamic change process of the self-organizing network with high efficiency. The problem that the excessive routing overhead makes it difficult to support the stable transmission of data between self-organizing networks is solved. BRIEF DESCRIPTION OF THE DRAWINGS

[0038] Figure 1 It is a flow chart of a method for reducing routing overhead of an ad hoc network shown in an embodiment of the present application;

[0039] Figure 2 It is a functional module diagram of a routing overhead reduction device for an ad hoc network shown in an embodiment of the present application;

[0040] Figure 3 is a network architecture diagram of a self-organizing network shown in an embodiment of the present application;

[0041] Figure 4 It is a structural diagram of the server shown in the embodiment of the present application. DETAILED DESCRIPTION

[0042] The terms used in the following embodiments of the present application are only for the purpose of describing specific embodiments, and are not intended to be used as limitations to the present application. As used in the specification of the present application, the singular expressions "one", "a kind of", "said", "above", "the" and "this" are intended to also include plural expressions, unless there is a clear indication to the contrary in the context. It should also be understood that the term "and / or" used in the present application refers to any or all possible combinations comprising one or more of the listed items.

[0043] In the following, the terms "first" and "second" are used for descriptive purposes only and are not to be understood as suggesting or implying relative importance or implicitly indicating the number of the indicated technical features. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of the features, and in the description of the embodiments of the present application, unless otherwise specified, "plurality" means two or more.

[0044] In order to make the purpose, technical solutions and advantages of the present application clearer, the technical solutions in the embodiments of the present application will be described below in conjunction with the drawings in the embodiments of the present application.

[0045] Figure 1 The flowchart of the method for reducing routing overhead of an ad hoc network provided in the first embodiment of the present application is shown in FIG. The method for reducing routing overhead of an ad hoc network is executed by each specific member in the ad hoc network and specifically includes the following steps.

[0046] S11, clustering the ad hoc network according to node information of member nodes in the ad hoc network to obtain a node cluster set.

[0047] An ad hoc network is a temporary network formed by multiple member nodes connected to each other through wireless communication. Member nodes refer to mobile terminal devices that can communicate with each other wirelessly, such as mobile phones, sensors, vehicles and other devices with communication capabilities. In an ad hoc network, there is no need for a central server or infrastructure to support the operation of the entire network. Each member node can establish a connection through direct communication, and each member node is mobile in the ad hoc network and can enter or leave the ad hoc network at any time. The ad hoc network will update the communication connection relationship of each member node in real time according to the entry or departure of the member node.

[0048] The node information of a member node refers to the topological information, node status information and routing status information of each member node. The topological information describes the connection relationship and physical layout between each member node in the ad hoc network, forming a network topology diagram representation. Each member node can obtain information such as the connection relationship, neighbor relationship and the overall structure of the network through the network topology diagram. The node status information describes the current status information and performance information of each member node in the ad hoc network, where the current status information may include information such as the availability and power status of the member node; the performance information refers to information such as the data load of the member node and the degree of resource utilization; the status information and performance information are dynamically changing, and each member node can execute different decisions by real-time monitoring of the node status information. For example, when a member node detects that its own load is too large, it can execute dynamic load balancing decisions to maintain stability. The routing status information describes the communication path, distance and quality between each member node in the ad hoc network. The member node can use the best routing path for data transmission through the routing status information.

[0049] In an ad hoc network, each member node works together based on its own node information, clusters the ad hoc network, and obtains a node cluster set composed of node clusters. In the node cluster set, each node cluster communicates with each other through the cluster head. The special member node in the cluster head node cluster can obtain the node information of each node in the entire node cluster and its own node information, and manage the data transmission of the entire node cluster through the cluster head. In the node cluster set, different node clusters communicate data through the cluster head to obtain information about other node clusters except their own node cluster, which may include the topological structure and routing status of other node clusters.

[0050] By dividing the ad hoc network into node clusters and managing the data of the entire node cluster through the cluster head of the node cluster, the routing overhead of the node cluster area is reduced. Data communication is carried out through the cluster heads between node clusters, which reduces the data load of the entire ad hoc network, speeds up the speed of data transmission, effectively reduces the routing overhead of each member node, and maintains the stability of the entire ad hoc network.

[0051] In an optional implementation, clustering the ad hoc network according to the node information of the member nodes in the ad hoc network to obtain the node cluster set includes:

[0052] Obtaining application requirements of the ad hoc network;

[0053] The self-organizing network is clustered according to the node information of the member nodes in the self-organizing network by using a clustering routing algorithm according to the application requirements to obtain the node cluster set.

[0054] The application requirements of the ad hoc network may include business logic requirements, energy efficiency requirements and scalability requirements. The business logic requirements may involve some large data volume transmission, transmission type, etc. According to the application requirements of the ad hoc network, the ad hoc network is clustered through the cluster routing algorithm. The clustering algorithm is a clustering technology that divides the ad hoc network into clusters, which is an existing mature technology.

[0055] Through clustering algorithms, ad hoc networks can better adapt to changes in node status, routing status, and topology, improving network stability and efficiency. By dividing ad hoc networks into node clusters, intra-cluster communication is optimized, communication overhead between nodes can be reduced, thereby extending the life of the network and ensuring load balancing in each node cluster. While meeting the application requirements of ad hoc networks, routing overhead is reduced and network performance is improved.

[0056] S12, determining a cluster head node of each node cluster in the node cluster set, wherein the cluster head node is used to obtain fusion data of the corresponding node cluster.

[0057] The cluster head node refers to the node in the node cluster, which is used to manage other member nodes in the node cluster set. After obtaining the corresponding node information through the clustering node algorithm, the cluster head of each node cluster is determined through the corresponding node information. The node data of each member node in the corresponding node cluster is obtained according to the cluster head of the corresponding node cluster, and the data of each member node obtained are fused to obtain fused data.

[0058] In traditional ad hoc networks, data transmission between each member node is complex and chaotic, and the data processing burden on each member node is heavy. At the same time, when a member node enters or exits the ad hoc network, the topology and routing information of the entire ad hoc network will change accordingly, and each member node will be updated, regardless of how far the newly entered or exited node is from the member node.

[0059] In the present application, a local transparent strategy is adopted through node cluster division, that is, in different areas of the network, nodes only pay attention to the node status near them, and abstract the nodes farther away, that is, only update the corresponding topological structure and routing status of the nodes in the node cluster. The overall routing burden of the self-organizing network is reduced and the stability of the system is improved. According to the cluster head responsible for collecting data from other nodes in the node cluster, compared with the traditional self-organizing network, the amount of network transmission data is reduced, the power consumption is reduced, and the scattered data in the node cluster is summarized into higher-level information. At the same time, data transmission is carried out through the cluster head and the cluster head of other node clusters, which helps to optimize the transmission path and reduce the communication distance.

[0060] In an optional implementation, the determining the cluster head node of each node cluster in the node cluster set includes:

[0061] Determining a plurality of first target nodes according to the topological structure of the node cluster;

[0062] Obtaining a node load status of each of the first target nodes;

[0063] Acquire a plurality of second target nodes whose node load status is less than a preset node load status from the plurality of first target nodes;

[0064] Acquire the routing information interaction data volume of the plurality of second target nodes;

[0065] The second target node with the lowest amount of routing information interaction data is determined as the cluster head node of the node cluster.

[0066] The first target node refers to a member node in the node cluster that can have a direct connection relationship with each other member node; the second target node refers to a member node in the first target node whose node load state is less than the preset node load state; the preset node load state refers to the average of the load states of all nodes in the entire node cluster in the node cluster, which is used to judge the qualification of the member node of the first target node. When the first target node is less than the preset node load state, the load state is higher and it is the second target node.

[0067] In a node cluster, according to the topological structure in the node cluster, a first target node is obtained, and according to the node load state of the target node, the node load state is compared with a preset node load, which refers to an average node load set according to the load conditions of the member nodes set by the member node network. When the node load state of the member node in the first target node is less than the preset node load state, the corresponding target node is the second target node.

[0068] The information exchange data volume of each member node in the second target node is obtained. The information exchange data volume refers to the routing data output volume and data reception volume between each node in the second target node. In the second target node, the lower the node exchange data volume, the greater the free resource usage of the member node. The more node exchange data volume, the greater the load and the smaller the free resource usage. The second target node with the lowest information exchange data volume is determined as the cluster head of the corresponding node cluster.

[0069] By determining the topological connection relationship with each cluster, the first target node cluster connected to each member node is obtained to ensure that the node data of each solution point will not be lost. By comparing the amount of routing information interaction data of each first target member node, the best one with the best performance is obtained and set as the cluster head of the corresponding node cluster. The data processing capacity of the cluster head is guaranteed.

[0070] By analyzing the topological structure, load capacity and data interaction volume of each member node in the node cluster, the member node with the strongest load capacity connected to each member node is obtained, and the member node with the largest resource spare utilization rate is obtained from the node cluster as the cluster head of the node cluster. The cluster head needs to perform some complex tasks to obtain the node cluster with the largest spare resource utilization, which can improve the data addition capacity of the corresponding node cluster and improve the overall performance of the node cluster.

[0071] In an optional embodiment, the method further comprises:

[0072] In each election cycle, each member node in the node cluster is periodically and in rotation with equal probability to update the cluster head node of the node cluster.

[0073] The election cycle refers to the election and replacement of the cluster head of each node cluster according to a preset time period. In each node cluster, as the cluster head continuously processes the data of the entire node cluster, the load state of the cluster head will gradually increase. In order to ensure that the cluster head does not cause the overall node cluster performance to deteriorate due to excessive load, the cluster head of the node cluster will be elected and replaced in a periodic manner with equal probability.

[0074] In each election cycle, each member node of the node cluster will be elected with equal probability. Except for the cluster head in the corresponding election cycle, other member nodes have equal chances to be elected as the new cluster head node. When a member node is elected as the new cluster head node, the system updates the cluster head node of the node cluster and makes the newly elected node the cluster head. When entering the next election cycle, the entire node cluster will be elected again to obtain the cluster head node updated at the periodic time.

[0075] By setting the election cycle, each election cycle is obtained in the form of a "round". A new cluster head will be elected in each round, and the load of the entire network will be evenly distributed to each node, thereby reducing the network communication overhead and improving the overall network communication efficiency.

[0076] In an optional implementation, the cluster head node obtains the fusion data of the corresponding node cluster in the following manner:

[0077] The cluster head node acquires first data monitored by a non-cluster head node in the corresponding node cluster;

[0078] The cluster head node monitors second data;

[0079] The cluster head node obtains the fused data according to the first data and the second data.

[0080] The non-cluster head member nodes obtain corresponding first data according to the application requirements of the self-organizing network. The first data may include sensor data, status information, external environment information or system status information. The cluster head monitors and obtains second data. The second data includes the corresponding detection data obtained by the cluster head node, and also includes the global data obtained by the node cluster, such as the topological structure information, routing status information and node status information of each member node.

[0081] The cluster head node obtains the corresponding routing path to obtain the first data of each member node, and compresses and packages the second data obtained by itself to obtain fused data.

[0082] By receiving the data of the corresponding non-cluster head node through the cluster head, and acquiring and fusing the data to obtain corresponding fused data, the data exchange efficiency between the node clusters can be improved, and the routing overhead of the network load can be reduced.

[0083] In an optional embodiment, the method further comprises:

[0084] A first distance between a member node and a neighboring member node in the node cluster is calculated, a first information update period is determined according to the first distance, and node information of the member node is updated to the neighboring member node according to the first information update period.

[0085] The first information update cycle refers to the time period during which the cluster head updates the data of the member nodes. The longer the first distance is, the longer the first information update cycle is, and the update range is limited to the corresponding node cluster. The cluster head updates the data of each member node through the first information update cycle, obtains the corresponding updated member node, updates the corresponding node cluster according to the updated member node, and updates each member node according to the first information update cycle between the cluster head and each member node. In this way, the dynamic update of the entire node cluster is realized. The closer to the cluster head, the faster the update frequency will be, and the farther away from the cluster head, the slower the data update frequency will be.

[0086] By determining the first information update cycle of the member nodes within the node cluster for internal update, compared with the traditional self-organizing network in which the overall network structure is updated as one member node is updated, the data processing scope is greatly reduced, and the routing overhead of non-corresponding node cluster members is reduced. At the same time, the dynamic update of the node cluster can better maintain the accuracy of the data and improve the data processing capability and stability of the self-organizing network.

[0087] In an optional embodiment, the method further comprises:

[0088] The second distance between the cluster head node and the neighboring cluster head node in the node cluster set is calculated, a second information update period is determined according to the second distance, and the fusion data of the cluster head node is updated to the neighboring cluster head node according to the second information update period.

[0089] The second information update cycle refers to the time period for different node clusters to exchange information with each other. The longer the second distance, the longer the second information update cycle. The cluster head of each node cluster exchanges data with other cluster heads through the second information update cycle, and updates the data of its own node cluster based on the data obtained from other cluster heads to obtain an updated node cluster. At the same time, when other node clusters receive data sent by the corresponding node cluster, they will also perform corresponding data updates. The closer to the corresponding node cluster, the shorter the data update cycle, and the farther away from the corresponding node cluster, the slower the data update.

[0090] According to the data interaction between cluster heads, corresponding updates are made. Data interaction between different node clusters is carried out through cluster heads, taking node clusters as units. Different cluster heads perform internal updates based on the data obtained from other node clusters, so that the member nodes in each node cluster understand the information of other node clusters. By transmitting data between cluster heads, routing overhead is reduced and transmission efficiency is accelerated. The data processing capability and stability of the ad hoc network are effectively improved.

[0091] S13, maintaining a link state table of the corresponding node cluster by receiving, by the cluster head node, fused data sent by the cluster head node of the neighboring node cluster.

[0092] The link state table refers to the state information table of the link relationship between the cluster head and each member node in the corresponding node cluster, including the topological structure, routing status and node status of the entire ad hoc network. The cluster head node obtains the topological structure of other nodes from the fused data by continuously acquiring the fused data of neighboring nodes, and determines the link state of its own node cluster in the entire ad hoc network based on the topological structure of its own node cluster, thereby maintaining the node information link table of each node in its own node cluster.

[0093] By exchanging fusion information with other node clusters and obtaining the link tables of other node clusters, and by obtaining the link tables with fusion information of all other node clusters, the cluster head can obtain the link status table of the entire ad hoc network, while maintaining its own link status table, and grasp the link status of each member node in the entire ad hoc network in real time. It can view the dynamic changes of the entire ad hoc network and the complete link distribution in real time.

[0094] In an optional embodiment, the method further comprises:

[0095] When it is detected that the node information of any member node changes, the update information of the member node is obtained;

[0096] Update any member node according to the update information to obtain an updated routing state and an updated topology structure;

[0097] The node cluster corresponding to any member node is updated according to the updated routing state and the updated topology structure to obtain an updated node cluster.

[0098] When a member node detects a change in any node cluster, it obtains the corresponding member node information, where the change information may be joining or exiting the corresponding node cluster, or may cause the location of any member node to change. When any member node updates its status, the cluster head of the node cluster where it is located will obtain multiple update information, update the entire node cluster according to the corresponding update information, and obtain the updated routing status and topology of the node cluster, and obtain the updated updated routing status and updated topology.

[0099] The cluster head updates the corresponding node cluster according to the corresponding topological structure and routing status, and obtains the updated node cluster. By updating the member nodes in the area, the corresponding topological structure and routing information of the node cluster in a small range are updated to obtain the node cluster with the new topological structure and routing information. After the subsequent cycle time, the cluster head of the node cluster obtains the latest update data for fusion and sends it to the cluster heads of other node clusters, so that the cluster heads of other node clusters can obtain the corresponding update information of the updated node cluster, so that the entire self-organizing network can obtain the corresponding update information. By updating the internal state of the node cluster, the cluster head can add the update data to the fusion data, and other node clusters can obtain the corresponding update information, thereby realizing the update of the entire self-organizing network. The routing overhead of the system is guaranteed, the routing response time is shortened, and the performance of the entire self-organizing network is improved.

[0100] The present application performs clustering processing on the self-organizing network according to the node information of the member nodes in the self-organizing network to obtain a node cluster set; determines the cluster head node of each node cluster in the node cluster set, and the cluster head node is used to obtain the fusion data of the corresponding node cluster; and maintains the link state table of the corresponding node cluster by receiving the fusion data sent by the cluster head node of the neighboring node cluster through the cluster head node. The present application performs clustering processing on the self-organizing network, selects the cluster head of each node cluster, and performs data interaction between different node clusters through the cluster head, thereby reducing the routing overhead in the self-organizing network and realizing dynamic self-adaptation of the system overhead, so that the self-organizing network can ensure effective data transmission in a complex environment and can adapt to the dynamic change process of the self-organizing network with high efficiency. The problem that the excessive routing overhead makes it difficult to support the stable transmission of data between self-organizing networks is solved.

[0101] Figure 2 It is a functional module diagram of a routing overhead reduction device for a self-organizing network shown in an embodiment of the present application.

[0102] In some embodiments, the routing cost reduction device 20 for an ad hoc network may include a plurality of functional modules composed of computer program segments. The computer programs of the various program segments in the routing cost reduction device 20 for an ad hoc network may be stored in the memory of each member node and executed by at least one processor to perform (see Figure 1 Description) Functionality of a method for reducing routing overhead in ad hoc networks.

[0103] In this embodiment, the routing overhead reduction device 20 of the self-organizing network can be divided into multiple functional modules according to the functions it performs. The functional modules may include: a clustering processing module 201, a cluster head determination module 202, a rotation election module 203, a data fusion module 204, a first calculation module 205, a second calculation module 206, a link maintenance module 207 and a node update module 208. The module referred to in the present invention refers to a series of computer program segments that can be executed by at least one processor and can complete fixed functions, which are stored in a memory. In this embodiment, the functions of each module will be described in detail in subsequent embodiments.

[0104] The clustering processing module 201 is used to perform clustering processing on the ad hoc network according to the node information of the member nodes in the ad hoc network to obtain a node cluster set.

[0105] An ad hoc network is a temporary network formed by multiple member nodes connected to each other through wireless communication. Member nodes refer to mobile terminal devices that can communicate with each other wirelessly, such as mobile phones, sensors, vehicles and other devices with communication capabilities. In an ad hoc network, there is no need for a central server or infrastructure to support the operation of the entire network. Each member node can establish a connection through direct communication, and each member node is mobile in the ad hoc network and can enter or leave the ad hoc network at any time. The ad hoc network will update the communication connection relationship of each member node in real time according to the entry or departure of the member node.

[0106] The node information of a member node refers to the topological information, node status information and routing status information of each member node. The topological information describes the connection relationship and physical layout between each member node in the ad hoc network, forming a network topology diagram representation. Each member node can obtain information such as the connection relationship, neighbor relationship and the overall structure of the network through the network topology diagram. The node status information describes the current status information and performance information of each member node in the ad hoc network, where the current status information may include information such as the availability and power status of the member node; the performance information refers to information such as the data load of the member node and the degree of resource utilization; the status information and performance information are dynamically changing, and each member node can execute different decisions by real-time monitoring of the node status information. For example, when a member node detects that its own load is too large, it can execute dynamic load balancing decisions to maintain stability. The routing status information describes the communication path, distance and quality between each member node in the ad hoc network. The member node can use the best routing path for data transmission through the routing status information.

[0107] In an ad hoc network, each member node works together based on its own node information, clusters the ad hoc network, and obtains a node cluster set composed of node clusters. In the node cluster set, each node cluster communicates with each other through the cluster head. The special member node in the cluster head node cluster can obtain the node information of each node in the entire node cluster and its own node information, and manage the data transmission of the entire node cluster through the cluster head. In the node cluster set, different node clusters communicate data through the cluster head to obtain information about other node clusters except their own node cluster, which may include the topological structure and routing status of other node clusters.

[0108] By dividing the ad hoc network into node clusters and managing the data of the entire node cluster through the cluster head of the node cluster, the routing overhead of the node cluster area is reduced. Data communication is carried out through the cluster heads between node clusters, which reduces the data load of the entire ad hoc network, speeds up the speed of data transmission, effectively reduces the routing overhead of each member node, and maintains the stability of the entire ad hoc network.

[0109] In an optional implementation, clustering the ad hoc network according to the node information of the member nodes in the ad hoc network to obtain the node cluster set includes:

[0110] Obtaining application requirements of the ad hoc network;

[0111] The self-organizing network is clustered according to the node information of the member nodes in the self-organizing network by using a clustering routing algorithm according to the application requirements to obtain the node cluster set.

[0112] The application requirements of the ad hoc network may include business logic requirements, energy efficiency requirements and scalability requirements. The business logic requirements may involve some large data volume transmission, transmission type, etc. According to the application requirements of the ad hoc network, the ad hoc network is clustered through the cluster routing algorithm. The clustering algorithm is a clustering technology that divides the ad hoc network into clusters, which is an existing mature technology.

[0113] Through clustering algorithms, ad hoc networks can better adapt to changes in node status, routing status, and topology, improving network stability and efficiency. By dividing ad hoc networks into node clusters, intra-cluster communication is optimized, communication overhead between nodes can be reduced, thereby extending the life of the network and ensuring load balancing in each node cluster. While meeting the application requirements of ad hoc networks, routing overhead is reduced and network performance is improved.

[0114] The cluster head determination module 202 is used to determine the cluster head node of each node cluster in the node cluster set, and the cluster head node is used to obtain fusion data of the corresponding node cluster.

[0115] The cluster head node refers to the node in the node cluster, which is used to manage other member nodes in the node cluster set. After obtaining the corresponding node information through the clustering node algorithm, the cluster head of each node cluster is determined through the corresponding node information. The node data of each member node in the corresponding node cluster is obtained according to the cluster head of the corresponding node cluster, and the data of each member node obtained are fused to obtain fused data.

[0116] In traditional ad hoc networks, data transmission between each member node is complex and chaotic, and the data processing burden on each member node is heavy. At the same time, when a member node enters or exits the ad hoc network, the topology and routing information of the entire ad hoc network will change accordingly, and each member node will be updated, regardless of how far the newly entered or exited node is from the member node.

[0117] In the present application, a local transparent strategy is adopted through node cluster division, that is, in different areas of the network, nodes only pay attention to the node status near them, and abstract the nodes farther away, that is, only update the corresponding topological structure and routing status of the nodes in the node cluster. The overall routing burden of the self-organizing network is reduced and the stability of the system is improved. According to the cluster head responsible for collecting data from other nodes in the node cluster, compared with the traditional self-organizing network, the amount of network transmission data is reduced, the power consumption is reduced, and the scattered data in the node cluster is summarized into higher-level information. At the same time, data transmission is carried out through the cluster head and the cluster head of other node clusters, which helps to optimize the transmission path and reduce the communication distance.

[0118] In an optional implementation, the determining the cluster head node of each node cluster in the node cluster set includes:

[0119] Determining a plurality of first target nodes according to the topological structure of the node cluster;

[0120] Obtaining a node load status of each of the first target nodes;

[0121] Acquire a plurality of second target nodes whose node load status is less than a preset node load status from the plurality of first target nodes;

[0122] Acquire the routing information interaction data volume of the plurality of second target nodes;

[0123] The second target node with the lowest amount of routing information interaction data is determined as the cluster head node of the node cluster.

[0124] The first target node refers to a member node in the node cluster that can have a direct connection relationship with each other member node; the second target node refers to a member node in the first target node whose node load state is less than the preset node load state; the preset node load state refers to the average of the load states of all nodes in the entire node cluster in the node cluster, which is used to judge the qualification of the member node of the first target node. When the first target node is less than the preset node load state, the load state is higher and it is the second target node.

[0125] In a node cluster, according to the topological structure in the node cluster, a first target node is obtained, and according to the node load state of the target node, the node load state is compared with a preset node load, which refers to an average node load set according to the load conditions of the member nodes set by the member node network. When the node load state of the member node in the first target node is less than the preset node load state, the corresponding target node is the second target node.

[0126] The information exchange data volume of each member node in the second target node is obtained. The information exchange data volume refers to the routing data output volume and data reception volume between each node in the second target node. In the second target node, the lower the node exchange data volume, the greater the free resource usage of the member node. The more node exchange data volume, the greater the load and the smaller the free resource usage. The second target node with the lowest information exchange data volume is determined as the cluster head of the corresponding node cluster.

[0127] By determining the topological connection relationship with each cluster, the first target node cluster connected to each member node is obtained to ensure that the node data of each solution point will not be lost. By comparing the amount of routing information interaction data of each first target member node, the best one with the best performance is obtained and set as the cluster head of the corresponding node cluster. The data processing capacity of the cluster head is guaranteed.

[0128] By analyzing the topological structure, load capacity and data interaction volume of each member node in the node cluster, the member node with the strongest load capacity connected to each member node is obtained, and the member node with the largest resource spare utilization rate is obtained from the node cluster as the cluster head of the node cluster. The cluster head needs to perform some complex tasks to obtain the node cluster with the largest spare resource utilization, which can improve the data addition capacity of the corresponding node cluster and improve the overall performance of the node cluster.

[0129] The rotation election module 203 is used to periodically and rotationally elect each member node in the node cluster with equal probability in each election cycle to update the cluster head node of the node cluster.

[0130] The election cycle refers to the election and replacement of the cluster head of each node cluster according to a preset time period. In each node cluster, as the cluster head continuously processes the data of the entire node cluster, the load state of the cluster head will gradually increase. In order to ensure that the cluster head does not cause the overall node cluster performance to deteriorate due to excessive load, the cluster head of the node cluster will be elected and replaced in a periodic manner with equal probability.

[0131] In each election cycle, each member node of the node cluster will be elected with equal probability. Except for the cluster head in the corresponding election cycle, other member nodes have equal chances to be elected as the new cluster head node. When a member node is elected as the new cluster head node, the system updates the cluster head node of the node cluster and makes the newly elected node the cluster head. When entering the next election cycle, the entire node cluster will be elected again to obtain the cluster head node updated at the periodic time.

[0132] By setting the election cycle, each election cycle is obtained in the form of a "round". A new cluster head will be elected in each round, and the load of the entire network will be evenly distributed to each node, thereby reducing the network communication overhead and improving the overall network communication efficiency.

[0133] In an optional implementation, the cluster head node obtains the fusion data of the corresponding node cluster in the following manner:

[0134] The cluster head node acquires first data monitored by a non-cluster head node in the corresponding node cluster;

[0135] The cluster head node monitors second data;

[0136] The cluster head node obtains the fused data according to the first data and the second data.

[0137] The non-cluster head member nodes obtain corresponding first data according to the application requirements of the self-organizing network. The first data may include sensor data, status information, external environment information or system status information. The cluster head monitors and obtains second data. The second data includes the corresponding detection data obtained by the cluster head node, and also includes the global data obtained by the node cluster, such as the topological structure information, routing status information and node status information of each member node.

[0138] The cluster head node obtains the corresponding routing path to obtain the first data of each member node, and compresses and packages the second data obtained by itself to obtain fused data.

[0139] By receiving the data of the corresponding non-cluster head node through the cluster head, and acquiring and fusing the data to obtain corresponding fused data, the data exchange efficiency between the node clusters can be improved, and the routing overhead of the network load can be reduced.

[0140] The data fusion module 204 is used for the cluster head node to obtain the first data monitored by the non-cluster head node in the corresponding node cluster; the cluster head node monitors the second data; and the cluster head node obtains the fused data according to the first data and the second data.

[0141] The non-cluster head member nodes obtain corresponding first data according to the application requirements of the self-organizing network. The first data may include sensor data, status information, external environment information or system status information. The cluster head monitors and obtains second data. The second data includes the corresponding detection data obtained by the cluster head node, and also includes the global data obtained by the node cluster, such as the topological structure information, routing status information and node status information of each member node.

[0142] The cluster head node obtains the corresponding routing path to obtain the first data of each member node, and compresses and packages the second data obtained by itself to obtain fused data.

[0143] By receiving the data of the corresponding non-cluster head node through the cluster head, and acquiring and fusing the data to obtain corresponding fused data, the data exchange efficiency between the node clusters can be improved, and the routing overhead of the network load can be reduced.

[0144] The first calculation module 205 is used to calculate a first distance between a member node and a neighboring member node in the node cluster, determine a first information update period according to the first distance, and update the node information of the member node to the neighboring member node according to the first information update period.

[0145] The first information update cycle refers to the time period during which the cluster head updates the data of the member nodes. The longer the first distance is, the longer the first information update cycle is, and the update range is limited to the corresponding node cluster. The cluster head updates the data of each member node through the first information update cycle, obtains the corresponding updated member node, updates the corresponding node cluster according to the updated member node, and updates each member node according to the first information update cycle between the cluster head and each member node. In this way, the dynamic update of the entire node cluster is realized. The closer to the cluster head, the faster the update frequency will be, and the farther away from the cluster head, the slower the data update frequency will be.

[0146] By determining the first information update cycle of the member nodes within the node cluster for internal update, compared with the traditional self-organizing network in which the overall network structure is updated as one member node is updated, the data processing scope is greatly reduced, and the routing overhead of non-corresponding node cluster members is reduced. At the same time, the dynamic update of the node cluster can better maintain the accuracy of the data and improve the data processing capability and stability of the self-organizing network.

[0147] The second calculation module 206 is used to calculate the second distance between the cluster head node and the neighboring cluster head nodes in the node cluster set, determine a second information update period according to the second distance, and update the fusion data of the cluster head node to the neighboring cluster head node according to the second information update period.

[0148] The second information update cycle refers to the time period for different node clusters to exchange information with each other. The longer the second distance, the longer the second information update cycle. The cluster head of each node cluster exchanges data with other cluster heads through the second information update cycle, and updates the data of its own node cluster based on the data obtained from other cluster heads to obtain an updated node cluster. At the same time, when other node clusters receive data sent by the corresponding node cluster, they will also perform corresponding data updates. The closer to the corresponding node cluster, the shorter the data update cycle, and the farther away from the corresponding node cluster, the slower the data update.

[0149] According to the data interaction between cluster heads, corresponding updates are made. Data interaction between different node clusters is carried out through cluster heads, taking node clusters as units. Different cluster heads perform internal updates based on the data obtained from other node clusters, so that the member nodes in each node cluster understand the information of other node clusters. By transmitting data between cluster heads, routing overhead is reduced and transmission efficiency is accelerated. The data processing capability and stability of the ad hoc network are effectively improved.

[0150] The link maintenance module 207 is used to maintain the link state table of the corresponding node cluster by receiving the fusion data sent by the cluster head node of the neighboring node cluster through the cluster head node.

[0151] The link state table refers to the state information table of the link relationship between the cluster head and each member node in the corresponding node cluster, including the topological structure, routing status and node status of the entire ad hoc network. The cluster head node obtains the topological structure of other nodes from the fused data by continuously acquiring the fused data of neighboring nodes, and determines the link state of its own node cluster in the entire ad hoc network based on the topological structure of its own node cluster, thereby maintaining the node information link table of each node in its own node cluster.

[0152] By exchanging fusion information with other node clusters and obtaining the link tables of other node clusters, and by obtaining the link tables with fusion information of all other node clusters, the cluster head can obtain the link status table of the entire ad hoc network, while maintaining its own link status table, and grasp the link status of each member node in the entire ad hoc network in real time. It can view the dynamic changes of the entire ad hoc network and the complete link distribution in real time.

[0153] The node update module 208 is used to obtain the update information of any member node when it is monitored that the node information of any member node has changed; update the any member node according to the update information to obtain an updated routing state and an updated topology structure; update the node cluster corresponding to the any member node according to the updated routing state and the updated topology structure to obtain an updated node cluster.

[0154] When a member node detects a change in any node cluster, it obtains the corresponding member node information, where the change information may be joining or exiting the corresponding node cluster, or may cause the location of any member node to change. When any member node updates its status, the cluster head of the node cluster where it is located will obtain multiple update information, update the entire node cluster according to the corresponding update information, and obtain the updated routing status and topology of the node cluster, and obtain the updated updated routing status and updated topology.

[0155] The cluster head updates the corresponding node cluster according to the corresponding topological structure and routing status, and obtains the updated node cluster. By updating the member nodes in the area, the corresponding topological structure and routing information of the node cluster in a small range are updated to obtain the node cluster with the new topological structure and routing information. After the subsequent cycle time, the cluster head of the node cluster obtains the latest update data for fusion and sends it to the cluster heads of other node clusters, so that the cluster heads of other node clusters can obtain the corresponding update information of the updated node cluster, so that the entire self-organizing network can obtain the corresponding update information. By updating the internal state of the node cluster, the cluster head can add the update data to the fusion data, and other node clusters can obtain the corresponding update information, thereby realizing the update of the entire self-organizing network. The routing overhead of the system is guaranteed, the routing response time is shortened, and the performance of the entire self-organizing network is improved.

[0156] The present application performs clustering processing on the self-organizing network according to the node information of the member nodes in the self-organizing network to obtain a node cluster set; determines the cluster head node of each node cluster in the node cluster set, and the cluster head node is used to obtain the fusion data of the corresponding node cluster; and maintains the link state table of the corresponding node cluster by receiving the fusion data sent by the cluster head node of the neighboring node cluster through the cluster head node. The present application performs clustering processing on the self-organizing network, selects the cluster head of each node cluster, and performs data interaction between different node clusters through the cluster head, thereby reducing the routing overhead in the self-organizing network and realizing dynamic self-adaptation of the system overhead, so that the self-organizing network can ensure effective data transmission in a complex environment and can adapt to the dynamic change process of the self-organizing network with high efficiency. The problem that the excessive routing overhead makes it difficult to support the stable transmission of data between self-organizing networks is solved.

[0157] Figure 3is a network architecture diagram of a self-organizing network shown in an embodiment of the present application;

[0158] These include ad hoc networks, base stations, cloud servers, and data centers.

[0159] The ad hoc network shows that all member nodes are divided into four node clusters, where the cluster head is directly connected to each member node, and the cluster heads communicate data with each other, or with the base station. The base station is a device or facility used to provide communication services in the communication network. It can be used to obtain the fusion data of all node clusters in the ad hoc network, and can also perform two-way data exchange with the cloud server. The cloud server can also perform two-way data exchange with the data center.

[0160] An embodiment of the present application also provides a computer-readable storage medium having a computer program stored thereon, and when the computer program is executed, the steps of the method for reducing routing overhead of an ad hoc network are implemented.

[0161] See also Figure 4 As shown, the server is a schematic diagram of the structure of the server provided in Embodiment 4 of the present application. In a preferred embodiment of the present application, the server includes a memory 41, at least one processor 42, and at least one communication bus 43.

[0162] Those skilled in the art should understand that Figure 4 The structure of the server shown does not constitute a limitation of the embodiments of the present application, and may be either a bus structure or a star structure. The server 4 may also include more or less other hardware or software than shown in the figure, or a different component arrangement.

[0163] In some embodiments, the server 4 is a device that can automatically perform numerical calculations and / or information processing according to pre-set or stored instructions, and its hardware includes but is not limited to microprocessors, application-specific integrated circuits, programmable gate arrays, digital processors, and embedded devices. The server 4 may also include client devices, which include but are not limited to any electronic product that can interact with a client through a keyboard, mouse, remote control, touchpad, or voice-controlled device, such as a personal computer, tablet computer, smart phone, digital camera, etc.

[0164] It should be noted that the server 4 is only an example, and other existing or future electronic products that are suitable for the present application should also be included in the protection scope of the present application and included here by reference.

[0165] In some embodiments, the memory 41 stores a computer program, and when the computer program is executed by the at least one processor 42, all or part of the steps in the method for reducing routing overhead of the ad hoc network are implemented. The memory 41 includes a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), a one-time programmable read-only memory (OTPROM), an electronically erasable programmable read-only memory (EEPROM), a compact disc read-only memory (CD-ROM) or other optical disc storage, magnetic disk storage, magnetic tape storage, or any other computer-readable medium that can be used to carry or store data. Further, the computer-readable storage medium may mainly include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application required for at least one function, and the like.

[0166] In some embodiments, the at least one processor 42 is the control core (ControlUnit) of the server 4, and uses various interfaces and lines to connect the various components of the entire server 4, and executes various functions and processes data of the server 4 by running or executing the program or module stored in the memory 41, and calling the data stored in the memory 41. For example, when the at least one processor 42 executes the computer program stored in the memory, it implements all or part of the steps of the method for reducing the routing overhead of the self-organizing network described in the embodiment of the present application; or implements all or part of the functions of the device for reducing the routing overhead of the self-organizing network. The at least one processor 42 can be composed of an integrated circuit, for example, it can be composed of a single packaged integrated circuit, or it can be composed of multiple integrated circuits with the same function or different functions, including one or more central processing units (CPUs), microprocessors, digital processing chips, graphics processors, and a combination of various control chips.

[0167] In some embodiments, the at least one communication bus 43 is configured to realize the connection and communication between the memory 41 and the at least one processor 42, etc. Although not shown, the server 4 may also include a power supply (such as a battery) for powering each component. Preferably, the power supply may be logically connected to the at least one processor 42 through a power management device, so as to realize the functions of managing charging, discharging, and power consumption management through the power management device. The power supply may also include any components such as one or more DC or AC power supplies, recharging devices, power failure detection circuits, power converters or inverters, power status indicators, etc. The server 4 may also include a variety of sensors, Bluetooth modules, Wi-Fi modules, etc., which will not be repeated here.

[0168] The above integrated unit implemented in the form of software function modules can be stored in a computer-readable storage medium. The above software function modules are stored in a storage medium and include several instructions for enabling a server or a processor to execute parts of the methods described in various embodiments of the present application.

[0169] In the several embodiments provided in this application, it should be understood that the disclosed devices and methods can be implemented in other ways. For example, the device embodiments described above are only illustrative, for example, the division of the modules is only a logical function division, and there may be other division methods in actual implementation.

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

[0171] The above contents are only specific implementation methods of the present application, but the protection scope of the present application is not limited thereto. Any technician familiar with the technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be covered by the protection scope of the present application.

Claims

1. A method for reducing routing overhead in an ad hoc network, characterized in that: The method comprises: Performing clustering processing on the self-organizing network according to node information of member nodes in the self-organizing network to obtain a node cluster set; Determine a cluster head node of each node cluster in the node cluster set, wherein the cluster head node is used to obtain fusion data of the corresponding node cluster; The cluster head node receives fusion data sent by the cluster head node of the neighboring node cluster to maintain the link state table of the corresponding node cluster, and the self-organizing network is clustered according to the node information of the member nodes in the self-organizing network to obtain the node cluster set including: Obtaining application requirements of the ad hoc network; The self-organizing network is clustered according to the node information of the member nodes in the self-organizing network using a clustering routing algorithm according to the application requirements to obtain the node cluster set, and the determining of the cluster head node of each node cluster in the node cluster set includes: Determining a plurality of first target nodes according to the topological structure of the node cluster; Obtaining a node load status of each of the first target nodes; Acquire a plurality of second target nodes whose node load status is less than a preset node load status from the plurality of first target nodes; Acquire the routing information interaction data volume of the plurality of second target nodes; The second target node with the lowest amount of routing information interaction data is determined as the cluster head node of the node cluster.

2. The method for reducing routing overhead of an ad hoc network according to claim 1, characterized in that: The method further comprises: In each election cycle, each member node in the node cluster is periodically and in rotation with equal probability to update the cluster head node of the node cluster.

3. The method for reducing routing overhead of an ad hoc network according to claim 1, characterized in that: The cluster head node obtains the fusion data of the corresponding node cluster in the following manner: The cluster head node acquires first data monitored by a non-cluster head node in the corresponding node cluster; The cluster head node monitors second data; The cluster head node obtains the fused data according to the first data and the second data.

4. The method for reducing routing overhead of an ad hoc network according to claim 1, characterized in that: The method further comprises: A first distance between a member node and a neighboring member node in the node cluster is calculated, a first information update period is determined according to the first distance, and node information of the member node is updated to the neighboring member node according to the first information update period.

5. The method for reducing routing overhead of an ad hoc network according to claim 4, characterized in that: The method further comprises: The second distance between the cluster head node and the neighboring cluster head node in the node cluster set is calculated, a second information update period is determined according to the second distance, and the fusion data of the cluster head node is updated to the neighboring cluster head node according to the second information update period.

6. The method for reducing routing overhead of an ad hoc network according to any one of claims 1 to 3, characterized in that: The method further comprises: When it is detected that the node information of any member node changes, the update information of the member node is obtained; According to the update information, the node cluster corresponding to any member node is updated to obtain an updated node cluster; Update any member node according to the update information to obtain an updated routing state and an updated topology structure; The node cluster corresponding to any member node is updated according to the updated routing state and the updated topology structure to obtain an updated node cluster.

7. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the computer program, the method for reducing routing overhead of a self-organizing network as described in any one of claims 1 to 6 is implemented.

8. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed, the steps of the method for reducing routing overhead in an ad hoc network as claimed in any one of claims 1 to 6 are implemented.