Buffer scheduling policy in DTN routing protocols

Lei Yin, Hui Mei Lu*, Yuan Da Cao, Jian Min Gao

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

9 Citations (Scopus)

Abstract

Delay Tolerant Networks are with intermittent connectivity, high latency and without end-to-end paths from the source to the destination. Message delivering in these networks is characterized by store-and-forward. So the sequence of message delivering and discarding is important to the performance of routing algorithms. However, there is little effort concentrating on buffer management optimization, which can effectively utilize the limited resource. In this paper, we employ optimal theory to propose a novel buffer management strategy named Optimal Buffer Management (OBM) to optimize the sequence of message forwarding and message discarding. In OBM strategy, globe optimization considering delivery ratio, delay, and overhead is adopt to improve the overall performance of routing algorithms. The simulation results also show that the OBM policy is much better than the existing ones in delivery ratio, delay, and overhead.

Original languageEnglish
Title of host publicationProceedings of the 2010 2nd International Conference on Future Computer and Communication, ICFCC 2010
PagesV2808-V2813
DOIs
Publication statusPublished - 2010
Event2010 2nd International Conference on Future Computer and Communication, ICFCC 2010 - Wuhan, China
Duration: 21 May 201024 May 2010

Publication series

NameProceedings of the 2010 2nd International Conference on Future Computer and Communication, ICFCC 2010
Volume2

Conference

Conference2010 2nd International Conference on Future Computer and Communication, ICFCC 2010
Country/TerritoryChina
CityWuhan
Period21/05/1024/05/10

Keywords

  • Buffer management
  • DTN
  • Optimal theory

Fingerprint

Dive into the research topics of 'Buffer scheduling policy in DTN routing protocols'. Together they form a unique fingerprint.

Cite this