• Title/Summary/Keyword: DTN Protocol

Search Result 20, Processing Time 0.024 seconds

A performance analysis of a DTN routing protocol in the working day movement using a taxi movement model (택시 이동 모델을 사용한 근무일 이동에서 DTN 라우팅 프로토콜의 성능 분석)

  • Oh, Sang Yeob
    • Journal of Digital Convergence
    • /
    • v.12 no.6
    • /
    • pp.265-270
    • /
    • 2014
  • The working-day movement model, which implemented in the ONE simulator, supports the environments similar to the real life by using the transportation. However, there is no taxi movement model in the working-day movement model. So, we implemented a taxi movement model in the ONE simulator as the previous work. It is changed significantly for the simulation results of routing protocols in the ONE simulator. In this paper, we analyze the performance evaluation of the DTN routing protocol such as an epidemic routing protocol using our taxi movement model in the ONE simulator.

Epidemic & Prediction based Routing Protocol for Delay Tolerant Network (DTN에서 에피데믹과 예측 기반 알고리즘을 이용한 라우팅 프로토콜)

  • Dho, Yoon-Hyung;Lee, Kang-Whan
    • 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.

  • PDF

Mobility Information based Routing for Delay and Disruption Tolerant Network (이동성 정보를 이용한 DTN 네트워크 라우팅 프로토콜)

  • Chang, Duk-Hyun;Shim, Yoon-Bo;Kim, Gil-Soo;Choi, Nak-Jung;Ryu, Ji-Ho;Kwon, Tae-Kyoung;Choi, Yang-Hee
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.2
    • /
    • pp.130-136
    • /
    • 2009
  • Delay and Disruption Tolerant Network (DTN) employs message delivery based on a store-and-forward method to conquer no guarantee of continuous end-to-end connectivity. Different from general networks, it is hard for the existing TCP/IP-based routing protocols to correctly work, due to the characteristics such as large latency and unstable link connectivity. Thus, many recent studies focus on routing protocols for DTN. In this paper, we propose a novel routing protocol for DTN with efficient message delivery utilizing mobility information such as direction or destination of mobile nodes. And this protocol is enhanced in terms of delivery ratio, decreases latency and overhead compared to the previously proposed solutions. Simulation results prove its superiority.

Hybrid Spray and Wait Routing Protocol in DTN (DTN에서 Hybrid Spray and Wait 라우팅 프로토콜)

  • Hyun, Sung-Su;Jeong, Hyeon-Jin;Choi, Seoung-Sik
    • Journal of Internet Computing and Services
    • /
    • v.15 no.3
    • /
    • pp.53-62
    • /
    • 2014
  • DTN is the next generation network that is used in not guaranteed end-to-end connection such as communication between planet and satellite, frequent connection severance, and not enough for qualified network infrastructure. In this paper, we propose the hybrid Spray-and-Wait algorithm to predict the node contact time by monitoring the periodic contacts information between the nodes. Based on this method, we select one node on the basis of prediction time and copy a message for spray and wait algorithm. In order to verify the the hybrid Spray and Wait algorithm, we use the ONE(Opportunistic Network Environment) Simulator of Helsinki University. The delivery probability of the proposed algorithm is compared to the Binary Spray and Wait algorithm, it is showed that it has 10% less overhead than Binary Spray and Wait routing. It has also shown that it reduces unnecessary copying of this message.

Probability-Based Message Forwarding Scheme with Buffer Management for Spray and Wait Routing Protocol (Spray and Wait 라우팅을 위한 확률 기반의 메시지 전달 방안 및 버퍼 관리 방안)

  • Kim, Eung-Hyup;Lee, Myung-Ki;Cho, You-Ze
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.5 no.7
    • /
    • pp.153-158
    • /
    • 2016
  • Delay Tolerant Network (DTN) is a network that employed method of store-carry-forward in intermittently connected networks. In DTNs, routing and buffer management scheme are important to improve successful message delivery. This paper proposes an improve spray and wait routing protocol based on delivery probability to a destination. Also, a buffer management scheme is proposed to drop the queued messages according to the number of copies (L value). Simulation results show that the proposed method provides a better delivery ratio and lower communication overhead when compared to existing schemes such as Epidemic, PRoPHET and spray and wait.

Delay tolerant network routing algorithm based on mobility prediction (이동 예측 기반의 DTN 라우팅 알고리즘)

  • Do, Youn-Hyung;Oh, Young-jun;Lee, Kang-Whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.10a
    • /
    • pp.522-523
    • /
    • 2013
  • Delay Tolerant Network (DTN)란 노드 간 통신의 지연 시간이 길고 연결 단절이 자주 일어나는 네트워크 상황에서 데이터를 안정적으로 전달할 수 있도록 지원할 수 있는 네트워크를 말한다. DTN은 노드들 간의 연결 정도의 강약을 파악하여 연결 정도가 높은 노드를 통해 목적 노드로 메시지를 전달하는 방식을 사용한다. 노드들의 움직임이 빠르고 서로간의 거리가 멀어 지속적인 종단 간 연결성이 보장 되지 않는 상황일 때 DTN을 사용하면 안정적인 전송이 가능하다. 이때 이 노드들의 움직임을 예측 할 수 있다면 더 효과적인 메시지 전달이 가능 할 것이다. 이 논문에서는 이동 노드의 속도와 목적지 등과 같은 이동성 정보를 이용해 노드의 위치를 예측하여 효과적인 메시지 전달 경로를 결정하는 이동 예측 기반의 DTN 알고리즘을 제안한다. 이 알고리즘은 Mobility Strategy Sharing Location Service Protocol을 발전시켜 위치 정보 업데이트의 오버헤드를 최소화한다.

  • PDF

DTN Routing with Back-Pressure based Replica Distribution

  • Jiao, Zhenzhen;Tian, Rui;Zhang, Baoxian;Li, Cheng
    • Journal of Communications and Networks
    • /
    • v.16 no.4
    • /
    • pp.378-384
    • /
    • 2014
  • Replication routing can greatly improve the data delivery performance by enabling multiple replicas of the same packet to be transmitted towards its destination simultaneously. It has been studied extensively recently and is now a widely accepted routing paradigm in delay tolerant networks (DTNs). However, in this field, the issue of how to maximize the utilization efficiency of limited replication quota in a resource-saving manner and therefore making replication routing to be more efficient in networks with limited resources has not received enough attention. In this paper, we propose a DTN routing protocol with back-pressure based replica distribution. Our protocol models the replica distribution problem from a resource allocation perspective and it utilizes the idea of back-pressure algorithm, which can be used for providing efficient network resource allocation for replication quota assignment among encountered nodes. Simulation results demonstrate that the proposed protocol significantly outperforms existing replication routing protocols in terms of packet delay and delivery ratio.

A Probabilistic Routing Mechanism Considering the Encounter Frequency in the Battlefield Environment (전장 환경에서 접촉 횟수 정보를 고려한 확률적 라우팅 기법)

  • Lee, Jongmok;Kang, Kyungran;Cho, Young-Jong
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.16 no.3
    • /
    • pp.332-339
    • /
    • 2013
  • The network nodes in a tactical network moves continuously and due to the physical and electronic obstacles, the connections are not always available. Due to the frequent disconnections, it is hard to discover the path among the nodes in a DTN. According to PROPHET(Probabilistic Routing Protocol using History of Encounters and Transitivity), one of the most well-known DTN routing protocols, a DTN node determines whom to forward a packet according to the packet delivery probability. From the viewpoint of a node, the packet delivery probability of another node is degraded while the nodes are disconnected whereas it is improved when they encounter. In this paper, we enhance the algorithm estimating the packet probability by considering the encounter count as an additional parameter. Our algorithm prefers the node that encounters the destination more frequently in selecting the next hop toward the destination. We evaluated the performance of our algorithm by simulating military operations using a DTN-dedicated simulator. Through the simulations, we show that our proposed algorithm achieve higher packet delivery ratio with similar overhead compared with PROPHET.

Performance Evaluation for a Unicast Vehicular Delay Tolerant Routing Protocol Networks

  • Abdalla, Ahmed Mohamed
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.2
    • /
    • pp.167-174
    • /
    • 2022
  • Vehicular Ad hoc Networks are considered as special kind of Mobile Ad Hoc Networks. VANETs are a new emerging recently developed, advanced technology that allows a wide set of applications related to providing more safety on roads, more convenience for passengers, self-driven vehicles, and intelligent transportation systems (ITS). Delay Tolerant Networks (DTN) are networks that allow communication in the event of connection problems, such as delays, intermittent connections, high error rates, and so on. Moreover, these are used in areas that may not have end-to-end connectivity. The expansion from DTN to VANET resulted in Vehicle Delay Tolerant Networks (VDTN). In this approach, a vehicle stores and carries a message in its buffer, and when the opportunity arises, it forwards the message to another node. Carry-store-forward mechanisms, packets in VDTNs can be delivered to the destination without clear connection between the transmitter and the receiver. The primary goals of routing protocols in VDTNs is to maximize the probability of delivery ratio to the destination node, while minimizing the total end-to-end delay. DTNs are used in a variety of operating environments, including those that are subject to failures and interruptions, and those with high delay, such as vehicle ad hoc networks (VANETs). This paper discusses DTN routing protocols belonging to unicast delay tolerant position based. The comparison was implemented using the NS2 simulator. Simulation of the three DTN routing protocols GeOpps, GeoSpray, and MaxProp is recorded, and the results are presented.

DTN Protocol for Transmission Data Flow Control in Underwater Multimedia Communication (수중 다중매체 통신에서 전송 데이터 흐름 제어를 위한 DTN 프로토콜)

  • Lim, Dong-Hyun;Kim, Changhwa
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2022.11a
    • /
    • pp.173-175
    • /
    • 2022
  • 서로 다른 수중 통신 매체 사이의 각기 다른 장단점을 해결하기 위해 여러 종류의 수중 통신 모듈을 함께 운용하는 통신 기술인 다중매체 통신 기술이 등장하였다. 다중매체 통신은 한 네트워크에서 서로 다른 통신 매체들을 함께 운용하기 때문에 이들의 전송 속도 차이로 인한 흐름 제어 문제가 발생한다. 이에 본 논문에서는 통신 속도 차이로 인한 전송데이터 손실을 미연에 방지하는 수중 다중매체 통신에서 전송데이터 흐름을 제어하는 일종의 DTN (Delay/ Disruption Tolerant Network) 프로토콜을 제안한다. 이 전송 속도 제어 프로토콜을 이용하여 수중 다중매체 통신 네트워크에서 전송 속도 차이로 인해 한 노드에 메시지가 쌓여 전송 큐의 전송데이터 손실이 예측되는 경우 보조 저장장치를 이용하여 큐의 길이를 늘이고, 보조 저장장치 또한 전송데이터 손실이 예측되는 경우 전송 중인 노드에 전송 일시중지를 요청하며 지연상태가 해결된 후 다시 전송을 요청할 수 있다.