CN102026330A - Method for improving availability of ad hoc network - Google Patents
Method for improving availability of ad hoc network Download PDFInfo
- Publication number
- CN102026330A CN102026330A CN2009101901485A CN200910190148A CN102026330A CN 102026330 A CN102026330 A CN 102026330A CN 2009101901485 A CN2009101901485 A CN 2009101901485A CN 200910190148 A CN200910190148 A CN 200910190148A CN 102026330 A CN102026330 A CN 102026330A
- Authority
- CN
- China
- Prior art keywords
- route
- node
- source node
- message
- destination
- 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
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a method for improving the availability of ad hoc network, belonging to the technical field of network communication, and solving the problem that the data is interrupted when a new route is established after the present route is void in the traditional ad hoc network route protocol. The method comprises the following steps of: in the process of establishing a route between a source node and a target node, saving a plurality of routes pointing to the target node by the source node, and selecting one optimal route as the current route; and if the current route is void, selecting one saved route as the current route of the source node pointing to the target node by the source node. By the accumulated information of the ad hoc network route protocol in the process of establishing route, a plurality of routes are established; and when all optimal routes between the source node and the target node are void, the source node can always immediately start one optimal route as the default route so as to make data current not to be interrupted and ensure the availability of the network.
Description
Technical field
The present invention relates to a kind of improved self-organizing network Routing Protocol, belong to network communications technology field.
Background technology
Routing Protocol is divided into two kinds usually: active and passive type.
Active route is meant in the network, and a route was just set up before being requested.As OLSR (RFC3626) agreement, each routing device, fixed time broadcast sends HELLO message, topology (TC) message, main frame and network associate (HNA) message.Except that HELLO message, all the other message send (flood) to whole network; Any one routing device is determined to arrive the route of neighbor node and two-hop neighbors according to HELLO message, and is determined to the route of three hop nodes according to the TC message of two-hop neighbors, and according to this in proper order, determines to arrive the route of all nodes on the network; According to the HNA message of each node, the route of definite subnet that links to each other with each node.
Passive route is meant to have only when a route and is clearly asked that equipment just can send route messages, and sets up this route.As AODV (RFC3561) agreement, when this router need be transmitted a packet and not have needed route, just can be to the whole network broadcast transmission route requests (REQ) message; Receive the node of route request information, at first set up the route that arrives source node, judge the if there is no route of destination node correspondence then, then continue this message of broadcasting, otherwise this routing device (comprising destination node) can send route replies (REP) message to source node; Receive the routing device of route replies message, at first upgrade the route that arrives destination node, transmit this route replies message to source node then, no longer transmit up to source node; When a route of using lost efficacy, detect the node that this route lost efficacy, need send routing failure (RERR) message to the node that uses this route; Receive the node of RERR message, the corresponding route that this node of mark has existed lost efficacy, and may generate new RERR message.
In the AODV agreement, in order to reduce the RERR broadcast, require each node when transmitting REP message, do following processing: because REP message is to transmit to the source node of route, so this node should at first check whether set up the route that arrives source node, if there is no this route is not then transmitted this REP message, if exist then this REP message just is forwarded to the next-hop node of this route, and the forerunner node of this node as the pairing arrival destination node of this REP message route.A route lost efficacy on node, needed all associated forerunner's nodes of this route of retrieval, if there is not forerunner's node, did not then send RERR, if having only forerunner's node, then sent RERR to this forerunner's node clean culture, otherwise broadcast transmission RERR.
Above-mentioned all route messages can only be forwarded, and can not be routed.That is to say that from the route messages that a router sends, the source address in its IP heading all is filled to be the IP address (when general data was routed, source IP address can not be routed device change) of this router.Further, receive a route messages, just can from this message IP heading, know it is that this message by which router is sent, and can be used as neighbours to it.Although mention IP here, also can other agreement as the message bearing body, in the 802.11s draft, on the MAC layer, realize the agreement of similar AODV, the IP address that at this moment is filled is exactly the MAC Address that sends the node of message.
Therefore, in the self-organizing network Routing Protocol of routine, between source node and destination node, only set up a route, perhaps the record route of short jumping figure only calls optimum route to such route.When this optimum route lost efficacy, need to rely on initiatively or passive routing mode, set up new optimum route.But route lost efficacy constantly and new route was set up the delay that successfully has between the moment between not timing, in this section, did not have available route between source node and the destination node time of delay, can cause data interruption.
Summary of the invention
For solve the problem that losing efficacy from current route of existing can be caused data interruption to the process of setting up new route in existing self-organizing network Routing Protocol, the invention provides a kind of method that improves the self-organizing network availability, it comprises:
The present invention sets up the information that accumulates in the process by the self-organizing network Routing Protocol in route, sets up many routes, does not introduce unnecessary expense; When all optimum routes all lost efficacy between source node and the destination node, source node always can be enabled a hypo-optimal route immediately as default route, makes data flow not be interrupted, and guaranteed the availability of network.
Description of drawings
Fig. 1 is a method flow schematic diagram of the present invention;
Fig. 2 is the multirouting annexation schematic diagram between two nodes in embodiment;
Fig. 3 increases the method flow schematic diagram of seeking and setting up optimum route in embodiment.
Embodiment
In the technical scheme of a kind of method that improves the self-organizing network availability that this embodiment provides, as shown in Figure 1, specifically can comprise:
Further, the route that source node is preserved a plurality of sensing destination nodes comprises that source node points to the optimum route and the hypo-optimal route of destination node, optimum route and hypo-optimal route can offer QoS (Service Quality Management) administrative unit, and the realization of QoS can be more flexible.And as shown in Figure 3, can also comprise after step 2: step 3, source node continue to seek and set up optimum route as current route again.After using hypo-optimal route, source node still can continue to seek and set up optimum route, can not influence the performance of network, optimum route can also be promoted later the performance of network as current route.
Technical scheme for clearer this embodiment of explanation provides now is elaborated to this method in conjunction with Fig. 2:
From node 1 to node 5, there are 3 possible routes at least:
The A route through node 2,3 and 4, arrives node 5 from node 1, totally 4 jumps;
The B route through node 6,7,8 and 4, arrives node 5 from node 1, totally 5 jumps;
The C route through node 9,3 and 4, arrives node 5 from node 1, totally 4 jumps.
In the prior art, only write down shortest path by A, perhaps shortest path is by A and C.In this embodiment, source node writes down route A, B and C simultaneously, when losing efficacy with slave node 3, is transformed into route B from route A or C.
If to set up process be passive type to route, node 1 broadcast transmission route request information then, other node except node 5, is all transmitted this route request information, and node 5 receives these route request information and no longer transmits.In this process, all nodes are all set up the route that destination address is a node 1.Node 5 sends route replies message to node 1, and node 4 receives the back and transmits this route replies message.Node 4 message is in view of the above set up the route that destination address is a node 5.Node 4 is transmitted route replies message to node 3 and node 8, and node 3 and node 8 are recorded as forerunner's node that destination address is the route of node 5.Node 3 and node 8 continue to transmit route replies message to node 1, receive route replies message up to node 1.Node 1 may be from node 9, receives this route replies message on node 6 and the node 2.Node 1 is 3 message in view of the above, set up three routes of above-mentioned A, B and C.And node 9, node 6 and node 2 are recorded as A, B and the C that destination node is 5 route to node 1 respectively.
When being connected of node 2 and node 3 disconnects, node 2 its routing tables of retrieval, the node of finding only to exist clauses and subclauses is 5 route, and it next jumped and is node 3, and forerunner's node of this route has comprised node 1.Node 2 sends the route thrashing message to node 1.Node 1 is received this route thrashing message, deletes in its routing table, arrives in three routes of node 5, and next-hop node is that route of node 2.In two remaining routes, next jumps to the jumping figure of the route of node 9 minimum, and node 1 uses this route as the default route of destination address as node 5.When node 9 also disconnected with being connected of node 3, in like manner, node 1 deletion destination address was in two routes of node 5, and next jumpings be the route of node 9, and to adopt next to jump be the route of the route of node 6 as arrival destination node 5.
The above-mentioned process of setting up route is specifically as follows:
A: use in the self-organizing network Routing Protocol of active routing mode at some, each node is regularly published HELLO message, carries the information of neighbor nodes of this node in the message.Receive the node of HELLO message,, set up the route of this node all nodes in the HELLO message according to the nodal information that carries in the HELLO message.Node may obtain to arrive the mulitpath of some nodes setting up according to HELLO message in the process of route.
B: use in the self-organizing network Routing Protocol of passive type routing mode at some, when having data, node sends, and there is not the route that arrives destination node in the routing table, this node meeting broadcast transmission route request information, this message is carried the address of described destination node.Receive the node of route request information,, may transmit this route request information if not destination node.
In setting up the process of route,, may receive the route request information that source node sends from mulitpath for a node.Receive the node of route request information,, then can send route replies message, carry destination node information, source node information in the message to source node if there has been the route of pointing to destination node, and this nodal information.Destination node is received route request information, must send route replies message to source node.Receive the node of route replies message,, may transmit route replies message to source node if not source node.For a node, also may receive the route replies message of pointing to same destination address from mulitpath.
Further, in setting up the process of route, node can obtain to arrive the mulitpath of another node.Setting up route by HELLO, route requests and route replies message, is a kind of example of execution mode.The present invention does not limit and uses which kind of execution mode.The present invention is applicable to any situation that may obtain mulitpath, as long as satisfy: 1, outwards send the node of route messages, in information, comprise sign to oneself, called after sender is (for the node of receiving this message, sender in the message is neighbours of this node, that is to say, route messages cannot be routed, only being forwarded, and in repeating process, the sender sign is filled by respective nodes); 2, be used for creating in the information of route, comprise the sign of destination node, called after dest; 3, be used for creating in the information of route, comprise the jumping figure that this sender node arrives the dest node, called after hcnt.
In addition, node can know which node is own next jumping as route:
A: adopt in the mechanism that regularly sends HELLO message, all neighbours are next jumping of oneself being used as route;
B: in the process of transmitting route replies message, the next-hop node that this node will arrive the route replies forwards, this next-hop node can be next jumping of oneself being used as route.
For the route that arrives certain destination node, if also there is the route of identical destination node on the neighbor node, and the latter's route is next jumping of oneself being used as route, and these neighbor nodes then are called forerunner's node of the corresponding route of this node.Node can obtain the forerunner node relevant with this route in said process, and forerunner's node can be called a hop node.
Recording process for many routes is specifically as follows:
A node extracts sender wherein after obtaining may be used for creating the information of route, and dest and hcnt element,, are recorded in the form relevant with this dest node with the next-hop node of sender as route as route destination node with dest.In form, according to the size of hcnt, ordering from small to large; The route of identical hcnt then sorts from the old to the new according to acquisition time; The route of identical sender, the article one behind the record ordering, all the other clauses and subclauses deletions.Article one route in the form is as the default route of this node arrival destination node.After the present invention does not stipulate that one of a node acquisition can be used to create the information of route, can be that it creates route, only describe the behavior in the time need creating route for it.
The number of the route entry of a destination node association can be by administrator configurations.If only allow the route of record hcnt minimum, then this invention has same effect with other technology.The present invention allows to write down the route of different hcnt, as route stand-by.
Node also can write down the relevant forerunner's nodal information of this route simultaneously when the record route, can be kept at these information in the form relevant with this destination node.If do not write down this information, do not influence realization of the present invention yet, but write down this information, than not writing down this information, help correctness with littler expense maintaining routing list.
When node concludes that one connect to lose efficacy, the route that it must all these connections of use of having write down of mark lost efficacy.It can check the path that whether exists through this connection, if exist, can send the route thrashing message to the last node in this path, comprise all in the message because this connects destination node information of the route that inefficacy institute mark lost efficacy, and with the information of this node as sender.
Node is received behind the route thrashing message of sender node transmission, retrieves the form of each the destination node correspondence that comprises in the route thrashing message successively, if there is a route, it next jumped and be this sender, and then this route of mark is invalid route.If the route that is labeled is a default route, then use next bar route in the form as default route.If there is not route stand-by in the form, then, comprise the destination node of this route in the message also to its last node transmission route thrashing message.
If equipment has been preserved the relevant forerunner's node of route therewith, then send route thrashing message all nodes in this forerunner's node table lattice, this is the mode of expense minimum, otherwise sends the route thrashing message in the mode of broadcasting.
As shown in Figure 2, after being connected of node 2 and node 3 lost efficacy, node 2 sent the route thrashing message to node 1, and node 1 deletion arrives the route of nodes 5 via node 2, and through the route of node 9 as the default route that arrives node 5.After being connected of node 9 and node 3 lost efficacy, node 1 deletion was via the route of node 9 arrival nodes 5, and a route of process node 6 is as the route that arrives node 5.In above process, prior art can trigger route and set up new route, and in this process, node 1 arrives node 5 not have route to use node 9 be connected inefficacy with node 3 after.And in this embodiment, node 1 always has effective route that can arrive node 5, the availability of the assurance network of maximum possible.
The above; only for the preferable embodiment of the present invention, but protection scope of the present invention is not limited thereto, and anyly is familiar with those skilled in the art in the technical scope that the present invention discloses; the variation that can expect easily or replacement all should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with the protection range of claims.
Claims (3)
1. method that improves the self-organizing network availability is characterized in that it comprises:
Step 1, set up in the process of route at source node and destination node, source node is preserved the route of a plurality of sensing destination nodes, and selects wherein an optimum route as current route;
Step 2, if when current route lost efficacy, source node selects the route of a preservation to point to the current route of destination node as source node.
2. a kind of method that improves the self-organizing network availability according to claim 1 is characterized in that, the route that described source node is preserved a plurality of sensing destination nodes comprises that source node points to the optimum route and the hypo-optimal route of destination node.
3. a kind of method that improves the self-organizing network availability according to claim 1 and 2 is characterized in that, selects the route of a preservation also to comprise later on as the route that source node points to destination node when source node:
Step 3, source node continue to seek and set up optimum route as current route again.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009101901485A CN102026330A (en) | 2009-09-10 | 2009-09-10 | Method for improving availability of ad hoc network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009101901485A CN102026330A (en) | 2009-09-10 | 2009-09-10 | Method for improving availability of ad hoc network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102026330A true CN102026330A (en) | 2011-04-20 |
Family
ID=43867019
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2009101901485A Pending CN102026330A (en) | 2009-09-10 | 2009-09-10 | Method for improving availability of ad hoc network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102026330A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103621144A (en) * | 2011-06-27 | 2014-03-05 | 三菱电机株式会社 | Method for discovering set of routes in network |
| CN103973558A (en) * | 2014-05-21 | 2014-08-06 | 杭州华三通信技术有限公司 | Route advertisement method and device |
| CN104394076A (en) * | 2014-12-01 | 2015-03-04 | 苏州市欧博锐自动化科技有限公司 | Method for transferring message among multiple nodes |
| CN108770031A (en) * | 2018-03-21 | 2018-11-06 | 深圳市海司恩科技有限公司 | Dynamic path planning method, active path planning system and storage medium |
-
2009
- 2009-09-10 CN CN2009101901485A patent/CN102026330A/en active Pending
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103621144A (en) * | 2011-06-27 | 2014-03-05 | 三菱电机株式会社 | Method for discovering set of routes in network |
| CN103621144B (en) * | 2011-06-27 | 2017-03-29 | 三菱电机株式会社 | For the method for finding route set in a network |
| CN103973558A (en) * | 2014-05-21 | 2014-08-06 | 杭州华三通信技术有限公司 | Route advertisement method and device |
| CN103973558B (en) * | 2014-05-21 | 2017-09-15 | 新华三技术有限公司 | A kind of route advertising method and device |
| CN104394076A (en) * | 2014-12-01 | 2015-03-04 | 苏州市欧博锐自动化科技有限公司 | Method for transferring message among multiple nodes |
| CN104394076B (en) * | 2014-12-01 | 2018-06-22 | 苏州市欧博锐自动化科技有限公司 | Message delivery method between a kind of multinode |
| CN108770031A (en) * | 2018-03-21 | 2018-11-06 | 深圳市海司恩科技有限公司 | Dynamic path planning method, active path planning system and storage medium |
| CN108770031B (en) * | 2018-03-21 | 2022-05-17 | 洪贵顺 | Dynamic path planning method, dynamic path planning system, and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP5199061B2 (en) | Hybrid mesh routing protocol | |
| US8270302B2 (en) | System and method for providing an adaptive value of TTL (time to live) for broadcast/multicast messages in a mesh network using a hybrid wireless mesh protocol | |
| EP1966961B1 (en) | Method and system for improving a wireless communication route | |
| CN100574252C (en) | Be used for the deployment that topology is upgraded between the mobile router | |
| CN100428711C (en) | Method of bluetooth routing according to request and network formation and communication method of bluetooth group network | |
| US7668173B2 (en) | Method and system for an adaptive wireless routing protocol in a mesh network | |
| US11445430B2 (en) | Data forwarding method and apparatus | |
| CN103260211B (en) | A kind of AOMDV method for routing of improvement | |
| EP2392158B1 (en) | Method for supporting routing decisions in a wireless mesh network and wireless mesh network | |
| KR20090030320A (en) | Mobile ad-hoc network(manet) and method for implementing mutiple paths for fault tolerance | |
| JP4369459B2 (en) | Method and apparatus for discovering disjoint routes to multiple service nodes | |
| KR20040053392A (en) | Addressing and routing in wireless mesh networks | |
| EP1102509B1 (en) | Data routing using a location server in a mobile communication network | |
| CN101102283A (en) | A method and device for optimizing unknown unicast forward at wireless access point | |
| US20040233847A1 (en) | Routing system for establishing optimal route in wireless personal area network (WPAN) and method thereof | |
| US20120163233A1 (en) | Method for transmitting routing information and routing apparatus in wireless network | |
| CN106954243A (en) | Route implementation method based on wireless chain network | |
| JP2010074691A (en) | Ad-hoc network wireless communication method | |
| JP5004999B2 (en) | Hybrid mesh routing protocol | |
| JP4927658B2 (en) | Routing method and node device | |
| CN102026330A (en) | Method for improving availability of ad hoc network | |
| KR20140124116A (en) | Apparatus and method for optimizing data-path in mobile communication network | |
| JP4767329B2 (en) | Network system and communication method | |
| JP2007243932A (en) | Wireless data communication system | |
| CN101636980A (en) | Method for operating a wireless interconnected data network with a plurality of network nodes, and network nodes |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20110420 |