CN1491055A - Method for constructing stabilized self-adaption self-organization network terminal - Google Patents

Abstract

The method of self-organizing network terminal of constructing network stability self-adaptive, belongs to wireless self-organizing network route technology field. Its feature is: it takes numbers of node data pack transferred successfully to measure the stability of node, takes the buffer occupy rate waiting to send out to measure the load of node, thereby consider synthetically characteristic of route time delaying, route stability and load of route as selecting method of rout for wireless self-organizing network route standard. Comparing it with traditional self-organizing network terminal base in AODV algorithm, valid time of route longer, failure probability of route is less; it improves following aspect, such as: the data ratio transferred successfully, the data average transferring handling capacity of the terminal, the failure amount ,and data average transferring delay.

Description

The method of the self-organizing network terminal of building network stability self-adaptive

Technical field

The present invention relates to the route technology field of wireless network, particularly relate to the method for the self-organizing network terminal that makes up a kind of stability self-adaptive.

Background technology

Wireless network can be divided into two big classes on structure is formed: the network of fixed infrastructure and the network of no fixed infrastructure are arranged.(Elizabeth?M.Royer，Chai-Keong?Toh，″A?Reviewof?Current?Routing?Protocols?for?Ad?Hoc?Mobile?Wireless?Networks″，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, local wireless Access Network (WLAN).In the Cellular Networks, infrastructure network is made up of the base station, is the center with the base station, and circle (regular hexagon) 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 local wireless Access 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.When terminal shifts out and enters in the communication range of another " access point " in the communication range of " access point ", 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.

Do not have " access point " or switching equipment in the second class wireless network, but, be called as " wireless self-organization network " (Wireless Ad hoc network) by one group of spontaneous a kind of distributed communication network that forms of user terminal.

Self-organizing network (ad hoc) originates from nineteen sixty-eight Hawaii, America university and has set up the ALOHA network network for the educational alternative that connects school.On this basis, multi-hop grouping wireless electric network PRNet-Packet Radio network (J.Jubin and J.D.Tomow was proposed in 1973, " The DARPA packet radio network protocol; " Proc.Of the IEEE, vol 75, No.1, Jan 1987, pp.21-32).

IEEE renames as Ad hoc network with PRNet when exploitation IEEE 802.11 standards.IETF had set up mobile Ad hoc network MANET (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 tens Internet draft standard.

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, terminal itself can be searched for effective route dynamically, and packet is transmitted by other-end, was 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.In the wireless self-organization network, the mobility of communication terminal has caused network topology structure constantly to change, thereby in wireless self-organization network, shortest path is by being best route.

In the routing algorithm of existing ad hoc network system, when searching many routes to same purpose terminal, will select wherein " path delay minimum " one, as AODV (Ad hocOn-Demand Distance Vector (AODV) Routing, Jan.19,2002) algorithm.But the minimum path of time-delay might not be the most stable route.As shown in Figure 1,

Feasible path from source node S to destination node D has many, comprises that (K2 is D) with (D), wherein (S, A D) are " time-delay is minimum " one, and under the AODV algorithm, source node S will select this path to send data so for S, A for S, K1.If but the stability of K1, K2 node is than A node height, and the time-delay of two paths is when being more or less the same, and selects so that (K2 D) is more suitable for effectively transmitting in the success of data as route for S, K1.Simultaneously, when the load on certain paths is overweight, may cause the data congestion of network part, should select the route of other paths as transfer of data this moment, therefore should take all factors into consideration three factors of load balancing between the path delay of time, path stability and path in Route Selection.

Summary of the invention

The object of the present invention is to provide a kind of method of self-organizing network terminal of the building network stability self-adaptive of taking all factors into consideration network path delay, path stability and path load.

For achieving the above object, technical solution of the present invention provides a kind of method of self-organizing network terminal of building network stability self-adaptive, it 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.

Described method, it contains following steps:

(1) setup parameter and structure thereof;

(2) sending node is according to the address of the final purpose terminal in the packet packet header, in cache way

By inquiring about corresponding effectively route in the table:

If find effective route, then send this packet;

Otherwise, send route search packets of information (RQ), carry out next step route search;

(3) when certain neighbor node is received this RQ, the label of this RQ is made comparisons with the RQ label to identical destination node in its record:

If the label of this RQ is big, then this node continues to handle the RQ bag, and the label record with this RQ simultaneously is the treated maximum RQ label to identical destination node; Otherwise directly abandon this RQ;

(4) this node checks whether comprise itself address in the intermediate node addresses of having listed among the RQ:

If protect, be a loop route, abandon; Otherwise, continue to handle;

(5) when the node of receiving RQ is not the destination node of this RQ, check whether the RQ jumping figure has surpassed its maximum hop count restriction (Hop-Limit):

If surpass, then abandon; Otherwise, itself sequence of addresses is write the intermediate node addresses tabulation of RQ, and continues to send RQ packets of information after upgrading to neighbor node;

(6) if receive that the node of certain RQ has been the destination node of this RQ, perhaps follow procedures (2) is found the effective routing iinformation that has in the route-caching table of its preservation to corresponding destination node, then this node duplicates corresponding intermediate node address and above-mentioned other parameter values, beams back route replies packets of information (RP);

(7) when the initiation node of RQ be source node when receiving RP, just calculate uniting of this path and select parameter W, and deposit routing iinformation in its route-caching table;

(8) when source node sends data later on again, of W value minimum in all routes of corresponding destination node will select be arrived;

(9) after source node sends RQ, if in the regular hour (Route-Discovery-Period), do not receive RP, then source node will postpone a period of time and send route search packets of information RQ again after (Route-Discovery-Delay), and above-mentioned two time values are doubled excessive occupying system resources to prevent from frequently to send route search.

Described method, its described setup parameter and structure thereof comprise:

1) terminal stability: each terminal is so that its successful data packets transmitted is as the measurement foundation of its stability in designated period, and its argument structure is:

A) the accumulative total cycle: specify by system, represent with Count-Cycle;

Successful data packets transmitted quantity is represented with Packet-Counter in a count cycle;

B) the stability V-node in path:

V-node＝0.1·V-node+Packets-Counter；

2) terminate load: the medium shared ratio of packet to be sent of terminal buffers;

3) route search information: the route search packets of information of sending when terminal is carried out route search (RQ), its structure is:

A) ID: provide the RQ numbering by the terminal of initiating this route search packets of information;

B) Source-address: the address of initiating the terminal of this RQ;

C) Destination-address: the address of this RQ purpose terminal;

D) Hop-Limit (N): the maximum hop count limits value of this RQ search;

E) K-route: routing overhead parameter;

F) V-route: routing stability parameter;

G) Address-i: in the path address of i intermediate node;

V-route=V-route+V _i-node; V _i-node is the stability parameter of node i;

K-route=K-route+K _i-node; K _i-node is the load parameter of node i;

4) route replies information: when searching the route of an arrival purpose terminal, the route replies packets of information (RP) that node corresponding is beamed back:

ID, Source-address, Destination-address, K-route, V-route, Address-1 ... the definition of the Address-N relevant variable definition among the RQ of RP correspondence therewith is identical;

5) buffer memory routing table: the effective routing iinformation that searches in the regular period that each terminal is preserved, its argument structure contains:

A) destination node address (Destination Node Address);

B) route is united selection parameter (Selection Measurement represents with W);

C) route intermediate node addresses tabulation (Middle Nodes Address List);

D) route effective time limit (Life time);

Wherein, k route W W from node i to node j _K-ijExpression,

$W_{k-\mathrm{ij}}={\mathrm{<figure-callout\; id="1"\; label="A"\; filenames="A0315815500201.png"\; state="\{\{state\}\}">A</figure-callout>}}_1\&CenterDot;N+\frac{1}{N}({\mathrm{<figure-callout\; id="2"\; label="A"\; filenames="A0315815500201.png"\; state="\{\{state\}\}">A</figure-callout>}}_2\&CenterDot;K-\mathrm{route}+A_3\&CenterDot;V-\mathrm{route})$

Wherein:

N: total jumping figure of this route;

A1: the path distance weight coefficient, set;

A2: " load balancing " weight coefficient, set;

A3: " stability " weight coefficient, set;

6) route fail message (Route Error, RE): " the route fail message bag " that the corresponding terminal that is caused by routing error sends, its argument structure is: the purpose terminal address (Destination-address) of inefficacy route, the intermediate node addresses (Node-address) of generation routing error.

In the adaptive routing algorithm of network stabilization proposed by the invention, adopted the historical successful data packets transmitted quantity of node to weigh the stability of node, with node etc. data buffer area occupancy to be sent weigh the load of node, take all factors into consideration path delay characteristic, routing stability and path load, calculate the W value of every paths, as follows:

$W_{k-\mathrm{ij}}=A_1\&CenterDot;N+\frac{1}{N}(A_2\&CenterDot;K-\mathrm{route}+A_3\&CenterDot;V-\mathrm{route}),$

W _K-ij: k route from node i to node j;

N: total jumping figure of this route;

V-route:; The routing stability parameter;

K-route:; The routing overhead parameter;

A ₁: the path distance weight coefficient;

A ₂: " load balancing " weight coefficient;

A ₃: " stability " weight coefficient;

In many routes of identical purpose terminal, the route with minimum W value will be used as first-selected route and send user data package.This route length of the more little expression of W value is short, stability is higher, load is less.And then the successful transmission ratio and the network capacity of data in the raising network, and reduce the average transmission time-delay of data.

The invention is characterized in: it 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; After source node sends RQ, if in the regular hour (Route-Discovery-Period), do not receive RP, then source node will postpone a period of time and send route search packets of information RQ again after (Route-Discovery-Delay), and above-mentioned two time values are doubled excessive occupying system resources to prevent from frequently to send route search.

Routing algorithm given in the wireless self-organization network Terminal Design that proposes among the present invention has then taken into full account in the self-organizing network, the stability of terminal has made up the wireless ad hoc communication system of taking all factors into consideration route length, routing stability, Network Load Balance to the influence of systematic function.By system emulation relatively, the self-organizing network terminal that the adaptive self-organizing network terminal of this network stabilization is more traditional (Ad hoc On-Demand Distance Vector (AODV) Routing based on the AODV algorithm, Jan.19,2002), in the examination of indexs such as the quantity that on average opens circuit at system's average transmission time-delay, system's average transmission success rate, termination capacity, link, all has more performance.

Emulation experiment shows: no matter in identical and offered load difference of the motion time of staying of terminal, perhaps certain but motion time of staying terminal of offered load changes down, and the saturation system performance of network stabilization self adaptation route selection method all is better than the AODV method.

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, be used for the wireless interconnected and exchanges data of 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 remote mountain areas, desert, forest, 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; Sensing network (sensornetwork), the self-organizing network of a kind of quasistatic, multi-hop is used, the aspects such as early prediction that 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, production line state-detection etc.), earthquake and tsunami on the battlefield.

Description of drawings

Fig. 1 is the stability factor schematic diagram in path;

Fig. 2 is the route search figure of network stabilization self adaptation route selection method of the present invention;

Fig. 3 moves identical offered load of the time of staying not simultaneously, system's saturated capacity comparative graph of network stabilization self adaptation route selection method of the present invention and AODV method for terminal;

When Fig. 4 changed for certain terminal motion time of staying of offered load, the systematic function comparison diagram of network stabilization self adaptation route selection method of the present invention and AODV method:

Fig. 4 (a) is the comparison of " packet success transfer ratio " index;

Fig. 4 (b) is the comparison of " node average throughput capability " index;

Fig. 4 (c) is the comparison of " link failure quantity " index;

Fig. 4 (d) is the comparison of " average end-to-end delay " index;

Fig. 4 (e) is the comparison of " system's routing cost " index;

Fig. 5 is the program flow chart of the method for the invention.

Embodiment

One, argument structure definition

1. terminal stability

Each terminal is so that its successful data packets transmitted quantity is as the measurement foundation of its stability in designated period, and its argument structure is:

Packets-Counter	?Count-Cycle	?V-node

Wherein add up the cycle (Count-Cycle) by system's appointment, the initial value of Packets-Counter and V-node is 0.Terminal will be recorded in successful data packets transmitted quantity in the Count-Cycle in Packets-Counter, the computing formula of V-node is:

V-node＝0.1·V-node+Packets-Counter

When a Count-Cycle finished, Packets-Counter reset to 0.

2. terminate load

In the SAR routing algorithm, the medium data packet number to be sent of terminal buffers shared ratio in the nodal cache space is designated as parameter K-node as the load metric of this terminal, is calculated as follows:

$K\_\mathrm{node}=1-\frac{\mathrm{Packets}\_\mathrm{number}\_\mathrm{in}\_\mathrm{waiting}\_\mathrm{list}}{\mathrm{Amount}\_\mathrm{of}\_\mathrm{Buffer}}$

Packets_number_in_waiting_list: the data packet number that the needs of node current cache send;

Amount_of_Buffer: node is for sending the spatial cache size that data are opened up.

3. route search information

When terminal is carried out route search, will send " route search packets of information " (Route Quest, RQ), its structure is:

R Q

?I ?D

?Source ?_ ?addres ?s

?Destinati ?on ?-address

Hop- limit ?(N)

K- route

V- route

?Address-i ?……

ID is the RQ numbering that is provided by the terminal of initiating this route search packets of information, Source-address is the address of initiating this RQ terminal, Destination-address is the address of this RQ purpose terminal, Hop-limit is the maximum hop count limits value of this RQ search, and Address-i is the address of i intermediate node in the path.V-node and K-node are respectively the stability and the load parameters in this path, and its computing formula is:

V-route＝V-route+V _i-node

K-route＝K-route+K _i-node

4. route replies information

When searching a route to the purpose terminal, node corresponding will beam back " route replies packets of information " (Route Reply, RP), its structure is:

?R ?P

?I ?D

?Source ?_ ?addres ?s

?Destinati ?on ?-address

K- route

V- route

?Address ?-1

… …

?Address- ?N

The definition of ID among the RP, Source-address, Destination-address, Address-I, V-route and the K-route relevant variable definition among the RQ of RP correspondence therewith is identical, and variate-value equates.

5. buffer memory routing table

In the network stabilization adaptive routing algorithm, each terminal has been preserved the effective routing iinformation that searches in the regular period, its cache way comprises by list structure that destination node address (Destination NodeAddress), route are united and selects parameter W (Selection Measurement-W), the tabulation of route intermediate node addresses (Middle Nodes Address list), route effective time limit (Lifetime), and is as follows.

Destination Node?Address

?Selection ?Measurement-- ?W

?Middle?Nodes ?Address?list

?Lifetime

6. route fail message

In data transfer, if find because the routing error that network topology structure variation etc. cause, then relevant terminal send " route fail message bag " (Route Error, RE), its structure is:

RE

?Destination-address

?Node-address

Destination-address is the purpose terminal address of inefficacy route, and Node-address is the intermediate node addresses that routing error takes place.

Two, route search and maintenance

In the adaptive routing algorithm of network stabilization, route search mechanism is as follows: when terminal sends packet, with the address of the final purpose terminal of this packet, sending node will be according to its purpose terminal address, the corresponding route of inquiry in the buffer memory routing table in packet header of packet.If can find effective route, then send this packet; If there is not effective route, then send RQ, carry out route search.

With Fig. 2 is example, supposes that node A need search for a route to node E, will send RQ by A, and the neighbor node in the transmitting power coverage of A node will be received this RQ bag, and each RQ all has an ID label, indicates that it sends order.Each receives that the node of RQ bag also writes down the RQ label to a certain destination node that it was handled.

When certain node is received RQ, at first check the RQ whether handled identical destination node, when having only label as this RQ bigger than the RQ label to identical destination node in its record, this node just continues to handle this RQ and wraps, otherwise will directly abandon.This node will check to have listed among the RQ whether comprise itself address in the intermediate node addresses afterwards, if comprise, prove that then this is a loop route, abandons; Do not comprise and then continue to handle.

If receive the node of RQ be not the destination node of this RQ and in its cache way by middle effective route of not having to the RQ destination node, check that then whether the RQ jumping figure has surpassed its Hop-limit, if surpass, then abandons; If do not surpass, then itself sequence of addresses is write the intermediate node addresses tabulation of RQ, and continue the RQ packets of information after its neighbor node broadcast is upgraded.

If node is the route of having preserved effectively destination node in the buffer memory routing table of the destination node (destination-address) of this RQ or this node, then this node duplicates corresponding intermediate node address and other parameter values, beams back route replies packets of information RP.When the initiation node A of RQ receives RP, select parameter W with calculating uniting of this path, as follows:

$W_{k-\mathrm{ij}}=A_1\&CenterDot;N+\frac{1}{N}(A_2\&CenterDot;K-\mathrm{route}+A_3\&CenterDot;V-\mathrm{route}),$

And deposit this route in its route-caching table, when the A node sends data, will choose W value minimum in all routes of corresponding destination node one.

After source node sends RQ, if in the regular hour (Route-Discovery-Period), do not receive RP, then source node will postpone a period of time and send route search packets of information RQ again after (Route-Discovery-Delay), and the Route-Discovery-Delay value is doubled, to prevent the frequent excessive occupying system resources of the route search request of sending.

In network topology structure shown in Figure 2, when node A searches the route of E, all receive that the intermediate node of RP has also write down corresponding routing information, thereby when searching the path of " A is to E ", obtained the path of " A is to C ", " A is to D ", " B is to D ", " B is to E ", " C is to E " simultaneously.

When certain node (for example node C) sends data to its next-hop node (for example node D), but when not receiving the confirmation of receipt (ACK) of D, C will be to the D retransmission data, surpass maximum number of retransmissions (Retransmission-Limit) if send number of times continuously, think that then mistake has appearred in this paths of " C is to D ", node C will send the RE packets of information, receive that the node of RE will be deleted all routes that comprise " C is to D " path in its buffer memory routing table.

Three, the performance with the AODV algorithm compares

We have used GloMoSim network simulation platform (GloMoSim:A ScalableNetwork Simulation Environment, Lokesh Bajaj, Mineo Takai, Ken Tang, Rajive Bagrodia, Mario Gerla) finished performance simulation.Simulation model is as follows:

● emulation geographic area scope 160 * 160,16 of terminal quantities;

● the even random distribution of terminal: according to terminal quantity the geographic range of emulation evenly being divided into 16 sub regions, is that a terminal generates a position coordinates at random in each subregion;

● the terminal mobility model: (0～2 meter per second) evenly generates the movement rate of certain terminal at random in its mean motion speed range, and evenly generates the direction of motion of this terminal at random.When terminal moves to the border of emulation geographic range, then follow the rule of " left side goes out the right side and advances " and calculate its position coordinates; Adopt the uniform sampling simulation for the linear uniform motion of terminal, terminal was the sampling interval in certain " time of staying " on a bit;

● wireless transmission adopts two index decline models, decline index (2 ,-4), threshold value 100m;

● wireless carrier frequency 5.2GHz, channel width 20MHz, terminal peak transfer rate 54Mbps, receiver sensitivity 21dB, transmitter power 0dBm (effectively range of receiving 50m);

● antenna gain 0dB, ambient temperature 270K, noise factor 10;

● network MAC and physical layer adopt the IEEE802.11a agreement, the above ICP/IP protocol that adopts of network layer, application layer adopts CBR to generate transformation task, the long 2048bytes of unit data bag, the average load of terminal then changes simulation time 400 seconds along with CBR packet transmission time interval;

● each simulated point is the arithmetic mean of following 20 simulation results of the same terms;

● in the emulation, the integration period of SAR algorithm (Count-Cycle) value was made as 0.1 second;

● adopt two groups of route weight coefficients: (A ₁=1, A ₂=0.1, A ₃=0.05) and (A ₁=1, A ₂=0.1, A ₃=0);

In first group of emulation, it is under 0.5 second condition the time of staying that Fig. 3 has provided the terminal motion, when offered load not simultaneously, the saturation system Capacity Ratio of network stabilization adaptive routing algorithm and AODV is.

In second group of emulation, Fig. 4 has provided offered load, and necessarily (the CBR packet sends and is spaced apart 0.002 second, terminal average load 8274.747070Kb/s), when the motion time of staying of terminal changes (0.5 second～5 seconds), the performance of network stabilization adaptive routing algorithm and AODV relatively.Parameter index in the simulation result is defined as follows:

Offered Load: in 5 second time, generated 32 CBR data transfer tasks, be engraved in 0～5 second evenly random distribution during the initiation of CBR task, initiate terminal and in 16 terminals, generate (the initiation terminal of each task is different with the purpose terminal) at random with the purpose terminal, it is 100 that each task is sent the CBR data packet number, and each packet is that to send blanking time be T second to fixed length 2048bytes (1byte=8bits) packet.

$\mathrm{Offered}\_\mathrm{Load}(\mathrm{bits}/s)=\frac{2048*8}{T}$

Node ' s Throughpu:, remember that its moment that begins to receive data in simulation time is T for certain terminal k ₁, the moment that receives last packet is T ₂, at T ₁To T ₂Receive packet M (containing 2048*8bits information in each packet) in time altogether, then the Throughput of terminal N is:

$\mathrm{Throughput}\_\mathrm{node}\_k(\mathrm{bits}/s)=\frac{M*(2048*8)}{T_2-{\mathrm{<figure-callout\; id="1"\; label="T"\; filenames="A0315815500201.png"\; state="\{\{state\}\}">T</figure-callout>}}_1}$

Node ' s Throughput is the arithmetic mean of the Throughput of all terminals:

${\mathrm{Node}}^{\&prime;}s\_\mathrm{Throughput}=\frac{1}{N}\underset{i=1}{\overset{N}{\mathrm{\&Sigma;}}}\mathrm{Throughput}\_\mathrm{Node}\_i$

Packets delivery ratio: data packet number that all are successfully received by the destination node of task and task are initiated the ratio of all packets that node sends.

Broken Link Number: in simulation time, the communication link of having set up is because the number of links that various factors leads to errors and lost efficacy.

End-to-end Delay: for any packet, initiation node from the transmission task sends this packet, to its by the final purpose terminal of task is correct receive till, define " transmission delay end to end " of packet for this reason during this period of time, End-to-end Delay is defined as in the simulation time all by the arithmetic mean of " transmission delay end to end " of successful data packets for transmission.

Routing Control Cost: in simulation time, route maintenance bag (RQ, RP, RE) is called Control Packets, and all packets that send are called Data Packets, then

$\mathrm{Routing}\_\mathrm{Control}\_\mathrm{Cost}=\frac{\mathrm{Data}\_\mathrm{Packets}\left(\mathrm{bits}\right)}{\mathrm{Control}\_\mathrm{Packets}\left(\mathrm{bits}\right)}$

When terminal is under the mobile status, the variation of network topology structure becomes one of key factor that influences network performance.When the route search of new routing algorithm, selected stable higher route to carry out data passes, thereby the effective time of its route is longer, the probability of routing failure is less, data result shows under this simulated conditions, the data success transmission ratio of new routing algorithm has improved about 6.1% than AODV, it is about 7.3% that the data average transmission handling capacity of terminal improves, and link failure number amount descends 17.6% in the transmission course, its data average transmission time-delay reduces by 7.4% than AODV; Simultaneously owing to when route search is set up, considered the Network Load Balance problem, avoided local transfer of data congested, also improve a lot.

On the diverse network communication terminal device, as integrated communication module of wireless network card, terminal inner etc., the routing algorithm of its network layer (Network Layer) is updated to the adaptive routing algorithm of network stabilization, can be built into " the adaptive self-organizing network terminal of network stabilization ".

Claims (3)

1, a kind of method of self-organizing network terminal of building network stability self-adaptive, it is characterized in that, it 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.

2, the method for claim 1 is characterized in that, contains following steps:

(1) setup parameter and structure thereof;

(2) sending node is inquired about corresponding effectively route according to the address of the final purpose terminal in the packet packet header in the buffer memory routing table:

If find effective route, then send this packet;

Otherwise, send route search packets of information (RQ), carry out next step route search;

(3) when certain neighbor node is received this RQ, the label of this RQ is made comparisons with the RQ label to identical destination node in its record:

If the label of this RQ is big, then this node continues to handle the RQ bag, simultaneously with this RQ

Label record for to the treated maximum RQ label of identical destination node; Otherwise directly abandon this RQ;

(4) this node checks whether comprise itself address in the intermediate node addresses of having listed among the RQ:

If protect, be a loop route, abandon; Otherwise, continue to handle;

(5) when the node of receiving RQ is not the destination node of this RQ, check whether the RQ jumping figure has surpassed its maximum hop count restriction (Hop-Limit):

If surpass, then abandon; Otherwise, itself sequence of addresses is write the intermediate node addresses tabulation of RQ, and continues to send RQ packets of information after upgrading to neighbor node;

(6) if receive that the node of certain RQ has been the destination node of this RQ, perhaps follow procedures (2) is found the effective routing iinformation that has in the route-caching table of its preservation to corresponding destination node, then this node duplicates corresponding intermediate node address and above-mentioned other parameter values, beams back route replies packets of information (RP);

(7) when the initiation node of RQ be source node when receiving RP, just calculate uniting of this path and select parameter (W), and deposit routing iinformation in its route-caching table;

(8) when source node sends data later on again, of W value minimum in all routes of corresponding destination node will select be arrived;

(9) after source node sends RQ, if in the regular hour (Route-Discovery-Period), do not receive RP, then source node will postpone a period of time and send route search packets of information RQ again after (Route-Discovery-Delay), and above-mentioned two time values are doubled excessive occupying system resources to prevent from frequently to send route search.

3, method as claimed in claim 2 is characterized in that, described setup parameter and structure thereof comprise:

1) terminal stability: each terminal is so that its successful data packets transmitted is as the measurement foundation of its stability in designated period, and its argument structure is:

A) the accumulative total cycle: specify by system, represent with Count-Cycle;

Successful data packets transmitted quantity is represented with Packet-Counter in a count cycle;

B) the stability V-node in path:

V-node＝0.1·V-node+Packets-Counter；

2) terminate load: the medium shared ratio of packet to be sent of terminal buffers;

3) route search information: the route search packets of information of sending when terminal is carried out route search (RQ), its structure is:

A) ID: provide the RQ numbering by the terminal of initiating this route search packets of information;

B) Source-address: the address of initiating the terminal of this RQ;

C) Destination-address: the address of this RQ purpose terminal;

D) Hop-Limit (N): the maximum hop count limits value of this RQ search;

E) K-route: routing overhead parameter;

F) V-route: routing stability parameter;

G) Address-i: in the path address of i intermediate node;

V-route=V-route+V _i-node; V _i-node is the stability parameter of node i;

K-route=K-route+K _i-node; K _i-node is the load parameter of node i;

4) route replies information: when searching the route of an arrival purpose terminal, the route replies packets of information that node corresponding is beamed back (Route Reply, RP):

ID, Source-address, Destination-address, K-route, V-route, Address-1 ... Address-N is respectively the relevant variable value among the RQ of this RP correspondence;

5) buffer memory routing table: the effective routing iinformation that searches in the regular period that each terminal is preserved, its argument structure contains:

A) destination node address (Destination Node Address)

B) route is united selection parameter (Selection Measurement represents with W);

C) route intermediate node addresses tabulation (Middle Nodes Address List);

D) route effective time limit (Life time);

Wherein, " route unite select parameter " of the route of k from node i to node j uses W _K-ijExpression,

$W_{k-\mathrm{ij}}=A_1\&CenterDot;N+\frac{1}{N}(A_2\&CenterDot;K-\mathrm{route}+A_3\&CenterDot;V-\mathrm{route})$

Wherein:

N: total jumping figure of this route;

A1: the path distance weight coefficient, set;

A2: " load balancing " weight coefficient, set;

A3: " stability " weight coefficient, set;

6) route fail message (Route Error, RE): " the route fail message bag " that the corresponding terminal that is caused by routing error sends, its argument structure is: the purpose terminal address (Destination-address) of inefficacy route, the intermediate node addresses (Node-address) of generation routing error.

Images