CN101364918B - Efficiency reliable routing method based on link quality for multi-hop wireless sensor network - Google Patents

Abstract

The invention discloses a high-efficient reliable routing method of a multihop wireless sensor network based on the quality of a chain circuit, which belongs to the field of the wireless communication and transmission. According to the initialization information of all the one-hop neighbors, the efficiency weights and the chain circuit iteration radixes of the node are computed when the neighbor nodes are used as the forwarding nodes, the neighbor node with the maximum efficiency weight is selected as the first data forwarding node, then, the route selection is decided by the number of the hops of the node, and then the efficiency weights and the chain circuit iteration radixes of all the neighbor nodes and the chain circuit evaluation sheet are dynamically updated in every later transmission, so as to evaluate the quality of the chain circuit between the node and the neighbor nodes; the efficiency weights and the chain circuit iteration radixes of the node are computed when the neighbor nodes are used as the forwarding nodes according to the three values, the neighbor node with the maximum efficiency weight is selected as the first data forwarding node, and the efficiency weight and the chain circuit iteration radix are sent in the form of ACK frame and transmitted to the neighbor nodes. Finally, the invention realizes the improvement of both the data transmission reliability and the energy efficiency of the system in the network.

Description

Multi-hop wireless sensor network is based on the efficiency reliable routing method of link-quality

Technical field

The present invention relates to the efficiency reliable routing method of a kind of multi-hop wireless sensor network, belong to radio communication and information communication sphere based on link-quality.

Background technology

The jumping figure wireless sensor network is a kind of Mesh structural network, and it is a kind of and the diverse novel radio network technology of conventional wireless network.In legacy network, node is with the mode access network of single-hop, though a plurality of node adjacent they also can only and access point (AP) carry out direct communication.And in wireless Mesh netword, any node all has routing function, and each node in the network can transmit and receive data, and each node can carry out direct communication with one or more peer node, also can transmit the data of other node.In multi-hop wireless sensor network, node generally is static and topological structure is more stable, and the data of all node collections all send to the aggregation gateway node by multi-hop.

The network communication of wireless sensor environment is abominable, and the channel quality between adjacent node is very poor, and error rate can reach 30% even higher.From aggregation gateway node node far away, need the multi-hop transmission to pass to gateway node to data, in this case, data transmission success is lower, have a strong impact on the performance of wireless sensor network, therefore, how under the situation of multi-hop transmission, to overcome the problem of bad channel quality, improve reliability of data transmission, just seem particularly important.

The algorithm that adopts is reliability route LQER (the Link quality estimationbased routing) algorithm based on link-quality at present, the LQER algorithm be at minimum hop count gradient fields route MHFR (Minimum hopfield based routing) algorithm at random individual node transmit data, can not guarantee under the situation of reliability of data transmission the reliability Routing Protocol that puts forward.This algorithm has been introduced link quality parameter (link layer information) on the basis of MHFR algorithm, during data forwarding, select one hop link node the best in quality to send out node as next redirect, improves data transmission credibility, reduces and retransmits, and has saved energy.But the LQER algorithm has following two shortcomings: one. only considered single-hop channel the best, but considered that the path that the LQER algorithm is selected often is not trusted path from the whole piece path; Two. the minimum hop count path is not trusted path.

Summary of the invention

The technical problem to be solved in the present invention is to propose the efficiency reliable routing method of a kind of multi-hop wireless sensor network based on link-quality.

A kind of multi-hop wireless sensor network is based on the efficiency reliable routing method of link-quality, and wireless sensor network comprises numerous wireless sensor nodes, it is characterized in that may further comprise the steps:

1.) start wireless sensor node, carry out initialization, sensor node enters idle condition;

2.) receive a packet when this section point, the link iteration root of this node when calculating neighbor node as forward node:

$J_{\mathrm{Ni}}=J_i^{\′{\mathrm{hops}}_i}*[1-{(1-p_{\mathrm{Ni}})}^3]$

$J_{\mathrm{Ni}}^{\′}=\sqrt[\mathrm{hops}]{J_{\mathrm{Ni}}}$

J _Ni-this node is transmitted the data transmission success that arrives gateway node through neighbor node;

-neighbor node arrives the optimum data transmission success rate root of gateway node;

P _Ni-this node is to transmission success rate of single-hop Frame of neighbor node, and initialization value is 1;

-this node is transmitted the data transmission success root that arrives gateway node through neighbor node;

The network jumping figure of hops-this node;

Hops _iThe jumping figure of-neighbor node;

3. the efficiency weights of source node when) calculating neighbor node as forward node:

$Q_{\mathrm{Ni}}={\mathrm{hops}}_i*Q_i^{\′}+\frac{(3-3{\mathrm{\τ}}_{\mathrm{Ni}}+{\mathrm{\τ}}_{\mathrm{Ni}}^2)}{J_i^{\′{\mathrm{hops}}_i}*[1-{(1-p_{\mathrm{Ni}})}^3]}$

τ _Ni＝P _Ni*q _Ni

Q _NiThe efficiency weights of-neighbor node this node N during as forward node;

The best efficiency average of-neighbor node, initialization value is 1.5;

τ _Ni-successfully send and receive the probability of ACK frame;

q _Ni-this node is to transmission success rate of single-hop ACK frame of neighbor node, and initialization value is 1;

4.) the efficiency weights Q of each neighbor node of this node of comparison _Ni, select to make efficiency weights Q _NiMinimum node as forward node and

$Q_N^{\′}=Q_{\mathrm{Ni}}/\mathrm{hops};$ $J_N^{\′}=J_{\mathrm{Ni}}^{\′}$

The best efficiency average of-this node;

-this node arrives the optimum data transmission success rate root of gateway node;

In the formula

With

Be written into the ACK frame, be accompanied by the neighbor node that the ACK frame passes to forward node;

5.) data are sent to efficiency weights Q _NiMinimum node;

6.) according to this data forwarding situation, carry out link-quality and upgrade, memory chain table record sensor node nearest m time to efficiency weights Q _NiThe situation of minimum node for data forwarding, m=9,1 representative is transmitted successfully, and 0 represents retransmission failure; When data send successfully, then linked list data moves to left one, the rightest position 1; When data send failure, linked list data moves to left one, the rightest position 0, and k is the number of times of memory span data forwarding success when being m, i.e. 1 number in the chained list after the renewal, is carried out accurate valuation according to the m and the k value of each neighbor node memory chained list:

${\mathrm{\τ}}_{\mathrm{Ni}}=\frac{k}{m}$

p _Ni＝τ _Ni ^α

$\mathrm{\α}=\frac{{\mathrm{len}}_{\mathrm{data}}}{{\mathrm{len}}_{\mathrm{data}}+{\mathrm{len}}_{\mathrm{ack}}}$

The accurate estimation index of α-link;

Len _DataThe length of-Frame;

Len _AckThe length of-ACK frame;

7., and from the ACK frame that successfully returns, read efficiency weights Q) according to this data forwarding situation _NiThe up-to-date best efficiency average of minimum node With the optimum data transmission success rate root that arrives gateway node Otherwise

With

Keep initial value, as efficiency weights Q _NiWhen minimum node sent data once more, more new sensor node information was returned step 2.

A kind of multi-hop wireless sensor network of the present invention is based on the link-quality reliable routing method, under the situation of the abominable bad channel quality of network communications environment, can significantly improve the reliability of each node data transmission, the energy consumption of saving network improves energy utilization efficiency.The present invention is applied in the multi-hop sensor network can adapt to abominable network communications environment well.

Description of drawings

Fig. 1: multi-hop wireless sensor network of the present invention is based on the flow chart of the efficiency reliable routing method of link-quality;

Fig. 2: multi-hop wireless sensor network of the present invention is based on the efficiency reliable routing method memory chained list schematic diagram of link-quality;

Fig. 3: network scenarios one analogous diagram of the present invention;

Fig. 4: network scenarios two analogous diagram of the present invention;

Fig. 5: network scenarios three analogous diagram of the present invention.

Embodiment

As shown in Figure 1, a kind of multi-hop wireless sensor network is based on the efficiency reliable routing method of link-quality, be according to node jumping figure information and the link initialization Information Selection head-end site first time, and according to the situation renewal link information of transmitting, update method is the link-quality evaluation mechanism, write down each forward node and successfully receive and transmit or the historical information of failure, estimate in view of the above and each neighbor node between link-quality; Simultaneously, from the ACK frame that successfully receives, obtain the best efficiency weights and the link iteration information thereof of neighbor node.Then according to and neighbor node between the weights of link-quality, neighbor node and link iteration information calculations to go out each neighbor node be the efficiency weights and the link iteration root of this node as forward node, and select to make the neighbor node of efficiency weights minimum send out node as next redirect according to result of calculation.

In intensive wireless sensor network, all data all are that the mode with multi-hop sends to gateway, and alternative route is very many, and is not minimum hop count route the best; Particularly under the environment of communication quality difference, the data transmission success of minimum hop count route is relatively poor.Therefore to improve data transmission success, need make full use of the multirouting characteristics of intensive node, use each neighbor node really, can adopt the efficiency reliability routing algorithm among the present invention based on link-quality.

Select forward node in order to calculate for the first time weights, after we suppose that the minimum hop count gradient is set up, node has been known its hop neighbor tabulation by the routing procedure of network layer, and the initialization value of the efficiency weights of all neighbor nodes and link iteration root equates.

The present invention proposes in the multi-hop wireless sensor network efficiency reliability routing algorithm based on link-quality, it mainly comprises: according to the initialization information of all hop neighbors of node, efficiency weights of this node and link iteration root when calculating each neighbor node as forward node, select the conduct head-end site first time (this moment, Route Selection was by the decision of node jumping figure) of efficiency weights minimum, dynamically update each neighbour's efficiency weights and link iteration root and link evaluation form then in each transmission afterwards and estimate link-quality between this node and each neighbor node, efficiency weights of this node and link iteration root when calculating each neighbor node as forward node according to these three values, select efficiency weights minimum as head-end site, and these efficiency weights and link iteration root are waited for that sending out an ACK frame passes to neighbor node.The raising of data transmission in network reliability and the raising of system capacity efficient have finally been realized.

This method comprises the steps:

1.) start wireless sensor node, carry out initialization, sensor node enters idle condition;

2.) receive a packet when this section point, the link iteration root of this node when calculating neighbor node as forward node:

$J_{\mathrm{Ni}}=J_i^{\′{\mathrm{hops}}_i}*[1-{(1-p_{\mathrm{Ni}})}^3]$

$J_{\mathrm{Ni}}^{\′}=\sqrt[\mathrm{hops}]{J_{\mathrm{Ni}}}$

J _Ni-this node is transmitted the data transmission success that arrives gateway node through neighbor node;

-neighbor node arrives the optimum data transmission success rate root of gateway node;

p _Ni-this node is to transmission success rate of single-hop Frame of neighbor node, and initialization value is 1;

-this node is transmitted the data transmission success root that arrives gateway node through neighbor node;

The network jumping figure of hops-this node;

Hops _iThe jumping figure of-neighbor node;

3. the efficiency weights of source node when) calculating neighbor node as forward node:

$Q_{\mathrm{Ni}}={\mathrm{hops}}_i*Q_i^{\′}+\frac{(3-3{\mathrm{\τ}}_{\mathrm{Ni}}+{\mathrm{\τ}}_{\mathrm{Ni}}^2)}{J_i^{\′{\mathrm{hops}}_i}*[1-{(1-p_{\mathrm{Ni}})}^3]}$

τ _Ni＝p _Ni*q _Ni

Q _NiThe efficiency weights of-neighbor node this node N during as forward node;

The best efficiency average of-neighbor node, initialization value is 1.5;

τ _Ni-successfully send and receive the probability of ACK frame;

q _Ni-this node is to transmission success rate of single-hop ACK frame of neighbor node, and initialization value is 1;

4.) the efficiency weights Q of each neighbor node of this node of comparison _Ni, select to make efficiency weights Q _NiMinimum node as forward node and

$Q_N^{\′}=Q_{\mathrm{Ni}}/\mathrm{hops};$

$J_N^{\′}=J_{\mathrm{Ni}}^{\′}$

The best efficiency average of-this node;

-this node arrives the optimum data transmission success rate root of gateway node;

In the formula

With

Be written into the ACK frame, be accompanied by the neighbor node that the ACK frame passes to forward node;

5.) data are sent to efficiency weights Q _NiMinimum node;

6.) as shown in Figure 2.According to this data forwarding situation, carry out link-quality and upgrade, memory chain table record sensor node nearest m time to efficiency weights Q _NiThe situation of minimum node for data forwarding, m=9,1 representative is transmitted successfully, and 0 represents retransmission failure; When data send successfully, then linked list data moves to left one, the rightest position 1; When data send failure, linked list data moves to left one, the rightest position 0, and k is the number of times of memory span data forwarding success when being m, i.e. 1 number in the chained list after the renewal, is carried out accurate valuation according to the m and the k value of each neighbor node memory chained list:

${\mathrm{\τ}}_{\mathrm{Ni}}=\frac{k}{m}$

p _Ni＝τ _Ni ^α

$\mathrm{\α}=\frac{{\mathrm{len}}_{\mathrm{data}}}{{\mathrm{len}}_{\mathrm{data}}+{\mathrm{len}}_{\mathrm{ack}}}$

