CN102781063B - Method for establishing WSN (wireless sensor network) energy equalizing routing based on local network betweenness - Google Patents

Abstract

The invention relates to a method for establishing a WSN (wireless sensor network) energy equalizing routing based on local network betweenness. The technical scheme is as follows: when a node (Xi) receives a data packet (P), if a destination node (destination) is not found in neighboring nodes (ni) of the node (Xi), measuring the energy cost (costi) of each neighboring node (ni) of the node (Xi) according to a mathematical model costi=alpha di+(1-alpha)bi. The data packet (P) is forwarded to the neighboring node (nmin) with the minimum energy cost (costi), then the routing table (routing_table) of the node (Xi) is updated, and a method for establishing a routing from the neighboring node (nmin) receiving the data packet (P) to the destination node (destination) is the same with the above method until the data packet (P) reaches the destination node (destination). In a method for establishing a routing through which the node (Xi) continues to send a subsequent data packet (P) to the destination node (destination), the above process is repeated. Thus, the method provided by the invention has the characteristics of prolonging the life time of the network, and improving the transmission reliability and the energy equilibrium of the network.

Description

The method of the WSN balancing energy Route establishment based on localized network betweenness

Technical field

The invention belongs to the method for Route establishment in wireless sensor network (Wireless SensorNetwork is called for short WSN).Relate in particular to a kind of method of the WSN balancing energy Route establishment based on localized network betweenness.

Background technology

Wireless sensor network (Wireless Sensor Network, abbreviation WSN) conventionally by hundreds of even thousands of individual distributed sensor nodes, organize themselves into a network and monitor certain physical phenomenon, its low-power consumption and the characteristic of easily disposing contain extensively its application, as environmental monitoring, production control, intelligent transportation and intelligent grid etc.In the practical application of a lot of WSN, network's coverage area extensively needs thousands of sensor nodes, and regional environment is complicated, and some region even personnel can not arrive.And sensor node leans on powered battery, it is unpractical that sensor node supplements the energy by the mode of replacing battery.Once the sensor node depleted of energy that part is important, WSN will paralyse because network is discrete.Therefore how to reduce energy consumption, the consumption of balancing network energy, the prolongation network operation life-span of WSN node and prevent the key problem that the discrete WSN of being of network studies.

The state of WSN node wireless network communication module mainly comprises transmission state, accepting state, intercepts state and sleep state.The energy of unit interval internal consumption reduces successively according to said sequence.So for WSN node, its Packet Generation and reception, the forwarding energy consumption of packet is maximum.As can be seen here, the route of design energy equilibrium, minimizing WSN node package forward, optimization WSN method for routing foundation and the consumption of balance network energy are to reduce the energy consumption of WSN node and an important method of prolong network lifetime.

The unbalanced reason that has two aspects of energy of WSN: be unbalanced that in network, event occurs on the one hand, this is uncontrollable; Be on the other hand low-yield node forwarding data always prior to high-energy node, cause the unbalanced accumulation of energy, this is controllable.The balanced route of design energy solves the unbalanced important method of the latter's energy exactly.

The balancing energy route of WSN mainly contains two large classes at present, be distributed and centralized balancing energy route: the balanced route of distributed energy is to take a series of WSN clustering routings that LEACH algorithm is representative, it mainly carrys out equalizing network energy consumption by network cluster head rotation strategy, but that bunch great wheel is changed with the control overhead of sub-clustering is larger; Centralized balancing energy route be centralized collection to full mesh topology and the basis of energy information on, with certain optimisation strategy, as modes such as linear programming, ant group optimization and heuritic approaches, find suitable route to make balancing energy reach best.Centralized balancing energy route, at the control overhead of not considering to collect topological sum energy information, generally can obtain approaching optimum optimum results, but this centralized control overhead can be with network size increase and constantly increase, and extensibility is poor.

While no matter being distributed or centralized WSN balancing energy Route establishment, hypothesis network node is uniformly distributed mostly, and research is found, actual wireless sensor network spatial distribution of nodes has the scale-free characteristics of complex network.

Summary of the invention

The present invention is intended to overcome the defect of prior art, and object is to provide a kind of method that can extend life cycle, the raising reliability of Internet Transmission and the WSN balancing energy Route establishment based on localized network betweenness of network energy equilibrium of network.

For achieving the above object, the technical solution used in the present invention is: in WSN, have N node X _i, i ∈ [1, N-1], node X _itransmission packet P to the method for the Route establishment of object node destination is:

If step 1 node X _ithere is no routing table routing_table, is node X _iconstruct a routing table routing_table, routing table routing_table is comprised of " object " row and " down hop " row, and routing table routing_table is empty.

A node X in step 2, WSN _iwhile receiving packet P, at described node X _iall neighbor node n _iin search object node destination, if find object node destination, packet P is directly delivered to described object node destination.

