Domain perception MPR election method based on multi-dimensional identification

Abstract

The invention belongs to the field of wireless communication, and discloses a domain sensing MPR election method based on multi-dimensional identification, which comprises the following steps: step 1, in an NID domain, a node broadcasts and receives a HELLO message to discover neighbor nodes in the same domain, step 2, electing a part of the neighbor nodes in the same domain as an MS node set of MPR node election, step 3, after one node is elected as an MPR node by a neighbor node, identifying and electing the own neighbor node through the received HELLO message, and maintaining an MS node set; step 4, packaging link information between the MPR node and each node in the MS node set into TC information; and step 5, flooding the TC message to the whole NID domain where the TC message is located. According to the invention, invalid redundant nodes are eliminated, the success rate of data transmission can be improved, each selected MPR node is ensured to have stable connection in a high mobility environment, and the network efficiency is improved.

Description

TECHNICAL FIELD

[0001] The application belongs to the field of wireless communication, and particularly relates to a multi-dimensional identifier-based domain-aware MPR election method. BACKGROUND

[0002] In a traditional link state routing protocol, the propagation of network topology information usually depends on each node broadcasting a message to all its neighbor nodes, which can cause broadcast redundancy, bandwidth waste and significant decline in network performance in a large-scale network. With the increase in the number of nodes, repeated propagation of broadcast messages not only increases the network burden, but also causes an increase in delay and a decrease in throughput, which is more obvious in bandwidth-limited environments such as wireless self-organizing networks.

[0003] Based on a network identifier (NID), the prior art has designed a node and link state-based routing protocol (Zone Link State Routing, ZLSR). The protocol reduces the number of times of forwarding broadcast messages by selecting a small number of key nodes as relays.

[0004] The traditional MPR (Multi Point Relays) selection method has limitations in handling large-scale or complex network topologies due to the use of a greedy strategy, so the selected MPR set is often non-optimal and can easily generate additional network overhead. The energy consumption of MPR and the stability of nodes are not fully considered, and further optimization is needed to improve its performance in practical applications. SUMMARY

[0005] To solve the above technical problems, the application provides a multi-dimensional identifier-based domain-aware MPR election method, which limits the optimized MPR broadcast within a specific dynamic network domain, solves the limitations caused by the greediness of the traditional MPR method, and solves the deficiencies of the traditional method in resource utilization and connection reliability.

[0006] To achieve the above purpose, the application is implemented by the following technical solutions:

[0007] The application is a multi-dimensional identifier-based domain-aware MPR election method, which includes the following steps:

[0008] Step 1: In a specific multi-dimensional identifier NID domain, nodes discover the same domain neighbor nodes by periodically broadcasting and receiving HELLO packets, the HELLO packets contain the geographic coordinate information and multi-dimensional identifier NID information of one-hop neighbor nodes and the geographic coordinate information and multi-dimensional identifier NID information of two-hop neighbor nodes, so that the neighbor node discovery process has identity and domain awareness capability;

[0009] Step 2, the same domain neighbor nodes are discovered based on the HELLO packet, and a part of the MS node set, i.e. the multi-point relay selection node set, is elected as the MPR node set;

[0010] Step 3, after a node is elected as the MPR node by the neighbor nodes, the neighbor nodes electing the node are identified through the received HELLO packet, and the MS node set is maintained;

[0011] Step 4, the elected MPR node encapsulates the link information between the MPR node and each node in the MS node set into the TC (Topology Control) information;

[0012] Step 5, the MPR node floods the TC message encapsulated in step 4 to the entire NID domain where the TC message is located by using the MPR forwarding method, so as to effectively spread the key topology information.

[0013] Further improvement of the application is that in step 1, the multi-dimensional identification NID information includes the access network node, the core network node, the vehicle-mounted network node and the terminal network node.

[0014] Further improvement of the application is that in step 2, the metrics for the MPR node election include the coverage degree of the node, the node connection degree and the distribution stability, i.e. the neighbor number variance.

[0015] Further improvement of the application is that in step 2, the MS node set election method specifically includes the following steps:

[0016] Step 2.1, multi-dimensional screening is performed in all one-hop neighbor nodes: high-quality nodes with high coverage degree and stable distribution are screened out based on the geographic coordinate information of the one-hop neighbor nodes and the multi-dimensional identification NID information, and a high-quality node candidate pool is formed;

[0017] Step 2.2, the high-quality nodes in the high-quality node candidate pool are sorted according to the number of two-hop neighbor nodes that can be connected by the high-quality nodes: one-hop neighbor nodes in the high-quality node candidate pool that can cover isolated two-hop neighbor nodes are selected as the required nodes of the high-quality node candidate pool, and the isolated two-hop neighbor nodes refer to two-hop neighbor nodes connected to the target node through only one neighbor node;

[0018] Step 2.3, after the required nodes are screened out, the selection of the MS node set is performed in the remaining one-hop neighbor nodes until all the two-hop neighbor nodes are covered.

[0019] Further improvement of the application is that step 2.1 specifically includes the following steps:

[0020] Step 2.1.1, starting from any one node ​ Discovering one-hop neighbor set of a node through HELLO packet and two-hop neighbor set , and obtaining and storing geographic coordinate information and multi-dimensional identification NID information of all one-hop neighbor nodes through HELLO packet

[0021] Step 2.1.2, traversing all one-hop neighbor nodes and calculating quality of neighbor nodes of each one-hop neighbor set :

[0022]

[0023]

[0024]

[0025] For each one-hop neighbor node , define neighbors in four regions determined by angles :

[0026] : where neighbors of ;

[0027] : where neighbors of ;

[0028] : where neighbors of ;

[0029] : where neighbors of ;

[0030] wherein is a weight factor, which is dynamically adjusted according to network strategy, , , and are four regions, is a weight assigned to each region, , is neighbor coverage of a neighbor node, is variance of number of neighbors in four regions, i.e. distribution stability, nodes with higher value and lower variance will be given priority, is node connection score, which is used to determine whether to forward according to multi-dimensional identification NID information, and nodes with high quality value are included in high-quality node candidate pool, i.e. HQ-POOL set.

[0031] The further improvement of the present application is that in step 2.2, specifically comprising the following steps:

[0032] Step 2.2.1, for the nodes of the MPR node set to be calculated, all one-hop neighbors in the high-quality node candidate pool are regarded as set F, and the one-hop neighbor nodes connected by the elements of set F are all two-hop neighbor nodes which are elements of set S;

[0033] Step 2.2.2, if set F is empty, wait until the topology changes, if F is not empty, use the letter …number the elements in set F, and number the elements in set S with numbers 1, 2, 3, 4…, and set the initial value of the MPR node set to be empty;

[0034] Step 2.2.3, sort set F from large to small according to the number of two-hop neighbor nodes of set S connected by the one-hop neighbor nodes in set F;

[0035] Step 2.2.4, in the sorted set F, first find a two-hop neighbor node belonging to only one one-hop neighbor node, then add the one-hop neighbor node connected by the two-hop neighbor node to the MPR node set from set F, and mark the two-hop neighbor nodes connected by the one-hop neighbor node in set S, if not found, first assume to delete the smallest element in set F, i.e. the one-hop neighbor node, then judge whether the union set of the two-hop neighbor nodes corresponding to the one-hop neighbor nodes in set F is equal to the two-hop neighbor nodes in set S which are not marked, if the union set of the two-hop neighbor nodes corresponding to the one-hop neighbor nodes is the same as the two-hop neighbor nodes in set S which are not marked, directly delete the one-hop neighbor node in set F which does not meet the judgment condition, and mark the two-hop neighbor nodes connected by the deleted node in set S, and each time the set F stage is moved to the MPR node set, the union set of the MPR nodes needs to be operated, and then it is judged whether the two-hop neighbor nodes connected by the MPR nodes after the union set operation are completely the same as the two-hop neighbor nodes in set S, if the judgment result is the same, the process is ended;

[0036] Step 2.2.5, repeat step 2.2.4 until all elements in the MPR node set are completely traversed.

[0037] The further improvement of the present application is that in step 5, the MPR node uses local broadcast and MPR forwarding method to flood the TC message to the multi-dimensional identification network, and the node completes the grasp of the topology of the multi-dimensional identification network by receiving the TC message, and the MPR node encapsulates the link information between the MPR node and the MS node into the TC message and sends it to a specific NID domain.

[0038] The further improvement of the present application is that the HELLO packet includes a plurality of Link control messages, and the links between the neighbor nodes are grouped according to the link state and the neighbor type, and a group of links is included in a Link control message.

[0039] The beneficial effects of the present application are:

[0040] The present application improves the success rate of data transmission: the present application uses cycle and set operations to optimize the selection of MPR set, eliminates invalid redundant nodes, and can improve the success rate of data transmission.

[0041] The present application reduces network overhead: the present application reduces network overhead by reducing unnecessary message forwarding. This is because the new method can more accurately select the nodes that need to be forwarded, thereby reducing redundant forwarding operations.

[0042] The present application optimizes the size of the MPR set: the present application considers the connectivity of the nodes when selecting MPR nodes, so as to select the optimal MPR set, which helps to reduce the size of the MPR set and further improve network efficiency.

[0043] The present application improves network stability: the present application ensures that each selected MPR node has stable connections in a high mobility environment by spatial distribution screening of candidate nodes. BRIEF DESCRIPTION OF DRAWINGS

[0044] Figure 1 is a flowchart of the present application.

[0045] Figure 2 is a flowchart of the MPR set election method of the present application.

[0046] Figure 3 is an example topology of the MPR election method of the present application.

[0047] Figure 4 is a diagram of the MPR set size of the MPR election method of the present application and the traditional MPR node election method.

[0048] Figure 5 is a diagram of the data transmission success rate of the MPR election method of the present application and the traditional MPR node election method. DETAILED DESCRIPTION

[0049] The embodiments of the present application will be described below with reference to the drawings, and many practical details will be described in the following description for the purpose of clear illustration. However, it should be understood that these practical details are not used to limit the present application. That is, in some embodiments of the present application, these practical details are unnecessary.

[0050] As Figure 1As shown, the application is a multi-dimensional identification based domain-aware MPR election method, which specifically includes the following steps:

[0051] Step 1, in a specific multi-dimensional identification NID domain, nodes discover the same domain neighbor nodes by periodically broadcasting and receiving HELLO packets, the HELLO packets contain one-hop neighbor node geographic coordinate information and multi-dimensional identification NID information and two-hop neighbor node geographic coordinate information and multi-dimensional identification NID information, so that the neighbor node discovery process has identity and domain awareness, and the multi-dimensional identification NID information includes access network nodes, core network nodes, vehicle network nodes and terminal network nodes.

[0052] Step 2, a part of the same domain neighbor nodes discovered based on the HELLO packet is elected as the MS node set of the MPR node election, the metric of the MPR node election includes the coverage of the node, the node connection degree and the distribution stability, i.e. the neighbor number variance. For example, Figure 2 As shown, the MS node set election method specifically includes the following steps:

[0053] Step 2.1, multi-dimensional screening is performed in all one-hop neighbor nodes: based on the geographic coordinate information and multi-dimensional identification NID information of the one-hop neighbor nodes, high-quality nodes with high coverage and stable distribution are screened out to form a high-quality node candidate pool.

[0054] Specifically, starting from any node , the node discovered the one-hop neighbor set and two-hop neighbor set of the node through the HELLO packet, and obtains and stores the geographic coordinate information and multi-dimensional identification NID information of all one-hop neighbor nodes through the HELLO packet; all one-hop neighbor nodes are traversed, and the quality of the neighbor nodes of each one-hop neighbor set is calculated :

[0055]

[0056]

[0057]

[0058] For each one-hop neighbor node , the neighbors located in the four regions determined by the angle are defined as follows:

[0059] : wherein ​neighbors of

[0060] wherein neighbors of

[0061] wherein neighbors of

[0062] wherein neighbors of

[0063] wherein, is a weight factor, dynamically adjusted according to network policy, , , and is the weight assigned to each region, is the weight assigned to each region, , is the neighbor coverage of the neighbor node, is the variance of the number of neighbors in the four regions, i.e. the distribution stability, and the node with a higher value and a lower variance will be given priority, is the node connection score, which is used to determine whether to forward according to the multi-dimensional identifier NID information, and the node with a high quality value is included in the high-quality node candidate pool, i.e. the HQ-POOL set.

[0064] Step 2.2, according to the number of two-hop neighbor nodes that can be connected by the high-quality nodes in the high-quality node candidate pool in step 2.1, sort: select the one-hop neighbor node that can cover the isolated two-hop neighbor node in the high-quality node candidate pool as the required node of the high-quality node candidate pool, the isolated two-hop neighbor node refers to the two-hop neighbor node connected to the target node through only one neighbor node. Specifically: step 2.2.1, for the node set of MPR to be calculated, all one-hop neighbors in the high-quality node candidate pool are regarded as set F, and the elements of set F, i.e. the one-hop neighbor nodes, connect all two-hop neighbor nodes, which are the elements of set S;

[0065] Step 2.2.2, if set F is empty, wait until the topology changes, if F is not empty, use the letter …to number the elements in set F, and use the numbers 1, 2, 3, 4…to number the elements in set S, and set the initial value of the MPR node set to empty;

[0066] Step 2.2.3, according to the number of two-hop neighbor nodes in set S connected by the one-hop neighbor nodes in set F, sort set F from large to small;

[0067] Step 2.2.4, in the ordered set F, first find a two-hop neighbor node which only belongs to one one-hop neighbor node, then add the one-hop neighbor node connected to the two-hop neighbor node from set F to the MPR node set, and mark the two-hop neighbor node connected to the one-hop neighbor node in set S, if not found, first assume to delete the minimum element in set F, i.e. the one-hop neighbor node, then judge whether the union set of the two-hop neighbor nodes corresponding to the one-hop neighbor nodes in set F is equal to the unmarked two-hop neighbor nodes in set S, if the union set of the two-hop neighbor nodes corresponding to the one-hop neighbor nodes is equal to the unmarked two-hop neighbor nodes in set S, then directly delete the one-hop neighbor node which does not meet the judgment condition from set F, and mark the two-hop neighbor nodes connected to the deleted node in set S, and each time the set F stage is moved to the MPR node set, the union set of the MPR nodes needs to be operated, and then it is judged whether the two-hop neighbor nodes connected by the MPR nodes after the union set operation are completely the same as the two-hop neighbor nodes in set S, if the judgment result is the same, the process is ended;

[0068] Step 2.2.5, repeat step 2.2.4 until all elements in the MPR node set, i.e. nodes, are completely traversed.

[0069] Step 2.3, after the selection of the mandatory nodes is screened, the selection of the MS node set is performed in the remaining one-hop neighbor nodes until all two-hop neighbor nodes are covered.

[0070] Step 3, after a node is elected as an MPR node by a neighbor node, the neighbor nodes which elect the node are identified through the received HELLO packet, and the MS node set is maintained;

[0071] Step 4, the elected MPR node encapsulates the link information between the MPR node and each node in the MS node set into a TC (Topology Control) message;

[0072] Step 5, the MPR node floods the TC message encapsulated in step 4 to the entire NID domain where the TC message is located by using the MPR forwarding method. The key topology information is effectively diffused, the MPR node floods the TC message to the multi-dimensional identification network by using the local broadcast and MPR forwarding method, and the node completes the grasp of the topology of the multi-dimensional identification network by receiving the TC message. The MPR node encapsulates the link information between the MPR node and the MS node into a TC message and sends it to a specific NID domain.

[0073] Embodiment

[0074] The one-hop neighbor nodes in the HQ-POOL set are used as the MPR nodes , 、 、 、 、 The one-hop neighbors are numbered 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12 respectively, and the two-hop neighbors are numbered 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12 respectively. The MPR set is defined as an empty set. F is the set of all one-hop neighbors, and S is the set of all two-hop neighbors.

[0075] Count the number of elements according to the number of elements 、 、 、 、 and , and sort them in descending order.

[0076]

[0077] First, traverse the one-hop neighbor set to find whether there is a node whose corresponding two-hop neighbor node can only be covered by the node; if the condition is met, add the node to the MPR set and merge it with the existing elements in the MPR. Subsequently, mark the covered nodes in the two-hop neighbor set S as covered, and remove the node from the one-hop neighbor set F to ensure that it no longer participates in the subsequent steps.

[0078]

[0079] (Marked elements should be included)

[0080]

[0081] After ignoring the marked two-hop neighbors, check whether there is a two-hop neighbor node that can only be covered by one one-hop neighbor node.

[0082]

[0083] In this check, no two-hop neighbor node that can only be covered by one one-hop neighbor node is found. Therefore, remove the element with the lowest priority from the sorted one-hop neighbor set F. After removal, the set F is updated to { , , , }, that is, the union of , , , .

[0084] ​

[0085] Only non-marked elements), so can be removed directly.

[0086] S6: Ignore the marked two-hop neighbor nodes, and determine whether there is a two-hop neighbor node that only belongs to a unique one-hop neighbor.

[0087]

[0088] The one-hop neighbor nodes of two-hop neighbor nodes 3 and 4 can only be covered by . Therefore, first add to the MPR set, and remove from the one-hop neighbor set F. Mark the two-hop neighbor nodes 3, 4, 5, 6, and 7 related to as covered. Finally, find the union of the two-hop neighbor nodes covered by all nodes in the MPR set, and determine whether the union is equal to the two-hop neighbor set S, to verify whether all two-hop neighbor nodes have been completely covered.

[0089]

[0090] Since (marked elements should be included), continue to calculate.

[0091] After ignoring the marked two-hop neighbor nodes, check whether there is a two-hop neighbor node that is not covered and can only be covered by a unique one-hop neighbor node.

[0092]

[0093] Currently, no two-hop neighbor node that can only be covered by one one-hop neighbor node is found. According to the sorting result, remove the element with the lowest priority from the one-hop neighbor set F. After removal, the set F is updated to , , that is, the union of and .

[0094]

[0095] Since (only non-marked elements), so can be removed.

[0096] After ignoring the marked two-hop neighbor nodes, check whether there is a two-hop neighbor node that is not covered and can only be covered by a unique one-hop neighbor node.

[0097]

[0098] One-hop neighbor node The two-hop neighbor nodes 11 and 12 can only be Therefore, Join the MPR set and remove from the one-hop neighbor set F Next, mark The relevant two-hop neighbor nodes 8, 9, 10, 11, and 12 are in the covered state. Finally, the union of the two-hop neighbor nodes covered by all nodes in the MPR set is calculated, and it is determined whether the union is equal to the two-hop neighbor set S to verify whether all two-hop neighbor nodes have been completely covered.

[0099]

[0100] because (The marked elements should be included).

[0101] Therefore, all two-hop neighbor nodes are just covered and the method ends.

[0102] This application compares the performance with the traditional MPR node election method. The comparison results are as follows Figure 4 and Figure 5 Compared with the traditional algorithm, under the same topology, the final set of MPR nodes elected in this application is smaller and the algorithm execution time is shorter.

[0103] The foregoing is merely an embodiment of the present application and is not intended to limit the present application. For those skilled in the art, the present application may have various modifications and variations. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present application should be included within the scope of the claims of the present application.

Claims

1. A domain-aware MPR election method based on multi-dimensional identification, characterized by: The domain-aware MPR election method specifically includes the following steps: Step 1: Within an NID domain, a node discovers neighbor nodes in the same domain by periodically broadcasting and receiving HELLO messages. The HELLO messages contain the geographic coordinate information and multi-dimensional identifier (NID) information of one-hop neighbor nodes and the geographic coordinate information and multi-dimensional identifier (NID) information of two-hop neighbor nodes. Step 2: Select a part of the neighbor nodes in the same domain discovered based on the HELLO message as the MS node set for MPR node election, namely the multipoint relay selection node set; Step 3: After a node is elected as an MPR node by a neighbor node, it uses the received HELLO message to identify the neighbor node that elected it and maintain the MS node set; Step 4: The elected MPR node encapsulates the link information between the MPR node and each node in the MS node set into TC information; Step 5: The MPR node uses the MPR forwarding method to flood the TC message encapsulated in step 4 to the entire NID domain where the TC message is located.

2. The domain-aware MPR election method based on multi-dimensional identification according to claim 1, characterized in that: In step 1, the multi-dimensional identification NID information includes access network nodes, core network nodes, vehicle network nodes and terminal network nodes.

3. The domain-aware MPR election method based on multi-dimensional identification according to claim 1, characterized in that: In step 2, the metrics of MPR node selection include node coverage, node connectivity score, and distribution stability, i.e., the variance of the number of neighbors.

4. The domain-aware MPR election method based on multi-dimensional identification according to claim 3, characterized in that: In step 2, the MS node set election method specifically includes the following steps: Step 2.1: Perform multi-dimensional screening among all one-hop neighbor nodes: Filter out high-quality nodes based on the geographic coordinate information and multi-dimensional identification (NID) information of the one-hop neighbor nodes to form a high-quality node candidate pool; Step 2.2: Sort the high-quality node candidate pool in step 2.1 by the number of two-hop neighbor nodes to which the high-quality node can be connected: select a one-hop neighbor node in the high-quality node candidate pool that can cover an isolated two-hop neighbor node as a required node in the high-quality node candidate pool, where the isolated two-hop neighbor node refers to a two-hop neighbor node connected to the target node through only one neighbor node; Step 2.3: After the required nodes are screened, the MS node set is selected from the remaining one-hop neighbor nodes until all two-hop neighbor nodes are covered.

5. The domain-aware MPR election method based on multi-dimensional identification according to claim 4 is characterized in that: The step 2.1 specifically includes the following steps: Step 2.1.1, from any node Start, Node Discover nodes through HELLO messages One-hop neighbor set and the set of two-hop neighbors And obtain and store the geographic coordinate information and multi-dimensional identification NID information of all one-hop neighbor nodes through HELLO messages; Step 2.1.2, traverse all one-hop neighbor nodes and calculate each one-hop neighbor set The quality of neighbor nodes : ， ， ， For each one-hop neighbor node , defined by the angle Neighbors in the four identified areas : :in Neighbors; :in Neighbors; :in Neighbors; :in Neighbors; in, is the weight factor, 、 、 and There are four regions, is the weight assigned to each region, , is the neighbor coverage of neighbor nodes, is the variance of the number of neighbors in the four regions, i.e., the distribution stability, Divide the node connection into Nodes with high values ​​are included in the high-quality node candidate pool, namely the HQ-POOL set.

6. The domain-aware MPR election method based on multi-dimensional identification according to claim 4, characterized in that: The step 2.2 specifically includes the following steps: Step 2.2.

1. For the node in the MPR node set to be calculated, all one-hop neighbors in the high-quality node candidate pool are considered as set F. The elements of set F, i.e., the one-hop neighbor nodes connected to all the two-hop neighbor nodes, are elements of set S. Step 2.2.

2. If the set F is empty, wait until the topology changes. If F is not empty, number the elements in the set F with letters, number the elements in the set S with numbers, and set the initial value of the MPR node set to empty. Step 2.2.

3. Sort the set F from largest to smallest based on the number of two-hop neighbor nodes in the set S to which the one-hop neighbor nodes in the set F are connected. Step 2.2.4: In the sorted set F, first find a two-hop neighbor node that belongs to only one one-hop neighbor node. Then, add the one-hop neighbor node connected to the two-hop neighbor node from set F to the MPR node set. At the same time, mark the two-hop neighbor nodes connected to the one-hop neighbor node in set S. If not found, first assume that the smallest element in set F, that is, the one-hop neighbor node, is deleted. Then, determine whether the union of the two-hop neighbor nodes corresponding to the one-hop neighbor node in set F is equal to the unmarked two-hop neighbor nodes in set S. If the union of the two-hop neighbor nodes corresponding to the one-hop neighbor node is the same as the unmarked two-hop neighbor nodes in set S, then directly delete the one-hop neighbor node that does not meet the judgment condition from set F, and mark the two-hop neighbor nodes connected to the deleted node in set S. At the same time, each time a stage in set F is moved to the MPR node set, it is necessary to perform a union operation on the MPR node. Then, determine whether the two-hop neighbor nodes connected by the MPR node after the union are exactly the same as the two-hop neighbor nodes in set S. If the judgment results are the same, end. Step 2.2.5: Repeat step 2.2.4 until all elements in the MPR node set are completely traversed.

Images