Look-ahead routing and Message Scheduling in delay-tolerant networks

  • Authors:

  • Xian, Yi Xian;Huang, Chin-Tser Huang;Cobb, Jorge Cobb

  • Affiliations:

  • Dept. of Computer Science and Engineering University of South Carolina;Dept. of Computer Science and Engineering University of South Carolina;Department of Computer Science The University of Texas at Dallas

  • Venue:
  • LCN '10 Proceedings of the 2010 IEEE 35th Conference on Local Computer Networks
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Routing is one of the most challenging development issues in delay-tolerant networks (DTNs) because of lack of continuous connection. Existing routing schemes for DTNs provide best effort service, but are unable to optimize QoS and support message priority. In this paper, we present a Look-Ahead Routing and Message Scheduling approach (ALARMS) which exploits more accurate knowledge about various parameters regarding routing to achieve better QoS in the DTN. We assume a variation of the well-known ferry model, in which there are ferry nodes moving along pre-defined routes to exchange messages with the gateway node of each region on the route and also pass to the gateway nodes look-ahead routing information about when it will arrive at each gateway node on the route in the next two rounds and how long it will stay. The gateway nodes use this information to estimate the delivery delay of each message when being delivered by different ferries, and schedule the message to be delivered by the ferry which arrives earliest at the destination. Simulation results show that ALARMS outperforms three existing routing protocols: epidemic routing, spray-and-wait, and spray-and-focus, in terms of delay time, delivery ratio, and overhead. We also discuss three enhancement strategies on ALARMS and how ALARMS can support message priority.