If step 3 does not find object node destination, except upper hop neighbor node, described node X _ieach neighbor node n _ienergy cost cost _imathematical Modeling be

cost _i＝αd _i+(1-α)b _i （1）

In formula (1): d _ifor characteristic value, represent node X _ineighbor node n _ipath respectively and between object node destination;

α is characteristic value d _iweight, α ∈ [0,1];

B _ifor another feature value, represent node X _ineighbor node n _ilocalized network betweenness,

$b_i=\underset{d,n_i\∈\mathrm{routing}\_\mathrm{table}}{\mathrm{\Σ}}\frac{{\mathrm{\σ}}_d\left(n_i\right)}{{\mathrm{\σ}}_d}---\left(2\right)$

In formula (2): σ _drepresent node X _irouting table routing_table in the number of route entry;

σ _d(n _i) expression node X _irouting table routing_table in down hop classify neighbor node n as _ithe number of route entry;

If described node X _irouting table routing_table be empty, for described node X _ineighbor node n _ilocalized network betweenness b _ibe 0.

Step 4, at described node X _ineighbor node n _iin, packet P is transmitted to energy cost cost _iminimum neighbor node n _min, then from packet P, extract object node destination, then upgrade by the following method described node X _irouting table routing_table:

If there is not the route entry of object node destinaiton in routing table routing_table, in routing table routing_table, increase a route entry, " object " row of described route entry are object node destination, and " down hop " row are energy cost cost _iminimum neighbor node n _min;

If routing table routing_table exists the route entry of object node destinaiton, " down hop " row in described route entry are updated to energy cost cost _iminimum neighbor node n _min.

Step 5, receive the energy cost cost of packet P _iminimum neighbor node n _minto the method for the Route establishment of object node destination with step 1 ~ step 4, until packet P arrives object node destination.

Step 6, node X _icontinue to send follow-up data bag P to the method for the Route establishment of object node destination with step 1 ~ step 5.

Owing to adopting technique scheme, the present invention compared with prior art has following good effect:

The present invention is by the variation of node localized network betweenness, in WSN from node X _ito setting up mulitpath between object node destination, carry out transfer of data, allow more node X _ishare network traffics, avoid some node in WSN owing to bearing too many network traffics, energy to be exhausted too early, cause WSN cut apart or WSN collapses fast.

The present invention adopts two characteristic value " path d _i" and " localized network betweenness b _i", be respectively used to tolerance and " estimate to need the energy of consumption " and " dump energy of neighbor node ".Neighbor node n _ipath to object node destination is shorter, estimates from this neighbor node n _ithe network energy that forwarding data bag P need to consume is just less.Neighbor node n _ilocalized network betweenness less, this neighbor node n is described _ilast time does not participate in packet P and forwards, and dump energy is larger.Pass through set up energy cost cost _imathematical Modeling, can measure out exactly neighbor node n _ithe energy that forwarding data bag P consumes, therefore node X _ican select energy cost cost _iminimum neighbor node n _ias down hop.

Therefore, the present invention should avoid relying on simply shortest path to carry out packet P transmission and cause some node X _itoo early dead, finally cause cutting apart or the quick collapse of WSN of WSN, thereby extended the life cycle of WSN, improved the reliability of packet P transmission and realized energy consumption balance.

Accompanying drawing explanation

Fig. 1 is that the present invention is for a kind of schematic diagram of WSN structure;

Fig. 2 is the Path selection schematic diagram of Fig. 1.

Embodiment

Below in conjunction with the drawings and specific embodiments, the present invention is described in further detail, not limiting the scope of the invention.

It is example that this embodiment be take a kind of WSN structure shown in Fig. 1, and in this WSN structure, nodal point number N is 6, the 1 node X _ithe 1st time, the 2nd time, the 3rd time, the 4th ... send successively packet P1, P2, P3, P4 ... to the 6th node, the 6th node is object node destination.

Embodiment 1

A kind of method of the WSN balancing energy Route establishment based on localized network betweenness.The 1st node X of this WSN structure ₁send packet P1 to object node destination, the step of its Route establishment is:

Step 1, the 1st node X ₁there is no routing table routing_table, is the 1st node X ₁construct a routing table routing_table, routing table routing_table is comprised of " object " row and " down hop " row, and routing table routing_table is empty.

The 1st node X in step 2, WSN ₁while receiving packet P1, at the 1st node X ₁neighbor node n ₁with neighbor node n ₂in search object node destination, the 1st node X ₁neighbor node n ₁be the 2nd node X ₂, the 1st node X ₁neighbor node n ₂be the 4th node X ₄; Do not find object node destination, packet P1 can not directly be delivered to described object node destination.

Step 3, do not find object node destination, except upper hop neighbor node, the 1st node X ₁neighbor node n ₁with neighbor node n ₂energy cost cost ₁and cost ₂respectively:

