Earticle

초록

영어

Even though long delay is permitted in Delay Tolerant Networks (DTNs), some applications explicitly demand an upper bound imposed on message delivery delay for the application specific purpose. Despite some researcher have proposed to meet new requirement, their approaches have weakness in the point of implementation since infinite buffer space on a node or the knowledge prior the moment regarding mobility and connectivity are assumed. To remove dependency on buffer and mobility pattern for bounded delay, we propose how to extend the epidemic routing protocol through delay estimation with inter meeting times record. Moreover, utility based forwarding to decide the adequate next hop while preserving an upper bound imposed on message delivery delay is introduced. Finally the simulation results will be given to prove the guarantee of delay bounded under the same simulation scenarios as comparative well-known protocol, RAPID. As the result, the proposed scheme shows the delivery in upper bound with less resource usages.

목차

Abstract
 1. Introduction
 2. Related Work
 3. System Model and Problem Statement
  3.1 Delay Bounded Routing Scheme
  3.2 Delay Estimation from Inter meeting Time Records
  3.3 Message Forwarding Policy
 4. Performance Evaluation
 5. Conclusions
 Acknowledgements
 References

키워드

저자

• Ali Abbas [ Department of informatics, Engineering Research Institute Gyeongsang National University, Jinju 660-701, Republic of Korea ]
• Ki-Il Kim [ Department of informatics, Engineering Research Institute Gyeongsang National University, Jinju 660-701, Republic of Korea ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Control and Automation

• 간기

  월간

• pISSN

  2005-4297

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605