WO2020093190A1 - Routing method and apparatus for mobile ad hoc network - Google Patents

Abstract

The present invention provides a routing method and apparatus for a mobile ad hoc network, applied to a target network node in a mobile ad hoc network. First, node information of neighbor nodes of a target network node within a preset range is obtained, wherein said information comprises device forms; then, multipoint relay (MPR) nodes matching the target network node are determined according to the device forms of the neighbor nodes within the preset range; and finally, network topology information obtained by the target network node according to the node information of the neighbor nodes within the preset range is flooded in the mobile ad hoc network by means of the MPR nodes matching the target network node, for each network node in the mobile ad hoc network to determine corresponding routing information. According to the present invention, MPR nodes are determined based on device forms to flood topology information, thereby overcoming the disadvantage of being unable to obtain a better MPR node set by simply selecting MPR nodes from network node coverage, and improving the network efficiency and comprehensive network performance of the mobile ad hoc network on the whole.

Description

Routing method and device of wireless ad hoc network Technical field

The present invention relates to the field of network technology, and more specifically, to a routing method and device for wireless ad hoc networks.

Background technique

The wireless ad hoc network (MANET, Mobile Ad Hoc Network) is a temporary multi-hop autonomous system composed of a group of mobile nodes with wireless transceiver devices. It does not need to rely on the preset information infrastructure network. It can quickly build a mobile communication network at any time and any place. It has the characteristics of temporary networking, rapid deployment, no control center, and strong resistance to destruction.

In the process of wireless ad hoc networking, the forwarding node in the forwarding routing table is usually updated in real time according to the channel occupancy, or the route is designed according to the change of the physical link quality, thereby reducing the network congestion and improving the network performance. However, due to differences in the use environment and usage scenarios of communication devices in the wireless ad hoc network, even communication devices with the same communication system may derive different device forms. The existing routing scheme ignores the device forms of different network nodes The difference is that when multiple types of devices are mixed, the characteristics of the device form cannot be fully utilized to take advantage of the device, so that the wireless ad hoc network has low network efficiency and poor network stability, which affects the wireless ad hoc network. Combined network performance.

Therefore, there is an urgent need for a networking solution that can effectively improve the overall network performance of wireless ad hoc networks.

Summary of the invention

In view of this, the present invention provides a routing method and device for a wireless ad hoc network to solve the technical problem that the overall network performance of the wireless ad hoc network is lower due to the existing networking method.

To achieve the above objectives, the present invention provides the following technical solutions:

A routing method for a wireless ad hoc network is applied to a target network node, and the target network node is any network node in the wireless ad hoc network; the method includes:

Obtain the node information of the neighbor node of the target network node within a preset range; the node information includes the device form;

Determine the multipoint relay MPR node matching the target network node according to the device form of the neighbor node within the preset range;

The MPR nodes matched by the target network node are used to flood the network topology information sensed by the target network node in the wireless ad hoc network, and used for each network node in the wireless ad hoc network to determine corresponding routing information .

Preferably, the acquiring node information of neighbor nodes of the target network node within a preset range includes:

Receiving a first heartbeat message sent by a one-hop neighbor node of the target network node;

Wherein, the first heartbeat message carries: the node information of the one-hop neighbor node, and the node information of the neighbor node of the one-hop neighbor node within the range of one hop;

According to the first heartbeat message, obtain the node information of the neighbor node of the target network node within two hops.

Preferably, the preset range is a two-hop range; neighbor nodes of the target network node within the preset range include: a one-hop neighbor node and a two-hop neighbor node of the target network node; Setting the device form of the neighbor node within the range, and determining the multipoint relay MPR node that the target network node matches include:

According to the one-hop neighbor node and the two-hop neighbor node of the target network node, respectively determine the set of one-hop neighbor nodes and the set of two-hop neighbor nodes of the target network node;

Acquiring the number of nodes of two-hop neighbor nodes that are covered by each one-hop neighbor node in the one-hop neighbor node set in the two-hop neighbor node set;

According to the number of nodes of the two-hop neighbor nodes covered by the respective one-hop neighbor nodes in the two-hop neighbor node set respectively, the one-hop neighbor node set and any one of the two-hop neighbor node set The one-hop neighbor node with the two-hop neighbor node having a unique path is determined as the MPR node matching the target network node; correspondingly, the one-hop neighbor node with the unique path is deleted from the one-hop neighbor node set, And from the set of two-hop neighbor nodes, delete the two-hop neighbor nodes covered by the one-hop neighbor nodes with unique paths;

When the number of one-hop neighbor nodes that have a unique path with any one of the two-hop neighbor nodes in the set of one-hop neighbor nodes is zero, or when the two-hop neighbor nodes When the number of remaining two-hop neighbor nodes in the set is not zero, obtain a device corresponding to the device form of the remaining one-hop neighbor node according to the device form of the remaining one-hop neighbor node in the one-hop neighbor node set The weight value is used as the device weight value of the remaining one-hop neighbor node;

The remaining one-hop neighbor nodes with the largest device weights in the set of one-hop neighbor nodes are determined as the MPR nodes matching the target network node; correspondingly, the device is deleted from the set of one-hop neighbor nodes The remaining one-hop neighbor node with the largest weight, and deleting the remaining two-hop neighbor nodes covered by the remaining one-hop neighbor node with the largest equipment weight from the set of two-hop neighbor nodes.

Preferably, the node information further includes moving speed, remaining power, link quality, and congestion status; in the acquiring, a device weight corresponding to the device form of the remaining one-hop neighbor node is used as the remaining one-hop After the device weights of neighbor nodes, the method further includes:

When the device weights of each remaining one-hop neighbor node in the set of one-hop neighbor nodes are the same, the moving speed weight, the remaining power weight, the link quality weight, and the congestion status of each remaining one-hop neighbor node are acquired Weight

According to the moving speed weights, remaining power weights, link quality weights, and congestion status weights of the remaining one-hop neighbor nodes, calculate the comprehensive weights of the remaining one-hop neighbor nodes, respectively;

The MPR node matched by the target network node is determined according to the integrated weight of each remaining one-hop neighbor node.

Preferably, the determining the MPR node according to the comprehensive weight of each remaining one-hop neighbor node includes:

The remaining one-hop neighbor nodes with the largest integrated weights in the set of one-hop neighbor nodes are determined as the MPR nodes matching the target network node; correspondingly, the synthesis is deleted from the one-hop neighbor node set The remaining one-hop neighbor node with the largest weight, and deleting the remaining two-hop neighbor nodes covered by the remaining one-hop neighbor node with the largest comprehensive weight from the set of two-hop neighbor nodes.

Preferably, after calculating the comprehensive weights of the remaining one-hop neighbor nodes respectively, the method further includes:

When the integrated weights of the remaining one-hop neighbor nodes in the set of one-hop neighbor nodes are the same, obtain the nodes of the remaining two-hop neighbor nodes that are respectively covered by the remaining one-hop neighbor nodes in the two-hop neighbor node set Number

The MPR node matched by the target network node is determined according to the number of remaining two-hop neighbor nodes of the coverage.

Preferably, the determining the MPR node that the target network node matches according to the number of remaining two-hop neighbor nodes of the coverage includes:

According to the number of nodes of the remaining two-hop neighbor nodes covered by the remaining one-hop neighbor nodes in the set of two-hop neighbor nodes, cover the remaining two-hop neighbor nodes in the set of one-hop neighbor nodes The remaining one-hop neighbor node with the largest number of nodes is determined as the MPR node that matches the target network node; correspondingly, the number of nodes covering the remaining two-hop neighbor nodes is deleted from the one-hop neighbor node set The remaining one-hop neighbor node with the largest number, and from the set of two-hop neighbor nodes, delete the remaining two-hop neighbor nodes covered by the remaining one-hop neighbor node with the largest number of nodes covering the remaining two-hop neighbor nodes.

Preferably, the method further includes:

Obtain the network topology information of each network node in the wireless ad hoc network, to obtain the topology information of the entire network; the topology information of the entire network includes the device form of each network node;

The routing information of the target network node is determined according to the device form of each network node in the wireless ad hoc network.

Preferably, the network-wide topology information further includes the movement speed, remaining power, link quality, and congestion status of each network node; the target network is determined according to the device form of each network node in the wireless ad hoc network The routing information of the node includes:

Determine the weight of each link in the wireless ad hoc network according to at least one of the movement speed, remaining power, link quality, congestion status, and device shape of each network node in the wireless ad hoc network;

The routing information of the target network node is determined according to the weight of each link in the wireless ad hoc network.

Preferably, the method further includes:

Obtain the device number of the target network node according to preset device coding rules;

Acquiring the device form corresponding to the device number of the target network node according to the correspondence between the preset device number and the device form as the device form of the target network node;

According to the device configuration of the target network node, a corresponding routing strategy is implemented.

Preferably, the method further includes:

Sending a second heartbeat message to the one-hop neighbor node of the target network node;

Wherein, the second heartbeat message carries: the node information of the target network node, and the node information of the neighbor node of the target network node within a hop range.

A routing device for a wireless ad hoc network is applied to a target network node, and the target network node is any network node in the wireless ad hoc network; the device includes:

The neighbor information obtaining unit is used to obtain the node information of the neighbor node of the target network node within a preset range; the node information includes the device form;

An MPR node determining unit, configured to determine a multipoint relay MPR node matching the target network node according to the device form of the neighbor node within the preset range;

The topology information flooding unit is used for flooding the network topology information perceived by the target network node in the wireless ad hoc network through the MPR nodes matched by the target network node, and used in the wireless ad hoc network Each network node determines the corresponding routing information.

Preferably, the device further includes:

A topology information acquiring unit, configured to acquire network topology information of each network node in the wireless ad hoc network to obtain topology information of the entire network; the topology information of the entire network includes the device form of each network node;

The routing information determining unit is configured to determine the routing information of the target network node according to the device form of each network node in the wireless ad hoc network.

A storage medium stores computer program code, and when the computer program code is executed, the wireless ad hoc network routing method described above is implemented.

A routing terminal for a wireless ad hoc network is applied to a target network node, and the target network node is any network node in the wireless ad hoc network; the routing terminal includes a processor and a memory;

The processor is configured to obtain the node information of the neighbor node of the target network node within a preset range; the node information includes a device form; and determine the node according to the device form of the neighbor node within the preset range A multipoint relay MPR node matched by the target network node; the MPR node matched by the target network node floods the network topology information perceived by the target network node in the wireless ad hoc network for the wireless Each network node in the ad hoc network determines the corresponding routing information;

The memory is used to store node information of neighbor nodes of the target network node within a preset range, a multipoint relay MPR node matched by the target network node, and network topology information perceived by the target network node .

It can be seen from the above technical solutions that the wireless ad hoc network routing method and apparatus provided by the present invention are applied to the target network node of the wireless ad hoc network to obtain the device form of the neighbor node of the target network node within a preset range, And determine the multipoint relay MPR node that the target network node matches according to the device shape of the neighbor node within the preset range, which overcomes the disadvantage that the MPR node cannot be obtained by simply selecting the MPR node from the network node coverage To obtain a better set of MPR nodes, and through the MPR nodes matched by the target network node, flood the network topology information sensed by the target network node in the wireless ad hoc network for the wireless ad hoc network Each network node in the network determines the corresponding routing information, so as to effectively control the number of messages forwarded while ensuring message coverage, and improve the network efficiency and overall network performance of the wireless ad hoc network.

BRIEF DESCRIPTION

In order to more clearly explain the embodiments of the present invention or the technical solutions in the prior art, the following will briefly introduce the drawings required in the embodiments or the description of the prior art. Obviously, the drawings in the following description are only This is an embodiment of the present invention. For a person of ordinary skill in the art, without paying any creative labor, other drawings may be obtained according to the provided drawings.

FIG. 1 is a flowchart of a routing method for a wireless ad hoc network provided by an embodiment of this application;

2 is a flowchart of a heartbeat message interaction process provided by an embodiment of this application;

3 is an example diagram of a heartbeat message format provided by an embodiment of this application;

4 is a flowchart of a process for extracting device morphology provided by an embodiment of the present application;

FIG. 5 is an example diagram of a device encoding rule provided by an embodiment of this application;

6 is a flowchart of an MPR node determination process provided by an embodiment of this application;

7 is another flowchart of an MPR node determination process provided by an embodiment of this application;

FIG. 8 is another flowchart of the MPR node determination process provided by the embodiment of the present application;

9 is another flowchart of a routing method for a wireless ad hoc network provided by an embodiment of this application;

10 is a schematic diagram of a packet format of network topology information provided by an embodiment of the present application;

11 is a schematic structural diagram of a routing device for a wireless ad hoc network provided by an embodiment of this application;

FIG. 12 is another schematic structural diagram of a wireless ad hoc network routing device according to an embodiment of the present application.

detailed description

The technical solutions in the embodiments of the present invention will be described clearly and completely in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, but not all the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by a person of ordinary skill in the art without making creative efforts fall within the protection scope of the present invention.

The routing method of the wireless ad hoc network provided by the embodiment of the present invention is applied to a target network node, and the target network node is any network node in the wireless ad hoc network.

Please refer to FIG. 1. FIG. 1 is a flowchart of a routing method of a wireless ad hoc network according to an embodiment of the present application.

As shown in FIG. 1, the method includes:

S101: Acquire node information of a neighbor node of a target network node within a preset range.

The target network node is any network node in the wireless ad hoc network, and the neighbor node of the target network node refers to a network node near the target network node. The preset range may refer to a preset number of hops between network nodes, then the neighbor node of the target network node within the preset range may be a neighbor node of the target network node within the preset hop number range, such as one hop of the target network node Neighbor nodes, two-hop neighbor nodes, etc.

Network nodes usually have corresponding node information, such as congestion, remaining power, and moving speed. Since the network node is actually a device, the node information of the network node may also include the device form.

The form of the device refers to the form of the device under specific conditions, which can specifically refer to the specific form of the device in different use environments or different application scenarios, such as handheld form, carrying form, vehicle form, airborne form, drone Load form, ship form, etc.

When acquiring the node information of the neighbor nodes of the target network node within the preset range, the present invention acquires the device form of the neighbor node of the target network node within the preset range through the target network node, so as to facilitate the Formulate corresponding message forwarding strategies.

S102: Determine a multipoint relay MPR node matching the target network node according to the device form of the neighbor node within the preset range.

In the link-state routing protocol, the multi-point relay (MPR, Multi Point Relay) node mechanism can effectively reduce the number of messages forwarded during the network flooding process to overcome the large network maintenance overhead in the table-driven routing protocol Shortcomings, and can be widely used in large and dense network environment. Since only the network node selected as the MPR node forwards the message, and the MPR node only generates the link state information between the matching MPR nodes, whether the MPR node is selected accurately will directly affect the performance of the network.

The traditional greedy algorithm for selecting MPR nodes uses the coverage of network nodes as a priority strategy, so the near optimal solution obtained often has a certain redundancy, and it is impossible to obtain a better MPR node set; and, the greedy algorithm is just The minimum MPR node set for the local network node is not considered for the entire network. When a variety of different types of equipment are integrated, simply selecting the MPR node from the dimension of network node coverage is bound to fail Excellent MPR node set.

When determining the MPR node matched by the target network node, the present invention determines the multipoint relay MPR node matched by the target network node in combination with the reference factor of the device form of the neighbor node of the target network node within the preset range, which can be applied Different usage environments and application scenarios overcome the disadvantage of simply selecting MPR nodes from the coverage of network nodes, thereby obtaining a better set of MPR nodes.

S103: Flood the network topology information perceived by the target network node in the wireless ad hoc network through the MPR node matched by the target network node.

The invention floods the network topology information sensed by the target network node through a better MPR node set, and on the premise of ensuring message coverage, effectively controls the number of message forwarding, improves the message forwarding efficiency, and reduces the wireless The network load of the network increases the network performance of the wireless ad hoc network.

Wherein, the network topology information sensed by the target network node refers to the network topology information obtained by the target network node according to the node information of neighbor nodes within the preset range.

Flooding the network topology information obtained by the target network node according to the node information of the neighbor nodes within the preset range into the wireless ad hoc network, so that each network node in the wireless ad hoc network can be based on the wireless ad hoc network The flooded network topology information determines the corresponding routing information, that is, it is used for each network node in the wireless ad hoc network to determine the corresponding routing information, which improves the network efficiency of the wireless ad hoc network as a whole.

The routing method of the wireless ad hoc network provided in this embodiment obtains the device form of the neighbor node of the target network node within the preset range, and determines the target network node according to the device form of the neighbor node within the preset range The matched multi-point relay MPR node overcomes the shortcomings that simply selecting MPR nodes from the network node coverage cannot obtain a better MPR node set, can obtain a better MPR node set, and can be applied to different corresponding to different device forms Usage environment and application scenarios, through the MPR nodes matched by the target network node, the network topology information perceived by the target network node is flooded in the wireless ad hoc network for each network node in the wireless ad hoc network Determine the corresponding routing information, so as to effectively control the number of messages forwarded under the premise of ensuring message coverage, and improve the network efficiency and overall network performance of the wireless ad hoc network.

In specific applications, the node information interaction between the network nodes in the wireless ad hoc network is achieved through the heartbeat message interaction process. The heartbeat message interaction between the network nodes can be used to implement neighbor discovery and neighbor Various functions such as maintenance and link status monitoring. The heartbeat message of the network node may carry the node information of the network node. Correspondingly, the embodiment of the present application also provides a heartbeat message interaction solution applicable to the present invention.

Please refer to FIG. 2, which is a flowchart of a heartbeat message interaction process provided by an embodiment of the present application.

Taking the target network node applied in the wireless ad hoc network as an example, as shown in FIG. 2, the heartbeat message interaction process includes:

S201: Receive a first heartbeat message sent by a one-hop neighbor node of the target network node.

Wherein, the first heartbeat message carries: the node information of the one-hop neighbor node, and the node information of the neighbor node of the one-hop neighbor node within the range of one hop.

S202: Obtain the node information of the neighbor node of the target network node within two hops according to the first heartbeat message.

S203: Send a second heartbeat message to the one-hop neighbor node of the target network node.

Wherein, the second heartbeat message carries: the node information of the target network node, and the node information of the neighbor node of the target network node within a hop range.

The first heartbeat message refers to the heartbeat message sent by the one-hop neighbor node of the target network node to the target network node; the second heartbeat message refers to the heartbeat message sent by the target network node to its one-hop neighbor node. The first heartbeat message and the second heartbeat message use the same heartbeat message format. See FIG. 3 for details.

In the heartbeat message format shown in Figure 3, the number of neighbor nodes represents the number of one-hop neighbor nodes of the network node; the IP address of the neighbor node represents the IP address of the neighbor node; the device morphology represents the device morphology of the network node; the congestion degree represents the network The current traffic load of a node can be expressed as a value from 0 to 16. The larger the value, the more serious the current network congestion; the power characterizes the current remaining power of the network node; the speed characterizes the current moving speed of the network node; the link quality characterization is measured by the physical layer The communication quality of the current link obtained afterwards can be used for the first 4 bits to indicate the forward link quality and the last 4 bits to indicate the reverse link quality. The larger the value, the better the communication quality and the higher the communication rate; the transmission cycle refers to the heartbeat The message sending interval is in seconds; the MPR identifier is used to characterize the willingness of the network node to act as an MPR node of other network nodes (referred to as MPR willingness).

In an example, the MPR willingness can be expressed using Table 1 below.

Table 1 MPR wish list

A

low

in

high

Speed (V)	7	3	0
Energy (P)	0	3	7
Link quality (L)	0	3	7
Congestion state (C)	7	3	0

Among them, speed (V), energy (P), link quality (L), and congestion status (C) are the status parameters of the network nodes, and low, medium, and high represent the status parameter levels. Speed (V) refers to the moving speed of the network node, energy (P) refers to the remaining power of the node device, link quality (L) refers to the data transmission quality of the link where the network node is located, and congestion status (C) refers to the network The degree of node congestion.

As shown in Table 1, the speed level is inversely proportional to the size of the willingness value, the energy level is proportional to the size of the willingness value, the link quality level is proportional to the size of the willingness value, and the level of the congestion state level is related to the willingness Inversely proportional, therefore, when selecting MPR nodes, network nodes with low speed level, high energy level, high link quality and low congestion status level should be selected.

The MPR willingness value in Table 1 is only an optional example in this embodiment. In practical applications, the MPR willingness value of the network node is not limited to the willingness value shown in Table 1.

The device form of the network node may include at least one of a handheld form, a piggyback form, a vehicle form, an airborne form, an unmanned aerial vehicle load form, and a shipborne form. Of course, other device forms may be added according to specific requirements. For each device form, the corresponding device weights are set.

In an example, the correspondence between the device shape and the device weights can be shown in Table 2 below:

Table 2 Equipment form and corresponding weight

Equipment form (D)	Equipment weight
Handheld form	1
Piggyback pattern	2
Car form	5
Airborne form	7
UAV load pattern	3
Shipborne form	5

As an optional example, the MPR mark = (V + P + L + C + D) ÷ 5; in other examples, the MPR mark may also be determined by other calculation methods.

In this embodiment, steps S201-S202 may be used to implement the step of obtaining the node information of the neighbor node of the target network node within a preset range (S101) described in the foregoing embodiment. In addition, steps S201-S202 and step S203 are parallel to each other, and there is no successive trigger relationship.

The heartbeat message interaction process provided in this implementation realizes the node information interaction between each network node in the wireless ad hoc network, so that the target network node can not only send its own node information to other neighbor nodes, but also obtain other neighbor nodes. The node information sent by the node, in particular, obtains the device form of the neighbor node, so as to select the MPR node based on the device form, and obtain a better MPR node set, which can be applied to the use environment and application scenarios corresponding to different device forms.

Please refer to FIG. 4, which is a flowchart of an apparatus shape extraction process provided by an embodiment of the present application.

Still taking the target network node applied in the wireless ad hoc network as an example, as shown in FIG. 4, the device shape extraction process includes:

S301: Acquire a device number of the target network node according to a preset device coding rule.

Each network node is a device, and each device can have a globally unique number. After the device as the target network node is turned on, the device number of the device can be automatically read according to the preset device coding rules.

In an example, the device encoding rules shown in FIG. 5 may be used to encode device information. As shown in Figure 5, the device information includes the manufacturer's identification, device type and device number, and uses 6 bytes to encode the device information. Among them, 1 byte is used to store the manufacturer's identification, and 1 byte is used to store the device form Information, using 4 bytes to store the device number.

The manufacturer's logo is used to distinguish manufacturers of different devices. The manufacturers of different devices have different manufacturers' unique identifiers; the device type is used to distinguish different device forms and communication systems (see Table 3 below for specific definitions); the device number, ie For the device serial number, the device numbers corresponding to node devices with the same device form must be different, and the device numbers corresponding to node devices with different device forms can be the same.

Table 3 Device type definition

S302: Acquire a device form corresponding to the device number of the target network node.

There is a preset correspondence between the device number and the device form, and according to the correspondence between the preset device number and the device form, the device form corresponding to the device number of the target network node is acquired as the target network The device form of the node.

In an example, there is also a correspondence between the device shape and the routing strategy. Correspondingly, after obtaining the device shape of the target network node, the following operations can also be performed:

S303: Perform a corresponding routing strategy according to the device shape of the target network node.

Among them, the routing strategy corresponding to the form of the device may refer to a routing strategy that differs depending on the form of the device, for example, the period for sending protocol packets and the time for node failure.

The device form extraction process provided in this embodiment first obtains the device number of the target network node according to a preset device coding rule, and then obtains the target network node according to the correspondence between the preset device number and the device form The device form corresponding to the device number of, as the device form of the target network node, realizes the extraction of the device form of the target network node.

Please refer to FIG. 6, which is a flowchart of an MPR node determination process provided by an embodiment of the present application.

In this embodiment, taking the preset range as a two-hop range as an example, the neighbor nodes of the target network node within the preset range include: the one-hop neighbor node and the two-hop neighbor node of the target network node.

As shown in FIG. 6, the MPR node determination process includes:

S401: Determine the one-hop neighbor node set M1 (i) and the two-hop neighbor node set M2 (i) of the target network node i.

The node information of the neighbor nodes within the two-hop range acquired by the target network node i indicates that the target network node i has one-hop neighbor nodes and two-hop neighbor nodes. According to the one-hop neighbor node and the two-hop neighbor node of the target network node i, the one-hop neighbor node set M1 (i) and the two-hop neighbor node set M2 (i) of the target network node i can be determined respectively.

S402: Obtain the number of nodes of the two-hop neighbor nodes covered by the one-hop neighbor nodes in the one-hop neighbor node set M1 (i) in the two-hop neighbor node set M2 (i), respectively.

The number of two-hop neighbor nodes covered by any one-hop neighbor node refers to the number of two-hop neighbor nodes that the one-hop neighbor node can reach directly.

S403: Determine whether the two-hop neighbor node in M2 (i) has a one-hop neighbor node with which it has a unique communication, if yes, go to step S404; if not, go to step S406.

S404: Determine the one-hop neighbor node with unique communication as the MPR node matching the target network node i, and delete the one-hop neighbor node from M1 (i), and delete the one-hop node from M2 (i) Two-hop neighbor nodes covered by neighbor nodes.

Through steps S403-S404, according to the number of nodes of the two-hop neighbor nodes covered by the one-hop neighbor nodes M1 (i) in the one-hop neighbor node set M2 (i) respectively, the In the one-hop neighbor node set M1 (i), a one-hop neighbor node having a unique path with any two-hop neighbor node in the two-hop neighbor node set M2 (i) is determined to match the target network node i MPR node; correspondingly, delete the one-hop neighbor node with the unique path from the one-hop neighbor node set M1 (i), and delete the two-hop neighbor node set M2 (i) A two-hop neighbor node covered by a one-hop neighbor node with a unique path is described.

In an example, a corresponding MPR (i) set may be pre-defined for the target network node i, and used to store the MPR nodes that the target network node i matches.

S405: Determine whether the number of the remaining two-hop neighbor nodes in M2 (i) is zero. If not, perform step S406; if yes, the MPR node determination process ends.

The number of remaining two-hop neighbor nodes in M2 (i) is zero, which means that the two-hop neighbor nodes of the target network node have been covered by the determined MPR node, that is, the currently determined MPR node can The message is directly forwarded to all two-hop neighbor nodes of the target network node, and the MPR node determination process ends.

S406: Obtain the device weight of the remaining one-hop neighbor node according to the device form of the remaining one-hop neighbor node in M1 (i).

Through steps S403 and S405-406, when the one-hop neighbor node set M1 (i) has a unique path with any one of the two-hop neighbor nodes in the two-hop neighbor node set M2 (i) When the number of nodes is zero, or when the number of remaining two-hop neighbor nodes in the two-hop neighbor node set M2 (i) is not zero, according to the remaining in the one-hop neighbor node set M1 (i) The device form of the one-hop neighbor node obtains the device weight corresponding to the device form of the remaining one-hop neighbor node as the device weight of the remaining one-hop neighbor node.

There is a preset correspondence between the device form and the device weight, and according to the device form of the target network node i, and the correspondence between the preset device form and the device weight, the The device weight corresponding to the device form of the target network node i.

S407: Determine the remaining one-hop neighbor node with the largest device weight as the MPR node matching the target network node i, and delete the remaining one-hop neighbor node from M1 (i) and delete the remaining one from M2 (i) The remaining two-hop neighbor nodes covered by the hop neighbor nodes.

In step S407, the remaining one-hop neighbor nodes with the largest device weights in the one-hop neighbor node set M1 (i) are determined as the MPR nodes matching the target network node i; correspondingly, from the one-hop In the neighbor node set M1 (i), delete the remaining one-hop neighbor node with the largest device weight, and delete the remaining one hop neighbor with the largest device weight from the two-hop neighbor node set M2 (i). The remaining two-hop neighbors covered by the node.

S408: Determine again whether the number of remaining two-hop neighbor nodes in M2 (i) is zero. If not, perform step S403; if so, the MPR node determination process ends.

The MPR node determination process provided in this embodiment may be used to implement the step of determining the multipoint relay MPR node matching the target network node i according to the device form of the neighbor node within the preset range in the foregoing embodiment (S102) .

The MPR node determination process provided in this embodiment first determines the MPR node according to the unique path between the one-hop neighbor node in the one-hop neighbor node set and the two-hop neighbor node in the two-hop neighbor node set. In the one-hop neighbor node set, when the number of one-hop neighbor nodes having a unique path with any one of the two-hop neighbor nodes in the two-hop neighbor node set is zero, or, remaining in the two-hop neighbor node set When the number of two-hop neighbor nodes is not zero, the MPR nodes that match the target network node are selected from the device weights of the one-hop neighbor nodes, so that the selection of MPR nodes is combined with the reference factors of the device shape to get better The MPR node set can be applied to different usage environments and application scenarios corresponding to different device forms, which overcomes the disadvantage that the MPR node cannot be obtained by simply selecting the MPR node from the network node coverage.

In a specific application, the remaining one-hop neighbor nodes in the set of one-hop neighbor nodes of the target network node may be devices with the same device shape, which may cause the remaining one-hop neighbor nodes to have the same device weight, resulting in failure to determine the device shape The MPR node is determined by the device weight corresponding to the shape. In response to this situation, the present invention also provides the following embodiments.

Please refer to FIG. 7, which is another flowchart of an MPR node determination process provided by an embodiment of the present application.

In this embodiment, when the device weights of the remaining one-hop neighbor nodes in the one-hop neighbor node set M1 (i) of the target network node i are the same, as shown in FIG. 7, the MPR node determination process also Can include:

S501: Obtain the moving speed weight, remaining power weight, link quality weight, and congestion status weight of each remaining one-hop neighbor node.

In addition to the device type, the node information of the network node also includes moving speed, remaining power, link quality, and congestion status. Among them, the moving speed, remaining power, link quality, and congestion status have preset correspondences with the moving speed weight, remaining power weight, link quality weight, and congestion status weight, respectively. When the device weights of the remaining one-hop neighbor nodes in the one-hop neighbor node set M1 (i) are the same, each of the remaining one-hop neighbor nodes can be obtained according to the moving speed, remaining power, link quality, and congestion status of the remaining one-hop neighbor nodes. The moving speed weights, remaining power weights, link quality weights, and congestion state weights of each remaining one-hop neighbor node are described.

S502: According to the moving speed weights, remaining power weights, link quality weights, and congestion state weights of the remaining one-hop neighbor nodes, calculate the comprehensive weights of the remaining one-hop neighbor nodes, respectively.

In an example, the integrated weight of the remaining one-hop neighbor node is equal to the weighted average of the remaining one-hop neighbor node's moving speed weight, remaining power weight, link quality weight, and congestion state weight.

S503: Determine the MPR node that the target network node i matches according to the integrated weight of each remaining one-hop neighbor node.

Specifically, in the one-hop neighbor node set M1 (i), the remaining one-hop neighbor nodes with the largest integrated weights are determined as the MPR nodes matching the target network node i; correspondingly, from the one-hop neighbors In the node set M1 (i), delete the remaining one-hop neighbor node with the largest comprehensive weight, and delete the remaining one-hop neighbor node with the largest comprehensive weight from the two-hop neighbor node set M2 (i) The remaining two-hop neighbor nodes covered.

The MPR node determination process provided in this embodiment can be used as a supplementary solution to step S407 in the foregoing embodiment. In the one-hop neighbor node set M1 (i) of the target network node i, each remaining one-hop neighbor node has the same device weight carried out.

The MPR node determination process provided in this embodiment is directed to the case where the remaining one-hop neighbor nodes in the foregoing embodiments have the same device weight, and the remaining one-hop neighbor node with the largest device weight cannot be selected as the MPR node. The moving speed weight, the remaining power weight, the link quality weight and the congestion state weight of each remaining one-hop neighbor node are calculated, and the comprehensive weight of each remaining one-hop neighbor node is calculated respectively, and the one-hop In the set of neighbor nodes, the remaining one-hop neighbor node with the largest comprehensive weight is determined as the MPR node that matches the target network node i, so that from the perspective of the entire network, according to the shape of the device, moving speed, remaining power, and link quality The selection of MPR nodes with multi-level and multi-dimensional perceptions such as congestion status further overcomes the disadvantage that it is impossible to obtain a better MPR node set simply by selecting MPR nodes from the coverage of network nodes.

In a specific application, when the comprehensive weights of the remaining one-hop neighbor nodes in the one-hop neighbor node set M1 (i) of the target network node i are also the same, it will result in the failure to select the remaining one-hop with the largest comprehensive weight Neighbor nodes are used as MPR nodes. In response to this situation, the present invention also provides the following embodiments.

Please refer to FIG. 8, which is another flowchart of the MPR node determination process provided by the embodiment of the present application.

In this embodiment, when the comprehensive weights of the remaining one-hop neighbor nodes in the one-hop neighbor node set M1 (i) of the target network node i are the same, as shown in FIG. 8, the MPR node determination process can also be include:

S601: Obtain the number of remaining two-hop neighbor nodes covered by the remaining one-hop neighbor nodes in the two-hop neighbor node set M2 (i), respectively.

S602: Determine the MPR node that the target network node i matches according to the number of remaining two-hop neighbor nodes covered by the node.

Specifically, according to the number of nodes of the remaining two-hop neighbor nodes covered by the remaining one-hop neighbor nodes in the two-hop neighbor node set M2 (i), the one-hop neighbor node set M1 (i) , The remaining one-hop neighbor node with the largest number of nodes covering the remaining two-hop neighbor nodes is determined as the MPR node matching the target network node i; correspondingly, from the one-hop neighbor node set M1 (i) , Delete the remaining one-hop neighbor node with the largest number of nodes covering the remaining two-hop neighbor nodes, and delete the covering two remaining hop neighbors from the two-hop neighbor node set M2 (i) The remaining one-hop neighbor node covered by the remaining one-hop neighbor node with the largest number of nodes.

The MPR node determination process provided in this embodiment has the same comprehensive weight value for each remaining one-hop neighbor node in the one-hop neighbor node set in the foregoing embodiment, and the remaining one-hop neighbor node with the largest device weight value cannot be selected from it as the In the case of an MPR node, according to the number of nodes of the remaining two-hop neighbor nodes covered by the remaining one-hop neighbor nodes in the two-hop neighbor node set respectively, determine the MPR nodes that the target network node matches, and thus stand on the entire network From the perspective of network node coverage, device shape, moving speed, remaining power, link quality and congestion status, etc. to determine the selection of MPR nodes, the quality of MPR node selection is further improved, which in turn guarantees Under the premise of message coverage, it can effectively control the number of messages forwarded and improve the network efficiency and comprehensive network performance of the wireless ad hoc network.

Please refer to FIG. 9, which is another flowchart of a routing method of a wireless ad hoc network provided by an embodiment of the present application.

As shown in FIG. 9, the method includes:

S701: Obtain network topology information of each network node in the wireless ad hoc network flooding to obtain network-wide topology information.

The network-wide topology information includes the device form of each network node.

In an example, the packet format of the network topology information flooded by each network node in the wireless ad hoc network may be as shown in FIG. 10. The packet sequence number is used to distinguish the old and new packets. Each time a network node sends a packet with network topology information, the packet sequence number in the packet is automatically incremented by 1. For the meanings of other fields in the message format of the network topology information, refer to the heartbeat message format in the foregoing embodiment, which will not be repeated here.

The protocol message formats (heartbeat message and network topology information) provided in the embodiments of the present application are all self-defined formats, and the message only needs to contain necessary information, thereby reducing the overhead of the protocol message in a wireless scenario. If the network node needs to communicate with the standard protocol, it can perform protocol conversion in the external interface to adapt and be compatible with the standard protocol.

S702: Determine routing information of the target network node according to the device form of each network node in the wireless ad hoc network.

In an example, the network-wide topology information further includes the movement speed, remaining power, link quality, and congestion status of each network node; and the target is determined according to the device form of each network node in the wireless ad hoc network The routing information of network nodes includes:

a. Determine the weight of each link in the wireless ad hoc network according to at least one of the movement speed, remaining power, link quality, congestion status, and device shape of each network node in the wireless ad hoc network;

For example, the weight of the link: Weight = α × L + β × C + γ × P + δ × V + ε × D.

Among them, L is the link quality, C is the congestion state, P is the remaining power, V is the moving speed, and D is the device form; α is the weight factor corresponding to the link quality, β is the weight factor corresponding to the congestion state, and γ is the remaining The weighting factor corresponding to the amount of electricity, ε is the weighting factor corresponding to the form of the device.

b. Determine the routing information of the target network node according to the weight of each link in the wireless ad hoc network.

The routing method of the wireless ad hoc network provided by this embodiment calculates the link weight based on the reference factor of the device shape, and then determines the shortest path between the network nodes through the link weight, thereby improving the network of mixed networking of multiple devices efficacy. Moreover, by combining the link weight determination method based on the device form provided in this embodiment, and the MPR determination method based on the device form provided in the previous embodiment, the network efficiency and integrated network of the wireless ad hoc network can be improved as a whole performance.

An embodiment of the present invention also provides a routing device for a wireless ad hoc network. The routing device for a wireless ad hoc network is used to implement the routing method for the wireless ad hoc network provided by the embodiment of the present invention. The routing of the wireless ad hoc network described below The content of the device can correspond to each other with the content of the routing method of the wireless ad hoc network described above.

The routing device of the wireless ad hoc network provided by the embodiment of the present invention is applied to a target network node, and the target network node is any network node in the wireless ad hoc network.

Please refer to FIG. 11, which is a schematic structural diagram of a wireless ad hoc network routing device according to an embodiment of the present application.

As shown in FIG. 11, the device includes a neighbor information acquisition unit 100, an MPR node determination unit 200, and a topology information flooding unit 300. among them,

The neighbor information obtaining unit 100 is configured to obtain the node information of the neighbor node of the target network node within a preset range; the node information includes a device form.

The MPR node determining unit 200 is configured to determine a multipoint relay MPR node matching the target network node according to the device form of the neighbor node within the preset range;

The topology information flooding unit 300 is used to flood the network topology information perceived by the target network node in the wireless ad hoc network through the MPR nodes matched by the target network node, and is used for the wireless self-organization. Each network node in the networking determines the corresponding routing information.

In an example, the neighbor information obtaining unit 100 may be specifically used for:

Receiving a first heartbeat message sent by a one-hop neighbor node of the target network node;

Wherein, the first heartbeat message carries: the node information of the one-hop neighbor node, and the node information of the neighbor node of the one-hop neighbor node within the range of one hop;

According to the first heartbeat message, obtain the node information of the neighbor node of the target network node within two hops.

Correspondingly, the device may further include:

A node information sending unit, configured to send a second heartbeat message to the one-hop neighbor node of the target network node;

Wherein, the second heartbeat message carries: the node information of the target network node, and the node information of the neighbor node of the target network node within a hop range.

In an example, the device may further include:

Equipment morphology extraction unit for:

Obtain the device number of the target network node according to preset device coding rules;

Acquiring the device form corresponding to the device number of the target network node according to the correspondence between the preset device number and the device form as the device form of the target network node;

Wherein, the corresponding routing strategy can be implemented according to the device form of the target network node.

In an example, the preset range is a two-hop range; neighbor nodes of the target network node within the preset range include: a one-hop neighbor node and a two-hop neighbor node of the target network node; the MPR node The determining unit 200 is specifically used for:

According to the one-hop neighbor node and the two-hop neighbor node of the target network node, respectively determine the set of one-hop neighbor nodes and the set of two-hop neighbor nodes of the target network node;

Acquiring the number of nodes of two-hop neighbor nodes that are covered by each one-hop neighbor node in the one-hop neighbor node set in the two-hop neighbor node set;

According to the number of nodes of the two-hop neighbor nodes covered by the respective one-hop neighbor nodes in the two-hop neighbor node set respectively, the one-hop neighbor node set and any one of the two-hop neighbor node set The one-hop neighbor node with the two-hop neighbor node having a unique path is determined as the MPR node matching the target network node; correspondingly, the one-hop neighbor node with the unique path is deleted from the one-hop neighbor node set, And from the set of two-hop neighbor nodes, delete the two-hop neighbor nodes covered by the one-hop neighbor nodes with unique paths;

When the number of one-hop neighbor nodes that have a unique path with any one of the two-hop neighbor nodes in the set of one-hop neighbor nodes is zero, or when the two-hop neighbor nodes When the number of remaining two-hop neighbor nodes in the set is not zero, obtain a device corresponding to the device form of the remaining one-hop neighbor node according to the device form of the remaining one-hop neighbor node in the one-hop neighbor node set The weight value is used as the device weight value of the remaining one-hop neighbor node;

The remaining one-hop neighbor nodes with the largest device weights in the set of one-hop neighbor nodes are determined as the MPR nodes matching the target network node; correspondingly, the device is deleted from the set of one-hop neighbor nodes The remaining one-hop neighbor node with the largest weight, and deleting the remaining two-hop neighbor nodes covered by the remaining one-hop neighbor node with the largest equipment weight from the set of two-hop neighbor nodes.

In an example, the node information further includes moving speed, remaining power, link quality, and congestion status. Correspondingly, in the acquisition, a device weight corresponding to the device form of the remaining one-hop neighbor node is used as the After the device weights of the remaining one-hop neighbor nodes are described, the MPR node determining unit 200 is further used to:

When the device weights of each remaining one-hop neighbor node in the set of one-hop neighbor nodes are the same, the moving speed weight, the remaining power weight, the link quality weight, and the congestion status of each remaining one-hop neighbor node are acquired Weight

According to the moving speed weights, remaining power weights, link quality weights, and congestion status weights of the remaining one-hop neighbor nodes, calculate the comprehensive weights of the remaining one-hop neighbor nodes, respectively;

The MPR node matched by the target network node is determined according to the integrated weight of each remaining one-hop neighbor node.

Wherein, the determining the MPR node according to the comprehensive weight of each remaining one-hop neighbor node includes:

The remaining one-hop neighbor nodes with the largest integrated weights in the set of one-hop neighbor nodes are determined as the MPR nodes matching the target network node; correspondingly, the synthesis is deleted from the one-hop neighbor node set The remaining one-hop neighbor node with the largest weight, and deleting the remaining two-hop neighbor nodes covered by the remaining one-hop neighbor node with the largest comprehensive weight from the set of two-hop neighbor nodes.

In an example, after the comprehensive weights of the remaining one-hop neighbor nodes are calculated separately, the MPR node determining unit 200 is further configured to:

When the integrated weights of the remaining one-hop neighbor nodes in the set of one-hop neighbor nodes are the same, obtain the nodes of the remaining two-hop neighbor nodes that are respectively covered by the remaining one-hop neighbor nodes in the two-hop neighbor node set Number

The MPR node matched by the target network node is determined according to the number of remaining two-hop neighbor nodes of the coverage.

Wherein, the determining the MPR node that the target network node matches according to the number of remaining two-hop neighbor nodes of the coverage includes:

According to the number of nodes of the remaining two-hop neighbor nodes covered by the remaining one-hop neighbor nodes in the set of two-hop neighbor nodes, cover the remaining two-hop neighbor nodes in the set of one-hop neighbor nodes The remaining one-hop neighbor node with the largest number of nodes is determined as the MPR node that matches the target network node; correspondingly, the number of nodes covering the remaining two-hop neighbor nodes is deleted from the one-hop neighbor node set The remaining one-hop neighbor node with the largest number, and from the set of two-hop neighbor nodes, delete the remaining two-hop neighbor nodes covered by the remaining one-hop neighbor node with the largest number of nodes covering the remaining two-hop neighbor nodes.

The routing device for a wireless ad hoc network provided in this embodiment obtains the device form of a neighbor node whose target network node is within a preset range, and determines the target network node according to the device form of a neighbor node within the preset range The matched multi-point relay MPR node overcomes the shortcomings that simply selecting MPR nodes from the network node coverage cannot obtain a better MPR node set, can obtain a better MPR node set, and can be applied to different corresponding to different device forms Usage environment and application scenarios, through the MPR nodes matched by the target network node, the network topology information perceived by the target network node is flooded in the wireless ad hoc network for each network node in the wireless ad hoc network Determine the corresponding routing information, so as to effectively control the number of messages forwarded under the premise of ensuring message coverage, and improve the network efficiency and overall network performance of the wireless ad hoc network.

Please refer to FIG. 12, which is another schematic structural diagram of a wireless ad hoc network routing device according to an embodiment of the present application.

As shown in FIG. 12, in addition to the neighbor information obtaining unit 100, the MPR node determining unit 200, and the topology information flooding unit 300, the device further includes:

The topology information acquiring unit 400 is used to acquire network topology information of each network node in the wireless ad hoc network to obtain topology information of the entire network; the topology information of the entire network includes the device form of each network node.

The routing information determining unit 500 is configured to determine the routing information of the target network node according to the device form of each network node in the wireless ad hoc network.

In an example, the network-wide topology information further includes the movement speed, remaining power, link quality, and congestion status of each network node. The routing information determination unit is specifically configured to:

Determine the weight of each link in the wireless ad hoc network according to at least one of the movement speed, remaining power, link quality, congestion status, and device shape of each network node in the wireless ad hoc network;

The routing information of the target network node is determined according to the weight of each link in the wireless ad hoc network.

The routing device of the wireless ad hoc network provided by this embodiment calculates the link weight based on the reference factor of the device shape, and then determines the shortest path between the network nodes through the link weight, thereby improving the network of a mixed network of multiple devices efficacy. Furthermore, the link weight determination method based on the device form and the MPR determination method based on the device form provided by the present invention can improve the network efficiency and overall network performance of the wireless ad hoc network as a whole.

An embodiment of the present application further provides a storage medium in which computer program code is stored. When the computer program code is executed, the wireless ad hoc network routing method described in the foregoing embodiment is implemented.

An embodiment of the present application further provides a routing terminal of a wireless ad hoc network corresponding to the routing method of the wireless ad hoc network described in the foregoing embodiments, the routing terminal is applied to a target network node, and the target network node It is any network node in the wireless ad hoc network; the routing terminal includes: a processor and a memory;

The processor is configured to obtain the node information of the neighbor node of the target network node within a preset range; the node information includes a device form; and determine the node according to the device form of the neighbor node within the preset range A multipoint relay MPR node matched by the target network node; the MPR node matched by the target network node floods the network topology information perceived by the target network node in the wireless ad hoc network for the wireless Each network node in the ad hoc network determines the corresponding routing information;

The memory is used to store node information of neighbor nodes of the target network node within a preset range, a multipoint relay MPR node matched by the target network node, and network topology information perceived by the target network node .

The routing terminal of the wireless ad hoc network provided in this embodiment obtains the device form of the neighbor node of the target network node within a preset range, and determines the target network node according to the device form of the neighbor node within the preset range The matched multi-point relay MPR node overcomes the shortcomings that simply selecting MPR nodes from the network node coverage cannot obtain a better MPR node set, can obtain a better MPR node set, and can be applied to different corresponding to different device forms Usage environment and application scenarios, through the MPR nodes matched by the target network node, the network topology information perceived by the target network node is flooded in the wireless ad hoc network for each network node in the wireless ad hoc network Determine the corresponding routing information, so as to effectively control the number of messages forwarded under the premise of ensuring message coverage, and improve the network efficiency and overall network performance of the wireless ad hoc network.

Finally, it should be noted that in this article, relational terms such as first and first are used only to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply these entities Or there is any such actual relationship or order between operations. Moreover, the terms "include", "include" or any other variant thereof are intended to cover non-exclusive inclusion, so that a process, method, article, or device that includes a series of elements includes not only those elements, but also those not explicitly listed Or other elements that are inherent to this process, method, article, or equipment. Without more restrictions, the element defined by the sentence "include one ..." does not exclude that there are other identical elements in the process, method, article or equipment that includes the element.

Through the description of the above embodiments, those skilled in the art can clearly understand that the present application can be implemented in the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Based on this understanding, all or part of the technical solutions of the present application that contribute to the background technology can be embodied in the form of software products, and the computer software products can be stored in storage media, such as ROM / RAM, magnetic disks, optical disks, etc. , Including several instructions to enable a computer device (which may be a personal computer, a server, or a network device, etc.) to perform the methods described in various embodiments of the present application or some parts of the embodiments.

The embodiments in this specification are described in a progressive manner. Each embodiment focuses on the differences from other embodiments, and the same or similar parts between the embodiments may refer to each other. For the device disclosed in the embodiment, since it corresponds to the method disclosed in the embodiment, the description is relatively simple, and the relevant part can be referred to the description in the method part.

This article uses specific examples to explain the principles and implementation of this application. The descriptions of the above examples are only used to help understand the method and core ideas of this application; at the same time, for ordinary technicians in the field, based on this application There will be changes in the specific implementation and application scope of the idea. In summary, the content of this specification should not be understood as a limitation to this application.

Claims (15)

1. A routing method for a wireless ad hoc network, wherein it is applied to a target network node, and the target network node is any network node in the wireless ad hoc network; the method includes:

   Obtain the node information of the neighbor node of the target network node within a preset range; the node information includes the device form;

   Determine the multipoint relay MPR node matching the target network node according to the device form of the neighbor node within the preset range;

   The MPR nodes matched by the target network node are used to flood the network topology information sensed by the target network node in the wireless ad hoc network, and used for each network node in the wireless ad hoc network to determine corresponding routing information .
2. The method of claim 1, wherein the acquiring node information of neighbor nodes of the target network node within a preset range includes:

   Receiving a first heartbeat message sent by a one-hop neighbor node of the target network node;

   Wherein, the first heartbeat message carries: the node information of the one-hop neighbor node, and the node information of the neighbor node of the one-hop neighbor node within the range of one hop;

   According to the first heartbeat message, obtain the node information of the neighbor node of the target network node within two hops.
3. The method of claim 1, wherein the preset range is a two-hop range; the neighbor nodes of the target network node within the preset range include: a one-hop neighbor node and a two-hop neighbor of the target network node A node; the determining the multipoint relay MPR node matched by the target network node according to the device form of the neighbor node within the preset range includes:

   According to the one-hop neighbor node and the two-hop neighbor node of the target network node, respectively determine the set of one-hop neighbor nodes and the set of two-hop neighbor nodes of the target network node;

   Acquiring the number of nodes of two-hop neighbor nodes that are covered by each one-hop neighbor node in the one-hop neighbor node set in the two-hop neighbor node set;

   According to the number of nodes of the two-hop neighbor nodes covered by the respective one-hop neighbor nodes in the two-hop neighbor node set respectively, the one-hop neighbor node set and any one of the two-hop neighbor node set The one-hop neighbor node with the two-hop neighbor node having a unique path is determined as the MPR node matching the target network node; correspondingly, the one-hop neighbor node with the unique path is deleted from the one-hop neighbor node set, And from the set of two-hop neighbor nodes, delete the two-hop neighbor nodes covered by the one-hop neighbor nodes with unique paths;

   When the number of one-hop neighbor nodes that have a unique path with any one of the two-hop neighbor nodes in the set of one-hop neighbor nodes is zero, or when the two-hop neighbor nodes When the number of remaining two-hop neighbor nodes in the set is not zero, obtain a device corresponding to the device form of the remaining one-hop neighbor node according to the device form of the remaining one-hop neighbor node in the one-hop neighbor node set The weight value is used as the device weight value of the remaining one-hop neighbor node;

   The remaining one-hop neighbor nodes with the largest device weights in the set of one-hop neighbor nodes are determined as the MPR nodes matching the target network node; correspondingly, the device is deleted from the set of one-hop neighbor nodes The remaining one-hop neighbor node with the largest weight, and deleting the remaining two-hop neighbor nodes covered by the remaining one-hop neighbor node with the largest equipment weight from the set of two-hop neighbor nodes.
4. The method according to claim 3, wherein the node information further includes moving speed, remaining power, link quality, and congestion status; in the acquiring, device rights corresponding to the device form of the remaining one-hop neighbor node Value, as the device weight of the remaining one-hop neighbor node, the method further includes:

   When the device weights of each remaining one-hop neighbor node in the set of one-hop neighbor nodes are the same, the moving speed weight, the remaining power weight, the link quality weight, and the congestion status of each remaining one-hop neighbor node are acquired Weight

   According to the moving speed weights, remaining power weights, link quality weights, and congestion status weights of the remaining one-hop neighbor nodes, calculate the comprehensive weights of the remaining one-hop neighbor nodes, respectively;

   The MPR node matched by the target network node is determined according to the integrated weight of each remaining one-hop neighbor node.
5. The method of claim 4, wherein the determining the MPR node according to the integrated weights of the remaining one-hop neighbor nodes comprises:

   The remaining one-hop neighbor nodes with the largest integrated weights in the set of one-hop neighbor nodes are determined as the MPR nodes matching the target network node; correspondingly, the synthesis is deleted from the one-hop neighbor node set The remaining one-hop neighbor node with the largest weight, and deleting the remaining two-hop neighbor nodes covered by the remaining one-hop neighbor node with the largest comprehensive weight from the set of two-hop neighbor nodes.
6. The method according to claim 4, wherein, after the separately calculating the integrated weights of the remaining one-hop neighbor nodes, the method further comprises:

   When the integrated weights of the remaining one-hop neighbor nodes in the set of one-hop neighbor nodes are the same, obtain the nodes of the remaining two-hop neighbor nodes that are respectively covered by the remaining one-hop neighbor nodes in the two-hop neighbor node set Number

   The MPR node matched by the target network node is determined according to the number of remaining two-hop neighbor nodes of the coverage.
7. The method of claim 6, wherein the determining the MPR node that the target network node matches based on the number of remaining two-hop neighbor nodes of the coverage includes:

   According to the number of nodes of the remaining two-hop neighbor nodes covered by the remaining one-hop neighbor nodes in the set of two-hop neighbor nodes, cover the remaining two-hop neighbor nodes in the set of one-hop neighbor nodes The remaining one-hop neighbor node with the largest number of nodes is determined as the MPR node that matches the target network node; correspondingly, the number of nodes covering the remaining two-hop neighbor nodes is deleted from the one-hop neighbor node set The remaining one-hop neighbor node with the largest number, and from the set of two-hop neighbor nodes, delete the remaining two-hop neighbor nodes covered by the remaining one-hop neighbor node with the largest number of nodes covering the remaining two-hop neighbor nodes.
8. The method of claim 1, wherein the method further comprises:

   Obtain the network topology information of each network node in the wireless ad hoc network, to obtain the topology information of the entire network; the topology information of the entire network includes the device form of each network node;

   The routing information of the target network node is determined according to the device form of each network node in the wireless ad hoc network.
9. The method according to claim 8, wherein the network-wide topology information further includes the movement speed, remaining power, link quality, and congestion status of each network node; the network node according to the wireless ad hoc network Device form, determining the routing information of the target network node includes:

   Determine the weight of each link in the wireless ad hoc network according to at least one of the movement speed, remaining power, link quality, congestion status, and device shape of each network node in the wireless ad hoc network;

   The routing information of the target network node is determined according to the weight of each link in the wireless ad hoc network.
10. The method of claim 1, wherein the method further comprises:

    Obtain the device number of the target network node according to preset device coding rules;

    Acquiring the device form corresponding to the device number of the target network node according to the correspondence between the preset device number and the device form as the device form of the target network node;

    According to the device configuration of the target network node, a corresponding routing strategy is implemented.
11. The method of claim 1, wherein the method further comprises:

    Sending a second heartbeat message to the one-hop neighbor node of the target network node;

    Wherein, the second heartbeat message carries: the node information of the target network node, and the node information of the neighbor node of the target network node within a hop range.
12. A routing device for a wireless ad hoc network, wherein it is applied to a target network node, and the target network node is any network node in the wireless ad hoc network; the device includes:

    The neighbor information obtaining unit is used to obtain the node information of the neighbor node of the target network node within a preset range; the node information includes the device form;

    An MPR node determining unit, configured to determine a multipoint relay MPR node matching the target network node according to the device form of the neighbor node within the preset range;

    The topology information flooding unit is used for flooding the network topology information perceived by the target network node in the wireless ad hoc network through the MPR nodes matched by the target network node, and used in the wireless ad hoc network Each network node determines the corresponding routing information.
13. The device of claim 12, wherein the device further comprises:

    A topology information acquiring unit, configured to acquire network topology information of each network node in the wireless ad hoc network to obtain topology information of the entire network; the topology information of the entire network includes the device form of each network node;

    The routing information determining unit is configured to determine the routing information of the target network node according to the device form of each network node in the wireless ad hoc network.
14. A storage medium, wherein the storage medium stores computer program code, and when the computer program code is executed, the wireless ad hoc network routing method according to any one of claims 1 to 11 is implemented.
15. A routing terminal for a wireless ad hoc network, wherein it is applied to a target network node, and the target network node is any network node in the wireless ad hoc network; the routing terminal includes a processor and a memory;

    The processor is configured to obtain the node information of the neighbor node of the target network node within a preset range; the node information includes a device form; and determine the node according to the device form of the neighbor node within the preset range A multipoint relay MPR node matched by the target network node; the MPR node matched by the target network node floods the network topology information perceived by the target network node in the wireless ad hoc network for the wireless Each network node in the ad hoc network determines the corresponding routing information;

    The memory is used to store node information of neighbor nodes of the target network node within a preset range, a multipoint relay MPR node matched by the target network node, and network topology information perceived by the target network node .

Images