CN101217498B - A self-organizing network routing method based on data message point-to-point decision making - Google Patents
A self-organizing network routing method based on data message point-to-point decision making Download PDFInfo
- Publication number
- CN101217498B CN101217498B CN2008100564494A CN200810056449A CN101217498B CN 101217498 B CN101217498 B CN 101217498B CN 2008100564494 A CN2008100564494 A CN 2008100564494A CN 200810056449 A CN200810056449 A CN 200810056449A CN 101217498 B CN101217498 B CN 101217498B
- Authority
- CN
- China
- Prior art keywords
- message
- route
- node
- source
- time
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to the router design and research field of the mobile wireless self-organized network, which is more particularly characterized by including the flowing steps sequentially: the initial TTL values of the IP messages sent by all nodes are set to be 64. When the node sends an IP message, a router stored to a target IP is only sent to a next corresponding hop, or floods the messages to all the neighbors. When the node receives the IP message, the retransmitting hop times passed by the message can be analyzed according to the current TTL value of the message, and the shortest path to the source can be determined by combining the corresponding routing items of the node. The non-shortest routing produced in the process of flooding can be deleted for overtime as no corresponding IP message is transmitted. The invention realizes a novel rapid and simple Ad Hoc path-finding method with low protocol bandwidth consumption.
Description
Technical field
Self-organizing network routing method based on the data message point-to-point decision making belongs to mobile wireless self-organized network route research field.
Background technology
Ad Hoc network be a kind of can be as required the wireless network of fast construction at any time, without any need for the support of infrastructure, need be by centre management yet.It originates from the u.s.a. military affairs research field of the seventies in 20th century at first, can realize the interconnected temporarily of a plurality of portable terminals in limited scope, for the mobile communication terminal in the local area network (LAN) provides a kind of mutual contact mode flexibly.Ad Hoc network is mainly used military communication, earthquake or extreme misery calamity environment such as rescue is afterwards taken place at present.Ad hoc also is very suitable for the occasion that exhibition center, meeting room, gymnasium, classroom, train etc. need provisional communication in addition.Can predict that Ad Hoc network technology will will play important effect in the field of future mobile communications.
Seeking route is one of most important key technology of Ad Hoc network.Realize the wireless multi-hop route, must have special-purpose method for routing to support.The main at present standardization effort of being responsible for Ad hoc network IP layer route of the MANET working group that IETF sets up.In Ad hoc network, each mobile node has both router and two kinds of functions of main frame.As main frame, mobile node needs running face to application program of user; As router, it need realize corresponding method for searching, participates in packet forwarding work and route maintenance work according to routing policy and routing table.Consider that node moves in the Ad hoc network, topology of networks constantly changes, simultaneously because the computing capability of mobile node and memory capacity is lower and the energy is limited requires Routing Protocol simple as far as possible, this has increased the difficulty of Routing Protocol design in the Ad hoc network again.
Compare with traditional Routing Protocol, the design of Ad hoc Routing Protocol is faced with network topology dynamic change, limited bandwidth, channel capacity variation, limited new problem and the challenges such as available resources of portable terminal.The pathfinding strategy should be simpler, and the forwarding and the application layer process of pathfinding in the Ad Hoc network node, data message are seized system resource jointly.The pathfinding strategy should be quicker, and the mobile wireless network topology changes fast makes the pathfinding process to finish as early as possible.The pathfinding strategy should consume bandwidth still less, and the relative cable network bandwidth resources of wireless network are more rare, and application layer protocol message and pathfinding policy protocol message are shared this a spot of bandwidth.The existing method for searching of Ad Hoc network all is to finish by the interaction protocol message by special agreement basically, and typical A d Hoc Routing Protocol has AODV, DSR, DSDV etc., the IP datagram literary composition that also needs to change forwarding that has.In addition, they all are after a certain amount of analysis is carried out to protocol massages in the IP upper strata, realize the decision-making of route.Routing decision more concentrates on source node and destination node.
So, how to design a kind of new A d Hoc method for searching of more simple, quick, low agreement bandwidth consumption, be the key issue in the research of current Ad Hoc route.
Summary of the invention
The invention provides a kind of based on the data message feature, by the Ad Hoc no-protocol message method for searching of all node Shared Decision Making on the forward-path.This method can realize that communication node seeks the function based on the shortest forward-path of distance vector.It is realized successively according to the following steps alternately:
Step (1.): initialization;
Each node is set up local routing table, and routing table is made up of some route entries.The route entry content comprises: destination address, next-hop ip address (2), outgoing interface number (2), forwarding jumping figure, Route Age etc.Do not contain any route entry when routing table is initial.
Step (2.): when source node S sent to the IP message of destination node D for the first time, to all neighbours' transmissions of all interfaces, IP TTL must be set at 64.
Step (3.): receive the IP message when node its TTL is subtracted 1; Then, need to create or be updated to the route of source IP, and the route that finds purpose IP receives or transmits operation.Carry out following steps successively:
Step (3.1): search local route to message source IP.If do not arrive the route entry in source, then create new route entry.Wherein destination address is message source IP, outgoing interface is the incoming interface of current message, and next jumps the IP address that sends neighbours for the upstream of current message route entry, and Route Age is 30s, route entry is transmitted jumping figure: (64-TTL), wherein TTL is for receiving IP current ttl value of message.
Step (3.2): whether the destination address of judging message belongs to this node, belongs to this node, then will give the upper-layer protocol resume module on the message, and execution in step (4.), when not belonging to this node, and execution in step (3.3) then
Step (3.3): if the local route entry that has had the message source address, then the ttl value according to message IP head adds jumping figure and the size (being designated as sum) of route entry forwarding, judges the good and bad of path and carries out different processing.
Step (3.3.1): sum represents the forwarding jumping figure of the forwarding jumping figure of this message from the source to this node greater than current route entry less than 64.Illustrate that current forward-path is not an optimal path, abandons this message.
Step (3.3.2): sum represents the forwarding jumping figure of the forwarding jumping figure of this message from the source to this node less than current route entry greater than 64.Illustrate that current forward-path is better than local route entry, transmits this message.Simultaneously, as renewal route entry as described in the step (3.1).
Step (3.3.3): sum equals 64, represents that the forwarding jumping figure of this message from the source to this node equals the forwarding jumping figure of current route entry.Illustrate that current forward-path is equivalent to local route entry, transmits this message.If this route has only an outgoing interface and next jumping, in order to realize the multi-next-hop route, next jumps into row relatively to the upstream neighbor IP address of message incoming interface, message and route entry outgoing interface, route entry, if different outgoing interface and next jumping that then increase this route.If outgoing interface and next jumping of existing two equivalences of this route then do not process.
Step (3.4): search route according to the message destination address.If there is not corresponding route, then toward all neighbours' inundation messages of this node total interface; Transmit route if exist, then send toward outgoing interface.
Step (4.): after message arrived destination node D, destination node learnt to go to the route of source S.After this, node D sends the IP message of going to S, no longer inundation.Only outgoing interface and next the hop neighbor clean culture toward corresponding route sends, and IP TTL must be set at 64.This message sends to the process of S from D, it the node of process can create or be updated to the route of D with step (3.3).
Step (5.): the bidirectional protocol message that source node and destination node are follow-up, all transmit by shortest path.And the non-best route that message inundation process produces owing to transmit corresponding data message, after 5 seconds with overtime deletion.
Step (6.): for the IP message that sends, if source node does not have corresponding route, can generate at the destination address of IP message and suppress timer, the inhibition timer expiry time was made as 5 seconds.In 5 second time,, then discharge this timer if learn to go to the route of purpose IP; Timer expiry after 5 seconds, source node begin to suppress to mail to the frequency of the message of this purpose IP.For the first time inhibition time t being set is 1 second, i.e. in this 5 second time, IP stack sends the message of this destination address with the time interval that was not less than 1 second; If application program too fast (sending at interval less than 1 second) sends to the message of this destination address, will be abandoned by IP stack.Timer is overtime once more after 5 seconds, and for the second time inhibition time t being set is 2 seconds, i.e. in this 5 second time, IP stack sends the message of this destination address with the time interval that was not less than 2 seconds; If application program too fast (sending at interval less than 2 seconds) sends to the message of this destination address, will be abandoned by IP stack.Timer is overtime for the third time after 5 seconds, and it is 3 seconds that inhibition time t is set for the third time, i.e. in this 5 second time, IP stack sends the message of this destination address with the time interval that was not less than 3 seconds; If application program too fast (sending at interval less than 3 seconds) sends to the message of this destination address, will be abandoned by IP stack.After three times, suppress time t is 3 seconds always.In execution in step (6) process, as long as source node learns to go to the route of this purpose IP, then discharge corresponding timer, no longer suppress the transmission of corresponding message.
The present invention utilizes the data message point-to-point decision making of forwarding to provide not only an economy but also high-efficiency method based on the shortest Ad Hoc route of distance vector for study.This method according to the ttl value that receives in the message IP head, is obtained the forwarding jumping figure of this message process by forward node, thus the shortest path of the message source address of making a strategic decision out.This method need not routing protocol packet, does not have the mutual of routing iinformation, has reduced the agreement bandwidth consumption in a large number.Simultaneously, the decision-making technique of this shortest path is very simple, and the forwarding jumping figure that only needs to compare message ttl value and current route can be finished, and is that complete distributed route is calculated.So this method has reduced each node routing decision in a large number and has consumed the CPU time.In addition, this method is supported equivalent multipath route, and can avoid the appearance of route ring.
Description of drawings
Fig. 1: the IP message is transmitted process chart.
Fig. 2: IP message transmission flow figure.
Fig. 3: the IP message receives flow chart.
Fig. 4: source inundation datagram, point-to-point decision making is learnt the route in source.
Fig. 5: destination node shortest path loopback message, node is learnt the purpose route on the path.
Fig. 6: communicating pair passes through the shortest path stabilized communication.
Letter and circle combination expression node among Fig. 4,5,6,
Be source node,
Be destination node, other are ordinary node, and straight line is represented the annexation between the node, the ttl value in the numeral message repeating process, and arrow is represented the direction of propagation of IP message.
Embodiment
Forward node study route and the process that E-Packets are seen shown in Figure 1.
Fig. 1 content is an emphasis of the present invention, has described forward node and has received the handling process of the message way of escape by decision-making and forwarding decision.The main foundation of its decision-making is: the IP message is every all can be subtracted 1 through its IP head ttl value of a forward node.So all setting the TTL initial value at all IP messages to be sent is under 64 the prerequisite, receiving node can be judged the forwarding jumping figure of message process according to ttl value in the message.If do not arrive the route in source, will create a route according to the IP message content that receives and a message incoming interface and a last hop neighbor to the source.If there has been the route in source, more current route entry and message receive information decision and go out the shortest path of this node to the source, and upgrade routing table.
Forward node also will be made a strategic decision and whether transmit the IP message except the shortest path in the source of making a strategic decision.Among the present invention, the message that the forward node identification is sent from shortest path is just transmitted, otherwise dropping packets.This forwarding decision is not only simple, and has reduced the forwarding that repeats to same message in a large number.In addition, by the message ttl value being analyzed the method whether its message whether shortest path is sent and decision-making transmit, can avoid the appearance of route ring simply and effectively.
IP message transmission flow figure sees Fig. 2.When application layer sent data, the IP layer was searched route according to destination address and is sent the IP message.If there is not corresponding route, then to all neighbours' inundation IP messages.Need to prove that the IP message TTL initial value of all joint structures is necessary for 64.
The IP message receives flow chart and sees Fig. 3.Destination node passes through to analyze the ttl value that receives message, the shortest path in the source of making a strategic decision, and its process is the same with forward node.
Fig. 4, Fig. 5, Fig. 6 have described in the canonical topology structure, the process of communication process node route learning and packet sending and receiving.
Source inundation data message and forward node make a strategic decision the source route the process example as shown in Figure 4.
Node S sends the IP message to node D, and under the situation of the route of not learning to go to D, node S is to this IP message of all neighbours' inundations.The message that forward node is sent all S that receive in the middle of each carries out the decision-making and the forwarding decision of route learning.Node C has received the IP message that S sends from neighbours A and neighbours B respectively among Fig. 4, and it relatively finds the forwarding jumping figure that message experienced that A sends still less in the back, is the IP message of S so only transmit the source that A sends.And it is the shortest that node C learns to go to by A the forward-path of node S.In like manner, node F and destination node D also can do same decision-making.After this process among the figure each node all learn the shortest path of S.
Communication objective node is given source node by shortest path clean culture loopback message, and example as shown in Figure 5.
What Fig. 6 described is through after the described process of Fig. 4, Fig. 5, the stabilized communication state of source node S and destination node D, and two-way all is to send message by the shortest path clean culture.In addition, the node beyond this path once learnt to go to the route of S, owing to do not have corresponding data message process, and with overtime deletion.
Claims (1)
1. based on the self-organizing network routing method of data message point-to-point decision making, its feature may further comprise the steps:
Step (1.): initialization, each node is set up local routing table, routing table is made up of route entry, and the route entry content comprises: destination address, 2 next-hop ip address, 2 outgoing interfaces number, transmit jumping figure and Route Age, do not contain any route entry when routing table is initial;
Step (2.): when source node sent to the IP message of destination address for the first time, directly all neighbours to all interfaces sent, and IP TTL is set at 64;
Step (3.): receive the IP message when node its TTL is subtracted 1, be updated to the route of source IP, and the route that finds purpose IP receives or transmit operation, carry out following steps successively:
Step (3.1): search local route to message source IP, when the route entry that does not arrive the source, create new route entry, destination address in the new route entry is that message source IP, outgoing interface are that the incoming interface of current message, IP address, the Route Age that next jumping of route entry is the upstream transmission neighbours of current message are that 30s, route entry forwarding jumping figure are: (64-TTL), wherein TTL is IP current ttl value of reception message;
Step (3.2): whether the destination address of judging message belongs to this node, when belonging to this section point, then will give the upper-layer protocol resume module on the message, and execution in step (4.), when not belonging to this node, and execution in step (3.3) then;
Step (3.3): when there has been the route entry of message source address in this locality, then according to the ttl value of message IP head add route entry transmit jumping figure and, that judges the path good and badly also realizes different processing:
Step (3.3.1): when the ttl value of message IP head add route entry transmit jumping figure and less than 64 the time, represent the forwarding jumping figure of the forwarding jumping figure of this message from the source to this node greater than current route entry, illustrate that current forward-path is not an optimal path, abandons this message;
Step (3.3.2): when the ttl value of message IP head add route entry transmit jumping figure and greater than 64 the time, represent the forwarding jumping figure of the forwarding jumping figure of this message from the source to this node less than current route entry, illustrate that current forward-path is better than local route entry, transmit this message, and this route entry information of (3.1) described renewal set by step;
Step (3.3.3): when the ttl value of message IP head adds that route entry is transmitted jumping figure and equals 64, represent that the forwarding jumping figure of this message from the source to this node equals the forwarding jumping figure of current route entry, illustrate that current forward-path is equivalent to local route entry, transmit this message, when this route has only an outgoing interface and next-hop ip address, then to the upstream neighbor IP address and the route entry outgoing interface of message incoming interface message, the route entry next-hop ip address compares, different then increase the outgoing interface and the next-hop ip address of this route, identical route outgoing interface and the next-hop ip address of then not increasing; When the outgoing interface of existing two equivalences of this route and next-hop ip address, then do not process;
Step (3.4): search route according to the message destination address, when not having corresponding route, then toward all neighbours' inundation messages of this node total interface; When having the forwarding route, then send toward outgoing interface;
Step (4.): after message arrives destination node, destination node is learnt the route in the source of going to, at this moment, destination node sends the IP message in the source of going to, inundation no longer, only outgoing interface and next the hop neighbor clean culture toward corresponding route sends, and IP TTL is set at 64, send in the process of source node at this message, message the node of process can learn or be updated to the route of purpose IP with step (3.3);
Step (5.): the bidirectional protocol message that source node and destination node are follow-up, all transmit by shortest path, the non-best route that message inundation process produces owing to transmit corresponding data message, after 5 seconds with overtime deletion;
Step (6.): for the IP message that sends, if source node does not have corresponding route, can generate at the destination address of IP message and suppress timer, the inhibition timer expiry time was made as 5 seconds;
In 5 second time,, then discharge this timer when the route of learning to go to purpose IP; Timer expiry after 5 seconds, source node begin to suppress to mail to the frequency of the message of this purpose IP, and for the first time being set the inhibition time is 1 second, i.e. in this 5 second time, IP stack sends the message of this destination address with the time interval that was not less than 1 second; When application program sends the interval less than the message that sent to this destination address in 1 second, will be abandoned by IP stack; Timer is overtime once more after 5 seconds, and for the second time being set the inhibition time is 2 seconds, i.e. in this 5 second time, IP stack sends the message of this destination address with the time interval that was not less than 2 seconds; When application program sends the interval less than the message that sent to this destination address in 2 seconds, will be abandoned by IP stack; Timer is overtime for the third time after 5 seconds, and it is 3 seconds that the inhibition time is set for the third time, i.e. in this 5 second time, IP stack sends the message of this destination address with the time interval that was not less than 3 seconds; When application program sends the interval less than the message that sent to this destination address in 3 seconds, will be abandoned by IP stack; After three times, the inhibition time is 3 seconds always;
In execution in step (6) process, as long as source node learns to go to the route of this purpose IP, then discharge corresponding timer, no longer suppress the transmission of corresponding message.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008100564494A CN101217498B (en) | 2008-01-18 | 2008-01-18 | A self-organizing network routing method based on data message point-to-point decision making |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008100564494A CN101217498B (en) | 2008-01-18 | 2008-01-18 | A self-organizing network routing method based on data message point-to-point decision making |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101217498A CN101217498A (en) | 2008-07-09 |
| CN101217498B true CN101217498B (en) | 2011-08-24 |
Family
ID=39623860
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008100564494A Expired - Fee Related CN101217498B (en) | 2008-01-18 | 2008-01-18 | A self-organizing network routing method based on data message point-to-point decision making |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101217498B (en) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101631337B (en) * | 2009-08-06 | 2011-11-09 | 福建星网锐捷网络有限公司 | Method and device of data transmission |
| CN102026364B (en) * | 2009-09-17 | 2014-07-09 | 华为技术有限公司 | Precise time protocol message processing method and clock equipment |
| JP5897699B2 (en) * | 2012-03-02 | 2016-03-30 | 富士通株式会社 | Terminal, route generation method, and route generation program |
| EP3151111B1 (en) | 2014-06-30 | 2018-10-17 | Huawei Technologies Co., Ltd. | Data processing method executed by network apparatus, and associated device |
| CN105338535B (en) * | 2015-08-31 | 2018-09-28 | 浙江利尔达物联网技术有限公司 | A method of carrying out wireless networking using mobile terminal |
| CN107342939B (en) * | 2016-04-29 | 2020-02-14 | 华为技术有限公司 | Method and device for transmitting data |
| US10038623B2 (en) * | 2016-10-24 | 2018-07-31 | Microsoft Technology Licensing, Llc | Reducing flooding of link state changes in networks |
| CN109981486B (en) * | 2017-12-27 | 2023-04-18 | 北京华为数字技术有限公司 | Message forwarding method and forwarding device |
| CN110912824B (en) * | 2019-11-27 | 2021-08-31 | 美的集团股份有限公司 | Method and device for determining survival time value of multi-hop network node |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1642129A (en) * | 2004-01-14 | 2005-07-20 | 电子科技大学 | Nucleus tree self-organizing dynamic route algorithm |
| CN1708958A (en) * | 2002-12-20 | 2005-12-14 | 国际商业机器公司 | Maximum lifetime routing in wireless ad-hoc network |
| CN1731760A (en) * | 2005-08-05 | 2006-02-08 | 武汉理工大学 | Ad Hoc network routing method based on flooding mechanism |
-
2008
- 2008-01-18 CN CN2008100564494A patent/CN101217498B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1708958A (en) * | 2002-12-20 | 2005-12-14 | 国际商业机器公司 | Maximum lifetime routing in wireless ad-hoc network |
| CN1642129A (en) * | 2004-01-14 | 2005-07-20 | 电子科技大学 | Nucleus tree self-organizing dynamic route algorithm |
| CN1731760A (en) * | 2005-08-05 | 2006-02-08 | 武汉理工大学 | Ad Hoc network routing method based on flooding mechanism |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101217498A (en) | 2008-07-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101217498B (en) | A self-organizing network routing method based on data message point-to-point decision making | |
| Bouhorma et al. | Performance comparison of ad-hoc routing protocols AODV and DSR | |
| CN101374114B (en) | Method for selecting route of vehicle-mounted mobile ad hoc network based on direction information | |
| Patil | Efficient AODV Routing Protocol for MANET with enhanced packet delivery ratio and minimized end to end delay | |
| Sharma et al. | Behavioral study of MANET routing protocols by using NS-2 | |
| CN103118412A (en) | Trust-based on-demand multipath vector routing algorithm of Ad Hoc network | |
| Kotecha et al. | Multi objective genetic algorithm based adaptive QoS routing in MANET | |
| Asvarujanon et al. | Robust and adaptive mobile ad hoc routing with attractor selection | |
| CN102098729A (en) | Construction method and related packet forwarding method for tree backbone structure in wireless network | |
| Mistry et al. | A survey: Use of ACO on AODV & DSR routing protocols in MANET | |
| Asokan et al. | An approach for reducing the end-to-end delay and increasing network lifetime in mobile adhoc networks | |
| Kumbharey et al. | Renovated Cluster Based Routing Protocol for MANET | |
| Al Sharah et al. | Trade-off between Energy Consumption and Transmission Rate in Mobile Ad-Hoc Network | |
| Ramakrishnan et al. | Mathematical modeling of routing protocol selection for optimal performance of MANET | |
| Sharma et al. | Bandwidth Constrained Routing of Multimedia Trafficover Hybrid MANETs using Ant Colony Optimization | |
| Johnson | QoS improvement in MANET using self organized balanced optimization | |
| Nehra et al. | Routing with load balancing in ad hoc network: A mobile agent approach | |
| Midha et al. | Performance Analysis of AODV & OLSR for MANET | |
| Ziane et al. | A QoS adaptive multi-path reinforcement learning routing algorithm for manet | |
| Sharma et al. | SA-DSR: a Bandwidth Optimizing Technic for Dynamic Source Routing Protocol | |
| Singh et al. | Comparison and study of aomdv and dsdv routing protocols in manet using ns-2 | |
| Roy et al. | Atypical Stable Multipath Routing Strategy in MANET | |
| Soomro et al. | An Energy and Priority Aware Routing Scheme for Mobile Ad Hoc Networks in Emergency Management | |
| Faouzi et al. | Aodv energy routing mechanism for multi-channel multi-interface ad hoc networks (emcmi-aodv) using a dynamic programming algorithm | |
| Jamatia et al. | Scenario Based Pause Time Analysis of AODV, DSDVand DSR over CBR Connections in MANET |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20110824 Termination date: 20140118 |