CN106211259B - A routing implementation method and implementation device for a delay-tolerant network - Google Patents

Abstract

The present invention relates to the route implementation methods and realization device of a kind of time delay tolerant network, the energy of message forwarding consumption, the energy that node reception message consumes and the energy for monitoring neighbor node consumption are carried out by the primary power of the time delay tolerant network interior joint, the node, determines the dump energy of the node；It within the preset update cycle, records in the time delay tolerant network and to meet intervening sequence between two nodes to obtain history and meet interval, and history interval of meeting is updated；It is met the value of utility of node described in interval calculation according to the dump energy of the node and the history；According to the value of utility of the node, Xiang Suoshu node forwards message.The route implementation method and realization device of a kind of time delay tolerant network provided by the invention can carry out the forwarding of message according to the energy service condition of relay node to improve capacity usage ratio.

Description

A routing implementation method and implementation device for a delay-tolerant network

technical field

The present invention belongs to the technical field of Delay Tolerant Networks (English: Delay Tolerant Networks, abbreviation: DTN), and relates to a route implementation method and implementation device of a delay tolerant network.

Background technique

The node movement in DTN is random, and the network topology changes dynamically with the node movement and the network resources are limited. In order to ensure the reliability of data transmission, the existing routing mechanisms are implemented in the way of "multiple backup + control", and nodes select appropriate relay nodes and forwarding opportunities according to the current network state. Under the DTN architecture, in order to improve the reliability of data delivery, the node needs to continuously monitor the surrounding environment through the wireless interface in order to find its neighbor nodes during the movement process. A large amount of node energy will be consumed by these related operation processes. Leaving the network will cause a brief split of the network, resulting in reduced network connectivity and a sharp drop in performance.

The information disclosed in this Background section is only for enhancement of understanding of the general background of the invention and should not be taken as an acknowledgement or any form of suggestion that this information forms the prior art already known to a person of ordinary skill in the art.

SUMMARY OF THE INVENTION

technical problem

In view of this, the technical problem to be solved by the present invention is how to provide a routing implementation method and implementation device for a delay tolerant network, which can reasonably solve the problem of insufficient utilization of node energy in a DTN network.

solution

In order to solve the above technical problems, the present invention provides a routing implementation method of a delay tolerant network in a first aspect, including:

Determine the remaining energy of the node according to the initial energy of the node in the delay-tolerant network, the energy consumed by the node to forward messages, the energy consumed by the node to receive messages, and the energy consumed by monitoring neighbor nodes;

In a preset update period, record the encounter interval sequence between the two nodes in the delay-tolerant network to obtain a historical encounter interval, and update the historical encounter interval;

Calculate the utility value of the node according to the remaining energy of the node and the historical encounter interval;

The message is forwarded to the node according to the utility value of the node.

In a possible implementation manner, the initial energy of the node in the delay-tolerant network, the energy consumed by the node to forward messages, the energy consumed by the node to receive messages, and the energy consumed by monitoring neighbor nodes, determine the The remaining energy of the above node includes:

The residual energy of the node is determined according to the first formula and the second formula, and the first formula is: The second formula is:

Among them, E _t is the energy consumed by the node to perform message forwarding, _Er is the energy consumed by the node to receive messages, E _l is the energy consumed by the monitoring neighbor node, and e _t is the energy required by the node to forward unit bytes energy consumption, _er is the energy consumption required by the node to receive a unit of bytes, e _l is the energy consumption required by the node to monitor neighbor nodes per unit time, S _i is the size of the message, Δt is the listening time, m is the number of forwarded messages, and n is The number of received messages, d _i (1<<i<<n) is a node in the delay-tolerant network, is the total energy consumption of node d _i , E _i is the remaining energy of node d _i , is the initial energy of node _di .

In a possible implementation manner, within a preset update period, record the encounter interval sequence between the two nodes in the delay-tolerant network to obtain a historical encounter interval, and perform an analysis on the historical encounter interval. Updates, including:

According to the third formula, the historical encounter interval is updated,

The third formula is ET _(a,b) =α·Ival+(1-α)·ET _(a,b)old ,

Among them, ET _{(a, b)} is the historical encounter interval between the node d _a and the node d _b , and is set as the update period T when the first encounter occurs, and x _i =CT ₂ -CT ₁ is the single encounter interval, where CT ₁ , CT ₂ is the last disconnection time and meeting time of node d _a and node d _b respectively. In the update period T, node d _a records all the encounter interval sequence with node d _b , and the historical encounter interval where m is the number of encounters in the period T.