${\cos t}_1={\mathrm{\αd}}_1+(1-\mathrm{\α})b_1=\frac{1}{8}\×2+\left(\text{1-}\frac{1}{8}\right)\×0=\frac{2}{8}$

${\cos t}_2={\mathrm{\αd}}_2+(1-\mathrm{\α})b_2=\frac{1}{8}\×1+\left(\text{1-}\frac{1}{8}\right)\×0=\frac{1}{8}$

Wherein: α is characteristic value d ₁weight,

D ₁the 1st node X ₁neighbor node n ₁and the path between object node destination, path is 2;

D ₂the 1st node X ₁neighbor node n ₂and the path between object node destination, path is 1;

B ₁the 1st node X ₁neighbor node n ₁localized network betweenness;

B ₂the 1st node X ₁neighbor node n ₂localized network betweenness.

The 1st node X ₁routing table routing_table be empty, for the 1st node X ₁neighbor node n ₁with neighbor node n ₂localized network betweenness b ₁and b ₂be 0.

Step 4, at the 1st node X ₁neighbor node n ₁with neighbor node n ₂in, packet P1 is transmitted to energy cost cost ₁and cost ₂minimum neighbor node n ₂, then from packet P1, extract object node destination, then upgrade by the following method the 1st node X ₁routing table routing_table:

Owing to there not being the route entry of object node destination in routing table routing_table, in routing table routing_table, increase a route entry, " object " row of described route entry are object node destination, and " down hop " row are cost ₁and cost ₂minimum neighbor node n ₂.

The 1st node X ₁routing table routing_table increase after route entry as shown in table 1:

Table 1 the 1st node X ₁routing table routing_table

Object	Down hop
		6	4

Step 5, receive down hop the 4th node X of packet P1 ₄to the method for the Route establishment of object node destination with the present embodiment step 1～step 4, until packet P1 arrives object node destination.

In the present embodiment, the 1st node X ₁while sending packet P1 to object node destination, the route of packet P1 is 1 → 4 → 6.

Embodiment 2

A kind of method of the WSN balancing energy Route establishment based on localized network betweenness.The 1st node X of this WSN structure ₁send packet P2 to object node destination, the step of its Route establishment is:

Step 1, due to the 1st node X ₁there is routing table routing_table, directly performed step 2.

The 1st node X in step 2, WSN ₁while receiving packet P2, at the 1st node X ₁neighbor node n ₁with neighbor node n ₂in search object node destination, the 1st node X ₁neighbor node n ₁be the 2nd node X ₂, the 1st node X ₁neighbor node n ₂be the 4th node X ₄; Do not find object node destination, packet P2 can not directly be delivered to described object node destination.

Step 3, do not find object node destination, except upper hop neighbor node, the 1st node X ₁neighbor node n ₁with neighbor node n ₂energy cost cost ₁and cost ₂respectively:

${\cos t}_1={\mathrm{\αd}}_1+(1-\mathrm{\α})b_1=\frac{1}{8}\×2+\left(\text{1-}\frac{1}{8}\right)\×0=\frac{2}{8}$

${\cos t}_2={\mathrm{\αd}}_2+(1-\mathrm{\α})b_2=\frac{1}{8}\×1+\left(\text{1-}\frac{1}{8}\right)\×1=1$

Wherein: α is characteristic value d ₁weight,

D ₁the 1st node X ₁neighbor node n ₁and the path between object node destination, path is 2;

D ₂the 1st node X ₁neighbor node n ₂and the path between object node destination, path is 1;

B ₁the 1st node X ₁neighbor node n ₁localized network betweenness, localized network betweenness is 0,

$b_1=\underset{d,n_i\∈\mathrm{routing}\_\mathrm{table}}{\mathrm{\Σ}}\frac{{\mathrm{\σ}}_d\left(n_i\right)}{{\mathrm{\σ}}_d}=\frac{0}{1}=0$

Wherein: σ _dthe 1st node X ₁routing table routing_table in the number of route entry, as shown in table 1, the number of route entry is 1;

σ _d(n _i) be the 1st node X ₁routing table routing_table in down hop classify neighbor node n as ₁the number of route entry, as shown in table 1, the number of route entry is 0.

B ₂the 1st node X ₁neighbor node n ₂localized network betweenness, localized network betweenness is 1,

$b_2=\underset{d,n_i\∈\mathrm{routing}\_\mathrm{table}}{\mathrm{\Σ}}\frac{{\mathrm{\σ}}_d\left(n_i\right)}{{\mathrm{\σ}}_d}=\frac{1}{1}=1$

Wherein: σ _dthe 1st node X ₁routing table routing_table in the number of route entry, as shown in table 1, the number of route entry is 1;

σ _d(n _i) be the 1st node X ₁routing table routing_table in down hop classify neighbor node n as ₂the number of route entry, as shown in table 1, the number 1 of route entry.

Step 4, at the 1st node X ₁neighbor node n ₁with neighbor node n ₂in, packet P2 is transmitted to energy cost cost ₁and cost ₂minimum neighbor node n ₁, then from packet P2, extract object node destination, then upgrade by the following method the 1st node X ₁routing table routing_table:

Because routing table routing_table exists the route entry of object node destination, " down hop " row in described route entry are updated to energy cost cost ₁and cost ₂minimum neighbor node n ₁.

The 1st node X ₁routing table routing_table upgrade after route entry as shown in table 2:

Table 2 the 1st node X ₁routing table routing_table

Object	Down hop
		6	2

Step 5, receive down hop the 2nd nodes X of packet P2 ₂method to the Route establishment of object node destination is:

Step 5.1, the 2nd node X ₂there is no routing table routing_table, is the 2nd node X ₂construct a routing table routing_table, routing table routing_table is comprised of " object " row and " down hop " row, and routing table routing_table is empty.

The 2nd node X in step 5.2, WSN ₂while receiving packet P2, at the 2nd node X ₂neighbor node n ₁with neighbor node n ₂in search object node destination, the 2nd node X ₂neighbor node n ₁be the 3rd node X ₃, the 2nd node X ₂neighbor node n ₂be the 4th node X ₄; Do not find object node destination, packet P2 can not directly be delivered to described object node destination.

Step 5.3, do not find object node destination, except upper hop neighbor node, the 2nd node X ₁neighbor node n ₁with neighbor node n ₂energy cost cost ₁and cost ₂respectively:

${\cos t}_1={\mathrm{\αd}}_1+(1-\mathrm{\α})b_1=\frac{1}{8}\×1+\left(\text{1-}\frac{1}{8}\right)\×0=\frac{1}{8}$

${\cos t}_2={\mathrm{\αd}}_2+(1-\mathrm{\α})b_2=\frac{1}{8}\×1+\left(\text{1-}\frac{1}{8}\right)\×0=\frac{1}{8}$

Wherein: α is characteristic value d _iweight,

D ₁, be the 2nd node X ₂neighbor node n ₁and the path between object node destination, path is 1;

D ₂the 2nd node X ₂neighbor node n ₂and the path between object node destination, path is 1;

B ₁the 2nd node X ₂neighbor node n ₁localized network betweenness;

B ₂the 2nd node X ₂neighbor node n ₂localized network betweenness.

The 2nd node X ₂routing table routing_table be empty, for the 2nd node X ₂neighbor node n ₁with neighbor node n ₂localized network betweenness b ₁and b ₂be 0.

Step 5.4, due to energy cost cost ₁and cost ₂identical, from the 2nd node X ₂neighbor node n ₁with neighbor node n ₂in, packet P2 is transmitted to energy cost cost ₁and cost ₂identical neighbor node n ₁or neighbor node n ₂.

(1) packet P2 is forwarded to neighbor node n ₁

Packet P2 is transmitted to neighbor node n ₁, then from packet P2, extract object node destination, then upgrade by the following method the 2nd node X ₂routing table routing_table:

Owing to there not being the route entry of object node destination in routing table routing_table, in routing table routing_table, increase a route entry, " object " row of described route entry are object node destination, and " down hop " row are cost ₁and cost ₂minimum neighbor node n ₁.

The 2nd node X ₂routing table routing_table increase after route entry as shown in table 3:

Table 3 the 2nd node X ₂routing table routing_table

Object	Down hop
		6	3

(2) packet P2 is forwarded to neighbor node n ₂

Packet P2 is forwarded to neighbor node n ₂, then from packet P2, extract object node destination, then upgrade by the following method the 2nd node X ₂routing table routing_table:

Owing to there not being the route entry of object node destination in routing table routing_table, in routing table routing_table, increase a route entry, " object " row of described route entry are object node destination, and " down hop " row are neighbor node n ₂;

The 2nd node X ₂routing table routing_table increase after route entry as shown in table 4:

Table 4 the 2nd node X ₂routing table routing_table

Object	Down hop
		6	4

Step 5.5, due to energy cost cost ₁and cost ₂identical, from the 2nd node X ₂neighbor node n ₁with neighbor node n ₂in, packet P2 is transmitted to energy cost cost ₁and cost ₂identical neighbor node n ₁or neighbor node n ₂.

(1) packet P2 is forwarded to neighbor node n ₁

Receive down hop the 3rd nodes X of packet P2 ₃step 1～step 4 to the method for the Route establishment of object node destination with the present embodiment, until packet P2 arrives object node destination.

(2) packet P2 is forwarded to neighbor node n ₂

Receive down hop the 4th nodes X of packet P ₄step 1～step 4 to the method for the Route establishment of object node destination with the present embodiment, until packet P2 arrives object node destination.

In the present embodiment, the 1st node X ₁while sending packet P2 to object node destination, the route of packet P2 is 1 → 2 → 3 → 6 or 1 → 2 → 4 → 6.

Embodiment 3

A kind of method of the WSN balancing energy Route establishment based on localized network betweenness.The 1st node X of this WSN structure ₁send packet P3 to object node destination, the step of its Route establishment is:

Step 1, due to the 1st node X ₁number there is routing table routing_table, directly perform step 2.

The 1st node X in step 2, WSN ₁while receiving packet P3, at the 1st node X ₁neighbor node n ₁with neighbor node n ₂in search object node destination, the 1st node X ₁neighbor node n ₁be the 2nd node X ₂, the 1st node X ₁neighbor node n ₂be the 4th node X ₄; Do not find object node destination, packet P3 can not directly be delivered to described object node destination.

Step 3, do not find object node destination, except upper hop neighbor node, the 1st node X ₁neighbor node n ₁number and neighbor node n ₂energy cost cost ₁and cost ₂respectively:

${\cos t}_1={\mathrm{\αd}}_1+(1-\mathrm{\α})b_1=\frac{1}{8}\×2+\left(\text{1-}\frac{1}{8}\right)\×1=\frac{9}{8}$

${\cos t}_2={\mathrm{\αd}}_2+(1-\mathrm{\α})b_2=\frac{1}{8}\×1+\left(\text{1-}\frac{1}{8}\right)\×0=\frac{1}{8}$

Wherein: α is characteristic value d ₁weight,

D ₁the 1st node X ₁neighbor node n ₁and the path between object node destination, path is 2;

D ₂the 1st node X ₁neighbor node n ₂and the path between object node destination, path is 1;

B ₁the 1st node X ₁neighbor node n ₁localized network betweenness, localized network betweenness is 1,

$b_1=\underset{d,n_i\∈\mathrm{routing}\_\mathrm{table}}{\mathrm{\Σ}}\frac{{\mathrm{\σ}}_d\left(n_i\right)}{{\mathrm{\σ}}_d}=\frac{1}{1}=1$

Wherein: σ _dthe 1st node X ₁the number of routing table routing_table route entry, as shown in table 2, the number of route entry is 1;

σ _d(n _i) be the 1st node X ₁routing table routing_table in down hop be neighbor node n ₁the number of route entry, as shown in table 2, the number of route entry is 1.

B ₂the 1st node X ₁neighbor node n ₂localized network betweenness, localized network betweenness is 0,

$b_2=\underset{d,n_i\∈\mathrm{routing}\_\mathrm{table}}{\mathrm{\Σ}}\frac{{\mathrm{\σ}}_d\left(n_i\right)}{{\mathrm{\σ}}_d}=\frac{0}{1}=0$

Wherein: σ _dthe 1st node X ₁routing table routing_table in the number of route entry, as shown in table 2, route entry number is 1;

σ _d(n _i) be the 1st node X ₁routing table routing_table in down hop be neighbor node n ₂the number of route entry, as shown in table 2, route entry number is 0.

Step 4, at the 1st node X ₁neighbor node n ₁with neighbor node n ₂in, packet P3 is transmitted to energy cost cost ₁and cost ₂minimum neighbor node n ₂, then from packet P3, extract object node destination, then upgrade by the following method the 1st node X ₁routing table routing_table:

Because routing table routing_table exists the route entry of object node destination, " down hop " row in described route entry are updated to energy cost cost ₁and cost ₂minimum neighbor node n ₂;

The 1st node X ₁routing table routing_table upgrade after route entry as shown in table 5:

Table 5 the 1st node X ₁routing table routing_table

Object	Down hop
		6	4

Step 5, receive down hop the 4th nodes X of packet P3 ₄step 1～step 4 to the method for the Route establishment of object node destination with the present embodiment, until packet P3 arrives object node destination.

In the present embodiment, the 1st node X ₁while sending packet P3 to object node destination, the route of packet P3 is 1 → 4 → 6.

Embodiment 4

A kind of method of the WSN balancing energy Route establishment based on localized network betweenness.The 1st node X of this WSN structure ₁send packet P4 to object node destination, the step of its Route establishment is:

Step 1, due to the 1st node X ₁there is routing table routing_table, directly performed step 2.

The 1st node X in step 2, WSN ₁while receiving packet P4, at the 1st node X ₁neighbor node n ₁with neighbor node n ₂in search object node destination, the 1st node X ₁neighbor node n ₁be the 2nd node X ₂, the 1st node X ₁neighbor node n ₂be the 4th node X ₄; Do not find object node destination, packet P4 can not directly be delivered to described object node destination.

Step 3, do not find object node destination, except upper hop neighbor node, the 1st node X ₁neighbor node n ₁with neighbor node n ₂energy cost cost ₁and cost ₂respectively:

${\cos t}_1={\mathrm{\αd}}_1+(1-\mathrm{\α})b_1=\frac{1}{8}\×2+\left(\text{1-}\frac{1}{8}\right)\×0=\frac{2}{8}$

${\cos t}_2={\mathrm{\αd}}_2+(1-\mathrm{\α})b_2=\frac{1}{8}\×1+\left(\text{1-}\frac{1}{8}\right)\×1=1$

Wherein: α is characteristic value d ₁weight,

D ₁the 1st node X ₁neighbor node n ₁and the path between object node destination, path is 2;

D ₂the 1st node X ₁neighbor node n ₂and the path between object node destination, path is 1;

B ₁the 1st node X ₁neighbor node n ₁localized network betweenness, localized network betweenness is 0,

$b_1=\underset{d,n_i\∈\mathrm{routing}\_\mathrm{table}}{\mathrm{\Σ}}\frac{{\mathrm{\σ}}_d\left(n_i\right)}{{\mathrm{\σ}}_d}=\frac{0}{1}=0$

Wherein: σ _dthe 1st node X ₁routing table routing_table in the number of route entry, as shown in table 5, the number of route entry is 1;

σ _d(n _i) be the 1st node X ₁routing table routing_table in down hop classify neighbor node n as ₁the number of route entry, as shown in table 5, the number of route entry is 0.

B ₂the 1st node X ₁neighbor node n ₂localized network betweenness, localized network betweenness is 1,

$b_2=\underset{d,n_i\∈\mathrm{routing}\_\mathrm{table}}{\mathrm{\Σ}}\frac{{\mathrm{\σ}}_d\left(n_i\right)}{{\mathrm{\σ}}_d}=\frac{1}{1}=1$

Wherein: σ _dthe 1st node X ₁routing table routing_table in the number of route entry, as shown in table 5, the number of route entry is 1;

σ _d(n _i) be the 1st node X ₁routing table routing_table in down hop classify neighbor node n as ₂the number of route entry, as shown in table 5, the number 1 of route entry.

Step 4, at the 1st node X ₁neighbor node n ₁with neighbor node n ₂in, packet P4 is transmitted to energy cost cost ₁and cost ₂minimum neighbor node n ₁, then from packet P4, extract object node destination, then upgrade by the following method the 1st node X ₁routing table routing_table:

Because routing table routing_table exists the route entry of object node destination, " down hop " row in described route entry are updated to energy cost cost ₁and cost ₂minimum neighbor node n ₁.

The 1st node X ₁routing table routing_table upgrade after route entry as shown in table 6:

Table 6 the 1st node X ₁routing table routing_table

Object	Down hop
		6	2

Step 5, receive down hop the 2nd nodes X of packet P4 ₂method to the Route establishment of object node destination is:

Step 5.1, due to the 2nd node X ₂there is routing table routing_table, directly performed step 5.2.

The 2nd node X in step 5.2, WSN ₂while receiving packet P4, at the 2nd node X ₂neighbor node n ₁with neighbor node n ₂in search object node destination, the 2nd node X ₂neighbor node n ₁be the 3rd node X ₃, the 2nd node X ₂neighbor node n ₂be the 4th node X ₄; Do not find object node destination, packet P4 can not directly be delivered to described object node destination.

Step 5.3, do not find object node destination, except upper hop neighbor node, the 2nd node X ₂neighbor node n ₁with neighbor node n ₂energy cost cost ₁and cost ₂respectively:

(1) due to the 1st node X ₁while sending packet P2 to object node destination, the 2nd node X ₂routing table as shown in table 3, according to table 3, can obtain:

${\cos t}_1={\mathrm{\αd}}_1+(1-\mathrm{\α})b_1=\frac{1}{8}\×1+\left(\text{1-}\frac{1}{8}\right)\×1=1$

${\cos t}_2={\mathrm{\αd}}_2+(1-\mathrm{\α})b_2=\frac{1}{8}\×1+\left(\text{1-}\frac{1}{8}\right)\×0=\frac{1}{8}$

Wherein: α is characteristic value d ₁weight,

D ₁the 2nd node X ₂neighbor node n ₁and the path between object node destination, path is 1;

D ₂the 2nd node X ₂neighbor node n ₂and the path between object node destination, path is 1;

B ₁the 2nd node X ₂neighbor node n ₁localized network betweenness,

$b_1=\underset{d,n_i\∈\mathrm{routing}\_\mathrm{table}}{\mathrm{\Σ}}\frac{{\mathrm{\σ}}_d\left(n_i\right)}{{\mathrm{\σ}}_d}=\frac{1}{1}=1$

Wherein: σ _dthe 2nd node X ₂the number of routing table routing_table route entry, as shown in table 3, the number of route entry is 1;

σ _d(n _i) be the 2nd node X ₁routing table routing_table in down hop be neighbor node n ₁the number of route entry, as shown in table 3, the number of route entry is 1.

