CN102595552B - Packet radio network on-demand routing maintenance method based on adaptive dynamic mechanism - Google Patents
Packet radio network on-demand routing maintenance method based on adaptive dynamic mechanism Download PDFInfo
- Publication number
- CN102595552B CN102595552B CN201210041498.7A CN201210041498A CN102595552B CN 102595552 B CN102595552 B CN 102595552B CN 201210041498 A CN201210041498 A CN 201210041498A CN 102595552 B CN102595552 B CN 102595552B
- Authority
- CN
- China
- Prior art keywords
- heartbeat message
- destination node
- node
- routing
- route
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a packet radio network on-demand routing maintenance method based on an adaptive dynamic mechanism. The maintenance method comprises a routing thread processing method and a congestion control thread processing method, and a special heartbeat information packet format is also set; the routing thread processing method comprises a routing maintenance thread heartbeat information sending method of a sending end and a routing maintenance thread heartbeat information receiving method of a receiving end; a piece of heartbeat sending information is set for the active route target mode of each route list in the routing maintenance thread processing method; a congestion window is arranged on the target node of each route list in the congestion control thread processing method; and the heartbeat sending information and the congestion window interact in real time to obtain the latest link congestion condition of the target node. The maintenance method provided by the invention combines the cross layer design conception to better optimize the route maintenance policy under the on-demand routing, improve the link induction capability of the node under a mobile state and guarantee faster convergence for the routing.
Description
Technical field
The present invention relates to a kind of method of Ad Hoc mobile wireless network route maintenance, particularly a kind of radio block network on-demand route maintenance method based on self adaptation dynamic mechanism.
Background technology
So-called Ad Hoc mobile network is a kind of static infrastructure that do not rely on, and without Centroid, has the interim from the property organized network of route and forwarding capability.With its networking flexibility, fast, do not need default network infrastructure, survivability is extremely strong, creates and the mobile feature such as very convenient, completely distributed, makes it in the communications applications of a lot of special occasions, have unique advantage.Yet complicated and changeable due to ground environment, the interim networking of each node is simultaneously again in continuous movement, and what cause that communication link becomes is unreliable, has brought great challenge to the design of Routing Protocol.Therefore, in actual applications, be first necessary for Ad Hoc network and design separately host-host protocol, Routing Protocol, channel access protocol, simultaneously according to the needs of network and independent the improving and adjusting of feature.
At present, Ad Hoc mobile network Routing Protocol can be divided into initiatively route and as required route from the angle of route discovery.Initiatively to have time delay less for route, the advantage of the topological scope of the whole network of Dynamic Acquisition in real time, but route maintenance cost expense is larger simultaneously, and Routing Protocol is all the time in the shortcoming of convergence state not, as Routing Protocols such as WRP, DSDV; And as required route without real-time servicing route, only when having data to send, just carry out route discovery, data have certain time delay, and as Routing Protocols such as DSR, AODV, TORA, ABR, Fig. 1 and Fig. 2 are the typical workflow diagram of route standard A ODV agreement as required.Meanwhile, also have some by the hybrid routing protocol that route and active route combine as required, but its thought is in certain network area, to adopt the initiatively design of route, the interregional design that adopts passive route.Therefore, in Ad Hoc network, exist many problem demanding prompt solutions.
Summary of the invention
Object of the present invention is exactly in order to overcome the deficiency of prior art, and a kind of radio block network on-demand route maintenance method based on self adaptation dynamic mechanism is provided.
In order to realize said method, the technical solution used in the present invention is:
A kind of radio block network on-demand route maintenance method based on self adaptation dynamic mechanism.Its on-demand route maintenance method is for being provided with route maintenance thread processing method and congestion control thread processing method, and is provided with special-purpose heartbeat message packet format; Route maintenance thread processing method includes again route maintenance thread transmission heartbeat message method and the receiving terminal route maintenance thread reception heartbeat message method of transmitting terminal simultaneously; And the route destination node of enlivening of each routing table in route maintenance thread processing method is provided with 1 transmission heartbeat message; And be provided with 1 congestion window in the destination node of each routing table in congestion control thread processing method; The two carries out real-time, interactive.
Described route maintenance thread processing method is used for node according to the state of routing table routing iinformation and network congestion, judge whether the destination node in routing table periodically to send control information, to upgrade the routing table of node on whole piece path, we claim that the control information that this cycle sends is heartbeat message.Therefore, need in Routing Protocol, add heartbeat message HeartHop, for the destination node to routing table, send heartbeat message.
Described route maintenance thread processing method includes again transmitting terminal route maintenance thread and sends heartbeat message (HeartHop) method and receiving terminal route maintenance thread reception heartbeat message (HeartHop) method.
The route maintenance thread of described transmitting terminal sends heartbeat message method, by 5 steps, completed altogether, wherein:
Step 4.1 is routing tables of transmitting terminal traversal oneself, and the record of each in table of query and routing, screens according to the jumping figure Hop to each destination address;
Step 4.2 is processing of transmitting terminal screening set, by 4.21, compares the size of jumping figure Hop and 1, is greater than 1 routing table, enters 4.22, puts it into destination node S set
d, t-Twith to destination node next-hop node S set
n, t-T, wherein parametric t represents current time, T represents to send the cycle of heartbeat message, in t-T represents that T is in the past constantly; The routing table that screening jumping figure Hop equals 1, enters 4.23 and puts it into destination node S set
i, t-T, then enter 4.24, by S set
i, t-Tand S set
n, t-Tdiffer from, obtain in S set
i, t-Tmiddle existence and in S set
n, t-Tin non-existent S set
i+1, t-T, in order to reduce the expense of network operation information, therefore by asking difference set to screen destination address;
Step 4.3 is that transmitting terminal carries out information judgement, and inquiry T in the past, in the moment, has or not and mails to each in S set
d, t-Tand S
i+1, t-Tin node D
iroute requests, routing reply, data message, heartbeat message, and transmitting terminal has or not and receives from D
ithe route requests that node sends, routing reply, data message and heartbeat message, if to D
isent or do not receive from D
iroute requests, routing reply, data message and heartbeat message, enter step 4.4; If sent or received, enter step 4.52, do not send heartbeat message, this step is received D in routing table according in time T in the past
iinformation screen, to judge whether need to send heartbeat message to destination node D
i;
Step 4.4 is that route maintenance thread and the congestion control thread of transmitting terminal is mutual, through 4.41, inquires destination node D
icongestion window size, then enter 4.42 judgement congestion windows, only have when congestion window is greater than 0, just enter step 4.51 to destination node D
isend heartbeat message; Otherwise, destination node D is described
ioccur congestedly, do not send heartbeat message;
Step 4.5 is that transmitting terminal is to destination node D
isend heartbeat message, and be updated to the routing table of destination node.
Described receiving terminal route maintenance thread receives heartbeat message method, is completed altogether: wherein by 4 steps:
Step 5.1 be receiving terminal to receiving the processing after heartbeat message, through 5.12 destination addresses of isolating in the heartbeat message receiving, enter 5.13 and determine whether to issue oneself, if so, enter 5.41, in routing table, upgrade this record; If not, receiving terminal is forward node, turns to step 5.2 to carry out;
Step 5.2 is information judgements of receiving terminal, inquiry T is in the past in the moment, have or not the route requests, routing reply, data message, the heartbeat message that mail to destination node DestAddr, wherein DestAddr is expressed as the destination address of the heartbeat message receiving, and transmitting terminal has or not and receives route requests, routing reply, data message, the heartbeat message sending from DestAddr node, if do not send or do not receive route requests, routing reply, data message, the heartbeat message from DestAddr to DestAddr, entering step 5.3; If sent or received, enter 5.43, do not forward heartbeat message, and upgrade routing table;
Step 5.3 is that route maintenance thread and the congestion control thread of receiving terminal is mutual, inquires the congestion window size of destination node DestAddr, only has when congestion window is greater than 0, just enters step 5.42 and sends heartbeat message to destination node DestAddr; Otherwise, illustrate that destination node DestAddr occurs congested, do not send heartbeat message;
Step 5.4 is that receiving terminal forwards heartbeat message to destination node DestAddr, is updated to the operation of the routing table of destination node.
Described congestion control thread is for the congestion condition of monitoring network and dynamically adjust window size, determines whether node can send data.
Described congestion control thread is after Route establishment, and node is the congestion window of the dynamic establishment of destination node existing in each routing table, and the record in each routing table and each congestion window are corresponding, to monitor the congestion condition of this destination node.After route exists in routing table by route discovery, congestion window creates automatically; After route break, this corresponding congestion window discharges automatically.
Described congestion control thread processing method, is completed by 4 steps altogether, wherein:
Step 6.1 is through 6.11 route discoveries, set up after routing table, enter 6.12 for each routing table information creates a congestion window, for being recorded to the congestion window of each destination node, congestion window cwnd initial value equals half of maximized window threshold value mwnd;
If step 6.2 node has data to need to send, enter 6.22 and judge whether the value of congestion window cwnd is more than or equal to 1, if condition does not meet, illustrate that node do not receive the data validation that sends to destination node information, may exist congestedly, enter step 6.42, wouldn't send data; If condition meets, continue to enter 6.23, judge whether congestion window cwnd value is more than or equal to half of maximized window threshold value mwnd, if the value of congestion window cwnd is more than or equal to maximized window threshold value mwnd half, enter step 6.3, otherwise enter 6.41 and directly send data, and congestion window cwnd value subtracts 1;
Step 6.3 are nodes congestion window cwnd be more than or equal to maximized window threshold value mwnd half in the situation that, start timer, the transmission cycle T that timing cycle is heartbeat message, every one-period of crossing, congestion window cwnd value adds 1, until cwnd value is maximized window threshold value mwnd;
Step 6.4 is to send to the data of destination node and the operation that congestion window is processed.
Described heartbeat message packet format includes 6 territories, wherein:
Type type: HeartHop, accounts for 1 byte;
The common retention position of Reserved1 is 0, when receiving, is left in the basket, and accounts for 2 bytes;
Hop Count jumping figure: from source node to the jumping figure of processing the node of this request, account for 1 byte;
Destination IP Address information destination node IP address: the destination node IP address of heartbeat message, accounts for 4 bytes;
Originator IP Address source node IP address: initiate the node IP address of heartbeat message, account for 4 bytes;
The common retention position of Reserved2 is 0, when receiving, is left in the basket, and accounts for 4 bytes.
By above-mentioned steps, node carrys out the congestion information problem of perception destination node by set up the way of congestion window for destination address in each routing table.Destination node is often received a data message, will return to a data validation ACK for this information, and node is after often receiving a data confirmation, and congestion window is carried out cwnd=cwnd-1 operation, makes to change dynamically in this way congestion window size.
What deserves to be explained is: in the present invention, route maintenance thread processing method is served the processing of heartbeat message; Congestion control thread processing method is served data congestion and is controlled and the size of adjusting congestion window.The two carries out real-time, interactive, to obtain the link congestion situation of up-to-date arrival destination node.It combines route and initiatively the part advantage of route as required, and congestion control policy is incorporated in route maintenance and is gone, and has reduced the expense of route maintenance information.There is following significant advantage: (1), under channel status, introduces heartbeat message, make the continuous updating of route maintenance routing table as required, can be not expired because not having for a long time data to send; (2) in conjunction with congestion control policy, the route maintenance expense that maximum minimizing heartbeat message causes; (3) congestion control is for each destination node in routing table, makes node can real-time perception arrive the Congestion Level SPCC of destination node link.The present invention combines the thought of cross-layer design, makes as required under route, and the strategy of route maintenance is optimized more, has improved node under mobile status, and the ability of link perception has guaranteed the more Fast Convergent of route.
Accompanying drawing explanation
Fig. 1 is the discovery flow chart of standard A ODV agreement route.
Fig. 2 is the responding process figure of standard A ODV agreement route.
Fig. 3 is heartbeat message packet format figure of the present invention.
Fig. 4 is the process chart that transmitting terminal route maintenance thread of the present invention sends heartbeat message method.
Fig. 5 is the process chart that receiving terminal route maintenance thread of the present invention receives heartbeat message method.
Fig. 6 is the workflow diagram of congestion control thread processing method of the present invention.
Embodiment
Asking for an interview Fig. 3 to Fig. 6 is the specific embodiment of the present invention, and it is to be based upon to realize in the AODV Routing Protocol workflow of Fig. 1 and Fig. 2 standard.
On-demand route maintenance method of the present invention is for being provided with route maintenance thread processing method and congestion control thread processing method, and be provided with special-purpose heartbeat message packet format, wherein route maintenance thread processing method is provided with again route maintenance thread transmission heartbeat message method and the receiving terminal route maintenance thread reception heartbeat message method of transmitting terminal.
As shown in Figure 3, described heartbeat message packet format comprises following six territories:
Type type: HeartHop, accounts for 1 byte.
The common retention position of Reserved1 is 0, when receiving, is left in the basket, and accounts for 2 bytes.
Hop Count jumping figure: from source node to the jumping figure of processing the node of this request, account for 1 byte.
Destination IP Address information destination node IP address: the destination node IP address of heartbeat message, accounts for 4 bytes.
Originator IP Address source node IP address: initiate the node IP address of heartbeat message, account for 4 bytes.
The common retention position of Reserved2 is 0, when receiving, is left in the basket, and accounts for 4 bytes.
As shown in Figure 4, described transmitting terminal route maintenance thread sends heartbeat message method, by 5 steps, completed altogether, wherein:
Step 4.1 is routing tables of transmitting terminal traversal oneself, and the record of each in table of query and routing, screens according to the jumping figure Hop to each destination address;
Step 4.2 is processing of transmitting terminal screening set, by 4.21, compares the size of jumping figure Hop and 1, is greater than 1 routing table, enters 4.22, puts it into destination node S set
d, t-Twith to destination node next-hop node S set
n, t-T, wherein parametric t represents current time, T represents to send the cycle of heartbeat message, in t-T represents that T is in the past constantly; The routing table that screening jumping figure Hop equals 1, enters 4.23 and puts it into destination node S set
i, t-T, then enter 4.24, by S set
i, t-Tand S set
n, t-Tdiffer from, obtain in S set
i, t-Tmiddle existence and in S set
n, t-Tin non-existent S set
i+1, t-T, in order to reduce the expense of network operation information, therefore by asking difference set to screen destination address;
Step 4.3 is that transmitting terminal carries out information judgement, and inquiry T in the past, in the moment, has or not and mails to each in S set
d, t-Tand S
i+1, t-Tin node D
iroute requests, routing reply, data message, heartbeat message, and transmitting terminal has or not and receives from D
ithe route requests that node sends, data message and heartbeat message, if to D
isent or do not receive from D
iroute requests, data message and heartbeat message, enter step 4.4; If sent or received, enter step 4.52, do not send heartbeat message, this step is received D in routing table according in time T in the past
iinformation screen, to judge whether need to send heartbeat message to destination node D
i;
Step 4.4 is that route maintenance thread and the congestion control thread of transmitting terminal is mutual, through 4.41, inquires destination node D
icongestion window size, then enter 4.42 judgement congestion windows, only have when congestion window is greater than 0, just enter step 4.51 to destination node D
isend heartbeat message; Otherwise, destination node D is described
ioccur congestedly, do not send heartbeat message;
Step 4.5 is that transmitting terminal is to destination node D
isend heartbeat message, and be updated to the routing table of destination node.
As shown in Figure 5, described receiving terminal route maintenance thread receives heartbeat message method, is completed altogether: wherein by 4 steps:
Step 5.1 be receiving terminal to receiving the processing after heartbeat message, through 5.12 destination addresses of isolating in the heartbeat message receiving, enter 5.13 and determine whether to issue oneself, if so, enter 5.41, in routing table, upgrade this record; If not, receiving terminal is forward node, turns to step 5.2 to carry out;
Step 5.2 is information judgements of receiving terminal, inquiry T is in the past in the moment, have or not the route requests, routing reply, data message, the heartbeat message that mail to destination node DestAddr, wherein DestAddr is expressed as the destination address of the heartbeat message receiving, and transmitting terminal has or not and receives route requests, routing reply, data message, the heartbeat message sending from DestAddr node, if do not send or do not receive route requests, routing reply, data message, the heartbeat message from DestAddr to DestAddr, entering step 5.3; If sent or received, enter 5.43, do not forward heartbeat message, and upgrade routing table;
Step 5.3 is that route maintenance thread and the congestion control thread of receiving terminal is mutual, inquires the congestion window size of destination node DestAddr, only has when congestion window is greater than 0, just enters step 5.42 and sends heartbeat message to destination node DestAddr; Otherwise, illustrate that destination node DestAddr occurs congested, do not send heartbeat message;
Step 5.4 is that receiving terminal forwards heartbeat message to destination node DestAddr, is updated to the operation of the routing table of destination node.
As shown in Figure 6, described congestion control thread processing method, is completed by 4 steps altogether, wherein:
Step 6.1 is through 6.11 route discoveries, set up after routing table, enter 6.12 for each routing table information creates a congestion window, for being recorded to the congestion window of each destination node, congestion window cwnd initial value equals half of maximized window threshold value mwnd;
If step 6.2 node is needed to send by data, enter 6.22 and judge whether the value of congestion window cwnd is more than or equal to 1, if condition does not meet, illustrate that node do not receive the data validation that sends to destination node information, may exist congestedly, enter step 6.42, wouldn't send data; If condition meets, continue to enter 6.23, judge whether congestion window cwnd value is more than or equal to half of maximized window threshold value mwnd, if congestion window cwnd value is gathered around half that is more than or equal to maximized window threshold value mwnd, enter step 6.3, otherwise enter 6.41 and directly send data, and congestion window cwnd value subtracts 1;
Step 6.3 are nodes congestion window cwnd be more than or equal to maximized window threshold value mwnd half in the situation that, start timer, the transmission cycle T that timing cycle is heartbeat message, every one-period of crossing, congestion window cwnd value adds 1, until cwnd value is maximized window threshold value mwnd;
Step 6.4 is to send to the data of destination node and the operation that congestion window is processed.
In addition, enlivening of each routing table in described route maintenance thread processing method is provided with 1 and sends heartbeat message in route destination node.
In the destination node of each routing table in described congestion window thread processing method, be provided with 1 congestion window.
Below example has been described in further detail said method and has been embedded into normal work how in standard A ODV agreement by reference to the accompanying drawings; example is only for explaining the present invention; not be defined in scope of the present invention; therefore; within the spirit and principles in the present invention all; any modification of making, be equal to replacement, improvement etc., within protection scope of the present invention all should be included in.
Claims (6)
1. the radio block network on-demand route maintenance method based on self adaptation dynamic mechanism, and on-demand route maintenance method is provided with route maintenance thread processing method and congestion control thread processing method, and be provided with special-purpose heartbeat message packet format, route maintenance thread processing method includes again route maintenance thread transmission heartbeat message method and the receiving terminal route maintenance thread reception heartbeat message method of transmitting terminal simultaneously, it is characterized in that:
The route maintenance thread of described transmitting terminal sends heartbeat message method, by 5 steps, completed altogether, wherein:
Step 4.1 is routing tables of transmitting terminal traversal oneself, and the record of each in table of query and routing, screens according to the jumping figure Hop to each destination address;
Step 4.2 is processing of transmitting terminal screening set, by 4.21, compares the size of jumping figure Hop and 1, is greater than 1 routing table, enters 4.22, puts it into destination node S set
d, t-Twith to destination node next-hop node S set
n, t-T, wherein parametric t represents current time, T represents to send the cycle of heartbeat message, in t-T represents that T is in the past constantly; The routing table that screening jumping figure Hop equals 1, enters 4.23 and puts it into destination node S set
i, t-T, then enter 4.24, by S set
i, t-Tand S set
n, t-Tdiffer from, obtain in S set
i, t-Tmiddle existence and in S set
n, t-Tin non-existent S set
i+1, t-T, in order to reduce the expense of network operation information, therefore by asking difference set to screen destination address;
Step 4.3 is that transmitting terminal carries out information judgement, and inquiry T in the past, in the moment, has or not and mails to each in S set
d, t-Tand S
i+1, t-Tin node D
iroute requests, routing reply, data message, heartbeat message, and transmitting terminal has or not and receives from D
ithe route requests that node sends, routing reply, data message and heartbeat message, if to D
isent or do not receive from D
iroute requests, routing reply, data message and heartbeat message, enter step 4.4; If sent or received, enter step 4.52, do not send heartbeat message, this step is received D in routing table according in time T in the past
iinformation screen, to judge whether need to send heartbeat message to destination node D
i;
Step 4.4 is that route maintenance thread and the congestion control thread of transmitting terminal is mutual, through 4.41, inquires destination node D
icongestion window size, then enter 4.42 judgement congestion windows, only have when congestion window is greater than 0, just enter step 4.51 to destination node D
isend heartbeat message; Otherwise, destination node D is described
ioccur congestedly, do not send heartbeat message;
Step 4.5 is that transmitting terminal is to destination node D
isend heartbeat message, and be updated to the routing table of destination node.
2. the radio block network on-demand route maintenance method based on self adaptation dynamic mechanism as claimed in claim 1, is characterized in that:
Described receiving terminal route maintenance thread receives heartbeat message method, is completed altogether: wherein by 4 steps:
Step 5.1 be receiving terminal to receiving the processing after heartbeat message, through 5.12 destination addresses of isolating in the heartbeat message receiving, enter 5.13 and determine whether to issue oneself, if so, enter 5.41, in routing table, upgrade this record; If not, receiving terminal is forward node, turns to step 5.2 to carry out;
Step 5.2 is information judgements of receiving terminal, inquiry T is in the past in the moment, have or not the route requests, routing reply, data message, the heartbeat message that mail to destination node DestAddr, wherein DestAddr is expressed as the destination address of the heartbeat message receiving, and transmitting terminal has or not and receives route requests, routing reply, data message, the heartbeat message sending from DestAddr node, if do not send or do not receive route requests, routing reply, data message, the heartbeat message from DestAddr to DestAddr, entering step 5.3; If sent or received, enter 5.43, do not forward heartbeat message, and upgrade routing table;
Step 5.3 is that route maintenance thread and the congestion control thread of receiving terminal is mutual, inquires the congestion window size of destination node DestAddr, only has when congestion window is greater than 0, just enters step 5.42 and sends heartbeat message to destination node DestAddr; Otherwise, illustrate that destination node DestAddr occurs congested, do not send heartbeat message;
Step 5.4 is that receiving terminal forwards heartbeat message to destination node DestAddr, is updated to the operation of the routing table of destination node.
3. the radio block network on-demand route maintenance method based on self adaptation dynamic mechanism as claimed in claim 1, is characterized in that:
Described congestion control thread processing method, is completed by 4 steps altogether, wherein:
Step 6.1 is through 6.11 route discoveries, set up after routing table, enter 6.12 for each routing table information creates a congestion window, for being recorded to the congestion window of each destination node, congestion window cwnd initial value equals half of maximized window threshold value mwnd;
If step 6.2 node has data to need to send, enter 6.22 and judge whether the value of congestion window cwnd is more than or equal to 1, if condition does not meet, illustrate that node do not receive the data validation that sends to destination node information, may exist congestedly, enter step 6.42, wouldn't send data; If condition meets, continue to enter 6.23, judge whether congestion window cwnd value is more than or equal to half of maximized window threshold value mwnd, if the value of congestion window cwnd is more than or equal to maximized window threshold value mwnd half, enter step 6.3, otherwise enter 6.41 and directly send data, and congestion window cwnd value subtracts 1;
Step 6.3 are nodes congestion window cwnd be more than or equal to maximized window threshold value mwnd half in the situation that, start timer, the transmission cycle T that timing cycle is heartbeat message, every one-period of crossing, congestion window cwnd value adds 1, until cwnd value is maximized window threshold value mwnd;
Step 6.4 is to send to the data of destination node and the operation that congestion window is processed.
4. the radio block network on-demand route maintenance method based on self adaptation dynamic mechanism as claimed in claim 1, is characterized in that:
Described heartbeat message packet format includes 6 territories, wherein:
Type type: HeartHop, accounts for 1 byte;
The common retention position of Reserved1 is 0, when receiving, is left in the basket, and accounts for 2 bytes;
Hop Count jumping figure: from source node to the jumping figure of processing the node of this request, account for 1 byte;
Destination IP Address information destination node IP address: the destination node IP address of heartbeat message, accounts for 4 bytes;
Originator IP Address source node IP address: initiate the node IP address of heartbeat message, account for 4 bytes;
The common retention position of Reserved2 is 0, when receiving, is left in the basket, and accounts for 4 bytes.
5. the radio block network on-demand route maintenance method based on self adaptation dynamic mechanism as claimed in claim 1, is characterized in that:
The enlivening of each routing table in described route maintenance thread processing method is provided with 1 and sends heartbeat message in route destination node.
6. the radio block network on-demand route maintenance method based on self adaptation dynamic mechanism as claimed in claim 1, is characterized in that:
In the destination node of each routing table in described congestion control thread processing method, be provided with 1 congestion window.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210041498.7A CN102595552B (en) | 2012-02-23 | 2012-02-23 | Packet radio network on-demand routing maintenance method based on adaptive dynamic mechanism |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210041498.7A CN102595552B (en) | 2012-02-23 | 2012-02-23 | Packet radio network on-demand routing maintenance method based on adaptive dynamic mechanism |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102595552A CN102595552A (en) | 2012-07-18 |
| CN102595552B true CN102595552B (en) | 2014-12-10 |
Family
ID=46483642
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210041498.7A Active CN102595552B (en) | 2012-02-23 | 2012-02-23 | Packet radio network on-demand routing maintenance method based on adaptive dynamic mechanism |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102595552B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109480818B (en) * | 2017-09-12 | 2021-11-09 | 中国移动通信有限公司研究院 | Method and device for processing physiological data signal across hardware platform |
| CN108418860A (en) * | 2018-01-26 | 2018-08-17 | 郑州云海信息技术有限公司 | A kind of osd heartbeat means of communication based on ceph clusters |
| CN110784373B (en) * | 2019-10-18 | 2022-05-10 | 深圳市永达电子信息股份有限公司 | Virtual network convergence method and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1564544A (en) * | 2004-03-26 | 2005-01-12 | 清华大学 | Route searching of detgredd of node based on radio self-organizing network and maitenance method thereof |
| CN1642131A (en) * | 2004-01-08 | 2005-07-20 | 电子科技大学 | Distributed self-organising dynamic route method based on ant algorithm |
| WO2007027481A2 (en) * | 2005-08-30 | 2007-03-08 | Cisco Technology, Inc. | Method for updating best path based on real-time congestion feedback |
| CN101286930A (en) * | 2008-05-30 | 2008-10-15 | 华南理工大学 | Self-adapting routing method for congestion of multi-hop wireless self-organizing network |
-
2012
- 2012-02-23 CN CN201210041498.7A patent/CN102595552B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1642131A (en) * | 2004-01-08 | 2005-07-20 | 电子科技大学 | Distributed self-organising dynamic route method based on ant algorithm |
| CN1564544A (en) * | 2004-03-26 | 2005-01-12 | 清华大学 | Route searching of detgredd of node based on radio self-organizing network and maitenance method thereof |
| WO2007027481A2 (en) * | 2005-08-30 | 2007-03-08 | Cisco Technology, Inc. | Method for updating best path based on real-time congestion feedback |
| CN101286930A (en) * | 2008-05-30 | 2008-10-15 | 华南理工大学 | Self-adapting routing method for congestion of multi-hop wireless self-organizing network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102595552A (en) | 2012-07-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107852362B (en) | Mesh network system and method | |
| US10075892B2 (en) | Mobile device for use in a dynamic and stochastic asynchronously updated wireless ad-hoc network | |
| JP4805646B2 (en) | Sensor terminal and sensor terminal control method | |
| EP2280517B1 (en) | Method and apparatus for controlling packet transmissions within wireless networks to enhance network formation | |
| US7346015B2 (en) | Method and apparatus for routing data with support for changing mobility requirements | |
| JP4668823B2 (en) | Wireless communication device | |
| EP2866395B1 (en) | Maximum transmission unit negotiation method and data terminal | |
| KR20170036760A (en) | Efficient centralized resource and schedule management in time slotted channel hopping networks | |
| US20050157749A1 (en) | System and method for communication with an external network in an IPv6 MANET network | |
| CN108123873A (en) | Data forwarding paths selection method and device, storage medium, server-side | |
| CN113518405A (en) | Mesh network system | |
| WO2024001190A1 (en) | Message sending method, device intelligent interconnection system, related device, and storage medium | |
| CN102595552B (en) | Packet radio network on-demand routing maintenance method based on adaptive dynamic mechanism | |
| CN104735743A (en) | Routing optimization method for embedded wireless self-organized network | |
| CA2450606C (en) | Method and apparatus for routing data | |
| CN105072586B (en) | To the management method of the forwarding of broadcast message in embedded radio self-organizing network | |
| CN102421142A (en) | Transmission control protocol (TCP) congestion control method based on cross-layer design in vehicle communication network | |
| CN104320825A (en) | Ad hoc network route selection method based on repeated game | |
| US20220295240A1 (en) | System and method for implementing relay nodes in a wireless network | |
| CN102026330A (en) | Method for improving availability of ad hoc network | |
| JP7326230B2 (en) | Communication system, node, communication method and program | |
| US11190979B2 (en) | Methods and apparatus for forwarding packets between child nodes and parent nodes | |
| KR20040078549A (en) | Confidence broadcasting system to ad-hoc network environment and method thereof | |
| CN109309606B (en) | Communication method for household appliance network | |
| CN102104915B (en) | A kind of QoS control method based on PMIP and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |