CN103209453B - Trust routing algorithm of wireless sensor network based on topological structure - Google Patents

Abstract

The invention discloses a trust routing algorithm of a wireless sensor network based on a topological structure. The method includes that (1) a topological value is initialized so as to enable a node to locate its topological position in the network and informs a neighbor node; (2) a node trust value is calculated, an attacking node of the network is detected, and whether the attacking node meets a trust value updating condition is judged, on yes judgment, the trust value is updated and a step (3) is entered, on no judgment, the step (3) is entered directly; (3) node selecting probability is calculated: the topological value is combined with the trust value to obtain the probability CRS of all neighbor nodes to be selected as next hop routing node; and (4) fuzzy selection is conducted, whether the next hop routing node is selected is judged, on yes judgment, information is sent or forwarded, on no judgment, whether the nodes to be selected are empty is judged, on yes judgment, the step (1) is returned, and on no judgment, node information forwarding failure is informed.

Description

Based on the trust routing algorithm of the radio sensing network of topological structure

Technical field

The present invention relates to a kind of trust routing algorithm, be specifically related to a kind of trust routing algorithm of the radio sensing network based on topological structure.

Background technology

Radio sensing network forms by being deployed in cheap microsensor nodes a large amount of in monitored area, a multihop self-organizing network system is formed by communication, its objective is the information of perceived object in perception collaboratively, acquisition and processing network's coverage area, and send to observer.Along with the extensive use of radio sensing network, especially in military affairs with business, network is needed to have enough security credibility.

The factors such as foundation-free facility, wireless link cause radio sensing network to have the system vulnerability such as eavesdropping, personation, are vulnerable to various attack, as node capture attack, selective forwarding attack, Sybil attack, Sinkhole attack, wormhole attack.Credible and secure route becomes an important research direction of radio sensing network.Because sensor node calculates, to store and the restriction of energy consumption resource makes common routing safety mechanism well can not be applied to radio sensing network.

Existing radio sensing network Routing Protocol is roughly divided into following a few class: Energy-aware routing protocol, based on the Routing Protocol of inquiry and geographic routing agreement etc.These agreements mainly discuss the routing mechanism of sensing network from energy consumption and implementation aspect, in order to ensure the reliability of transfer of data, being reached, cause the part of network energy to waste, and can not effectively resist various attack by the mode increasing redundancy.More existing security routing are propose for general self-organizing Ad hoc network mostly, and it is still little for the research of radio sensing network Security routing aspect, the representational agreement of most is SPINS [Perrig A.SPINS:security protocols for sensor networks.Wireless Networks, 2002,8 (8): 521-534.], this agreement is intended to solve the secure communication problem of the wireless sensor network with limited resources, and it introduces SNEP and μ TESLA2 safety member.SNEP agreement adopts 2 synchronous counters at communicating pair, and is applied to during encryption and message authentication code (MAC, message authentication code) calculate, thus acquisition data confidentiality, data authentication and integrity function.μ TESLA agreement realizes certification broadcast by application symmetric key algorithm, it is at TESTLA [Hu Y, Perrig A, Johnson D.Ariadne:a secure on demand routing protocol for Ad hocnetworks.Proceedings of ACM MOBICOM.Atlanta:[s.n.], 2002:12-23.] protocol basis carries out expansion and applicability transformation, the wireless sensor network that resource is height-limited can be met.SPINS agreement also utilizes the point-to-point key agreement of SNEP and μ TESLA protocol realization Routing Authentication scheme and safety respectively.

The security routing of radio sensing network is mostly the transformation based on Ad hoc security routing in summary, and traditional trust management is suitably simplified.And traditional trust management is as public key encryption, authentication etc., because need complicated software, hardware, mass storage, high processing rate and communication bandwidth to be not suitable for radio sensing network.Therefore, the novel trust management system being applied to radio sensing network is suggested, the trust management that it only needs a small amount of node resource just can realize radio sensing network, resists various attack.

Summary of the invention

The object of the invention is the deficiency for overcoming above-mentioned existing traditional trust management technology, proposing a kind of trust routing algorithm of novel trust management system of the radio sensing network based on topological structure.It considers that node security is on the impact of Route Selection, and whether the confidence level according to node meets constraints to form active path, ensures the safety of RFDC better.

For achieving the above object, the present invention adopts following technical proposals:

Based on a trust routing algorithm for the radio sensing network of topological structure, concrete steps are as follows:

The initialization of step 1) topology value, to make node locating oneself topology location in a network, and informs neighbor node;

Step 2) node trust value computing, the attack node of Sampling network, and judge whether to reach belief updating condition, if enter step 3) after if so, then upgrading trust value, if no, then directly enter step 3);

Step 3) sensor selection problem probability calculation: topology value and trust value are combined and obtains the proportionality coefficient CRS that each neighbor node is chosen as down hop routing node;

Step 4) Fuzzy Selection, and judge whether to select down hop routing node, if if so, then transmission or forwarding messages, to next-hop node, if no, then judge whether node to be selected is empty; If if so, then return step 1), if no, then notify upper hop sending node information retransmission failure.

Described step 1) is divided into two parts:

A) network start-up phase node initializing: it is initiated primarily of base station, carries out the distinguishing hierarchy of network, and node initializing self topology value also records neighbor information; Its flow process is: by base station broadcast initialization information, cell site topology value level=0, and neighbor node is initialization after receiving broadcast message;

B) running interior joint upgrades: in network operation process, when node finds its upper strata neighbor node and this layer of neighbor node is all in non-operating state, node will upgrade the topology value of self again, wherein, what topology value was little is upper strata, equal is this layer, and large is lower floor, and described non-operating state is node dormancy or death; Its flow process is: self is reset to no initializtion state by node, and to neighbours' broadcast request neighbor information, self information is sent to requesting node by neighbours after receiving the request; Node reinitializes after receiving neighbor information.

Described initialized concrete grammar is:

Step 1-1) receive neighbours' topology value information, its topology value is i, determines whether that first time receives, if if so, then enter step 1-2), if no, then judge whether self topology value j is greater than i+1; If if so, then enter step 1-2), if no, then enter step 1-3);

Step 1-2) self topology value is for i+1, broadcast topology value information, to neighbor node, enters step 1-3);

Step 1-3) record neighbor information.

Described step 2) interior joint trust value comprises direct trust, indirectly trusts and comprehensively trust three parts:

Described direct trust be evaluation node A according to be evaluated the direct interaction of Node B and the trust evaluation value made, be designated as T _{direct (A → B)}; The acquisition of direct trust value is mainly according to the history trust value T of node _olddirectwith current trust value T _newdirectformula (1) and (2) are utilized to calculate:

T _{direct(A→B)}＝w _old×T _olddirect+w _new×T _newdirect(1)

$T_{\mathrm{newdirect}(A\→B)}=\frac{S_{A\→B}}{C_{A\→B}}---\left(2\right)$

W _oldand w _newrefer to the proportion that history trust value and current trust value are shared in the calculation, and w _old+ w _new=1; S _{a → B}refer to the number of times of Node B normal process from node A message, C _{a → B}refer to that node A sends message to the total degree of Node B;

Described indirect trust be evaluation node A according to be evaluated Node B and self all have the trust evaluation information of third party's node C of direct interaction and the evaluation of estimate made, be designated as T _{recommend (A → B)}; Indirect trust values utilizes formula (3) to calculate:

$T_{\mathrm{recommend}(A\→B)}=\frac{1}{m}\×\underset{j=1}{\overset{m}{\mathrm{\Σ}}}(T_{\mathrm{driect}(A\→C_j)}\×T_{\mathrm{direct}(C_j\→B)})---\left(3\right)$

Wherein m is the number of third party's node, C _jrepresent jth tripartite's node;

Described comprehensive trust is node A according to the direct trust of Node B and the assessment of totally trusting of indirectly trusting and carrying out, and is designated as T _{integrate (A → B)}; Formula (4) is utilized to calculate:

T _{integrate (A → B)}=w _direct× T _{direct (A → B)}+ w _recommend× T _{recommend (A → B)}(4) w _directand w _recommendrefer to and directly trust and indirectly trust proportion shared in the calculation, w _direct+ w _recommend=1; Work as T in the calculation _{direct (A → B)}value, for time empty, remembers w _recommend=1, in like manner, work as T _{recommend (A → B)}during for sky, note w _direct=1.

Described step 3) interior joint A selection neighbor node B is the proportionality coefficient CRS of next-hop node, and formula is as follows:

$\mathrm{CRS}(A\→B)=\frac{1}{C^{A.\mathrm{TL}-B.\mathrm{TL}}}\×T_{\mathrm{integrate}(A\→B)}---\left(5\right)$

