CN106304184B - Multi-metric route discovery and establishment method based on AODV (Ad hoc on-demand distance vector) - Google Patents

Multi-metric route discovery and establishment method based on AODV (Ad hoc on-demand distance vector) Download PDF

Info

Publication number
CN106304184B
CN106304184B CN201610682018.3A CN201610682018A CN106304184B CN 106304184 B CN106304184 B CN 106304184B CN 201610682018 A CN201610682018 A CN 201610682018A CN 106304184 B CN106304184 B CN 106304184B
Authority
CN
China
Prior art keywords
node
route
routing
destination node
path
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
Application number
CN201610682018.3A
Other languages
Chinese (zh)
Other versions
CN106304184A (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

Images

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 multi-metric route discovery and establishment method based on AODV, which requires that a node in a wireless network not only maintains hop count, but also maintains three metrics of node residual energy, energy loss rate and node density, and encapsulates the four metrics in a data structure, and in a route discovery stage, the metric in RREQ (route request) and the metric maintained by the node are compared and updated according to the rules specified by the method, so as to discover and establish an optimal route path. The invention effectively avoids the problems of unbalanced node energy consumption, information channel congestion and the like which seriously affect the service quality of the wireless network in the route establishment stage by introducing reasonable measurement quantity. The link communication load balance and the communication efficiency are effectively improved, the link stability is improved, the node energy consumption is balanced, and the service life of a wireless network is prolonged.

Description

Multi-metric route discovery and establishment method based on AODV (Ad hoc on-demand distance vector)
Technical Field
The invention relates to a route discovery and establishment mechanism in a wireless network, in particular to a multi-metric route discovery and establishment method based on AODV.
Background
Routing protocols are one of the important contents of the research on Ad Hoc wireless networks in recent years. The routing protocol is responsible for the establishment and maintenance of the route, and is an extremely important component in the whole wireless network. The routing protocol must be able to adapt to the characteristic of dynamic change of the Ad Hoc wireless network, provide accurate routing information for the nodes, ensure the communication between the nodes, and simultaneously reduce the overhead of control packets to the maximum to improve the performance of the whole wireless network.
AODV (Ad Hoc On-Demand Distance Vector Routing) is a typical On-Demand Routing protocol in Ad Hoc wireless networks, which dynamically maintains data in a Routing table as needed, and each node only establishes and maintains Routing information of a destination node required by itself, not Routing of all other nodes in the whole network. Although a certain delay is caused in the route establishing process, the resources of the whole wireless network can be saved, and the condition of route change caused by the dynamic movement of the nodes can be solved.
In an Ad Hoc wireless network, due to the mobility of nodes and the complexity of the environment, the nodes are unevenly distributed, the optimal path depends on the minimum hop count, and the hub nodes with superior geographic positions are frequently actively routed and used, so that on one hand, the nodes are excessively high in energy consumption, and once the hub nodes go down, the service quality of the whole wireless network is fatally attacked; on the other hand, the hub node is used by a plurality of routes at the same time, so that communication is easy to overload, information congestion is caused, and delay is increased. The "Energy-efficiency selection strategies for wireless sensor Networks" published in the "Mobile Networks and applications" by d.j.vergados, n.a.pantazines and d.d.vergados propose to replace the minimum number of hops by the residual Energy as an optimal path selection strategy. However, the residual energy is used as the only optimal path criterion, and the minimum hop count is not considered explicitly, so that the discovered route is too long, and the transmission delay is increased in consideration of the energy consumption of the nodes. The method comprises the steps of S.J.de Couto, D.Aguayo, J.Bicket and R.Morris, A high-throughput path method for multi-hop wireless routing is proposed at the meeting of 'In Proceedings of the 9th Annual Conference on Mobile Computing and Networking', and an energy loss rate is introduced for AODV to balance communication loads of nodes of a wireless network so as to prevent information congestion and conflict caused by overweight communication loads. Because information congestion can cause increased time delay of packet loss, retransmission and the like and reduce the routing throughput. However, this approach does not explicitly consider the path length and the node residual energy, and still poses the threats of increased delay and early death of the junction node. If the neighbor density of the node is considered, the established route can pass through a dense area of the node, on one hand, the communication quality is improved, and on the other hand, abundant alternative nodes are provided for repairing possible interruption of the route.
Of course, there are many factors affecting the performance of the Ad Hoc wireless network, and the route discovery and establishment method with a single index is difficult to avoid. But most route discovery and establishment methods are single indexes.
Disclosure of Invention
Aiming at the defects in the prior art, the invention provides a multi-metric route discovery and establishment method based on AODV, which adopts multi-metric quantity, can discover more reliable path nodes by considering node energy load and communication load conditions in the route discovery process, and simultaneously enables the path to pass through a dense area to provide necessary alternative nodes for the possible interrupt repair.
The invention provides a high-reliability route path discovering and establishing method based on AODV, which requires that a node in a wireless network not only maintains hop count, but also maintains three measurement quantities, namely node residual energy, energy loss rate and node density, and encapsulates the four measurement quantities in a data structure; in the route discovery phase, four metric quantities in the route request RREQ are compared and updated with four metric quantities maintained by the node, so as to discover and establish an optimal route path.
Specifically, the method comprises the following steps:
s1: all nodes in the wireless network update the data structure, provide and maintain data structures of remaining energy, energy drain rate, node density, and provide for receiving route requests RREQ and responding appropriately.
The hop count, the residual energy, the energy loss rate and the weighted value of the node density are preset so as to adapt to the requirements of different environments on the wireless network protocol.
The multi-measurement quantity, namely hop count, residual energy, energy loss rate and node density are fused to form a path discovery factor CM:
CM＝H*HC+E*EM+T*EDR+D*DM
HC. EM, EDR and DM are hop count, residual energy, energy loss rate and node density of the node respectively. H. E, T, D represent the weights of HC, EM, EDR, DM, respectively;
s2: when a certain node in the wireless network has a requirement for sending information, the node discovers that no effective path reaching a destination node exists in a routing table of the node, and broadcasts a routing request RREQ to initiate a multi-metric route discovery and establishment process. And adding the optimal path factor PF to the route request RREQ except the information of the route request RREQ of the standard AODV.
S3: at some subsequent time, the non-destination node in the wireless network receives the route request RREQ sent by the source node:
firstly, the node takes out a destination node IP from the route request RREQ information to match with the IP of the node, and finds that the node is not the node to be found by the source node;
then, the node takes out the source node IP and the route request RREQ ID from the route request RREQ to judge whether the same route request RREQ is received or not, if the same route request RREQ is received and processed, the packet is directly discarded; if the route request RREQ is received for the first time, the node updates a route table according to the content of the route request RREQ, updates the route request RREQ according to the hop count, the residual energy, the energy loss rate and the node density field which are maintained by the node, and broadcasts the route request RREQ.
Preferably, in S3, the updating step of the node receiving the route request RREQ for the first time is as follows:
s3.1: the node establishes a reverse route to the source node according to the information carried by the received route request RREQ.
S3.2: the node extracts the values of hop count, residual energy, energy loss rate and node density maintained by the node, obtains a self path discovery factor CM according to a preset weight, and updates the sum of the self path discovery factor CM and an optimal path factor PF in a route request RREQ into a path discovery factor PF field of the route request RREQ.
S3.3: the node broadcasts the updated route request RREQ.
S4: at some point, the destination node receives the forwarded route request RREQ via the intermediate node:
firstly, the destination node confirms that the destination node is the node to be found by the source node, then, whether the route request RREQ of the batch is received for the first time is judged, if the route request RREQ is received for the first time, the destination node opens a window time for the route request RREQ to wait for the arrival of the route request RREQ of the same batch, and meanwhile, the reverse route reaching the source node is established in a route table by utilizing the information of the route request RREQ. Otherwise, updating the routing table of the destination node according to the information of the routing request RREQ.
Preferably, in S4, the updating operation of the destination node according to the route request RREQ is as follows:
s4.1: finding the route entry of destination node to source node in the route table, comparing the optimal path factor PF in the entry with the optimal path factor PF field value in RREQ (route request). If the former is small, the route request RREQ is abandoned, otherwise, the PF value in the route request RREQ is used for updating the optimal route value of the route entry, and the last hop of the route request RREQ is used for updating the next hop of the entry.
S5: the method comprises the steps that a destination node selects an optimal path within window time, unicast routing reply RREP is carried out through a reverse route from the destination node to a source node, a hop number field of the routing reply RREP is modified into an optimal path factor PF, the hop number, the residual energy, the energy loss rate and the node density which are maintained by the destination node are extracted, a path discovery factor CM of the destination node is obtained according to preset weight, and the optimal path factor PF field of the routing reply RREP is updated by the path discovery factor CM.
S6: and modifying hop number fields of routing table entries of all nodes of the wireless network into an optimal path factor PF, receiving the route reply RREP by the intermediate node, establishing a route entry reaching a destination node according to the route reply RREP information, and updating the optimal path factor PF value in the route reply RREP into the route entry. Then, updating the route reply RREP according to the sum of the products of the self-maintained multi-metric value and the weight, namely the self-path discovery factor CM, and the optimal path factor PF value in the route reply RREP, and unicasting the route reply RREP to the next hop.
Preferably, the method for discovering and establishing the multi-metric route based on AODV does not use the minimum hop count as the criterion for determining the optimal path, but uses the size of the optimal path factor PF obtained by the multi-metric route to select the optimal path. The smaller the PF value is, the more reliable and better the path is.
Figure BDA0001081809290000041
The optimal path factor PF is a concept for a routing path, where a subscript P refers to a certain routing path, i refers to the ith node, CM, in the pathiIt is the value of the path discovery factor for the ith node in path p.
Compared with the prior art, the invention has the following beneficial effects:
the invention has no strict limitation on the scale of the wireless network, is particularly suitable for the Ad Hoc wireless network with frequent topology change, uneven node distribution and higher real-time requirement, can effectively avoid the problems of unbalanced node energy consumption, congestion of an information channel and the like which seriously affect the service quality of the wireless network, effectively improves the balance of the communication load and the communication efficiency of a link, improves the stability of the link, relieves the communication delay caused by frequent node switching, balances the node energy consumption and prolongs the service life of the wireless network.
Drawings
Other features, objects and advantages of the invention will become more apparent upon reading of the detailed description of non-limiting embodiments with reference to the following drawings:
FIG. 1 is a block diagram of a method flow according to an embodiment of the present invention;
fig. 2 is a schematic diagram of a route establishment process according to an embodiment of the present invention.
Detailed Description
The present invention will be described in detail with reference to specific examples. The following examples will assist those skilled in the art in further understanding the invention, but are not intended to limit the invention in any way. It should be noted that variations and modifications can be made by persons skilled in the art without departing from the spirit of the invention. All falling within the scope of the present invention.
As shown in fig. 2, there are topologies of relationships such as N1, N2, N3, N4, N5, N6 in the wireless network. N1 has a need to send information to node N6 without having reached N6 valid routing information in its routing table. Thus, N1 initiates the discovery and establishment process of the path to N6 as needed. At some point, the metric for each node is as follows:
Figure BDA0001081809290000051
the method for multi-metric route discovery and establishment based on AODV provided by the invention comprises the following implementation flow steps:
s1: all nodes in the wireless network update the data structures, provide and maintain data structures for the remaining energy EM, energy drain rate EDR, node density DM, and prepare to receive RREQ (route request) and respond appropriately.
The hop count, the residual energy, the energy loss rate and the weighted value of the node density are preset so as to adapt to the requirements of different environments on the wireless network protocol.
The multi-metric, i.e., hop count, residual energy, energy loss rate, node density, forms a node path discovery factor CM in the following manner, the relationship between the multi-metric and the path discovery factor CM being as follows:
CM＝H*HC+E*EM+T*EDR+D*DM
HC. EM, EDR and DM are respectively the hop count, residual energy, energy loss rate and node density specified by the method. H. E, T, D represent the weights of HC, EM, EDR, DM, respectively.
In this embodiment, H is 0.1, E is 0.8, T is 0, and D is 0.1. Of course, in other embodiments, these parameters may be preset to other values.
S2: when the node N1 in the wireless network has the information sending requirement, the node N1 finds that no effective path reaching the destination node N6 exists in the routing table, and broadcasts the routing request RREQ to initiate the multi-metric route discovery and establishment process. And adding the optimal path factor PF to the route request RREQ except the information of the route request RREQ of the standard AODV.
S3: at some later time, the non-destination nodes N2, N3, N4, N5 in the wireless network receive the route request RREQ from the source node N1 requesting to reach N6.
Firstly, the intermediate nodes N2, N3, N4 and N5 extract the destination node IP from the received route request RREQ information to match with the own IP, and find that the intermediate node is not the destination node to be found by the source node.
Then, the non-destination node takes out the source node IP and the sequence number from the route request RREQ to determine whether the same RREQ (route request) has been received. If received and processed, the packet is discarded directly; if the route request RREQ is received for the first time, the non-destination node updates the route table according to the content of the route request RREQ, updates the route request RREQ according to the hop count, the residual energy, the energy loss rate and the node density field which are maintained by the non-destination node, and broadcasts the route request RREQ.
Further, in S3, the updating step of the non-destination node receiving the route request RREQ for the first time is as follows:
s3.1: and the non-destination node establishes a reverse route to the source node according to the information carried by the received route request RREQ. The intermediate nodes N2, N3, N4, N5 establish a reverse route to N1 in the routing table based on the source node and previous hop information in the received route request RREQ.
S3.2: the non-destination node extracts the values of hop count, residual energy, energy loss rate and node density maintained by the non-destination node, obtains a self path discovery factor CM according to a preset weight, and updates the sum of the self path discovery factor CM and an optimal path factor PF in a route request RREQ into an optimal path factor PF field of the route request RREQ.
S3.3: the node broadcasts the updated route request RREQ.
S4: at some point, the destination node N6 receives a route request RREQ from the source node N1 forwarded via the neighboring node N3 or N5.
Firstly, the destination node N6 will confirm that it is the destination node that the source node needs to find, then judge whether the route request RREQ of the batch is received for the first time, if it is, the destination node N6 opens the window time for the route request RREQ to wait for the arrival of the route request RREQ of the same batch, and at the same time, establish the reverse route reaching the source node N1 in the route table by using the route request RREQ information. Otherwise, updating the routing table of the destination node according to the information of the routing request RREQ.
Further, in S4, the update operation of the destination node N6 according to the route request RREQ is as follows:
s4.1: a routing entry is found in the routing table for the destination node N6 to reach the source node N1 and the optimal path factor PF in the entry is compared to the PF field value in the route request RREQ. If the former is small, the route request RREQ is abandoned, otherwise, the optimal path PF value of the route entry is updated by the optimal path factor PF value in the route request RREQ, and the next hop of the entry is updated by the last hop of the route request RREQ.
There are two representative paths: -N1- > N2- > N3- > N6 and-N1- > N2- > N4- > N5-N6. Within the window time that the destination node N6 opens the route request RREQ from the source node N1, the route request RREQ passing through the first path and the second path is received in sequence. The PF of the route request RREQ of the path (i) obtained by the above method is 1.75, and the PF of the route request RREQ of the path (ii) is 1.65, so that the path (ii) is obviously superior to the path (i) in the optimal path segment judgment, and the route request RREQ information of the final path (ii) is used to update the reverse route entry of the destination node N6 to the source node N1.
The optimal path judgment section selects the optimal path according to the size of the optimal path factor PF instead of taking the minimum hop number as the judgment standard of the optimal path. Optimal path factor PF value PFpThe smaller the representative path, the more reliable and better.
Figure BDA0001081809290000061
The optimal path factor PF is a concept for a routing path, where a subscript P refers to a certain routing path, i refers to the ith node, CM, in the pathiIt is the value of the path discovery factor for the ith node in path p.
S5: the destination node N6 selects the optimal path by the optimal path factor PF within the window time, and it is obvious that the path (c) is the optimal of all possible paths. The window time ends to unicast the route reply RREP through the reverse route N6- > N5- > N4- > N2-N1 of the destination node N6 to the source node N1, and the hop count field of the route reply RREP is modified to the optimal path factor PF. And extracting the hop count, the residual energy, the energy loss rate, the node density and the like maintained by the routing recovery RREP, obtaining a self path discovery factor CM according to the preset weight, and updating the optimal path PF field of the routing recovery RREP by using the value of the path discovery factor CM.
S6: the hop number field of the routing table entries at all nodes of the wireless network is modified to the optimal path factor PF. And the intermediate nodes N5, N4 and N2 in the reverse routing path receive the routing reply RREP, establish a routing entry reaching the destination node according to the routing reply RREP information, and update the optimal path factor PF value in the routing reply RREP into the routing entry. And then updating the route reply RREP according to the sum of the products of the self-maintained multi-metric values and the weight, namely the self-path discovery factor CM, and the optimal path PF value in the route reply RREP, and unicasting the route reply RREP to the next hop.
And until the source node N1 receives a route reply RREP packet which is transmitted by the N2 and replied by the destination node N6 of the N6- > N5- > N4- > N2, establishing a route entry of the N1 to the N6 according to the route reply RREP packet. And updating the PF field of the routing entry by using the optimal path PF field value of the route reply RREP packet, and updating the next hop information of the routing entry by using the previous hop in the route reply RREP.
Through the above steps, a reliable routing path is established from the source node N1 to the destination node N6.
The above is a detailed description of the implementation of reliable route discovery and establishment, and when a new route is required, the above method can be used for route discovery and establishment.
The foregoing description of specific embodiments of the present invention has been presented. It is to be understood that the present invention is not limited to the specific embodiments described above, and that various changes and modifications may be made by one skilled in the art within the scope of the appended claims without departing from the spirit of the invention.

Claims (2)

1. A multi-metric route discovery and establishment method based on AODV is characterized in that:
the node in the wireless network encapsulates the four measurement quantities of hop count, residual energy, energy loss rate and node density in a data structure;
in the route discovery stage, four measurement quantities in the route request are compared with four measurement quantities maintained by the node and updated, and then an optimal route path is discovered and established;
the method comprises the following steps:
s1: updating data structures of all nodes in the wireless network, providing and maintaining data structures of residual energy, energy loss rate and node density, and preparing for receiving routing requests and responding;
presetting weighted values of hop count, residual energy, energy loss rate and node density to meet the requirements of different environments on wireless network protocols;
the multi-measurement quantity, namely hop count, residual energy, energy loss rate and node density are fused to form a path discovery factor CM:
CM＝H*HC+E*EM+T*EDR+D*DM
HC. EM, EDR and DM are respectively the hop count, residual energy, energy loss rate and node density of the node; H. e, T, D represent the weights of HC, EM, EDR, DM, respectively;
s2: when some node in the wireless network has a requirement for sending information, discovering that no effective path reaching a destination node exists in a routing table, broadcasting a routing request to initiate a multi-metric routing discovery and establishment process, wherein the routing request is added with an optimal path factor PF (power factor) except for the information of the routing request of the standard AODV;
s3: at some subsequent time, the non-destination node in the wireless network receives the routing request sent by the source node:
firstly, the non-destination node takes out a destination node IP from the routing request information to match with the IP of the non-destination node, and finds that the non-destination node is not the destination node to be found by the source node;
then, the non-destination node takes out the source node IP and the routing request ID from the routing request to judge whether the same routing request is received or not, and if the same routing request is received and processed, the packet is directly discarded; if the route request is received for the first time, the non-destination node updates a routing table according to the content of the route request, updates the route request according to the hop count, the residual energy, the energy loss rate and the node density field which are maintained by the non-destination node, and broadcasts the route request;
s4: at a certain moment, the destination node receives a routing request forwarded via the intermediate node:
firstly, the destination node confirms that the destination node is the node to be found by the source node, then, whether the routing request of the batch is received for the first time is judged, if the routing request of the batch is received for the first time, the destination node starts window time for the routing request to wait for the arrival of the routing request of the same batch, and meanwhile, the reverse routing reaching the source node is established in a routing table by utilizing the routing request information; otherwise, updating the routing table of the destination node according to the information of the routing request;
s5: the method comprises the steps that a destination node selects an optimal path within window time, unicast routing reply RREP is carried out through a reverse route from the destination node to a source node, a hop number field of the routing reply RREP is modified into an optimal path factor PF, the hop number, the residual energy, the energy loss rate and the node density value which are maintained by the destination node are extracted, a path discovery factor CM of the destination node is obtained according to preset weight, and the PF field of the routing reply RREP is updated by the path discovery factor CM;
s6: modifying hop number fields of routing table entries of all nodes of a wireless network into an optimal path factor PF, receiving a route reply RREP by an intermediate node, establishing a route entry reaching a destination node according to route reply RREP information, updating an optimal path factor PF value in the route reply RREP into the route entry, then updating the route reply RREP according to the sum of products of self-maintained multi-metric values and weights, namely a self path discovery factor CM, and adding the optimal path factor PF value in the route reply RREP to update the route reply RREP, and unicasting the route reply RREP to the next hop;
in S3, the non-destination node receives the update of the routing request for the first time, and the steps are as follows:
s3.1: the non-destination node establishes a reverse route to the source node according to the information carried by the received route request;
s3.2: the non-destination node extracts hop count, residual energy, energy loss rate and node density value maintained by the non-destination node, obtains a self path discovery factor CM according to a preset weight, and updates the sum of the self path discovery factor CM and an optimal path factor PF in the received routing request into a path discovery factor PF field of the routing request;
s3.3: the non-destination node broadcasts the updated routing request;
the optimal path is selected by the optimal path factor PF value obtained by multi-measurement instead of the minimum hop count as the judgment standard of the optimal path, and the optimal path factor PF value is the PF valuepThe smaller the path is, the more reliable and better the representative path is;
Figure FDA0002448832680000021
the optimal path factor PF is a concept for a routing path, where a subscript P refers to a certain routing path, i refers to the ith node, CM, in the pathiIt is the value of the path discovery factor for the ith node in path p.
2. The method for AODV-based multi-metric route discovery and establishment according to claim 1, wherein in S4, the destination node updates the routing table of the destination node according to the information of the route request, and the operations are as follows:
finding out the route entry from the destination node to the source node in the route table, comparing the optimal path factor in the entry with the PF field value in the route request, if the optimal path factor is smaller than the PF field value, discarding the route request, otherwise, updating the optimal path value of the route entry by using the PF value in the route request, and updating the next hop of the entry by using the previous hop of the route request.
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 CN106304184A (en) 2017-01-04
CN106304184B true 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)

Families Citing this family (5)

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

Citations (3)

* 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

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8774192B2 (en) * 2011-09-10 2014-07-08 Arnab Das Methods systems, and devices for robustness improvement in a mobile ad hoc network using reputation-based routing

Patent Citations (3)

* 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

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
Ad Hoc网络混合路由协议的研究;张希婕;《信息科技辑》;20150815(第8期);I136-709 *

Also Published As

Publication number Publication date
CN106304184A (en) 2017-01-04

Similar Documents

Publication Publication Date Title
CN106304184B (en) Multi-metric route discovery and establishment method based on AODV (Ad hoc on-demand distance vector)
US8441958B2 (en) Directed acyclic graph discovery and network prefix information distribution relative to a clusterhead in an ad hoc mobile network
US7567577B2 (en) Link state advertisements specifying dynamic routing metrics and associated variation metrics and selective distribution thereof
US7843833B2 (en) Detection and handling of lost messages during load-balancing routing protocols
US20080112326A1 (en) Load-Balancing Routes In Multi-Hop Ad-Hoc Wireless Networks
CN108449271B (en) Routing method for monitoring path node energy and queue length
EP3298826B1 (en) Connectivity management mechanism for multi-hop capillary networks
CN102149161A (en) Hierarchical and regular mesh network routing method
CN103118412A (en) Trust-based on-demand multipath vector routing algorithm of Ad Hoc network
Okazaki et al. Ant-based dynamic hop optimization protocol: A routing algorithm for mobile wireless sensor networks
Bhangwar et al. On routing protocols for high performance
Mu et al. Performance analysis of the ZigBee networks in 5G environment and the nearest access routing for improvement
MadhanMohan et al. Power controlled routing in wireless ad hoc networks using cross layer approach
Huang et al. A routing algorithm based on cross-layer power control in wireless ad hoc networks
CN101106520A (en) Multi-routing technology with several independent root nodes based on AODV
Sinha et al. Effect of varying node density and routing zone radius in ZRP: a simulation based approach
CN101409905A (en) Routing method for mobile multi-hop grouping wireless network based on random broadcast mode
Srinivasan et al. Stability and energy aware multipath routing for mobile ad hoc networks
Marwaha et al. Biologically inspired ant-based routing in mobile ad hoc networks (MANET): a survey
Kumar et al. An energy and traffic aware routing approach as an extension of aodv
Noorani Performance analysis of DSDV, AODV, and ZRP routing protocol of MANET and enhancement in ZRP to improve its throughput
Le et al. An efficient hybrid routing approach for hybrid wireless mesh networks
Othmen et al. Energy, load, and QoS-aware routing protocol for Ad Hoc networks
Chintawar et al. Performance analysis of ad-hoc on demand multipath distance vector routing protocol with accessibility and link breakage prediction
Sharma et al. An improvement in performance of mobile ad hoc networks using modified route maintenance

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