CN108093457B - Route searching method and system for wireless ad hoc network - Google Patents

Route searching method and system for wireless ad hoc network Download PDF

Info

Publication number
CN108093457B
CN108093457B CN201711443620.2A CN201711443620A CN108093457B CN 108093457 B CN108093457 B CN 108093457B CN 201711443620 A CN201711443620 A CN 201711443620A CN 108093457 B CN108093457 B CN 108093457B
Authority
CN
China
Prior art keywords
node
routing path
rreq
routing
residual energy
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.)
Active
Application number
CN201711443620.2A
Other languages
Chinese (zh)
Other versions
CN108093457A (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.)
SYSU HUADU INDUSTRIAL SCIENCE AND TECHNOLOGY INSTITUTE
Sun Yat Sen University
Original Assignee
SYSU HUADU INDUSTRIAL SCIENCE AND TECHNOLOGY INSTITUTE
Sun Yat Sen 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 SYSU HUADU INDUSTRIAL SCIENCE AND TECHNOLOGY INSTITUTE, Sun Yat Sen University filed Critical SYSU HUADU INDUSTRIAL SCIENCE AND TECHNOLOGY INSTITUTE
Priority to CN201711443620.2A priority Critical patent/CN108093457B/en
Publication of CN108093457A publication Critical patent/CN108093457A/en
Application granted granted Critical
Publication of CN108093457B publication Critical patent/CN108093457B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • 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
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/122—Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or 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

Abstract

The invention relates to a route searching method and a system thereof of a wireless ad hoc network, comprising a source node broadcasting RREQ to adjacent nodes; when the adjacent node is the target node, updating the minimum residual energy and the average residual energy, and sending the RREP to the source node; otherwise, when the forwarding time is less than the first threshold, the adjacent node is used as a routing path node, the minimum residual energy and the average residual energy are updated, the routing hop count is added by 1, and the RREQ is forwarded to the adjacent node. After receiving the RREP, the source node updates a routing table, and selects a routing path with the minimum routing hop number as an optimal routing path when the difference value of the average residual energy in each routing path is smaller than a second threshold value; otherwise, selecting the routing path where the maximum average residual energy is as the optimal routing path. The distance from the source node to the destination node, the residual energy of the nodes and the average residual energy are comprehensively considered, so that the energy consumption of each node is balanced, network partitioning is avoided, and the average survival time of the nodes is prolonged.

Description

