CN114189887B - Method for optimizing mobile ad hoc network route based on improved sparrow search algorithm - Google Patents
Method for optimizing mobile ad hoc network route based on improved sparrow search algorithm Download PDFInfo
- Publication number
- CN114189887B CN114189887B CN202111396398.1A CN202111396398A CN114189887B CN 114189887 B CN114189887 B CN 114189887B CN 202111396398 A CN202111396398 A CN 202111396398A CN 114189887 B CN114189887 B CN 114189887B
- Authority
- CN
- China
- Prior art keywords
- node
- hoc network
- path
- value
- mobile
- 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
Links
- 241000287127 Passeridae Species 0.000 title claims abstract description 42
- 238000000034 method Methods 0.000 title claims abstract description 42
- 238000010845 search algorithm Methods 0.000 title claims abstract description 29
- 230000005540 biological transmission Effects 0.000 claims abstract description 10
- 230000004044 response Effects 0.000 claims abstract description 6
- 238000012163 sequencing technique Methods 0.000 claims abstract description 5
- 238000004891 communication Methods 0.000 claims description 59
- 238000004364 calculation method Methods 0.000 claims description 9
- 230000000644 propagated effect Effects 0.000 claims description 9
- 239000011159 matrix material Substances 0.000 claims description 3
- 230000005855 radiation Effects 0.000 claims description 3
- 230000008569 process Effects 0.000 description 7
- 230000033001 locomotion Effects 0.000 description 6
- 230000006978 adaptation Effects 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 239000000463 material Substances 0.000 description 2
- 230000006855 networking Effects 0.000 description 2
- 230000009467 reduction Effects 0.000 description 2
- 230000004083 survival effect Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 208000013407 communication difficulty Diseases 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000009877 rendering Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/02—Arrangements for optimising operational condition
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- 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 discloses a method for optimizing a mobile ad hoc network route based on an improved sparrow search algorithm, which comprises the following steps: starting a mobile ad hoc network; judging whether an effective path exists between a source node and a destination node of the mobile ad hoc network, and if not, broadcasting RREQ route request information to an intermediate node by the source node; judging whether the broadcasting time exceeds a first preset time, if so, terminating RREQ route request information to reach a destination node; sequencing the fitness function values according to each routing path so that the destination node carries out RREP routing response to reach the source node according to the routing path with the smallest fitness function value; judging whether the data packet transmission time exceeds a second preset time, and if so, selecting an optimal path from the alternative paths. The method of the invention is more suitable for the actual mobile ad hoc network environment, because each node changes all the time in the actual scene, so that the mobility of the node is necessary to be considered in the mobile ad hoc network.
Description
Technical Field
The invention belongs to the technical field of mobile ad hoc networks, and particularly relates to a method for optimizing a mobile ad hoc network route based on an improved sparrow search algorithm.
Background
In the course of human development, various disastrous natural disasters are almost experienced every year, and in the case of encountering large-scale natural disasters, life rescue actions are not supported by a communication service system, but the communication service system is severely destroyed due to the serious damage caused by the natural disasters, and the infrastructure is difficult to reconstruct and restore in a short time. In addition, in northwest areas, natural geographic environment causes rarity in Gobi areas, operators have less developed communication equipment in the areas for the economic benefit of communication, and thus, the communication difficulty is brought to former geological surveys or academic researchers.
Thus, with the continuous development of communication technology, the advent of mobile ad hoc networks has brought forward to communication service systems, and mobile ad hoc networks have become an important research field in wireless communication. The mobile ad hoc network developed from the traditional sensor network is increasingly valued by people because of the wide application scene. Although mobile ad hoc networks have the ability to transport and process data packets independently with dynamic joining and exiting without the need for a central entity, the individual nodes cooperate with each other.
However, the mobile ad hoc network is susceptible to interruption of communication links between nodes, thereby rendering the communication of the mobile ad hoc network ineffective. There are two main reasons for this phenomenon, respectively: the energy of the node is limited and the mobility of the node.
Disclosure of Invention
In order to solve the problems in the prior art, the invention provides a method for optimizing a mobile ad hoc network route based on an improved sparrow search algorithm. The technical problems to be solved by the invention are realized by the following technical scheme:
a method for optimizing mobile ad hoc network routing based on an improved sparrow search algorithm, comprising:
s1, starting a mobile ad hoc network;
s2, judging whether an effective path exists from a source node to a destination node of the mobile ad hoc network, if so, directly sending a data packet to the destination node by the source node, and if not, broadcasting RREQ route request information to an intermediate node by the source node so as to determine the intermediate node to be propagated;
s3, judging whether the broadcasting time exceeds a first preset time, if so, terminating RREQ route request information to reach a destination node;
s4, after the propagation time exceeds the first preset time, sequencing according to the fitness function value of each routing path so that the destination node carries out RREP routing response according to the routing path with the smallest fitness function value to reach the source node;
s5, judging whether the data packet transmission time exceeds a second preset time, and if so, selecting an optimal path from the alternative paths if the data packet transmission time does not exceed the second preset time and the destination node does not receive the data packet.
In one embodiment of the present invention, the source node broadcasting RREQ route request information to intermediate nodes to determine intermediate nodes to be propagated includes:
judging whether the destination node serial number recorded by the intermediate node is larger than the destination node serial number in the current RREQ route request information, judging whether the energy factor of the intermediate node is larger than an energy threshold factor, and if the destination node serial number of the intermediate node is larger than the destination node serial number in the current RREQ route request information, and the energy factor of the intermediate node is larger than the energy threshold factor, using the intermediate node as the intermediate node to be propagated.
In one embodiment of the present invention, the fitness function is:
wherein F is the fitness function value, t' m For the total value of the communication time prediction information value of each node t 'on the mth route path, E' m And (3) communicating the total value of the energy surplus ratio prediction information for each node E' on the mth routing path, wherein a and b are constant, and a+b=1 is satisfied.
In one embodiment of the present invention, the calculation formula of the communication energy remaining rate prediction information is:
wherein T isThe time of the network is such that,as energy factor, ε is network coefficient, E rest And E is the total energy value of the node.
In one embodiment of the present invention, the calculation formula of the communication time prediction information is:
wherein ,dmax For maximum communication link distance, R i,j For the communication link distance between an inode and a j node, the inode and the j node are any two adjacent nodes in the network, the i ' node and the j ' node are respectively nodes after the i node and the j node move for t ' time, v i Represented as velocity of motion of inode, v j Expressed as the speed of motion of node j.
In one embodiment of the present invention,
the calculation formula of the maximum communication link distance is as follows:
wherein ,the parameter factor for correcting the terrain is delta H, F is carrier frequency and H t To transmit the height of the antenna, H r To receive the height of the antenna, P t Radiation power of transmitting antenna, P r For receiving the power of the antenna, G r G for gain of receiving antenna t Is the gain of the transmitting antenna.
In one embodiment of the present invention, the method for generating the alternative path includes:
and judging whether a middle node with a connection relation exists between each route path according to the nodes traversed by each route path extracted from RREQ route request information reaching the destination node, if not, selecting K fitness function values with smaller values as alternative paths of network routes, and if so, solving the fitness function values of the new paths according to a sparrow search algorithm to obtain the alternative paths.
In one embodiment of the present invention, solving the fitness function value of the new path according to the improved sparrow search algorithm to obtain the alternative path includes:
in the improved sparrow searching algorithm, the position of the finder, the position of the adder and the position of the alerter are updated according to the minimum value of the current fitness function value, the fitness function value of the new path is obtained, and the route path corresponding to the minimum value of the fitness function values of all the new paths is used as the alternative path.
In one embodiment of the present invention, the location update formula of the finder is:
wherein ,for the position information of the p-th sparrow in the d-th dimension in the t+1th iteration,/for>For the position information of the p-th sparrow in the d-th dimension in the t-th iteration,/->Alpha epsilon [0,1 ] is the current global optimal position]Is a random number, R 2 For the early warning value, ST is a safety value, Q is obeying [0,1 ]]Normally distributed random numbers, L is a matrix with 1 x d dimension elements being 1, omega p Is a weight formula omega p ＝ω min +(ω max -ω min )·exp(-z(t/item max ) 2 )，ω min Omega is the minimum weight value max And z is a control factor, and is the maximum weight value.
In one embodiment of the present invention, the position update formula of the alerter is:
wherein ,for the position information of the p-th sparrow in the d-th dimension in the t+1th iteration,/for>For the current global optimal position, +.>For the worst position of the current global, beta is a step control parameter, beta obeys a normal distributed random number with mean value of 0 and variance of 1, f g F is the current global optimal fitness function value p Is the current fitness function value.
The invention has the beneficial effects that:
the method of the present invention is more suitable for the actual mobile ad hoc network environment, because each node is changed from time to time in the actual mobile ad hoc network application scene, and thus, it is necessary to fully consider the mobility of the node in the mobile ad hoc network.
The invention considers the movement speed and movement direction between two adjacent nodes into the networking method, and can effectively predict the time of losing communication connection between two adjacent nodes, thereby better improving the reliability of the communication link of the mobile ad hoc network.
The invention extends from the energy factor of the node to predicting the size of the communication energy surplus information. In mobile ad hoc networks, the energy of the nodes is often a focus of attention of researchers. Therefore, in the invention, firstly, compared with the energy factor of the current node through the preset energy threshold, if some node energy is not applicable, the RREQ message forwarded by the node is directly discarded, and the method can reduce the cost of the routing path. And secondly, through the communication of the energy residual rate prediction information, the change trend of the energy of each node along with time can be perceived, so that the situation that the energy is too low to carry out a routing process when data is forwarded is avoided, and the improvement of the utilization rate of the energy of each node in the mobile ad hoc network and the reduction of the network overhead are facilitated.
The invention adopts the method of improving the combination of the sparrow search algorithm and the mobility of the nodes and the energy of the nodes in the mobile ad hoc network, and the method can directly select a better path from the alternative paths to send the data packet without carrying out the process of route discovery again when the link of the data packet transmission is interrupted accidentally, thereby effectively improving the working efficiency of the mobile ad hoc network and improving the total efficiency of the whole network.
The present invention will be described in further detail with reference to the accompanying drawings and examples.
Drawings
Fig. 1 is a schematic flow chart of a method for optimizing a mobile ad hoc network route based on an improved sparrow search algorithm according to an embodiment of the present invention;
fig. 2 is a schematic diagram of a relationship between each node according to an embodiment of the present invention.
Detailed Description
The present invention will be described in further detail with reference to specific examples, but embodiments of the present invention are not limited thereto.
Example 1
Referring to fig. 1, fig. 1 is a flowchart of a method for optimizing a mobile ad hoc network route based on an improved sparrow search algorithm according to an embodiment of the present invention. The embodiment provides a method for optimizing mobile ad hoc network routing based on an improved sparrow search algorithm, which comprises the following steps of S1 to S5, wherein:
s1, starting a mobile ad hoc network.
Specifically, the mobile ad hoc network is started, and because each node has a GPS/Beidou positioning system, information related to the node can be obtained according to node equipment, including: position information, speed information, energy information, and angular direction information.
S2, judging whether an effective path exists between a source node and a destination node of the mobile ad hoc network, if so, directly sending a data packet to the destination node by the source node, and if not, broadcasting RREQ route request information to an intermediate node by the source node so as to determine the intermediate node to be propagated.
Specifically, when a source node is to send a data packet to a destination node in a mobile ad hoc network, if there is a valid path from the source node to the destination node, the data packet is directly sent, wherein address information of a next hop route exists on each node, if the address information is generated within a sequence number time which is not expired, the path is valid, otherwise, the source node needs to broadcast RREQ route request information, and a new address space needs to be extended for the RREQ route request information to store the communication energy remaining rate prediction information of each node on the traversed route path, the communication time prediction information of each node on the traversed route path, the total communication energy remaining rate prediction information value of the source node to the current node, and the total communication time prediction information value of the source node to the current node. The method aims at selecting an optimal routing path in a mobile ad hoc network, namely calculating the fitness function value of each routing path at a destination node according to the total communication time prediction information value and the total communication energy surplus rate prediction information value of each path, and then selecting the optimal routing path.
In this embodiment, when broadcasting the RREQ route request information, each intermediate node needs to update the route table information related to the node, including: the method comprises the steps of a destination node IP address, a destination node serial number valid flag bit, a next hop node IP address, communication energy residual rate prediction information of the node, communication time prediction information of the node, survival time and the like. Thus, the RREQ route request writes the communication energy remaining rate prediction information of the traversed node, the communication time prediction information of the traversed node, the total communication energy remaining rate prediction information value of the source node to the current node, and the total communication time prediction information value of the source node to the current node into the RREQ route request information when passing through the intermediate node. The destination node IP address and the destination node serial number effective flag bit are updated according to RREQ route request information, the next hop node IP address and the communication time prediction information of the traversed node are obtained by mutual information transmission and calculation among adjacent nodes according to Hello data packets in HELLO_INTERVAL time, and the survival time is the effective time of reverse route pointing to the source node IP address when a network receives a RREQ message, so that the node updates itself according to the received RREQ data packets, and the communication energy residual rate prediction information of the traversed node is obtained by calculation according to the energy factor, network time and network coefficient of the current node.
In one particular embodiment, the source node broadcasts RREQ route request information to the intermediate nodes to determine intermediate nodes to be propagated, comprising:
judging whether the destination node serial number recorded by the intermediate node is larger than the destination node serial number in the current RREQ route request information, judging whether the energy factor of the intermediate node is larger than the energy threshold factor, and if the destination node serial number of the intermediate node is larger than the destination node serial number in the current RREQ route request information and the energy factor of the intermediate node is larger than the energy threshold factor, taking the intermediate node as the intermediate node to be propagated, wherein the intermediate node to be propagated is the intermediate node to be selected for sending the data packet to the destination node by the source node.
Specifically, if the intermediate node has a route to the destination node, the route is only a valid route if the destination node serial number recorded by the intermediate node is larger than the destination node serial number in the current RREQ route request information; in addition, the RREQ message compares the energy factor with the energy threshold factor, if the energy is higher than the energy threshold factor, the RREQ message is further sent, otherwise, the RREQ message is directly discarded.
S3, judging whether the broadcasting time exceeds the first preset time, and if so, terminating the RREQ route request information to reach the destination node.
Specifically, by setting an extended timer, the destination node can obtain more RREQ route request information, and when the extended timer time arrives (i.e., the broadcast time exceeds a first preset time), the obtaining of other RREQ route request information is terminated to continue to reach the destination node, where the first preset time is a time set by, for example, the extended timer according to actual needs, and an actual worker can set according to the actual needs, which is not limited in this embodiment.
And S4, after the propagation time exceeds the first preset time, sequencing according to the fitness function value of each routing path so that the destination node carries out RREP routing response to reach the source node according to the routing path with the smallest fitness function value.
Specifically, when the time of the first preset time set by the extension timer arrives, the destination node terminates acquiring other RREQ route request information. The destination node solves the fitness function value of each routing path according to the total value of the communication energy residual rate prediction information and the total value of the communication time prediction information of each routing path, sorts the fitness function values of each routing path, further obtains the optimal value and the worst value of the fitness function value of the current global, and then the destination node carries out RREP routing response to reach the source node according to the optimal (i.e. minimum) fitness function value.
In this embodiment, the fitness function is:
wherein F is the fitness function value, t' m For the total value of the communication time prediction information value of each node t 'on the mth route path, E' m For the sum of the predicted information of the energy surplus rate of each node E' on the mth route path, a and b are constant and satisfy a+b=1, and in general, takeCan be specifically adjusted according to experimental requirements.
The calculation formula of the communication energy residual rate prediction information is as follows:
wherein T is the network time,as the energy factor, epsilon is a network coefficient, epsilon is the average value of node energy factors in the T time period, E rest And E is the total energy value of the node.
Please refer to fig. 2, r i,j Is the communication link distance between the i node and the j node, wherein,
R′ i,j' the communication link distance at time t ' for i ' node and j ' node, wherein,
to enable communication nodes to be separated from each other by a maximum communication link distance d max Effectively communicates internally, thus letting R 'in the communication predicted time information in the present embodiment' i,j' ＝d max (i.e., assuming that the communication link distance between two adjacent nodes, i.e., i-node and j-node, reaches a maximum), a time t' is calculated at which the two adjacent nodes move to lose the link communication range. Then:
the calculation formula of the maximum communication link distance is as follows:
wherein ,parameter factor for correcting terrain, delta h being the location of the placeThe height of the waveform, F is carrier frequency, H t To transmit the height of the antenna, H r To receive the height of the antenna, P t Radiation power of transmitting antenna, P r For receiving the power of the antenna, G r G for gain of receiving antenna t Is the gain of the transmitting antenna. .
Thus t' is:
wherein ,dmax For maximum communication link distance, R i,j For the communication link distance between an inode and a j node, the inode and the j node are any two adjacent nodes in the network, the i ' node and the j ' node are respectively nodes after the i node and the j node move for t ' time, v i Expressed as the speed of the inode, v j Expressed as the speed of node j.
S5, judging whether the data packet transmission time exceeds a second preset time, and if so, selecting an optimal path from the alternative paths if the data packet transmission time exceeds the second preset time and the destination node does not receive the data packet.
Specifically, since the node often experiences a link interruption, the best path selected in step S4 cannot be communicated, in order to avoid the rerouting process. When the destination node carries out RREP route response according to the route path with the minimum fitness function value and reaches the source node, if the second preset time is exceeded, the destination node still does not receive the data packet, which indicates that the route path transmitted by the data packet is interrupted by a link, and the optimal path selected in the step S4 cannot be communicated.
In a specific embodiment, the method for generating the alternative path includes:
and judging whether a middle node with a connection relation exists between each route path according to the nodes traversed by each route path extracted from RREQ route request information reaching the destination node, if not, selecting smaller K fitness function values as alternative paths of network routes, and if so, solving the fitness function values of the new paths according to a sparrow search algorithm to obtain the alternative paths.
Specifically, when the optimal path selected in step S4 cannot be communicated, the rerouting process is avoided. Therefore, in the destination node, intermediate node information traversed in the RREQ route request information of each route path is also required to be extracted, so as to determine whether a node with a connection relationship exists as backup optimal path information, where at least two nodes may send the RREQ route request information to a certain node, and the node is the node with the connection relationship. If no connection relation exists, the adaptation function value in the step S4 is directly used, and K smaller adaptation function values are reserved as alternative paths, wherein K is 3-4 for example. If the connection relation exists, the optimal routing path is solved by combining the communication energy residual rate prediction information of each node in the RREQ routing request information and the communication time prediction information of each node with an improved sparrow search algorithm, and the optimal routing path is taken as an alternative path scheme.
In this embodiment, the method for solving the fitness function value of the new path according to the improved sparrow search algorithm to obtain the alternative path includes:
in the improved sparrow search algorithm, the position of the finder, the position of the adder and the position of the alerter are updated according to the minimum value of the current fitness function value, the fitness function value of the new path is obtained, and the path corresponding to the minimum value of the fitness function values of all the new paths is used as an alternative path.
Specifically, setting relevant parameter values for improving a sparrow search algorithm includes: the number of sparrows, the initial position of sparrows, the number of discoverers, the number of followers, the number of alerters, the maximum number of iterations, the dimension D of the search space, the early warning value, the safety value, the upper limit value of the dimension and the lower limit value of the dimension. And sequencing the initial fitness function values to obtain the current global optimal value and the worst value, updating the position of the finder, the position of the adder and the position of the alerter, circularly updating until the maximum iteration number is reached, and then outputting the global optimal position and the optimal value, wherein the fitness function value corresponding to the optimal value is the current optimal path, and the path is taken as an alternative path.
The location update formula of the finder is:
wherein ,for the position information of the p-th sparrow in the d-th dimension in the t+1th iteration,/for>For the position information of the p-th sparrow in the d-th dimension in the t-th iteration,/->Alpha epsilon [0,1 ] is the current global optimal position]Is a random number, R 2 For the early warning value, ST is a safety value, Q is obeying [0,1 ]]Normally distributed random numbers, L is a matrix with 1 x d dimension elements being 1, omega p Is a weight formula omega p ＝ω min +(ω max -ω min )·exp(-z(t/item max ) 2 )，ω min Omega is the minimum weight value max And z is a control factor, and is the maximum weight value.
The position update formula of the alerter is:
wherein ,is p-th onlyPosition information of sparrow in the (t+1) th iteration in the (d) th dimension,>for the current global optimal position, +.>For the worst position of the current global, beta is a step control parameter, beta obeys a normal distributed random number with mean value of 0 and variance of 1, f g F is the current global optimal fitness function value p Is the current fitness function value.
The method of the present invention is more suitable for the actual mobile ad hoc network environment, because each node is changed from time to time in the actual mobile ad hoc network application scene, and thus, it is necessary to fully consider the mobility of the node in the mobile ad hoc network.
The invention considers the movement speed and movement direction between two adjacent nodes into the networking method, and can effectively predict the time of losing communication connection between two adjacent nodes, thereby better improving the reliability of the communication link of the mobile ad hoc network.
The invention extends from the energy factor of the node to predicting the size of the communication energy surplus information. In mobile ad hoc networks, the energy of the nodes is often a focus of attention of researchers. Therefore, in the invention, firstly, compared with the energy factor of the current node through the preset energy threshold, if some node energy is not applicable, the RREQ message forwarded by the node is directly discarded, and the method can reduce the cost of the routing path. And secondly, through the communication of the energy residual rate prediction information, the change trend of the energy of each node along with time can be perceived, so that the situation that the energy is too low to carry out a routing process when data is forwarded is avoided, and the improvement of the utilization rate of the energy of each node in the mobile ad hoc network and the reduction of the network overhead are facilitated.
The invention adopts the method of improving the combination of the sparrow search algorithm and the mobility of the nodes and the energy of the nodes in the mobile ad hoc network, and the method can lead the links of the data packet transmission in the mobile ad hoc network to be unnecessary to carry out the process of route discovery again when accidental interruption occurs, and can directly select a better path from the alternative paths to send the data packet, thereby effectively improving the working efficiency of the mobile ad hoc network and improving the total efficiency of the whole network.
In the description of the present invention, the terms "first," "second," and the like are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defining "a first" or "a second" may explicitly or implicitly include one or more such feature. In the description of the present invention, the meaning of "a plurality" is two or more, unless explicitly defined otherwise.
In the description of the present specification, a description referring to the terms "one embodiment," "some embodiments," "examples," "specific examples," or "some examples," etc., means that a particular feature, structure, material, or data point described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, schematic representations of the above terms are not necessarily directed to the same embodiment or example. Furthermore, the particular features, structures, materials, or data points described may be combined in any suitable manner in one or more embodiments or examples. Further, one skilled in the art can engage and combine the different embodiments or examples described in this specification.
The foregoing is a further detailed description of the invention in connection with the preferred embodiments, and it is not intended that the invention be limited to the specific embodiments described. It will be apparent to those skilled in the art that several simple deductions or substitutions may be made without departing from the spirit of the invention, and these should be considered to be within the scope of the invention.
Claims (9)
1. A method for optimizing mobile ad hoc network routing based on an improved sparrow search algorithm, comprising:
s1, starting a mobile ad hoc network;
s2, judging whether an effective path exists from a source node to a destination node of the mobile ad hoc network, if so, directly sending a data packet to the destination node by the source node, and if not, broadcasting RREQ route request information to an intermediate node by the source node so as to determine the intermediate node to be propagated; judging whether the destination node serial number recorded by the intermediate node is larger than the destination node serial number in the current RREQ route request information, judging whether the energy factor of the intermediate node is larger than an energy threshold factor, and if the destination node serial number of the intermediate node is larger than the destination node serial number in the current RREQ route request information, and the energy factor of the intermediate node is larger than the energy threshold factor, using the intermediate node as the intermediate node to be propagated;
s3, judging whether the broadcasting time exceeds a first preset time, if so, terminating RREQ route request information to reach a destination node;
s4, after the broadcasting time exceeds the first preset time, sequencing according to the fitness function value of each routing path so that the destination node carries out RREP routing response according to the routing path with the smallest fitness function value to reach the source node;
s5, judging whether the data packet transmission time exceeds a second preset time, and if so, selecting an optimal path from the alternative paths if the data packet transmission time does not exceed the second preset time and the destination node does not receive the data packet.
2. The method for optimizing mobile ad hoc network routing based on an improved sparrow search algorithm of claim 1, wherein the fitness function is:
wherein F is the fitness function value, t' m For the total value of the communication time prediction information value of each node t 'on the mth route path, E' m For the mth routing pathThe above nodes E' communicate the total value of the energy residual rate prediction information, a and b are both constants, and a+b=1 is satisfied.
3. The method for optimizing mobile ad hoc network routing based on an improved sparrow search algorithm according to claim 2, wherein the calculation formula of the communication energy remaining rate prediction information is:
wherein T is the network time,as energy factor, ε is network coefficient, E rest And E is the total energy value of the node.
4. The method for optimizing mobile ad hoc network routing based on an improved sparrow search algorithm according to claim 2, wherein the calculation formula of the communication time prediction information is:
wherein ,dmax For maximum communication link distance, R i,j For the communication link distance between an inode and a j node, the inode and the j node are any two adjacent nodes in the network,the i 'node and the j node are respectively nodes after the i node and the j node move for t' time, v i Expressed as the speed of the inode, v j Expressed as the speed of node j.
5. The method for optimizing mobile ad hoc network routing based on the improved sparrow search algorithm of claim 4, wherein said maximum communication link distance is calculated as:
wherein ,the parameter factor for correcting the terrain is delta H, F is carrier frequency and H t To transmit the height of the antenna, H r To receive the height of the antenna, P t Radiation power of transmitting antenna, P r For receiving the power of the antenna, G r G for gain of receiving antenna t Is the gain of the transmitting antenna.
6. The method for optimizing mobile ad hoc network routing based on an improved sparrow search algorithm of claim 1, wherein said alternative path generating method comprises:
and judging whether an intermediate node with a connection relation exists between each route path according to the nodes traversed by each route path extracted from RREQ route request information reaching the destination node, if not, selecting K fitness function values in smaller values as alternative paths of network routes, and if so, solving the fitness function values of the new paths according to an improved sparrow search algorithm to obtain the alternative paths.
7. The method of optimizing mobile ad hoc network routing based on an improved sparrow search algorithm of claim 6, wherein solving the fitness function value of the new path according to the improved sparrow search algorithm to obtain the alternative path comprises:
in the improved sparrow searching algorithm, the position of the finder, the position of the adder and the position of the alerter are updated according to the minimum value of the current fitness function value, the fitness function value of the new path is obtained, and the route path corresponding to the minimum value of the fitness function values of all the new paths is used as the alternative path.
8. The method for optimizing mobile ad hoc network routing based on an improved sparrow search algorithm of claim 7, wherein said finder's location update formula is:
wherein ,for the position information of the p-th sparrow in the d-th dimension in the t+1th iteration,/for>For the position information of the p-th sparrow in the d-th dimension in the t-th iteration,/->Alpha epsilon [0,1 ] is the current global optimal position]Is a random number, R 2 For the early warning value, ST is a safety value, Q is obeying [0,1 ]]Normally distributed random numbers, L is a matrix with 1 x d dimension elements being 1, omega p Is a weight formula omega p ＝ω min +(ω max -ω min )·exp(-z(t/item max ) 2 )，ω min Omega is the minimum weight value max And z is a control factor, and is the maximum weight value.
9. The method for optimizing mobile ad hoc network routing based on an improved sparrow search algorithm of claim 7, wherein said alerter's location update formula is:
wherein ,for the position information of the p-th sparrow in the d-th dimension in the t+1th iteration,/for>For the current global optimal position, +.>For the worst position of the current global, beta is a step control parameter, beta obeys a normal distributed random number with mean value of 0 and variance of 1, f g F is the current global optimal fitness function value p Is the current fitness function value.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111396398.1A CN114189887B (en) | 2021-11-23 | 2021-11-23 | Method for optimizing mobile ad hoc network route based on improved sparrow search algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111396398.1A CN114189887B (en) | 2021-11-23 | 2021-11-23 | Method for optimizing mobile ad hoc network route based on improved sparrow search algorithm |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114189887A CN114189887A (en) | 2022-03-15 |
| CN114189887B true CN114189887B (en) | 2023-08-08 |
Family
ID=80602448
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111396398.1A Active CN114189887B (en) | 2021-11-23 | 2021-11-23 | Method for optimizing mobile ad hoc network route based on improved sparrow search algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114189887B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117221846A (en) * | 2023-08-15 | 2023-12-12 | 广州视声智能股份有限公司 | Ad hoc network method of multiple Bluetooth sensors and Bluetooth network |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2008082971A (en) * | 2006-09-28 | 2008-04-10 | Ntt Facilities Inc | Nondestructive survey instrument, method therefor, and program |
| CN101334663A (en) * | 2008-06-11 | 2008-12-31 | 清华大学 | Machine group scheduling method based on process capacity characteristic model |
| CN104897248A (en) * | 2015-06-12 | 2015-09-09 | 天津大学 | Method for accurately estimating propagation time of ultrasonic flowmeter under noise background |
| CN105577547A (en) * | 2016-01-18 | 2016-05-11 | 重庆邮电大学 | Multi-Qos based route selection method in mobile self-organizing network |
| CN111132304A (en) * | 2019-12-31 | 2020-05-08 | 展讯通信（上海）有限公司 | Whole network synchronization method and device of ad hoc network, terminal and storage medium |
| CN112461247A (en) * | 2020-12-16 | 2021-03-09 | 广州大学 | Robot path planning method based on self-adaptive sparrow search algorithm |
| CN112533262A (en) * | 2020-10-15 | 2021-03-19 | 广州大学 | Multi-path on-demand routing method of rechargeable wireless sensor network |
| CN113485371A (en) * | 2021-08-11 | 2021-10-08 | 河海大学 | Underwater multi-AUV path planning method based on improved sparrow search algorithm |
| CN113490251A (en) * | 2021-07-07 | 2021-10-08 | 中国科学院上海微系统与信息技术研究所 | Mobile ad hoc network route construction method based on flooding constraint and multi-metric function |
-
2021
- 2021-11-23 CN CN202111396398.1A patent/CN114189887B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2008082971A (en) * | 2006-09-28 | 2008-04-10 | Ntt Facilities Inc | Nondestructive survey instrument, method therefor, and program |
| CN101334663A (en) * | 2008-06-11 | 2008-12-31 | 清华大学 | Machine group scheduling method based on process capacity characteristic model |
| CN104897248A (en) * | 2015-06-12 | 2015-09-09 | 天津大学 | Method for accurately estimating propagation time of ultrasonic flowmeter under noise background |
| CN105577547A (en) * | 2016-01-18 | 2016-05-11 | 重庆邮电大学 | Multi-Qos based route selection method in mobile self-organizing network |
| CN111132304A (en) * | 2019-12-31 | 2020-05-08 | 展讯通信（上海）有限公司 | Whole network synchronization method and device of ad hoc network, terminal and storage medium |
| CN112533262A (en) * | 2020-10-15 | 2021-03-19 | 广州大学 | Multi-path on-demand routing method of rechargeable wireless sensor network |
| CN112461247A (en) * | 2020-12-16 | 2021-03-09 | 广州大学 | Robot path planning method based on self-adaptive sparrow search algorithm |
| CN113490251A (en) * | 2021-07-07 | 2021-10-08 | 中国科学院上海微系统与信息技术研究所 | Mobile ad hoc network route construction method based on flooding constraint and multi-metric function |
| CN113485371A (en) * | 2021-08-11 | 2021-10-08 | 河海大学 | Underwater multi-AUV path planning method based on improved sparrow search algorithm |
Non-Patent Citations (1)
| Title |
|---|
| 高寒.移动边缘计算环境中基于能耗...度神经网络计算任务卸载策略.《计算机集成制造系统》.2020,全文. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114189887A (en) | 2022-03-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20060178156A1 (en) | Routing method in a wireless sensor network | |
| CN102264114B (en) | ZigBee sensor network tree route low-expense optimization method | |
| CN110572797B (en) | Route-finding network topology structure for emergency communication and routing method thereof | |
| Kumar et al. | 3D location oriented routing in flying ad-hoc networks for information dissemination | |
| Jianmin et al. | Ardeep: Adaptive and reliable routing protocol for mobile robotic networks with deep reinforcement learning | |
| CN114189887B (en) | Method for optimizing mobile ad hoc network route based on improved sparrow search algorithm | |
| CN104581817A (en) | Dynamic shortest path weighting routing method in mobile ad-hoc network | |
| Tariq et al. | IMOC: Optimization technique for drone-assisted VANET (DAV) based on moth flame optimization | |
| CN104202724A (en) | AANET combined routing algorithm based on geographical location information | |
| Gavali et al. | Energy optimization using swarm intelligence for IoT-authorized underwater wireless sensor networks | |
| CN111970731B (en) | Spray and Wait mobile opportunistic network routing method based on node reputation | |
| CN109803342A (en) | A kind of unmanned plane method for self-organizing network routing towards balancing energy highly-reliable transmission | |
| Li et al. | Ad hoc network routing protocol based on location and neighbor sensing | |
| Waheed et al. | Laod: Link aware on demand routing in flying ad-hoc networks | |
| Shen et al. | Trajectory control of mobile access points in MANET | |
| Wang et al. | A stable on-demand routing protocol for mobile ad hoc networks with weight-based strategy | |
| Raj et al. | Analysis and comparison of EEEMR protocol with the flat routing protocols of wireless sensor networks | |
| Rath et al. | QoS satisfaction in MANET based real time applications | |
| Feng et al. | RBMulticast: Receiver based multicast for wireless sensor networks | |
| Saifullah et al. | A new geographical routing protocol for heterogeneous aircraft ad hoc networks | |
| Bheemalingaiah et al. | Energy aware clustered based multipath routing in mobile ad hoc networks | |
| Basu et al. | A Comparative Study on Propagation Models for Routing Protocols in FANETs | |
| CN110324875A (en) | A kind of wireless sensor network energy consumption balance method for routing based on node center | |
| Sargolzaey et al. | Probabilistic route reliability with distance | |
| Deng et al. | LPAR: Link Stability Prediction-based Adaptive Routing Protocol for Flying Ad Hoc 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 |