CN116528315A

CN116528315A - Route communication method and device

Info

Publication number: CN116528315A
Application number: CN202310544940.6A
Authority: CN
Inventors: 王金乐; 李远军
Original assignee: Dalian Linktech Infosystem Co ltd
Current assignee: Dalian Linktech Infosystem Co ltd
Priority date: 2023-05-15
Filing date: 2023-05-15
Publication date: 2023-08-01

Abstract

The utility model provides a route communication method and device, wherein, after the node of the wireless self-organizing network determines the next-hop MPR node according to the destination node and the OLSR protocol of the data packet, the target acceleration node of the next-hop MPR node is also determined, and the minimum value of the link rate between the node and the target acceleration node and the link rate between the target acceleration node and the next-hop MPR node is larger than twice the link rate between the node and the next-hop MPR node, therefore, the data packet is forwarded to the next-hop MPR node through the target acceleration node, and the data transmission rate of the route path can be effectively improved. Moreover, the link rate is determined based on the MCS level between the nodes, and the MCS level between the nodes is obtained through the MCS signaling transmitted in the wireless ad hoc network, without separately transmitting the control signaling for transmitting the link QOS information, thereby reducing the overhead of transmitting the control signaling in the wireless ad hoc network.

Description

Route communication method and device

Technical Field

The present disclosure relates to the field of network communications technologies, and in particular, to a routing communication method and apparatus.

Background

A wireless ad hoc network is a centerless ad hoc network.

In a wireless ad hoc network, because the communication coverage of a node is limited due to the limitation of the transmission power of the node, when the node needs to communicate with other nodes outside the coverage, forwarding through an intermediate node, i.e., multi-hop communication, is required. In multi-hop communications, routing may be implemented based on an optimized link state routing (Optimized LinkState Routing, OLSR) protocol. The OLSR protocol adopts a MultiPoint Relay (MPR) mechanism, based on which all nodes can receive information in the process of constructing a routing table, but only the selected node has the right to propagate the received information, and the selected node is called MPR node.

However, in the routing communication process based on the OLSR protocol, the MPR node is selected without considering the link quality, which may result in poor link transmission rate of the determined routing path. Based on this, to optimize the global routing path, OLSR protocols incorporating quality of service (Quality of Service, QOS), i.e. QOS-OLSR protocols, have been proposed. Although QOS-OLSR protocols globally optimize routing paths, separate transfer of link QOS information between individual nodes in the ad hoc network is required, which necessarily increases the overhead of transferring control signaling.

Disclosure of Invention

The application provides a routing communication method and a routing communication device, which can reduce signaling overhead required by realizing routing communication while improving the link transmission rate of a routing path in a wireless self-organizing network.

In one aspect, the present application provides a routing communication method applied to a node in a wireless ad hoc network, including:

obtaining a data packet to be sent by the node;

determining a next hop MPR node of the node based on a first routing table and a destination node of the data packet, wherein the first routing table is a routing table constructed by the node based on an optimized link state routing protocol;

determining a target acceleration node from the node to the next-hop MPR node based on a second routing table comprising: the method comprises the steps that each one-hop neighbor node of the node corresponds to an acceleration node, wherein the minimum value of the link rate from the node to the acceleration node of the one-hop neighbor node and the link rate from the acceleration node of the one-hop neighbor node to the one-hop neighbor node is larger than twice the link rate from the node to the one-hop neighbor node;

and sending the data packet to the target acceleration node so that the target acceleration node forwards the data packet to the next-hop MPR node.

In one possible implementation, before sending the data packet to the target acceleration node, the method further includes:

marking a next-hop node as the next-hop MPR node in the packet header of the data packet, and marking an acceleration node as the target acceleration node to obtain a marked data packet;

the sending the data packet to the target acceleration node includes:

and sending the marked data packet to the target acceleration node, so that the target acceleration node forwards the marked data packet to the next hop MPR node marked in the packet head under the condition that the marked acceleration node in the marked data packet is confirmed to be the target acceleration node.

In yet another possible implementation manner, the determining, based on the first routing table and the destination node of the data packet, a next-hop MPR node of the node includes:

if the node is not marked with the accelerating node or marked with the next hop node in the data packet, determining the next hop MPR node of the node based on a first routing table and a destination node of the data packet;

the method further comprises the steps of:

and if the acceleration node marked in the data packet is the node, forwarding the data packet to the next-hop MPR node marked in the data packet based on the next-hop MPR node marked in the data packet.

In yet another possible implementation manner, after determining a target acceleration node from the node to the next-hop MPR node, the method further includes:

determining a first transmission duration required for transmitting the data packet from the node to the next-hop MPR node based on the length of the data packet, the link rate from the node to the next-hop MPR node, and a first time required for the node to apply for service resources;

determining a second transmission duration required for the data packet to be transmitted from the node to the next-hop MPR node through the target acceleration node based on the length of the data packet, the link rate from the node to the target acceleration node, the first time, the link rate from the target acceleration node to the next-hop MPR node, and a second time required for the target acceleration node to apply for service resources;

if the second transmission time length is longer than or equal to the first transmission time length, sending the data packet to the next-hop MPR node;

the sending the data packet to the target acceleration node includes:

and if the second transmission duration is smaller than the first transmission duration, sending the data packet to the target acceleration node.

In yet another possible implementation manner, the second routing table is obtained by:

based on each one-hop neighbor node of the node, transmitting MCS signaling, and respectively determining MCS levels from the node to each one-hop neighbor node, and MCS levels from each one-hop neighbor node and each common neighbor node of the node to the one-hop neighbor node, wherein the common neighbor node is the one-hop neighbor node commonly owned by the node and the one-hop neighbor node;

for any one-hop neighbor node of the node, determining a first link rate from the node to the one-hop neighbor node based on the MCS level from the node to the one-hop neighbor node;

for any one-hop neighbor node of the nodes, determining a second link rate from the common neighbor node corresponding to the one-hop neighbor node based on the MCS level from the common neighbor node corresponding to the one-hop neighbor node;

for any common neighbor node between the node and the one-hop neighbor node, determining a third link rate of the node to the common neighbor node based on an MCS level of the node to the common neighbor node;

For any one-hop neighbor node of the node, determining a target common neighbor node from all common neighbor nodes of the node and the one-hop neighbor node, wherein the minimum link rate of the second link rate and the third link rate corresponding to the target common neighbor node is greater than twice the first link rate from the node to the one-hop neighbor node;

for any one-hop neighbor node of the nodes, determining the target common neighbor node corresponding to the one-hop neighbor node as an acceleration node corresponding to the one-hop neighbor node, and storing the acceleration node corresponding to each one-hop neighbor node of the nodes into a second routing table.

In yet another possible implementation manner, the node and the node different neighboring nodes respectively correspond to different node identification numbers;

the determining the target common neighbor node corresponding to the one-hop neighbor node as the acceleration node corresponding to the one-hop neighbor node includes:

if the one-hop neighbor node corresponds to a plurality of target common neighbor nodes, determining a candidate common neighbor node with the maximum corresponding minimum link rate from the plurality of target common neighbor nodes;

If one candidate shared neighbor node exists, determining the candidate shared neighbor node as an acceleration node of the one-hop neighbor node;

if a plurality of candidate common neighbor nodes exist, determining a target candidate common neighbor node with the maximum node neighbor degree from the plurality of candidate common neighbor nodes;

if one target candidate shared neighbor node exists, determining the target candidate shared neighbor node as an acceleration node of the one-hop neighbor node;

and if a plurality of target candidate common neighbor nodes exist, determining the target candidate common neighbor node with the largest node identification number as the acceleration node corresponding to the one-hop neighbor node.

In yet another aspect, the present application further provides a routing communication apparatus, applied to a node in a wireless ad hoc network, including:

a packet obtaining unit, configured to obtain a data packet to be sent by the node;

a first node determining unit, configured to determine a next-hop MPR node of the node based on a first routing table and a destination node of the data packet, where the first routing table is a routing table that is constructed by the node based on an optimized link state routing protocol;

a second node determining unit configured to determine a target acceleration node from the node to the next-hop MPR node based on a second routing table including: the method comprises the steps that each one-hop neighbor node of the node corresponds to an acceleration node, wherein the minimum value of the link rate from the node to the acceleration node of the one-hop neighbor node and the link rate from the acceleration node of the one-hop neighbor node to the one-hop neighbor node is larger than twice the link rate from the node to the one-hop neighbor node;

And the packet forwarding processing unit is used for sending the data packet to the target acceleration node so that the target acceleration node forwards the data packet to the next-hop MPR node.

In one possible implementation, the apparatus further includes:

a packet marking unit, configured to mark a next-hop node as the next-hop MPR node in a packet header of the data packet and mark an acceleration node as the target acceleration node before the packet sending unit sends the data packet to the target acceleration node, so as to obtain a marked data packet;

the packet forwarding processing unit includes:

bao Zhuaifa subunit, configured to send the marked data packet to the target acceleration node, so that the target acceleration node forwards the marked data packet to the next-hop MPR node marked in the packet header, where the marked acceleration node in the marked data packet is confirmed to be the target acceleration node.

In yet another possible implementation manner, the first node determining unit includes:

a first node determining subunit, configured to determine, if an acceleration node is not marked in the data packet or a marked next-hop node is the node, a next-hop MPR node of the node based on a first routing table and a destination node of the data packet;

The apparatus further comprises:

and the packet sending unit is used for forwarding the data packet to the next-hop MPR node marked in the data packet based on the next-hop MPR node marked in the data packet if the acceleration node marked in the data packet is the node.

In yet another possible implementation, the apparatus further includes:

a first time length determining unit, configured to determine, after the second node determining unit determines the target acceleration node, a first transmission time length required for the data packet to be transferred from the node to the next-hop MPR node, based on a link rate of the node to the next-hop MPR node and a first time required for the node to apply for a service resource;

a second duration determining unit, configured to determine a second transmission duration required for the data packet to be transferred from the node to the next-hop MPR node via the target acceleration node, based on a length of the data packet, a link rate from the node to the target acceleration node, the first time, a link rate from the target acceleration node to the next-hop MPR node, and a second time required for the target acceleration node to apply for a service resource;

A packet forwarding unit, configured to send the data packet to the next-hop MPR node if the second transmission time length is greater than or equal to the first transmission time length;

the packet forwarding processing unit includes:

and the packet forwarding processing subunit is used for sending the data packet to the target acceleration node if the second transmission duration is smaller than the first transmission duration.

It can be seen that, in the embodiment of the present application, after the node of the wireless ad hoc network determines the next-hop MPR node according to the data packet to be sent and the first routing table determined based on the OLSR protocol, the target acceleration node of the next-hop MPR node is also determined, and because the minimum value of the link rate between the node and the target acceleration node and the link rate between the target acceleration node and the next-hop MPR node is at least greater than twice the link rate between the node and the next-hop MPR node, the data packet is forwarded to the next-hop MPR node through the target acceleration node, so that the data transmission rate of the routing path can be effectively improved, and the data packet transmission efficiency can be improved, thereby implementing the routing path of the optimized OLSR protocol.

Moreover, in the present application, the link rate between the nodes is determined based on the MCS level between the nodes, and the MCS level between the nodes can be obtained through the MCS signaling transmitted in the wireless ad hoc network without separately transmitting the control signaling for transmitting the link QOS information, so that the overhead for transmitting the control signaling in the wireless ad hoc network can be reduced.

Drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings that are needed in the description of the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only embodiments of the present application, and that other drawings can be obtained according to the provided drawings without inventive effort for a person skilled in the art.

Fig. 1 is a schematic flow chart of a routing communication method according to an embodiment of the present application;

FIG. 2 is a schematic diagram of the relationship among a target node, a one-hop neighbor node of the target node, and an acceleration node of the one-hop neighbor node;

fig. 3 is a schematic flow chart of constructing a second routing table according to an embodiment of the present application;

FIG. 4 shows a schematic diagram of a node obtaining an MCS level by a neighbor node;

FIG. 5 illustrates a network topology diagram of a wireless ad hoc network;

fig. 6 is a schematic flow interaction diagram of a routing communication method according to an embodiment of the present application;

fig. 7 is a schematic diagram of a composition structure of a routing communication device according to an embodiment of the present application.

Detailed Description

The scheme of the application is suitable for the wireless self-organizing network, and can optimize the routing path (routing path is also simply called as a route) based on the optimized link state routing (Optimized Link State Routing, OLSR) protocol, and reduce the control signaling overhead required in the routing path optimizing process, thereby reducing the signaling overhead required for realizing routing communication on the premise of improving the transmission rate of the determined routing path.

The wireless self-organizing network is a multi-hop mobility peer-to-peer network which is composed of tens to hundreds of nodes, adopts a wireless communication mode and is dynamically networked. The nodes in the wireless ad hoc network may be terminals or other forms of communication nodes, without limitation.

Unlike traditional wireless cellular communication network, the wireless self-organizing network does not need fixed equipment support, each node, namely user terminal, self-organizes network, and when in communication, data forwarding is carried out through the node. Due to the nature of wireless ad hoc networks, wireless ad hoc networks may be suitable for communication needs in some emergency situations, such as for meeting communication needs in temporary locations.

The following description of the embodiments of the present application will be made clearly and fully with reference to the accompanying drawings, in which it is evident that the embodiments described are only some, but not all, of the embodiments of the present application. All other embodiments, which can be made by one of ordinary skill in the art based on the embodiments herein without undue burden, are within the scope of the present application.

Fig. 1 is a schematic flow chart of a routing communication method of the present application, where the method of the present embodiment is applied to a target node of a wireless ad hoc network. The method of the embodiment can comprise the following steps:

s101, obtaining a data packet to be sent, and determining a next hop MPR node of a target node based on a first routing table and a target node of the data packet.

The destination node may be any node in a wireless ad hoc network, and for convenience of distinction, a node that obtains a data packet and processes the data packet is referred to as a destination node in this application.

In this application, the data packet may be generated by the destination node, where the destination node is a source node of the data packet. The data packet may also be sent by other nodes of the wireless ad hoc network to the destination node, in which case the destination node is any multipoint relay (Multipoint Relays, MPR) node in the routing path that transmits the data packet, i.e. any MPR node between the source node and the destination node is determined based on the OLSR protocol.

The first routing table is a routing table constructed by the target node based on the OLSR protocol.

It is understood that OLSR protocol determines a routing path based on the minimum number of hops. Specifically, when the wireless self-organizing network performs routing communication based on the OLSR protocol, in order to ensure the communication between the nodes and ensure the reliability of the communication between the nodes, all the nodes in the wireless self-organizing network send or forward routing signaling at the same rate (generally, the lower rate considered in the industry), and establish the shortest routing path to any node in the wireless self-organizing network for each node according to the rate and at the cost of the minimum hop count, so as to obtain a routing table corresponding to each node, namely a first routing table in the application.

Since the OLSR-based routing path is determined, all nodes send or forward routing signaling at the same and lower rate, which may be based on the minimum rate of all nodes in the routing path, which may result in a lower data transmission rate of the routing path, the routing path finally determined based on the first routing table is not an optimal routing path but a relatively low-speed routing path.

For any node in the wireless self-organizing network, the first routing table corresponding to the node can be constructed according to the regulations of the OLSR protocol, and the specific construction mode is not limited.

It can be appreciated that the solution of the embodiment of the present application may be applied to unicast or multicast cases. In case of unicast, there is only one destination node, and there is only one corresponding next-hop MPR node. In the case of multicast, one data packet may need to be sent to multiple destination nodes at the same time, in this case, for each destination node, the next-hop MPR node corresponding to each destination node needs to be determined by combining with the first routing table, but the optimization process of the local routing path from the destination node to the next-hop MPR node is the same, that is, the subsequent process of determining the destination acceleration node and forwarding the data packet to the destination acceleration node is the same, which is not described again.

S102, determining a target acceleration node from the target node to the next-hop MPR node based on the second routing table.

Wherein the second routing table includes: acceleration nodes corresponding to each one-hop neighbor node of the target node. A one-hop neighbor node refers to a node that can be reached from the target node through one hop, and is also referred to simply as a neighbor node.

The acceleration node refers to a transit node from the target node to the one-hop neighbor node, which is determined to increase the transmission rate of transmitting data packets from the target node to the one-hop neighbor node.

It may be understood that, in order to enable the target node to transmit the data packet to the certain one-hop neighbor node through the acceleration node, the acceleration node also has to be the one-hop neighbor node of the target node, and also has to be the one-hop neighbor node of the one-hop neighbor node, that is, the acceleration node corresponding to the one-hop neighbor node belongs to the one-hop neighbor node shared by the target node and the one-hop neighbor node. For convenience of distinction, one-hop neighbor nodes common to the target node and one-hop neighbor nodes are referred to as common neighbor nodes.

In the present application, the acceleration node corresponding to any one-hop neighbor node of the target node in the second routing table needs to satisfy the following conditions:

The minimum of the link rate of the target node to the accelerating node of the one-hop neighbor node and the link rate between the accelerating node of the one-hop neighbor node to the one-hop neighbor node is greater than twice the link rate of the target node to the one-hop neighbor node.

The link rate from the target node to the accelerating node of the one-hop neighbor node is the data transmission rate of the link between the target node and the accelerating node corresponding to the one-hop neighbor node.

To facilitate understanding the conditions that need to be met by the acceleration node corresponding to the one-hop neighbor node, reference may be made to fig. 2.

FIG. 2 illustrates a schematic diagram of a relationship of a one-hop neighbor node of a target node to an acceleration node of the one-hop neighbor node. In fig. 2, a target node is taken as a node a, and a one-hop neighbor node of the node a is taken as a node B for illustration.

The link rate from node a to node B is r_ab, the link rate from node a to node C is r_ac, and the link rate from node C to node B is r_cb, if node C can act as an accelerating node from node a to node B, the following condition needs to be satisfied:

min{R_ac,R_cb}>2*R_ab

where min { R_ac, R_cb } represents the minimum of R_ac and R_cb.

In this application, for any two nodes, the link rate between the nodes is determined based on the modulation and coding strategy (Modulation and Coding Scheme, MCS) level between the nodes. And the MCS level between the nodes can be obtained through MCS signaling transferred between the nodes in the wireless self-organizing network, so that the MCS level between the nodes is determined without independently sending control signaling.

In this embodiment, for convenience of distinction, an acceleration node corresponding to the MPR node of the next hop of the target node is referred to as a target acceleration node.

And S103, sending the data packet to the target acceleration node so that the target acceleration node forwards the data packet to the next-hop MPR node.

It will be appreciated that, after step S103, if the target acceleration node receives the data packet, the target acceleration node forwards the data packet to the next-hop MPR node corresponding to the target node.

It will be appreciated that since the minimum of the link speed from the target node to the target accelerating node and the link speed from the target accelerating node to the next-hop MPR node is higher than twice the link speed from the target node directly to the next-hop MPR node, even though the target node would need two hops to forward data packets to the next-hop MPR node via the target accelerating node, the packet transmission rate is faster due to the higher speed from the target node to the next-hop MPR node via the target accelerating node.

Accordingly, the routing path from the target node to the next-hop MPR node via the target acceleration node is superior to the routing path from the target node directly to the next-hop MPR node. The method optimizes the route path from the target node to the next-hop MPR node aiming at each next-hop MPR node, and actually establishes a local high-speed route path, so that the whole route path can be composed of a plurality of locally optimized high-speed route paths, thereby realizing the optimization of the whole route path of the data packet from the source node to the target node.

It will be appreciated that for a one-hop neighbor node of a node, there may not be a better routing path than directly from the node to the one-hop neighbor node, i.e., there may not be an acceleration node to which the one-hop neighbor node corresponds. Correspondingly, for the next-hop MPR node of the target node, if the target acceleration node corresponding to the next-hop MPR node does not exist in the second routing table, the data packet may be directly sent to the next-hop MPR node.

In addition, in the present application, the link rate between the nodes is determined based on the MCS level between the nodes, and the MCS level between the nodes can be obtained through the MCS signaling transmitted in the wireless ad hoc network without separately transmitting the control signaling for transmitting the link QOS information, so that the overhead for transmitting the control signaling in the wireless ad hoc network can be reduced.

In order to facilitate understanding of the solution of the present application, a procedure for constructing the second routing table of the node in the present application will be described in the following with reference to an implementation manner.

Fig. 3 is a schematic flow chart of constructing a second routing table according to an embodiment of the present application.

For convenience of description, the target node is described as an example, but it is understood that, for any node in the wireless ad hoc network, the procedure of creating the second routing table of the node is the same as that of the present embodiment.

The flow of this embodiment may include:

s301, the target node respectively determines MCS levels from the target node to each one-hop neighbor node and MCS levels from each common neighbor node of the one-hop neighbor node and the target node to the one-hop neighbor node based on MCS signaling sent by each one-hop neighbor node of the target node.

Wherein, as mentioned above, the common neighbor node between the target node and the one-hop neighbor node is the one-hop neighbor node that the target node and the one-hop neighbor node commonly have.

The message format of MCS signaling may be as shown in the following table 1:

TABLE 1

src
	dst
MCS Grade

Wherein src represents a source node that generates an MCS signaling message;

dst represents the destination node of the MCS signaling message;

MCS Grade indicates the MCS level at which the source node src sends traffic to the destination node dst.

It will be appreciated that the MCS level between two nodes will be continuously adjusted with the correct reception of the traffic packet between the nodes, and therefore the MCS levels indicated in the MCS signaling sent by the two nodes at different times will also be different.

It can be understood that, because the MCS signaling sent by each node includes the MCS level from the node to each one-hop neighbor node, for any node, the node can obtain not only the MCS level from the node to each one-hop neighbor node, but also the MCS level from each one-hop neighbor node to each one-hop neighbor node.

