CN113747536A

CN113747536A - QoS-aware multi-path routing algorithm of WSNs in mobile environment

Info

Publication number: CN113747536A
Application number: CN202111124253.6A
Authority: CN
Inventors: 张泽赟
Original assignee: Tengyun Yuezhi Technology Shenzhen Co ltd
Current assignee: Tengyun Yuezhi Technology Shenzhen Co ltd
Priority date: 2021-09-24
Filing date: 2021-09-24
Publication date: 2021-12-03
Anticipated expiration: 2041-09-24
Also published as: CN113747536B

Abstract

The invention discloses a QoS-aware multi-path routing algorithm of WSNs in a mobile environment, which is characterized in that a routing cost function is constructed by acquiring real-time data of a plurality of QoS parameters of nodes, a path with the minimum cost is calculated to be used as a preferred path, then the area of an area surrounded by other paths and the preferred path is calculated, and a maximum area is found out, so that the path with the minimum interference with the preferred path is confirmed, therefore, QoS constraint and path interference are fully considered in a mobile WSNs multi-constraint multi-path routing model and algorithm, and the performance is ensured not to be influenced.

Description

QoS-aware multi-path routing algorithm of WSNs in mobile environment

Technical Field

The invention relates to the technical field of mobile WSNs, in particular to a QoS-aware multi-path routing algorithm of WSNs in a mobile environment.

Background

Typical multi-constraint and multi-path routing algorithms are mainly:

1. a multi-path routing algorithm MP-OLSR in a mobile environment is based on a classic single-path OLSR algorithm, a single path is selected through a Dijkstra algorithm, a constructed cost penalty function is adopted to carry out 'penalty' on links on a selected path, the cost of the links is increased, and node disjoint multi-path routing is constructed. Simulation results show that compared with the traditional single-path routing algorithm OLSR, the algorithm has the advantages that the network life cycle, the packet receiving rate, the time delay, the throughput and other performances are greatly improved, but the link cost adopted in the algorithm is a preset value, and the network state cannot be truly reflected.

2. A QoS routing model suitable for WSNs comprises four QoS indexes, namely time delay, packet loss rate, remaining energy and available buffer area related to nodes or links. And based on the improved ant colony algorithm, providing the ant colony-based multi-QoS routing algorithm. In order to meet the transmission of data traffic with different QoS requirements, a hierarchical structure of a network is firstly constructed, and then an appropriate route is selected, so that the network is utilized to the maximum extent to improve the performance. Meanwhile, the video packet scheduling is carried out by using multiple paths, so that the video transmission distortion is minimized. Simulation results show that the algorithm has better convergence than the traditional routing algorithm and ant colony algorithm, and can provide better QoS for different types of services. However, this document does not consider the situation where there is interference between multiple paths, which makes it difficult to guarantee the various QoS constraints mentioned above, and even leads to a severe performance degradation.

Theoretical research and technical application of WSNs in the prior art in the market are still in exploration and demonstration stages, and QoS constraint and path interference cannot be fully considered in a mobile WSNs multi-constraint multi-path routing model and algorithm.

Accordingly, the prior art is deficient and needs improvement.

Disclosure of Invention

The invention aims to overcome the defects of the prior art and provide a QoS-aware multi-path routing algorithm of WSNs in a mobile environment.

The technical scheme of the invention is as follows: a QoS-aware multi-path routing algorithm for WSNs in a mobile environment is provided, which comprises the following steps:

step 1: acquiring real-time data of a plurality of QoS parameters of a node, and giving corresponding weight factors to different QoS parameters;

step 2: constructing a routing cost function;

and step 3: selecting a path with the minimum cost by applying an improved Dijkstra algorithm, and taking the found path with the minimum cost as a preferred path;

and 4, step 4: searching other paths by using an improved Dijkstra algorithm and a cost function;

and 5: respectively calculating the area of the region surrounded by the other paths and the preferred path;

step 6: and finding the area with the largest area from the data obtained in the step 5, wherein the path on the area is the path with the smallest interference with the optimal path.

Further, the QoS parameters of claim 1 include: the distance from the node to the sink, the reliability of the link, the residual energy of the node and the queue length of the node.

Further, the routing cost function constructed in step 2 is:

the node j is a neighbor node of the node i, COSTij represents a routing cost between the node i and the node j, rij represents reliability of a link between the node i and the node j, ej represents residual energy of the node j, lenj represents a queue length of the node j, α, β, γ and λ are weighting factors, and α + β + γ + λ is 1.

Further, when searching for other paths in step 4, nodes selected by different paths are different, and different paths are not intersected.

By adopting the scheme, the invention constructs the routing cost function by acquiring the real-time data of a plurality of QoS parameters of the nodes, calculates the path with the minimum cost as the preferred path, then calculates the area of the area surrounded by other paths and the preferred path, finds the area with the maximum area, and confirms the path with the minimum interference with the preferred path, thereby fully considering QoS constraint and path interference in a mobile WSNs multi-constraint multi-path routing model and algorithm and ensuring that the performance is not influenced.

