CN101873663A - Multi-path routing algorithm based on energy sensing reliability - Google Patents

Abstract

The invention provides a multi-path routing algorithm based on energy sensing reliability, which comprises the following steps: judging the reliability of links at first to select a link for data transmission, and collecting and promptly updating cost information of the path; forming a set of paths towards a target node, calculating the predicted function value for cost balance of the paths, and arranging the paths in an ascending order; selecting paths with disjoining nodes from a set of the paths; and utilizing the predicted function value to selecte an optimal path which satisfies the reliability criteria and leads to the target node. The algorithm guarantees the routing stability and reliability, reduces the energy consumption of the network, represents a comprehensive solution to the problem of criteria for sequencing path parameters, and has high practicability in the high-mobility wireless independent network environment.

Description

A kind of based on the energy sensing reliability multi-path routing algorithm

Technical field

The present invention proposes a kind ofly based on the energy sensing reliability multi-path routing algorithm, specifically is by path cost balance forecast function, takes all factors into consideration QoS mechanism, judges path performance to excavate energy and reliability mechanisms, obtains the optimization route.

Background technology

Wireless sensor network is a kind of special AD-HOC network, and the autonomous system that it is made up of a series of mobile nodes connects the support without any need for base station and architecture between node.Be directed to that network node moves and, need higher and more effective procotol and satisfy this network requirement along the channel error that these path transmission data may be brought.This characteristics need wireless sensor network to require higher to QOS.In the AD-HOC network, be the single cost Routing Protocol in single footpath mostly." Multi-path Routingin Mobil Ad Hoc Networks:Issues and Challenges " recognizes the multipath route by document, can improve communication bandwidth, balanced load, increase the transfer rate and the link redundancy of bag, characteristics such as power loss and node mobility have been solved, especially for real-time Data Transmission.Simultaneously, many costs route with the standard and judgment that this vector is judged as route, has improved the QoS of network by in conjunction with the cost vector of relevant important parameter as the path.A key of many costs routing algorithm of describing in the document " Implementing Distributed Multi-cost Routing in Mobile Ad HocNetworks Using DSR " is the dominance relation between the path, by certain functional relation, the value that preferentially chooses is as the standard of Route Selection.

R.Leung, J.Liu, E.Poon at all, in document " A QoS-Aware Multi-Path DynamicSource Routing Protocol for Wireless Ad-Hoc Networks ", the MP-DSR algorithm has been proposed, it is the multipath unicast source routing algorithm, this algorithm is the multipath theory that proposes on DSR single path basis, defined the network end-to-end reliability simultaneously, path reliability value according to calculating finally finds the mulitpath that satisfies network reliability to carry out transfer of data.

R.Leung, J.Liu, the MP-DSR algorithm that E.Poon at al proposes has a lot of aspects deficiency:

1) at first, algorithm has only been emphasized the path reliability problem, has ignored the importance of energy.Provide in the network of energy at battery, effectively utilize energy can improve network performance and life-span.

2) secondly, this algorithm carries out descending with the path reliability value of calculating as parameter, but the problem how according to which kind of standard arrange in the path that not consideration value equates.

Summary of the invention

The object of the invention is to provide a kind of effective measurement routing mechanism, specifically is a kind of based on the energy sensing reliability multi-path routing algorithm.

Basic thought of the present invention is: this algorithm synthesis is considered path reliability and consumed power, by excavating energy and link association, and the reliability problems in and path machine-processed in conjunction with effective energy, path cost balance forecast function is proposed, and with its majorized function as the routing standard, finally obtain the non-intersect and satisfied reliability requirement end to end of many nodes effective route of consuming little energy simultaneously, solved the order standard problem of path value of consult volume more comprehensively.This algorithm can guarantee the stability and the reliability of route, reduces the energy consumption of node in the network simultaneously.

The present invention is a kind of based on the energy sensing reliability multi-path routing algorithm, mainly is to be important parameter index with energy and reliability, by excavating the contact of energy and reliability, sets up cost balance forecast function

Here, k is the path, and i, j are the nodes on the path, P _{I, j}Be node i, the consumed power between j is through-put power, R ^(k)It is the reliability value of k paths; Its concrete steps are as follows:

1) judges the reliability of link, thereby select to send the link of data, collect the cost information in path simultaneously and upgrade in time.

At first, during according to many nonintersecting paths parallel transmissions of definition, reliability formula end to end:

By initialization route querying algorithm, when the reliability in all paths all equals minimum path reliability value, still can satisfy the reliability index of network settings, thereby bring the least reliability value R that this reliability formula calculates the path into _LowerThe number of paths n that will search with source node, utilance by the link that will search and minimum path reliability value relatively, source node finds and satisfies greater than minimum path reliability and n neighbor node and broadcasting at the most.

2) be formed into the set of paths of destination node, calculate each path cost balance forecast functional value, carry out ascending order and arrange; If value equates, then arrange and promptly select the few prioritization of jumping figure according to the jumping figure ascending order.

According to formula R ^(k)(t)=∏ _{(i, j) ∈ k}l _{I, j}(t) upgrade the path reliability value, and, above-mentioned two values are put into nodal cache the consumed power value addition of passing through link.Intermediate node is broadcasted to the n at the most that satisfies condition equally neighbor node, carries out said process, finally obtains the set of paths of destination node.

According to path cost, obtain each path cost balance forecast functional value

Wherein, k is the path, and i, j are the nodes on the path, P _{I, j}Be node i, the consumed power between j is through-put power, R ^(k)It is the reliability value of k paths.

Simultaneously, the anticipation function value in each path and carry out ascending order and arrange in the set of computations when the functional value in path equates, then according to jumping figure, is carried out prioritization with the path of minimum hop count.

3) from set of paths, select the node nonintersecting paths, utilize the anticipation function value to select to satisfy the optimization path to destination node of reliability conditions.

The present invention calculates by network topological diagram and compares with existing classical MP-SDR scheduling algorithm, and this algorithm has guaranteed routing stability and reliability, has reduced energy consumption in the network simultaneously, in the wireless autonomous network environment of high mobility, has higher practicality.

The present invention is suitable for the wireless autonomous network environment of high mobility, requires each node by omnidirectional antenna consistent transmission range to be arranged in this network model; Change transmission range by node, link can add or delete; The network topology transmission range that places one's entire reliance upon, and node can transmit data in being not more than the maximum transmission power scope; Node can be by mode awareness network state and topological global informations such as GPS location in the network; When offered load was high, node was not inclined to the transmission of longer scope; In network node rate limit value scope, the node consumed power is directly proportional with euclidean distance between node pair.

Use the routing algorithm among the present invention, making up optimization balance function according to network characteristic is path cost balance forecast function.By consideration node energy and reliability mechanisms, the life span that has finally prolonged network in the wireless sensor network of frequent change in time, makes this algorithm more accurately with effective.

Description of drawings

Fig. 1 is concrete link cost topological diagram;

Fig. 2 is an embodiment of the invention schematic diagram;

Fig. 3 is that the set of paths of selected set of paths of MP-DSR routing algorithm and the used algorithm of the present invention compares schematic diagram.

Embodiment

The present invention is a kind of as follows based on energy sensing reliability multi-path routing algorithm embodiment: known each internodal link availability and consumed power value, each node is to the neighbor node broadcasting that satisfies condition.

Here we to set the end-to-end reliability value be R=0.6, by document " A QoS-Aware Multi-PathDynamic Source Routing Protocol for Wireless Ad-Hoc Networks " initialization route querying algorithm, the number of paths n=2 that obtains searching, the least reliability R in path _Lower=0.4.

1) judge the reliability of link, at first, selection will send the link of data, collects the cost information in path simultaneously and upgrades in time.By the link utilization and the minimum path reliability value R that will search _Lower=0.4 relatively, and source node finds and satisfies greater than minimum path reliability and 2 neighbor nodes and broadcasting at the most.Intermediate node is carried out said process successively.

2) be formed into the set of paths of destination node, calculate each path cost balance forecast functional value, carry out ascending order and arrange; If value equates, then arrange and promptly select the few prioritization of jumping figure according to the jumping figure ascending order.

Fig. 1 is concrete link cost topological diagram.Link cost vector (l _{I, j}, P _{I, j}) expression.I, j are node on the link, l _{I, j}Be the availability factor of link, P _{I, j}Be the power consumption of link between node,

