CN111526088A - DTN route dynamic switching method, device and storage medium - Google Patents

DTN route dynamic switching method, device and storage medium Download PDF

Info

Publication number
CN111526088A
CN111526088A CN202010187323.1A CN202010187323A CN111526088A CN 111526088 A CN111526088 A CN 111526088A CN 202010187323 A CN202010187323 A CN 202010187323A CN 111526088 A CN111526088 A CN 111526088A
Authority
CN
China
Prior art keywords
message
current node
node
current
routing algorithm
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.)
Pending
Application number
CN202010187323.1A
Other languages
Chinese (zh)
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.)
SHENZHEN AEROSPACE INNOTECH CO Ltd
Shenzhen Academy of Aerospace Technology
Original Assignee
SHENZHEN AEROSPACE INNOTECH CO Ltd
Shenzhen Academy of Aerospace Technology
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 SHENZHEN AEROSPACE INNOTECH CO Ltd, Shenzhen Academy of Aerospace Technology filed Critical SHENZHEN AEROSPACE INNOTECH CO Ltd
Priority to CN202010187323.1A priority Critical patent/CN111526088A/en
Publication of CN111526088A publication Critical patent/CN111526088A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • 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/24—Multipath
    • 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
    • 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/124—Shortest path evaluation using a combination of metrics
    • 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/24—Multipath
    • H04L45/245—Link aggregation, e.g. trunking

Landscapes

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

Abstract

The invention discloses a dynamic switching method, equipment and a storage medium of a DTN (dynamic delay tolerant network) route, wherein the dynamic switching method of the DTN route obtains a node message value of a current node according to a load utilization rate by obtaining an interaction factor and the load utilization rate of the current node, obtains a load utilization rate correction value and a node message value correction value of the current node by combining the interaction factor and the load utilization rate, further obtains the deviation degree of each routing algorithm of the current node after obtaining the message priority of the current node through the load utilization rate correction value and the node message value correction value, and finally switches the routing algorithm of the current node into the routing algorithm with the minimum deviation degree; the method solves the problem that the mobile relay node cannot reasonably utilize the cache resource of the node due to the adoption of a single routing algorithm in the operation process of the DTN, so that the routing performance of the DTN is poor, and provides the DTN routing dynamic switching method which can adapt to the node state and improve the transmission performance.

Description