Route searching method and system for wireless ad hoc network
Technical Field
The invention relates to the field of power consumption optimization of a wireless ad hoc network, in particular to a route searching method and a route searching system of the wireless ad hoc network.
Background
A wireless AD hoc Network (AD hoc Network for short) is a Multi-hop, centerless, AD hoc wireless Network, also called Multi-hop Network (Multi-hop Network), infrastructure-less Network (infrastructure Network) or Self-organizing Network (Self-organizing Network). There is no fixed infrastructure in AD hoc networks, each node is mobile and can dynamically maintain contact with other nodes in any way; in such a network, due to the limited range of the wireless coverage of the terminal, two user terminals that cannot communicate directly can forward packets by means of other nodes, that is, each node in the AD hoc network is also a router at the same time, and they can perform the functions of discovering and maintaining routes to other nodes.
The wireless ad hoc network is a network formed by a plurality of wireless ad hoc network devices, the wireless ad hoc network devices adopt portable batteries to provide power, and the capacity of the batteries is limited, so that temporary power supplement is difficult. Once a key node device or a certain proportion of node devices are exhausted and stop working, the whole wireless ad hoc network may be affected or even broken down and not work normally. Existing wireless ad hoc networks typically employ AODV protocols to find routes. AODV (Ad hoc On-demand Distance Vector Routing) is an On-demand Routing protocol, and when a node in a wireless Ad hoc network needs to transmit information to other nodes in the network when finding a route by AODV, if the node does not reach the route of a target node, a route request message (abbreviated as "RREQ") must be sent in a multicast manner. The network layer addresses of the initiating node and the target node are recorded in the RREQ message, and the adjacent node receives the RREQ and firstly judges whether the target node is the RREQ. If yes, sending a route response message (short for RREP) to the initiating node; if not, firstly searching whether a route reaching the destination node exists in the route table, if so, unicasting the RREP to the source node, otherwise, continuously forwarding the RREQ for searching. The protocol can effectively avoid circular search, is more flexible, and is a routing protocol which is relatively most suitable for an Adhoc network at present.
However, when a route from a source node to a destination node is selected by an existing AODV, a method of minimum hop count is adopted, and this method can save energy of the whole network under the condition that the transmission power of each node transmitted by the whole network is constant, but also attracts more traffic, so that the energy consumption of the node on a certain path is too fast, once a battery of a certain key node is exhausted, a network which depends on the key node as an intermediate node cannot communicate, so that network partitioning may be caused, and even the whole wireless ad hoc network cannot work normally.
Disclosure of Invention
Based on this, an object of the present invention is to provide a route searching method for a wireless ad hoc network, which has the advantages of avoiding selecting a route path having a minimum remaining energy node, balancing energy consumption of each node, avoiding network partition fracture, and improving an average lifetime of nodes in the network.
A route searching method of a wireless ad hoc network comprises the following steps:
step S1: the source node broadcasts the RREQ to the adjacent nodes; the RREQ comprises minimum residual energy in a routing path, average residual energy in the routing path and routing hop count;
step S2: after receiving the RREQ, the current neighboring node judges whether the RREQ is received, and if the RREQ is not received, the step S3 is continued;
step S3: judging whether the current adjacent node is a target node; if yes, updating the minimum residual energy in the routing path and the average residual energy in the routing path, and sending the RREP to the source node according to the original path; otherwise, judging whether the forwarding time is smaller than a first threshold value according to the average residual energy in the routing path and the residual energy of the current adjacent node:
if the forwarding time is less than the first threshold, taking the current neighboring node as a routing path node, updating the minimum residual energy in the routing path and the average residual energy in the routing path, adding 1 to the routing hop count, forwarding the RREQ to the neighboring node of the current neighboring node, selecting one of the current neighboring nodes as a next current neighboring node, and returning to the step S2;
if the forwarding time is not less than the first threshold, determining whether a node at the same level as the current neighboring node exists, if so, discarding the RREQ by the current neighboring node, selecting a node at the same level as a next current neighboring node, and returning to step S2;
step S4: after receiving the RREP, the source node updates a routing table, judges whether the difference of average residual energy in each routing path is smaller than a second threshold value, and selects the routing path with the minimum routing hop number as an optimal routing path if the difference is smaller than the second threshold value; otherwise, selecting the routing path where the maximum average residual energy is as the optimal routing path.
Compared with the prior art, the method and the device have the advantages that the distance from the source node to the destination node, the residual battery energy of the nodes and the average residual energy are comprehensively considered, the routing path with the maximum average residual energy is always selected for data transmission under the condition that the routing path with the minimum residual energy node is avoided being selected and the average residual energy is greatly different, so that the energy consumption of each node is effectively balanced, the network partition breakage is avoided, and the average survival time of the nodes in the network is prolonged.
Further, in step S3, if the forwarding time is not less than the first threshold and there is no node with the same level as the current neighboring node, the current neighboring node is used as a routing path node, the minimum remaining energy in the routing path and the average remaining energy in the routing path are updated at the same time, the count of routing hops is incremented by 1, and the RREQ is forwarded to its neighboring node, and the process returns to step S2 to avoid network interruption, thereby obtaining a complete routing path.
Further, in step S3, the calculation formula for updating the minimum remaining energy in the routing path and the average remaining energy in the routing path is:
Pnow＝[(Ppre*N)+Rres(i)]/(N+1)；
If(Rres(i)≥Zpre) Then Z isnow＝Zpre；
If(Rres(i)<Zpre) Then Z isnow＝Rres(i)；
Wherein R isres(i)Is the remaining energy of the current neighbor node i; ppreTo updateThe P value of the average residual energy in the route path recorded in the previous RREQ; zpreThe value is the Z value in the routing path recorded in the RREQ before updating; pnowThe updated P value of the average residual energy in the route path recorded in the RREQ is obtained; znowIs the Z value in the route path recorded in the RREQ after updating.
Further, in step S3, the forwarding time T is calculated as
Figure BDA0001527061120000031
Wherein G is a constant;
Figure BDA0001527061120000032
for the estimated average remaining energy of the current whole wireless ad hoc network, the calculation formula is as follows:
Figure BDA0001527061120000033
in the formula, beta is a weight factor of average movement, and the value range of beta is (0-1); epreIn order to update the total remaining battery energy of the whole wireless ad hoc network, the calculation formula is as follows:
Figure BDA0001527061120000034
wherein, M is the number of nodes distributed in the whole wireless ad hoc network before updating.
Further, in step S4, the first threshold is G, and the value of G is 0.0120 to 0.0130.
Further, in step S4, the second threshold is 0-0.2.
The invention also provides a route searching system of the wireless ad hoc network, which comprises:
the RREQ broadcasting module is used for broadcasting the RREQ of the source node to the adjacent nodes of the source node; the RREQ comprises minimum residual energy in a routing path, average residual energy in the routing path and routing hop count;
the RREQ repeated receiving judging module is used for judging whether the current adjacent node receives the RREQ or not after the current adjacent node receives the RREQ;
the RREQ updating and forwarding module is used for judging whether the current adjacent node is a target node or not when the current adjacent node does not receive the RREQ; if yes, updating the minimum residual energy in the routing path and the average residual energy in the routing path, and sending the RREP to the source node according to the original path; otherwise, judging whether the forwarding time is smaller than a first threshold value according to the average residual energy in the routing path and the residual energy of the current adjacent node: if the forwarding time is less than a first threshold value, taking the current adjacent node as a routing path node, updating the minimum residual energy in the routing path and the average residual energy in the routing path at the same time, adding 1 to the routing hop count, forwarding the RREQ to the adjacent nodes of the current adjacent node, and selecting one adjacent node of the current adjacent node as a next current adjacent node; if the forwarding time is not less than the first threshold, judging whether nodes in the same level as the current adjacent node exist, if so, discarding the RREQ by the current adjacent node, and selecting one node in the same level as the next current adjacent node;
and the optimal routing path selection module is used for updating a routing table after the source node receives the RREP, judging whether the difference of the average residual energy in each routing path is smaller than a second threshold value, if so, selecting the routing path with the minimum routing hop number as the optimal routing path, and otherwise, selecting the routing path with the maximum average residual energy as the optimal routing path.
Compared with the prior art, the method and the device have the advantages that the distance from the source node to the destination node, the residual battery energy of the nodes and the average residual energy are comprehensively considered, the route path with the largest average residual energy is always selected for data transmission under the condition that the route path with the smallest residual energy node is avoided being selected and the average residual energy is greatly different, so that the energy consumption of each node is effectively balanced, the network partition breakage is avoided, and the average survival time of the nodes in the network is prolonged; meanwhile, under the condition that the average residual energy is not large, the routing path with the shortest distance from the source node to the destination node, namely the shortest hop count, is selected, so that the accumulated forwarding time is shortest, and the network delay can be shortened as much as possible.
For a better understanding and practice, the invention is described in detail below with reference to the accompanying drawings.
Drawings
Fig. 1 is a flowchart of a route lookup method of a wireless ad hoc network according to an embodiment of the present invention;
fig. 2 is a block diagram of a route lookup system of a wireless ad hoc network according to an embodiment of the present invention.
Detailed Description
Please refer to fig. 1, which is a flowchart illustrating a route searching method of a wireless ad hoc network according to an embodiment of the present invention. The route searching method of the wireless ad hoc network comprises the following steps:
step S1: the source node broadcasts the RREQ to the adjacent nodes; the RREQ includes minimum remaining energy in the routing path, average remaining energy in the routing path, and a routing hop count.
The RREQ specifically includes a type, a minimum remaining energy Z in the routing path, an average remaining energy P in the routing path, a routing hop count N, a broadcast ID, a destination node IP address, a destination node sequence number, a source node IP address, and a source node sequence number. Wherein the type designation packet type is a routing request packet. The broadcast ID, which is an incremented sequence number maintained by each node itself, uniquely identifies a route request with the source node IP address, and is incremented by 1 each time a RREQ is issued by a node. The destination node IP address is an IP address of a received data packet. The destination node sequence number is used for maintaining the validity of the forward route, namely the route from the source node to the destination node, and indicates the old and new of the forward route which can be received by the source node. The source node IP address, i.e., the IP address of the node that generated the route request RREQ message. The source node sequence number, used in the RREQ broadcast process to ensure the validity of the reverse route, i.e., the route from the destination node to the source node, represents the previous and current state of the reverse route.
The message format of the RREQ is shown in the following table:
Figure BDA0001527061120000051
initially, the minimum remaining energy Z in the routing path is set as the battery energy of the source node, the average remaining energy P in the routing path is also set as the battery energy of the source node, and at this time, the source node is the minimum remaining energy node in the routing path. At the same time, the route hop count N is set to 1 and the RREQ is broadcast.
Step S2: and after receiving the RREQ, the current adjacent node judges whether the RREQ is received, and if the RREQ is not received, the step S3 is continued.
In this embodiment, if the RREQ is received, the RREQ is discarded, and the routing path search through the current neighboring node is ended.
The step of judging whether the RREQ is received comprises the following steps: and checking the sequence number of the current adjacent node, judging whether the sequence number is the same as the sequence number of the target node of the RREQ, if so, indicating that the RREQ is received, otherwise, indicating that the RREQ is not received.
Step S3: judging whether the current adjacent node is a target node; if yes, updating the minimum residual energy in the routing path and the average residual energy in the routing path, and sending the RREP to the source node according to the original path; otherwise, judging whether the forwarding time is smaller than a first threshold value according to the average residual energy in the routing path and the residual energy of the current adjacent node:
if the forwarding time is less than the first threshold, taking the current neighboring node as a routing path node, updating the minimum residual energy in the routing path and the average residual energy in the routing path, adding 1 to the routing hop count, forwarding the RREQ to the neighboring node of the current neighboring node, selecting one of the current neighboring nodes as a next current neighboring node, and returning to the step S2;
if the forwarding time is not less than the first threshold, it is determined whether there is a node having the same level as the current neighboring node, and if so, the current neighboring node discards the RREQ, selects a node having the same level as the next current neighboring node, and returns to step S2.
In one embodiment, if the forwarding time is not less than the first threshold and there is no peer node with the current neighboring node, the current neighboring node is also taken as the routing path node, the minimum remaining energy in the routing path and the average remaining energy in the routing path are updated at the same time, the routing hop count is increased by 1, and the RREQ is forwarded to its neighboring node, and the process returns to step S2.
Specifically, the calculation formula for updating the minimum remaining energy in the routing path and the average remaining energy in the routing path is as follows:
Pnow＝[(Ppre*N)+Rres(i)]/(N+1)；
If(Rres(i)≥Zpre) Then Z isnow＝Zpre；
If(Rres(i)<Zpre) Then Z isnow＝Rres(i)；
Wherein R isres(i)Is the remaining energy of the current neighbor node i; ppreThe value P is the average residual energy in the route path recorded in the RREQ before updating; zpreThe value is the Z value in the routing path recorded in the RREQ before updating; pnowThe updated P value of the average residual energy in the route path recorded in the RREQ is obtained; znowIs the Z value in the route path recorded in the RREQ after updating.
If the total remaining battery energy of the whole wireless ad hoc network before updating is set as EpreAnd if the number of the nodes distributed in the whole wireless ad hoc network before updating is M, the total remaining battery energy E of the whole wireless ad hoc network before updatingpreThe calculation formula of (a) is as follows:
Figure BDA0001527061120000061
when the current adjacent node i receives the RREQ, according to EpreAnd PpreEstimated average remaining energy of the current entire wireless ad hoc network
Figure BDA0001527061120000062
The calculation formula of (a) is as follows:
Figure BDA0001527061120000063
in the above equation, β is a weighting factor for the average motion. Assuming that the position of the node i is random in the whole route, considering the problem of random hop number, a weight factor beta is introduced, wherein the value range of the beta is (0-1), and the weight factor beta can be set artificially.
The calculation formula of the forwarding time T of the current neighbor node i is as follows:
Figure BDA0001527061120000064
wherein G is a constant.
When R isres(i)Is less than
Figure BDA0001527061120000065
When the residual energy of the node is less than the estimated average network residual energy, the forwarding time T of the adjacent node i is long; on the contrary, the forwarding time T of the neighboring node i is small, and at this time, if the neighboring node i is selected as an intermediate node in the path, the node at a lower energy level can be protected, so that the energy consumption among the nodes in the route is more balanced.
In this embodiment, in determining whether the forwarding time is less than the first threshold, the first threshold is set to G, where the value of G is 0.0120 to 0.0130, and preferably the value of G is 0.0126.
Step S4: and after receiving the RREP, the source node updates each routing table, and judges whether the difference values of the average residual energy in the routing paths of each routing table are smaller than a second threshold value, if so, the routing path with the minimum routing hop number is selected as the optimal routing path, and otherwise, the routing path with the maximum average residual energy is selected as the optimal routing path.
In this embodiment, the second threshold is 0 to 0.2, and preferably may be set to 0.1.
It should be noted that the above method is carried out under the following implementation conditions:
(1) each node in the network is in random motion, i.e. the established path may fail;
(2) the node energy is distributed randomly, and the information of the residual energy of the node, the energy needed to be consumed by the data packet transmission and reception and the like can be provided at any time; the link layer of the node can read the energy information from the physical interface and transmit the energy information to the network layer;
(3) each node uses an omnidirectional antenna and the transmission radius is equal, i.e. the wireless channel is bidirectional and symmetrical, in common saying that when two nodes communicate, the signal attenuation is the same.
Please refer to fig. 2, which is a block diagram of a route lookup system of a wireless ad hoc network according to an embodiment of the present invention. The invention also provides a route searching system of the wireless ad hoc network, which comprises:
the RREQ broadcasting module 1 is used for broadcasting the RREQ of the source node to the adjacent nodes of the source node; the RREQ includes minimum remaining energy in the routing path, average remaining energy in the routing path, and a routing hop count.
The RREQ specifically includes a type, a minimum remaining energy Z in the routing path, an average remaining energy P in the routing path, a routing hop count N, a broadcast ID, a destination node IP address, a destination node sequence number, a source node IP address, and a source node sequence number. Wherein the type designation packet type is a routing request packet. The broadcast ID, which is an incremented sequence number maintained by each node itself, uniquely identifies a route request with the source node IP address, and is incremented by 1 each time a RREQ is issued by a node. The destination node IP address is an IP address of a received data packet. The destination node sequence number is used for maintaining the validity of the forward route, namely the route from the source node to the destination node, and indicates the old and new of the forward route which can be received by the source node. The source node IP address, i.e., the IP address of the node that generated the route request RREQ message. The source node sequence number, used in the RREQ broadcast process to ensure the validity of the reverse route, i.e., the route from the destination node to the source node, represents the previous and current state of the reverse route.
Initially, the minimum remaining energy Z in the routing path is set as the battery energy of the source node, the average remaining energy P in the routing path is also set as the battery energy of the source node, and at this time, the source node is the minimum remaining energy node in the routing path. At the same time, the route hop count N is set to 1 and the RREQ is broadcast.
And the RREQ repeated receiving judging module 2 is used for judging whether the current adjacent node receives the RREQ after the current adjacent node receives the RREQ.
And checking the sequence number of the current adjacent node, if the sequence number is the same as the sequence number of the destination node of the RREQ, if so, indicating that the RREQ is received, otherwise, indicating that the RREQ is not received.
The RREQ updating and forwarding module 3 is used for judging whether the current adjacent node is a target node or not when the current adjacent node does not receive the RREQ; if yes, updating the minimum residual energy in the routing path and the average residual energy in the routing path, and sending the RREP to the source node according to the original path; otherwise, judging whether the forwarding time is smaller than a first threshold value according to the average residual energy in the routing path and the residual energy of the current adjacent node: if the forwarding time is less than a first threshold value, taking the current adjacent node as a routing path node, updating the minimum residual energy in the routing path and the average residual energy in the routing path at the same time, adding 1 to the routing hop count, forwarding the RREQ to the adjacent nodes of the current adjacent node, and selecting one adjacent node of the current adjacent node as a next current adjacent node; if the forwarding time is not less than the first threshold, judging whether a node at the same level as the current adjacent node exists, if so, discarding the RREQ by the current adjacent node, and selecting the node at the same level as the next current adjacent node.
In one embodiment, the RREQ updating and forwarding module is further configured to, when the forwarding time is not less than the first threshold and no node at the same level as the current neighboring node exists, regard the current neighboring node as a routing path node, update the minimum remaining energy in the routing path and the average remaining energy in the routing path at the same time, add 1 to the routing hop count, and forward the RREQ to its neighboring node.
Specifically, the calculation formula for updating the minimum remaining energy in the routing path and the average remaining energy in the routing path is as follows:
Pnow＝[(Ppre*N)+Rres(i)]/(N+1)；
If(Rres(i)≥Zpre) Then Z isnow＝Zpre；
If(Rres(i)<Zpre) Then Z isnow＝Rres(i)；
Wherein R isres(i)Is the remaining energy of the current neighbor node i; ppreThe value P is the average residual energy in the route path recorded in the RREQ before updating; zpreThe value is the Z value in the routing path recorded in the RREQ before updating; pnowThe updated P value of the average residual energy in the route path recorded in the RREQ is obtained; znowIs the Z value in the route path recorded in the RREQ after updating.
If the total remaining battery energy of the whole wireless ad hoc network before updating is set as EpreAnd if the number of the nodes distributed in the whole wireless ad hoc network before updating is M, the total remaining battery energy E of the whole wireless ad hoc network before updatingpreThe calculation formula of (a) is as follows:
Figure BDA0001527061120000081
when the current adjacent node i receives the RREQ, according to EpreAnd PpreEstimated average remaining energy of the current entire wireless ad hoc network
Figure BDA0001527061120000082
The calculation formula of (a) is as follows:
Figure BDA0001527061120000083
in the above equation, β is a weighting factor for the average motion. Assuming that the position of the node i is random in the whole route, considering the problem of random hop number, a weight factor beta is introduced, wherein the value range of the beta is (0-1), and the weight factor beta can be set artificially.
The calculation formula of the forwarding time T of the current neighbor node i is as follows:
Figure BDA0001527061120000084
wherein G is a constant.
When R isres(i)Is less than
Figure BDA0001527061120000085
When the residual energy of the node is less than the estimated average network residual energy, the forwarding time T of the adjacent node i is long; on the contrary, the forwarding time T of the neighboring node i is small, and at this time, if the neighboring node i is selected as an intermediate node in the path, the node at a lower energy level can be protected, so that the energy consumption among the nodes in the route is more balanced.
In this embodiment, in determining whether the forwarding time is less than the first threshold, the first threshold is set to G, where the value of G is 0.0120 to 0.0130, and preferably the value of G is 0.0126.
And the optimal routing path selection module 4 is configured to update a routing table after the source node receives the RREP, and determine whether the difference between the average residual energies in each routing path is smaller than a second threshold, if yes, select a routing path with the smallest number of routing hops as the optimal routing path, and otherwise, select a routing path where the largest average residual energy is located as the optimal routing path.
In this embodiment, the second threshold is 0 to 0.2, and preferably may be set to 0.1.
Compared with the prior art, the method and the device have the advantages that the distance from the source node to the destination node, the residual battery energy of the nodes and the average residual energy are comprehensively considered, the route path with the largest average residual energy is always selected for data transmission under the condition that the route path with the smallest residual energy node is avoided being selected and the average residual energy is greatly different, so that the energy consumption of each node is effectively balanced, the network partition breakage is avoided, and the average survival time of the nodes in the network is prolonged; meanwhile, under the condition that the average residual energy is not large, the routing path with the shortest distance from the source node to the destination node, namely the shortest hop count, is selected, so that the accumulated forwarding time is shortest, and the network delay can be shortened as much as possible. Furthermore, the residual battery energy and the average residual energy of the nodes are obtained by utilizing the RREQ request packet applied in the routing protocol without an additional control packet, so that the cost is reduced, and the efficiency is improved.
The above-mentioned embodiments only express several embodiments of the present invention, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the inventive concept, which falls within the scope of the present invention.

Claims (8)

1. A route searching method of a wireless ad hoc network is characterized by comprising the following steps:
step S1: the source node broadcasts the RREQ to the adjacent nodes; the RREQ comprises minimum residual energy in a routing path, average residual energy in the routing path and routing hop count;
step S2: after receiving the RREQ, the current neighboring node judges whether the RREQ is received, and if the RREQ is not received, the step S3 is continued;
step S3: judging whether the current adjacent node is a target node; if yes, updating the minimum residual energy in the routing path and the average residual energy in the routing path, and sending the RREP to the source node according to the original path; otherwise, judging whether the forwarding time is smaller than a first threshold value according to the average residual energy in the routing path and the residual energy of the current adjacent node:
if the forwarding time is less than the first threshold, taking the current neighboring node as a routing path node, updating the minimum residual energy in the routing path and the average residual energy in the routing path, adding 1 to the routing hop count, forwarding the RREQ to the neighboring node of the current neighboring node, selecting one of the current neighboring nodes as a next current neighboring node, and returning to the step S2;
if the forwarding time is not less than the first threshold, determining whether a node at the same level as the current neighboring node exists, if so, discarding the RREQ by the current neighboring node, selecting a node at the same level as a next current neighboring node, and returning to step S2;
step S4: after receiving the RREP, the source node updates a routing table, judges whether the difference of average residual energy in each routing path is smaller than a second threshold value, and selects the routing path with the minimum routing hop number as an optimal routing path if the difference is smaller than the second threshold value; otherwise, selecting the routing path where the maximum average residual energy is as the optimal routing path;
in step S3, the calculation formula for updating the minimum remaining energy in the routing path and the average remaining energy in the routing path is:
Pnow＝[(Ppre*N)+Rres(i)]/(N+1)；
If(Rres(i)≥Zpre) Then Z isnow＝Zpre；
If(Rres(i)<Zpre) Then Z isnow＝Rres(i)；
Wherein R isres(i)Is the remaining energy of the current neighbor node i; ppreThe value P is the average residual energy in the route path recorded in the RREQ before updating; zpreThe value is the Z value in the routing path recorded in the RREQ before updating; pnowThe updated P value of the average residual energy in the route path recorded in the RREQ is obtained; znowThe value is the Z value in the route path recorded in the RREQ after updating; n is the route hop count.
2. The method of claim 1, wherein the method comprises: in step S2, if the RREQ is received, the RREQ is discarded, and the route path search via the current neighboring node is ended.
3. The method of claim 1, wherein the method comprises: in step S3, if the forwarding time is not less than the first threshold value and there is no node of the same level as the current neighboring node, the current neighboring node is taken as a routing path node, the minimum remaining energy in the routing path and the average remaining energy in the routing path are updated at the same time, the count of routing hops is incremented by 1, and the RREQ is forwarded to its neighboring node, and the process returns to step S2.
4. The method of claim 3, wherein the method comprises: in step S3, the forwarding time T is calculated by the formula
Figure FDA0003001331810000021
Wherein G is a constant;
Figure FDA0003001331810000022
for the estimated average remaining energy of the current whole wireless ad hoc network, the calculation formula is as follows:
Figure FDA0003001331810000023
in the formula, beta is a weight factor of average movement, and the value range of beta is (0-1); epreIn order to update the total remaining battery energy of the whole wireless ad hoc network, the calculation formula is as follows:
Figure FDA0003001331810000024
wherein, M is the number of nodes distributed in the whole wireless ad hoc network before updating.
5. The method of claim 4, wherein the method comprises: in step S4, the first threshold is G; the value of G is 0.0120 to 0.0130.
6. The method of claim 5, wherein the method comprises: in step S4, the second threshold value is 0-0.2.
7. A system for routing lookup in a wireless ad hoc network, comprising:
the RREQ broadcasting module is used for broadcasting the RREQ of the source node to the adjacent nodes of the source node; the RREQ comprises minimum residual energy in a routing path, average residual energy in the routing path and routing hop count;
the RREQ repeated receiving judging module is used for judging whether the current adjacent node receives the RREQ or not after the current adjacent node receives the RREQ;
the RREQ updating and forwarding module is used for judging whether the current adjacent node is a target node or not when the current adjacent node does not receive the RREQ; if yes, updating the minimum residual energy in the routing path and the average residual energy in the routing path, and sending the RREP to the source node according to the original path; otherwise, judging whether the forwarding time is smaller than a first threshold value according to the average residual energy in the routing path and the residual energy of the current adjacent node: if the forwarding time is less than a first threshold value, taking the current adjacent node as a routing path node, updating the minimum residual energy in the routing path and the average residual energy in the routing path at the same time, adding 1 to the routing hop count, forwarding the RREQ to the adjacent nodes of the current adjacent node, and selecting one adjacent node of the current adjacent node as a next current adjacent node; if the forwarding time is not less than the first threshold, judging whether nodes in the same level as the current adjacent node exist, if so, discarding the RREQ by the current adjacent node, and selecting one node in the same level as the next current adjacent node; the calculation formula for updating the minimum remaining energy in the routing path and the average remaining energy in the routing path is as follows:
Pnow＝[(Ppre*N)+Rres(i)]/(N+1)；
If(Rres(i)≥Zpre) Then Z isnow＝Zpre；
If(Rres(i)<Zpre) Then Z isnow＝Rres(i)；
Wherein R isres(i)Is the remaining energy of the current neighbor node i; ppreThe value P is the average residual energy in the route path recorded in the RREQ before updating; zpreThe value is the Z value in the routing path recorded in the RREQ before updating; pnowThe updated P value of the average residual energy in the route path recorded in the RREQ is obtained; znowThe value is the Z value in the route path recorded in the RREQ after updating; n is the route hop count;
the optimal routing path selection module is used for updating a routing table after the source node receives the RREP, judging whether the difference of average residual energy in each routing path is smaller than a second threshold value, and if yes, selecting the routing path with the minimum routing hop number as the optimal routing path; otherwise, selecting the routing path where the maximum average residual energy is as the optimal routing path.
8. The system of claim 7, wherein the RREQ update and forward module is further configured to, when the forward time is not less than the first threshold and no node with the same level as the current neighboring node exists, regard the current neighboring node as a routing path node, update the minimum remaining energy in the routing path and the average remaining energy in the routing path, add 1 to the routing hop count, and forward the RREQ to its neighboring node.
CN201711443620.2A 2017-12-27 2017-12-27 Route searching method and system for wireless ad hoc network Active CN108093457B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201711443620.2A CN108093457B (en) 2017-12-27 2017-12-27 Route searching method and system for wireless ad hoc network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201711443620.2A CN108093457B (en) 2017-12-27 2017-12-27 Route searching method and system for wireless ad hoc network