According to formula R ^(k)(t)=∏ _{(i, j) ∈ k}l _{I, j}(t) upgrade the path reliability value, and, above-mentioned two values are put into nodal cache the consumed power value addition of passing through link.Intermediate node is carried out said process to 2 the neighbor node broadcasting at the most that satisfy condition equally, finally obtains the set of paths of destination node.According to path cost balance forecast function

Here, k is the path, and i, j are the nodes on the path, P _{I, j}Be node i, the consumed power between j is through-put power, R ^(k)It is the reliability value of k paths.The anticipation function value in each path sees Table 1 in the set of computations;

Table 1 is the selected path value of consult volume by a concrete topological diagram example calculation.

Carry out ascending order and arrange, obtaining set of paths { 4., 5. is, 3., 2., 1. } by R.Leung, J.Liu, 4. the nonintersecting paths selection algorithm that E.Poon proposes draws { 4. } R=0.513＜0.6{, 3. }, R=1-0.487* (1-0.42)=0.7175＞0.6 is final selected path, as shown in Figure 2, among the figure, thin-line arrow is represented to use based on the selected set of paths of cost balance forecast mechanism algorithm; Thick-line arrow is for satisfying the selected final path of cost balance forecast function.Propose according to Anand Srinivas,, draw the minimum energy value formula because the use of omnidirectional antenna can utilize WMA (wireless multicast advantage) mechanism.Can calculate the least energy that route consumes in the network according to this formula.

$\mathrm{\ϵ}\left(P\right)=T\left(S\right)+\underset{x\∈p,x\≠s}{\mathrm{\Σ}}T\left(x\right)=T\left(S\right)+\underset{(i,j)\∈p,i\≠s}{\mathrm{\Σ}}{\mathrm{\ω}}_{\mathrm{ij}}=80+200+300+600=1180$

3) by from set of paths, selecting the node nonintersecting paths in the table 2, utilize the anticipation function value to select to satisfy the optimization path to destination node of reliability conditions, S-A-D, S-B-C-D.Fig. 3 is that the set of paths of selected set of paths of MP-DSR routing algorithm and the used algorithm of the present invention compares schematic diagram.Among the figure, thin-line arrow is represented the selected set of paths of MP-DSR routing algorithm, and thick-line arrow is for satisfying the selected final path of end-to-end reliability value.

Table 2 is DSR, MP-DSR, and cost balance forecast mechanism algorithmic characteristic is relatively

Claims (1)

1. one kind based on the energy sensing reliability multi-path routing algorithm, is intended to find and satisfies end to end reliability requirement effective route of consuming little energy simultaneously, it is characterized in that, may further comprise the steps:

1) judges the reliability of link, thereby select to send the link of data, collect the cost information in path simultaneously and upgrade in time;

At first, during according to many nonintersecting paths parallel transmissions of definition, reliability formula end to end: By initialization route querying algorithm, when the reliability in all paths all equals minimum path reliability value, still can satisfy the reliability index of network settings, thereby bring the least reliability value R that this reliability formula calculates the path into _LowerThe number of paths n that will search with source node, utilance by the link that will search and minimum path reliability value relatively, source node finds and satisfies greater than minimum path reliability and n neighbor node and broadcasting at the most;

2) be formed into the set of paths of destination node, calculate each path cost balance forecast functional value, carry out ascending order and arrange; If value equates, then arrange and promptly select the few prioritization of jumping figure according to the jumping figure ascending order;

According to formula R ^(k)(t)=∏ _{(i, j) ∈ k}l _{I, j}(t) upgrade the path reliability value, and, above-mentioned two values are put into nodal cache the consumed power value addition of passing through link;

Intermediate node is broadcasted to the n at the most that satisfies condition equally neighbor node, carries out said process, finally obtains the set of paths of destination node;

According to path cost balance forecast function

Wherein, k is the path, and i, j are the nodes on the path, P _{I, j}Be node i, the consumed power between j is through-put power, R ^(k)It is the reliability value of k paths;

The anticipation function value in each path and carry out ascending order and arrange in the set of computations when the functional value in path equates, then according to jumping figure, is carried out prioritization with the path of minimum hop count;

3) from set of paths, select the node nonintersecting paths, utilize the anticipation function value to select to satisfy the optimization path to destination node of reliability conditions.

Images