B ₂the 2nd node X ₂neighbor node n ₂localized network betweenness,

$b_2=\underset{d,n_i\∈\mathrm{routing}\_\mathrm{table}}{\mathrm{\Σ}}\frac{{\mathrm{\σ}}_d\left(n_i\right)}{{\mathrm{\σ}}_d}=\frac{0}{1}=0$

Wherein: σ _dthe 2nd node X ₂routing table routing_table in the number of route entry, as shown in table 3, the number of route entry is 1;

σ _d(n _i) be the 2nd node X ₂routing table routing_table in down hop be neighbor node n ₂the number of route entry, as shown in table 3, the number of route entry is 0.

(2) due to the 1st node X ₁while sending packet P2 to object node destination, the 2nd node X ₂routing table as shown in table 4, according to table 4, can obtain:

${\cos t}_1={\mathrm{\αd}}_1+(1-\mathrm{\α})b_1=\frac{1}{8}\×1+\left(\text{1-}\frac{1}{8}\right)\×0=\frac{1}{8}$

${\cos t}_2={\mathrm{\αd}}_2+(1-\mathrm{\α})b_2=\frac{1}{8}\×1+\left(\text{1-}\frac{1}{8}\right)\×1=1$

Wherein: α is characteristic value d ₁weight,

D ₁the 2nd node X ₂neighbor node n ₁and the path between object node destination, path is 1;

D ₂the 2nd node X ₂neighbor node n ₂and the path between object node destination, path is 1;

B ₁the 2nd node X ₂neighbor node n ₁localized network betweenness,

$b_1=\underset{d,n_i\∈\mathrm{routing}\_\mathrm{table}}{\mathrm{\Σ}}\frac{{\mathrm{\σ}}_d\left(n_i\right)}{{\mathrm{\σ}}_d}=\frac{0}{1}=0$

Wherein: σ _dthe 2nd node X ₂the number of routing table routing_table route entry, as shown in table 4, route entry number is 1;

σ _d(n _i) be the 2nd node X ₂routing table routing_table in down hop be neighbor node n ₁the number of route entry, as shown in table 4, route entry number is 0.

B ₂the 2nd node X ₂neighbor node n ₂localized network betweenness,

$b_2=\underset{d,n_i\∈\mathrm{routing}\_\mathrm{table}}{\mathrm{\Σ}}\frac{{\mathrm{\σ}}_d\left(n_i\right)}{{\mathrm{\σ}}_d}=\frac{1}{1}=1$

Wherein: σ _dthe 2nd node X ₂routing table routing_table in the number of route entry, as shown in table 4, route entry number is 1;

σ _d(n _i) be the 2nd node X ₂routing table routing_table in down hop be neighbor node n ₂the number of route entry, as shown in table 4, route entry number is 1.

Step 5.4, due to neighbor node n ₁with neighbor node n ₂energy cost cost ₁and cost ₂different

(1) neighbor node n ₁with neighbor node n ₂energy cost cost ₁and cost ₂be respectively 1 and 1/8

At the 2nd node X ₂neighbor node n ₁with neighbor node n ₂in, packet P4 is transmitted to energy cost cost ₁and cost ₂minimum neighbor node n ₂, then from packet P, extract object node destination, then upgrade by the following method the 2nd node X ₂routing table routing_table:

Owing to there not being the route entry of object node destination in routing table routing_table, in routing table routing_table, increase a route entry, " object " row of described route entry are object node destination, and " down hop " row are energy cost cost ₁and cost ₂minimum neighbor node n ₂;

The 2nd node X ₂routing table routing_table increase after route entry as shown in table 7:

Table 7 the 2nd node X ₂routing table routing_table

Object

Down hop

6

4

(2) neighbor node n ₁with neighbor node n ₂energy cost cost ₁and cost ₂be respectively 1/8 and 1

At the 2nd node X ₂neighbor node n ₁with neighbor node n ₂in, packet P4 is transmitted to energy cost cost ₁and cost ₂minimum neighbor node n ₁, then from packet P, extract object node destination, then upgrade by the following method the 2nd node X ₂routing table routing_table:

Owing to there not being the route entry of object node destination in routing table routing_table, in routing table routing_table, increase a route entry, " object " row of described route entry are object node destination, and " down hop " row are energy cost cost ₁and cost ₂minimum neighbor node n ₁.

The 2nd node X ₂routing table routing_table increase after route entry as shown in table 8:

Table 8 the 2nd node X ₂routing table routing_table

Object	Down hop
		6	3

Step 5.5, owing to receiving that the down hop of packet P4 is different

(1) down hop of receiving packet P4 is the 4th node X ₄

Receive down hop the 4th nodes X of packet P4 ₄method to the Route establishment of object node destination is the step 1～step 4 of same the present embodiment, until packet P4 arrives object node destination.

(2) down hop of receiving packet P4 is the 3rd nodes X ₃

Receive down hop the 3rd nodes X of packet P4 ₃method to the Route establishment of object node destination is the step 1～step 4 of same the present embodiment, until packet P4 arrives object node destination.

In the present embodiment, the 1st node X ₁while sending packet P4 to object node destination, the route of packet P4 is 1 → 2 → 4 → 6 or 1 → 2 → 3 → 6.

In sum, the 1st node X of this embodiment ₁the 1st time, the 2nd time, the 3rd time, the 4th ... send successively packet P1, P2, P3, P4 ... during to object node destination, press the method for WSN balancing energy Route establishment, its data traffic will be distributed in route 1 → 4 → 6,1 → 2 → 3 → 6 and 1 → 2 → 4 → 6 as shown in Figure 2.Due to the 1st node X ₁with the flow between object node destination is assigned on three paths, avoided using all the time path 1 → 4 → 6, thereby caused the 4th node X ₄energy exhaust too early.

This embodiment is by the variation of node localized network betweenness, in WSN from node X _ito setting up mulitpath between object node destination, carry out transfer of data, allow more node X _ishare network traffics, avoid some node in WSN owing to bearing too many network traffics, energy to be exhausted too early, cause WSN cut apart or WSN collapses fast.

This embodiment adopts two characteristic value " path d _i" and " localized network betweenness b _i", be respectively used to tolerance and " estimate to need the energy of consumption " and " dump energy of neighbor node ".Neighbor node n _ipath to object node destination is shorter, estimates from this neighbor node n _ithe network energy that forwarding data bag P need to consume is just less.Neighbor node n _ilocalized network betweenness less, this neighbor node n is described _ilast time does not participate in packet P and forwards, and dump energy is larger.Pass through set up energy cost cost _imathematical Modeling, can measure out exactly neighbor node n _ithe energy that forwarding data bag P consumes, therefore node X _ican select energy cost cost _iminimum neighbor node n _ias down hop.

Therefore, the present invention should avoid relying on simply shortest path to carry out packet P transmission and cause some node X _itoo early dead, finally cause cutting apart or the quick collapse of WSN of WSN, thereby extended the life cycle of WSN, improved the reliability of packet P transmission and realized energy consumption balance.

The content not being described in detail in present disclosure belongs to the known prior art of professional and technical personnel in the field.

Claims (1)

1. a method for the WSN balancing energy Route establishment based on localized network betweenness, is characterized in that in described WSN, there be N node X _i, i ∈ [1, N-1], node X _itransmission packet P to the method for the Route establishment of object node destination is:

If step 1 node X _ithere is no routing table routing_table, is node X _iconstruct a routing table routing_table, routing table routing_table is comprised of " object " row and " down hop " row, and routing table routing_table is empty;

A node X in step 2, WSN _iwhile receiving packet P, at described node X _iall neighbor node n _iin search object node destination, if find object node destination, packet P is directly delivered to described object node destination;

If step 3 does not find object node destination, except upper hop neighbor node, described node X _ieach neighbor node n _ienergy cost cost _imathematical Modeling be

cost _i＝αd _i+(1-α)b _i (1)

In formula (1): d _ifor characteristic value, represent node X _ineighbor node n _ipath respectively and between object node destination,

α is characteristic value d _iweight, α ∈ [0,1],

B _ifor another feature value, represent node X _ineighbor node n _ilocalized network betweenness,

$b_i=\underset{d,n_i\∈\mathrm{routing}\_\mathrm{table}}{\mathrm{\Σ}}\frac{{\mathrm{\σ}}_d\left(n_i\right)}{{\mathrm{\σ}}_d}---\left(2\right)$

In formula (2): σ _drepresent node X _irouting table routing_table in the number of route entry,

σ _d(n _i) expression node X _irouting table routing_table in down hop classify neighbor node n as _ithe number of route entry,

If described node X _irouting table routing_table be empty, for described node X _ineighbor node n _ilocalized network betweenness b _ibe 0;

Step 4, at described node X _ineighbor node n _iin, packet P is transmitted to energy cost cost _iminimum neighbor node n _min, then from packet P, extract object node destination, then upgrade by the following method described node X _irouting table routing_table:

If there is not the route entry of object node destination in routing table routing_table, in routing table routing_table, increase a route entry, " object " row of described route entry are object node destination, and " down hop " row are energy cost cost _iminimum neighbor node n _min;

If routing table routing_table exists the route entry of object node destination, " down hop " row in described route entry are updated to energy cost cost _iminimum neighbor node n _min;

Step 5, receive the energy cost cost of packet P _iminimum neighbor node n _minto the method for the Route establishment of object node destination with step 1～step 4, until packet P arrives object node destination;

Step 6, node X _icontinue to send follow-up data bag P to the method for the Route establishment of object node destination with step 1～step 5.