Publications (2)

Publication Number Publication Date
CN108093457A CN108093457A (en) 2018-05-29
CN108093457B true CN108093457B (en) 2021-06-22

Family

ID=62178430

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201711443620.2A Active CN108093457B (en) 2017-12-27 2017-12-27 Route searching method and system for wireless ad hoc network

Country Status (1)

Country Link
CN (1) CN108093457B (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112449398B (en) * 2019-08-28 2023-02-21 中国联合网络通信集团有限公司 Path selection method and core network equipment
CN111315006B (en) * 2020-02-20 2023-04-07 京东方科技集团股份有限公司 Electric quantity equalization processing method, device, system, equipment and storage medium thereof
CN114374639B (en) * 2021-12-01 2023-09-22 中国科学院上海微系统与信息技术研究所 LoRa-Mesh networking method based on air wake-up and mobile terminal networking method
CN116633426B (en) * 2023-07-25 2023-10-27 鹏城实验室 Satellite routing method, device and storage medium

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20110064297A (en) * 2009-12-07 2011-06-15 경북대학교 산학협력단 Routing method for extending lifetime of sensor networks
CN102137463A (en) * 2011-03-09 2011-07-27 无锡泛联物联网科技股份有限公司 Energy-based multi-path routing method for wireless network
CN102271380A (en) * 2011-09-02 2011-12-07 中山大学 Ad hoc ondemand distance vector routing protocol based on game theory of Ad hoc network
CN102271378A (en) * 2011-09-14 2011-12-07 中国矿业大学 Routing method based on AODV (Ad hoc On-demand Distance Vector) protocol
CN103096411A (en) * 2013-01-05 2013-05-08 山东师范大学 Internet of things communication method based on reverse power restriction route protocol
CN106879041A (en) * 2015-12-11 2017-06-20 中南大学 The design of Ad Hoc networks cluster algorithm and Routing Protocol

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10142937B2 (en) * 2016-03-28 2018-11-27 Dell Products L.P. Information handling system mesh network power management

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20110064297A (en) * 2009-12-07 2011-06-15 경북대학교 산학협력단 Routing method for extending lifetime of sensor networks
CN102137463A (en) * 2011-03-09 2011-07-27 无锡泛联物联网科技股份有限公司 Energy-based multi-path routing method for wireless network
CN102271380A (en) * 2011-09-02 2011-12-07 中山大学 Ad hoc ondemand distance vector routing protocol based on game theory of Ad hoc network
CN102271378A (en) * 2011-09-14 2011-12-07 中国矿业大学 Routing method based on AODV (Ad hoc On-demand Distance Vector) protocol
CN103096411A (en) * 2013-01-05 2013-05-08 山东师范大学 Internet of things communication method based on reverse power restriction route protocol
CN106879041A (en) * 2015-12-11 2017-06-20 中南大学 The design of Ad Hoc networks cluster algorithm and Routing Protocol

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
"Iterative Interference Cancellation based Channel Estimation for Multi-Cell Massive MIMO Systems";Lu,Xuming;《Web of Science》;20171211;全文 *
"基于OFDM技术的软比特解码系统";徐永键，陆许明;《通信技术》;20140910;999-1003 *
"基于蚁群优化的能量有效Ad Hoc路由算法";李劲;《计算机工程与设计》;20120416;1315-1318 *

Also Published As

Publication number Publication date
CN108093457A (en) 2018-05-29

Similar Documents

Publication Publication Date Title
US11811642B2 (en) Vine™: zero-control routing using data packet inspection for wireless mesh networks
KR100709964B1 (en) Routing method in wireless sense network
Chen et al. Channel-aware routing in MANETs with route handoff
US7656851B1 (en) Adaptive message routing for mobile ad HOC networks
US8451807B2 (en) Configuration aware packet routing in an ad-hoc network
CN108093457B (en) Route searching method and system for wireless ad hoc network
US20090296704A1 (en) Method for multi-path source routing in sensor network
JP2008519531A (en) System and method for shortening route convergence time and searching for optimum route in wireless communication network
Manjhi et al. Signal strength based route selection in MANETs
Wang Power-aware dual-tree-based multicast routing protocol for mobile ad hoc networks
Singh et al. A survey: Ad-hoc on demand distance vector (AODV) protocol
Ahmad et al. Efficient AODV routing based on traffic load and mobility of node in MANET
Kulkarni et al. On demand routing protocols for mobile ad hoc networks: A review
CN110831006B (en) Ad hoc network system and data transmission method thereof
Sharma et al. P-AODV: A priority based route maintenance process in mobile ad hoc networks
Wang et al. Interference aware multipath routing protocol for wireless sensor networks
Guo et al. Reliable routing in large scale wireless sensor networks
Lee et al. Cluster label-based ZigBee routing protocol with high scalability
Yan et al. D-ODMRP: a destination-driven on-demand multicast routing protocol for mobile ad hoc networks
Intanagonwiwat et al. The sink-based anycast routing protocol for ad hoc wireless sensor networks
Abolhasan et al. LPAR: an adaptive routing strategy for MANETs
Kunavut Performance evaluation of routing protocols for heterogeneous mobile ad hoc networks
Le et al. An efficient hybrid routing approach for hybrid wireless mesh networks
Vigita et al. Reliable link-based routing protocol for highly dynamic mobile adhoc networks
KR100686973B1 (en) Cross-layer protocol design method for energy-efficient routing in power-controlled multihop wireless networks

Legal Events

Date Code Title Description
PB01 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