CN102573000B - Wireless self-organizing network protection routing generation algorithm based on direct/indirect matrixes - Google Patents

Abstract

The invention relates to the technical field of wireless networks, in particular to a wireless self-organizing network protection routing generation algorithm based on direct/indirect matrixes, which comprises first performing expansion based on an ad hoc on-demand distance vector (AODV) protocol, and obtaining a routing path set; generating the direct/indirect adjacent matrixes based on the routing path set; and finally performing protection routing judgment and outputting a final result. By means of the algorithm, the shortest protection routing can be found out while all the protection routings can be found out. Therefore, the wireless self-organizing network protection routing generation algorithm based on the direct/indirect matrixes can effectively improve the reliability of wireless routing transmission, enables a wireless self-organizing network using the algorithm to have the capacity of keeping normal routing transmission under the condition that a single node loses efficacy, greatly improves transmission reliability of the a wireless self-organizing network, and is easy to achieve and low in complexity.

Description

Based on directly/wireless self-organization network protection route generating method of matrix indirectly

Technical field

The present invention relates to radio network technique field, the route being applicable under wireless self-organization network applied environment generates and protection, is specifically related to a kind of based on directly/wireless self-organization network protection route generating method of matrix indirectly.

Background technology

2010 paper " On the Feasibility and Efficacy of Protection Routing in IP Networks " concept of route protection (protection routing) has been proposed first; in the time of IP network single point failure, guarantee that whole routing forwarding can also keep normal; but the route protection algorithm of its proposition cannot be applied to wireless network environment, and therefore route protection function cannot be applied to wireless network environment.The present invention is directed to the feature of wireless network; on the basis of the AODV Routing Protocol based on traditional; build the protection Routing Protocol that is applicable to wireless environment; obtaining on routed path basis generate directly/connection matrix indirectly; and based on directly/indirectly connection matrix novelty proposition wireless protection Design of Routing Algorithm, effectively guaranteed the extensive use of protection route in wireless network.

Wireless self-networking as required plan range vector Routing Protocol (Ad hoc On-Demand Distance Vector Routing, AODV) is to be applied to the Routing Protocol that carries out Route Selection in wireless Ad hoc network.Specifically, it is a kind of reaction equation Routing Protocol, and need to send data to destination node time, source node is just initiated route querying process in network, finds corresponding route.And much other Routing Protocol is all priori formula, that is to say they search route is whether the node not relying on path will give out a contract for a project, but routing table that comprises the routing iinformation that arrives other node of each node maintenance, between node, constantly update the routing table of self by periodic exchanging routing information, to can reflect timely network topology structure and variation, consistent to safeguard, timely, routing iinformation accurately.Be different from the Routing Protocol of priori formula, AODV Routing Protocol is a kind of plan range vector Routing Protocol.

In AODV, when a network node need to connect, just to broadcast one and connect the request of setting up, other AODV node forwards this request message, and the interim route that records source node and get back to source node.In the time that the node of reception connection request is known the route that arrives destination node, just this routing iinformation is beamed back to source node according to the interim route of getting back to source node of precedence record.Source node is just brought into use this via other nodes and is had the route of short jumping figure.In the time there is node failure in link, routing error just by loopback to source node, so source node is just initiated the process of route querying again.

Occurring, after individual node inefficacy, can again to initiate route requests by source node, again look for a new routed path.Because AODV Routing Protocol cannot keep proper communication when the inefficacy of single routing node again, therefore for effective guarantee, in the time that individual node loses efficacy, wireless self-organization network can also proper communication, and we have introduced protection routing function.Given first related notion; the protected definition of node: node s is in the path of node d at destination node; if the next node of node s breaks down; at this moment can also find the second next-hop node k(secondary next-hop; be called for short SNH) arrive destination node d, claim that so this node s is protected for node d.Obtain protecting the definition of route from protected node general introduction: all nodes of a route are all protected, and this route is protected route exactly so.

Route protection original application scene is the IP network with Centroid, be in network, to have a Centroid can obtain the topology situation of whole network, thereby the route of being correlated with is calculated, and in wireless network, do not have Centroid perception overall situation topology, therefore cannot apply its algorithm and protect the generation of route; Also there is efficiency of algorithm problem in former algorithm simultaneously, generates the protection route for the whole network based on current algorithm, and algorithm expense is too large, is also not suitable for wireless environment.

Summary of the invention

In order to overcome above-mentioned the deficiencies in the prior art; the object of the present invention is to provide a kind of based on directly/wireless self-organization network protection route generating method of matrix indirectly; protection routing function is applied to wireless self-organization network applied environment; thereby effectively improve the reliability of wireless routing transmission; make to adopt the wireless self-organization network of this algorithm to there is the ability that keeps normal data transfer under individual node failure conditions; greatly improved the transmission reliability of wireless self-organization network, and algorithm is easy to realize, algorithm complex is low.

To achieve these goals, the technical solution used in the present invention is:

In directly/wireless self-organization network protection Generating Routing of matrix indirectly, comprise the following steps:

Step 1, the Routing Protocol based on AODV expansion obtains routed path R:

In original AODV, add the field of the sequence table that is defined as the route requests grouping node that passes through, if when route requests forwards through Node B, Node B just writes this sequence table by the IP address of oneself, in the time that route requests starts to send, acquiescence, through the sequence table of node for empty, adds forward node B in sequence when hop count adds for the moment simultaneously; Whether the each route requests grouping that arbitrary intermediate node receives it, first check and oneself in described sequence table, if existed, this route requests grouping abandoned, and if there is no, forwards this route requests grouping; Destination node is received a large amount of route requests groupings of sending from source node, the nodes records that has comprised its process in each route requests grouping, formed corresponding routed path R, destination node saves all routed path R, has just formed routed path collection S;

Step 2, generate directly/adjacency matrix A[i indirectly of destination node, j]:

All paths in traversal routed path collection S, to every routed path R, all carry out following steps:

For routed path R, from its corresponding sequence table, take out successively node ${\mathrm{node}}_y[{\mathrm{node}}_{{\mathrm{node}}_{\mathrm{number}}-1},{\mathrm{node}}_{n{\mathrm{ode}}_{\mathrm{number}}-2}...{\mathrm{node}}_1];$

If current A[node _y, node _y+1] record show node node _ywith node node _y+1directly do not connect, illustrate and connect <node _y, node _y+1> is a new route, upgrades A[node _y, node _y+1] value, A[node _y, node _y+1] value representation node node _ywith node node _y+1between direct connection and indirect connection, require its value to upgrade according to definition, and arrange and upgrade mark; Otherwise record has been carried out in this path, do not need to upgrade;

Node in routed path _z∈ [node ₁, node _y-1], node node _zto node node _y+1not directly, but exist indirect connection, i.e. node node _zto node _y+1can arrive by other node, for all indirect connection <node _z, node _y+1>, first judges A[node _z, node _z+1] whether there is direct connection, if do not had, node node is described _zto node node _y+1be indirectly connected to new connection, keep upgrading being masked as true, otherwise upgrade be masked as no; If it is no that renewal is masked as, just not to later indirect connection: A[node _z, node _y+1] upgrade, traversal generates all with node node _y+1after indirect connection for terminal, the processing of routed path R is finished;

Repeatedly carry out the cycling to routed path collection S, until circulation finishes, just generated directly/adjacency matrix A[i indirectly j];

Step 3, based on adjacency matrix A[i, j], the protection route of calculating destination node:

For a given routed path R, in the time judging that whether it is protected, first structure node collection $s^{\&prime;}=\{{\mathrm{node}}_1,{\mathrm{node}}_2,......{\mathrm{node}}_{{\mathrm{node}}_{\mathrm{number}}-1},\};$

From set of node S', take out successively node ${\mathrm{node}}_y[{\mathrm{node}}_{{\mathrm{node}}_{\mathrm{number}}-1},{\mathrm{node}}_{n{\mathrm{ode}}_{\mathrm{number}}-2}...{\mathrm{node}}_1];$

If node node _yprotected, otherwise decision node node _yto node node _y+1whether protected: if A[node _y, node _y+1] <2, node node _yto node node _y+1originally without any edge fit between, node node _ybe not protected, this routed path is not protection route; Work as node _ywhen protected, it is removed from set of node S', remove in set of node S' simultaneously and have to node _y+1there is the node node of two indirect connection routes _zif set of node S' is empty, routed path R is protection route;