In a possible implementation manner, within a preset update period, record the encounter interval sequence between the two nodes in the delay-tolerant network to obtain a historical encounter interval, and perform an analysis on the historical encounter interval. Updates, including:

According to the fourth formula, the historical encounter interval is updated,

The fourth formula is

where β∈(0,1).

In a possible implementation manner, calculating the utility value of the node according to the remaining energy of the node and the historical encounter interval, including:

The utility value of the node is calculated according to the fifth formula, and the fifth formula is

where γ∈(0,1) is the weight factor, ET _(i,d) /T∈(0,1],

In order to solve the above technical problems, the present invention provides, in a second aspect, a routing implementation device for a delay-tolerant network, including:

A determination module, configured to determine the remaining energy of the node through the initial energy of the node in the delay-tolerant network, the energy consumed by the node to forward messages, the energy consumed by the node to receive messages, and the energy consumed by monitoring neighbor nodes energy;

An update module, used for recording the encounter interval sequence between the two described nodes in the time delay tolerant network to obtain a historical encounter interval within a preset renewal period, and to update the historical encounter interval;

a calculation module for calculating the utility value of the node according to the remaining energy of the node and the historical encounter interval;

A forwarding module, configured to forward a message to the node according to the utility value of the node.

In a possible implementation manner, the determining module is used for:

The residual energy of the node is determined according to the first formula and the second formula, and the first formula is: The second formula is:

Among them, E _t is the energy consumed by the node to perform message forwarding, _Er is the energy consumed by the node to receive messages, E _l is the energy consumed by the monitoring neighbor node, and e _t is the energy required by the node to forward unit bytes energy consumption, _er is the energy consumption required by the node to receive a unit of bytes, e _l is the energy consumption required by the node to monitor neighbor nodes per unit time, S _i is the size of the message, Δt is the listening time, m is the number of forwarded messages, and n is The number of received messages, d _i (1<<i<<n) is a node in the delay-tolerant network, is the total energy consumption of node d _i , E _i is the remaining energy of node d _i , is the initial energy of node _di .

In a possible implementation, the update module is used to:

According to the third formula, the historical encounter interval is updated,

The third formula is ET _(a,b) =α·Ival+(1-α)·ET _(a,b)old ,

Among them, ET _{(a, b)} is the historical encounter interval between the node d _a and the node d _b , and is set as the update period T when the first encounter occurs, and x _i =CT ₂ -CT ₁ is the single encounter interval, where CT ₁ , CT ₂ is the last disconnection time and meeting time of node d _a and node d _b respectively. In the update period T, node d _a records all the encounter interval sequence with node d _b , and the historical encounter interval where m is the number of encounters in the period T.

In a possible implementation manner, the update module is also used for:

According to the fourth formula, the historical encounter interval is updated,

The fourth formula is

where β∈(0,1).

In a possible implementation, the computing module is used for:

The utility value of the node is calculated according to the fifth formula, and the fifth formula is

where γ∈(0,1) is the weight factor, ET _(i,d) /T∈(0,1],

beneficial effect

The present invention provides a routing implementation method and implementation device for a delay-tolerant network, through the initial energy of a node in the delay-tolerant network, the energy consumed by the node for message forwarding, the energy consumed by the node to receive messages, and Monitor the energy consumed by the neighbor nodes, and determine the remaining energy of the node; in the preset update period, record the encounter interval sequence between the two nodes in the delay-tolerant network to obtain the historical encounter interval, and compare the The historical encounter interval is updated; the utility value of the node is calculated according to the remaining energy of the node and the historical encounter interval; according to the utility value of the node, the message is forwarded to the node, which can be based on the relay node's utility value. Energy usage is used to forward messages to improve energy utilization. The social relationship between nodes can be measured through the historical encounter interval, which can better grasp the social nature of nodes. The node utility value is used as a direct judgment for message forwarding. According to the data, the message can be carried along the direction of the destination node, providing new technical support for the energy-constrained network.

Other features and aspects of the present invention will become apparent from the following detailed description of exemplary embodiments with reference to the accompanying drawings.

Description of drawings

