CN101207537A - Method for searching stabilizing path in wireless self-organizing network - Google Patents

Abstract

The invention discloses a method which can search for a stable path in a wireless ad hoc network. The prior wireless ad hoc network cannot search out the path with the best stability carry out the communication. In order to solve the above problem, the method of the invention, which can search for the stable path in the wireless ad hoc network, comprises the following steps: firstly, a source node constructs routing discovery information, which is sent out to neighbor nodes through local multicast, and the quantity of the neighbor nodes is more than one but not totally; secondly, the neighbor nodes transmit the routing discovery information to the neighbor nodes thereof with the quantity being more than one but not totally until reaching the destination node of the routing discovery information; thirdly, the destination node of the routing discovery information selects the path which has the best stability from the paths which transmit the routing discovery information and then sends out routing confirming information to the source node, and a communication connection is established between the source node and the destination node. The invention is applicable to the wireless ad hoc network.

Description

Seek the method for stabilizing path in the wireless self-organization network

Technical field

The present invention relates to the route technology field of wireless network, relate in particular to the method that makes up a kind of stable adaptive self-organizing network.

Background technology

Wireless network can be divided into two big classes on structure is formed: the wireless network of fixed infrastructure and the wireless network of no fixed infrastructure are arranged.(Elizabeth?M.Royer，Chai-Keong?Toh，”A?Review?of?Current?Routing?Protocols?forAd?Hoc?Mobile?Wireless?Network”，IEEE?Personal?Communications，Vol.6，No.2，pp.46-55，April?1999.)。

Be provided with in the first kind network fixing, by the interconnective network node of wired mode, these nodes have constituted the basic architecture of network, as Cellular Networks, wireless lan (wlan).In the Cellular Networks, infrastructure network is made up of the base station, is the center with the base station, and the zone in the base station radius constitutes one " sub-district ", and fixing equally distributed base station is realized the covering of network to the somewhere jointly.The base station of user's mobile device and sub-district of living in directly connects, and all data all are transmitted to the user by the base station, generally interconnects by wired mode between the base station, and the base station is furnished with special-purpose switching equipment and finishes exchange, forwarding to user data.In the WLAN (wireless local area network), (Access Point AP) has constituted the foundation structure of network to access point.Portable terminal in the transceiver coverage of each AP can insert the internet by AP, and all user data are all transmitted by AP.In this type of wireless network, " access point " (base station, the AP etc.) in portable terminal and its communication range connect, and the business datum of being transmitted is all by " access point " processing forward.In the time of when terminal shifts out and enter another communication range that " connects people's point " in the communication range of " access point " in, between new and old " access point ", switch, make their can be in whole network continuous seamless communications that carries out.But the terminal that is positioned at outside system's " access point " coverage then can't be got in touch with system's foundation, can't directly set up communication link between the terminal.Whole topology of networks is fixed, and is determined by the distribution of basic network equipment.

There are not " access point " or switching equipment in the second class wireless network, but, be called as " wireless self-organization network " (wireless self-organized network) or Ad hoc net or multihop network (multi-hop network) or do not have fixed infrastructure network (infrastructureless network) by one group of spontaneous a kind of distributed communication network that forms of user terminal.

The technique functions of self-organizing network (adhoc network) come from 1973 advanced studies Planning Department of U.S. Department of Defense (DARPA) subsidized a special research---multi-hop grouping wireless electric network (PRNET, Packet radio network).(J.Jubinand?J.D.Tornow“The?DARPA?packet?radio?network?protocol”，Proc.Of?the?IEEEE，vol?75，No.1，Jan?1987，pp.21-32)。Then, DARPA subsidizes in nineteen eighty-three again that carried out can remaining adaptive network (Survivable Adaptive Network, SURAN) research of project, carried out Globle Mobile Information Systems (Global Mobile Information Systems in subsidy in 1994, GloMo) research of project is so that can set up some particular surroundings or cordless communication network in emergency circumstances.Ad hoc net is exactly a networking thought of having drawn projects such as PRNET, SURAN and GloMo, and a kind of new-type network technology that produces.

IEEE renames as Ad hoc network with PRNET when exploitation IEEE 802.11 standards.IETF had set up MANET (MobileAd hoc network, mobile Ad hoc network) working group in 1997, was responsible for the research and development of the routing algorithm of the mobile Ad hoc network with hundreds of nodes specially, carried out corresponding standard work.MANET working group has formulated 3 RFC and tens Internet drafts.

In wireless self-organization network, two adjacent end can directly be set up the communication link of " end-to-end ", need not by base station device forwards such as (perhaps AP); Simultaneously, in self-organizing network, special equipments such as no switch, router, each terminal all has the function of route switching, can set up, be maintained into the route of other-end and be its adjacent end forwarding business datum.And then when non-adjacent terminal need be communicated by letter, but the effective route of terminal News Search itself, packet is transmitted by other-end, is passed to the final purpose terminal in the mode of " multi-hop ".In communication service end to end, setting up route is the precondition of finishing transmission, and the search efficiency of route, path quality, overhead have then determined the overall transfer performance of system.The flexibility of wireless self-organization network makes the routing algorithm that its terminal adopted become one of principal element that influences network performance, and then routing algorithm is designed to the research difficult point and the focus in this field.At present, the routing algorithm of the self-organizing network that has proposed is based on the mechanism of route search in traditional wired internet network or the wireless cellular network, foundation, maintenance mostly, with shortest path by communicating transmission as the best route of first-selection.The mobility of communication terminal has caused network topology structure constantly to change in the wireless self-organization network, thereby in wireless self-organization network, shortest path is by being best route.Therefore the method for routing of seeking stable path in wireless self-organization network has great importance, and also is an also problem of fine solution not.

IBM Corporation has proposed a kind of method of life that maximizes whole ad hoc network in patent application (patent No. is WO2004059928) " MAXIMUM LIFETIME ROUTINGIN WIRELESS AD-HOC NETWORKS ".It is to be model with flow problem (flowproblem), adopted the ε optimization method, but flow problem is based on the continuous variable model, is not suitable for the real network model.This patent mainly is to consider to make the lifetime of whole wireless ad hoc net from the angle of energy.

The life-span of the wireless ad hoc net of patent definition is the time of the depleted of energy of first node in network.This patent mainly is that this time is maximized.But when in the very high wireless ad hoc network of network node density, when some nodes withdrawed from this ad hoc net owing to depleted of energy, ad hoc net still can be good at operation.Therefore only consider to optimize the method for life of this wireless ad hoc net, do not have to solve well because the frequent caused problem of network topology of wireless ad hoc net.

The patent of Tsing-Hua University and Toshiba's co-applications (application number is CN03158155) " method of the self-organizing network terminal of building network stability self-adaptive " has proposed a kind of routing algorithm that makes up stable ad hoc network.This invention is a kind of stability of weighing node with the historical successful data packets transmitted quantity of node, with node etc. data buffer area occupancy to be sent weigh the load of node, thereby to take all factors into consideration path delay characteristic, routing stability and path load route selection method as wireless self-organization network route standard.

But the historical successful data packets transmitted quantity of node is not the good tolerance of radio self-organized network nodes stability.Because the node of wireless self-organization network is constantly to move, its network topology is dynamic change, and therefore only how the historical successful data packets transmitted quantity of node just thinks that this node is that more stable node is not necessarily rational.The many node of historical successful data packets transmitted quantity may since the position to move at next be not a stable node constantly.And this invention also is not a method for routing of considering QoS.

Document Paul, K.; Bandyopadhyay, S.; Mukherjee, A.; Saha, D., A stability-based distributedrouting mechanism to support unicast and multicast routing in ad hoc wireless network, ComputerCommunications Volume:24, Issue:18, December 1,2001, and pp.1828-1845 has proposed a kind of distributed routing mechanism based on stability of wireless self-organization network.The document has defined the stability that node substantial connection (node-affinity) and link substantial connection (link-affinity) are weighed node and link.

But this link substantial connection tolerance mainly is to predict by node transmitting range, internodal distance and node speed.And because the randomness of movement direction of nodes in the mobile Ad hoc network, the path that the tolerance of the link substantial connection that proposes by this article under a lot of situations is sought may not necessarily stable routed path.

Summary of the invention

At defective and the deficiency that prior art exists, the invention provides the method for seeking stabilizing path in a kind of wireless self-organization network, can seek stable (longevity) path at self-organizing network efficiently.

In order to reach the foregoing invention purpose, seek the method for stabilizing path in the wireless self-organization network of the present invention, may further comprise the steps:

(1) source node structure route discovery message is by more than the local multicast to and non-whole neighbor node;

(2) neighbor node transmit route discovery message to this neighbor node more than one and non-whole neighbor node, up to the destination node that arrives route discovery message;

(3) destination node of described route discovery message selects a highest transmission route acknowledgement message of path stability to source node from the path of each transmission route discovery message, and source node and destination node establish a communications link.

Seek in the method for stabilizing path in the above-mentioned wireless self-organization network, step (1) comprising:

(11), initiate the process source node structure route discovery message of route querying, and set the structure and the initial value thereof of this route discovery message whenever receiving connection request;

(12) source node calculates its receiving node collection, then source node by calculate gained receiving node collection with route discovery message local multicast to more than and in non-whole neighbor node of source node.

Seek in the method for stabilizing path in the above-mentioned wireless self-organization network, step (2) comprising:

(21) described neighbor node is received route discovery message, checks whether this node is the destination node of route discovery message, if then enter step (3); Otherwise, enter next step;

(22) whether described neighbor node inspection received this route discovery message in the past, if received, then abandoned this route discovery message, and step finishes; Otherwise, enter next step;

(23) described neighbor node checks whether the intermediate node in the path that route discovery message experienced comprises this neighbor node, if comprise, then is a loop route, abandons this route discovery message, and step finishes; Otherwise, enter next step;

(24) described neighbor node check that this route discovery message allows at internodal residue jumping figure whether greater than 1, if enter next step; Otherwise, then abandoning this route discovery message, step finishes;

(25) described neighbor node upgrades route discovery message; And calculate the forward node collection of this route discovery message, according to the forward node collection that calculates gained this route discovery message local multicast is gone out then at this node;

(26) repeat above step, arrive destination node, enter step (3) up to route discovery message.

Seek in the method for stabilizing path in the above-mentioned wireless self-organization network, described step (3) comprising:

(31) after receiving a period of time of route discovery message for the first time, destination node is selected the highest one of path stability from each transmits the path of route discovery message, send the route acknowledgement message along inverse path to source node, and reserved resource on the way;

(32) after the route acknowledgement message arrived source node, source node and destination node established a communications link.

Adopt the method for the invention, compared with prior art, weigh the stability of node (link) with the statistical property of the historical data of the position of node and movement velocity, and proposed the QoS method of routing in a kind of searching stabilizing path (or long-lived path) based on this, can seek stable (longevity) path at self-organizing network efficiently.

Description of drawings

Fig. 1 is a performing step of the present invention;

Fig. 2 is the simulation result of path duration;

Fig. 3 is the simulation result of path re-establishing number of times.

Embodiment

The present invention is described in further detail below in conjunction with accompanying drawing:

The present invention includes following steps:

(1) whenever receiving that connection request source node s at first constructs route discovery message (DM bag); And set the structure and the initial value thereof of message;

(2) source node calculates its receiving node collection, then source node by calculate gained receiving node collection with route discovery message local multicast in the part neighbor node of source node;

(3) when certain node is received route discovery message, it checks that at first whether this node is the destination node in the route discovery message.If destination node, then

(A) wait for actual td;

(B) destination node selects the routed path that is experienced of route discovery message of value minimum of stability_parameter parameter as routed path from the source node to the destination node from all route discovery message of being received; Otherwise this node continues to handle this route discovery message;

Whether received this message before (4) this node is checked then, if received that this message then abandoned this route discovery message; If do not receive this route discovery message, then this node continues to handle this route discovery message;

(5) whether comprising itself address in the intermediate node addresses of listing in the path that is experienced that this node inspection route discovery message is write down, if comprise, then is a loop route, abandons this route discovery message; Otherwise, continue to handle;

(6) this node check this route discovery message parameter hop_count whether greater than 1, if hop_count is not more than 1, then abandon this route discovery message; If hop_count greater than 1, then continues to handle;

(7) this node updates route discovery message; And calculate the forward node collection at this node of this route discovery message, according to the forward node collection that calculates gained this route discovery message local multicast is gone out then;

(8) above process repeats, and arrives destination node up to route messages, and destination node has obtained the routed path from the source node to the destination node.Then, destination node sends the route acknowledgement message along the inverse path in this path to source node, and reserved resource on the way;

(9) after the route acknowledgement message arrived source node, then route had successfully been set up in this connection, can begin data transfer procedure.

In order to reduce the route messages expense, the present invention proposes and " local multicast " mechanism of use.Each message is being shared in the medium and is being transmitted by spot broadcasting in an ad hoc net.Message or be a spot broadcasting message, promptly its each neighbor node all is the recipient; Or a unicast messages, promptly it is to mail to some recipients, and is ignored by every other node." local multicast " is exactly to allow a subclass of neighbor node as the recipient.The hardware supports that in current ad hoc net, does not also have " local multicast ", but we can utilize spot broadcasting message to carry out the software realization.Consider certain node i, make that its recipient node collection is Ω _iNode i is not to send singlecast router message to Ω _iIn each node, but construct a spot broadcasting route messages, this spot broadcasting route messages has an additional field to indicate Ω _iThis route messages is broadcast to all neighbor nodes, and each neighbor node is handled the route messages of receiving and checked whether it belongs to Ω _iIf belong to Ω _i, this node is accepted it, otherwise abandons it.By " local multicast ", each node sends a route messages at most rather than each outbound is sent a singlecast router message like this.

In this external ad hoc net, a most important problem of design QoS routing algorithm is how to design to adapt to the QoS routing algorithm that network topology changes fast.Promptly wish to select a stable path or long-life path.For this reason, the present invention proposes to weigh with the statistical property of the historical data of the position of node and movement velocity the stability of node (link), and the additivity of constructing the path is on this basis measured the stability of weighing the path or the life-span in path.Its basic thought is as follows:

Think in the Statistical Physics: entropy is just represented irregular degree of alignment between the particle, in other words, and disorder (unordered) degree of expression system.System is unordered more, and entropy is just big more; System is orderly more, and entropy is just more little.(" entropy of a system is exactly the tolerance of its inorganization degree ", Wei Na).

Therefore the entropy of system is represented the disorderly degree or the unordered degree of this system.We just can describe the unordered degree of the network topology of ad hoc net with entropy so, promptly can describe the dynamic change of the network topology of ad hoc net with entropy.The stability in path in the ad hoc net just can be described with entropy conversely.Ad hoc net is called MANET again, and each transformable self-organizing system all has characteristic variable to characterize.For example a system that is made up of the motion particle characterizes its state with position vector and velocity.All these characteristic variables just can be determined the state of this system altogether.

Obviously the factor that characterizes the network topology state of ad hoc net should have three aspects: the position of each mobile node, the speed of each mobile node and the transmitting range of each mobile node.The characteristic variable that makes node i is a _{I, j}, wherein node j is the neighbor node of node i; A then _{I, j}=a _{I, j}(pos (i, t), pos (j, t), v (i, t), v (j, t), R _i, R _j) (3)

Wherein pos (i, t), (j is respectively node i and node j in t position vector constantly t) to pos; V (i, t), (j is respectively node i and node j at t velocity vector constantly t) to v; Ri, Rj are respectively the transmitting ranges of node i and node j.

In fact a _{I, j}Should be relevant with relative velocity and the relative position of node i and node j, that is: a _{I, j}=a _{I, j}(pos (i, j, t), v (i, j, t), R _i, R _j) (4)

Wherein pos (i, j, t)=pos (i, t) _ pos (j, t) the expression t relative position vector between node i and node j constantly, v (i, j, t)=v (i, t) _ v (j, t) the expression t relative velocity vector between node i and the node j constantly.

Based on this, our structural feature vector $a_{i,j}=\frac{1}{N}\underset{i=1}{\overset{N}{\mathrm{\Σ}}}\frac{\left|\right|\mathrm{pos}(i,j,t_i)+v(i,j,t_i)\×\mathrm{\Δ}\left|\right|-\left|\right|\mathrm{pos}(i,j,t_{i+1})\left|\right|}{R_i}---\left(5\right)$

Here N is at time interval Δ _tInterior discrete t constantly _iNumber (every a time interval Δ, relative position vector sum relative velocity vector is calculated and upgrades).Based on above definition, we define entropy $H_i(t,\mathrm{\Δ})=\frac{-\underset{k\∈F\left(i\right)}{\mathrm{\Σ}}{P}_k(t,\mathrm{\Δ})\log P_k(t,\mathrm{\Δ})}{\log C\left(F\left(i\right)\right)}$

(6)

Here, $P_k(t,\mathrm{\Δ})=\frac{a_{i,k}}{\underset{l\∈F\left(i\right)}{\mathrm{\Σ}}{a}_{i,l}}---\left(7\right)$

Neighbor node collection or its subclass of F (i) expression node i, the gesture (number of promptly gathering the element of F (i)) of C (F (i)) expression set F (i).If we want to calculate near the stability (node i) of localized network, F (i) just can be made as the neighbor node collection of node i so; If we are stable interested to the part of a certain particular path only, F (i) just can be made as two neighbor nodes of the node i on that paths so.

From above discussion, we as can be seen: the entropy function H that we constructed _i(t, Δ) is not the entropy under the stricti jurise in statistical physics or the information theory, and the tolerance that can characterize path stability of just constructing by means of the form of comentropy in the meaning of entropy in the physics and the information theory.According to this definition, it is strong that the given area changes Shaoxing opera, H in addition _i(t, Δ) is more little.

For the path P from node i to node j, its entropy is defined as:

$H_{P(i,j)}=\underset{k=1}{\overset{N_r}{\mathrm{\Π}}}{H}_k(t,\mathrm{\Δ})---\left(8\right)$

Here Nr represents the node number on the path P from node i to node j.

Definition is as can be known thus: and path P (i, j) stable more, H _{P (i, j)}Big more.

We make H ' again _i(t, Δ)=-lnH _i(t, Δ) (9)

Be path P (i, j) long-lived more (stablizing), then

$-\ln H_{P(i,j)}=H_{P(i,j)}^{\′}=-\underset{k=1}{\overset{N_r}{\mathrm{\Σ}}}\ln H_k(t,\mathrm{\Δ})=\underset{k=1}{\overset{N_r}{\mathrm{\Σ}}}{H}_k^{\′}(t,\mathrm{\Δ})---\left(10\right)$

More little.Promptly by getting negative logarithm, we have obtained characterizing the additivity tolerance of path stability---entropy tolerance: H ' _i(t, Δ)=-lnH _i(t, Δ).

Based on above method, we have proposed a kind of QoS routing algorithm that can seek stabilizing path, being described in detail as follows of this algorithm:

Whenever receiving connection request, source node s initiates route finding process.Source node s at first construct route discovery message DM (s, pos (s), d, pos (d), cid, DB, hop_initial, hop_count, Delay_so_far, Path_so_far, Entropy_so_far); Wherein the meaning of parameter is as follows:

A) s: source node;

B) pos (s): the position vector of source node;

C) d: purpose node;

D) pos (d): the position vector of purpose node

E) cid: connect id number

F) DB: deferred constraint;

G) hop_initial is meant the initial value of the maximum hop count that allows, and is made as ξ wherein, η are that (emulation shows two system parameterss: although along with the difference of node density, ξ, η has different optimum values, but when ξ=3, η=3 o'clock generally can access gratifying route success rate and spend relative less route messages expense);

H) hop_count is meant the currency of the maximum hop count that this route messages allows;

I) Delay_so_far is meant the time-delay that this message is experienced up to now, and initial value is made as 0;

J) Path_so_far is meant the path that this message is experienced up to now, and initial value is made as source node i d;

K) Stability_parameter is the parameter of expression path stability, equals the entropy in the path that this route discovery message experienced up to now $(\mathrm{Stability}\_parameter=H_{\mathrm{Path}\_\mathrm{so}\_\mathrm{far}}^{\′}=\underset{k=1}{\overset{N_r}{\mathrm{\Σ}}}{H}_k^{\′}(t,\mathrm{\Δ})),$ Its initial value is made as 0;

Source node calculates Ω _s=Fil _{H '}(π _{H '}(Fil _h(π _h(N ' (s))))), wherein N ' (s)=k|Delay_so_far+D (s, k)≤DB, k ∈ N (s) }, h is a heuristic function, and multiple choices can be arranged, as: h (i, j)=dist (j, d) (in emulation, select the heuristic function of this form) or h (i, j)=dist (j, d) * cost (i, j) or $h(i,j)=\{\frac{\mathrm{dist}(j,d)\×\cos t(i,j)}{\underset{\begin{array}{cc}\∞& \mathrm{elsewhile}\end{array}}{\mathrm{DB}-[\mathrm{Delay}\_\mathrm{so}\_\mathrm{far}+D(i,j)]}}\mathrm{Delay}\_\mathrm{so}\_\mathrm{far}+D(i,k)\≤\mathrm{DB}).$ Wherein π, Fil are respectively sorting operation and filter operator, are defined as follows:

Sorting operation π: for given sequence S={s ₁, s ₂..., s _n, its corresponding keyword sequences be h (s1), h (s2) ..., h (sn) }, then ${\mathrm{\&pi;}}_h\left(S\right)=\{{s_{\mathrm{<figure-callout\; id="1"\; label="p"\; filenames="A20061017070200151.png,A20061017070200161.png"\; state="\{\{state\}\}">p</figure-callout>}}}_1,{s_{\mathrm{<figure-callout\; id="2"\; label="p"\; filenames="A20061017070200151.png,A20061017070200161.png"\; state="\{\{state\}\}">p</figure-callout>}}}_2,...,{s_p}_n\}$ Make $h\left({s_p}_1\right)\&le;h\left({s_p}_2\right)\&le;...\&le;h\left({s_p}_n\right),$ Wherein $\{s_{{\mathrm{<figure-callout\; id="1"\; label="p"\; filenames="A20061017070200151.png,A20061017070200161.png"\; state="\{\{state\}\}">p</figure-callout>}}_1},s_{{\mathrm{<figure-callout\; id="2"\; label="p"\; filenames="A20061017070200151.png,A20061017070200161.png"\; state="\{\{state\}\}">p</figure-callout>}}_2},...,s_{p_n}\}$ Be { s ₁, s ₂..., s _nA kind of arrangement.

Filter operator Fil: for a given (s of h according to keywords _i) ordered sequence S={s ₁, s ₂..., s _n, h (s wherein ₁)≤h (s ₂)≤... ≤ h (s _n), Fil so _h(S)={ s ₁, s ₂..., s _τ, wherein

Expression more than or equal to

Smallest positive integral.

Source node s is by the Ω that calculates gained then _sValue in the territory with the route messages local multicast to the part neighbor node of s (at Ω _sIn node) in go.Any one intermediate node i receives route messages DM (s, pos (s), d from node j, pos (d), cid, DB, hop_initial, hop_count, Delay_so_far, Path_so_far, Stability_parameter) after, before at first checking, it whether received this message, if received that this message then abandoned this route messages; If do not receive this route messages, check then whether this node is present in Path_so_far, if this node in Path_so_far, then abandons this route messages; If this node not in Path_so_far, checks then that (hop_count-1) whether greater than 0, if value (hop_count-1) is not more than 0, then abandons this route messages; If (hop_count-1) value is greater than 0, then upgrade route messages and be DM (s, pos (s), d, pos (d), cid, DB, hop_initial,

$\min \{(\mathrm{hop}\_\mathrm{count}-1),(\mathrm{hop}\_\mathrm{initial}(1-\frac{\mathrm{dist}(s,,j)}{\mathrm{dist}(s,d)})-1)\},(\mathrm{Delay}\_\mathrm{so}\_\mathrm{far}+D(i,j)),(\mathrm{Path}\_\mathrm{so}\_\mathrm{far}+i),$

(Stability_parameter(Path?so?far+i))。And calculate Ω _i=Fil _{H '}(π _{H '}(Fil _h(π _h(N ' (i))))), wherein N ' (i)={ k|Delay_so_far+D (i, k)≤DB and k ≠ j, k ∈ N (i) }, then by the Ω that calculates gained _iAbove-mentioned route messages local multicast is gone out.Above process repeats, and arrives destination node d up to route messages.If destination node d receives first route messages, then it waits for preset time t at interval _dDestination node d is from its interbody spacer t at this moment _dSelect the route messages of the value minimum in a Stability_parameter territory in the interior route messages of being received, the path of being write down in the Path_so_far territory with this route messages is as the routed path from source node s to destination node d.Destination node sends the route acknowledgement message along the inverse path in this path to source node s then, and reserved resource on the way.After the route acknowledgement message arrived source node, then route had successfully been set up in this connection, can begin data transfer procedure.

What we proposed is a kind of time-delay QoS constraints routing algorithm, but method of the present invention is not limited to time-delay constraint route, is suitable for other method for routing in the wireless self-organization network.

Emulation experiment shows (seeing accompanying drawing 2,3): the QoS routing algorithm that proposes according to the present invention is other route technologies relatively, the stability in its pathfinding footpath is much higher than other routing algorithms, thereby has greatly solved wireless self-organization network because network topology ground dynamic change causes the effectively difficult problem of route with promoting.

The present invention can be applicable to wireless communication field, and in the environment that meeting room, office, classroom etc. are provisional, terminal density is higher, interim building network is used for the issue of information and shares; In the home environment, wireless interconnected and the exchanges data that is used for various device, make up LAN with low cost: the individual is collaborative work and the data sync between the portable equipment with oneself, as an interim structure territory net (Personal Area Network) of equipment rooms such as notebook computer, mobile phone, PDA; The provisional access service of public place is as attendant in coffee shop, the dining room or the provisional access to LAN of client's handheld device; The Connection Service of the service coverage hole of conventional cellular network provides legacy network to cover the environment of difficulty (or cost is too high) as the shade corner of building inside, hypogee etc.; No network coverage area, as in the remote mountain areas, desert, forest.In the valley, the intercommunication mutually between the personnel; Legacy network can't operate as normal environment, as the urgency communication service of disaster region; Personnel's communication under the particular surroundings such as battlefield, space, devices interconnect; The self-organizing network of a kind of quasistatic of sensing network (Sensor network), multi-hop is used, can be used for information gathering (detect as landform, surface condition, the minefield is surveyed) system monitoring (as the status monitoring of urban Underground pipeline system, the production line state-detection etc.) earthquake on the battlefield and the aspects such as early prediction of tsunami.

Claims (4)

1. seek the method for stabilizing path in the wireless self-organization network, it is characterized in that: may further comprise the steps:

(1) source node structure route discovery message is by more than the local multicast to and non-whole neighbor node;

(2) neighbor node transmit route discovery message to this neighbor node more than one and non-whole neighbor node, up to the destination node that arrives route discovery message;

(3) destination node of described route discovery message selects a highest transmission route acknowledgement message of path stability to source node from the path of each transmission route discovery message, and source node and destination node establish a communications link.

2. seek the method for stabilizing path in the wireless self-organization network according to claim 1, it is characterized in that: step (1) comprising:

(11), initiate the process source node structure route discovery message of route querying, and set the structure and the initial value thereof of this route discovery message whenever receiving connection request;

(12) source node calculates its receiving node collection, then source node by calculate gained receiving node collection with route discovery message local multicast to more than and in non-whole neighbor node of source node.

3. seek the method for stabilizing path in the wireless self-organization network according to claim 1, it is characterized in that: step (2) comprising:

(21) described neighbor node is received route discovery message, checks whether this node is the destination node of route discovery message, if then enter step (3); Otherwise, enter next step;

(22) whether described neighbor node inspection received this route discovery message in the past, if received, then abandoned this route discovery message, and step finishes; Otherwise, enter next step;

(23) described neighbor node checks whether the intermediate node in the path that route discovery message experienced comprises this neighbor node, if comprise, then is a loop route, abandons this route discovery message, and step finishes; Otherwise, enter next step;

(24) described neighbor node check that this route discovery message allows at internodal residue jumping figure whether greater than 1, if enter next step; Otherwise, then abandoning this route discovery message, step finishes;

(25) described neighbor node upgrades route discovery message; And calculate the forward node collection of this route discovery message, according to the forward node collection that calculates gained this route discovery message local multicast is gone out then at this node;

(26) repeat above step, arrive destination node, enter step (3) up to route discovery message.

4. seek the method for stabilizing path in the wireless self-organization network according to claim 3, it is characterized in that: described step (3) comprising:

(31) after receiving a period of time of route discovery message for the first time, destination node is selected the highest one of path stability from each transmits the path of route discovery message, send the route acknowledgement message along inverse path to source node, and reserved resource on the way;

(32) after the route acknowledgement message arrived source node, source node and destination node established a communications link.

Images