DTN route dynamic switching method, device and storage medium
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a method, a device, and a storage medium for dynamically switching a DTN route.
Background
DTN: delay Tolerant Networks, Delay Tolerant Networks;
epidemic algorithm: the basic idea of Epidemic algorithm is that when 2 communication nodes meet, data packets which are not available in both sides are exchanged, and after sufficient exchange, theoretically, each non-isolated node receives all the data packets, so that the transmission of the data packets is realized;
pray and Wait algorithm: the pray and Wait algorithm is divided into 2 stages, firstly, a Spray stage, part of data packets in a source node are diffused to neighbor nodes, then, the Wait stage is entered, if a target node is not found in the Spray stage, a node containing the data packets transmits the data packets to the target node in a Direct Delivery mode, namely, the data packets are transmitted only when the target node is encountered. The transmission quantity of the algorithm is obviously less than that of the Epidemic algorithm, the transmission success rate is high, the transmission delay is small, and the algorithm applicability is strong;
prophet algorithm: the Prophet algorithm is based on a probability strategy, estimates the probability of successful message transmission, selectively copies data packets, and avoids generating copies with low transmission efficiency as far as possible. The algorithm defines a transmission prediction value to describe the probability of successful transmission between nodes. When 2 nodes meet, the nodes update the respective transmission prediction values and use the values to decide whether to forward the data packet.
With the rapid development of scientific technology, communication technology is continuously updated. The conventional TCP/IP protocol requires a stable end-to-end link between the communication nodes, and thus the overall packet loss rate of the network formed thereby is kept at a very low level. However, in some communication environments, for example: in challenging networks such as a land mobile network, a heterogeneous medium network, a military Ad-Hoc network and the like, conditions for meeting the requirements of a TCP/IP protocol on a communication link do not exist, and in the networks, the contact between communication nodes is weak, the communication nodes continuously move, and the network topology structure is frequently split, so that the concept of the DTN is proposed in order to meet the requirement for realizing the communication between the communication nodes under the condition.
However, at present, only a single routing algorithm can be adopted in the operation process of the DTN network, so that the mobile relay node cannot exhibit good routing performance under normal conditions because the cache resource of the node cannot be reasonably utilized. Therefore, how to improve the operation performance of the DTN network becomes a technical problem that those skilled in the art are eagerly to solve.
Disclosure of Invention
The present invention is directed to solving at least one of the problems of the prior art. Therefore, the invention provides a dynamic DTN route switching method adaptive to the node state so as to improve the transmission performance of the nodes in the DTN.
In a first aspect, an embodiment of the present invention provides a method for dynamically switching a DTN route, where the method includes:
acquiring a mutual influence factor of a current node and acquiring the load utilization rate of the current node;
obtaining the node message value of the current node according to the load utilization rate;
obtaining a load utilization rate correction value of the current node according to the interaction factor and the load utilization rate, and obtaining a node message value correction value of the current node according to the interaction factor and the node message value;
obtaining the message priority of the current node according to the load utilization rate correction value and the node message value correction value;
obtaining the deviation degree of each routing algorithm of the current node according to the message priority and comparing the deviation degrees;
and switching the routing algorithm of the current node to the routing algorithm with the minimum deviation degree.
The DTN route dynamic switching method of the embodiment of the invention at least has the following beneficial effects:
the invention provides a dynamic DTN routing switching method, which comprises the steps of obtaining mutual influence factors and load utilization rate of a current node, obtaining node message value of the current node according to the load utilization rate, obtaining a load utilization rate correction value and a node message value correction value of the current node by combining the mutual influence factors and the load utilization rate, further obtaining deviation degree of each routing algorithm of the current node after obtaining message priority of the current node through the load utilization rate correction value and the node message value correction value, and finally switching the routing algorithm of the current node into the routing algorithm with the minimum deviation degree; the dynamic DTN routing switching method solves the technical problem that in the prior art, only a single routing algorithm can be adopted in the operation process of the DTN, so that the mobile relay node cannot reasonably utilize the cache resource of the node, and the DTN routing performance is poor, and the dynamic DTN routing switching method can adapt to the node state and improve the transmission performance.
According to the DTN route dynamic switching method of another embodiment of the present invention, the acquiring the mutual influence factor of the current node specifically includes:
determining a routing algorithm that the current node has implemented;
counting the message forwarding number using the routing algorithm, and acquiring the communication time interval between the current node and the communication node; the communication node is a node which transmits messages with the current node by adopting the routing algorithm;
processing the message forwarding number and the communication time interval by adopting linear regression to obtain a message attenuation coefficient of the current node;
the interaction factor is determined by:
Figure BDA0002414657050000031
wherein, muijFor the interaction factor, r is the message attenuation coefficient, Δ TijIs a communication time interval.
According to other embodiments of the present invention, the routing algorithm includes one or more of the following:
epidemic algorithm, Spray and Wait algorithm, Prophet algorithm.
According to another embodiment of the present invention, the method for dynamically switching DTN routes includes:
the remaining life time of each message in the current node specifically includes:
Figure BDA0002414657050000032
wherein, αjTTL being said time-to-live margin for message jjTTL value of message j at current timeOjIs the initialization time of message j;
the ratio of the message receiving time in the current node to the current time of the system is specifically:
Figure BDA0002414657050000033
wherein, βjIs the ratio of the time of receiving the message to the current time of the system,
Figure BDA0002414657050000034
time of reception of message j, T, for said current nodenowThe current system time of the simulation system;
the ratio of the total number of network nodes to the total number of network nodes after the total number of network nodes is different from the number of nodes through which the message received by the current node passes is specifically as follows:
Figure BDA0002414657050000041
wherein, γjThe ratio of the total number of nodes of the network to the total number of nodes of the network after the total number of nodes of the network is subtracted from the number of nodes of the message j received by the current node, N is the total number of nodes of the network,
Figure BDA0002414657050000042
number of nodes passed by the current node for message j。
According to the DTN route dynamic switching method according to another embodiment of the present invention, the node message value is specifically obtained according to the following formula:
Figure BDA0002414657050000043
wherein, ViIs the node message value of the current node, n is the number of messages in the message queue of the current node, a, b and c are all preset adjustment factors, and a, b and c ∈ [0,1]，a+b+c＝1。
According to another embodiment of the DTN route dynamic switching method of the present invention, the load usage correction value is specifically obtained according to the following formula:
Figure BDA0002414657050000044
the node message value correction value is specifically obtained according to the following formula:
Figure BDA0002414657050000045
wherein,
Figure BDA0002414657050000046
j is the total number of communication nodes of the current node, η, as the load usage correction valuejLoad usage for the communication node, ηiFor the utilization load rate of the current node, muijAn impact factor of the communication node on the current node,
Figure BDA0002414657050000047
for value correction of said node message, ViA node message value, V, for the current nodejA node message value for the communication node.
According to the DTN route dynamic switching method according to another embodiment of the present invention, the message priority is specifically obtained by the following formula:
Figure BDA0002414657050000051
wherein, PiIs the message priority of the current node,
Figure BDA0002414657050000052
for the load usage correction value or values,
Figure BDA0002414657050000053
and the value of the node message is corrected.
According to the DTN route dynamic switching method of another embodiment of the present invention, the comparing the deviation degrees of the routing algorithms of the current node according to the message priority specifically includes:
calculating the message payment rate requirement of the current node:
Figure BDA0002414657050000054
wherein, DRdPaying a rate requirement for the message of the current node,
Figure BDA0002414657050000055
average payout rate, DR, of routing algorithm already implemented for the current nodemaxMaximum payment rate, DR, for the routing algorithm that the current node has implementedminA minimum payment rate for a routing algorithm that has been implemented for the current node;
calculating the delivery delay requirement of the current node:
Figure BDA0002414657050000056
wherein, ALdFor the delivery latency requirements of the current node,
Figure BDA0002414657050000057
has been implemented for the current nodeAverage delivery delay of the routing Algorithm of (AL)maxMaximum delivery delay, AL, for routing algorithm already implemented by the current nodeminMinimum delivery delay for the routing algorithm already implemented for the current node;
calculating the deviation degree of each routing algorithm:
Figure BDA0002414657050000058
wherein,
Figure BDA0002414657050000059
for the degree of deviation of the respective routing algorithms of the current node,
Figure BDA00024146570500000510
the deviation degree of the message payment rate of the routing algorithm k in the current node and the message payment rate requirement of the current node,
Figure BDA0002414657050000061
and p is a message payment rate grading influence factor, and q is a message delivery delay grading influence factor, wherein p is the deviation degree of the delivery delay of the routing algorithm k in the current node and the message delivery delay requirement of the current node.
In a second aspect, an embodiment of the present invention provides a dynamic DTN route switching device, including:
at least one processor, and a memory communicatively coupled to the at least one processor;
wherein the at least one processor is configured to execute the DTN route dynamic switching method by invoking a computer program stored in the memory.
In a third aspect, an embodiment of the present invention provides a computer-readable storage medium, where computer-executable instructions are stored, and the computer-executable instructions are configured to cause a computer to execute the DTN route dynamic switching method.
Drawings
Fig. 1 is a flowchart of an embodiment of a dynamic DTN route switching method according to the present invention;
fig. 2 is a flowchart of an embodiment of obtaining the mutual influence factor in a dynamic DTN routing switching method according to the present invention.
Detailed Description
The concept and technical effects of the present invention will be clearly and completely described below in conjunction with the embodiments to fully understand the objects, features and effects of the present invention. It is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all embodiments, and those skilled in the art can obtain other embodiments without inventive effort based on the embodiments of the present invention, and all embodiments are within the protection scope of the present invention.
In the description of the embodiments of the present invention, if "a number" is referred to, it means one or more, if "a plurality" is referred to, it means two or more, if "greater than", "less than" or "more than" is referred to, it is understood that the number is not included, and if "greater than", "lower" or "inner" is referred to, it is understood that the number is included. References to "first", "second", "third", etc., are to be understood as being used to distinguish between technical features and are not intended to indicate or imply relative importance or to implicitly indicate a number of indicated technical features or to implicitly indicate a precedence relationship of the indicated technical features.
Referring to fig. 1, an embodiment of the present invention provides a dynamic DTN route switching method, which includes the following steps:
s100, obtaining mutual influence factors and load utilization rate;
the mutual influence factor and the load utilization rate are two important parameters of the current communication state of the current node, and the communication state of the current node can be effectively optimized by acquiring the mutual influence factor and the load utilization rate of the current node as basic data of subsequent calculation.
S200, acquiring a node message value;
through the load utilization rate of the current node obtained in step S100, the node message value of the current node is further obtained, the node message value represents the importance degree of the message cached in the current node, and the subsequent calculation processing is performed by obtaining the node message value of the current node.
S300, acquiring a load utilization rate correction value and a node message value correction value;
and obtaining the load utilization rate of the communication node of the interaction factor generated with the current node after obtaining the interaction factor and the load utilization rate of the current node in the step S100, and obtaining the load utilization rate modification value of the current node by combining the interaction factor and the load utilization rates of the interaction factor and the current node.
And further acquiring the node message value of the communication node of the mutual influence factor generated with the current node after the mutual influence factor of the current node is acquired in the step S100 and the node message value of the current node is acquired in the step S200, and acquiring the node message value correction value of the current node by combining the mutual influence factor and the node message values of the mutual influence factor.
S400, acquiring message priority;
and obtaining the message priority of the current node according to the load utilization rate modification value and the node message value modification value of the current node obtained in the step S300, wherein the message priority reflects the property of the message carried by the current node, and different routing algorithms are distributed to the current node according to different message priorities so as to meet the communication requirement of the current node.
S500, obtaining and comparing the deviation degrees of the routing algorithms;
after the message priority of the current node is obtained in step S400, deviation degrees of the routing algorithms in the current node are calculated according to the requirement of the message priority, and the routing algorithm with the smallest deviation degree indicates that the routing algorithm best meets the communication requirement of the current node.
S600, switching to a routing algorithm with the minimum deviation degree;
and switching the routing algorithm of the current node to the routing algorithm with the minimum deviation degree obtained in the step S500 for communication.
The invention provides a dynamic DTN routing switching method, which comprises the steps of obtaining mutual influence factors and load utilization rate of a current node, obtaining node message value of the current node according to the load utilization rate, obtaining a load utilization rate correction value and a node message value correction value of the current node by combining the mutual influence factors and the load utilization rate, further obtaining deviation degree of each routing algorithm of the current node after obtaining message priority of the current node through the load utilization rate correction value and the node message value correction value, and finally switching the routing algorithm of the current node into the routing algorithm with the minimum deviation degree; the dynamic DTN routing switching method solves the technical problem that in the prior art, only a single routing algorithm can be adopted in the operation process of the DTN, so that the mobile relay node cannot reasonably utilize the cache resource of the node, and the DTN routing performance is poor, and the dynamic DTN routing switching method can adapt to the node state and improve the transmission performance.
Referring to fig. 2, in some embodiments, the obtaining of the interaction factor of the current node specifically includes the following steps:
s101, determining a routing algorithm which is realized by a current node; the routing algorithm comprises Epidemic algorithm, Spray and Wait algorithm and Prophet algorithm, and the implemented routing algorithm is the routing algorithm which adopts any one of the algorithms to forward the message.
S102, counting message forwarding numbers using a routing algorithm, and acquiring a communication time interval between a current node and a communication node; the communication node is also called a neighbor node, that is, a node performing message transmission with the current node.
And S103, processing the message forwarding number and the communication time interval obtained in the step S102 by adopting linear regression to obtain a message attenuation coefficient of the current node.
S104, determining the mutual influence factor according to the message attenuation coefficient and the communication time interval, wherein the mutual influence factor is specifically as follows:
Figure BDA0002414657050000081
wherein, muijFor the interaction factor, r is the message attenuation coefficient, Δ TijIs a communication time interval. In this embodiment, the current node needs to select an appropriate node cache size and simulation time, the appropriate node cache size is selected so that the routing algorithm implemented in the node runs in a cache limited state, and the appropriate simulation time is selected so that the relationship between the number of messages required in the subsequent step and the communication time interval can be completely expressed, and simulation time is not wasted.
In some embodiments, the node cache size is selected from the interval of 2MB to 7MB, and the simulation time is selected from the interval of 0h to 120 h. The following table lists the distribution of the message attenuation coefficient r under part of different node cache sizes:
TABLE 1 distribution of attenuation coefficient r under different node cache sizes
Figure BDA0002414657050000091
In some embodiments, the load usage rate includes a time-to-live margin α for each message in the current node ijThe ratio β of the time of message reception in the current node i to the current time of the systemjAfter the difference is made between the total number of nodes in the network and the number of nodes through which the message received by the current node i passes, the ratio gamma of the total number of nodes in the networkj。
Time to live margin α for each message in current node ijSpecifically, the following formula is used to obtain:
Figure BDA0002414657050000092
wherein, TTLjThe TTL value of the message j at the current time, namely the message survival time of the message j; TTL (transistor-transistor logic)OjIs the initialization time of message j, αjThe larger the message j, the more "new" the value is higher.
Ratio β of time of message received in current node i to current time of systemjSpecifically, the following formula is used to obtain:
Figure BDA0002414657050000093
wherein,
Figure BDA0002414657050000094
time of reception of message j, T, for current node inowTo simulate the system's current time, βjThe larger the current node i.
The ratio gamma of the total number of nodes of the network to the total number of nodes of the network after the total number of nodes of the network is different from the number of nodes of the message received by the current node ijSpecifically, the following formula is used to obtain:
Figure BDA0002414657050000095
wherein N is the total number of nodes in the network;
Figure BDA0002414657050000096
the number of nodes, also called hops, traversed by the current node i is reached for message j.
In some embodiments, after obtaining the respective component parameters of the load usage rate of the current node i according to the above equations (2), (3), and (4), the node message value V of the current node iiThe method specifically comprises the following steps:
Figure BDA0002414657050000101
wherein n is the number of messages in the message queue of the current node, a, b, and c are all preset adjustment factors, and a, b, c ∈ [0,1], and a + b + c ═ 1. a. The values of b and c respectively represent the influence degree of the survival time allowance, the message receiving time and the hop count on the node message value, and the values of a, b and c can be determined through simulation experiments or specific values are preset according to specific conditions.
In some embodiments, the load usage correction value of the current node i is calculated by:
Figure BDA0002414657050000102
the node message value repair positive value of the current node i is calculated by the following formula:
Figure BDA0002414657050000103
where J is the total number of communication nodes of the current node i, ηjLoad usage for communication node j, ηiFor the current node i utilization load rate, μijIs the influence factor, V, of the communication node j on the current node iiNode message value, V, for current ijThe node message value for communication node j.
In some embodiments, the message priority P of the current node i is obtained according to the load usage correction value and the node message value correction value obtained by the above equations (6) and (7)iThe calculation is carried out with particular reference to the following formula:
Figure BDA0002414657050000104
wherein, if PiIf the value of the node message of the current node i is greater than or equal to 1, the value of the node message of the current node i exceeds the use load rate carrying the messages, the current node i can be attributed to a message priority node at the moment, and a routing algorithm with high message delivery success rate can be given priority to the current node i when the routing is switched. If PiIf the current node i is less than 1, the current node i is attributed to a message lag node.
In some embodiments, according to message priority PiThe obtaining of the deviation degree of each routing algorithm of the current node i and the comparison specifically include:
according to message priority PiObtaining message payout rate requirement DR of current node id：
Figure BDA0002414657050000111
Wherein,
Figure BDA0002414657050000112
average payout rate, DR, of routing algorithm that has been implemented for current node imaxMaximum pay rate, DR, for routing algorithm that current node i has implementedminFor the minimum pay rate of the routing algorithm that the current node i has implemented,
Figure BDA0002414657050000113
DRmax、DRmincan be obtained in early-stage simulation experiments. In this embodiment, when the current node i is a message priority node, PiGreater than or equal to 1, at the moment, the message payment rate required by the current node i needs to be at
Figure BDA0002414657050000114
On the basis of amplifying PiQuilt, at the same time, needs to guarantee DRdValue of (A) does not exceed DRmaxThus DRdTaking the smaller value of the two. When the current node i is a message lag node, PiLess than 1, the current node i has low demand for message delivery success rate, so the message payment rate required by the current node i needs to be in
Figure BDA0002414657050000115
To reduce PiMultiple, simultaneous need to ensure DRdHas a value of not less than DRminThus DRdThe larger of the two is taken.
According to message priority PiObtaining a delivery delay requirement AL of a current node id：
Figure BDA0002414657050000116
Wherein,
Figure BDA0002414657050000117
average delivery delay, AL, for routing algorithm already implemented by the current node imaxFor the maximum delivery delay, AL, of a plurality of present routing algorithms that the current node i has implementedminImplemented for the current node iThe minimum delivery delay of the routing algorithm,
Figure BDA0002414657050000118
ALmax、ALminare all obtained in the previous simulation experiment. In this embodiment, when the current node i is a message priority node, PiMore than or equal to 1, when the delivery delay requirement AL required by the current node i is neededdNeed to be in
Figure BDA0002414657050000119
On the basis of amplifying PiMultiple, simultaneous need to ensure ALdValue of (A) does not exceed ALmaxThus ALdThe smaller of the two values is taken as the value of (c). When the current node i is a message lag node, PiLess than 1, when the delivery delay requirement AL required by the current node idNeed to be in
Figure BDA00024146570500001110
To reduce PiMultiple, simultaneous need to ensure ALdHas a value of not less than ALminThus ALdThe greater of the two.
In this embodiment, the message payment rate requirement DR of the current node i is obtaineddAnd delivery latency requirement ALdDegree of deviation for each routing algorithm
Figure BDA0002414657050000121
Specifically, the calculation is as follows:
Figure BDA0002414657050000122
wherein,
Figure BDA0002414657050000123
to the extent that the message payout rate of the routing algorithm k in the current node i deviates from the message payout rate requirement of the current node i,
Figure BDA0002414657050000124
for routing in the current node iSpecifically, the routing algorithm k includes the Epidemic algorithm, the spread and Wait algorithm, and the Prophet algorithm, where p and q are preset specific numerical values, and the deviation degree of each routing algorithm is calculated by using the deviation degree of the delivery delay of the algorithm k and the message delivery delay requirement of the current node i, where p is a message payment rate score influence factor, and q is a message delivery delay score influence factor
Figure BDA0002414657050000125
After calculation, the deviation degree can be obtained by comparison
Figure BDA0002414657050000126
The smallest routing algorithm.
Obtaining the degree of deviation by the above
Figure BDA0002414657050000127
After the routing algorithm with the minimum value, the routing algorithm of the current node i is switched to the deviation degree
Figure BDA0002414657050000128
The method solves the technical problem that the mobile relay node cannot reasonably utilize the cache resource of the node and the routing performance of the DTN is poor due to the fact that only a single routing algorithm can be adopted in the operation process of the DTN in the prior art, and provides the DTN routing dynamic switching method which can adapt to the node state and improve the transmission performance.
An embodiment of the present invention further provides a DTN route dynamic switching device, including:
at least one processor, and a memory communicatively coupled to the at least one processor;
wherein the processor is configured to execute the DTN route dynamic switching method according to the above embodiment by calling a computer program stored in the memory. The computer program is a program code, and when the program code runs on the dynamic DTN route switching device, the program code is configured to enable the dynamic DTN route switching device to execute the steps in the dynamic DTN route switching method described in the above-mentioned embodiment of this specification.
In addition, an embodiment of the present invention further provides a computer-readable storage medium, where the computer-readable storage medium stores computer-executable instructions, where the computer-executable instructions are configured to cause a computer to execute the dynamic DTN route switching method described in the foregoing embodiment.
The embodiments of the present invention have been described in detail with reference to the accompanying drawings, but the present invention is not limited to the above embodiments, and various changes can be made within the knowledge of those skilled in the art without departing from the gist of the present invention. Furthermore, the embodiments of the present invention and the features of the embodiments may be combined with each other without conflict.

Claims (10)

1. A DTN route dynamic switching method is characterized by comprising the following steps:
acquiring a mutual influence factor of a current node and acquiring the load utilization rate of the current node;
obtaining the node message value of the current node according to the load utilization rate;
obtaining a load utilization rate correction value of the current node according to the interaction factor and the load utilization rate, and obtaining a node message value correction value of the current node according to the interaction factor and the node message value;
obtaining the message priority of the current node according to the load utilization rate correction value and the node message value correction value;
obtaining the deviation degree of each routing algorithm of the current node according to the message priority and comparing the deviation degrees;
and switching the routing algorithm of the current node to the routing algorithm with the minimum deviation degree.
2. The DTN route dynamic switching method of claim 1, wherein the obtaining the interaction factor of the current node specifically comprises:
determining a routing algorithm that the current node has implemented;
counting the message forwarding number using the routing algorithm, and acquiring the communication time interval between the current node and the communication node; the communication node is a node which transmits messages with the current node by adopting the routing algorithm;
processing the message forwarding number and the communication time interval by adopting linear regression to obtain a message attenuation coefficient of the current node;
the interaction factor is determined by:
Figure FDA0002414657040000011
wherein, muijFor the interaction factor, r is the message attenuation coefficient, Δ TijIs a communication time interval.
3. The DTN routing dynamic switching method of claim 2, wherein the routing algorithm comprises one or more of:
epidemic algorithm, Spray and Wait algorithm, Prophet algorithm.
4. The DTN route dynamic switching method of claim 2 or 3, wherein the load usage comprises:
the remaining life time of each message in the current node specifically includes:
Figure FDA0002414657040000012
wherein, αjTTL being said time-to-live margin for message jjTTL value of message j at current timeOjIs the initialization time of message j;
the ratio of the message receiving time in the current node to the current time of the system is specifically:
Figure FDA0002414657040000021
wherein, βjIs the ratio of the time of receiving the message to the current time of the system,
Figure FDA0002414657040000022
time of reception of message j, T, for said current nodenowThe current system time of the simulation system;
the ratio of the total number of network nodes to the total number of network nodes after the total number of network nodes is different from the number of nodes through which the message received by the current node passes is specifically as follows:
Figure FDA0002414657040000023
wherein, γjThe ratio of the total number of nodes of the network to the total number of nodes of the network after the total number of nodes of the network is subtracted from the number of nodes of the message j received by the current node, N is the total number of nodes of the network,
Figure FDA0002414657040000024
and the number of nodes passed by the current node is reached for the message j.
5. The DTN routing dynamic switching method of claim 4, wherein the node message value is obtained according to the following formula:
Figure FDA0002414657040000025
wherein, ViIs the node message value of the current node, n is the number of messages in the message queue of the current node, a, b and c are all preset adjustment factors, and a, b and c ∈ [0,1]，a+b+c＝1。
6. The DTN routing dynamic switching method of claim 5, wherein the load usage correction value is obtained according to the following formula:
Figure FDA0002414657040000026
the node message value correction value is specifically obtained according to the following formula:
Figure FDA0002414657040000027
wherein,
Figure FDA0002414657040000031
j is the total number of communication nodes of the current node, η, as the load usage correction valuejLoad usage for the communication node, ηiFor the utilization load rate of the current node, muijAn impact factor of the communication node on the current node,
Figure FDA0002414657040000032
for value correction of said node message, ViA node message value, V, for the current nodejA node message value for the communication node.
7. The DTN route dynamic switching method of claim 6, wherein the message priority is specifically obtained by the following formula:
Figure FDA0002414657040000033
wherein, PiIs the message priority of the current node,
Figure FDA0002414657040000034
for the load usage correction value or values,
Figure FDA0002414657040000035
and the value of the node message is corrected.
8. The DTN routing dynamic switching method of claim 7, wherein the obtaining the deviation degree of each routing algorithm of the current node according to the message priority and comparing specifically comprises:
calculating the message payment rate requirement of the current node:
Figure FDA0002414657040000036
wherein, DRdPaying a rate requirement for the message of the current node,
Figure FDA0002414657040000037
average payout rate, DR, of routing algorithm already implemented for the current nodemaxMaximum payment rate, DR, for the routing algorithm that the current node has implementedminA minimum payment rate for a routing algorithm that has been implemented for the current node;
calculating the delivery delay requirement of the current node:
Figure FDA0002414657040000038
wherein, ALdFor the delivery latency requirements of the current node,
Figure FDA0002414657040000039
average delivery delay, AL, for routing algorithm already implemented by the current nodemaxMaximum delivery delay, AL, for routing algorithm already implemented by the current nodeminMinimum delivery delay for the routing algorithm already implemented for the current node;
calculating the deviation degree of each routing algorithm:
Figure FDA00024146570400000310
wherein,
Figure FDA0002414657040000041
for the degree of deviation of the respective routing algorithms of the current node,
Figure FDA0002414657040000042
the deviation degree of the message payment rate of the routing algorithm k in the current node and the message payment rate requirement of the current node,
Figure FDA0002414657040000043
and p is a message payment rate grading influence factor, and q is a message delivery delay grading influence factor, wherein p is the deviation degree of the delivery delay of the routing algorithm k in the current node and the message delivery delay requirement of the current node.
9. A DTN route dynamic switching device, comprising:
at least one processor, and a memory communicatively coupled to the at least one processor;
wherein the at least one processor is configured to perform the method of any one of claims 1 to 8 by invoking a computer program stored in the memory.
10. A computer-readable storage medium having stored thereon computer-executable instructions for causing a computer to perform the method of any one of claims 1 to 8.
CN202010187323.1A 2020-03-17 2020-03-17 DTN route dynamic switching method, device and storage medium Pending CN111526088A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010187323.1A CN111526088A (en) 2020-03-17 2020-03-17 DTN route dynamic switching method, device and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010187323.1A CN111526088A (en) 2020-03-17 2020-03-17 DTN route dynamic switching method, device and storage medium

Publications (1)

Publication Number Publication Date
CN111526088A true CN111526088A (en) 2020-08-11

Family

ID=71902241

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010187323.1A Pending CN111526088A (en) 2020-03-17 2020-03-17 DTN route dynamic switching method, device and storage medium

Country Status (1)

Country Link
CN (1) CN111526088A (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104363626A (en) * 2014-11-07 2015-02-18 中国人民武装警察部队工程大学 Bayesian theory based credible routing method for VANET (vehicular ad-hoc network)
CN107171957A (en) * 2017-04-27 2017-09-15 南京大学 A kind of adaptive DTN routing algorithms based under the conditions of resource-constrained
CN108989218A (en) * 2018-07-11 2018-12-11 中国人民解放军陆军工程大学 Data forwarding device and method based on network convergence architecture
WO2018232096A1 (en) * 2017-06-14 2018-12-20 EMULATE, Inc. Effects of space travel on human brain cells

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104363626A (en) * 2014-11-07 2015-02-18 中国人民武装警察部队工程大学 Bayesian theory based credible routing method for VANET (vehicular ad-hoc network)
CN107171957A (en) * 2017-04-27 2017-09-15 南京大学 A kind of adaptive DTN routing algorithms based under the conditions of resource-constrained
WO2018232096A1 (en) * 2017-06-14 2018-12-20 EMULATE, Inc. Effects of space travel on human brain cells
CN108989218A (en) * 2018-07-11 2018-12-11 中国人民解放军陆军工程大学 Data forwarding device and method based on network convergence architecture

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
汪浩: "《面向移动中继的DTN路由动态切换算法研究》", 《中国优秀硕士学位论文全文数据库》 *

Similar Documents

Publication Publication Date Title
US8797913B2 (en) Reduction of message and computational overhead in networks
KR101183342B1 (en) Route selection in wireless networks
KR20150063107A (en) Link adaptation for a multi-hop route in a wireless mesh network
JP2022505424A (en) Packet processing method and equipment
US20120177036A1 (en) Simple fairness protocols for daisy chain interconnects
US8149694B2 (en) Enforcing fairness in ad hoc mesh networks
WO2022218516A1 (en) Devices and methods for collaborative learning of a transmission policy in wireless networks
CN115914078A (en) Message forwarding method and device and dragonfly network
CN109922161B (en) Content distribution method, system, device and medium for dynamic cloud content distribution network
Jawhar et al. A race-free bandwidth reservation protocol for QoS routing in mobile ad hoc networks
CN111526088A (en) DTN route dynamic switching method, device and storage medium
CN116599887A (en) Routing method based on dragonfly network, electronic equipment and medium
CN108462634B (en) Opportunistic social network message transmission method based on fairness
CN106992930B (en) A kind of opportunistic network routing method based on approach frequency
CN111464444B (en) Sensitive information distribution method
JP2933905B1 (en) Multicast communication system
CN108429678A (en) A kind of EER Routing Protocols contacting information and TTL based on history
CN110392394B (en) MPTCP scheduling method based on link state information in wireless network
US10432502B2 (en) Method and apparatus for overlap-resistant dynamic routing
Sreekanth et al. Performance improvement of DTN routing protocols with enhanced buffer management policy
Zhong et al. Research and Implementation of AOMDV Multipath Routing Protocol
Kou et al. Multipath routing with erasure coding in underwater delay tolerant sensor networks
CN105407047B (en) Opportunistic network data distributing method based on centrad and opportunistic network system
CA3137848C (en) Systems and methods for computing a sustainable rate for broadcast traffic in a network
Ziane et al. Inductive routing based on dynamic end-to-end delay for mobile 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
RJ01 Rejection of invention patent application after publication

Application publication date: 20200811

RJ01 Rejection of invention patent application after publication