E-Scheme in Delay-Tolerant Networks

  • Authors:
  • Zhi-Ting Lin;Yu-Gui Qu;Qing-Hua Wang;Bao-Hua Zhao

  • Affiliations:
  • Dept. of Electronic Engineering and Information Science, University of Science and Technology of China, Anhui, China;Dept. of Electronic Engineering and Information Science, University of Science and Technology of China, Anhui, China;Dept. of Electronic Engineering and Information Science, University of Science and Technology of China, Anhui, China;Dept. of Computer Science, University of Science and Technology of China, Anhui, China and State Key Laboratory of Networking and Switching Technology, Beijing,

  • Venue:
  • APNOMS '08 Proceedings of the 11th Asia-Pacific Symposium on Network Operations and Management: Challenges for Next Generation Network Operations and Service Management
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Delay Tolerant Networks (DTNs) are characterized by very long delay paths and frequent network partitions. In this paper, a novel E-Scheme is proposed which can be utilized by most of the existing routing approaches that employ the `probability to deliver' metric. Providing there are n opportunities, the E-Scheme is to let the first (n茂戮驴 1)/eopportunities go by (except for encountering the destination of messages) and then accept the first one to appear that is better than all of those. Meanwhile a probabilistic metric, called Two-Hop (TH) delivery predictability value, is presented here according to the small world theory. Our scheme has been evaluated using some existing approaches as well as the TH delivery predictability value and been shown to exhibit excellent performances.