CN105722172A - Rapid route recovering method in wireless chain network - Google Patents
Rapid route recovering method in wireless chain network Download PDFInfo
- Publication number
- CN105722172A CN105722172A CN201610225577.1A CN201610225577A CN105722172A CN 105722172 A CN105722172 A CN 105722172A CN 201610225577 A CN201610225577 A CN 201610225577A CN 105722172 A CN105722172 A CN 105722172A
- Authority
- CN
- China
- Prior art keywords
- node
- mobile node
- route
- target switching
- mobile
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 89
- 230000008569 process Effects 0.000 claims abstract description 58
- 238000011084 recovery Methods 0.000 claims abstract description 42
- 230000000977 initiatory effect Effects 0.000 claims abstract description 4
- 239000003795 chemical substances by application Substances 0.000 claims description 16
- 230000002159 abnormal effect Effects 0.000 claims description 7
- 230000005540 biological transmission Effects 0.000 claims description 7
- 238000012217 deletion Methods 0.000 claims description 7
- 230000037430 deletion Effects 0.000 claims description 7
- 238000013459 approach Methods 0.000 claims description 5
- 238000003672 processing method Methods 0.000 claims description 4
- 230000015572 biosynthetic process Effects 0.000 claims description 3
- 230000009471 action Effects 0.000 claims description 2
- 230000001419 dependent effect Effects 0.000 claims description 2
- 238000012913 prioritisation Methods 0.000 claims description 2
- 238000012545 processing Methods 0.000 claims description 2
- 230000006854 communication Effects 0.000 description 8
- 238000004891 communication Methods 0.000 description 7
- 238000005259 measurement Methods 0.000 description 5
- 241000209094 Oryza Species 0.000 description 3
- 235000007164 Oryza sativa Nutrition 0.000 description 3
- 235000021186 dishes Nutrition 0.000 description 3
- 230000007246 mechanism Effects 0.000 description 3
- 235000009566 rice Nutrition 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000004044 response Effects 0.000 description 2
- 230000032683 aging Effects 0.000 description 1
- 238000012790 confirmation Methods 0.000 description 1
- 230000007123 defense Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000009191 jumping Effects 0.000 description 1
- 238000013508 migration Methods 0.000 description 1
- 230000005012 migration Effects 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 239000003208 petroleum Substances 0.000 description 1
- 238000011160 research Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/56—Provisioning of proxy services
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/248—Connectivity information update
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/34—Modification of an existing route
- H04W40/36—Modification of an existing route due to handover
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides a rapid route recovering method in a wireless chain network. The method at least comprises one of the following two route recovering modes. A first route recovering model comprises following steps of when a moving node switches among different nodes, a target switching node is determined and the target switching node allows to switch the accessing moving node, after a source access node informs the moving node of switching permission, starting a route updating process, wherein the process comprises sub-steps S1 and S2, the sub-step S1 comprises that the source access node sends a route updating message to the target switching node instead of the moving node; and the sub-step S2 comprises that the target switching node reports a switching success message to the source access node and sends another route updating message to the source access node. The second route recovering mode comprises a following step of after the target switching node allows the moving node to switch, directly initiating route updating to the moving node through the source access node or the target switching node. According to the method, rapid switching route recovery of the moving node is realized.
Description
Technical field
The present invention relates to the communications field, particularly relate to the method that in wireless chain or tree-shaped multihop network topology scene, route is quickly recovered.
Background technology
The application of wireless communication system is increasingly extensive, and in particular for some belt-like zones being not suitable for being equipped with wired link, such as scenes such as petroleum pipeline, frontier defense coast defence, wireless chain communication system can play the advantage of its uniqueness, meets the demand in market.
Wireless chain communication system is applicable to chain or tree-shaped topological structure, multiple wireless network node is adopted to form this communication system, being communicated by multiple via nodes between source node and destination node, between each node, collaborative work constitutes a wireless multi-hop chain-shaped network.
Each network node forming wireless chain network has the backbone communication link of both direction, direction away from central control unit defined herein is forward direction, it is reverse near the direction of central control unit, the backbone in two directions can provide for other via nodes or ancillary equipment and access chance, and therefore terminal unit can pass through different node access networks networks.
When mobile node networks and switches in communication process, network topology structure changes, and in network, the routing iinformation of part of nodes lost efficacy, and the business transmission channel arriving mobile node is obstructed.Now, how quickly will lose efficacy route recovery, safeguard routing table information accurately, it is ensured that can carry out Lossless transport to the business of mobile node in handoff procedure or interruption time delay is less, be the key technology of wireless chain network needs research.
Summary of the invention
It is an object of the invention to provide the quick route recovery method that a kind of wireless chain is off the net, it is possible to reduce the learning time of mobile node route in handoff procedure, and then shorten the service disconnection time delay arriving mobile node in handoff procedure；The technical solution used in the present invention is:
Node herein, owing to being the node in wireless chain network, therefore refers to radio node except central control unit, and mobile node is also a radio node；
The quick route recovery method that a kind of wireless chain is off the net, at least includes the one in following two route recovery mode:
The first route recovery mode: switch for mobile node cross-node, when mobile node switches between different nodes, and determine target switching node and target switching node and allowed switching to access mobile node, after source access node notifies that mobile node can switch, start routing update flow process, including two sub-steps:
Sub-step S1, source access node proxy mobile node sends a route updating packet to target switching node, in S1, the type of route updating packet is for deleting route type of message, notifies and makes the routing iinformation to mobile node old in each node of each knot removal from source access node to target switching node path；The old routing iinformation to mobile node refers to that mobile node is when accessing source access node, and each node is the routing iinformation that this mobile node of access generates；
Sub-step S1 specifically includes: after source access node sends, to mobile node, the message allowing switching, positive representation's mobile node initiates routing update process at once, this process purpose is to delete the routing iinformation to mobile node old in each node, source access node sends a route updating packet along source access node to the path of target switching node to target switching node by idle message (eating dishes without rice or wine to refer to air interface, because the present invention is applied to wireless chain network)；Route updating packet in S1 carries deletion route type of message, mobile node mark, target switching node mark and source access node mark；Route updating packet can be forwarded by relevant via node；First source access node deletes the old routing iinformation to mobile node, and confirms that route updating packet is forwarded by down hop forward-path according to target switching node；After each via node receives route updating packet, the mobile node mark according to carrying in route updating packet deletes the old routing iinformation to mobile node, confirms that route updating packet is forwarded by down hop forward-path according to target switching node；After target switching node receives route updating packet, the mobile node mark according to carrying in route updating packet deletes the old routing iinformation to mobile node；
In the process of sub-step S1, each interdependent node can stop to the data of mobile node transmitting, if node supports data to forward and the related data of mobile node containing buffer memory, then the data of the data of the mobile node received and the mobile node of buffer memory are all forwarded to target switching node by this node；So as subsequent communications, it is prevented that the loss of data of mobile node.
Sub-step S2, when mobile node is successfully accessed target switching node, target switching node receives after mobile node is successfully accessed message, target switching node reports handover success message to source access node, and send another route updating packet to source access node, in S2, the type of route updating packet is for adding route type of message, notifies and makes each node from target switching node to access node path, source add the new routing iinformation to mobile node；After the new routing iinformation to mobile node refers to that mobile node is switched to target switching node, each node is the routing iinformation that this mobile node of access generates；
Sub-step S2 specifically includes: when target switching node receives after mobile node is successfully accessed message, can report handover success message to source access node at once, and proxy mobile node initiates routing update process at once；This process purpose is so that in interdependent node to add the new routing iinformation to mobile node: target switching node is first depending on mobile node information and updates oneself routing iinformation to mobile node, then target switching node sends another route updating packet to source access node, and the route updating packet in S2 carries interpolation route type of message, mobile node mark, target switching node mark, source access node mark；Route updating packet in S2 can forward along the path of target switching node-each via node-source access node；Relevant via node and source access node create the new routing iinformation to mobile node according to mobile node information after receiving the route updating packet in S2；
Via node and source access node, after route recovery, communicate according to the new routing iinformation to mobile node；If the mobile node data that present node needs also exist for being forwarded to target switching node have not forwarded, then stop current forwarding task, directly packet is issued mobile node according to the new routing iinformation to mobile node；
The data of buffer memory are carried out for those target switching nodes that are forwarded to caused due to mobile node switching, after target switching node receives the message of mobile node handover success, it is transmitted to mobile node by target switching node, different data services is carried out prioritization then sequential working by mobile node.
If mobile node handover success, so far the whole network completes for the route recovery of mobile node.
The first route recovery mode also includes abnormal conditions processing method during mobile node handoff failure:
Mobile node, in handoff procedure, can access network owing to a variety of causes causes that it fails by target switching node, be specifically divided into following two situation:
A), mobile node time-out does not access network:
If first target switching node finds that mobile node does not network, then reporting the message of source node mobile node handoff failure, the resource of the institute of release simultaneously promising mobile node distribution, including the data message of mobile node that other nodes cushioned are sent；Having deleted the old routing iinformation of mobile node in forwarding in the route updating packet (deleting route type of message) that via node is sent by source access node, now via node does not carry out any action；If first source access node finds that mobile node does not network, directly it is released from the resource as mobile node distribution, including the data message of the mobile node that other nodes cushioned are sent.
B), mobile node is by other node access networks networks outside target switching node:
If source access node or target switching node have received the route updating packet about mobile node sent from other nodes, then source access node or target switching node know mobile node handoff failure, then with sub-step S2, update each to the routing iinformation of mobile node, after renewal, the data about mobile node of respective buffer memory are forwarded according to new route；
The second route recovery mode: switch for mobile node cross-node, after target switching node allows mobile node switching, directly initiating the routing update to mobile node by source access node or target switching node, whole route recovery process has only to send a route updating packet；Including any one in following two routing update process；
Process P1, source access node proxy mobile node initiates routing update process；
Process P2, target switching node proxy mobile node initiates routing update process；
In above-mentioned two process P1 and P2, routing update process is so that route updating packet sends node from message and arrives message receiving node, each node of route updating packet approach, after receiving route updating packet, the routing iinformation to mobile node old according to the information deletion carried in route updating packet adds the new routing iinformation to mobile node simultaneously；
Specifically, process P1, source access node proxy mobile node initiates routing update process:
Source access node is after the message allowing mobile node access receiving target switching node feedback, pass the message to mobile node, initiated routing update process by source access node proxy mobile node simultaneously, until mobile node accessed at target switching node: source node sends a route updating packet to target switching node, this route updating packet carries and deletes and add route type of message, mobile node mark, the new agent node of mobile node and target switching node mark, original agent node of mobile node and source access node and identify；First source access node deletes the routing iinformation of mobile node, adds the new routing iinformation to mobile node (in fact referring to down hop node identification) and updates the routing table of oneself, is then forwarded by route updating packet；The each via node of route updating packet approach in this P1, via node carries out route learning, and route learning process completes following two work:
1) by the old route table items of mobile node identifier lookup oneself carried in route updating packet the routing iinformation deleting the mobile node wherein contained；
2) identified by target switching node, search the route table items of the accessibility target switching node of present node；Extract and down hop is transmitted the representation manners of port by the route table items found and it is combined with the information of mobile node, generate the new route table items to mobile node；The new route table items to mobile node is added in routing table；
Target switching node adds the new routing iinformation to mobile node first in the routing table after receiving the route updating packet in this P1, once receive the message that mobile node completes to access, then follow-up periodicity routing update (if any) is completed by target switching node；
So far, the route recovery process of the whole network terminates；
Specifically, process P2, target switching node proxy mobile node initiates routing update process:
After target switching node sends the message allowing switching, directly adapter is to the routing update process of mobile node: source access node receive that target switching node sends allow the message that mobile node accesses after, the first routing update (if any) of the mobile node of dwelling period；Target switching node can update the route information table of oneself after sending the message allowing to access, the transmission link information that target switching node is corresponding after accessing this node according to mobile node information and mobile node, generate new route table items, new route table items is added in routing table, namely with the addition of the new routing iinformation to mobile node, send a route updating packet to source access node by idle message simultaneously, route updating packet in P2 carries deletion and adds route type of message, mobile node identifies, the new agent node of mobile node and target switching node mark, original agent node of mobile node and source access node mark；Route updating packet in P2 is forwarded by via node, and via node receives the laggard row route learning of route updating packet, and this route learning process processing mode is consistent with process P1；
After source access node receives the route updating packet that target switching node is sent, carry out the updating route information to mobile node；Target switching node receives the message of mobile node handover success, and interdependent node routing update terminates along with handoff procedure.
So far, the route recovery of the whole network completes.
The second route recovery mode also includes abnormal conditions processing method during mobile node handoff failure:
In above procedure P1, P2, if mobile node fails to access network by target switching node due to a variety of causes, then:
C) mobile node time-out does not access network:
The node being carried out routing update by current agent mobile node stops carrying out routing update, and sending a dependent routing information (aging mechanism or message mechanism can be passed through) routeing stopping renewal other knot removal mobile nodes of message notifying, this route stops carry the contents such as deletion route type of message, mobile node identifies, the new agent point mark of original agent point mark of mobile node, mobile node in renewal message；
D) mobile node passes through other node access networks networks:
If the node that current agent mobile node carries out routing update have received the relevant route updating packet of mobile node that other node is sent, it is only necessary to stops carrying out routing update agency.The resource release of other node under this abnormal conditions is completed by handoff procedure, and the present invention is not related to.
Two kinds of through streets described above are by reset mode, the range of scatter of route relates only to source access node, relevant via node and target switching node, transmission path jumping figure is less, the mode forwarded by message has been traveled through because mobile node switching must the node of more new routing information again, all nodes of the whole network need not be related to, routing iinformation recovers fast, and the business interrupted in mobile node switching process transmission can be carried out lossless migration, it is ensured that the reliability of information transmission.Routing mode for those non-forward or inverses, it is possible to be diffused into whole network by the mode of breadth First.
Needing it is emphasized that the scene of mobile node described above switching, target switching node and source access node are separated by multi-hop, and when the neighbor node that target switching node is source access node, the present invention proposes a kind of more efficient way.This method is without at transmission routing update message of eating dishes without rice or wine, and route recovery process and mobile node switching process are synchronously performed, and when switching completes, route recovery completes.
For the scene that mobile node switches at neighbor cell node, it is proposed that the third route recovery mode:
Under this scene, the whole network need the node of more new routing information relate only to source access node and target switching node (source access node and target switching node are also likely to be same node).The concrete grammar of its amendment routing iinformation is as follows:
Source access node obtains the mobile node information switched and target switching node information in the flow process that mobile node switches；When determining that mobile node is walked from the switching of this node, just the routing iinformation of the mobile node in self route table items is deleted；And the information of target switching node is combined with the information of mobile node the new route table items of formation adds in routing table；
Target switching node obtains the mobile node information switched in the flow process that mobile node switches；After determining that mobile node is successfully accessed, the routing iinformation of mobile node old in routing table is deleted, adds new route table items, namely add the routing iinformation being pointing directly at mobile node.
Target switching node completes old routing iinformation and deletes and after new routing information interpolation, and the whole network route route recovery completes.
It is an advantage of the current invention that: quickly by the route recovery that lost efficacy, routing table information accurately can be safeguarded, it is ensured that in handoff procedure, Lossless transport can be carried out to the business of mobile node or interruption time delay is less.
Accompanying drawing explanation
Fig. 1 is the mobile node cross-node handoff scenario schematic diagram of the present invention.
Fig. 2 is that the mobile node of the present invention is at neighbor cell node handoff scenario schematic diagram.
The flow chart of route recovery when Fig. 3 is the mobile node switching of the present invention.
Detailed description of the invention
Following by drawings and Examples, technical scheme is described in further detail.Which kind of handover mechanism method is method described in the invention for adopting be not restricted by, and for convenience of description, the present invention will be described with a kind of concrete changing method for embodiment, but do not limit to and this.
Wireless chain Netcom crosses a central control unit (CCU) and accesses network, and other node is sequentially ingressed into by central control unit, and in literary composition, regulation deviates from the direction of central control unit is forward direction, is reverse near the direction of central control unit.Each node in link has respective node identification (can make a distinction), each node record in the routing table of oneself: the node identification of all nodes of its forward direction and a reverse hop node with No. ID.When routeing, first look at forward direction one hop neighbor whether destination node is oneself, if so, then directly deliver a packet to destination node；If it is not, then check whether destination node is present in the forward extent of oneself, if so, then send the packet within the next-hop node of a forward direction, if it is not, then deliver a packet to the reverse hop node of oneself.Namely link is for accelerating to search speed, gives tacit consent to and only carry out forward direction lookup in routing procedure, if forward direction route less than reversely searching again, system realizes the routing function in whole piece link by this kind of form.
In conjunction with accompanying drawing 1, when mobile node carries out cross-node switching, according to the first route recovery mode, specifically comprise the following steps that
1) mobile node networks, access node 3, and node 3 is as source access node, and in mobile node moving process, mobile node is switched over measurement configuration by node 3；
2) mobile node is based on measuring configuration measurement, if triggering measurement event, initiated to periodically measurement reports；
3) node 3 receives and carries out switch decision after measurement reports, it is determined that target switching node is node 6, sends handover request to node 6；
4), after node receives handover request, the response of switching is allowed to node 3 feedback；
5) node 3 is after receiving the response allowing to access, sending switching command to mobile node, after switching command is sent completely, positive representation's mobile node sends route updating packet to node 6, this message carries type of message (deleting route type of message), No. ID of target switching node 6, is designated as N_6, No. ID of source access node, it is designated as N_3, and mobile node No. ID, it being designated as M_1, route updating packet can forward arrival node 6 by the multiple via node of approach；
6) from source access node 3, each via node, after receiving route updating packet (deleting route type of message), proceeds as follows:
Node 3: search routing table according to the ID M_1 of mobile node, it has been found that contain the routing iinformation of M_1 in the routing table of oneself, the old routing iinformation for mobile node is deleted；ID N_6 according to the target switching node carried in route updating packet, the forwarding address finding message down hop is node 2；Forward route updating packet to next-hop node 2；Stop to the data of mobile node transmitting, if the now buffer memory related data of mobile node, then need to forward the data to target switching node, it is determined that forward the data to next-hop node 2；
Node 2: after node 2 receives route updating packet, (above regulation routing table lookup order is defaulted as forward direction lookup to carry out forward direction lookup in oneself routing table, if searched less than relevant search item, automatically carry out reversely searching) finds the routing iinformation containing arrival mobile node in oneself routing table according to the ID M_1 of mobile node, that is: N_2-N_3, deletes the routing iinformation in this Geju City；According to target switching node ID N_6, finding and arrive node 6 by N_2-N_4, down hop forwarding address is node 4；Forward route updating packet to next-hop node 4；Stop node 2 transmits to the related data of mobile node, if the now buffer memory related data of mobile node, by own cache and data about mobile node that node 3 forwards be forwarded to next-hop node 4；
Node 4: after node 4 receives route updating packet, first finds in routing table without the directional information to mobile node haveing been friends in the past according to M_1 forward direction；Finding down hop message forwarding address further according to N_6 is node 5, i.e. N_4-N-5；Forward route updating packet to next-hop node 5；Stop node 4 transmits to the related data of mobile node, and by own cache and the data about mobile node that forward of node 2 be forwarded to node 5；
Target switching node 6: after node 6 receives route updating packet, first delete oneself old routing iinformation (not having the routing iinformation to mobile node if original in certain target switching node 6, then without carrying out deleting the operation of the old routing iinformation to mobile node) according to M_1；Receive the data about mobile node that each node forwards；After node 6 receives the message that mobile node accesses, the data received can be delivered to mobile node, mobile node take over；Node 6 sends a message to source access node 3 and informs handover success, sends a new route updating packet (adding route type of message) simultaneously and initiates the routing update process of a new round.
7) the routing update process initiated by node 6 proxy mobile node, owing to adopting different routing plans, the range of nodes of notice is different, makes its counter-notification node 5, node 4, node 2, node 3 in an embodiment, and the range of scatter namely routeing is part of nodes.Specific operation process is:
Node 6: first search routing table according to mobile node M_1, it has been found that be absent from this route table items, be then added to the routing table of oneself；The data about mobile node forwarded from other nodes received are issued mobile node according to the new route to mobile node, mobile node order-preserving carries out subsequent operation；Searching routing table, confirmation message down hop forwarding address is that node 5(reversely to search herein, because sweep forward is less than node 3)；Route updating packet (adding route type of message) is sent to node 5；Route updating packet carries interpolation route type of message, mobile node ID M_1, target switching node ID N_6, source access node ID N_3 in (adding route type of message)；
Node 5: receive route updating packet (adding route type of message) and first search routing table according to the M_1 carried in message, it has been found that be absent from this list item in table, then the new list item arriving mobile node be added in oneself routing table；Down hop forwarding address is confirmed according to N_3；Route updating packet (adding route type of message) is forwarded to node 4；It is confirmed whether the data containing the mobile node to node 6 not forwarded, if it has, then stop forwarding, issues M_1 according to the new routing iinformation to mobile node；
Node 4: operation is with node 5；
Node 2: operation is with node 5；
Node 3: operation is with node 5；
8) after node 3 completes renewal routing operations, so far, the route recovery of the whole network completes.
If abnormal situation, node 3 is after informing that mobile node can switch to node 6, a period of time interior nodes 6 does not receive the message that mobile node is successfully accessed, but have received the route updating packet about renewal mobile node that node 5 is sent, node 6 is aware of mobile node handoff failure, has accessed node 5.Node 6 can send the message of handoff failure to node 3, and advised nodes 3 mobile node has accessed node 5, and then node 3 and node 6 update respective routing iinformation, and renewal process is with step 7.After renewal, the data of the mobile node of respective buffer memory are forwarded according to new route.
When mobile node carries out cross-node switching, according to the second route recovery mode, still for Fig. 1, step is as follows:
1) node 3 is after receiving the message allowing switching that node 6 is sent, and informs mobile node, and proxy mobile node initiates routing update process (node 6 can also be had to initiate, this sentences source access node initiation citing and illustrates).Node 3 sends a route updating packet can also be sent this message by mobile node to node 6(after mobile node receives switching command), route updating packet carries type of message (delete and add route type of message), No. ID of target switching node 6, it is designated as N_6, and mobile node No. ID, it is designated as M_1, source access node ID, is designated as N_3；Route updating packet can be forwarded by multiple via nodes and arrive node 6.
2) from node 3, each via node proceeds by route learning after receiving route updating packet.Operate as follows:
Node 3: search routing table according to the ID M_1 of mobile node, it has been found that contain the routing iinformation of M_1 in the routing table of oneself, the old routing iinformation for mobile node is deleted；ID N_6 according to the target switching node carried in route updating packet, the forwarding address finding route updating packet down hop is node 2；Add the new directional information to mobile node；
Node 2: carry out forward direction lookup according to M_1 in the routing table, it has been found that containing the directional information arriving mobile node in the routing table of oneself, it may be assumed that N_2-N_3, the routing iinformation in this Geju City is deleted；Find have new mobile node to add in the forward link of oneself according to target switching node ID N_6, set up new route table items in the routing table: add M_1；Find according to target switching node ID N_6 and can pass through N_2-N_4 arrival node 6, route updating packet is transmitted to next hop address and node 4；
Node 4: find in routing table the directional information without the mobile node haveing been friends in the past according to M_1 forward direction, finding down hop message forwarding address further according to N_6 is node 5, i.e. N_4-N-5, then find that forward link has new mobile node to access, need to adding new route table items: M_1, route updating packet is forwarded after completing by the routing table update of node 4；
Node 5: operation is with node 4；
Node 6: after target switching node 6 receives route updating packet, updates the routing table of oneself, adds new route table items: M_1.When, after the message receiving mobile node handover success, follow-up periodicity routing update (if any) is completed by target switching node 6；
If abnormal situation, mobile node handoff failure, as source access node 3 have received the route updating packet of the mobile node sent from node 5, node 3 is aware of mobile node and has been switched to node 5, and now node 3 has only to stop carrying out the routing update of mobile node is acted on behalf of.
Accompanying drawing 2 gives the exemplary plot that mobile node switches at neighbor cell node, and now without sending information of eating dishes without rice or wine, the step of route recovery is more simple:
1) in conjunction with Fig. 2, mobile node networks, and access node 3, in the process of movement, it is necessary to be switched to node 4 and node 4 allows to access；
2) node 3 is when determining that mobile node is walked from the switching of this node, is just deleted by the routing iinformation of mobile node in self route table items；And node 4 is combined with the information of mobile node the new route table items of formation adds in routing table；
3) node 4 is after determining that mobile node is successfully accessed, and is deleted by the routing iinformation of mobile node old in routing table, adds new route table items, namely adds the routing iinformation being pointing directly at mobile node；
4) route recovery completes along with handoff procedure.
The routing iinformation pertaining only to source access node 3 and target switching node 4 in whole handoff procedure recovers.
The flow chart routeing fast quick-recovery is shown in accompanying drawing 3.
Claims (7)
1. the quick route recovery method that wireless chain is off the net, at least includes the one in following two route recovery mode:
The first route recovery mode: switch for mobile node cross-node, when mobile node switches between different nodes, and determine target switching node and target switching node and allowed switching to access mobile node, after source access node notifies that mobile node can switch, start routing update flow process, including sub-step S1 and S2:
Sub-step S1, source access node proxy mobile node sends a route updating packet to target switching node, in S1, the type of route updating packet is for deleting route type of message, notifies and makes the routing iinformation to mobile node old in each node of each knot removal from source access node to target switching node path；
Sub-step S2, when mobile node is successfully accessed target switching node, target switching node receives after mobile node is successfully accessed message, target switching node reports handover success message to source access node, and send another route updating packet to source access node, in S2, the type of route updating packet is for adding route type of message, notifies and makes each node from target switching node to access node path, source add the new routing iinformation to mobile node；
The second route recovery mode: switch for mobile node cross-node, after target switching node allows mobile node switching, directly initiating the routing update to mobile node by source access node or target switching node, whole route recovery process has only to send a route updating packet；Including any one in following two routing update process；
Process P1, source access node proxy mobile node initiates routing update process；
Process P2, target switching node proxy mobile node initiates routing update process；
In above-mentioned two process P1 and P2, routing update process is so that route updating packet sends node from message and arrives message receiving node, each node of route updating packet approach, after receiving route updating packet, the routing iinformation to mobile node old according to the information deletion carried in route updating packet adds the new routing iinformation to mobile node simultaneously.
2. the quick route recovery method that wireless chain as claimed in claim 1 is off the net, it is characterised in that:
Sub-step S1 specifically includes: after source access node sends, to mobile node, the message allowing switching, positive representation's mobile node initiates routing update process at once, and source access node sends a route updating packet along source access node to the path of target switching node to target switching node by idle message；Route updating packet in S1 carries deletion route type of message, mobile node mark, target switching node mark and source access node mark；Route updating packet can be forwarded by relevant via node；First source access node deletes the old routing iinformation to mobile node, and confirms that route updating packet is forwarded by down hop forward-path according to target switching node；After each via node receives route updating packet, the mobile node mark according to carrying in route updating packet deletes the old routing iinformation to mobile node, confirms that route updating packet is forwarded by down hop forward-path according to target switching node；After target switching node receives route updating packet, the mobile node mark according to carrying in route updating packet deletes the old routing iinformation to mobile node；
In the process of sub-step S1, each interdependent node can stop to the data of mobile node transmitting, if node supports data to forward and the related data of mobile node containing buffer memory, then the data of the data of the mobile node received and the mobile node of buffer memory are all forwarded to target switching node by this node.
3. the quick route recovery method that wireless chain as claimed in claim 1 is off the net, it is characterised in that:
Sub-step S2 specifically includes: when target switching node receives after mobile node is successfully accessed message, can report handover success message to source access node at once, and proxy mobile node initiates routing update process at once；Target switching node is first depending on mobile node information and updates oneself routing iinformation to mobile node, then target switching node sends another route updating packet to source access node, and the route updating packet in S2 carries interpolation route type of message, mobile node mark, target switching node mark, source access node mark；Route updating packet in S2 can forward along the path of target switching node-each via node-source access node；Relevant via node and source access node create the new routing iinformation to mobile node according to mobile node information after receiving the route updating packet in S2；
Via node and source access node, after route recovery, communicate according to the new routing iinformation to mobile node；If the mobile node data that present node needs also exist for being forwarded to target switching node have not forwarded, then stop current forwarding task, directly packet is issued mobile node according to the new routing iinformation to mobile node；
The data of buffer memory are carried out for those target switching nodes that are forwarded to caused due to mobile node switching, after target switching node receives the message of mobile node handover success, it is transmitted to mobile node by target switching node, different data services is carried out prioritization then sequential working by mobile node.
4. the quick route recovery method that wireless chain as claimed in claim 1 is off the net, it is characterised in that:
The first route recovery mode also includes abnormal conditions processing method during mobile node handoff failure:
A), mobile node time-out does not access network:
If first target switching node finds that mobile node does not network, then reporting the message of source node mobile node handoff failure, the resource of the institute of release simultaneously promising mobile node distribution, including the data message of mobile node that other nodes cushioned are sent；Now via node does not carry out any action；If first source access node finds that mobile node does not network, directly it is released from the resource as mobile node distribution, including the data message of the mobile node that other nodes cushioned are sent；
B), mobile node is by other node access networks networks outside target switching node:
If source access node or target switching node have received the route updating packet about mobile node sent from other nodes, then source access node or target switching node know mobile node handoff failure, then with sub-step S2, update each to the routing iinformation of mobile node, after renewal, the data about mobile node of respective buffer memory are forwarded according to new route.
5. the quick route recovery method that wireless chain as claimed in claim 1 is off the net, it is characterised in that:
Process P1, source access node proxy mobile node initiates routing update process, specifically includes:
Source access node is after the message allowing mobile node access receiving target switching node feedback, pass the message to mobile node, initiated routing update process by source access node proxy mobile node simultaneously, until mobile node accessed at target switching node: source node sends a route updating packet to target switching node, this route updating packet carries and deletes and add route type of message, mobile node mark, the new agent node of mobile node and target switching node mark, original agent node of mobile node and source access node and identify；First source access node deletes the routing iinformation of mobile node, adds the routing table of the new updating route information to mobile node oneself, is then forwarded by route updating packet；The each via node of route updating packet approach in this P1, via node carries out route learning, and route learning process completes following two work:
1) by the old route table items of mobile node identifier lookup oneself carried in route updating packet the routing iinformation deleting the mobile node wherein contained；
2) identified by target switching node, search the route table items of the accessibility target switching node of present node；Extract and down hop is transmitted the representation manners of port by the route table items found and it is combined with the information of mobile node, generate the new route table items to mobile node；The new route table items to mobile node is added in routing table；
Target switching node adds the new routing iinformation to mobile node first in the routing table after receiving the route updating packet in this P1, once receive the message that mobile node completes to access, if need periodically routing update follow-up, then follow-up periodicity routing update is completed by target switching node；
Process P2, target switching node proxy mobile node initiates routing update process, specifically includes:
After target switching node sends the message allowing switching, directly adapter is to the routing update process of mobile node: source access node receive that target switching node sends allow the message that mobile node accesses after, the first routing update of the mobile node of dwelling period；Target switching node can update the route information table of oneself after sending the message allowing to access, the transmission link information that target switching node is corresponding after accessing this node according to mobile node information and mobile node, generate new route table items, new route table items is added in routing table, namely with the addition of the new routing iinformation to mobile node, send a route updating packet to source access node by idle message simultaneously, route updating packet in P2 carries deletion and adds route type of message, mobile node identifies, the new agent node of mobile node and target switching node mark, original agent node of mobile node and source access node mark；Route updating packet in P2 is forwarded by via node, and via node receives the laggard row route learning of route updating packet, and this route learning process processing mode is consistent with process P1；
After source access node receives the route updating packet that target switching node is sent, carry out the updating route information to mobile node；Target switching node receives the message of mobile node handover success, and interdependent node routing update terminates along with handoff procedure.
6. the quick route recovery method that wireless chain as claimed in claim 1 is off the net, it is characterised in that:
The second route recovery mode also includes abnormal conditions processing method during mobile node handoff failure:
In process P1, P2, if mobile node fails to access network by target switching node, then:
C) mobile node time-out does not access network:
The node being carried out routing update by current agent mobile node stops carrying out routing update, and send a route and stop updating the dependent routing information of other knot removal mobile nodes of message notifying, this route stops updating in message and carries the new agent point mark deleting route type of message, mobile node mark, original agent point mark of mobile node, mobile node；
D) mobile node passes through other node access networks networks:
If the node that current agent mobile node carries out routing update have received the relevant route updating packet of mobile node that other node is sent, it is only necessary to stops carrying out routing update agency.
7. the quick route recovery method that wireless chain as claimed in claim 1 is off the net, it is characterised in that:
For the scene that mobile node switches at neighbor cell node, adopt the third route recovery mode:
Source access node obtains the mobile node information switched and target switching node information in the flow process that mobile node switches；When determining that mobile node is walked from the switching of this node, just the routing iinformation of the mobile node in self route table items is deleted；And the information of target switching node is combined with the information of mobile node the new route table items of formation adds in routing table；
Target switching node obtains the mobile node information switched in the flow process that mobile node switches；After determining that mobile node is successfully accessed, the routing iinformation of mobile node old in routing table is deleted, adds new route table items, namely add the routing iinformation being pointing directly at mobile node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610225577.1A CN105722172B (en) | 2016-04-12 | 2016-04-12 | Wireless chain quick route recovery method off the net |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610225577.1A CN105722172B (en) | 2016-04-12 | 2016-04-12 | Wireless chain quick route recovery method off the net |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105722172A true CN105722172A (en) | 2016-06-29 |
| CN105722172B CN105722172B (en) | 2019-04-02 |
Family
ID=56159853
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610225577.1A Expired - Fee Related CN105722172B (en) | 2016-04-12 | 2016-04-12 | Wireless chain quick route recovery method off the net |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105722172B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2019158053A1 (en) * | 2018-02-13 | 2019-08-22 | 华为技术有限公司 | Routing updating method and device, and scheduling request canceling method and device |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2006138575A2 (en) * | 2005-06-16 | 2006-12-28 | Qualcomm Incorporated | Handoffs in a meshed wireless system |
| CN101442773A (en) * | 2007-11-21 | 2009-05-27 | 上海寰创通信科技有限公司 | Rapid switching method for wireless netted network |
| CN101534238A (en) * | 2008-03-14 | 2009-09-16 | 华为技术有限公司 | Method, node and system for notifying agent update in wireless Mesh network |
| CN101827410A (en) * | 2009-03-04 | 2010-09-08 | 香港理工大学 | Switching method for wireless mesh network |
| CN104618980A (en) * | 2015-03-05 | 2015-05-13 | 江苏物联网研究发展中心 | Routing implementation method for wireless multi-hop chain network |
-
2016
- 2016-04-12 CN CN201610225577.1A patent/CN105722172B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2006138575A2 (en) * | 2005-06-16 | 2006-12-28 | Qualcomm Incorporated | Handoffs in a meshed wireless system |
| CN101442773A (en) * | 2007-11-21 | 2009-05-27 | 上海寰创通信科技有限公司 | Rapid switching method for wireless netted network |
| CN101534238A (en) * | 2008-03-14 | 2009-09-16 | 华为技术有限公司 | Method, node and system for notifying agent update in wireless Mesh network |
| CN101827410A (en) * | 2009-03-04 | 2010-09-08 | 香港理工大学 | Switching method for wireless mesh network |
| CN104618980A (en) * | 2015-03-05 | 2015-05-13 | 江苏物联网研究发展中心 | Routing implementation method for wireless multi-hop chain network |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2019158053A1 (en) * | 2018-02-13 | 2019-08-22 | 华为技术有限公司 | Routing updating method and device, and scheduling request canceling method and device |
| US11044740B2 (en) | 2018-02-13 | 2021-06-22 | Huawei Technologies Co., Ltd. | Route update method, scheduling request cancellation method, and device |
| US11671959B2 (en) | 2018-02-13 | 2023-06-06 | Huawei Technologies Co., Ltd. | Route update method, scheduling request cancellation method, and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105722172B (en) | 2019-04-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8473633B2 (en) | Method of routing packets in a packet network | |
| US7424295B2 (en) | Handover control apparatus, base station, edge router, relay router, radio terminal unit, mobile communication system, and handover control method | |
| CN103561442A (en) | Data transmission method for mobile receiver in publish-subscribe internet technology | |
| JP3727309B2 (en) | Packet communication system | |
| JP6183536B2 (en) | Node device and communication method used in Description / Delay / Disconnect Tolerant Network | |
| CN102957573A (en) | Path detection realizing method and node | |
| CN106954243A (en) | Route implementation method based on wireless chain network | |
| US9504020B2 (en) | Method for exchanging information between communication terminals, and communication terminal | |
| CN109511151A (en) | The network-building method and communication means of star networking | |
| CN102325079A (en) | Message transmission method and egress router | |
| Choi et al. | A network-based seamless handover scheme for VANETs | |
| KR20080053872A (en) | Mobile network system and method for processing ip handoff thereof | |
| US8208465B2 (en) | Apparatus and method for controlling multicast in multi hop networks | |
| JP4574193B2 (en) | Mobile communication network system and mobility management apparatus | |
| CN105722172A (en) | Rapid route recovering method in wireless chain network | |
| CN102801562B (en) | Transmission link switching method and device and network equipment | |
| CN102026330A (en) | Method for improving availability of ad hoc network | |
| KR101598109B1 (en) | Method and system for robust distributed mobility management | |
| JP4847580B2 (en) | Method and apparatus for routing packets in a mobile IP system | |
| JP3965202B1 (en) | Network communication equipment and communication program for ring network. | |
| KR101422516B1 (en) | Node device having a function of traffic load management for content sharing service in delay tolerant network and method for traffic load management | |
| Poonguzharselvi et al. | Data forwarding in opportunistic network using mobile traces | |
| JP2011171804A (en) | Network system and route retrieval method | |
| KR20150006747A (en) | Method and apparatus for forwarding packet in id/locator separation envirionment | |
| JP2011142456A (en) | Communication equipment, communication method and communication 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| PP01 | Preservation of patent right |
Effective date of registration: 20230905 Granted publication date: 20190402 |
|
| PP01 | Preservation of patent right | ||
| PD01 | Discharge of preservation of patent |
Date of cancellation: 20240119 Granted publication date: 20190402 |
|
| PD01 | Discharge of preservation of patent | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190402 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |