CN103974365A - Ad Hoc mobile network route restoring method - Google Patents
Ad Hoc mobile network route restoring method Download PDFInfo
- Publication number
- CN103974365A CN103974365A CN201410148413.4A CN201410148413A CN103974365A CN 103974365 A CN103974365 A CN 103974365A CN 201410148413 A CN201410148413 A CN 201410148413A CN 103974365 A CN103974365 A CN 103974365A
- Authority
- CN
- China
- Prior art keywords
- node
- route
- jumping
- destination node
- routing
- 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.)
- Pending
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses an Ad Hoc mobile network route restoring method, and belongs to the technical field of networks. According to the Ad Hoc mobile network, at the route establishing stage, the forward route from a source node to a target node and the reverse route from the target node to the source node are established at the same time; after a route link fractures, the local restoring direction is selected by comparing the hop counts from the link fracture position to the target node with the hop counts from the link fracture position to the source node; if the hop counts from the link fracture position to the source node are larger than or equal to the hop counts from the link fracture position to the target node, downward route restoring with the target node as the restoring target node is carried out from an upstream node at the link fracture position, or otherwise, upward route restoring with the source node as the restoring target node is carried out from a downstream node at the link fracture position. By means of the Ad Hoc mobile network route restoring method, time delay caused by route maintaining and expenditure caused by route control grouping can be reduced, and the flexibility of a route maintaining mechanism is improved.
Description
Technical field
The present invention relates to a kind of Ad Hoc mobile network method for repairing route, relate in particular to a kind of two-way method for repairing route of Ad Hoc mobile network based on jumping figure, belong to networking technology area.
Background technology
The multi-hop type cordless communication network that mobile Ad Hoc network is a kind of topological dynamic change, Routing Protocol is one of important technology of mobile Ad Hoc network.Routing Protocol is mainly responsible for Route establishment and route maintenance work.For the mobile Ad Hoc network of topology heights dynamic change, the frequent fracture of route is inevitably, carries out route maintenance in time with less expense, can greatly improve the robustness of route, ageing, survivability and network performance.
Mobile Ad Hoc network on-demand routing protocol, with little, the adaptable advantage of its expense, is applicable to the network topology of dynamic change, resource-constrained mobile Ad Hoc network.AODV, DSR, LAR, ZRP, CBRP etc. are classical On-demand routing agreements.On-demand routing is mainly divided into route discovery and two stages of route maintenance:
In the route discovery stage, set up route by route requests RREQ (Route Request) and the route replies grouping RREP (Route Reply) that divides into groups.Source node is broadcasted the RREQ taking destination node address as search condition, node receives new RREQ, upgrade or add to the routing iinformation of source node, if do not arrive the effective routing of destination node, just continue broadcast and forward this RREQ, until destination node or have to the intermediate node of the effective routing of destination node receives after this RREQ, send RREP and carry out route replies to source node, source node just can be set up the two-way route between source node and destination node after receiving RREP.Two-way route refers to reverse route and forward direction route, and oppositely route is the route that destination node arrives source node, is to set up in the process of broadcast RREQ grouping; Forward direction route is the route that source node arrives destination node, is to set up in the process of clean culture RREP grouping.In the route table items of node, storing destination node, to the next-hop node of destination node, to information such as the jumping figures of destination node.
In the route maintenance stage, mainly by Route error message RERR(Routing Error) safeguard route.At present, route maintenance method mainly contains four classes: the one, and source restorative procedure, when after routing link fracture, chain rupture place upstream node sends RERR to source node, carry out route repair by source node: source node sends the RREQ taking destination node address as search condition, destination node or have after the intermediate node of the effective routing of destination node receives RREQ and send RREP to source node, source node completes route repair after receiving RREP.These class methods are simple, but the time delay causing and network overhead are larger, as early stage AODV agreement.The 2nd, alternate routing method, many routes to destination node of node maintenance, when after former route fracture, node is selected an alternate routing.These class methods have reduced time delay, but network overhead is larger, and reliability is not high, alternate routing because of the topology of MANET dynamic change can be easy to lost efficacy, as AODV-BR, the agreements such as DSR.The 3rd, local restorative procedure, when after route fracture, directly be initiated to the route repair of destination node by chain rupture place upstream node: chain rupture place upstream node sends the RREQ taking destination node address as search condition, destination node or have after the intermediate node of the effective routing of destination node receives RREQ and return to RREP, upstream node is received RREP within certain stand-by period, just completes route repair; If do not receive RREP, broadcast RERR to notify other nodes this link fracture, source node re-establishes the route of destination node.These class methods can effectively reduce time delay and network overhead.But when chain rupture place from destination node away from time, be just equivalent to source restorative procedure, as the AODV agreement in later stage.Four is slip rehabilitation methods, these class methods are improvement of local routing restorative procedure, when after route fracture, be initiated to the route repair of next-hop node or lower two hop nodes of chain rupture place by chain rupture place upstream node, chain rupture place upstream node sends the RREQ taking next-hop node or lower double bounce node address as search condition, and these class methods can further reduce the expense of time delay and network control grouping, but it is not taking destination node as reparation destination node, risk is larger, and success rate is not high.One class of the above-mentioned four class route maintenance methods of all kinds of basic employing of association's justice of route as required or the combination of several classes.As DSR, AODV-BR adopt backup routing mechanism, AODV, ZRP, CBRP have adopted source repair mechanism and local repair mechanism.Above route maintenance method has pluses and minuses separately, but exists common defect: they all adopt route " unidirectional " repair mode.Route " unidirectional " is repaired, and no matter where chain rupture place is positioned at, and always carries out the route repair of carrying out towards the destination node in chain rupture place downstream, and flexibility is inadequate, especially when chain rupture place from destination node away from time, will bring larger network overhead and time delay.
Summary of the invention
Technical problem to be solved by this invention is to overcome the deficiency of route " unidirectional " restorative procedure in existing mobile Ad Hoc network on-demand routing protocol, a kind of Ad Hoc mobile network method for repairing route is provided, can reduce time delay that route maintenance causes and the expense of route control packet, the flexibility that improves route maintenance mechanism.
Technical scheme of the present invention is specific as follows:
A kind of Ad Hoc mobile network method for repairing route, described Ad Hoc mobile network, in the Route establishment stage, set up the forward direction route of source node to destination node, and destination node is to the reverse route of source node simultaneously; After routing link fracture, direction by relatively chain rupture place selects this locality to repair from the jumping figure of destination node and source node: if chain rupture place is more than or equal to the jumping figure from destination node from the jumping figure of source node, undertaken taking destination node as repairing the downward route repair of destination node by the upstream node of chain rupture place; Otherwise, undertaken taking source node as repairing upwards route repair of destination node by the downstream node of chain rupture place.
Preferably, described relatively chain rupture place is from the jumping figure of destination node and source node, specifically by the following method: the upstream node of chain rupture place and downstream node calculate respectively and arrive separately the jumping figure of source node and arrive the difference between the jumping figure of destination node; For upstream node, as this difference is more than or equal to-1, chain rupture place is more than or equal to the jumping figure from destination node from the jumping figure of source node; For downstream node, as this difference is less than or equal to 0, chain rupture place is less than the jumping figure from destination node from the jumping figure of source node.
Preferably, described downward route repair is specific as follows: the broadcasting area of described upstream node using its jumping figure apart from destination node as RREQ, search condition using destination node address as RREQ, originating address using source node address as RREQ, add 1 as the jumping figure initial value in RREQ using the jumping figure value of its distance sources node, broadcast RREQ grouping, and wait for RREP packet acknowledgment; If receive RREP grouping in limiting time, route repair success downwards if do not receive, is broadcasted RREQ grouping in network range; If still cannot repair route, upstream node broadcast RERR grouping, notifies other nodes.
Preferably, described upwards route repair is specific as follows: the broadcasting area of described downstream node using the jumping figure of its distance sources node as RREQ, search condition using source node address as RREQ, originating address using destination node address as RREQ, jumping figure value using it apart from destination node adds 1 as the jumping figure initial value in RREQ, broadcast RREQ grouping, and wait for RREP packet acknowledgment; If receive RREP grouping in limiting time, upwards route repair success if do not receive, is broadcasted RREQ grouping in network range; If still cannot repair route, broadcast RERR grouping, notify other nodes.
Further, when after route repair success, carry out in accordance with the following methods routing update:
The node of being responsible for repairing is along oppositely route is to source node transmission routing update notice packet, and described routing update notice packet comprises type of message, source node address, destination node address;
Node is successively according to the destination node address in the routing update notice packet receiving and the upper hop nodal information that forwards this routing update notice packet on the way, upgrades or adds self forward direction routing iinformation to destination node;
Source node is according to the source node address in received routing update notice packet and destination node address, and forward the upper hop node of this routing update notice packet, first upgrade the next-hop node information to destination node in self routing table, then send routing update request grouping along forward direction route to destination node, described routing update request grouping comprises type of message, source node address, destination node address, jumping figure, and wherein the initial value of jumping figure is 1;
Node upgrades according to the routing update request grouping receiving successively or adds the reverse routing iinformation of source node address on the way: first, upgrading self is the jumping figure in routing update request grouping to the jumping figure of source node, upgrading self is the upper hop node that forwards this routing update request grouping to the next-hop node of source node, then the jumping figure value in routing update request grouping is added to 1 rear continuation along forward direction routing forwarding, until arrive destination node;
Destination node sends routing update acknowledgment packet along reverse route after receiving routing update request grouping, and described routing update acknowledgment packet comprises type of message, source node address, destination node address, jumping figure, and wherein the initial value of jumping figure is 1;
Node upgrades according to the routing update acknowledgment packet that receives successively or adds the forward direction routing iinformation of destination node address on the way: first, upgrading self is the jumping figure in routing update acknowledgment packet to the jumping figure of destination node, upgrading self is the upper hop node that forwards this routing update acknowledgment packet to the next-hop node of destination node, then the jumping figure value in routing update acknowledgment packet is added to 1 rear continuation along reverse routing forwarding, until arrive source node.
Compared with prior art, method for repairing route of the present invention according to jumping figure as basis for estimation, select flexibly to carry out to the one end close to chain rupture place the local reparation of route, break the limitation of traditional unidirectional route repair mode, scope and the distance of route repair be can effectively dwindle, the time delay of route repair and the expense of route control packet reduced.
Brief description of the drawings
Fig. 1 is the overview flow chart of method for repairing route of the present invention described in embodiment;
Fig. 2 is the flow chart of downward route repair process;
Fig. 3 is the flow chart of route repair process upwards;
Fig. 4 is the flow chart of routing update process;
Fig. 5 is the form of routing update notice packet RUNOT;
Fig. 6 is the form of routing update request grouping RUREQ;
Fig. 7 is the form of routing update acknowledgment packet RUREP;
Fig. 8 is the schematic diagram of downward route repair process;
Fig. 9 is the schematic diagram of route repair process upwards;
Figure 10 is the schematic diagram of routing update process.
Embodiment
Four main class route maintenance methods of existing Ad Hoc network routing protocol exist a common defect: they all adopt route " unidirectional " repair mode.No matter where chain rupture place is positioned at, and always, taking the destination node in chain rupture place downstream as repairing direction, carries out route repair.Flexibility is inadequate, especially when chain rupture place from destination node away from time, will bring larger network overhead and time delay.And in network, for individual node, often from it the node close to more to have its route possibility larger, secondly, even if near node does not all arrive its route, so from this node more close to, also can be less for the route RREQ control packet broadcasting area used that is established to it, expense also can be less, and corresponding time delay also can be less.Therefore, in route repair, from repair point of destination more close to, the time delay that route repair is used and control packet are also just less.
The present invention is directed to above problem, a kind of mobile Ad Hoc network bi-directional method for repairing route based on jumping figure has been proposed, taking the jumping figure (distance) of route chain rupture place distance sources node and destination node as basis for estimation, adopt flexibly two-way local routing restorative procedure, the direction that the nearer one end of chosen distance route chain rupture place is route repair, carry out the local reparation of route, the method mainly comprises that following content is (for the ease of representing, the present invention will be called " route repair downwards " taking destination node end as the route repair of route repair direction, to be called " upwards route repair " taking source node end as the route repair of route repair direction, the jumping figure of nodal distance destination node is used
represent, the jumping figure of nodal distance source node is used
represent).
A), after routing link disconnects, relatively select local direction of repairing according to chain rupture place from the jumping figure (distance) of destination node and source node.If chain rupture place is more than or equal to the jumping figure from destination node from the jumping figure of source node, illustrate chain rupture place from destination node close to, carry out downward route repair by the upstream node of chain rupture place.If chain rupture place is less than the jumping figure from destination node from the jumping figure of source node, illustrate chain rupture place from source node close to, carry out upwards route repair by the downstream node of chain rupture place.
It should be noted that, in the Route establishment stage of Ad Hoc network on-demand routing protocol, source node establishes the forward direction route of destination node by the RREP of broadcast RREQ and feedback, route storing the destination node address of this route in the routing table of each node on the way, to the next-hop node address of destination node, to the jumping figure of destination node
etc. information.The method for repairing route that the present invention proposes, require in the Route establishment stage, set up source node to the two-way route between destination node: forward direction route and reverse route simultaneously, oppositely route refers to that destination node arrives the route of source node, this is that appearance is facile at the Ad of channel symmetry Hoc network, simultaneously a lot of Routing Protocols also so do, as AODV agreement.Node only needs to utilize the RREQ grouping of source node broadcast just can be established to easily the reverse route of source node.In reverse route, in node route list, store source node address, to the next-hop node address of source node, to the jumping figure of source node
etc. information.For the ease of calculating and implementing, the present invention is in the Route establishment stage, and RREQ grouping is made as 1 with the jumping figure initial value in RREP grouping, for source node, its
value is made as 0, for destination node, its
value is made as 0.
B), for downward route repair, the upstream node of chain rupture place adopts local mode of repairing, the jumping figure with it apart from destination node
as the broadcasting area ttl value of RREQ, the search condition using destination node address as RREQ, the originating address using source node as RREQ, with the jumping figure of its distance sources node
+ 1 as the jumping figure initial value in RREQ, broadcast RREQ grouping, and wait for RREP packet acknowledgment; If receive RREP grouping in limiting time, route repair success downwards if do not receive, is broadcasted RREQ grouping in network range; If still cannot repair route, broadcast RERR grouping, notify other nodes.
It should be noted that, the present invention is preferably to repair the jumping figure of origination node apart from destination node
as the broadcasting area ttl value of RREQ, dwindle the broadcasting area of RREQ, reduce expense, farthest ensured again the validity of the broadcast of RREQ simultaneously, all do not arrive at all the other nodes under the worst case of effective routing of destination node, this RREQ also has larger possibility to arrive destination node.
C), for route repair upwards, the downstream node of chain rupture place adopts local mode of repairing equally, with the jumping figure of its distance sources node
as the broadcasting area ttl value of RREQ, the search condition using source node address as RREQ, the originating address using destination node as RREQ, the jumping figure with it apart from destination node
+ 1 as the jumping figure initial value in RREQ, broadcast RREQ grouping, and wait for RREP packet acknowledgment; If receive RREP grouping in limiting time, upwards route repair success if do not receive, is broadcasted RREQ grouping in network range; If still cannot repair route, broadcast RERR grouping, notify other nodes.
D) after route repair success, in order to ensure the correct and normal work of route, must carry out routing update by notification source node, ensure that new route believes the consistency of each node-routing information, the jumping figure information in especially each node route list.The present invention preferably adopts following route renewing method: after route repair success, by chain rupture place route repair node along reverse route to sending routing update notice packet RUNOT (Route Update Notice) to source node, source node receives routing update notice packet RUNOT, send routing update request grouping RUREQ (Route Update Requrst) until destination node along forward direction route, each node upgrades its reverse routing iinformation to source node successively on the way.Destination node receives after update request grouping RUREQ, sends routing update acknowledgment packet RUREP (Route Update Reply) until source node along reverse route, and each node upgrades its forward direction routing iinformation to destination node successively on the way.When source node receives after routing update acknowledgment packet RUREP, just complete routing update, just can use new route.
It should be noted that, adopt above-mentioned route renewing method, need to increase by 3 routing update control packets: routing update notice packet RUNOT, routing update request grouping RUREQ, routing update acknowledgment packet RUREP.Wherein, routing update notice packet RUNOT comprises type of message, source node address, destination node address; Routing update request grouping RUREQ comprises type of message, source node address, destination node address, jumping figure, and wherein the initial value of jumping figure is 1; Routing update acknowledgment packet RUREP comprises type of message, source node address, destination node address, jumping figure, and wherein the initial value of jumping figure is 1.The data volume of routing update control packet is less, and routing update only needs the transmitted in both directions of a secondary data, can't increase too many routing cost and time delay.
Understand better for the ease of the public, below in conjunction with accompanying drawing, technical solution of the present invention is further elaborated.
Fig. 1 is the overview flow chart of method for repairing route of the present invention, as shown in the figure, and when after routing link fracture, according to the jumping figure of route chain rupture place distance sources node and destination node
,
judge the direction that local routing is repaired: if
>=
, adopt downward route repair; If
<
, adopt upwards route repair.If route repair success, carries out routing update, otherwise broadcast RERR grouping, notifies all the other nodes.
For allowing the upstream and downstream node of chain rupture place just can independently select accurately route repair direction under intervening, consider the parity of routing node number, find according to statistical law, if upstream node
-
>=-1, downstream node must so
-
>0; If upstream node
-
<-1, downstream node must so
-
<=0.Upstream node
-
>=-1 while downstream node
-
this situation of <=0 is impossible occur, and therefore, preferably, when after route generation chain rupture, the upstream and downstream node of chain rupture place calculates respectively oneself
-
value, if upstream node
-
>=-1, carries out downward route repair automatically with regard to upstream node so; If downstream node
-
<=0, downstream node just carries out upwards route repair automatically so, and both can not clash, and also can not occur simultaneously.
With reference to figure 2, Fig. 2 is the flow chart of downward route repair process, mainly comprises the following steps:
Step 1: when after routing link fracture, the jumping figure to source node and destination node that first upstream node of chain rupture place is stored in table of query and routing
,
, both are compared, if
-
>=-1, performs step 2, otherwise, do not process.
Step 2: take downward route repair, the upstream node of chain rupture place is broadcasted the RREQ grouping taking destination node address as search condition, and the broadcasting area initial value of RREQ is made as the jumping figure of this upstream node apart from destination node, i.e. TTL=
, the origination node address using source node address as RREQ, the jumping figure value that the jumping figure initial value Hop Count in RREQ is made as this upstream node distance sources node adds 1, i.e. Hop Count=
+ 1.
Step 3: the upstream node of chain rupture place, in timing, if do not receive RREP grouping, illustrates route repair failure for the first time, performs step 4, otherwise, execution step 6.
Step 4: the upstream node of chain rupture place is broadcasted RREQ taking destination node address as search condition grouping in network size, carries out secondary route repair, except ttl value, all the other parameters of RREQ arrange identical with the RREQ of route repair for the first time for the second time.
Step 5: if route repair success for the second time performs step 6.Otherwise, execution step 7.
Step 6: the upstream node notification source node of chain rupture place carries out routing update.
Step 7: route repair failure downwards, the upstream node broadcast RERR grouping of chain rupture place, notifies all the other nodes.
With reference to figure 3, Fig. 3 is the FB(flow block) of route repair process upwards, mainly comprises the following steps:
Step 8: when after routing link fracture, the jumping figure to source node and destination node that first downstream node of chain rupture place is stored in table of query and routing
,
, both are compared, if
-
<=0, performs step 9, otherwise, do not process.
Step 9: take upwards route repair, the downstream node of chain rupture place is broadcasted the RREQ grouping taking source node address as search condition, and the broadcasting area TTL initial value of RREQ is made as the jumping figure of this downstream node distance sources node, i.e. TTL=
, the origination node address using destination node address as RREQ, the jumping figure initial value Hop Count in RREQ is made as this upstream node and adds 1 apart from the jumping figure value of destination node, i.e. Hop Count=
+ 1.
Step 10: the downstream node of chain rupture place, in timing, if do not receive RREP grouping, illustrates route repair failure for the first time, performs step 11, otherwise, execution step 13.
Step 11: the downstream node of chain rupture place is broadcasted RREQ taking source node address as search condition grouping in network size, carries out secondary route repair, except ttl value, all the other parameters of RREQ arrange identical with the RREQ of route repair for the first time for the second time.
Step 12: if route repair success for the second time performs step 13.Otherwise, execution step 14.
Step 13: the upstream node notification source node of chain rupture place carries out routing update.
Step 14: upwards route repair failure, the downstream node broadcast RERR grouping of chain rupture place, notifies all the other nodes.
With reference to figure 4, Fig. 4 is the FB(flow block) of routing procedure, no matter is downward route repair, and still route repair upwards, after route repair success, all must be carried out routing update work, mainly comprises the following steps:
Step 15: after route repair success, send a routing update notice packet RUNOT by the route repair node of chain rupture place along the reverse route to source node; Routing update notice packet RUNOT mainly comprises the information such as type of message type, source node address, destination node address, and Fig. 5 has shown a kind of data format of routing update notice packet RUNOT.
Step 16: node receives routing update notice packet RUNOT on the way, basis destination node address information wherein and the upper hop nodal information that forwards this RUNOT successively, the forward direction routing iinformation of destination node oneself is arrived in renewal or interpolation.Source node receives after routing update notice packet RUNOT, according to source node address and destination node address information wherein, with the upper hop node that forwards this RUNOT, first upgrade the next-hop node information to destination node in routing table, then send routing update request grouping RUREQ along forward direction route.Routing update request grouping RUREQ mainly comprises the information such as type of message type, source node address, destination node address, jumping figure, and the jumping figure initial value of RUREQ is made as 1, and Fig. 6 has shown a kind of data format of routing update request grouping RUREQ.
Step 17: node receives after routing update request grouping RUREQ on the way, upgrades successively or add to the reverse routing iinformation of source node address: first, upgrade its jumping figure to source node
jumping figure in=RUREQ, upgrading its next-hop node to source node is the upper hop node that forwards this RUREQ, then, the jumping figure value in RUREQ is added to 1, continues along forward direction routing forwarding, until arrive destination node, has just completed the update all of reverse route.Destination node receives RUREQ, same along reverse route transmission routing update acknowledgment packet RUREP.Routing update request grouping RUREP mainly comprises the information such as type of message type, source node address, destination node address, jumping figure, and the jumping figure initial value of RUREP is made as 1.Fig. 7 has shown a kind of data format of routing update acknowledgment packet RUREP.
Step 18: node receives after routing update acknowledgment packet RUREP on the way, be updated to successively the forward direction routing iinformation of destination node address, process is identical with the process of reverse routing update in step 3, in the time that RUREP arrives source node, and the renewal of the forward direction route that is just over.So far, the two-way route of source node and destination node is just updated successfully, and new route just can normally have been worked.
Fig. 8 is the schematic diagram of downward route repair process.As shown in Figure 8, in network, there is a route S<->A<->B<->C<->E<->D, between link C<->E, there is fracture, now node C, E calculate apart from the jumping figure of source node S and destination node D according to own respectively, for upstream node C
-
>=3-2=1>-1, meets the condition of downward route repair.Corresponding, downstream node E,
-
>=4-1=3>0, does not meet the upwards condition of route repair.Now, chain rupture place downstream node C carries out upwards route repair, and node C is first at TTL=
the RREQ grouping of broadcast taking destination node D as search condition in=2 scopes, the origination node address of this RREQ is made as source node S, and jumping figure initial value Hop Count is made as C and adds 1 to the jumping figure value of source node S, i.e. Hop Count=
+ 1=4.Node J does not arrive the route of destination node D, upgrade or add the route of source node S, then ttl value is subtracted to 1, after jumping figure value Hop Count adds 1, continue to forward this RREQ, when node K receives after this RREQ, finding oneself has the effective routing to destination node D, send RREP grouping along reverse path, when node C receives after RREP grouping, route repair completes downwards, then carry out after routing update, just repair and established new routing link S<->A <-> B<->C<->J<->K<->D.
Fig. 9 is the schematic diagram of route repair process upwards.As shown in Figure 9, in network, there is a route S<->A<->B<->C<->E<->D, between link A<->B, there is fracture, now node A, B calculate apart from the jumping figure of source node S and destination node D according to own respectively, for upstream node A
-
>=1-4=-3<-1, does not meet the condition of downward route repair.Corresponding, downstream node B,
-
>=2-3=-1<=0, meets the upwards condition of route repair.Now, chain rupture place downstream node B carries out upwards route repair, and Node B is first at TTL=
the RREQ grouping of broadcast taking source node S as search condition in=2 scopes, the origination node address of this RREQ is made as destination node D, and jumping figure initial value is made as B and adds 1 to the jumping figure value of destination node D, i.e. Hop Count=
+ 1=4.Node F does not arrive the route of source node S, the route of upgrading or adding destination node D to, then ttl value is subtracted to 1, after jumping figure value Hop Count adds 1, continue to forward this RREQ, when node G receives after this RREQ, finding oneself has the effective routing to source node S, send RREP grouping along reverse path, when Node B receives after RREP grouping, upwards route repair completes, then carry out after routing update, just repair and established new routing link S<->G <->F <->B<->C<->E<->D.
Figure 10 is the schematic diagram of upwards routing update process, adopt the case in Fig. 9 to describe, between link A<->B of former route S<->A<->B<->C<->E<->D, rupture, downstream node B adopts upwards after route repair, set up the new link B<->F <->G <->S to source node S.Route repair completes carries out routing update, Node B is first along link B<->F <->G <->S, send routing update notice packet RUNOT to source node S, node G, F, S receive after RUNOT on the way, according to destination node information and upper hop node wherein, be updated to respectively the forward direction routing iinformation of destination node D.Then, source node S sends route requests grouping RUREQ along forward direction route, its initial jumping figure value is made as 1, node G, F, B, C, E receive after RUREQ on the way, according to jumping figure information and upper hop node wherein, the reverse routing iinformation that is updated to respectively source node S, then adds 1 by the jumping figure of RUREQ, continues to forward until arrive destination node D.Destination node D carries out after reverse routing update, send route replies grouping RUREP along reverse route, its initial jumping figure value is made as 1, node E on the way, C, B, F, G receives after RUREP, according to jumping figure information and upper hop node wherein, be updated to respectively the forward direction routing iinformation of destination node D, then the jumping figure of RUREQ is added to 1, continue to forward until arrive source node S, destination node D carries out after reverse routing update, just completed the renewal of the new route S< of whole piece->G <->F <->B<->C<->E<->D, new route just can normally have been worked.
Claims (5)
1. an Ad Hoc mobile network method for repairing route, is characterized in that, described Ad Hoc mobile network, in the Route establishment stage, set up the forward direction route of source node to destination node, and destination node is to the reverse route of source node simultaneously; After routing link fracture, direction by relatively chain rupture place selects this locality to repair from the jumping figure of destination node and source node: if chain rupture place is more than or equal to the jumping figure from destination node from the jumping figure of source node, undertaken taking destination node as repairing the downward route repair of destination node by the upstream node of chain rupture place; Otherwise, undertaken taking source node as repairing upwards route repair of destination node by the downstream node of chain rupture place.
2. Ad Hoc mobile network method for repairing route as claimed in claim 1, it is characterized in that, described relatively chain rupture place is from the jumping figure of destination node and source node, specifically by the following method: the upstream node of chain rupture place and downstream node calculate respectively and arrive separately the jumping figure of source node and arrive the difference between the jumping figure of destination node; For upstream node, as this difference is more than or equal to-1, chain rupture place is more than or equal to the jumping figure from destination node from the jumping figure of source node; For downstream node, as this difference is less than or equal to 0, chain rupture place is less than the jumping figure from destination node from the jumping figure of source node.
3. Ad Hoc mobile network method for repairing route as claimed in claim 1, it is characterized in that, described downward route repair is specific as follows: the broadcasting area of described upstream node using its jumping figure apart from destination node as RREQ, search condition using destination node address as RREQ, originating address using source node address as RREQ, add 1 as the jumping figure initial value in RREQ using the jumping figure value of its distance sources node, broadcast RREQ grouping, and wait for RREP packet acknowledgment; If receive RREP grouping in limiting time, route repair success downwards if do not receive, is broadcasted RREQ grouping in network range; If still cannot repair route, upstream node broadcast RERR grouping, notifies other nodes.
4. Ad Hoc mobile network method for repairing route as claimed in claim 1, it is characterized in that, described upwards route repair is specific as follows: the broadcasting area of described downstream node using the jumping figure of its distance sources node as RREQ, search condition using source node address as RREQ, originating address using destination node address as RREQ, jumping figure value using it apart from destination node adds 1 as the jumping figure initial value in RREQ, broadcast RREQ grouping, and wait for RREP packet acknowledgment; If receive RREP grouping in limiting time, upwards route repair success if do not receive, is broadcasted RREQ grouping in network range; If still cannot repair route, broadcast RERR grouping, notify other nodes.
5. Ad Hoc mobile network method for repairing route as described in claim 1～4 any one, is characterized in that, when after route repair success, carries out in accordance with the following methods routing update:
The node of being responsible for repairing is along oppositely route is to source node transmission routing update notice packet, and described routing update notice packet comprises type of message, source node address, destination node address;
Node is successively according to the destination node address in the routing update notice packet receiving and the upper hop nodal information that forwards this routing update notice packet on the way, upgrades or adds self forward direction routing iinformation to destination node;
Source node is according to the source node address in received routing update notice packet and destination node address, and forward the upper hop node of this routing update notice packet, first upgrade the next-hop node information to destination node in self routing table, then send routing update request grouping along forward direction route to destination node, described routing update request grouping comprises type of message, source node address, destination node address, jumping figure, and wherein the initial value of jumping figure is 1;
Node upgrades according to the routing update request grouping receiving successively or adds the reverse routing iinformation of source node address on the way: first, upgrading self is the jumping figure in routing update request grouping to the jumping figure of source node, upgrading self is the upper hop node that forwards this routing update request grouping to the next-hop node of source node, then the jumping figure value in routing update request grouping is added to 1 rear continuation along forward direction routing forwarding, until arrive destination node;
Destination node sends routing update acknowledgment packet along reverse route after receiving routing update request grouping, and described routing update acknowledgment packet comprises type of message, source node address, destination node address, jumping figure, and wherein the initial value of jumping figure is 1;
Node upgrades according to the routing update acknowledgment packet that receives successively or adds the forward direction routing iinformation of destination node address on the way: first, upgrading self is the jumping figure in routing update acknowledgment packet to the jumping figure of destination node, upgrading self is the upper hop node that forwards this routing update acknowledgment packet to the next-hop node of destination node, then the jumping figure value in routing update acknowledgment packet is added to 1 rear continuation along reverse routing forwarding, until arrive source node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410148413.4A CN103974365A (en) | 2014-04-14 | 2014-04-14 | Ad Hoc mobile network route restoring method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410148413.4A CN103974365A (en) | 2014-04-14 | 2014-04-14 | Ad Hoc mobile network route restoring method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103974365A true CN103974365A (en) | 2014-08-06 |
Family
ID=51243282
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410148413.4A Pending CN103974365A (en) | 2014-04-14 | 2014-04-14 | Ad Hoc mobile network route restoring method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103974365A (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103986648A (en) * | 2014-05-06 | 2014-08-13 | 安徽理工大学 | Internet-of-Things route repairing method based on link stability and energy sensing |
| CN105120484A (en) * | 2015-08-21 | 2015-12-02 | 华中科技大学 | Method of building communication network current differential emergency protection channel |
| CN105871715A (en) * | 2016-06-08 | 2016-08-17 | 中电华瑞技术有限公司 | Method and device for repairing routing at power-line network |
| CN106034322A (en) * | 2015-03-07 | 2016-10-19 | 北京信威通信技术股份有限公司 | Routing switching method based on chain quality in mobile ad hoc network |
| CN107438279A (en) * | 2017-06-07 | 2017-12-05 | 海信集团有限公司 | The method and device of rerouting in super-intensive network UDN |
| CN110493137A (en) * | 2019-09-12 | 2019-11-22 | 苏州浪潮智能科技有限公司 | A kind of Tiered broadcast method, apparatus and system based on fixed route network |
| CN111465047A (en) * | 2020-04-14 | 2020-07-28 | 深圳芯珑电子技术有限公司 | Real-time route repairing method based on self-organizing network |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101106522A (en) * | 2006-07-11 | 2008-01-16 | 北京邮电大学 | A multi-path routing technology for Ad Hoc network based on tag exchange |
| CN101436997A (en) * | 2008-12-05 | 2009-05-20 | 西安交通大学 | Method for repairing route based on AODV and link fault type |
-
2014
- 2014-04-14 CN CN201410148413.4A patent/CN103974365A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101106522A (en) * | 2006-07-11 | 2008-01-16 | 北京邮电大学 | A multi-path routing technology for Ad Hoc network based on tag exchange |
| CN101436997A (en) * | 2008-12-05 | 2009-05-20 | 西安交通大学 | Method for repairing route based on AODV and link fault type |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103986648A (en) * | 2014-05-06 | 2014-08-13 | 安徽理工大学 | Internet-of-Things route repairing method based on link stability and energy sensing |
| CN103986648B (en) * | 2014-05-06 | 2018-03-20 | 安徽理工大学 | One kind is based on link stability and Energy-aware Internet of Things method for repairing route |
| CN106034322A (en) * | 2015-03-07 | 2016-10-19 | 北京信威通信技术股份有限公司 | Routing switching method based on chain quality in mobile ad hoc network |
| CN105120484A (en) * | 2015-08-21 | 2015-12-02 | 华中科技大学 | Method of building communication network current differential emergency protection channel |
| CN105120484B (en) * | 2015-08-21 | 2019-01-15 | 华中科技大学 | A method of building communication network current differential emergency protection channel |
| CN105871715A (en) * | 2016-06-08 | 2016-08-17 | 中电华瑞技术有限公司 | Method and device for repairing routing at power-line network |
| CN105871715B (en) * | 2016-06-08 | 2019-08-30 | 中电华瑞技术有限公司 | Under a kind of power line network repair way by method and apparatus |
| CN107438279A (en) * | 2017-06-07 | 2017-12-05 | 海信集团有限公司 | The method and device of rerouting in super-intensive network UDN |
| CN107438279B (en) * | 2017-06-07 | 2022-10-14 | 海信集团有限公司 | Method and device for reestablishing route in ultra-dense network UDN |
| CN110493137A (en) * | 2019-09-12 | 2019-11-22 | 苏州浪潮智能科技有限公司 | A kind of Tiered broadcast method, apparatus and system based on fixed route network |
| CN111465047A (en) * | 2020-04-14 | 2020-07-28 | 深圳芯珑电子技术有限公司 | Real-time route repairing method based on self-organizing network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103974365A (en) | Ad Hoc mobile network route restoring method | |
| US9450668B2 (en) | Packet relay system and wireless node | |
| CN101489276B (en) | Multicast routing method for Ad Hoc network | |
| CN104320334A (en) | Centralized routing algorithm in wireless Mesh network | |
| CN102447686A (en) | Routing protocol of AODV (Ad hoc On-Demand Distance Vector Routing) application | |
| CN107071850A (en) | A kind of improved AODV Routing Protocols for being suitable for different motion scene | |
| CN103260211B (en) | A kind of AOMDV method for routing of improvement | |
| CN103476086B (en) | Dynamic multi-path AODV method for routing based on the prediction of node congestion degree | |
| JP2010509877A (en) | Method for establishing a bidirectional data transmission path in a mesh wireless communication network | |
| EP3200404B1 (en) | Content-centric network on-demand distance vector route method | |
| CN106686659A (en) | AOMDV-based energy aware node-disjoint multipath routing algorithm | |
| CN105792312A (en) | Ad-hoc network routing method based on combination of active and passive ways | |
| CN101932062A (en) | Multipath routing method in Ad Hoc network environment | |
| JP2016208509A (en) | Centralized routing method, apparatus and system | |
| JP2012217164A5 (en) | ||
| CN106130905A (en) | The link restoring method of HWMP priori tree route pattern | |
| CN102595458B (en) | Distributed multi-path route-healing method | |
| CN101938804A (en) | Multipath routing protocol suitable for wireless sensing network | |
| Devarajan et al. | An enhanced cluster gateway switch routing protocol (ECGSR) for congestion control using AODV algorithm in MANET | |
| CN109803342A (en) | A kind of unmanned plane method for self-organizing network routing towards balancing energy highly-reliable transmission | |
| CN103415033A (en) | Ad Hoc network on-demand routing protocol establishing and maintaining method based on path collecting | |
| CN107995114A (en) | Delay Tolerant Network method for routing based on Density Clustering | |
| CN104320825A (en) | Ad hoc network route selection method based on repeated game | |
| CN103716242A (en) | Routing method and system | |
| Gruber et al. | Ad hoc routing for cellular coverage extension |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20140806 |