For example, see fig. 4, where fig. 4 shows the information of MCS levels of relevant nodes that each node can obtain. As can be seen from fig. 4, the node 1 can determine the MCS levels of the node 1 to the node 2 and the MCS levels of the node 1 to the node 3, and the node 1 can also obtain by the node 2: MCS level from node 2 to node 1, MCS level from node 2 to node 3. Similarly, the node 1 may also obtain MCS levels from the node 3 to the node 4 through the node 3, and the like, which will not be described again.

Based on this, for the target node, in addition to being able to obtain the MCS level of the target node to the next-hop neighbor node, it is natural to obtain the MCS level of each common neighbor node of the target node and any one of the one-hop neighbor nodes to the target node.

It should be noted that, the MCS level between any two nodes is directional, and in order to determine whether an acceleration node exists between the data packet to be transmitted from the target node to the one-hop neighbor node, the MCS level from the target node to each one-hop neighbor node needs to be concerned; further, for each one-hop neighbor node of a target node, attention needs to be paid to the MCS level of the common neighbor node between each one-hop neighbor node and the target node to the one-hop neighbor node.

S302, for any one-hop neighbor node of the target node, determining a first link rate from the target node to the one-hop neighbor node based on the MCS level from the target node to the one-hop neighbor node.

It will be appreciated that the MCS level between two nodes may characterize the link rate of the link between the two nodes, and thus, in combination with the MCS level between the nodes, the link rate between the nodes may be determined. For example, the corresponding relation of the link rates corresponding to different MCS levels may be set, so that the corresponding relation is queried, and the link rate corresponding to the MCS level may be determined.

Of course, there are other ways of determining the link rate, and the present application is not limited to a particular way of determining the link rate based on the MCS level.

In this embodiment, for convenience of distinction, the link rate of the target node to its one-hop neighbor node is referred to as a first link rate, the link rate of the common neighbor node between the target node and its one-hop neighbor node to the one-hop neighbor node is referred to as a second link rate, and the link rate of the target node to the common neighbor node is referred to as a third link rate.

S303, for any one common neighbor node corresponding to each one-hop neighbor node of the target node, determining a second link rate from the common neighbor node to the one-hop neighbor node based on the MCS level from the common neighbor node to the one-hop neighbor node.

For any one-hop neighbor node of the target node, the common neighbor node corresponding to the one-hop neighbor node refers to the common neighbor node of the one-hop neighbor node and the target node.

It will be appreciated that there may be multiple common neighbor nodes between the neighbor node and the target node for any one-hop neighbor node, but that for each common neighbor node of the one-hop neighbor node and the target node, a second link rate from the common neighbor node to the one-hop neighbor node needs to be determined.

S304, for any common neighbor node corresponding to each one-hop neighbor node of the target node, determining a third link rate from the target node to the common neighbor node based on the MCS level from the target node to the common neighbor node.

S305, for any one-hop neighbor node of the target node, determining a target common neighbor node from all common neighbor nodes of the target node and the one-hop neighbor node.

For any one-hop neighbor node, the determined target common neighbor node of the one-hop neighbor node meets the following conditions:

The minimum link rate of the second link rate and the third link rate corresponding to the target common neighbor node is greater than twice the first link rate between the target node and the one-hop neighbor node. Wherein, for ease of distinction, the minimum of the second link rate and the third link rate is referred to as the minimum link rate.

Based on this, the target common neighbor node is actually the acceleration node corresponding to the one-hop neighbor node. This step can be referred to in step S102 and related description of fig. 2, and will not be described here.

S306, for any one-hop neighbor node of the target node, determining the target common neighbor node corresponding to the one-hop neighbor node as an acceleration node corresponding to the one-hop neighbor node, and storing the acceleration node corresponding to each one-hop neighbor node of the target node in a second routing table.

It may be appreciated that, for any one-hop neighbor node of the target node, if the one-hop neighbor node corresponds to a plurality of target common neighbor nodes, a candidate common neighbor node with the maximum corresponding minimum link rate may be determined from the plurality of target common neighbor nodes, and the candidate common neighbor node may be determined as an acceleration node of the one-hop neighbor node. The minimum link rate corresponding to the common neighbor node may reflect throughput of the target node, the one-hop neighbor node, and the corresponding link paths between the common neighbor nodes.

Wherein the candidate common neighbor node belongs to the plurality of target common neighbor nodes.

In yet another possible scenario, if there are multiple acceleration routing paths with the same throughput, the acceleration node may also be selected in conjunction with the node's neighbor degree. Specifically, if there is a candidate common neighbor node, the candidate common neighbor node may be directly determined as an acceleration node of the one-hop neighbor node; if a plurality of candidate common neighbor nodes exist, a target candidate common neighbor node with the largest node neighbor degree can be determined from the plurality of candidate common neighbor nodes, and the target candidate common neighbor node is determined to be an acceleration node of the one-hop neighbor node.

In particular, if there are a plurality of target candidate common neighbor nodes with the largest node neighbor degree, the target candidate common neighbor node with the largest node identification number can be determined as the acceleration node corresponding to the one-hop neighbor node.

Each node in the self-organizing network has a respective node identification number, and the node identification numbers of different nodes are different, wherein the node identification numbers are used for uniquely identifying the nodes. Accordingly, for the target node, the common neighbor node of each next-hop neighbor node also has a respective node identification number.

