A density-aware routing scheme in delay tolerant networks

Chih Lin Hu, Bing Jung Hsieh

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

6 Scopus citations

Abstract

This paper designs a density-aware routing scheme for message delivery services in delay-tolerant networks that are characterized by tight constrains on intermittent connectivity, available storage and internode throughput in mobile ad hoc networks. This scheme includes inter-meeting time measure, node density estimation in proximity, boundary area detection, and message forwarding mechanisms. Mobile nodes can sense node density in their vicinities, and decide how to exchange messages with any encountered nodes during their movements. This scheme is scalable regardless of node population and need no extra localization facility. Simulation results show that the proposed scheme is simple and of less complexity, achieving comparable effects in terms of message delivery ratio and communication costs under nonuniform node distributions in delay-tolerant networks.

Original languageEnglish
Title of host publication27th Annual ACM Symposium on Applied Computing, SAC 2012
Pages563-568
Number of pages6
DOIs
StatePublished - 2012
Event27th Annual ACM Symposium on Applied Computing, SAC 2012 - Trento, Italy
Duration: 26 Mar 201230 Mar 2012

Publication series

NameProceedings of the ACM Symposium on Applied Computing

Conference

Conference27th Annual ACM Symposium on Applied Computing, SAC 2012
Country/TerritoryItaly
CityTrento
Period26/03/1230/03/12

Keywords

  • delay-tolerant network
  • mobile computing
  • routing

Fingerprint

Dive into the research topics of 'A density-aware routing scheme in delay tolerant networks'. Together they form a unique fingerprint.

Cite this