Wherein, C is constant and C<1, and concrete value defines according to application scenarios, and A.TL is the topology value of node A, and B.TL is the topology value of Node B.

In described step 4), Fuzzy Selection, selects down hop routing node, and concrete steps are:

Step 4-1) core of Fuzzy Selection is that fuzzy interval divides, its general principle is:

Interval [0,1] is divided into n interval [0, A ₁+ F/2], [A ₁-F/2, A ₂+ F/2] ..., [A _i-F/2, A _i+1+ F/2] ..., [A _n-1-F/2,1], A _ifor constant, equal i=1,2 ..., (n-1), F is fuzzy interval width, is less than interval overlapping portion is fuzzy interval, and interval non-superimposed part is between absolute field, [A _i-F/2, A _i+1+ F/2] interval of to be grade be i;

Step 4-2) fuzzy interval divide after, be chosen as the proportionality coefficient CRS value of next-hop node according to both candidate nodes, both candidate nodes put into fuzzy interval, then carries out Fuzzy Selection:

First [0,1] between selection area is divided into n interval, both candidate nodes is put into relevant position, fuzzy interval by CRS value size; Then according to the Fuzzy Selection grade γ that system pre-sets, start to choose from interval [1, ∞], if choose next-hop node, return results, otherwise again from [A _n-1-F/2, ∞] choose ..., until interval [A _n-k-F/2, ∞] till, subscript k meets relational expression wherein, n is the interval number that interval [0,1] is divided equally, and γ is the Fuzzy Selection grade that system pre-sets; The node selected is down hop routing node.

Described step 4-2) in, proportionality coefficient CRS and interval [A _i-F/2, A _i+1+ F/2] attaching relation represent with formula (6), n is the interval number that interval [0,1] is divided equally.

$P=\left\{\begin{array}{cc}1,& \mathrm{CRS}\&Element;[A_i,A_{i+1}]\&cup;(\mathrm{CRS}\&GreaterEqual;1)\\ f\left(\mathrm{CRS}\right),& \mathrm{CRS}\&Element;[A_i-F/2,A_i]\&cup;[A_{i+1},A_{i+1}+F/2]\end{array}\right.$ Wherein, i=1,2 ..., n-2 (6)

P is that CRS belongs to interval [A _i-F/2, A _i+1+ F/2] probability, f (CRS) is ownership function, and according to the definition of embody rule scene, and 0≤f (CRS)≤1, f (CRS) are

$f\left(\mathrm{CRS}\right)=\left\{\begin{array}{cc}\cos (\frac{\mathrm{\&pi;}}{F}\&times;(A_i-\mathrm{CRS})),& \mathrm{CRS}\&Element;[A_i-F/2,A_i]\\ \cos (\frac{\mathrm{\&pi;}}{F}\&times;(\mathrm{CRS}-A_{i+1})),& \mathrm{CRS}\&Element;[A_{i+1},A_{i+1}+F/2]\end{array}\right.$ Wherein, i=1,2 ..., n-2 (7)

N is the interval number that interval [0,1] is divided equally.

Beneficial effect of the present invention:

1. the computational methods of the node trust value described in the present invention are based on a kind of novel trust management system, need special software and hardware support relative to traditional trust management system and take the factors such as great deal of nodes resource, this algorithm is without the need to special software and hardware support and without the need to taking ample resources.

2. the present invention specifically comprises the initialization of topology value, node trust value computing, sensor selection problem probability calculation and Fuzzy Selection four steps.Make node locating oneself topology location in a network by the initialization of topology value, and inform neighbor node, for Fuzzy Selection below provides location parameter.Detected the attack node of network by node trust value computing, strengthen the anti-attack ability of network.

3. before carrying out Fuzzy Selection, first according to the topology value of node and the selection percentage coefficient of trust value computing node.The lower node of node topology value from base station more close to, select the low node of topology value as down hop, can reduce hop count, under identical trust value condition, jumping figure is fewer, and link is more stable; For trust value, select the higher node of trust value as down hop, then link is more stable.

4., when selecting down hop route according to trust value size, the principle of application fuzzy mathematics carries out Fuzzy Selection to down hop routing node, effectively prevent and occurs that node energy consumes unbalanced situation when selecting high trusted node.

5 in a word, and the present invention can make information be transferred to destination node with higher accuracy and less time delay from source node, and can make network attack and reacting fast, and it takies less node resource simultaneously.

Accompanying drawing explanation

Fig. 1 is overall flow figure of the present invention;

Fig. 2 is the initialized flow chart of topology value;

Fig. 3 is [A _i-F/2, A _j+ F/2] fuzzy interval schematic diagram.

Embodiment

Below in conjunction with drawings and Examples, the present invention will be further elaborated, should be noted that following explanation is only to explain the present invention, not limiting its content.

As shown in Figure 1, the invention provides a kind of trust routing algorithm of the radio sensing network based on topological structure, concrete steps are as follows:

The initialization of step 1) topology value, to make node locating oneself topology location in a network, and informs neighbor node;

Step 2) node trust value computing, the attack node of Sampling network, and judge whether to reach belief updating condition, if enter step 3) after if so, then upgrading trust value, if no, then directly enter step 3);

Step 3) sensor selection problem probability calculation: topology value and trust value are combined and obtains the proportionality coefficient CRS that each neighbor node is chosen as down hop routing node;

Step 4) Fuzzy Selection, and judge whether to select down hop routing node, if if so, then transmission or forwarding messages, to next-hop node, if no, then judge whether node to be selected is empty; If if so, then return step 1), if no, then notify upper hop sending node information retransmission failure.

Described step 1) is divided into two parts:

A) network start-up phase node initializing: it is initiated primarily of base station, carries out the distinguishing hierarchy of network, and node initializing self topology value also records neighbor information; Its flow process is: by base station broadcast initialization information, cell site topology value level=0, and neighbor node is initialization after receiving broadcast message;

B) running interior joint upgrades: in network operation process, when node finds its upper strata neighbor node and this layer of neighbor node is all in non-operating state, node will upgrade the topology value of self again, wherein, what topology value was little is upper strata, equal is this layer, and large is lower floor, and non-operating state is node dormancy or death; Its flow process is: self is reset to no initializtion state by node, and to neighbours' broadcast request neighbor information, self information is sent to requesting node by neighbours after receiving the request; Node reinitializes after receiving neighbor information.

Wherein, initialized concrete grammar (Fig. 2) is:

Step 1-1) receive neighbours' topology value information, its topology value is i, determines whether that first time receives, if if so, then enter step 1-2), if no, then judge whether self topology value j is greater than i+1; If if so, then enter step 1-2), if no, then enter step 1-3);

Step 1-2) self topology value is for i+1, broadcast topology value information, to neighbor node, enters step 1-3);

Step 1-3) record neighbor information.

Described step 2) interior joint trust value comprises direct trust, indirectly trusts and comprehensively trust three parts:

Direct trust be evaluation node A according to be evaluated the direct interaction of Node B and the trust evaluation value made, be designated as T _{direct (A → B)}; The acquisition of direct trust value is mainly according to the history trust value T of node _olddirectwith current trust value T _newdirectformula (1) and (2) are utilized to calculate:

T _{direct(A→B)}＝w _old×T _olddirect+w _new×T _newdirect(1)

$T_{\mathrm{newdirect}(A\&RightArrow;B)}=\frac{S_{A\&RightArrow;B}}{C_{A\&RightArrow;B}}---\left(2\right)$

W _oldand w _newrefer to the proportion that history trust value and current trust value are shared in the calculation, and w _old+ w _new=1; S _{a → B}refer to the number of times of Node B normal process from node A message, C _{a → B}refer to that node A sends message to the total degree of Node B;

Indirect trust be evaluation node A according to be evaluated Node B and self all have the trust evaluation information of third party's node C of direct interaction and the evaluation of estimate made, be designated as T _{recommend (A → B)}; Indirect trust values utilizes formula (3) to calculate:

$T_{\mathrm{recommend}(A\&RightArrow;B)}=\frac{1}{m}\&times;\underset{j=1}{\overset{m}{\mathrm{\&Sigma;}}}(T_{\mathrm{driect}(A\&RightArrow;C_j)}\&times;T_{\mathrm{direct}(C_j\&RightArrow;B)})---\left(3\right)$

Wherein m is the number of third party's node, C _jrepresent jth tripartite's node;

Comprehensive trust is node A according to the direct trust of Node B and the assessment of totally trusting of indirectly trusting and carrying out, and is designated as T _{integrate (A → B)}; Formula (4) is utilized to calculate:

T _{integrate (A → B)}=w _direct× T _{direct (A → B)}+ w _recommend× T _{recommend (A → B)}(4) w _directand w _recommendrefer to and directly trust and indirectly trust proportion shared in the calculation, w _direct+ w _recommend=1; Work as T in the calculation _{direct (A → B)}value, for time empty, remembers w _recommend=1, together should T _{recommend (A → B)}during for sky, note w _direct=1.

Described step 3) interior joint A selection neighbor node B is the proportionality coefficient CRS of next-hop node, and formula is as follows:

$\mathrm{CRS}(A\&RightArrow;B)=\frac{1}{C^{A.\mathrm{TL}-B.\mathrm{TL}}}\&times;T_{\mathrm{integrate}(A\&RightArrow;B)}---\left(5\right)$

Wherein, C is constant and C<1, and occurrence artificially defines according to scene, and A.TL is the topology value of node A, and B.TL is the topology value of Node B.Known according to formula (5), when being evaluated node trust value and being equal, the less then select probability value of topology value is larger; When topology value is identical, trust value larger then select probability value is larger.

In described step 4), Fuzzy Selection, selects down hop routing node, and concrete steps are:

Step 4-1) core of Fuzzy Selection is that fuzzy interval divides, its general principle is:

Interval [0,1] is divided into n interval [0, A ₁+ F/2], [A ₁-F/2, A ₂+ F/2] ..., [A _i-F/2, A _i+1+ F/2] ..., [A _n-1-F/2,1], A _ifor constant, equal i=1,2 ..., (n-1), namely i is for being more than or equal to the natural number that 1 is less than or equal to (n-1), and F is fuzzy interval width, is less than interval overlapping portion is fuzzy interval, and interval non-superimposed part is between absolute field, [A _i-F/2, A _i+1+ F/2] interval of to be grade be i;

Step 4-2) fuzzy interval divide after, be chosen as the proportionality coefficient CRS value of next-hop node according to both candidate nodes, both candidate nodes put into fuzzy interval, then carries out Fuzzy Selection:

First [0,1] between selection area is divided into n interval, both candidate nodes is put into relevant position, fuzzy interval by CRS value size, and the code 1-6 namely in table 1 is capable; Then according to the Fuzzy Selection grade γ that system pre-sets, start to choose from interval [1, ∞], if choose next-hop node, return results, otherwise again from [A _n-1-F/2, ∞] choose ..., until interval [A _n-k-F/2, ∞] till, subscript k meets relational expression wherein, n is the interval number that interval [0,1] is divided equally, and γ is the Fuzzy Selection grade that system pre-sets; The node selected is down hop routing node.

Described step 4-2) in, Fig. 3 is [A _i-F/2, A _j+ F/2] fuzzy interval divide schematic diagram, wherein, abscissa is fuzzy interval, and ordinate is probability, j=i+1, i=1,2 ..., n-2, n be interval [0, the 1] interval number of dividing equally; In figure, [A _i, A _j] between absolute field, [A _i-F/2, A _i] and [A _j, A _j+ F/2] be fuzzy interval, proportionality coefficient CRS and interval [A _i-F/2, A _i+1+ F/2] attaching relation represent with formula (6), n is the interval number that interval [0,1] is divided equally.

$P=\left\{\begin{array}{cc}1,& \mathrm{CRS}\&Element;[A_i,A_{i+1}]\&cup;(\mathrm{CRS}\&GreaterEqual;1)\\ f\left(\mathrm{CRS}\right),& \mathrm{CRS}\&Element;[A_i-F/2,A_i]\&cup;[A_{i+1},A_{i+1}+F/2]\end{array}\right.$ Wherein, i=1,2 ..., n-2 (6)

P is that CRS belongs to interval [A _i-F/2, A _i+1+ F/2] probability, f (CRS) is ownership function, and according to the definition of embody rule scene, and 0≤f (CRS)≤1, f (CRS) is herein

$f\left(\mathrm{CRS}\right)=\left\{\begin{array}{cc}\cos (\frac{\mathrm{\&pi;}}{F}\&times;(A_i-\mathrm{CRS})),& \mathrm{CRS}\&Element;[A_i-F/2,A_i]\\ \cos (\frac{\mathrm{\&pi;}}{F}\&times;(\mathrm{CRS}-A_{i+1})),& \mathrm{CRS}\&Element;[A_{i+1},A_{i+1}+F/2]\end{array}\right.$ Wherein, i=1,2 ..., n-2 (7)

N is the interval number that interval [0,1] is divided equally.

The false code of the detailed process of Fuzzy Selection algorithm is as shown in table 1.In table, A is all node set that topology value is less than local node.K is step 4-2) in definition.

Table 1. Fuzzy Selection algorithm false code

By reference to the accompanying drawings the specific embodiment of the present invention is described although above-mentioned; but not limiting the scope of the invention; on the basis of technical scheme of the present invention, those skilled in the art do not need to pay various amendment or distortion that creative work can make still within protection scope of the present invention.

Claims (6)

1., based on a trust routing algorithm for the radio sensing network of topological structure, it is characterized in that, concrete steps are as follows:

Step 1) initialization of topology value, to make node locating oneself topology location in a network, and inform neighbor node;