The accurate estimation index of α-link;

Len _DataThe length of-Frame;

Len _AckThe length of-ACK frame;

7., and from the ACK frame that successfully returns, read efficiency weights Q) according to this data forwarding situation _NiThe up-to-date best efficiency average of minimum node

With the optimum data transmission success rate root that arrives gateway node

Otherwise

With

Keep initial value, as efficiency weights Q _NiWhen minimum node sent data once more, more new sensor node information was returned step 2.

Utilize OPNET emulation a kind of multi-hop wireless sensor network of the present invention based on the efficiency reliable routing method of link-quality with based on reliability route LQER (the Link quality estimationbased routing) algorithm of link-quality, simulated environment is as follows:

As Fig. 3,4 sensor nodes constitute a simple double bounce network, one of them gateway node, two one hop nodes and one two hop node;

As Fig. 4,6 sensor nodes constitute one simple three and jump network, one of them gateway node, two one hop nodes, two two hop nodes and one three hop node;

As Fig. 5,26 sensor nodes are randomly dispersed in the space of 250m*250m, and one of them is a gateway node, and 25 is ordinary node.

More than three simulation results as table 1 to shown in the table 3.Adopt the system data transmission reliability, the system capacity efficiency index is weighed network performance, and they are defined as follows:

System data transmission reliability: the ratio (gw_packet_rev/global_packet_send) of the bag total amount that the bag total amount that gateway receives and the whole network node send;

System capacity efficiency index: the ratio (global_send_counts/gw_packet_rev) of the bag total amount that transmission number of times of the whole network node bag (comprise and transmit retransmitted packet) and gateway receive.

Table 1 Fig. 3 scene simulation result

Table 2 Fig. 4 scene simulation result

Table 3 Fig. 5 scene simulation result

Claims (1)

1. a multi-hop wireless sensor network is based on the efficiency reliable routing method of link-quality, and wireless sensor network comprises numerous wireless sensor nodes, it is characterized in that may further comprise the steps:

1.) start wireless sensor node, carry out initialization, sensor node enters idle condition;

2.) receive a packet when this section point, the link iteration root of this node when calculating neighbor node as forward node:

J _Ni-this node is transmitted the data transmission success that arrives gateway node through neighbor node;

-neighbor node arrives the optimum data transmission success rate root of gateway node;

p _Ni-this node is to transmission success rate of single-hop Frame of neighbor node, and initialization value is 1;

-this node is transmitted the data transmission success root that arrives gateway node through neighbor node;

This node of hops-arrives the network jumping figure of gateway node;

Hops _i-neighbor node arrives the jumping figure of gateway node;

3. the efficiency weights of this node when) calculating neighbor node as forward node:

Q _NiThe efficiency weights of-neighbor node this node during as forward node;

The best efficiency average of-neighbor node, initialization value is 1.5;

τ _Ni-successfully send and receive the probability of ACK frame;

q _Ni-this node is to transmission success rate of single-hop ACK frame of neighbor node, and initialization value is 1;

4.) the efficiency weights Q of each neighbor node of this node of comparison _Ni, select efficiency weights Q _NiMinimum node as forward node and

The best efficiency average of-this node;

-this node arrives the optimum data transmission success rate root of gateway node;

In the formula With

Be written into the ACK frame, be accompanied by the neighbor node that the ACK frame passes to forward node;

5.) data are sent to efficiency weights Q _NiMinimum node;

6.) according to this data forwarding situation, carry out link-quality and upgrade, memory chain table record sensor node nearest m time to efficiency weights Q _NiThe situation of minimum node for data forwarding, m=9,1 representative is transmitted successfully, and 0 represents retransmission failure; When data send successfully, then linked list data moves to left one, the rightest position 1; When data send failure, linked list data moves to left one, the rightest position 0, and k is the number of times of memory span data forwarding success when being m, i.e. 1 number in the chained list after the renewal, is carried out accurate valuation according to the m and the k value of each neighbor node memory chained list:

p _Ni＝τ _Ni ^α

The accurate estimation index of α-link;

Len _DataThe length of-Frame;

Len _AckThe length of-ACK frame;

7., and from the ACK frame that successfully returns, read efficiency weights Q) according to this data forwarding situation _NiThe up-to-date best efficiency average of minimum node

With the optimum data transmission success rate root that arrives gateway node

Otherwise

With

Keep initial value, as efficiency weights Q _NiWhen minimum node sent data once more, more new sensor node information was returned step 2.

Images