Drawings

FIG. 1 is a schematic structural diagram of the present invention.

FIG. 2 is a schematic diagram of constructing multiple paths.

Fig. 3 is a schematic diagram of region division.

Fig. 4 is a schematic diagram comparing the area of the regions.

Detailed Description

The invention is described in detail below with reference to the figures and the specific embodiments.

Referring to fig. 1, the present invention provides a QoS-aware multi-path routing algorithm for WSNs in a mobile environment.

step 1: and acquiring real-time data of a plurality of QoS parameters of the node, and giving corresponding weight factors to different QoS parameters. The QoS parameters include: the distance from the node to the sink, the reliability of the link, the residual energy of the node and the queue length of the node.

Step 2: constructing a routing cost function:

the node j is a neighbor node of the node i, COSTij represents a routing cost between the node i and the node j, rij represents reliability of a link between the node i and the node j, ej represents residual energy of the node j, lenj represents a queue length of the node j, α, β, γ and λ are weighting factors, and α + β + γ + λ is 1. The method is characterized in that a multi-path routing decision is made at a node i, j is a neighbor node of i, and i selects a node closest to a sink in a neighbor table of i, so that a routing loop can be effectively avoided; in order to improve the reliability of data transmission, i always selects the neighbor node with the highest reliability as a next hop node; in order to prolong the life cycle of the whole network and avoid the generation of 'route black holes', i always selects the neighbor node with the maximum residual energy as the next hop node; and the shorter the queue length of the selected next hop node is, and the shorter the queue length of the selected next hop node is.

And step 3: the method comprises the steps of firstly finding out a path with the minimum cost from a Source node to a Sink node by applying improved Dijkstra, and using the path as a preferred path to transmit data.

And 4, step 4: referring to fig. 2, other paths are found using the modified Dijkstra algorithm and the cost function. When other paths are searched, nodes selected by different paths are different, and the different paths are not intersected. According to the proposed routing cost function, an optimal Path1 is searched by utilizing a Dijkstra algorithm, and meanwhile, the link cost on the Path is increased by utilizing a cost penalty function, at the moment, when the 2 nd Path is searched, the node on the Path1 is not selected, so that node disjointness is realized. Suppose that the algorithm has found 3 disjoint paths Path1, Path2 and Path3, where Path1 is the optimal Path and Path1 is preferred for sending packets. However, considering that interference is avoided as much as possible, when selecting the Path with the least interference with Path1, the Path should be selected as far away from Path1 as possible.

And 5: and respectively calculating the area of the region surrounded by the other paths and the preferred path. First, the area of the region 2 surrounded by Path1 and Path2 and the area of the region 3 surrounded by Path1 and Path3 were calculated, respectively. Referring to fig. 3, when calculating the area of the region, the region may be decomposed into a plurality of triangles or trapezoids around the coordinate line, and the total area of the region is calculated according to the node coordinates. Referring to fig. 4, finally, comparing the areas of the two regions, it is apparent that the area of region 3 is larger than the area of region 2, so that i select Path3 as the sub-optimal Path for data transmission, i.e. Path1 and Path3 are node-disjoint paths with the least interference.

In summary, the invention constructs a routing cost function by obtaining real-time data of a plurality of QoS parameters of nodes, calculates a path with the minimum cost as a preferred path, then calculates the area of the area surrounded by other paths and the preferred path, finds the area with the maximum area, and confirms the path with the minimum interference with the preferred path, thereby fully considering QoS constraint and path interference in a mobile WSNs multi-constraint multi-path routing model and algorithm and ensuring that the performance is not influenced.

The present invention is not limited to the above preferred embodiments, and any modifications, equivalent substitutions and improvements made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims

1. A QoS-aware multi-path routing algorithm for WSNs in a mobile environment, comprising the steps of:

step 2: constructing a routing cost function;

2. The QoS-aware multi-path routing algorithm for WSNs in a mobile environment as claimed in claim 1, wherein the QoS parameter in claim 1 comprises: the distance from the node to the sink, the reliability of the link, the residual energy of the node and the queue length of the node.

3. The QoS-aware multi-path routing algorithm for WSNs in a mobile environment according to claim 1, wherein the routing cost function constructed in step 2 is:

wherein, the node j is a neighbor node of the node i, COST_ijRepresents the route cost, r, between node i and node j_ijRepresenting the reliability of the links of node i and node j, e_jRepresenting the residual energy, len, of node j_jFor the queue length of node j, α, β, γ, and λ are weighting factors, and α + β + γ + λ is 1.

4. The QoS-aware multi-path routing algorithm for WSNs in a mobile environment of claim 1, wherein when other paths are searched in the step 4, nodes selected by different paths are different and the different paths are disjoint.