KR102280289B1 - Delivery method for message based delay tolerant network routing protocol using restriction of message duplication, recording medium and device for performing the method - Google Patents

Abstract

A message transmission method based on a network routing protocol that allows delay using message copy restriction checks whether there is a message to be delivered by exchanging a summary vector (SV) containing message information stored with each other when a node contacts a contact node. to do; Recording information including the ID and DupC value of the corresponding message to the contact node in order to share information on the duplication count (hereinafter referred to as DupC) value of the message for a message that is not duplicated between the node and the contact node ; comparing the DupC value with an average message copy number (hereinafter, AvgDupC) value of the corresponding message when the DupC value is smaller than a preset DupC threshold value; when the DupC value is smaller than the AvgDupC value, generating a relaxed delivery prediction rate by decreasing a delivery prediction rate value of the node for the corresponding message by a preset relaxation value (delta); and when the forwarding prediction rate of the contact node is greater than the relaxed forwarding prediction rate, copying the corresponding message and transmitting the message to the contacting node. Accordingly, more efficient message delivery is possible by improving the PRoPHET routing protocol.

Description

DELIVERY METHOD FOR MESSAGE BASED DELAY TOLERANT NETWORK ROUTING PROTOCOL USING RESTRICTION OF MESSAGE DUPLICATION, RECORDING MEDIUM AND DEVICE FOR PERFORMING THE METHOD}

The present invention relates to a method for transmitting a message based on a delay-tolerant network routing protocol using a message copy restriction, a recording medium and an apparatus for performing the same, and more particularly, a delay-tolerant network environment in which connectivity between a source node and a destination node is not guaranteed. It relates to a routing protocol that attempts to successfully deliver a message to its destination by utilizing information such as the PRoPHET-based delivery prediction rate, message copy limit, and the average value of the number of message copies.

Recently, interest in a delay tolerant network (DTN) that enables communication even in extreme environments due to destruction of communication infrastructure due to natural disasters or terrorism is increasing. In a delay-tolerant network, communication is possible even in an environment where there is no communication infrastructure or a seamless routing path through other nodes between the source node and the destination node.

To this end, each node stores a message in its own buffer using the function of the bundle layer defined above the transport layer as shown in FIG. 1, and when it comes into contact with the neighboring node during movement, it delivers the message to the neighboring node according to an appropriate standard, and By repeating the process, it operates in the store-carry-forward method to deliver the message to the final destination node.

In the case of existing research, the performance of the existing PRoPHET protocol is improved by identifying the message copies spread in the network through the message copy count information called DupC and limiting the copy count through the threshold value called DupC threshold. However, if the message is not delivered after comparing the delivery prediction rate in a situation where the contact node does not have the same message, the DupC information is not shared, so more sophisticated message spread cannot be identified, and the message delivery condition is not changed according to the spread, so the performance There are limits to improvement.

In addition, among the representative delay-tolerant network protocols, the PRoPHET protocol has fewer message copies than the Epidemic protocol, which is a representative protocol of the delay-tolerant network that copies messages to all nodes it contacts, so it operates efficiently in an environment with limited buffers and a large number of nodes. As a protocol, the standard was established as RFC 6693 by the DTN research group (DTNRG) of the Internet Research Task Force (IRTF).

The PRoPHET protocol records the contact history between nodes, calculates and updates the node delivery predictability through this, and uses it as a message delivery condition when inter-node contact occurs. Node a in the environment to which the PRoPHET protocol is applied _{can define delivery predictability P (a,b)} having a value between 0 and 1 for contact node b as the following equation.

P _(a,b)old is the previously stored delivery predictability, and P _init is an initial set probability value with a value between 0 and 1. If two nodes do not contact for a long time, the propagation prediction rate decreases as follows. Here, γ represents the aging constant.

In addition, the propagation prediction rate of node A with respect to node C can be calculated as follows by utilizing the propagation prediction rates of each node and node B.

β corresponds to a scaling factor having a value between 0 and 1.

In the PRoPHET protocol, two nodes exchange summary vectors when they contact, similar to the Epidemic protocol. At this time, the delivery prediction rate of each node is exchanged, and the message is delivered to the node with a larger delivery prediction rate for the destination node.

Since the PRoPHET protocol does not consider other characteristics of the node other than the forward prediction rate calculated using contact information with other nodes in the past, there is a limit to improving the performance in a limited buffer capacity, and unnecessary messages in the message copy process considering only the probability transmission occurs.

Transmission of such unnecessary messages increases the overhead of the entire network and ultimately causes a problem of lowering the transmission success rate of the entire network.

KR 10-1680726 B1 KR 10-1618545 B1 KR 10-1231857 B1

Kihyung Kwon, Kyungho Lee, and Yunwon Jeong, "Improved Unnecessary Message Removal Technique for Content Sharing in Delay Tolerant Networks," Journal of KIIT. Vol. 12, No. 3, pp. 69-76, Mar 2014. Hyeon-Ho Lim, Dong-Young Seo, and Yun-Won Jeong, "Enhanced PRoPHET Routing Protocol through Message Copy Restriction," 　Journal of KIIT, Vol.14, No. 6, pp. 81-86, Jun 2016.

Accordingly, it is an object of the present invention to provide a message transmission method based on a delay-tolerant network routing protocol using a message copy restriction.

Another object of the present invention is to provide a recording medium in which a computer program for performing a message transmission method based on a delay tolerance network routing protocol using the message copy restriction is recorded.

Another object of the present invention is to provide an apparatus for performing a message transmission method based on a delay-tolerant network routing protocol using the message copy restriction.

A method for transmitting a message based on a delay-tolerant network routing protocol using a message copy restriction according to an embodiment for realizing the object of the present invention is a summary vector containing message information stored with each other when a node contacts a contact node. checking whether there is a message scheduled to be delivered by exchanging (Summary Vector, SV); Recording information including the ID and DupC value of the corresponding message to the contact node in order to share information on the duplication count (hereinafter referred to as DupC) value of the message for a message that is not duplicated between the node and the contact node ; comparing the DupC value with an average message copy number (hereinafter, AvgDupC) value of the corresponding message when the DupC value is smaller than a preset DupC threshold value; when the DupC value is smaller than the AvgDupC value, generating a relaxed delivery prediction rate by decreasing a delivery prediction rate value of the node for the corresponding message by a preset relaxation value (delta); and when the forwarding prediction rate of the contact node is greater than the relaxed forwarding prediction rate, copying the corresponding message and transmitting the message to the contacting node.

In an embodiment of the present invention, the message transmission method based on the delay tolerance network routing protocol using the message copy restriction compares the DupC value for the message when the same message is stored between the contact node and the other node. It may further include; updating to a large value.

In an embodiment of the present invention, in the message transmission method based on the delay tolerance network routing protocol using the message copy restriction, when the value of DupC is greater than the value of AvgDupC, the message is transmitted only when the delivery prediction rate of the contact node is large. It may further include; copying and transmitting to the contact node.

In an embodiment of the present invention, the preset relaxation value delta may have a value greater than 0 and less than 1.

In an embodiment of the present invention, the message transmission method based on the delay tolerant network routing protocol using the message copy restriction may be repeatedly performed on all messages stored in the node.

In a computer-readable storage medium according to an embodiment for realizing another object of the present invention, a computer program for performing a message transmission method based on a delay tolerance network routing protocol using the message copy restriction is recorded. .

A message transmission apparatus based on a delay tolerance network routing protocol using a message copy restriction according to an embodiment for realizing another object of the present invention, when a node contacts a contact node, contains message information stored with each other. a message check unit that checks whether there is a message scheduled to be delivered by exchanging a summary vector (SV); For a message that is not duplicated between the node and the contact node, information including the ID and DupC value of the message is recorded in the contact node in order to share information on the duplication count (hereinafter referred to as DupC) value of the corresponding message. commons; a comparison unit that compares the DupC value with an average number of times of message copying (hereinafter, AvgDupC) of the corresponding message when the DupC value is smaller than a preset DupC threshold value; a diffusion facilitator for generating a relaxed delivery prediction rate by decreasing a delivery prediction rate value for the corresponding message of the node by a preset relaxation value (delta) when the value of DupC is smaller than the AvgDupC value; and a message transmitter for copying the corresponding message and transmitting the message to the contact node when the forwarding prediction rate of the contact node is greater than the relaxed forwarding prediction rate.

In an embodiment of the present invention, when the same message is stored between the contact node and the other node, the information sharing unit may compare the DupC value for the corresponding message and update it to a larger value.

In an embodiment of the present invention, when the value of DupC is greater than the value of AvgDupC, the message transmitter may copy and transmit the message to the contact node only when the delivery prediction rate of the contact node is large.

In an embodiment of the present invention, the preset relaxation value delta may have a value greater than 0 and less than 1.

According to the message transmission method based on the delay-tolerant network routing protocol using this message copy restriction, the number of message copies in the network is reduced by sharing the message ID and DupC information between nodes so that they can be recorded even when there is no same message when the nodes are in contact. Can you figure it out more precisely?

Accordingly, each node uses the Average Duplication Count (AvgDupC) of messages stored in the node as a characteristic of the node along with the PRoPHET-based delivery prediction rate and DupC information as a message delivery condition when inter-nodes are in contact. By understanding it, the message can be conveyed effectively.

In addition, in order to promote replication of a message that is judged to have not been spread for message transmission, the message delivery condition based on the delivery prediction rate is relaxed to help spread the message, and the delivery rate and delivery delay aspect through message transmission according to the message distribution in the network can improve the performance of

1 is a diagram for explaining a message delivery process in a general delay tolerant network.
2 is a block diagram of an apparatus for transmitting a message based on a delay-tolerant network routing protocol using a message copy restriction according to an embodiment of the present invention.
3 is a flowchart of a message transmission method based on a delay-tolerant network routing protocol using a message copy restriction according to an embodiment of the present invention.
4 is a table of an environment assumed in simulation for performance comparison between the present invention and the prior art.
5 is a chart comparing the present invention and the prior art in terms of transfer rates while changing the DupC threshold according to the buffer size of the node.
6 is a diagram comparing the present invention and the prior art in terms of a load factor while changing a DupC threshold according to a buffer size of a node.
7 is a chart comparing the present invention and the prior art in terms of transmission delay while changing the DupC threshold according to the buffer size of the node.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS [0010] DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS [0010] DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS [0023] Reference is made to the accompanying drawings, which show by way of illustration specific embodiments in which the invention may be practiced. These embodiments are described in sufficient detail to enable those skilled in the art to practice the present invention. It should be understood that the various embodiments of the present invention are different but need not be mutually exclusive. For example, certain shapes, structures, and characteristics described herein with respect to one embodiment may be embodied in other embodiments without departing from the spirit and scope of the invention. In addition, it should be understood that the location or arrangement of individual components within each disclosed embodiment may be changed without departing from the spirit and scope of the present invention. Accordingly, the detailed description set forth below is not intended to be taken in a limiting sense, and the scope of the invention, if properly described, is limited only by the appended claims, along with all scope equivalents to those claimed. Like reference numerals in the drawings refer to the same or similar functions throughout the various aspects.

Hereinafter, preferred embodiments of the present invention will be described in more detail with reference to the drawings.

2 is a block diagram of an apparatus for transmitting a message based on a delay-tolerant network routing protocol using a message copy restriction according to an embodiment of the present invention.

In the present invention, PRoPHET, a typical delay-tolerant network routing protocol in a Delay Tolerant Network (DTN) environment, in which a protocol for transmitting a message to an unspecified node is used because the connectivity between the source node and the destination node is not guaranteed as shown in FIG. 1 . based on the protocol.

Unlike the Epidemic routing protocol, which copies packets to all nodes it meets, the PRoPHET protocol compares the delivery prediction rate, which is the probability of contacting the destination node of the message stored in the node, between the contact nodes, and delivers the message to the node with the high delivery prediction rate. increasing efficiency.

However, in the case of the PRoPHET routing protocol, unnecessary message copying may occur during the delivery process for transmitting the message to the destination node despite the reduced load factor in consideration of the delivery prediction rate.

Therefore, in the present invention, the number of copies (Dupplication Counter, DupC) is limited so that the distribution of message copies can be identified and unnecessary copying can be suppressed, and the existing research of updating DupC information between nodes storing the corresponding message is extended to contact between nodes. It manages to record message IDs and DupC information between nodes even when there is no identical message at the time of operation, so that the number of copies of messages in the network can be grasped more precisely.

In addition, each node identifies the spread of a message by using the Average Duplication Count (AvgDupC) of messages stored in the node as a characteristic of the node as well as the PRoPHET-based delivery prediction rate and DupC information as a message delivery condition during inter-node contact. We propose a protocol that effectively transmits messages by

Furthermore, we propose a mechanism for inducing rapid spread by relaxing the message delivery condition based on the delivery prediction rate in order to promote replication of a message that is judged to have been less spread for message transmission.

Referring to FIG. 2 , a message transmission apparatus 10 (hereinafter referred to as a device) based on a delay tolerant network routing protocol using message copy restriction according to the present invention includes a message confirmation unit 110 , an information sharing unit 130 , and a comparison unit 150 . ), a diffusion promoting unit 170 and a message transmitting unit 190 .

In the device 10 of the present invention, software (application) for performing message transmission based on a delay tolerant network routing protocol using message copy restriction may be installed and executed, and the message confirmation unit 110 and the information sharing unit (130), the configuration of the comparison unit 150, the diffusion facilitation unit 170 and the message transmission unit 190 is based on a delay tolerance network routing protocol using the message copy restriction executed in the device 10. It can be controlled by software to perform message transmission.

The device 10 may be a separate node or a module of a node. In addition, the configuration of the message confirmation unit 110 , the information sharing unit 130 , the comparison unit 150 , the diffusion facilitation unit 170 , and the message transmission unit 190 is formed as an integrated module, or one It may consist of more than one module. However, on the contrary, each configuration may be formed of a separate module.

The device 10 may be mobile. The apparatus 10 is a device, an apparatus, a terminal, a user equipment (UE), a mobile station (MS), a wireless device, and other terms such as a handheld device. can be called

The device 10 may execute or manufacture various software based on an operating system (OS), that is, the system. The operating system is a system program for software to use the hardware of the device, and is a mobile computer operating system such as Android OS, iOS, Windows Mobile OS, Bada OS, Symbian OS, Blackberry OS, and Windows series, Linux series, Unix series, It can include all computer operating systems such as MAC, AIX, and HP-UX.

When the corresponding node contacts the contact node, the message check unit 110 checks whether there is a message scheduled to be delivered by exchanging a summary vector (SV) containing message information stored between the node and the contact node. .

When it is determined that the same message is stored between the contact nodes through the exchanged summary vector, the information sharing unit 130 compares the value of the number of times the corresponding message is delivered (Dupplication Count, hereinafter DupC), which is the greater of each other's values. Update the value and record.

On the other hand, when there is a message that is not stored in the contact node, the information sharing unit 130 shares information on the number of copies of the message at the storage node side (A), regardless of whether or not to transmit the message. To do this, information including the message ID and DupC is transmitted to the contact node B, and the contact node B records the corresponding message ID and DupC information to the node.

The comparison unit 150 compares delivery conditions for message transmission. Specifically, the DupC value of the message to be transmitted from the transmitting node (A) side is compared with a preset DupC threshold, and when the DupC value is smaller than the DupC threshold, it is determined that the message spread is less. Moving on to the next delivery condition comparison step, the node's average message copy count (hereinafter, AvgDupC) value is compared with the DupC value of the corresponding message.

If the DupC value of the message to be copied from node A is greater than the AvgDupC value, the message is delivered when the delivery prediction rate of the contact node is large through comparison of the transmission prediction rates of the existing PRoPHET protocol.

On the other hand, when the DupC value is smaller than the AvgDupC value, the diffusion facilitator 170 generates a relaxed delivery prediction rate by decreasing the delivery prediction rate value of the node for the corresponding message by a preset relaxation value (delta). do.

If the value of DupC of the message to be sent is smaller than AvgDupC, it is judged that the distribution of copies for message transmission to the destination is insufficient, and in order to promote the copy of the message, the delivery prediction rate of the sending node (A) to the corresponding message destination It is to reduce the propagation prediction rate by decreasing the value by a delta value between 0 and 1. Thereafter, when the forwarding prediction rate of the contact node is greater than the relaxed forwarding prediction rate, the message is copied to the contacting node (B).

In Equation 1 below, P(B,D) denotes a propagation prediction rate between a node B and a node D.

[Equation 1]

P(B,D) > P(A,D) - delta

When the delivery prediction rate of the contact node is greater than the relaxed delivery prediction rate, the message transmitter 190 copies the message and transmits the message to the contact node.

This procedure can be repeated for all messages stored in the node during the contact time.

Accordingly, by identifying the sophisticated network message distribution and reflecting the delivery prediction rate, the average number of times a node copied (AvgDupC), and the number of times each message copied (DupC) to the message delivery conditions according to the degree of spread, it can be used together. Through message transmission, performance in terms of delivery rate and delivery delay can be improved.

Hereinafter, a method for managing producer mobility in an information-centric network environment according to the present invention will be described in detail.

3 is a flowchart of a method for transmitting a message based on a delay-tolerant network routing protocol using a message copy restriction according to an embodiment of the present invention.

The message transmission method based on the delay tolerance network routing protocol using the message copy restriction according to the present embodiment may proceed in substantially the same configuration as the apparatus 10 of FIG. 2 .

Accordingly, the same components as those of the device 10 of FIG. 2 are given the same reference numerals, and repeated descriptions are omitted. In addition, the message transmission method based on the delay tolerant network routing protocol using the message copy restriction according to the present embodiment may be executed by software (application) for performing message transmission based on the delay tolerant network routing protocol using the message copy restriction. .

In the present invention, in order to improve the PRoPHET routing protocol-based technique with the limitation of the message duplication count (DupC) of the existing research, the message ID and DupC information between contact nodes can be recorded even when there is no same message in the contact node. Share. In addition, the Average Duplication Count (AvgDupC) of messages stored in the node is calculated and used as a characteristic of the node. Through DupC and AvgDupC, the degree of message spread in the network and the characteristics of nodes are identified and used for message delivery conditions.

3 shows an operation process of the invention when two nodes A and B come into contact.

Referring to FIG. 3 , in the message transmission method based on the delay-tolerant network routing protocol using the message copy restriction according to the present embodiment, when the nodes are in contact (step S10), a Summary Vector (SV) containing message information owned by each node ) to check whether there is a message to be transmitted by exchanging (step S11).

After the SV exchange, the two contacting nodes check whether the same message is stored between the nodes (step S13). If the same message is stored between contact nodes, the value of Duplication Count (DupC), which is the number of times the corresponding message has been delivered, is compared (step S21). The larger value among each other's values is updated and recorded (step S23, step S25).

On the other hand, in the case of a message that is not stored in the contact node, regardless of whether the message is transmitted or not, information containing the message ID and DupC is transmitted to the storage node (A) to share information on the number of copies of the message. It forwards to the contact node B (step S15), and the node B records the corresponding message ID and DupC information to the node.

If the DupC value of the message to be transmitted on the sending node (A) side is smaller than the preset DupC threshold in the step of comparing the delivery conditions for message transmission (step S17), it is determined that the message spread is less and the next delivery It goes to the condition comparison step and compares the AvgDupC value, which is the average number of message copies of the node, with the DupC value of the corresponding message (step S19).

If the DupC value of the message to be copied from node A is greater than the AvgDupC value, the message is delivered through the comparison of the delivery prediction rates of the existing PRoPHET protocol (step S31), and when the delivery prediction rate of the contact node is large (step S33).

On the other hand, if the DupC value of the message to be sent is smaller than AvgDupC, it is determined that the distribution of copies for message transmission to the destination is insufficient, and the transmission node (A) side determines the delivery prediction rate value for the corresponding message destination to facilitate copying. The delivery prediction rate is relaxed by reducing the delta value between 0 and 1 (step S30), and when the delivery prediction rate of the contact node is greater than the relaxed delivery prediction rate, the message is copied to the contact node B (step S33).

This procedure can be repeatedly performed for all messages stored in the node during the contact time (steps S35 and S37).

Table 1 below shows the previous study [H.H. Lim, D.Y. Seo, and Y.W. Chung, "An Improved PRoPHET Routing Protocol through the Restriction of Message Duplication," Jounral of KIIT, Vol. 14, No. 6, pp. 81-86, June 2016.] and summarizes the operation of the present invention.

existing research proposal study DupC
share Only the message stored in the same way as the contact node is updated with a larger value. Sharing messages that are not stored in the same way as contact nodes message passing
condition Determination by comparison with DupC threshold Determination by further comparison with the DupC threshold and AvgDupC, which is the average value of DupC.

The present invention defines a duplication counter (abbreviated as DupC), which is the number of times a message is copied, as an index for indirectly inferring the degree of spread in the entire network for an arbitrary message, similar to the existing research for comparison. When a node forwards a message to a neighboring node, this value is incremented by 1.

On the other hand, unlike the previous study of updating this information to a larger DupC value by sharing this information when contacting other nodes with the same message, the DupC value is shared even for messages that are not identical. Through this, it is possible to infer the degree of overall spread of the message more accurately than in previous studies.

In addition, if the DupC value is larger than the predefined threshold, DupC Threshold, it is determined that the message has been sufficiently spread in the network and the message is not delivered. If the DupC value is smaller than the threshold, the message is not transmitted using the delivery prediction rate defined in the PRoPHET protocol. Unlike the previous study in which a node transmits a message when the prediction rate of message delivery to the destination node is higher, the average value of the DupC value of the messages stored in the node is additionally used to more effectively control the spread of the message.

That is, as shown in FIG. 3, when the DupC of a message is smaller than the threshold, the DupC of the message under consideration and the AvgDupC value, which is the average value of the DupC of all messages stored in the node, are compared. If DupC is larger than AvgDupC, it is basically defined in PRoPHET As shown above, if the counterpart node has a higher prediction rate of delivery of the message to the destination node, the message is delivered.

On the other hand, when DupC is smaller than AvgDupC, in order to promote diffusion by determining that the message has less spread compared to other messages from an average point of view, as shown in Equation 1, the delivery prediction rate of the counterpart node to the destination node is If it is greater than the value obtained by subtracting a certain value from the delivery prediction rate of , the message is delivered.

In the present invention, ONE (Opportunistic Network Environment) simulator developed at the University of Helsinki for performance analysis of the proposed protocol [The Opportunistic Network Environment simulator, http://www.netlab.tkk.fi /tutkimus/dtn/theone/], [A. Keranen, J. Ott, and T. Karkkainen, "The ONE Simulator for DTN Protocol Evaluation," Proceedings of the 2nd International Conferenceon Simulation Tools and Techniques, pp. 55:1-10, March 2009.] was used to analyze the transmission rate, load factor, and transmission delay defined in Equations 2 to 4 below.

[Equation 2]

[Equation 3]

[Equation 4]

The simulation environment assumed in this simulation was set up as shown in FIG. 4 in the same way as used in the previous study for fair performance comparison.

5 is a chart comparing the performance of the method proposed in the present invention in terms of transfer rate with the existing technique while changing the DupC threshold value when the node buffer size is 10, 30, or 50 Mbytes.

As can be seen in FIG. 5 , it can be seen that the transmission rate increases as the size of the buffer increases in the method and the existing technique proposed in the present invention, because the number of messages deleted due to the increase in the size of the buffer decreases.

Also, in both techniques, as the DupC threshold value increases, the delivery rate increases initially, but decreases after a certain value. This is because in the range where the DupC threshold value is small, the message spread increases as this value increases. Because it is easy to convey the message.

On the other hand, in the range where the DupC threshold value is large, as this value increases, the number of existing messages deleted to store newly received messages increases due to the limited size of the buffer of the node, resulting in a decrease in the delivery rate. As can be predicted, it can be seen that the optimal DupC threshold value has a larger value as the size of the buffer increases.

It can be seen that the method proposed in the present invention has superior performance compared to the existing method in all buffer sizes considered except for the case where the DupC threshold value is very large, and this is because the present invention can more effectively spread the message compared to the existing method. Because it can be controlled.

6 is a diagram comparing the load factor, and it can be seen that both methods increase the load factor as the number of copied messages increases as the DupC threshold value increases. In the method proposed in the present invention, when DupC is smaller than AvgDupC compared to the existing technique, it is judged as a message with less spread compared to other messages from an average point of view and promotes diffusion. It can be seen that the load factor also slightly increases compared to the existing technique. .

7 is a diagram showing the delivery delay. Both techniques have a large delivery delay in an environment where message diffusion does not occur well because the DupC threshold is very small, or the DupC threshold is too large and a lot of messages are deleted from the buffer, whereas the DupC threshold is appropriate. It has been shown to have good propagation delay in the range.

It can be confirmed that the method proposed in the present invention has a better propagation delay than the conventional method in all DupC threshold intervals through appropriate message spreading.

In the present invention, a delay-tolerant network routing protocol using an improved message copy limit for effectively delivering a message by utilizing the number of copies of a message and the average number of copies of a message is proposed. As a result of performance analysis through simulation, the proposed protocol slightly increases the load factor compared to the existing comparison protocol, but has better delivery rate and delivery delay in most of the DupC threshold ranges considered.

Such a method for transmitting a message based on a delay-tolerant network routing protocol using a message copy restriction is implemented as an application or implemented in the form of a program command that can be executed through various computer components and recorded in a computer-readable recording medium. . The computer-readable recording medium may include program instructions, data files, data structures, etc. alone or in combination.

The program instructions recorded on the computer-readable recording medium are specially designed and configured for the present invention, and may be known and available to those skilled in the computer software field.

Examples of the computer-readable recording medium include a hard disk, a magnetic medium such as a floppy disk and a magnetic tape, an optical recording medium such as a CD-ROM, a DVD, and a magneto-optical medium such as a floppy disk. media), and hardware devices specially configured to store and execute program instructions, such as ROM, RAM, flash memory, and the like.

Examples of program instructions include not only machine language codes such as those generated by a compiler, but also high-level language codes that can be executed by a computer using an interpreter or the like. The hardware device may be configured to operate as one or more software modules to perform processing according to the present invention, and vice versa.

Although described above with reference to the embodiments, those skilled in the art can variously modify and change the present invention within the scope without departing from the spirit and scope of the present invention described in the claims below You will understand.

The present invention proposes a delay-tolerant network routing protocol using an improved message copy limit that effectively delivers a message by utilizing the number of times a message is copied and the average number of copies of messages stored in a node. As a result of performance analysis, it can be seen that the proposed protocol has better performance in terms of delivery rate and delivery delay. Accordingly, it can be usefully applied to information communication fields requiring data transmission.

10: Message transmission device based on delay-tolerant network routing protocol
110: message confirmation unit
130: information sharing unit
150: comparison unit
170: diffusion promoting unit
190: message transmission unit

Claims (10)

checking whether there is a message to be delivered by exchanging summary vectors (SV) containing message information stored with each other when the node contacts the contact node;
when the same message is stored between the node and the contact node, comparing the DupC value for the corresponding message and updating the DupC value to a larger value;
Recording information including the ID and DupC value of the message to the contact node in order to share information on the Duplication Count (hereinafter referred to as DupC) value of the message for a message that is not duplicated between the node and the contact node ; and
Comprising the step of comparing delivery conditions for transmission of the non-overlapping message,
Comparing the delivery conditions comprises:
comparing the DupC value with an average message copy number (hereinafter, AvgDupC) value of the corresponding message when the DupC value is smaller than a preset DupC threshold value;
when the DupC value is smaller than the AvgDupC value, generating a relaxed delivery prediction rate by decreasing a delivery prediction rate value of the node for the corresponding message by a preset relaxation value (delta); and
and transmitting the corresponding message to the contact node by copying the corresponding message when the forwarding prediction rate of the contact node is greater than the relaxed forwarding prediction rate.
delete According to claim 1,
When the value of DupC is greater than the AvgDupC value, copying and transmitting the corresponding message to the contact node only when the delivery prediction rate of the contact node is large; How to send messages.
According to claim 1,
The preset relaxation value (delta) has a value greater than 0 and less than 1, a message transmission method based on a delay tolerant network routing protocol using a message copy restriction.
According to claim 1,
A method for transmitting a message based on a delay-tolerant network routing protocol using message copy restriction, which is repeatedly performed on all messages stored in the node.
A computer-readable storage medium recording a computer program for performing the message transmission method based on the delay tolerance network routing protocol using the message copy restriction according to claim 1 .
a message checking unit that checks whether there is a message scheduled to be delivered by exchanging a summary vector (SV) containing message information stored with each other when the node contacts the contact node;
If the same message is stored between the contact node and another node, the DupC value for the corresponding message is compared and updated to a larger value, and the number of times ( an information sharing unit that records information including an ID and a DupC value of a corresponding message to the contact node in order to share Duplication Count (DupC) value information;
A comparison unit that compares delivery conditions for transmission of the non-overlapping message and compares the DupC value with the average number of times of message copying (hereinafter, AvgDupC) value of the message when the DupC value is smaller than a preset DupC threshold value ;
a diffusion facilitator for generating a relaxed delivery prediction rate by decreasing a delivery prediction rate value for the corresponding message of the node by a preset relaxation value (delta) when the DupC value is smaller than the AvgDupC value; and
A message transmission apparatus based on a delay-tolerant network routing protocol using message copy restriction, comprising: a message transmission unit that copies the corresponding message and transmits the message to the contact node when the forwarding prediction rate of the contact node is greater than the relaxed forwarding prediction rate .
delete The method of claim 7, wherein the message transmission unit,
When the DupC value is greater than the AvgDupC value, the message transmission apparatus based on a delay-tolerant network routing protocol using a message copy restriction to copy and transmit the corresponding message to the contact node only when the delivery prediction rate of the contact node is large.
8. The method of claim 7,
The preset relaxation value (delta) has a value greater than 0 and less than 1, a message transmission apparatus based on a delay tolerant network routing protocol using a message copy restriction.

Images