The accompanying drawings, which are incorporated in and constitute a part of the specification, illustrate exemplary embodiments, features and aspects of the invention and together with the description, serve to explain the principles of the invention.

1 shows a flowchart of a method for implementing routing in a delay-tolerant network provided by an embodiment of the present invention;

Fig. 2 shows a delay tolerant network message forwarding model diagram;

Fig. 3 shows the network topology schematic diagram based on social relations;

Fig. 4 shows the flow chart of updating single-hop historical encounter interval time;

5 shows a flowchart of a method for implementing routing in a delay-tolerant network provided by another embodiment of the present invention;

FIG. 6 shows a schematic structural diagram of an apparatus for implementing routing in a delay tolerant network according to an embodiment of the present invention.

Detailed ways

The specific embodiments of the present invention will be described in detail below with reference to the accompanying drawings, but it should be understood that the protection scope of the present invention is not limited by the specific embodiments.

In order to make the purposes, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments These are some embodiments of the present invention, but not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present invention. Unless expressly stated otherwise, throughout the specification and claims, the term "comprising" or its conjugations such as "comprising" or "comprising" and the like will be understood to include the stated elements or components, and Other elements or other components are not excluded.

The word "exemplary" is used exclusively herein to mean "serving as an example, embodiment, or illustration." Any embodiment described herein as "exemplary" is not necessarily to be construed as preferred or advantageous over other embodiments.

In addition, in order to better illustrate the present invention, numerous specific details are given in the following detailed description. It will be understood by those skilled in the art that the present invention may be practiced without certain specific details. In some instances, methods, means and elements well known to those skilled in the art have not been described in detail so as to highlight the subject matter of the present invention.

Example 1

FIG. 1 shows a flowchart of a method for implementing routing in a delay-tolerant network provided by an embodiment of the present invention. As shown in the figure, the method includes:

Step S1: Determine the remaining energy of the node according to the initial energy of the node in the delay-tolerant network, the energy consumed by the node to forward messages, the energy consumed by the node to receive messages, and the energy consumed by monitoring neighbor nodes.

In a possible implementation, this step may include:

The energy consumption of the node mainly concentrates on three aspects: message forwarding E _t , message receiving E _r and channel monitoring E ₁ . The energy consumption of message forwarding mainly describes the energy consumed by a node to forward the messages carried by the nodes it encounters. Usually, the more messages a node forwards, the more energy it consumes. The energy consumption of node reception is similar to that of forwarding. Channel monitoring energy consumption refers to the energy consumed when performing channel scanning for sensing neighbor nodes. The three types of energy consumption can be represented by Equation (1):

where e _t is the energy consumption required by the node to forward a unit byte, _er is the energy consumption required by the node to receive a unit byte, and e _l is the energy consumption required by the node to monitor neighbor nodes per unit time. S _i is the size of the message, Δt is the listening time, m is the number of forwarded messages, and n is the number of received messages.

D={d ₁ , d ₂ , . . . , d _n } represents the nodes in the DTN network, and d _i (1<<i<<n) represents one of the nodes. The total energy consumption of node d _i And the current remaining energy E _i can be expressed by formula (2), where is the initial energy of node _di .

Step S2, within a preset update period, record the encounter interval sequence between the two nodes in the delay-tolerant network to obtain a historical encounter interval, and update the historical encounter interval.

d _a , d _b , d _d (1≤a,b,d≤n) are the three nodes in the DTN network. ET _{(a, b)} is the historical encounter interval between node _{d a} and node db between multiple update cycles, and is set to update cycle T when they meet for the first time. x _i =CT ₂ -CT ₁ is a single encounter interval, wherein CT ₁ and CT ₂ are the last disconnection time and the encounter time of the node d _a and the node d _b , respectively. In each update period T, node _{d a} records all the encounter interval sequences with node db, and each encounter interval sequence has the same status, so the average historical encounter interval in a period T is where m is the number of encounters in the period T. The update of the historical encounter interval is shown in formula (3), where α∈(0,1) will make the value of the historical encounter interval approach the most recently observed data.

ET _(a,b) =α·Ival+(1-α)·ET _(a,b)old (3)

If the node d _a and the node d _b do not meet in the period T, then Ival=T, and continue to update the historical encounter interval with formula (3) until ET _{(a, b)} =T, even if they do not meet, they are not updated.

The multi-hop historical encounter interval can be updated with Equation (4), where β∈(0,1) represents the effect of transitivity on the encounter interval.

Step S3: Calculate the utility value of the node according to the remaining energy of the node and the historical encounter interval.

The energy of the node and the historical encounter interval have an important influence on the utility value of the node. The utility value of the node d _i and the node d _d is expressed by formula (5), where γ∈(0,1) is the weight factor, ET _{(i,d )} /T∈(0,1];

Step S4: Forward the message according to the utility value of the node.

Specifically, after two nodes meet, the nodes will record the historical encounter interval sequence and exchange their utility values for other nodes. The utility value of a node increases due to frequent encounters between nodes. All messages enter the send queue on a first-in, first-out basis. When the node d _a meets the relay node d _b , the node d _a has a message passed to the node d _d , and the node d _a will use the utility value to judge whether to forward the message to the node d _b , if U _{(a, d)} < U _(b,d) , node d _a will forward the message to node _db . For a message sent repeatedly in a node, if ∑U _(i,d) ≥ 1, the node will delete the message. where ∑U _(i,d) represents the sum of the utility values of the nodes that have received this message. This controls the number of copies of messages in the network.

The present invention provides a routing implementation method and implementation device for a delay-tolerant network, through the initial energy of a node in the delay-tolerant network, the energy consumed by the node for message forwarding, the energy consumed by the node to receive messages, and Monitor the energy consumed by the neighbor nodes, and determine the remaining energy of the node; in the preset update period, record the encounter interval sequence between the two nodes in the delay-tolerant network to obtain the historical encounter interval, and compare the The historical encounter interval is updated; the utility value of the node is calculated according to the remaining energy of the node and the historical encounter interval; according to the utility value of the node, the message is forwarded to the node, which can be based on the relay node's utility value. Energy usage is used to forward messages to improve energy utilization. The social relationship between nodes can be measured through the historical encounter interval, which can better grasp the social nature of nodes. The node utility value is used as a direct judgment for message forwarding. According to the data, the message can be carried along the direction of the destination node, providing new technical support for the energy-constrained network.

Application example

In order to make the objectives, technical solutions and beneficial effects of the present invention clearer, the present invention provides this application example for description.

Figure 2 shows a model diagram of a delay-tolerant network message forwarding. As shown in Figure 2, there are four nodes S, R, L, and P in the network, and each node moves independently. Node S generates a message destined for node P. At this time, node S has no available connection. When node S enters the communication range of node R, it will forward the information to node R according to certain routing rules, and then node R will will carry the message to move. Similarly, when node R and node L are in contact, R will send a message to L until L meets the destination node P, and one delivery is completed. In the forwarding process, whether the node keeps the information or deletes the information after forwarding the message depends on the specific routing protocol.

Figure 3 shows a schematic diagram of the network topology based on social relations. As shown in Figure 3, the network based on social relations is composed of many independent communities. The connections between nodes between different communities are less or even discontinuous. The nodes are closely connected. In order to facilitate understanding, taking human society as an image metaphor, the social attributes of human beings determine that human beings always communicate with familiar friends, relatives and colleagues in a specific environment, thus forming a specific community, the people in the community. A node that constitutes a community. Some people in this community are active relative to others in the community, such as postmen, taxis, etc. They are the medium for communicating this community and other communities. In a community, the social division of labor of different people is different, but members of the same community are in frequent contact, that is to say, the interval between them is relatively short. The encounter time interval can be used to represent the degree of intimacy between nodes. The smaller the historical encounter time interval, the closer the nodes are, and the nodes are more willing to forward messages to close people.

Figure 4 shows a flow chart of updating the single-hop historical encounter interval time. As shown in Figure 4, according to the historical encounter interval between nodes, the degree of intimacy between them is judged, and the message is forwarded to the node closer to the destination node. Send in the direction close to the destination node. d _a , d _b , d _d (1≤a,b,d≤n) are the three nodes in the DTN network. ET _{(a, b)} is the historical encounter interval between node d _a and node d _b , and it is set as the update period T when the first encounter occurs. x _i =CT ₂ -CT ₁ is a single encounter interval, wherein CT ₁ and CT ₂ are the last disconnection time and the encounter time of the node d _a and the node d _b , respectively. In the update period T, the node d _a records all the encounter interval sequences with the node d _b , and each encounter interval sequence has the same status, so the historical encounter interval where m is the number of encounters in the period T. The update of the historical encounter interval is shown in formula (3), where α∈(0,1) will make the value of the historical encounter interval approach the most recently observed data.

ET _(a,b) =α·Ival+(1-α)·ET _(a,b)old (3)

If the node d _a and the node d _b do not meet in the period T, then Ival=T, and continue to update the historical encounter interval with formula (3) until ET _{(a, b)} =T, even if they do not meet, they are not updated.

The multi-hop historical encounter interval can be updated with Equation (4), where β∈(0,1) represents the effect of transitivity on the encounter interval.

FIG. 5 shows a flowchart of a method for implementing routing in a delay-tolerant network provided by another embodiment of the present invention. The node d _a is taken as an example for description, and the specific processing steps are as follows:

1) The energy of node d _a is continuously consumed by message receiving, forwarding and monitoring neighbor nodes. If the energy is exhausted, the node will leave the network.

2) When the node d _a meets the relay node d _b , the node d _a will record the historical encounter interval sequence, and exchange the utility value of each other to other nodes.

3) All messages in node d _α enter the message sending queue according to the principle of first-in, first-out.

4) If the destination node of the message to be sent is _db , the node da forwards the message to _db , _deletes the message from the cache queue, and deletes the message in the sending queue at the same time.

5) If the destination node of the message to be sent is d _d , node d _a will use the utility value to determine whether to forward the message to node d _b , if U _(a,d) <U _(b,d) , node d _a will Forward the message to node _db and delete the message from the message sending queue.

6) For the message sent repeatedly in the node d _a , if ∑U _{(i, d)} ≥ 1, the node will delete the message from the cache. where ∑U _(i,d) represents the sum of the utility values of the nodes that have received this message. This controls the number of copies of messages in the network.

The present invention provides a routing implementation method and implementation device for a delay-tolerant network, through the initial energy of a node in the delay-tolerant network, the energy consumed by the node for message forwarding, the energy consumed by the node to receive messages, and Monitor the energy consumed by the neighbor nodes, and determine the remaining energy of the node; in the preset update period, record the encounter interval sequence between the two nodes in the delay-tolerant network to obtain the historical encounter interval, and compare the The historical encounter interval is updated; the utility value of the node is calculated according to the remaining energy of the node and the historical encounter interval; according to the utility value of the node, the message is forwarded to the node, which can be based on the relay node's utility value. Energy usage is used to forward messages to improve energy utilization. The social relationship between nodes can be measured through the historical encounter interval, which can better grasp the social nature of nodes. The node utility value is used as a direct judgment for message forwarding. According to the data, the message can be carried along the direction of the destination node, providing new technical support for the energy-constrained network.

Example 2

FIG. 6 shows an apparatus for implementing routing of a delay tolerant network provided by an embodiment of the present invention. As shown in FIG. 6 , the apparatus 10 includes: a determination module 110 , an update module 120 , a calculation module 130 , and a forwarding module 140 .

The determining module 110 is configured to determine the initial energy of the node in the delay-tolerant network, the energy consumed by the node to forward messages, the energy consumed by the node to receive messages, and the energy consumed by monitoring neighbor nodes, to determine the energy consumption of the node. remaining energy. The update module 120 is configured to record the encounter interval sequence between the two nodes in the delay tolerant network to obtain a historical encounter interval within a preset update period, and update the historical encounter interval. The calculation module 130 is configured to calculate the utility value of the node according to the remaining energy of the node and the historical encounter interval. The forwarding module 140 is configured to forward a message to the node according to the utility value of the node.

In a possible implementation, the determining module 110 is used to:

The residual energy of the node is determined according to the first formula and the second formula, and the first formula is: The second formula is:

Among them, E _t is the energy consumed by the node to perform message forwarding, _Er is the energy consumed by the node to receive messages, E _l is the energy consumed by the monitoring neighbor node, and e _t is the energy required by the node to forward unit bytes energy consumption, _er is the energy consumption required by the node to receive a unit of bytes, e _l is the energy consumption required by the node to monitor neighbor nodes per unit time, S _i is the size of the message, Δt is the listening time, m is the number of forwarded messages, and n is The number of received messages, d _i (1<<i<<n) is a node in the delay-tolerant network, is the total energy consumption of node d _i , E _i is the remaining energy of node d _i , is the initial energy of node _di . The specific implementation steps are similar to the step S1 in Embodiment 1, and are not repeated here.