It can be understood that, in the present application, in order to enable the target acceleration node to conveniently determine that the target acceleration node is the acceleration node of the next-hop MPR node after receiving the data packet, and forward the data packet to the next-hop MPR node determined by the target node, the present application may further add the marking information of the next-hop MPR node and the acceleration node in the packet header of the data packet.

Specifically, before sending a data packet, the target node may mark a next-hop node as the next-hop MPR node in the packet header of the data packet, and mark an acceleration node as the target acceleration node, so as to obtain a marked data packet. Accordingly, the target node may send the marked data packet to the target acceleration node, so that the target acceleration node forwards the marked data packet to the next-hop MPR node marked in the packet header of the data packet if the marked acceleration node in the marked data packet is confirmed to be the target acceleration node.

Optionally, if the target node determines that the acceleration node corresponding to the next-hop MPR node does not exist, the target node may further mark the acceleration node in the header of the data packet as invalid, and then send the data packet to the next-hop MPR node.

It should be understood that the foregoing is described by taking the destination node as a source node for generating a data packet or any MPR node in the data packet transmission process as an example.

In practical application, the target node can also be used as an acceleration node of a certain MPR node in the data packet transmission process, and based on the acceleration node, after the target node obtains the data packet, it can also be judged whether the data packet is marked with the acceleration node, whether the acceleration node is self or not, and the like.

Specifically, if the packet is a packet generated by the destination node, the packet is not marked with an acceleration node, and then the destination node also needs to determine a next-hop MPR node based on the first routing table and the destination node of the packet in the manner of step S101, and perform the related operations of steps S102 to S103.

If the packet is transmitted to the destination node by another node and the acceleration node is not marked in the packet (e.g., the acceleration node is marked as invalid), it is indicated that the destination node is the next-hop MPR node of the node to which the packet is transmitted, and therefore, the destination node also needs to determine the next-hop MPR node based on the first routing table and the destination node of the packet in the manner of the previous step S101, and perform the relevant operations of steps S102 to S103.

Similarly, if the packet is marked with an acceleration node, but the marked acceleration node is not the destination node, and the marked next-hop node is itself, it is indicated that the packet is transmitted to the destination node by a certain node through the acceleration node corresponding to the destination node, in which case the destination node, i.e., a normal MPR node, also needs to perform the related operations of determining the next-hop MPR node based on the first routing table and the destination node of the packet, and steps S102 to S103.

Of course, if the acceleration node marked in the packet obtained by the target node is the target node, it indicates that the target node receives the packet as an acceleration node, and therefore, the target node may forward the packet to the marked next-hop MPR node in the packet based on the marked next-hop MPR node in the packet.

For ease of understanding, an example application scenario is described below.

Take as an example a network topology of a wireless ad hoc network as shown in fig. 5.

In fig. 5, each circle represents a node, and it can be seen that the wireless ad hoc network shown in fig. 5 includes 6 nodes, namely, node 1, node 2, node 3, node 4, node 5, and node 6.

In the network topology of fig. 5, it is assumed that node 1 generates a packet addressed to node 6, and therefore the packet needs to be finally transferred from node 1 to node 6.

On this basis, a first routing table can be constructed based on the OLSQ protocol. In view of the fact that the link rates between the nodes are not considered in the process of establishing the first routing table by the nodes, the link rates from the nodes to each next-hop node in the first routing table are relatively low, and for convenience of distinction, the first routing table may be referred to as a low-speed routing table, and each next-hop node in the first routing table may be referred to as a low-speed 1-hop node. And the second routing table constructed by the subsequent nodes is called a high-speed routing table, and the acceleration node determined in the second routing table is called a high-speed forwarding node.

For example, the first routing table constructed by node 1 based on OLSR protocol may be as shown in table 2 below;

table 2:

destination node	Low speed 1 jump	Low speed 2 jump	Low speed 3 jump
				Node 1	Node 1	-	-
Node 2	Node 2	-	-
				Node 3	Node 3	-	-
Node 4	Node 3	-
				Node 5	Node 3	-	-
Node 6	Node 3	Node 5	-

As can be seen from table 2 above, the routing path of the data packet from node 1 to the destination node 6 is first through node 3 and then through node 5 to finally pass to the destination node 6, so that, for node 1, in the case that the destination node is node 6, the next-hop MPR node of the node 1 determined based on the low-speed routing table (i.e., the first routing table) of table 1 is node 3. Meanwhile, the node 1 can finally determine at least the MCS level from the node 1 to the node 2, the MCS level from the node 1 to the node 3, the MCS level from the node 2 to the node 1, the MCS level from the node 2 to the node 3, the MCS level from the node 3 to the node 2 and the MCS level from the node 3 to the node 1 through the MCS signaling sent by the neighbor node-node 2 and the node 3 of the node 1, and on the basis, the accelerating node corresponding to the next hop MPR node 3 can be determined by the node 1 in combination with the above description. For example, the second routing table, i.e., the high-speed routing table, constructed by node 1 may be as shown in table 3 below.

TABLE 3 Table 3

Node	High-speed forwarding node
		1	-
2	-
		3	2
4	-
		5	-
6	-

As can be seen from table 3, in the case where the next-hop MPR node determined by the node 1 is the node 3, the acceleration node of the node 3 is the node 2.

In the above description, the node 1 is taken as an example, and the low-speed routing table (the first routing table) and the high-speed routing table (the second routing table) of other nodes are also constructed, which is not described in detail.

Based on the above, the process of transmitting the data packet from the source node 1 to the destination node 6 by adopting the scheme of the present application may involve the following six operation steps corresponding to the following nodes:

(1) The node 1 generates a data packet and performs forwarding processing operations as follows:

since node 1 is the source node of the data packet, node 1 determines that the low-speed next-hop node is node 3 according to the low-speed routing table (e.g., table 1). Then, the node 1 searches the high-speed routing table to determine that the high-speed next-hop node corresponding to the node 3 is the node 2, so that the node 1 fills the low-speed next-hop node (i.e., the next-hop MPR node) in the packet header of the data packet as the node 3, fills the high-speed next-hop node (i.e., the acceleration node) as the node 2, and sends the data packet to the node 2.

(2) After the node 2 receives the data packet, it is determined that the node belongs to the high-speed next-hop node based on the packet header of the data packet, and the low-speed next-hop node is the node 3, so that the node 2 forwards the data packet to the node 3.

(3) After receiving the data packet, the node 3 processes and forwards the data packet in the following manner:

and the node 3 determines that the node is a low-speed next-hop node based on the packet head of the data packet, and then the node 3 queries a low-speed routing table, and the low-speed next-hop node is the node 5 when the destination node is the node 6. Then, the node 3 queries the constructed high-speed routing table, and if it is determined that the high-speed next-hop node (i.e., the acceleration node) corresponding to the node 5 is the node 4, the node 3 changes the low-speed next-hop node in the packet header of the data packet to the node 5, and changes the high-speed next-hop node to the node 4. The node 3 then forwards the packet to the node 4.

(4) After the node 4 receives the data packet, the operation is similar to that of the node 2, that is, the node 5 is based on the low-speed next-hop node marked in the packet header of the data packet, and the data packet is forwarded to the node 5.

(5) After the node 5 receives the data packet, it confirms that the low-speed next-hop node in the packet header of the data packet is the node 6, queries the low-speed routing table to determine that the low-speed next-hop node of the large destination node 6 is the node 6, and queries the high-speed routing table constructed by the node 5 to find out the high-speed next-hop node corresponding to the node 6, so that the node 5 fills out the low-speed next-hop node in the packet header of the data packet as the node 6, and can also fill out the high-speed next-hop node as invalid, and sends the data packet to the node 6.

(6) After receiving the data packet, the node 6 confirms that the node is the destination node, and can process the data packet without forwarding.

It can be understood that, in the application scenario of fig. 5, a unicast scenario is taken as an example, in the multicast scenario, there may be a packet that needs to be sent to multiple destination nodes, but the processing procedure from the source node to each destination node is similar, which is not described herein.

It will be appreciated that after the target node determines the target acceleration node of the next-hop MPR node, it may be further determined whether the data packet is less time-consuming to be transmitted to the MPR node via the target acceleration node, so as to further reduce the transmission efficiency of the routed communication affected by other interference. The following describes a specific implementation of an embodiment of the present application.

Fig. 6 is a schematic flow chart of a routing communication method according to an embodiment of the present application, where the method of the present embodiment may be applied to a wireless ad hoc network. The method of the embodiment can comprise the following steps:

s601, a target node determines a next hop MPR node of the target node based on a first routing table and a target node of a data packet to be sent.

The first routing table is a routing table constructed by the target node based on the optimized link state routing protocol.

In this embodiment, the destination node is taken as the source node or any MPR node of the data packet as an example.

S602, the target node determines a target acceleration node from the target node to the next-hop MPR node based on the second routing table.

The second routing table comprises acceleration nodes corresponding to one-hop neighbor nodes of the target node. The description of the second routing table may be referred to the related description of the previous embodiment, and will not be repeated here.

For convenience of distinction, an acceleration node corresponding to the next-hop MPR node in the second routing table is referred to as a target acceleration node.

The above two steps can be referred to the related description of the previous embodiments, and will not be repeated here.

S603, the target node determines a first transmission duration required for transmitting the data packet from the target node to the next-hop MPR node based on the length of the data packet, the link rate from the target node to the next-hop MPR node, and the first time required for the target node to apply for service resources.

The time for a node to apply for a service resource (e.g., a timeslot resource) in the wireless ad hoc network refers to a time period that the node needs to apply for the service resource, for example, a time period from a current time to the time period that the node needs to apply for the service resource. The time required by each node in the wireless self-organizing network for applying the service resource is related to the period of applying the service resource in the wireless self-organizing network, and the time point required by different nodes for applying the service resource can be determined based on the period, so that the time length required by the nodes from the current moment to the application of the service resource can be determined.

For convenience of distinction, the time length required for the target node to apply for the service resource is referred to as a first time, and the time length required for the subsequent target acceleration node to apply for the service resource is referred to as a second time.

The first transmission duration refers to a duration required for transmitting the data packet from the target node to the next-hop MPR node when the target node directly sends the data packet to the next-hop MPR node.

There may be a variety of ways to determine the first transmission duration. The first transmission duration T1 may be calculated by the following formula:

t1=s/r+t1 (formula one);

where S is the length of the packet in bits. R is the link rate from the target node to the next-hop MPR node, the unit is bits per second (bps), and t1 is the first time required by the target node to apply for service resources.

S604, the target node determines a second transmission duration required for the data packet to be transmitted from the target node to the next-hop MPR node through the target acceleration node based on the length of the data packet, the link rate from the target node to the target acceleration node, the first time required for the target node to apply for the service resource, the link rate from the target acceleration node to the next-hop MPR node, and the second time required for the target acceleration node to apply for the service resource.

The calculation of the second transmission time length can also be performed in a plurality of ways.

For example, the second transmission duration T2 may be calculated by the following formula two:

t2= (S/r1+t1) + (S/r2+t2) (formula two);

wherein, R1 is the link rate from the target node to the target acceleration node; r2 is the link rate from the target acceleration node to the next-hop MPR node; t2 is a second time required by the target acceleration node to apply for service resources.

S605, if the second transmission time period is longer than or equal to the first transmission time period, the target node sends a data packet to the next-hop MPR node.

It will be appreciated that if the second transmission time period is longer than or equal to the first transmission time period, the time required for the target node to directly send the data packet to the next-hop MPR node is longer than the time required for the target node to forward the data packet to the next-hop MPR node via the target acceleration node, so in order to improve the routing communication efficiency of the data packet transmission, the data packet may be directly transmitted to the next-hop MPR node.

Otherwise, if the second transmission duration is smaller than the first transmission duration, the data packet may be sent to the target acceleration node first, so that the target acceleration node forwards the data packet to the next-hop MPR node, so as to improve the data packet transmission efficiency.

S606, if the second transmission time length is smaller than the first transmission time length, marking the next-hop node as the next-hop MPR node in the packet header of the data packet, marking the accelerating node as the target accelerating node, and sending the marked data packet to the target accelerating node.

S607, if the target acceleration node confirms that the acceleration node marked in the header of the marked packet is the target acceleration node, the target acceleration node forwards the marked packet to the next-hop MPR node marked in the header.

It will be appreciated that for ease of understanding, steps S606 and S607 are illustrated as one implementation of forwarding a packet to a next-hop MPR node via a target acceleration node, and that the same applies to the present embodiment for the other ways mentioned above.

Corresponding to the routing communication method, the application also provides a routing communication device. As shown in fig. 7, which is a schematic diagram illustrating a composition structure of a routing communication device provided in an embodiment of the present application, the device of the present embodiment may be applied to a node in a wireless ad hoc network, and the device may include:

a packet obtaining unit 701, configured to obtain a data packet to be sent by the node;

A first node determining unit 702, configured to determine a next-hop MPR node of the node based on a first routing table and a destination node of the data packet, where the first routing table is a routing table constructed by the node based on an optimized link state routing protocol;

a second node determining unit 703, configured to determine a target acceleration node from the node to the next-hop MPR node based on a second routing table, where the second routing table includes: the method comprises the steps that each one-hop neighbor node of the node corresponds to an acceleration node, wherein the minimum value of the link rate from the node to the acceleration node of the one-hop neighbor node and the link rate from the acceleration node of the one-hop neighbor node to the one-hop neighbor node is larger than twice the link rate from the node to the one-hop neighbor node;

and a packet forwarding processing unit 704, configured to send the data packet to the target acceleration node, so that the target acceleration node forwards the data packet to the next-hop MPR node.

In one possible implementation, the apparatus further includes:

the packet marking unit is used for marking a next-hop node as the next-hop MPR node in the packet head of the data packet and marking the accelerating node as the target accelerating node before the packet sending unit sends the data packet to the target accelerating node, so as to obtain a marked data packet;

The packet forwarding processing unit includes:

bao Zhuaifa subunit configured to send the marked data packet to a target acceleration node, so that the target acceleration node forwards the marked data packet to the next-hop MPR node marked in the packet header, where the marked acceleration node in the marked data packet is confirmed to be the target acceleration node.

Further, the first node determining unit may include:

correspondingly, the device also comprises:

In yet another possible implementation, the apparatus further includes:

the packet forwarding processing unit includes:

In yet another possible implementation, the apparatus further includes: a routing table construction unit, configured to construct the second routing table by:

In yet another possible implementation manner, the node and different neighbor nodes of the node in the wireless ad hoc network respectively correspond to different node identification numbers;

the routing table construction unit is specifically configured to, when determining the target common neighbor node corresponding to the one-hop neighbor node as the acceleration node corresponding to the one-hop neighbor node:

It should be noted that, in the present specification, each embodiment is described in a progressive manner, and each embodiment is mainly described as different from other embodiments, and identical and similar parts between the embodiments are all enough to be referred to each other. Meanwhile, the features described in the embodiments of the present specification may be replaced with or combined with each other to enable those skilled in the art to make or use the present application. For the apparatus class embodiments, the description is relatively simple as it is substantially similar to the method embodiments, and reference is made to the description of the method embodiments for relevant points.

Finally, it is further noted that relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Moreover, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises an element.

The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present application. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the application. Thus, the present application is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

The foregoing is merely a preferred embodiment of the present application and it should be noted that modifications and adaptations to those skilled in the art may be made without departing from the principles of the present application and are intended to be comprehended within the scope of the present application.

Claims

1. A method of routing communications, for a node in a wireless ad hoc network, comprising:

obtaining a data packet to be sent by the node;

2. The method of claim 1, further comprising, prior to transmitting the data packet to the target acceleration node:

the sending the data packet to the target acceleration node includes:

3. The method of claim 2, the determining a next-hop MPR node of the node based on a first routing table and a destination node of the data packet, comprising:

the method further comprises the steps of:

4. The method of claim 1, further comprising, after determining a target acceleration node from the node to the next-hop MPR node:

the sending the data packet to the target acceleration node includes:

5. The method of claim 1, wherein the second routing table is obtained by:

6. The method of claim 5, wherein the node and the node's different neighbors each have a different node identification number;

7. A routing communications apparatus, for use in a node in a wireless ad hoc network, comprising:

8. The apparatus as recited in claim 7, further comprising:

the packet forwarding processing unit includes:

9. The apparatus of claim 8, the first node determining unit comprising:

the apparatus further comprises:

10. The apparatus as recited in claim 7, further comprising:

the packet forwarding processing unit includes: