KIPS Transactions on Computer and Communication Systems (정보처리학회논문지:컴퓨터 및 통신 시스템)

Korea Information Processing Society (한국정보처리학회)
권호 표지
DOI QR코드

DOI QR Code

Probability-Based Message Forwarding Scheme with Buffer Management for Spray and Wait Routing Protocol

Spray and Wait 라우팅을 위한 확률 기반의 메시지 전달 방안 및 버퍼 관리 방안

  • Received : 2016.02.12
  • Accepted : 2016.06.09
  • Published : 2016.07.31
Download PDF
⟨ Previous Next ⟩

Abstract

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(DTN)은 종단간 연결성이 보장되지 않는 환경에서 store-carry-forward 방식의 메시지 전달을 기본으로 하는 네트워크이다. DTN 환경에서 메시지 전달을 위한 라우팅 방안뿐만 아니라 버퍼 관리 정책 또한 전달률을 높이기 위한 중요한 요소이다. 본 논문에서는 기존 spray and wait 라우팅 방안의 메시지 전달률을 높이기 위한 확률 기반의 spray and wait 방안을 제안한다. 또한 버퍼오버플로우 발생 시, L 값에 따라 메시지를 폐기하는 버퍼 관리방안도 제안하였다. 기존의 DTN 라우팅 방안인 Epidemic, PRoPHET, spray and wait 프로토콜과 성능을 비교하였으며 전달률 및 오버헤드의 성능이 개선되는 것을 시뮬레이션을 통해 확인하였다.

Keywords

References

  1. Fall, Kevin, "A Delay-Tolerant Network Architecture for Challenged Internets," in Proc. of ACM SIGCOMM, Aug., 2003.
  2. V. Cerf, S. Burleigh, A. Hooke, L. Torgerson, R. Durst, K. Scott, K. Fall, and H. Weiss, "Delay-Tolerant Networking Architecture," IETF RFC 4838, Apr., 2007.
  3. E. P. C. Jones, L. Li, and P. A. S. Ward, "Routing strategies for delay tolerant networks," Submitted to Computer Communication Review (under review), 2008.
  4. A. McMahon and S. Farrell, "Delay and Disruption Tolerant Networking," IEEE Internet Computing, Vol.13, No.6, pp. 82-87, Nov., 2009. https://doi.org/10.1109/MIC.2009.127
  5. A. Vahdat and D. Becker, "Epidemic routing for partially-connected ad-hoc networks," Technical Report CS-2000-06, Duke University, 2000.
  6. J. Leguay, T. Friedman, and V. Conan, "Evaluating mobility pattern space routing for DTNs'," Proc. int. Conf. IEEE Infocom, pp.1-10, Barcelona, Spain, Apr., 2006.
  7. R. Ramanathan et al., "Prioritized Epidemic routing for opportunistic networks," in Proc. ACM MobiOpp, pp.62-66, Jun., 2007.
  8. T. Spyropoulos, K. Psounis, and C. Raghavendra, "Efficient routing in intermittently connected mobile networks: the multi-copy case," IEEE ACM Trans. Netw., pp.77-90, Feb., 2008.
  9. A. lindgren, A. Doria, and O. Schelen, "Probabilistic routing in intermittently connected networks," ACM SIGMOBILE Mobile Comp. and Commun. Review., Vol.7, No.3 pp.19-20, Jul., 2003. https://doi.org/10.1145/961268.961272
  10. J. Lebrun, C.-N. Chuah, D. Ghosal, and M. Zhang, "Knowledge-based opportunistic forwarding in vehicular wireless ad hoc networks," Proc. Int. Conf. IEEE Vehicular Technology, pp.2289-2293, Stockholm, Sweden, May, 2005.
  11. S. C. Nelson, M. Bakht, and R. Kravets, "Encounter-based routing in DTNs," Proc. Int. Conf. IEEE Computer Communications, pp.846-854, Rio de Janeiro, Brazil, April, 2009.
  12. K. Shin and D. Lee, "Fame-based probabilistic routing for delay-tolerant network," IEICE Trans. Commun., pp.1451-1458, 2010.
  13. T. Spyropoulos, K. Psounis, and C. S. Raghavendra, "Spray and Wait : an efficient routing scheme for intermittently connected mobile networks," in Proceedings of ACM Workshop on Delay Tolerant networking (WDTN), pp. 239-254, Aug., 2005.
  14. S. Lee and S. Lee, "Buffer management for Improving performance in WiMedia WLP-based mobile IP networks of ship area," J. KICS, Vol.40, No.06, pp.1208-1216, Jun., 2015. https://doi.org/10.7840/kics.2015.40.6.1208
  15. The ONE [Internet], http://www.netlab.tkk.fi/tutkimus/dtn/theone/