CN101568164A - Opportunistic routing algorithm of Ad hoc network based on node priority levels - Google Patents
Opportunistic routing algorithm of Ad hoc network based on node priority levels Download PDFInfo
- Publication number
- CN101568164A CN101568164A CNA2009100862093A CN200910086209A CN101568164A CN 101568164 A CN101568164 A CN 101568164A CN A2009100862093 A CNA2009100862093 A CN A2009100862093A CN 200910086209 A CN200910086209 A CN 200910086209A CN 101568164 A CN101568164 A CN 101568164A
- Authority
- CN
- China
- Prior art keywords
- node
- priority
- packet
- forwarding list
- transferring
- 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
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides an opportunistic routing algorithm of an Ad hoc network based on node priority levels. In the algorithm, an intermediate node transferring list from a source node to a destination node is established by a routing request message and a routing response message; the nodes in the transferring list undergo priority level setting according to the distances away from the destination node which are indicated in the response message; the shorter the distance is, the higher the priority level is; the transferring list is carried at the head part of each data packet; all intermediate nodes in the transferring list have the opportunity to transfer the received data packets; broadcast storm is avoided by setting serial numbers for the data packets; repeated transference of a certain number of data packets can be avoided by comparing the priority levels; and the success rate of information transmission is improved by a transferring node of more than one next hop node. An opportunistic routing mechanism can perform transference by fully utilizing the transferring node which is closer to the destination node in a scene with poorer channel quality, and can ensure higher mailing rate and shorter terminal-to-terminal time delay.
Description
Technical field
The present invention relates to a kind of routing mechanism of wireless multihop self-organizing network, particularly a kind of realization of the chance routing algorithm based on node priority.
Background technology
The typical routing protocol that occurs in the Ad hoc network comprises DSR, AODV, OLSR etc. at present.The realization mechanism of tradition route is to select a best path between source and destination node, transmits packet successively along the road of choosing then.When link circuit condition was reasonable, traditional routing mechanism can be good at work.But; the unsteadiness of wireless channel causes the instantaneous variation of node transmission range through regular meeting; and node move or switching on and shutting down also can cause next-hop node unreachable; affirmation, the re-transmission phenomenon that will cause frequent MAC layer; and then cause route layer route maintenance procedure or routing update process, it is even more serious just in time to be under the situation of critical coverage this phenomenon at phase mutual edge distance between quality of wireless channel variation or node.The unreliability of this link and unsteadiness can cause very big route maintenance expense, also can cause upper-layer service very big time delay or a large amount of packet loss phenomenons to occur.
The chance routing algorithm can address the above problem preferably, and it makes can keep higher delivery rate and less time delay under the situation second-rate at radio network information channel, that network topology change is frequent, thereby supports qos requirement better.
In the chance routing algorithm, packet transmits in the intermediate node scope that forwarding list limits in the mode of broadcasting, and forwarding list is to carry out prioritization by the distance to destination node, and is high more apart from the near more priority of destination node.All receive that the node that is positioned at forwarding list of packet all has an opportunity this bag is transmitted, and the node of low priority can not transmitted the packet that priority node sends, and will force packet to pass to the direction of destination node like this.And each the forwarding all has a next-hop node incessantly, increased the success rate of transmitting.The chance route can make full use of those very " lucky ", the link that distance is far.Also can give those " misfortune ", the new conveyer meeting of node that distance is very near.
Summary of the invention
The method for routing that place of the present invention is to provide a kind of chance to transmit can make full use of all available node resources in the network, and especially those nodes nearer apart from destination node are transmitted data, to reach higher delivery rate and lower time delay.For achieving the above object, the present invention takes following steps to realize:
First step: the structure of forwarding list and maintenance
When node has data to transmit, start route requests and answering, route request information sends in the mode that floods, intermediate node can be transmitted (it is fixed that n comes according to the network size size) n time for identical route request information, write down in the route request information it the intermediate node of process, destination node is whenever received a route request information just according to the reverse route of intermediate node information acquisition that wherein writes down, and a route replies message is replied in clean culture.Source node is received after the route replies message just the intermediate node information architecture forwarding list according to wherein.Forwarding list carried out priority level initializing, and forwarding list dynamically updates according to the route replies message of receiving.Forwarding list is carried to the packet head and together transmits with packet.
Second step: the priority level initializing of forwarding list
Intermediate node information in the route replies message comprises node address, and can obtain the jumping figure of each intermediate node to destination node, according to the priority of setting intermediate node to the jumping figure size of destination node, the node of jumping apart from destination node one is a limit priority, the node of double bounce is second priority, and the like, arrange 8 priority altogether, the node number of each priority is no more than 15.If when occurring certain identical intermediate node in the follow-up route replies message and providing different priorities, always get its higher priority according to distance destination node jumping figure.
Third step: the mechanism when intermediate node carries out data forwarding
The head of packet add sequence-number field and on a hop node address field.After intermediate node is received a packet, judge whether oneself is arranged in forwarding list, if no, then abandon this packet, if, judge then whether this bag is to be sent by the higher node of priority, if then abandon,, judge then whether this bag oneself was transmitted if node identical or more low priority is sent by priority, if then abandon, continue to transmit this bag if not then own address being write a last hop node field.
Description of drawings
Fig. 1 is the network topological diagram example.
Fig. 2 is a packet structure.
(b) (c) (d) is respectively bag reception main-process stream to Fig. 3 (a), routing request packet receives flow process, route replies bag reception flow process and packet and receives and forwarding process.
Embodiment
The invention will be further described below in conjunction with embodiment, but this embodiment should not be construed as limitation of the present invention.
The foundation of forwarding list: when node had data to send, it just made up route request information RREQ, mainly comprised source IP address among the RREQ, purpose IP address, RREQ ID.RREQ transmits in the mode that floods, the intermediate node of process writes oneself IP address the forwarding list field among the RREQ successively, intermediate node can be transmitted repeatedly the message of identical RREQ ID and (establish according to network size, this value is made as 3 in the network example among the present invention), destination node will be received a plurality of RREQ like this, and destination node receives that whenever a RREQ will make up corresponding route replies RREP message, and RREP message mainly comprises source IP address, purpose IP address, the forwarding list field.RREP obtains reverse route and clean culture and returns source node according to the forwarding list among the RREQ.Like this, for the RREQ message of identical RREQ ID, destination node can be replied a plurality of RREP message, and source node is set up local forwarding list and set priority according to the nodal information among a plurality of RREP.
The priority level initializing process: preserve a RREP chained list at source node, all nodes and corresponding priorities thereof in the record forwarding list, the upper limit of priority progression is made as 8.Following content is arranged in this chained list: node IP address and its be to the destination node jumping figure, just upgrades this chained list after receiving a RREP at every turn.After reaching the maximum RREP number that needs to handle, follow-up RREP message is no longer handled (this value is made as 7 in the network example of the present invention).Renewal process is as follows:
Shown in accompanying drawing 1 and table 1, suppose that source node receives seven RREP altogether in limiting time, the forward node information that comprises among first RREP that receives is: { (N4,1hop) (N2,2hop) }, therefore when giving priority,, directly give N4 and N2 priority is respectively 1,2 because also there are not clauses and subclauses in the forwarding list;
Receive that the forward node information that second RREP comprises is { (N6,1hop) (N1,2hop) }, search earlier when giving priority and whether had same node point in the forwarding list, if there is no then give priority by distance destination node jumping figure, if exist, then earlier by this RREP middle distance destination node jumping figure give after the priority with forwarding list in the priority of having given compare, if it is different then give this node higher priority, because do not exist N6 and N1 in the forwarding list this moment, therefore give N6 respectively and N1 priority is 1,2;
Receive the 3rd the forward node information among the RREP for (N7,1hop) (N6,2hop) (N4,3hop) } because had node N6 and N4 in the forwarding list, and its priority is all for the highest, so N6, the priority of N4 is constant, the priority of N7 is made as 1;
Receive the 4th the forward node information among the RREP for (N7,1hop) (N5,2hop) (N3,3hop) }, aligning method according to priority, the priority of N7 is constant, it is 2,3 that N5 and N3 give priority respectively;
Receive the 5th the forward node information among the RREP for (N6,1hop) (N1,2hop) (N2,3hop) }, N6, N1, the priority of N2 is constant;
Receive that the 6th the forward node information among the RREP is { (N7,1hop) (N5,2hop) (N4,3hop) (N1,4hop) (N2,5hop) (N3,6hop) }, aligning method according to priority, the priority of these six nodes is taken out the limit priority that showed, therefore, the priority in the forwarding list is also constant.
Receive that the 7th the forward node information among the RREP is { (N7,1hop) (N4,2hop) (N5,3hop) (N3,4hop) (N2,5hop) }, aligning method according to priority, the priority of these five nodes is taken out the limit priority that showed, and therefore, the priority in the forwarding list is constant.At this moment the priority situation in the forwarding list is: priority 1: { N4, N6, N7}, priority 2: { N2, N1, N5}, priority 3: { N3}.
The priority level initializing process of table 1 forwarding list
When node has packet to send, it checks local forwarding list earlier, if there is not forward node information, then initiate to set up the process of forwarding list, this process is finished by first two steps, forwarding list be built with a time-out time, after surpassing this time, no matter whether collected all RREP, all to begin the process of transmitting of packet, when packet sends forwarding list is appended to the head of packet.
For fear of broadcast storm, in forwarding list option head, increased sequence-number field, wherein the sequence-number field scope is 0～2
32-1, recycle.Node is preserved the chained list with (source, place, sequence number) index in this locality, receive (source, place, sequence number) information preservation that just will wrap behind the bag.In order to reduce the quantity of redundancy packet, guarantee packet all the time to transmitting from the near direction of destination node, a hop node field on the head of packet has increased, the structure of packet is as shown in Figure 2.
Packet repeating process: as shown in Figure 3, after node is received a packet, if oneself be not destination node, then earlier judge whether oneself is arranged in the forwarding list of packet, if do not have, then abandon this packet, if, then according to own in forwarding list priority and this bag on the priority of a hop node come this bag relatively whether to send by the node higher than the priority of oneself, if then abandon this packet, if and the packet of this sequence number this locality safeguard that buffer memory is medium pending, then delete the packet in the buffer memory simultaneously.If this packet is from equal priority or low priority node, see then whether oneself received this packet, if then it is abandoned, if do not have, with data pack buffer, regularly wait for, the time size of waiting for is by its priority decision, and the high more stand-by period of priority is short more, if receive the bag of the same sequence number that the higher priority node is transmitted regularly, then will delete this bag, the deletion timer.Otherwise when being timed to own address write the last hop node field in the option head, write down the sequence number of this packet and this packet is forwarded.
The content that is not described in detail in this specification belongs to this area professional and technical personnel's known prior art.
The above only is preferable enforcement of the present invention, and is in order to restriction the present invention, within the spirit and principles in the present invention not all, any modification of being done, is equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (6)
1, a kind of chance routing algorithm that is used for Ad hoc network based on node priority, its step is as follows:
A) packet sends period and obtains the internodal effective forward node tabulation of source to destination in the network;
B) source node carries out the setting of priority to effective forward node of collecting, makes it to carry out prioritization according to distance destination node distance;
C) forwarding list of source node handle setting priority appends to the head of packet, then packet is broadcasted;
D) node carries out according to its priority in forwarding list the transfer sequence of packet;
E) packet head interpolation sequence-number field limits node and can only transmit once identical bag.
2, method according to claim 1 is characterized in that, steps A further comprises: the process of effective forward node tabulation in the middle of just can collecting when node has data to send; Forwarding list makes up according to the middle forward node that comprises in the route replies message; When having data to send, obtaining periodically of forward node tabulation carried out, cycle can be made as different values according to different scenes, and this value can be established very longly (minute level) under the topological metastable scene, and this value should be established shortly under the frequent scene of change in topology.
3, method according to claim 1, it is characterized in that, step B further comprises: the node in the local forwarding list is to set priority according to the jumping figure of the forward node that comprises in the route replies message, and is few more apart from the destination node jumping figure, and priority is high more.Equal priority can have a plurality of nodes.
4, method according to claim 1 is characterized in that, step C further comprises: forwarding list is carried to the packet head and together transmits with packet.
5, method according to claim 1, it is characterized in that, step D further comprises: the node that is arranged in forwarding list all has an opportunity the packet of receiving is transmitted, wherein the node of high priority the packet of oneself not transmitting that equal priority or low priority node are sent is transmitted, and the node of low priority is no longer transmitted the packet that the node of high priority is sent.
6, method according to claim 1 is characterized in that, step e further comprises: source node adds sequence-number field on the head of packet with at packet of network layer unique identification, can avoid broadcast storm.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100862093A CN101568164B (en) | 2009-06-08 | 2009-06-08 | Opportunistic routing algorithm of Ad hoc network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100862093A CN101568164B (en) | 2009-06-08 | 2009-06-08 | Opportunistic routing algorithm of Ad hoc network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101568164A true CN101568164A (en) | 2009-10-28 |
| CN101568164B CN101568164B (en) | 2011-01-05 |
Family
ID=41284042
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2009100862093A Expired - Fee Related CN101568164B (en) | 2009-06-08 | 2009-06-08 | Opportunistic routing algorithm of Ad hoc network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101568164B (en) |
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101945432A (en) * | 2010-09-16 | 2011-01-12 | 北京邮电大学 | Multi-rate opportunistic routing method for wireless mesh network |
| CN101969661A (en) * | 2010-10-27 | 2011-02-09 | 北京握奇数据***有限公司 | Method, device and system for transmitting data in mobile Ad hoc network |
| CN102316315A (en) * | 2010-06-29 | 2012-01-11 | 中国科学院软件研究所 | Real-time video transmission method |
| CN102387585A (en) * | 2010-08-30 | 2012-03-21 | 富士通株式会社 | Wireless communication network and communication method and communication nodes for wireless communication network |
| WO2012130084A1 (en) * | 2011-03-31 | 2012-10-04 | 华为技术有限公司 | Message multiple-transfer method, device and system |
| CN102740392A (en) * | 2012-06-01 | 2012-10-17 | 华中科技大学 | Routing method based on layering geotagging in opportunistic network |
| CN102932866A (en) * | 2012-07-06 | 2013-02-13 | 北京邮电大学 | Opportunistic routing mechanism applicable to multi-radio-frequency multi-channel Ad hoc network |
| CN103119902A (en) * | 2011-09-20 | 2013-05-22 | 日本电气株式会社 | Communication system, policy management device, communication method, and program |
| CN104410580A (en) * | 2014-11-28 | 2015-03-11 | 深圳市华威世纪科技股份有限公司 | Trusted security WiFi (Wireless Fidelity) router and data processing method thereof |
| CN106572166A (en) * | 2016-11-02 | 2017-04-19 | 广东欧珀移动通信有限公司 | Data transmission method, backup server and mobile terminal |
| CN106656956A (en) * | 2016-09-27 | 2017-05-10 | 河海大学 | Ad hoc network opportunistic routing method avoiding malicious attacks |
| CN106793409A (en) * | 2016-12-30 | 2017-05-31 | 欧普照明股份有限公司 | Lighting device, terminal device and illuminator |
| CN110062301A (en) * | 2019-01-23 | 2019-07-26 | 中通服咨询设计研究院有限公司 | Route selection method, device, equipment and storage medium |
| CN110505600A (en) * | 2018-05-18 | 2019-11-26 | 华为技术有限公司 | Method for routing and device |
| CN111065146A (en) * | 2019-12-19 | 2020-04-24 | 西安邮电大学 | Ad hoc network route determining method based on link quality |
| CN114884899A (en) * | 2022-07-12 | 2022-08-09 | 之江实验室 | Multi-mode core network forwarding and scheduling method and device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101170560B (en) * | 2007-11-22 | 2011-12-14 | 复旦大学 | A broadcast protocol in self-organized network |
-
2009
- 2009-06-08 CN CN2009100862093A patent/CN101568164B/en not_active Expired - Fee Related
Cited By (28)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102316315A (en) * | 2010-06-29 | 2012-01-11 | 中国科学院软件研究所 | Real-time video transmission method |
| CN102316315B (en) * | 2010-06-29 | 2013-01-23 | 中国科学院软件研究所 | Real-time video transmission method |
| CN102387585A (en) * | 2010-08-30 | 2012-03-21 | 富士通株式会社 | Wireless communication network and communication method and communication nodes for wireless communication network |
| CN102387585B (en) * | 2010-08-30 | 2015-05-13 | 富士通株式会社 | Communication method and communication nodes for wireless communication network |
| US9025518B2 (en) | 2010-08-30 | 2015-05-05 | Fujitsu Limited | Wireless communication network, communication method and node used in wireless communication network |
| CN101945432A (en) * | 2010-09-16 | 2011-01-12 | 北京邮电大学 | Multi-rate opportunistic routing method for wireless mesh network |
| CN101945432B (en) * | 2010-09-16 | 2016-11-23 | 北京邮电大学 | A kind of multi tate chance method for routing for wireless mesh network |
| CN101969661A (en) * | 2010-10-27 | 2011-02-09 | 北京握奇数据***有限公司 | Method, device and system for transmitting data in mobile Ad hoc network |
| CN101969661B (en) * | 2010-10-27 | 2014-04-23 | 北京握奇数据***有限公司 | Method, device and system for transmitting data in mobile Ad hoc network |
| WO2012130084A1 (en) * | 2011-03-31 | 2012-10-04 | 华为技术有限公司 | Message multiple-transfer method, device and system |
| US8687634B2 (en) | 2011-03-31 | 2014-04-01 | Huawei Technologies Co., Ltd. | Method for diverting packet multiple times, apparatus and system |
| CN103119902A (en) * | 2011-09-20 | 2013-05-22 | 日本电气株式会社 | Communication system, policy management device, communication method, and program |
| CN103119902B (en) * | 2011-09-20 | 2014-03-26 | 日本电气株式会社 | Communication system, policy management device, communication method |
| CN102740392A (en) * | 2012-06-01 | 2012-10-17 | 华中科技大学 | Routing method based on layering geotagging in opportunistic network |
| CN102740392B (en) * | 2012-06-01 | 2014-07-23 | 华中科技大学 | Routing method based on layering geotagging in opportunistic network |
| CN102932866A (en) * | 2012-07-06 | 2013-02-13 | 北京邮电大学 | Opportunistic routing mechanism applicable to multi-radio-frequency multi-channel Ad hoc network |
| CN104410580A (en) * | 2014-11-28 | 2015-03-11 | 深圳市华威世纪科技股份有限公司 | Trusted security WiFi (Wireless Fidelity) router and data processing method thereof |
| CN106656956A (en) * | 2016-09-27 | 2017-05-10 | 河海大学 | Ad hoc network opportunistic routing method avoiding malicious attacks |
| CN106656956B (en) * | 2016-09-27 | 2019-10-18 | 河海大学 | A kind of Ad hoc network chance method for routing for evading malicious attack |
| CN106572166A (en) * | 2016-11-02 | 2017-04-19 | 广东欧珀移动通信有限公司 | Data transmission method, backup server and mobile terminal |
| CN106572166B (en) * | 2016-11-02 | 2019-07-05 | Oppo广东移动通信有限公司 | Data transmission method, backup server and mobile terminal |
| CN106793409A (en) * | 2016-12-30 | 2017-05-31 | 欧普照明股份有限公司 | Lighting device, terminal device and illuminator |
| CN110505600A (en) * | 2018-05-18 | 2019-11-26 | 华为技术有限公司 | Method for routing and device |
| CN110505600B (en) * | 2018-05-18 | 2022-05-10 | 华为技术有限公司 | Routing method and device |
| US11792124B2 (en) | 2018-05-18 | 2023-10-17 | Huawei Technologies Co., Ltd. | Routing method and apparatus to transmit data packets to nodes |
| CN110062301A (en) * | 2019-01-23 | 2019-07-26 | 中通服咨询设计研究院有限公司 | Route selection method, device, equipment and storage medium |
| CN111065146A (en) * | 2019-12-19 | 2020-04-24 | 西安邮电大学 | Ad hoc network route determining method based on link quality |
| CN114884899A (en) * | 2022-07-12 | 2022-08-09 | 之江实验室 | Multi-mode core network forwarding and scheduling method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101568164B (en) | 2011-01-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101568164B (en) | Opportunistic routing algorithm of Ad hoc network | |
| Yuan et al. | An optimized ad-hoc on-demand multipath distance vector (AOMDV) routing protocol | |
| Wu et al. | Performance study of a multipath routing method for wireless mobile ad hoc networks | |
| CN102148756B (en) | IPv6 over low power wireless personal area network (6LoWPAN) neighbor discovery-based tree routing method | |
| CN101932062B (en) | Multipath routing method in Ad Hoc network environment | |
| CN101489276B (en) | Multicast routing method for Ad Hoc network | |
| CN1645838B (en) | Self network organized and distance concerned multi-routing method for complete route information | |
| JP4072917B2 (en) | Packet relay method, communication path setting method, and communication path setting system | |
| CN102769885B (en) | Method for realizing routing in sensor network and sensor network | |
| CN102447686A (en) | Routing protocol of AODV (Ad hoc On-Demand Distance Vector Routing) application | |
| CN102984781B (en) | Neighbor node judgment method for wireless ad hoc network route | |
| WO2020156340A1 (en) | Data transmission method and apparatus | |
| CN101102283A (en) | A method and device for optimizing unknown unicast forward at wireless access point | |
| CN101686521B (en) | Network coding based method for searching route of wireless Ad hoc network | |
| CN102932866A (en) | Opportunistic routing mechanism applicable to multi-radio-frequency multi-channel Ad hoc network | |
| CN102170660A (en) | Multi-path route constructing method and system based on APDV (Ad Hoc On-demand Distance Vector) | |
| CN100536429C (en) | Method and system for data transmission in wireless net-like network | |
| CN106034322A (en) | Routing switching method based on chain quality in mobile ad hoc network | |
| CN108770003A (en) | A kind of self-organizing unmanned plane network routing discovering method based on particle group optimizing | |
| CN105007570B (en) | A kind of mobile ad-hoc network jamming control method based on OLSR agreement | |
| CN106850436A (en) | Mine hybrid wireless mesh network routing protocols based on virtual potential energy field | |
| CN103037436B (en) | Network coding perception wireless mesh routing protocol based on hybrid wireless mesh protocol (HWMP) | |
| CN101106520A (en) | Multi-routing technology with several independent root nodes based on AODV | |
| CN105072586A (en) | Management method for forwarding of broadcast message in embedded wireless ad hoc network | |
| CN104219156B (en) | A kind of multicast route method suitable for the aerial self-organizing network of stratification |
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: 20110105 Termination date: 20120608 |