Journal of Internet Computing and Services (인터넷정보학회논문지)

Korean Society for Internet Information (한국인터넷정보학회)
권호 표지
DOI QR코드

DOI QR Code

Hybrid Spray and Wait Routing Protocol in DTN

DTN에서 Hybrid Spray and Wait 라우팅 프로토콜

  • Received : 2013.11.18
  • Accepted : 2014.04.21
  • Published : 2014.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

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.

DTN(Delay/Disruption Tolerant Network)은 행성과 행성 간의 통신, 행성과 인공위성과의 통신과 같이 종단 간 연결이 보장되지 않고, 빈번한 연결 부재가 발생하고 기존 인터넷 인프라가 충분히 갖춰지지 않는 네트워크에 적합한 차세대 네트워크이다. 본 논문에서는 DTN 환경에서의 노드 간에 접촉한 기록 데이터를 이용하여 주기적으로 만나는 것을 확인하고, 향후 만나는 시간을 예측하여, 예측한 시간을 토대로 메시지를 누구에게 보내야 효율적인지를 선별하여, 메시지를 보내도록 한다. 또한 기존 라우팅 기법인 Spray and Wait 라우팅을 선별된 노드에게 적용하는 Hybrid Spray and Wait 알고리즘을 제안한다. 제안 알고리즘을 검증하기 위해 헬싱키 대학의 ONE(Opportunistic Network Environment) Simulator를 이용하여 이를 실험하였다. 제안하는 알고리즘의 전달성공률을 Binary Spray and Wait 라우팅의 성능과 비교하였고, 10% 적은 오버헤드를 보임을 확인하였다. 또한 불필요한 메시지의 복사를 줄일 수 있음을 확인하였다.

Keywords

References

  1. Delay Tolerant Networking research group http://www.dtnorg.org
  2. A. Keranen, J.Ott, and T. Kakkainen, "The ONE Simulator for TEN Protocol Evaluation," Proceedings of the 2nd International Conference on Simulation Tools and Techniques, Mar. 2009.
  3. Z. Zhang, "Routing in Intermittently Connected Mobile Ad Hoc Networks and Delay Tolerant Networks: Overview and Challenges," IEEE Communications Survey and Tutorial, pp. 24-37, Jan. 2006.
  4. Sang Ho So, Man Kyu Park, Se Chul Park, Jae Yong Lee, Byung Chul Kim, Dae Young Kim, Min Su Shin, Dae Ig Chang, and Ho Jin Lee, "Delay Tolerant Network Routing Algorithm based on the Mobility Pattern of Mobile Nodes," IEEK, Vol.46 No.4, pp. 13-28, Apr. 2009.
  5. T. Spyropoulos, K. Psounis, and C. S. Raghavendra, "Single-copy routing in intermittently connected mobile networks," In Proc. of IEEE Secon, Apr. 2004.
  6. Huai-En Lian, Chien Chen, Je-Wei Chang, Chien-Chung Shen, Rong-Hong Jan, "Shortest Path Routing with Reliability Requirement in Delay Tolerant Networks," Future Information Networks, 2009. ICFIN 2009. First International Conference on, Oct. 2009.
  7. T.Clausen and P.Jacquet, "Optimized Link State Routing Protocol(OLSR)," RFC 3626, IETF Network Working Group, Oct. 2003.
  8. Spyropoulos, T., Psounis, K., and Raghavendra,C. S. "Single-copy routing in intermittently connected mobile networks," In Proc. Sensor and Ad Hoc Commmand Distance Vector (AODV) Routing, RFC 3561, IETF Network Working Group, July 2000.
  9. C.Perkins, E.Belding-Royer, and S.Das, "Ad hoc On-Demand Distance Vector (AODV) Routing," RFC 3561, IETF Network Working Group, July 2000.
  10. J. Burgess, B. Gallagher, D. Jensen, and B. N. Levine. "MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks," In Proc. IEEE Infocom, April 2006.
  11. T. Spyropoulos, K. Psounis, and C. S. Raghavendra. "Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks," In Proc. ACM WDTN, pages 252-.259, Aug. 2005.
  12. Eyuphan Bulut, Zijian Wang, Boleslaw K. Szymanski, "Cost Effective Multi-Period Spraying for Routing in Delay Tolerant Networks," IEEE/ACM Transactions on, Oct. 2010.
  13. M Hussein Mamoun, "Efficient DTN Routing Protocol", International Journal of Computer Applications pp. 0975-8887, vol. 80, no. 9, Oct. 2013.
  14. Feng Li and Jie Wu, "LocalCom: A Community-based Epidemic Forwarding Scheme in Disruption-tolerant Networks,", IEEE Secon, Apr. 2009.
  15. P. Hui, J. Crowcroft, and E. Yoneki, "BUBBLE Rap: Social-Based Forwarding in Delay Tolerant Networks," IEEE Transactions on Mobile Computing, vol. 10, no. 11, pp. 1576-1589, Nov. 2011. https://doi.org/10.1109/TMC.2010.246
  16. Etienne C. R. de Oliveira and C' elio V. N. de Albuquerque, "NECTAR: A DTN Routing Protocol Based on Neighborhood Contact History," SAC '09. pp.8-12, Mar. 2009.
  17. Guizhu WANG, Yingying YANG, Xin SONG, Jie WANG, Weiming LI and Dawei DING, "Research for Delay Tolerant Network Node Similarity-based on Social Network,", JCIS, pp.5189-5195, July 2013.
  18. Rashid, S., Q. Ayub, M.S. Zahid and A.H. Abdullah, "E-DROP: An Effective Drop Buffer Management Policy for DTN Routing Protocols," International Journal of Computer Applications pp. 0975-8887, vol. 13, no. 7, Jan. 2011.