• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.05a
• /
• pp.367-370
• /
• 2017

This paper proposes a method for selecting efficient relay nodes in stochastic DTN model. Delay Tolerant Network (DTN) uses the Carry and Forward method, which creates a bundle layer for efficient communication, selects relay nodes between different networks and heterogeneous networks, and forwards messages. DTN is basically composed of mobile nodes so DTN has no fixed routing route and it has long latency due to intermittent connection. Therefore, the nodes constituting the DTN necessarily have the characteristics to store the messages, and the capacity of the stored messages and nodes affects the performance of the network. Stochastic DTN model proposed a Markov model that changes randomly over time to analyze the performance of DTN. In this paper, we use stochastic message distribution and node contact probabilities using contact time analyzed through message generation and extinction in order to select efficient relay nodes in stochastic DTN model.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.404-407
• /
• 2014

Delay Tolerant Network (DTN) is a networking architecture that is designed to solve network problem in unstable and stressed environments using the Store-Carry-Forward method. Different form general networks, DTN does not guarantee the end-to-end connectivity, it is hard for the exiting TCP/IP based protocols to normally work due to the characteristic such as large latency and unstable link connectivity. And the condition that send massage without the information of the destination occurs frequently. Thus, suitable routing protocols for DTN are required and being researched. In this paper, we propose a novel routing protocol for DTN utilizing epidemic and prediction based algorithm to prevent the defect of previously DTN routing protocols such as the absence of the holistic view of the network. Proposed algorithm predicted destination using the mobility information recorded in neighbor node's history and utilize epidemic based algorithm when occurred condition without destination's information. This algorithm is enhanced in terms of delivery ratio, decreases latency and overhead in sparse network such as DTN.

• The KIPS Transactions:PartC
• /
• v.16C no.4
• /
• pp.521-526
• /
• 2009

Disruption/Delay Tolerant Network(DTN) is a technology for interconnecting partitioned networks. These days, DTN, especially routing in DTN, draws significant attention from the networking community. In this paper, we investigate DTN routing strategies for highly partitioned ad hoc networks where Unmanned Aerial Vehicles (UAVs) perform store-carry-forward functionality for improved network connectivity. Also we investigate UAV trajectory control mechanisms via simulation studies.

• Journal of the Korea Convergence Society
• /
• v.9 no.11
• /
• pp.37-43
• /
• 2018

Science DMZ is a network architecture that considers complicated network components such as dedicated network, DTN, and minimum security policy to maximize transfer efficiency. And DTN tuning is an essential component to take full advantage of Science DMZ's available bandwidth. In addition, tuning of network system should be performed concurrently to minimize packet loss due to network bottleneck. In this paper, we propose a tuning method of data transfer node and network system for maximizing transfer efficiency in Science DMZ network architecture. As a result of the performance measurement using the KREONET, the network performance after the DTN tuning shows 180% improvement than that of existing method without DTN tuning. In addition, performance of 9.4Gb/s was shown without loss of performance measurement after tuning network system applying shaping policy.

• Journal of Digital Contents Society
• /
• v.15 no.1
• /
• pp.1-9
• /
• 2014

Delay-Tolerant Network (DTN) is an asynchronous networking technology that has been deployed for the networking environment in which steady communication paths are not available, and therefore it stores receiving data in a data storage and forward them only when the communication links are established. DTN can be applied to sensor networks and mobile ad-hoc network (MANET) as well as space communication that supports data transmissions among satellites. In DTN networking environments, it is very important to secure a scheme that has relatively low routing overhead and high reliability, so that it can enhance the overall routing speed and performance. In order for achieving efficient data transmissions among the nodes that have comparatively periodic moving patterns, this paper proposes a time information based DTN routing scheme which is able to predict routing paths. From the simulation results using Omnet++ simulation tools, it has been verified that the proposed time information based DTN routing algorithm shows satisfied levels of routing speed and routing reliability even with lower routing overheads.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2019.05a
• /
• pp.89-91
• /
• 2019

최근 첨단 과학응용분야에서는 대용량의 데이터를 효과적으로 공유 및 전송하기 위해 전용의 연구망과 데이터 전송 노드(DTN)를 활용하여 전송 효율을 높이기 위한 연구들이 활발히 수행되고 있다. 특히, DTN 클러스터링은 복수 개의 전송 노드들을 이용하여 병행성을 높여 전송 효율을 극대화시키는 기법으로 고성능컴퓨팅 환경에서 적용되고 있다. 이와 관련하여, 본 논문에서는 초기 실험적 연구로 NFS 외부 스토리지를 연계한 DTN 클러스터링 환경을 구축하고, WAN 구간에서 종단간 대용량 데이터 전송 실험을 수행한다. 실험 결과, 파일의 크기 및 개수 등이 서로 다른 비교 군들을 대상으로 단일 DTN 대비 DTN 클러스터링에 대한 효과를 확인할 수 있었다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.431-433
• /
• 2016

In this paper, we propose an algorithm that analyzes characteristic nodes to select efficient relay nodes using message distribution. Existing delay-tolerant network (DTN) routing algorithms have problems with large latency and overhead on account of the deficiency of network information in an unsteady network. We must solve this problem, predict future networks using node state information, and apply a weight factor that changes according to the message distribution. Simulation results show that the proposed algorithm provides enhanced performance compared to existing DTN routing algorithms.

• KNOM Review
• /
• v.22 no.2
• /
• pp.22-28
• /
• 2019

A Science DeMilitarized Zone (DMZ) is an optimized network technology tailored to research data nature. The Science DMZ guarantees end-to-end network performance by forming a closed research network without redundant networking and security devices for the authorized researchers. Data Transfer Node (DTN) is an essential component for the high performance and security of the Science DMZ, since only transfer functions of research data are allowed to the DTN without any security- and performance-threatening functions such as commercial internet service. Current Science DMZ requires per-user DTN server installation which turns out a scalability limitation of the networks in terms of management overhead, entry barrier of the user, and networks-wise CAPEX. In order to relax the aforementioned scalability issues, this paper suggests a centralized DTN design where end users in a group can share the centralized DTN. We evaluate the effectiveness of the suggested sharable DTN design by comparing CAPEX against to that of current design with respect to the diverse network load and the state-of-the-art computing machine.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.11
• /
• pp.2771-2778
• /
• 2014

In this paper, we propose an algorithm that select efficient relay nodes using information of network environment and nodes. The proposed algorithm can be used changeable weight factors as following network environment in node density. The routing protocols adopting store-carry-forward method are used for solving network problems occurred by unstable end-to-end connection in Delay Tolerant Networks(DTNs). Exiting DTN routing algorithms have problems that large latency and overhead because of deficiency of network informations. The proposed algorithm could be provide a solution this problems using changeable weight factor and prediction of network environment. Thus, selected relay nodes work efficiently in unstable and stressed network environment. Simulation results show that enhancement performance as overhead, delivery ratio, average latency compared to exiting DTN routing algorithm.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.4
• /
• pp.13-28
• /
• 2009

Routing protocols in Delay/Disruption Tolerant Networks(DTN) are important to enhance the performance of transmission delay and delivery success ratio. In this paper, we propose an efficient DTN routing algorithm, called "Nobility Pattern based Routing(MPR)", that controls the total number of transferred message copies based on mobility patterns of mobile nodes. We consider a realistic "Levy walk" mobility pattern that has a super-diffusive property which well represents human mobility pattern. We implemented a DTN simulator using ONE simulator for the proposed MPR algorithm and Levy walk mobility pattern. Simulation results show that mobility patterns are very important for accurate evaluation of DTN routing performance, and the proposed MPR enhances the routing performance of delivery delay and success delivery ratio under realistic mobility pattern.