CN106304184A - The route discovery of many tolerance amount based on AODV and the method for foundation - Google Patents

The route discovery of many tolerance amount based on AODV and the method for foundation Download PDF

Info

Publication number
CN106304184A
CN106304184A CN201610682018.3A CN201610682018A CN106304184A CN 106304184 A CN106304184 A CN 106304184A CN 201610682018 A CN201610682018 A CN 201610682018A CN 106304184 A CN106304184 A CN 106304184A
Authority
CN
China
Prior art keywords
node
route
path
factor
route requests
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
Application number
CN201610682018.3A
Other languages
Chinese (zh)
Other versions
CN106304184B (en
Inventor
陈佳品
郑�硕
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shanghai Jiaotong University
Original Assignee
Shanghai Jiaotong University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Shanghai Jiaotong University filed Critical Shanghai Jiaotong University
Priority to CN201610682018.3A priority Critical patent/CN106304184B/en
Publication of CN106304184A publication Critical patent/CN106304184A/en
Application granted granted Critical
Publication of CN106304184B publication Critical patent/CN106304184B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/021—Traffic management, e.g. flow control or congestion control in wireless networks with changing topologies, e.g. ad-hoc networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/0231—Traffic management, e.g. flow control or congestion control based on communication conditions
    • H04W28/0242—Determining whether packet losses are due to overload or to deterioration of radio communication conditions
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/08—Load balancing or load distribution
    • 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
    • H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • 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
    • H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
    • 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
    • H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
    • H04W40/14—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality based on stability
    • 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/246—Connectivity information discovery
    • 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
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention provides a kind of route discovery and the method for foundation of many tolerance amount based on AODV, the method requires that the node in wireless network does not only maintain jumping figure, and safeguard residue energy of node, energy turnover rate, node density these three tolerance amount, and above four tolerance amounts are encapsulated in a data structure, in the route discovery stage, tolerance amount in RREQ (route requests) can compare according to the rule of this method defined with the tolerance amount of node maintenance and update, and then finds and set up optimum routed path.The present invention effectively prevent node energy in the Route establishment stage consume unbalanced by introducing rational tolerance amount, the problem that communication channel is congested etc. has a strong impact on any wireless network services quality.It is effectively improved harmony and the communication efficiency of link communication load, improves the stability of link, balance node energy consumption, extend the wireless network life-span.

Description

The route discovery of many tolerance amount based on AODV and the method for foundation
Technical field
The present invention relates to route discovery in a kind of wireless network and create a mechanism, in particular it relates to one based on The route discovery of many tolerance amount of AODV and the method for foundation.
Background technology
Routing Protocol is one of important content of Ad Hoc wireless network research in recent years.Routing Protocol is responsible for building of route Stand and maintenance work, be ingredient particularly important in whole wireless network.Routing Protocol allow for adapt to Ad Hoc without Dynamically this characteristic of change of gauze network, provides routing iinformation accurately for node, ensures the communication between node, the most maximum Reduce and control the expense of bag and improve the performance of whole wireless network.
AODV (Ad hoc On-Demand Distance Vector Routing, Ad Hoc demand distance vector) is Ad Typical on-demand routing protocol in Hoc wireless network, it safeguards the data in routing table dynamically as needed, and each node is only Set up and safeguard the route of every other node in the routing iinformation of oneself required destination node rather than the whole network.Although road Caused certain time delay to occur by the process of foundation, but the resource of whole wireless network can be saved, and node can be solved The situation of the route changing that dynamic mobile is caused.
In Ad Hoc wireless network, due to mobility and the complexity of local environment of node, cause Node distribution not Equilibrium, and optimal path list relies on minimum hop count, the hub node of conveniently situation can be used by active route continually, and one Aspect this that such node energy can be caused to consume is too fast, once hub node is delayed machine, make to whole any wireless network services quality Become havoc；On the other hand, hub node is used by a plurality of route simultaneously, and communication is easy to overburden, causes information to be blocked up, Increase time delay.D.J.Vergados, N.A.Pantazis and D.D.Vergados be at " Mobile Networks and Applications " " the Energy-efficient route selection strategies for that delivers on periodical Wireless sensor networks " in propose replace minimum hop count using dump energy as optimal route selection strategy. But, single using dump energy as unique optimal path standard, and the most explicitly consider that minimum hop count can make being routed through of discovery Long, though having looked after node energy consumption to add propagation delay time.S.J.de Couto, D.Aguayo, J.Bicket and R.Morris is at " In Proceedings of the 9th Annual International Conference on Mobile Computing and Networking " A high-throughput path metric for is proposed in meeting Multi-hop wireless routing, for AODV introduce energy turnover rate equalize wireless network each node communication load with Prevent the overweight information caused of traffic load from blocking up and conflicting.Because information block up can cause packet loss and re-transmission etc. increase time delay and Reduce route handling capacity.But this mode the most explicitly considers that path and residue energy of node still can bring time delay to increase Add the threat the most dead with hub node.If it is considered that neighbours' density of node, then so that set up to be routed across node thick Close region, on the one hand improves the quality communicated and the most also provides abundant replacement joint for the reparation of interrupting that route is possible Point.
Certainly, the factor affecting Ad Hoc wireless network performance is a lot, and the route discovery of single index and method for building up are difficult Exempt to attend to one thing and lose sight of another.But most route discovery and method for building up are the most all single indexs.
Summary of the invention
For deficiency of the prior art, the present invention provides route discovery and the foundation of a kind of many tolerance amount based on AODV Method, the method use many tolerance amount, it is possible in route finding process in view of node energy load and traffic load feelings Condition, finds more structurally sound path node, and path can be made to pass dense region to be provided for the interruption reparation being likely to occur simultaneously Necessary substitute node.
The routed path that the invention provides a kind of high reliability based on AODV finds and method for building up, and described method is wanted Ask the node in wireless network not only maintain jumping figure, and safeguard residue energy of node, energy turnover rate, node density these three Tolerance amount, and above four tolerance amounts are encapsulated in a data structure；In the route discovery stage, in route requests RREQ Four tolerance amounts compare with four tolerance amounts of node maintenance and update, and then find and set up optimum routed path.
Concrete, said method comprising the steps of:
S1: all node updates data structures in wireless network, it is provided that and safeguard dump energy, energy turnover rate, joint The data structure of dot density, prepares for receiving route requests RREQ suitably response.
Preset jumping figure, dump energy, energy turnover rate, the weighted value of node density, to adapt to different environment pair The demand of wireless network protocol.
Many tolerance amount i.e. jumping figure, dump energy, energy turnover rate, node density merge and form path discovery factor CM:
CM=δH*HC+δE*EM+δT*EDR+δD*DM
HC, EM, EDR and DM are respectively the jumping figure of node, dump energy, energy turnover rate and node density.δH、δE、δT、 δ D represents the weight of HC, EM, EDR, DM respectively；
S2: when certain node has transmission information requirement in wireless network, find the most effectively to arrive in its routing table mesh The path of node, broadcast route request RREQ initiates the discovery of many tolerance routes and sets up process.Route requests RREQ is except mark Outside the information of route requests RREQ of quasi-AODV, add optimal path factor PF.
S3: the most sometime, in wireless network, non-destination node receives route requests RREQ that source node sends:
First, node takes out destination node IP from route requests RREQ information and mates with self IP, finds oneself It it not source node node to be looked for；
Then, node takes out source node IP and route requests RREQ ID to judge whether to receive from route requests RREQ Cross identical route requests RREQ, if having been received by and processing, the most directly abandon this bag；If received for the first time, then node Carry out routing table update according to the content of route requests RREQ, and run off according to the jumping figure of self maintained, dump energy, energy Rate, node density field update route requests RREQ, and broadcast it.
Preferably, in described S3, the renewal step that node receives route requests RREQ for the first time is as follows:
S3.1: node sets up the reverse route of source node according to the information that route requests RREQ received is carried.
S3.2: the jumping figure of Node extraction self maintained, dump energy, energy turnover rate, node density are equivalent, according to presetting Weight obtain own path find factor CM, own path is found the optimal path factor in factor CM and route requests RREQ PF sum updates the path discovery factor PF field into route requests RREQ.
Route requests RREQ after the renewal of S3.3: node broadcasts.
S4: sometime, destination node receives route requests RREQ of the forwarding via intermediate node:
First, destination node can confirm self to be exactly source node node to be looked for, Next, it is determined whether receive this for the first time Route requests RREQ of batch, if receiving for the first time, destination node is that this route requests RREQ opens widow time wait With the arrival of batch route requests RREQ, utilize route requests RREQ information to be established to the anti-of source node in routing table simultaneously To route.Otherwise, the routing table of the information updating destination node of foundation route requests RREQ.
Preferably, in described S4, destination node operates as follows according to the renewal of route requests RREQ:
S4.1: find destination node to arrive the route entry of source node in routing table, compare in entry optimal path because of Optimal path factor PF field value in sub-PF Yu RREQ (route requests).If the former is little, then give up this route requests RREQ, no Then, update the optimal path value of route entry by PF value in route requests RREQ, and update by the upper hop of route requests RREQ The down hop of entry.
S5: destination node is selected optimal path in widow time, and by the reverse route of destination node to source node Singlecast router replys RREP, and routing reply RREP hop count field is revised as optimal path factor PF, and extracts the jumping of self maintained Number, dump energy, energy turnover rate, node density are equivalent, obtain path discovery factor CM of self according to the weight preset, and use This path discovery factor CM value updates the optimal path factor PF field of routing reply RREP.
S6: the hop count field at the routing table entry of all nodes of wireless network is revised as optimal path factor PF, middle Node receives routing reply RREP, is established to the route entry of destination node according to routing reply RREP information, and will route The optimal path factor PF value replied in RREP updates into route entry.Then, according to multiple measurement and the weight of self maintained The sum of products i.e. self path discovery factor CM, add optimal path factor PF value in routing reply RREP and update route Replying RREP, clean culture is to down hop.
It is preferably based on route discovery and the method for foundation of many tolerance amount of AODV, not using minimum hop count as optimum The criterion in path, but the optimal path factor PF size measured with many tolerance is to select optimal path.PF value is the least Then delegated path is the most reliable more excellent.
PF p = Σ i ∈ p CM i
Optimal path factor PF is the concept for routed path, and wherein subscript P refers to a certain bar routed path, and i then refers to I-th node in path, CMiRefer to the value of the path discovery factor of i-th node in the p of path.
Compared with prior art, the present invention has a following beneficial effect:
The present invention does not has strict restriction for the scale of wireless network, is particularly suited for topology frequently change, node and divides The Ad Hoc wireless network that cloth is uneven, requirement of real-time is higher, it is possible to be prevented effectively from node energy and consume unbalanced, communication channel The problem having a strong impact on any wireless network services quality such as congested, be effectively improved link traffic load harmony with communicate Efficiency, improves the stability of link, alleviates node and frequently switches the communication delay brought, balances node energy consumption, Extend the wireless network life-span.
Accompanying drawing explanation
By the detailed description non-limiting example made with reference to the following drawings of reading, the further feature of the present invention, Purpose and advantage will become more apparent upon:
Fig. 1 is the method flow block diagram of one embodiment of the invention；
Fig. 2 is Route establishment process schematic in one embodiment of the invention.
Detailed description of the invention
Below in conjunction with specific embodiment, the present invention is described in detail.Following example will assist in the technology of this area Personnel are further appreciated by the present invention, but limit the present invention the most in any form.It should be pointed out that, the ordinary skill to this area For personnel, without departing from the inventive concept of the premise, it is also possible to make some deformation and improvement.These broadly fall into the present invention Protection domain.
As in figure 2 it is shown, exist such as the topology of N1, N2, N3, N4, N5, N6 relation in the wireless network.N1 orientation node N6 The demand of transmission information and do not reach the effective routing iinformation of N6 in its routing table.Then, the on-demand initiation of N1 arrives N6's The discovery in path and set up process.In certain moment, the tolerance amount such as following table of each node:
The route discovery of the many tolerance amount based on AODV according to present invention offer and the method for foundation, including implementing as follows Process step:
S1: all node updates data structures in wireless network, it is provided that and safeguard dump energy EM, energy turnover rate EDR, the data structure of node density DM, prepare for receiving RREQ (route requests) suitably response.
Preset jumping figure, dump energy, energy turnover rate, the weighted value of node density, to adapt to different environment pair The demand of wireless network protocol.
Many tolerance amount i.e. jumping figure, dump energy, energy turnover rate, node density, to form node road in such a way Footpath finds factor CM, and many tolerance amount is as follows with path discovery factor CM relation:
CM=δH*HC+δE*EM+δT*EDR+δD*DM
HC, EM, EDR and DM are respectively the jumping figure of this method defined, dump energy, energy turnover rate and node density.δ H, δ E, δ T, δ D represents the weight of HC, EM, EDR, DM respectively.
The present embodiment, presets δ H=0.1, δ E=0.8, δ T=0, δ D=0.1.Certainly, in other embodiments, these ginsengs Number can also be preset as other numerical value.
S2: when N1 node has transmission information requirement in wireless network, find the most effectively to arrive in its routing table purpose The path of node N6, broadcast route request RREQ initiates the discovery measuring route more and sets up process.Route requests RREQ is except mark Outside the information of route requests RREQ of quasi-AODV, add optimal path factor PF.
S3: the most sometime, what non-destination node N2 in wireless network, N3, N4, N5 received that source node N1 sends please Seek route requests RREQ arriving N6.
First, these intermediate nodes of N2, N3, N4, N5 take out destination node IP from the route requests RREQ information received Mate with self IP, find it oneself is not source node destination node to be looked for.
Then, non-destination node takes out source node IP and serial number to judge whether to receive phase from route requests RREQ Same RREQ (route requests).If having been received by and processing, the most directly abandon this bag；If received for the first time, the most non-purpose Node carries out routing table update according to the content of route requests RREQ, and according to the jumping figure of self maintained, dump energy, energy stream Mistake rate, node density field update route requests RREQ, and broadcast it.
Further, in described S3, the renewal step that non-destination node receives route requests RREQ for the first time is as follows:
S3.1: non-destination node sets up the reverse road of source node according to the information that route requests RREQ received is carried By.Intermediate node N2, N3, N4, N5 build in routing table according to source node and upper hop information in route requests RREQ received The vertical reverse route arriving N1.
S3.2: non-destination node extracts the jumping figure of self maintained, dump energy, energy turnover rate, node density equivalence, depends on Obtain own path according to default weight and find factor CM, own path is found optimum road in factor CM and route requests RREQ Footpath factor PF sum updates the optimal path factor PF field into route requests RREQ.
Route requests RREQ after the renewal of S3.3: node broadcasts.
S4: sometime, destination node N6 receives the road from source node N1 forwarded via neighbor node N3 or N5 By request RREQ.
First, destination node N6 can confirm self to be exactly source node destination node to be looked for, Next, it is determined whether for the first time Receiving route requests RREQ of this batch, if receiving for the first time, destination node N6 is that this route requests RREQ opens window Time waits the arrival with batch route requests RREQ, utilizes route requests RREQ information to be established to source in routing table simultaneously The reverse route of node N1.Otherwise, the routing table of the information updating destination node of foundation route requests RREQ.
Further, in described S4, destination node N6 operates as follows according to the renewal of route requests RREQ:
S4.1: find destination node N6 to arrive the route entry of source node N1 in routing table, compares optimum road in entry Footpath factor PF and the PF field value in route requests RREQ.If the former is little, then give up this route requests RREQ, otherwise, by route The optimal path PF value of optimal path factor PF value renewal route entry in request RREQ, and by the upper hop of route requests RREQ Update the down hop of entry.
Here have two representative path: 1. N1-> N2-> N3-> N6 and 2. N1-> N2-> N4-> N5-N6.In destination node N6 is in the widow time of the route requests RREQ unlatching of source node N1, can successively receive by path 1. with path 2. Route requests RREQ.The PF=1.75 of path route requests RREQ 1., path route requests 2. is obtained according to said method The PF=1.65 of RREQ, so 1. the optimal path section of sentencing then path is the most obviously better than path, final path route requests 2. RREQ information can be used to update the reverse route entry of the arrival source node N1 of destination node N6.
The described optimal path section of sentencing, not using minimum hop count as the criterion of optimal path, but with optimal path because of Sub-PF size selects optimal path.Optimal path factor PF value PFpThe least then delegated path is the most reliable more excellent.
PF p = Σ i ∈ p CM i
Optimal path factor PF is the concept for routed path, and wherein subscript P refers to a certain bar routed path, and i then refers to I-th node in path, CMiRefer to the value of the path discovery factor of i-th node in the p of path.
S5: destination node N6 selects optimal path by optimal path factor PF in widow time, it is clear that 2. path is Optimum in all possible path.Widow time terminates reversely to route N6-> N5-by destination node N6 to source node N1 > N4-> N2-N1 singlecast router replys RREP, and the hop count field of routing reply RREP is revised as optimal path factor PF.And extract from The jumping figure of body maintenance, dump energy, energy turnover rate, node density are equivalent, obtain own path according to the weight preset and find Factor CM, updates the optimal path PF field of routing reply RREP by this path discovery factor CM value.
S6: the hop count field at the routing table entry of all nodes of wireless network is revised as optimal path factor PF.Reversely Intermediate node N5, N4, N2 in routed path receives routing reply RREP, is established to purpose according to routing reply RREP information The route entry of node, and the optimal path factor PF value in routing reply RREP is updated into route entry.Then, according to certainly The sum of products of multiple measurement and weight that body is safeguarded i.e. self path discovery factor CM, adds in routing reply RREP Shortest path PF value updates routing reply RREP, and clean culture is to down hop.
Until source node N1 receive N2 transmission via N6-> routing reply replied of destination node N6 of N5-> N4-> N2 RREP bag, sets up the route entry of the arrival N6 of N1 according to routing reply RREP bag.Optimal path with routing reply RREP bag PF field value updates the PF field of route entry, updates the down hop letter of route entry by the upper hop in routing reply RREP Breath.
Through above step, set up from the achieve the goal reliable routing path of node N6 of source node N1.
It is above the enforcement of reliability route discovery with foundation is described in detail, runs into new route need, all can use Said method carries out route discovery and foundation.
Above the specific embodiment of the present invention is described.It is to be appreciated that the invention is not limited in above-mentioned Particular implementation, those skilled in the art can make various deformation or amendment within the scope of the claims, this not shadow Ring the flesh and blood of the present invention.

Claims (5)

1. the route discovery of many tolerance amount based on AODV and the method for foundation, it is characterised in that:
Jumping figure, dump energy, energy turnover rate, these four tolerance amounts of node density are encapsulated in one by the node in wireless network In data structure；
In the route discovery stage, four tolerance amounts of four tolerance amounts in route requests and node maintenance compare and more Newly, and then find and set up optimum routed path.
The route discovery of many tolerance amount based on AODV the most according to claim 1 and the method for foundation, it is characterised in that: Comprise the following steps:
S1: all node updates data structures in wireless network, it is provided that and safeguard that dump energy, energy turnover rate, node are close The data structure of degree, prepares for receiving route requests response；
Preset jumping figure, dump energy, energy turnover rate, the weighted value of node density, to adapt to different environment to wireless The demand of procotol；
Many tolerance amount i.e. jumping figure, dump energy, energy turnover rate, node density merge and form path discovery factor CM:
CM=δH*HC+δE*EM+δT*EDR+δD*DM
HC, EM, EDR and DM are respectively the jumping figure of node, dump energy, energy turnover rate and node density；δ H, δ E, δ T, δ D divide Do not represent the weight of HC, EM, EDR, DM；
When each node of S2: certain in wireless network has transmission information requirement, find the most effectively to arrive in its routing table purpose The path of node, broadcast route request initiation measures the discovery routeing and sets up process, and route requests is except the road of standard AODV Outside by the information asked, add optimal path factor PF；
S3: the most sometime, in wireless network, non-destination node receives the route requests that source node sends:
First, described non-destination node is taken out destination node IP from routing information request and is mated with self IP, finds certainly Oneself is not the destination node that source node is to be looked for；
Then, described non-destination node takes out source node IP and route requests ID to judge whether to receive phase from route requests Same route requests, if having been received by and processing, the most directly abandons this bag；If received for the first time, the most described non-purpose saves Point carries out routing table update according to the content of route requests, and according to the jumping figure of self maintained, dump energy, energy turnover rate, Node density field updates route requests, and broadcasts it；
S4: sometime, destination node receives the route requests forwarded via intermediate node:
First, destination node can confirm self to be exactly source node node to be looked for, Next, it is determined whether receive this batch for the first time Route requests, if receiving for the first time, destination node be this route requests open that widow time waits please with batch route The arrival asked, utilizes routing information request to be established to the reverse route of source node in routing table simultaneously；Otherwise, according to route The routing table of the information updating destination node of request；
S5: destination node is selected optimal path in widow time, and reversely route clean culture by destination node to source node Routing reply RREP, routing reply RREP hop count field is revised as optimal path factor PF, and extracts the jumping figure of self maintained, remains Complementary energy, energy turnover rate, node density value, obtain own path according to the weight preset and find factor CM, send out with this path Existing factor CM value updates the PF field of routing reply RREP；
S6: the hop count field at the routing table entry of all nodes of wireless network is revised as optimal path factor PF, intermediate node Receive routing reply RREP, be established to the route entry of destination node according to routing reply RREP information, and by routing reply Optimal path factor PF value in RREP updates into route entry, then, according to the multiple measurement of self maintained and taking advantage of of weight Long-pending sum i.e. self path discovery factor CM, adds optimal path factor PF value in routing reply RREP and updates routing reply RREP, clean culture is to down hop.
The route discovery of many tolerance amount based on AODV the most according to claim 2 and the method for foundation, it is characterised in that In described S3, non-destination node receives the renewal of route requests for the first time, and step is as follows:
S3.1: non-destination node sets up the reverse route of source node according to the information that the route requests received is carried；
S3.2: non-destination node extracts the jumping figure of self maintained, dump energy, energy turnover rate, node density value, according to presetting Weight obtain own path and find factor CM, own path is found in factor CM and the route requests that receives optimal path because of Sub-PF sum updates the path discovery factor PF field into route requests；
Route requests after the broadcast renewal of S3.3: non-destination node.
The route discovery of many tolerance amount based on AODV the most according to claim 2 and the method for foundation, it is characterised in that In described S4, destination node, according to the routing table of the information updating destination node of route requests, operates as follows:
Finding destination node to arrive the route entry of source node in routing table, comparing the optimal path factor in entry please with route PF field value in asking, if the former is little, then gives up this route requests, otherwise, updates route entry by PF value in route requests Optimal path value, and the down hop of entry is updated by the upper hop of route requests.
The route discovery of many tolerance amount based on AODV the most according to claim 2 and the method for foundation, it is characterised in that Not using minimum hop count as the criterion of optimal path, but the optimal path factor PF size measured with many tolerance is selected Select optimal path, optimal path factor PF value PFpThe least then delegated path is the most reliable more excellent；
PF p = Σ i ∈ p CM i
Optimal path factor PF is the concept for routed path, and wherein subscript P refers to a certain bar routed path, and i then refers to path Middle i-th node, CMiRefer to the value of the path discovery factor of i-th node in the p of path.
CN201610682018.3A 2016-08-17 2016-08-17 Multi-metric route discovery and establishment method based on AODV (Ad hoc on-demand distance vector) Expired - Fee Related CN106304184B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610682018.3A CN106304184B (en) 2016-08-17 2016-08-17 Multi-metric route discovery and establishment method based on AODV (Ad hoc on-demand distance vector)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610682018.3A CN106304184B (en) 2016-08-17 2016-08-17 Multi-metric route discovery and establishment method based on AODV (Ad hoc on-demand distance vector)

Publications (2)

Publication Number Publication Date
CN106304184A true CN106304184A (en) 2017-01-04
CN106304184B CN106304184B (en) 2020-11-06

Family

ID=57679595

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610682018.3A Expired - Fee Related CN106304184B (en) 2016-08-17 2016-08-17 Multi-metric route discovery and establishment method based on AODV (Ad hoc on-demand distance vector)

Country Status (1)

Country Link
CN (1) CN106304184B (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106851727A (en) * 2017-01-23 2017-06-13 西安电子科技大学 The method that MANET congestion control is realized based on multipath routing protocols
CN107659502A (en) * 2017-11-01 2018-02-02 上海海洋大学 A kind of on-demand routing protocol algorithm based on energy efficiency and link reliability
CN110719618A (en) * 2019-10-24 2020-01-21 辰芯科技有限公司 Routing method, device, terminal and storage medium of wireless ad hoc network
CN110992177A (en) * 2019-10-31 2020-04-10 中国科学院计算技术研究所 Block chain flux improving method and system based on off-chain channel route evaluation mechanism
CN114374639A (en) * 2021-12-01 2022-04-19 中国科学院上海微系统与信息技术研究所 Air awakening-based LoRa-Mesh networking method and mobile terminal networking method

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101083616A (en) * 2007-07-05 2007-12-05 上海交通大学 Ant algorithm based wireless self-organized network energy-saving routing method on demand
CN101123576A (en) * 2007-09-20 2008-02-13 武汉理工大学 A mobile self-organized network path selection method based on bandwidth restraint and minimum load
CN101932062A (en) * 2010-09-03 2010-12-29 电子科技大学 Multipath routing method in Ad Hoc network environment
US20150078182A1 (en) * 2011-09-10 2015-03-19 Arnab Das Methods systems, and devices for robustness improvement in a mobile ad hoc network using reputation-based routing

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101083616A (en) * 2007-07-05 2007-12-05 上海交通大学 Ant algorithm based wireless self-organized network energy-saving routing method on demand
CN101123576A (en) * 2007-09-20 2008-02-13 武汉理工大学 A mobile self-organized network path selection method based on bandwidth restraint and minimum load
CN101932062A (en) * 2010-09-03 2010-12-29 电子科技大学 Multipath routing method in Ad Hoc network environment
US20150078182A1 (en) * 2011-09-10 2015-03-19 Arnab Das Methods systems, and devices for robustness improvement in a mobile ad hoc network using reputation-based routing

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
张希婕: "Ad Hoc网络混合路由协议的研究", 《信息科技辑》 *

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106851727A (en) * 2017-01-23 2017-06-13 西安电子科技大学 The method that MANET congestion control is realized based on multipath routing protocols
CN106851727B (en) * 2017-01-23 2020-01-31 西安电子科技大学 Method for realizing self-organizing network congestion control based on multi-path routing protocol
CN107659502A (en) * 2017-11-01 2018-02-02 上海海洋大学 A kind of on-demand routing protocol algorithm based on energy efficiency and link reliability
CN110719618A (en) * 2019-10-24 2020-01-21 辰芯科技有限公司 Routing method, device, terminal and storage medium of wireless ad hoc network
CN110719618B (en) * 2019-10-24 2022-02-08 辰芯科技有限公司 Routing method, device, terminal and storage medium of wireless ad hoc network
CN110992177A (en) * 2019-10-31 2020-04-10 中国科学院计算技术研究所 Block chain flux improving method and system based on off-chain channel route evaluation mechanism
CN110992177B (en) * 2019-10-31 2023-09-12 中国科学院计算技术研究所 Block chain flux improving method and system based on out-of-chain channel route evaluation mechanism
CN114374639A (en) * 2021-12-01 2022-04-19 中国科学院上海微系统与信息技术研究所 Air awakening-based LoRa-Mesh networking method and mobile terminal networking method
CN114374639B (en) * 2021-12-01 2023-09-22 中国科学院上海微系统与信息技术研究所 LoRa-Mesh networking method based on air wake-up and mobile terminal networking method

Also Published As

Publication number Publication date
CN106304184B (en) 2020-11-06

Similar Documents

Publication Publication Date Title
CN106304184A (en) The route discovery of many tolerance amount based on AODV and the method for foundation
CN101711048B (en) Method for choosing gateway in integrating process of mobile self-organization network and Internet
US20080205332A1 (en) Hybrid proactive on-demand routing in wireless networks
CN100556000C (en) Set up the method for route under a kind of unidirectional link environment
WO2009157986A3 (en) Load management in wireless mesh communications networks
WO2009157984A3 (en) Node discovery and culling in wireless mesh communications networks
WO2009157985A3 (en) Route and link evaluation in wireless mesh communications networks
WO2010002440A3 (en) Network utilities in wireless mesh communications networks
CN100459543C (en) Routing method of hybrid network formed by honeycomb network and self-combining network
Sampath et al. An ACO algorithm for effective cluster head selection
CN102264114A (en) ZigBee sensor network tree route low-expense optimization method
Sharma et al. A comparative review on routing protocols in MANET
CN110995333B (en) Cluster QoS route design method
CN102149161A (en) Hierarchical and regular mesh network routing method
CN105025545B (en) The method for routing suitable for wireless network based on competition forwarding
Sebastian et al. A survey on load balancing schemes in RPL based Internet of Things
CN105007570B (en) A kind of mobile ad-hoc network jamming control method based on OLSR agreement
Hui A novel qos routing algorithm in wireless mesh networks
CN107819686A (en) Unmanned plane MANET geography information method for routing and system based on position prediction
Sinha et al. Effect of varying node density and routing zone radius in ZRP: a simulation based approach
Kushwaha et al. M-EALBM: A modified approach energy aware load balancing multipath routing protocol in MANET
CN109874126A (en) A kind of application method of wireless communication technique in car networking V2V
CN110971524B (en) Centralized routing method for wireless sensor network
Li et al. Multiple ferry routing for the opportunistic networks
CN107889081A (en) D2D Ad Hocs are by method and system

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20201106

Termination date: 20210817

CF01 Termination of patent right due to non-payment of annual fee