Repeatedly carry out cycling, until circulation finishes;

If all nodes all meet a node thereafter and have the connection of one or more in set of node S', illustrate that all nodes are all protected, the route finding according to this algorithm is protection route.

In described step 1, how many routing packets that destination node is received is take jumping figure as sequencing arrival, and jumping figure is fewer, more first arrive, and the nodes records that has comprised its process in each routing packets, carries out data abstraction to it, the routed path table definition of receiving is R _k[k ∈ 1..route _count], wherein R _kto have with undefined data structure:

By function | R _k|=node _numberobtain nodes in this routed path;

By function $\mathrm{set}\left(R_k\right)=S_{R_k}=\{{\mathrm{node}}_1,{\mathrm{node}}_2......{\mathrm{node}}_{{\mathrm{node}}_{\mathrm{number}}}\}$ Obtain all sets of node of this routed path.

Described direct/indirect adjacency matrix A[i, j] be the n rank square formation with following character:

When from i to j without any connection, A[i, j]=0;

When there are one or more than one direct connections from i to j, and without any indirect connection, A[i, j]=1;

When there being and only having one indirectly to connect from i to j, and without any direct connection, A[i, j]=2;

When there are one or more than one direct connections from i to j, and have and only have one indirectly to connect, A[i, j]=3;

When having one or more indirect connection from i to j, A[i, j]=4;

When there are one or more than one direct connections from i to j, and have the indirect connection of one or more, A[i, j]=5;

Wherein, i and j represent respectively the node in routed path.

Compared with existing routing algorithm, technical method of the present invention (referring to Fig. 1), first can pass through the expansion to AODV agreement, realizes the topology perception between source node and destination node, obtains as far as possible and has routed path therebetween; Secondly pass through to build based on routed path direct/indirect adjacency matrix, directly/indirect adjacency matrix is the underlying platform that whole algorithm is implemented, and direct/indirect connection between the node of its reflection, for the generation of protection route provides strong support; The method of finally searching by greed; from routed path storehouse, take out successively the shortest routed path; determine whether according to directly/indirect adjacency matrix inverted order on its path, whether each node is protected node, thereby distinguish whether this routed path is protection route.Adopt this algorithm not only can find out the shortest protection route, can also find out all protection routes simultaneously.

Accompanying drawing explanation

Fig. 1 is the basic flow sheet that the protection route under wireless network environment generates according to the present invention.

Fig. 2 is the workflow diagram of expanding AODV in the present invention.

Fig. 3 is direct/indirect connection matrix product process figure that the present invention is based on path.

Fig. 4 is the present invention is based on directly/connection matrix protection route computational algorithm indirectly.

Embodiment

Below in conjunction with drawings and Examples, the present invention is described in further details.

As shown in Figure 1, the present invention is a kind of based on directly/wireless self-organization network protection route generating method of matrix indirectly, comprises the following steps:

1. expand based on AODV, the Routing Protocol based on AODV expansion obtains routed path R and routed path collection S.

In original AODV, in the time that source node need to send data and not arrive the effective routing of destination node, will start a route finding process: broadcast a route requests grouping (RREQ); Intermediate node forwards this request message, and the interim route that records source node and get back to source node; In the time that the intermediate node of the request of receiving or destination node have that one enough new route arrives destination node, intermediate node or destination node return to a route replies grouping (RREP) in the mode of clean culture to source node, and source node starts to send data to corresponding destination node after receiving this route replies grouping (RREP).

Route requests grouping field is as shown in the table:

In order to protect the application requirements of route; AODV is expanded; AODV agreement is modified for the processing of route requests grouping; the route requests grouping of follow-up arrival is forwarded; it is modified to add the field of Pass Node, its Field Definition be the route requests grouping sequence table through node simultaneously.In the time that node forwards through a node, just the IP address of oneself is write to this sequence table.When destination node receives after route requests grouping, just know which node it has passed through and arrived like this.Give tacit consent to this for empty, current intermediate node is added in sequence for the moment when hop count adds simultaneously.

Route requests forwarding of packets rule is modified simultaneously:

When intermediate node receives after route requests grouping, originally only forward the route requests grouping that first is received.Now be revised as and forwarded all route requests groupings that receive, but check that oneself is whether in the sequence of Pass Node, if Already in, illustrate that this node had forwarded this route requests grouping, send back again now this node, illustrate in path and have ring, therefore this route requests grouping is abandoned.

As shown in Figure 2, its course of work of AODV wireless routing agreement after expansion is as follows:

(1) route topological initialization.In the time that source node s sends routing inquiry to destination node d, destination node d can receive the grouping from source node s to destination node d route requests in a large number, and destination node d generates routed path table R _k[k ∈ 1..route _count], receiving after first route requests grouping, return to a route replies grouping, source node s starts to send data after receiving this route replies grouping.

(2) receiving after enough routed paths, protecting route to generate by destination node d and calculate.Calculate the protection route from node s to node d by node d according to routed path table.

(3) route handoff.According to protection route, forward node and node s in the middle of routing update order is sent to, above-mentioned node not only will upgrade its down hop route, and the second down hop route (secondary next-hop) also will be set.Intermediate node upgrades successively it and forwards route, and in the time having packets need to forward, by packet, by new routing forwarding, until source node s also switches to the route of destination node d, now route is just switched to protection route from shortest path.It should be noted that: if there is no protect route, so just do not carry out the operation of route handoff.Now source node s transmits with shortest path route to destination node d.

Also: if when route requests forwards through Node B, Node B just writes this sequence table by the IP address of oneself, in the time that route requests starts to send, acquiescence, through the sequence table of node for empty, adds forward node B in sequence when hop count adds for the moment simultaneously; Whether the each route requests grouping that arbitrary intermediate node receives it, first check and oneself in described sequence table, if existed, this route requests grouping abandoned, and if there is no, forwards this route requests grouping; Destination node is received a large amount of route requests groupings of sending from source node, the nodes records that has comprised its process in each route requests grouping, formed corresponding routed path R, destination node saves all routed path R, has just formed routed path collection S;

AODV after this expansion causes a large amount of propagation of route requests grouping, if effectively do not suppress mechanism, may cause so the broadcast storm of route requests.Relevant mechanism can be set and forward jumping figure in route requests grouping, thereby effectively controls the scope of broadcast.

Due to AODV agreement is expanded, therefore destination node can be received a large amount of route requests groupings of sending from source node, if do not consider the impact of Forwarding Delay or other factors, the routing packets that destination node is received take jumping figure how much as sequencing arrives, jumping figure is fewer, more first arrives, and the nodes records that has comprised its process in each routing packets, it is carried out to data abstraction, and the routed path table definition of receiving is R _k[k ∈ 1..route _count], wherein R _kto have with undefined data structure:

By function | R _k|=node _numberobtain nodes in this routed path;

By function $\mathrm{set}\left(R_k\right)=S_{R_k}=\{{\mathrm{node}}_1,{\mathrm{node}}_2......{\mathrm{node}}_{{\mathrm{node}}_{\mathrm{number}}}\}$ Obtain all sets of node of this routed path.

2. generate directly/adjacency matrix A[i indirectly of destination node, j]:

Direct/indirect adjacency matrix A[i of direct/indirect adjacency matrix definition of figure: figure, j] be the n rank square formation with following character:

A[i, j] generative process is as follows:

All paths in traversal routed path collection S, to every routed path R, all carry out following steps:

For routed path R, from its corresponding sequence table, take out successively node ${\mathrm{node}}_y[{\mathrm{node}}_{{\mathrm{node}}_{\mathrm{number}}-1},{\mathrm{node}}_{n{\mathrm{ode}}_{\mathrm{number}}-2}...{\mathrm{node}}_1];$

If current A[node _y, node _y+1] record show node node _ywith node node _y+1directly do not connect, illustrate and connect <node _y, node _y+1> is a new route, upgrades A[node _y, node _y+1] value, A[node _y, node _y+1] value representation node node _ywith node node _y+1between direct connection and indirect connection, require its value to upgrade according to definition, and arrange and upgrade mark; Otherwise record has been carried out in this path, do not need to upgrade;

Node in routed path _z∈ [node ₁, node _y-1], node node _zto node node _y+1not directly, but exist indirect connection, i.e. node node _zto node _y+1can arrive by other node, for all indirect connection <node _z, node _y+1>, first judges A[node _z, node _z+1] whether there is direct connection, if do not had, node node is described _zto node node _y+1be indirectly connected to new connection, keep upgrading being masked as true, otherwise upgrade be masked as no; If it is no that renewal is masked as, just not to later indirect connection: A[node _z, node _y+1] upgrade, traversal generates all with node node _y+1after indirect connection for terminal, the processing of routed path R is finished;

Repeatedly carry out the cycling to routed path collection S, until circulation finishes, just generated directly/adjacency matrix A[i indirectly j];

As shown in Figure 3, by known routed path set R _k[k ∈ 1..route _count] generate directly/connection matrix A[i indirectly j] and specific algorithm as follows:

Initialization: directly/connection matrix A[i indirectly, j]=0

For R _x[x ∈ 1..route _count] do//from being short to most the longest every route of order traversal

{

switch _newpath=0

For node _y[y ∈ node _number-1,1] do//from tail to the end inverted order travel through all nodes this route

{

caseA[node _y,node _y+1]of:

0:A[node _y, node _y+1]=1; //node _yto node _y+1originally do not connect, had a limit [node _y, node _y+1], identify it and there is direct connection; Switch _newpath=1 mark has new connection.

2:A[node _y, node _y+1]=3, switch _newpath=1 mark has new connection

4:A[node _y, node _y+1]=5, switch _newpath=1 mark has new connection

For node _z[z ∈ y-1,1] do//add indirect neighbor's node

{

If switch _newpath=0then break; // because path is not new route, therefore unnecessary renewal connects indirectly

caseA[node _z,node _y+1]of:

0:A[node _z, node _y+1]=2; //node _zto node _y+1originally without any connection, have one between edge fit [node _z, node _y+1].

1:A[node _z, node _y+1]=3; //node _zto node _y+1there is direct connection, have again edge fit [node between _z, node _y+1], identify it and there is indirect connection.

2:A[node _z,node _y+1]=4

3:A[node _z,node _y+1]=5

If A[node _z, node _z+1] ≠ 0and A[node _z, node _z+1] ≠ 2andA[node _z, node _z+1] ≠ 4then switch _newpath=0//node is described _zto node _z+1not new route, so just new connection identifier is set to vacation.

}

}

}

3. based on adjacency matrix A[i, j], calculate the protection route of destination node, and export final result

For a given routed path R, in the time judging that whether it is protected, first structure node collection $s^{\&prime;}=\{{\mathrm{node}}_1,{\mathrm{node}}_2,......{\mathrm{node}}_{{\mathrm{node}}_{\mathrm{number}}-1},\};$

From set of node S', take out successively node ${\mathrm{node}}_y[{\mathrm{node}}_{{\mathrm{node}}_{\mathrm{number}}-1},{\mathrm{node}}_{n{\mathrm{ode}}_{\mathrm{number}}-2}...{\mathrm{node}}_1];$

If

node node _yprotected, otherwise decision node node _yto node node _y+1whether protected: if A[node _y, node _y+1] <2, node node _yto node node _y+1originally without any edge fit between, node node _ybe not protected, this routed path is not protection route; Work as node _ywhen protected, it is removed from set of node S', remove in set of node S' simultaneously and have to node _y+1there is the node node of two indirect connection routes _zif set of node S' is empty, routed path R is protection route;

Repeatedly carry out cycling, until circulation finishes;

If all nodes all meet a node thereafter and have the connection of one or more in set of node S', illustrate that all nodes are all protected, the route finding according to this algorithm is protection route.

As shown in Figure 4, according to directly/connection matrix A[i indirectly, j] obtain from source node node _sto destination node node _dthe specific algorithm of protection route as follows:

For R _x[x ∈ 1..route _count] do//from being short to most the longest every route of order traversal

{

R` _x=R _x

For? ${\mathrm{node}}_y[y\&Element;{\mathrm{node}}_1,{\mathrm{node}}_2...{\mathrm{node}}_{{\mathrm{node}}_{\mathrm{number}}-1}]$ Do//from tail to the end inverted order traversal be kept at all nodes route sequence

{

If node _y∈ R` _xand A[node _y, node _y+1] <2then break; // node node _yto node _y+1protection, does not therefore protect route not exist in this route.

By node _yfrom R` _xset

in sequence, remove.

For?node _z[z∈1,y-1]do//

{

If?A[node _z,node _y]>3then

{

From R` _xnode in set _zfrom

in sequence, remove.

}

}

then?break

}

}

then?return(R _x)

There is not protection route in Else

Algorithm complexity is analyzed:

Whole algorithm is divided into two parts: the first stage is directly/connection matrix A[i indirectly, j] generate; Second stage is searching of protection route.For the first stage, the complexity of whole algorithm is route _count' node ² _number; For second stage, its algorithm complex is also route _count' node ² _number.Therefore, the complexity of whole algorithm is only relevant with route maximum node number to the number of routes of receiving.

Defined from algorithm, algorithm of the present invention has following character:

The protection route that character 1 this algorithm finds is the protection route with shortest length.

Prove: suppose to exist R` ≠ R(R is the protection route of utilizing this algorithm to find), and the route length of R` is less than R, and R` is for protecting route.Because the route length of R` is less than R, that R` is at sequence R so <sub>k</sub>[k ∈ 1..route <sub>count</sub>] in one be positioned before R; and because R is the protection route of utilizing this algorithm to find; illustrate that so it is not protected that R` necessarily exists some nodes; but because R` is again protection route; it does not exist does not have protected node; therefore have contradiction, therefore R` does not exist, the protection route that does not exist its Length Ratio of route with protection routing characteristic to utilize this algorithm to find is shorter.

It is protection route that character 2 is utilized the route that this algorithm finds.

Prove for R, its node forms a set (

for destination node, do not exist protected),

For a given route R, in the time judging that whether it is protected, first structural knot collection $S=\{{\mathrm{node}}_1,{\mathrm{node}}_2,......{\mathrm{node}}_{{\mathrm{node}}_{\mathrm{number}}-1},\}$

From set, take out successively node successively ${\mathrm{node}}_y[{\mathrm{node}}_{{\mathrm{node}}_{\mathrm{number}}-1},{\mathrm{node}}_{n{\mathrm{ode}}_{\mathrm{number}}-2}...{\mathrm{node}}_1];$

If

that illustrates node _yknown is protected, otherwise judges node _yto node _y+1whether protected: A[node _y, node _y+1] <2 illustrates node _yto node _y+1originally without any edge fit, therefore node between one _ybe not protected, so also protected route certainly not of this route; Work as node _ywhen protected, it is removed from S set, remove in S set and have to node simultaneously _y+1there is the node n ode of two indirect connection routes _z.

Judge that whether S set is as empty, empty this route of explanation is protection route if.

Repeatedly carry out cycling, until circulation finishes.(illustrate and do not have protection route)

In above arthmetic statement process, find set

in all nodes all at least meet a node thereafter and have one or more connection (directly or indirectly), therefore illustrate that all nodes are all protected, this meets the definition of protecting route, the route therefore finding according to this algorithm is protection route.

The protection route that character 1 and character 2 these algorithms of explanation find is the protection route of short transmission length.

Claims (3)

1. based on directly/wireless self-organization network protection route generating method of matrix indirectly, it is characterized in that: comprise the following steps:

Step 1, the Routing Protocol based on AODV expansion obtains routed path R:

In original AODV, add the field of the sequence table that is defined as the route requests grouping node that passes through, if when route requests forwards through Node B, Node B just writes this sequence table by the IP address of oneself, in the time that route requests starts to send, acquiescence, through the sequence table of node for empty, adds forward node B in sequence when hop count adds for the moment simultaneously; Whether the each route requests grouping that arbitrary intermediate node receives it, first check and oneself in described sequence table, if existed, this route requests grouping abandoned, and if there is no, forwards this route requests grouping; Destination node is received a large amount of route requests groupings of sending from source node, the nodes records that has comprised its process in each route requests grouping, formed corresponding routed path R, destination node saves all routed path R, has just formed routed path collection S;

Step 2, generate directly/adjacency matrix A[i indirectly of destination node, j]:

All paths in traversal routed path collection S, to every routed path R, all carry out following steps:

For routed path R, from its corresponding sequence table, take out successively node ${\mathrm{node}}_y[{\mathrm{node}}_{{\mathrm{node}}_{\mathrm{number}}-1},{\mathrm{node}}_{n{\mathrm{ode}}_{\mathrm{number}}-2}...{\mathrm{node}}_1];$

If current A[node _y, node _y+1] record show node node _ywith node node _y+1directly do not connect, illustrate and connect <node _y, node _y+1> is a new route, upgrades A[node _y, node _y+1] value, A[node _y, node _y+1] value representation node node _ywith node node _y+1between direct connection and indirect connection, require its value to upgrade according to definition, and arrange and upgrade mark; Otherwise record has been carried out in this path, do not need to upgrade;

Node in routed path _z∈ [node ₁, node _y-1], node node _zto node node _y+1not directly, but exist indirect connection, i.e. node node _zto node _y+1can arrive by other node, for all indirect connection <node _z, node _y+1>, first judges A[node _z, node _z+1] whether there is direct connection, if do not had, node node is described _zto node node _y+1be indirectly connected to new connection, keep upgrading being masked as true, otherwise upgrade be masked as no; If it is no that renewal is masked as, just not to later indirect connection: A[node _z, node _y+1] upgrade, traversal generates all with node node _y+1after indirect connection for terminal, the processing of routed path R is finished;

Repeatedly carry out the cycling to routed path collection S, until circulation finishes, just generated directly/adjacency matrix A[i indirectly j];

Step 3, based on adjacency matrix A[i, j], the protection route of calculating destination node:

For a given routed path R, in the time judging that whether it is protected, first structure node collection $s^{\&prime;}=\{{\mathrm{node}}_1,{\mathrm{node}}_2,......{\mathrm{node}}_{{\mathrm{node}}_{\mathrm{number}}-1},\};$

From set of node S', take out successively node ${\mathrm{node}}_y[{\mathrm{node}}_{{\mathrm{node}}_{\mathrm{number}}-1},{\mathrm{node}}_{n{\mathrm{ode}}_{\mathrm{number}}-2}...{\mathrm{node}}_1];$

If

, node node _yprotected, otherwise decision node node _yto node node _y+1whether protected: if A[node _y, node _y+1] <2, node node _yto node node _y+1originally without any edge fit between, node node _ybe not protected, this routed path is not protection route; Work as node _ywhen protected, it is removed from set of node S', remove in set of node S' simultaneously and have to node _y+1there is the node node of two indirect connection routes _zif set of node S' is empty, routed path R is protection route;

Repeatedly carry out cycling, until circulation finishes;

If all nodes all meet a node thereafter and have the connection of one or more in set of node S', illustrate that all nodes are all protected, the route finding according to this algorithm is protection route.

2. according to claim 1 based on directly/wireless self-organization network protection route generating method of matrix indirectly; it is characterized in that: in described step 1; the routing packets that destination node is received take jumping figure how much as sequencing arrives; jumping figure is fewer; more first arrive; and the nodes records that has comprised its process in each routing packets, carries out data abstraction to it, the routed path table definition of receiving is R _k[k ∈ 1..route _count], wherein R _kto have with undefined data structure:

By function | R _k|=node _numberobtain nodes in this routed path;

By function ${\mathrm{node}}_y[{\mathrm{node}}_{{\mathrm{node}}_{\mathrm{number}}-1},{\mathrm{node}}_{n{\mathrm{ode}}_{\mathrm{number}}-2}...{\mathrm{node}}_1];$ Obtain all sets of node of this routed path.

3. according to claim 1 based on directly/wireless self-organization network protection route generating method of matrix indirectly, it is characterized in that: described direct/indirect adjacency matrix A[i, j] be the n rank square formation with following character:

When from i to j without any connection, A[i, j]=0;

When there are one or more than one direct connections from i to j, and without any indirect connection, A[i, j]=1;

When there being and only having one indirectly to connect from i to j, and without any direct connection, A[i, j]=2;

When there are one or more than one direct connections from i to j, and have and only have one indirectly to connect, A[i, j]=3;

When having one or more indirect connection from i to j, A[i, j]=4;

When there are one or more than one direct connections from i to j, and have the indirect connection of one or more, A[i, j]=5;

Wherein, i and j represent respectively the node in routed path.

Images