Step 2) node trust value computing, the attack node of Sampling network, and judge whether to reach belief updating condition, if enter step 3 after if so, then upgrading trust value), if no, then directly enter step 3);

Step 3) sensor selection problem probability calculation: topology value and trust value are combined and obtains the proportionality coefficient CRS that each neighbor node is chosen as down hop routing node;

Step 4) Fuzzy Selection, and judge whether to select down hop routing node, if if so, then send or forward the message to next-hop node, if no, then judge whether node to be selected is empty; If if so, then return step 1), if no, then notify sending node information retransmission failure;

Described step 2) interior joint trust value comprises direct trust, indirectly trusts and comprehensively trust three parts:

Described direct trust be evaluation node A according to be evaluated the direct interaction of Node B and the trust evaluation value made, be designated as T _{direct (A → B)}; The acquisition of direct trust value is mainly according to the history trust value T of node _olddirectwith current trust value T _newdirectformula (1) and (2) are utilized to calculate:

T _{direct(A→B)}＝w _old×T _olddirect+w _new×T _newdirect(1)

$T_{\mathrm{newdirect}(A\&RightArrow;B)}=\frac{S_{A\&RightArrow;B}}{C_{A\&RightArrow;B}}---\left(2\right)$

W _oldand w _newrefer to the proportion that history trust value and current trust value are shared in the calculation, and w _old+ w _new=1; S _{a → B}refer to the number of times of Node B normal process from node A message, C _{a → B}refer to that node A sends message to the total degree of Node B;

Described indirect trust be evaluation node A according to be evaluated Node B and self all have the trust evaluation information of third party's node C of direct interaction and the evaluation of estimate made, be designated as T _{recommend (A → B)}; Indirect trust values utilizes formula (3) to calculate:

$T_{\mathrm{recommend}(A\&RightArrow;B)}=\frac{1}{m}\&times;\underset{j=1}{\overset{m}{\mathrm{\&Sigma;}}}{T}_{\mathrm{driect}(A\&RightArrow;C_j)}\&times;T_{\mathrm{direct}(C_i\&RightArrow;B)}---\left(3\right)$

Wherein m is the number of third party's node, C _jrepresent jth tripartite's node;

Described comprehensive trust is node A according to the direct trust of Node B and the assessment of totally trusting of indirectly trusting and carrying out, and is designated as T _{integrate (A → B)}; Formula (4) is utilized to calculate:

T _{integrate(A→B)}＝w _direct×T _{direct(A→B)}+w _recommend×T _{recommend(A→B)}(4)

W _directand w _recommendrefer to and directly trust and indirectly trust proportion shared in the calculation, w _direct+ w _recommend=1; Work as T in the calculation _{direc (tA → B)}value, for time empty, remembers w _recommend=1, together should T _{recomme (nAd → B)}during for sky, note w _direct=1.

2. trust routing algorithm according to claim 1, is characterized in that, described step 1) be divided into two parts:

A) network start-up phase node initializing: it is initiated primarily of base station, carries out the distinguishing hierarchy of network, and node initializing self topology value also records neighbor information; Its flow process is: by base station broadcast initialization information, cell site topology value level=0, and neighbor node is initialization after receiving broadcast message;

B) running interior joint upgrades: in network operation process, when node finds its upper strata neighbor node and this layer of neighbor node is all in non-operating state, node will upgrade the topology value of self again, wherein, what topology value was little is upper strata, equal is this layer, and large is lower floor, and described non-operating state is node dormancy or death; Its flow process is: self is reset to no initializtion state by node, and to neighbours' broadcast request neighbor information, self information is sent to requesting node by neighbours after receiving the request; Node reinitializes after receiving neighbor information.

3. trust routing algorithm according to claim 2, is characterized in that, described initialized concrete grammar is:

Step 1-1) receive neighbours' topology value information, its topology value is i, determines whether that first time receives, if if so, then enter step 1-2), if no, then judge whether self topology value j is greater than i+1; If if so, then enter step 1-2), if no, then enter step 1-3);

Step 1-2) self topology value is for i+1, broadcast topology value information, to neighbor node, enters step 1-3);

Step 1-3) record neighbor information.

4. trust routing algorithm according to claim 1, is characterized in that, described step 3) interior joint A selects neighbor node B to be the proportionality coefficient CRS of next-hop node, and formula is as follows:

$\mathrm{CRS}(A\&RightArrow;B)=\frac{1}{C^{A.\mathrm{TL}-B.\mathrm{TL}}}\&times;T_{\mathrm{integrate}(A\&RightArrow;B)}---\left(5\right)$

Wherein, C is constant and C<1, and concrete value defines according to application scenarios, and A.TL is the topology value of node A, and B.TL is the topology value of Node B.

5. trust routing algorithm according to claim 4, is characterized in that, described step 4) in, Fuzzy Selection, selects down hop routing node, and concrete steps are:

Step 4-1) core of Fuzzy Selection is that fuzzy interval divides, its general principle is:

Interval [0,1] is divided into n interval [0, A ₁+ F/2], [A ₁-F/2, A ₂+ F/2] ..., [A _i-F/2, A _i+1+ F/2] ..., [A _n-1-F/2,1], A _ifor constant, equal i=1,2 ..., (n-1), F is fuzzy interval width, is less than interval overlapping portion is fuzzy interval, and interval non-superimposed part is between absolute field, [A _i-F/2, A _i+1+ F/2] interval of to be grade be i;

Step 4-2) fuzzy interval divide after, be chosen as the proportionality coefficient CRS value of next-hop node according to both candidate nodes, both candidate nodes put into fuzzy interval, then carries out Fuzzy Selection:

First [0,1] between selection area is divided into n interval, both candidate nodes is put into relevant position, fuzzy interval by CRS value size; Then according to the Fuzzy Selection grade γ of Operation system setting, start to choose from interval [1, ∞], if choose next-hop node, return results, otherwise again from [A _n-1-F/2, ∞] choose ..., until interval [A _n-k-F/2, ∞] till, subscript k meets relational expression wherein, n is the interval number that interval [0,1] is divided equally, and γ is the Fuzzy Selection grade that system pre-sets; The node selected is down hop routing node.

6. trust routing algorithm according to claim 5, is characterized in that, described step 4-2) in, proportionality coefficient CRS and interval [A _i-F/2, A _i+1+ F/2] attaching relation represent with formula (6), n is the interval number that interval [0,1] is divided equally; $p=\left\{\begin{array}{cc}1,& \mathrm{CRS}\&Element;[A_i,A_{i+1}]\&cup;(\mathrm{CRS}\&GreaterEqual;1)\\ f\left(\mathrm{CRS}\right),& \mathrm{CRS}\&Element;[A_i-F/2,A_i]\&cup;[A_{i+1},A_{i+1}+F/2]\end{array}\right.$ Wherein, i=1,2 ..., n-2 (6)

P is that CRS belongs to interval [A _i-F/2, A _i+1+ F/2] probability, f (CRS) is ownership function, and according to the definition of embody rule scene, and 0≤f (CRS)≤1, f (CRS) are

$f\left(\mathrm{CRS}\right)=\left\{\begin{array}{cc}\cos (\frac{\mathrm{\&pi;}}{F}\&times;(A_i-\mathrm{CRS})),& \mathrm{CRS}\&Element;[A_i-F/2,A_i]\\ \cos (\frac{\mathrm{\&pi;}}{F}\&times;(\mathrm{CRS}-A_{i+1})),& \mathrm{CRS}\&Element;[A_{i+1},A_{i+1}+F/2]\end{array}\right.$ Wherein, i=1,2 ..., n-2 (7)

N is the interval number that interval [0,1] is divided equally.