In a possible implementation manner, the update module 120 is configured to: update the historical encounter interval according to a third formula, where the third formula is ET _(a,b) =α·Ival+(1-α) ET _(a,b)old ,

Among them, ET _{(a, b)} is the historical encounter interval between the node d _a and the node d _b , and is set as the update period T when the first encounter occurs, and x _i =CT ₂ -CT ₁ is the single encounter interval, where CT ₁ , CT ₂ is the last disconnection time and meeting time of node d _a and node d _b respectively. In the update period T, node d _a records all the encounter interval sequence with node d _b , and the historical encounter interval where m is the number of encounters in the period T.

In a possible implementation manner, the updating module 120 is further configured to: update the historical encounter interval according to a fourth formula, where the fourth formula is: where β∈(0,1). The specific implementation steps are similar to those of step S2 in Embodiment 1, and are not repeated here.

In a possible implementation manner, the calculation module 130 is configured to: calculate the utility value of the node according to a fifth formula, where the fifth formula is:

where γ∈(0,1) is the weight factor, ET _(i,d) /T∈(0,1], The specific implementation steps are similar to those of step S3 in Embodiment 1, and are not repeated here.

The present invention provides a routing implementation device for a delay-tolerant network, which uses the initial energy of a node in the delay-tolerant network, the energy consumed by the node to forward messages, the energy consumed by the node to receive messages, and the monitoring of neighbor nodes. The energy consumed is to determine the remaining energy of the node; in the preset update period, the encounter interval sequence between the two nodes in the delay-tolerant network is recorded to obtain the historical encounter interval, and the historical encounter interval is recorded. The encounter interval is updated; the utility value of the node is calculated according to the remaining energy of the node and the historical encounter interval; according to the utility value of the node, the message is forwarded to the node, which can be based on the energy usage of the relay node. Forwarding messages to improve energy utilization, measuring the closeness of the social relationship between nodes through the historical encounter interval time, can better grasp the social nature of nodes, and using node utility value as a direct criterion for message forwarding, can Make the message go along the direction of the destination node, and provide new technical support for the energy-constrained network.

The foregoing descriptions of specific exemplary embodiments of the present invention have been presented for purposes of illustration and description. These descriptions are not intended to limit the invention to the precise form disclosed, and obviously many changes and modifications are possible in light of the above teachings. The exemplary embodiments were chosen and described for the purpose of explaining certain principles of the invention and their practical applications, to thereby enable one skilled in the art to make and utilize various exemplary embodiments and various different aspects of the invention. Choose and change. The scope of the invention is intended to be defined by the claims and their equivalents.

The device embodiments described above are only illustrative, wherein the units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in One place, or it can be distributed over multiple network elements. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution in this embodiment. Those of ordinary skill in the art can understand and implement it without creative effort.

Claims (6)

1. a routing implementation method of a delay tolerant network is characterized in that, comprising: Determine the remaining energy of the node according to the initial energy of the node in the delay-tolerant network, the energy consumed by the node to forward messages, the energy consumed by the node to receive messages, and the energy consumed by monitoring neighbor nodes; In a preset update period, record the encounter interval sequence between the two nodes in the delay-tolerant network to obtain a historical encounter interval, and update the historical encounter interval; Calculate the utility value of the node according to the remaining energy of the node and the historical encounter interval; forwarding a message to the node according to the utility value of the node; Described in the preset update period, recording the encounter interval sequence between the two nodes in the delay-tolerant network to obtain a historical encounter interval, and updating the historical encounter interval, including: According to the third formula, the historical encounter interval is updated, The third formula is ET _(a,b) =α·Ival+(1-α)·ET _(a,b)old , Among them, ET _{(a, b)} is the historical encounter interval between the node d _a and the node d _b , and is set as the update period T when the first encounter occurs, and x _i =CT ₂ -CT ₁ is the single encounter interval, where CT ₁ , CT ₂ is the last disconnection time and meeting time of node d _a and node d _b respectively. In the update period T, node d _a records all the encounter interval sequence with node d _b , and the historical encounter interval where m is the number of encounters in the period T, α∈(0,1); When the historical encounter interval is a multi-hop historical encounter interval, according to the fourth formula, the historical encounter interval is updated, The fourth formula is Among them, β is the effect of transitivity on the encounter interval, β∈(0,1). 2 . The routing implementation method according to claim 1 , wherein the initial energy of the node in the delay-tolerant network, the energy consumed by the node for message forwarding, the energy consumed by the node to receive messages, and the monitoring of The energy consumed by neighbor nodes, and determining the remaining energy of the node includes: The residual energy of the node is determined according to the first formula and the second formula, and the first formula is: The second formula is: Among them, E _t is the energy consumed by the node to perform message forwarding, _Er is the energy consumed by the node to receive messages, E _l is the energy consumed by the monitoring neighbor node, and e _t is the energy required by the node to forward unit bytes energy consumption, _er is the energy consumption required by the node to receive a unit of bytes, e _l is the energy consumption required by the node to monitor neighbor nodes per unit time, S _i is the size of the message, Δt is the listening time, m is the number of forwarded messages, and n is The number of received messages, d _i is a node in the delay-tolerant network, 1≤i≤k, k is the number of nodes in the DTN network, is the total energy consumption of node d _i , E _i is the remaining energy of node d _i , is the initial energy of node _di . 3. The routing implementation method according to claim 1, wherein calculating the utility value of the node according to the remaining energy of the node and the historical encounter interval, comprising: The utility value of the node is calculated according to the fifth formula, and the fifth formula is where γ∈(0,1) is the weight factor, ET _(i,d) /T∈(0,1], E _i is the residual energy of node d _i , is the initial energy of the node d _i , d _i is a node in the delay tolerant network, 1≤i≤k, k is the number of nodes in the DTN network. 4. A routing implementation device for a delay-tolerant network, characterized in that, comprising: A determination module, configured to determine the remaining energy of the node through the initial energy of the node in the delay-tolerant network, the energy consumed by the node to forward messages, the energy consumed by the node to receive messages, and the energy consumed by monitoring neighbor nodes energy; An update module, used for recording the encounter interval sequence between the two described nodes in the time delay tolerant network to obtain a historical encounter interval within a preset renewal period, and to update the historical encounter interval; a calculation module for calculating the utility value of the node according to the remaining energy of the node and the historical encounter interval; a forwarding module, configured to forward a message to the node according to the utility value of the node; The update module is used to: According to the third formula, the historical encounter interval is updated, The third formula is ET _(a,b) =α·Ival+(1-α)·ET _(a,b)old , Among them, ET _{(a, b)} is the historical encounter interval between the node d _a and the node d _b , and is set as the update period T when the first encounter occurs, and x _i =CT ₂ -CT ₁ is the single encounter interval, where CT ₁ , CT ₂ is the last disconnection time and meeting time of node d _a and node d _b respectively. In the update period T, node d _a records all the encounter interval sequence with node d _b , and the historical encounter interval where m is the number of encounters in the period T, α∈(0,1); The update module is also used to: When the historical encounter interval is a multi-hop historical encounter interval, according to the fourth formula, the historical encounter interval is updated, The fourth formula is Among them, β is the effect of transitivity on the encounter interval, β∈(0,1). 5. The routing implementation device according to claim 4, wherein the determining module is used for: The residual energy of the node is determined according to the first formula and the second formula, and the first formula is: The second formula is: Among them, E _t is the energy consumed by the node to perform message forwarding, _Er is the energy consumed by the node to receive messages, E _l is the energy consumed by the monitoring neighbor node, and e _t is the energy required by the node to forward unit bytes energy consumption, _er is the energy consumption required by the node to receive a unit of bytes, e _l is the energy consumption required by the node to monitor neighbor nodes per unit time, S _i is the size of the message, Δt is the listening time, m is the number of forwarded messages, and n is The number of received messages, d _i is a node in the delay-tolerant network, 1≤i≤k, k is the number of nodes in the DTN network, is the total energy consumption of node d _i , E _i is the remaining energy of node d _i , is the initial energy of node _di . 6. The routing implementation device according to claim 4, wherein the computing module is used for: The utility value of the node is calculated according to the fifth formula, and the fifth formula is where γ∈(0,1) is the weight factor, ET _(i,d) /T∈(0,1], E _i is the residual energy of node d _i , is the initial energy of the node d _i , d _i is a node in the delay tolerant network, 1≤i≤k, k is the number of nodes in the DTN network.