Location of Repository

Look-Ahead Routing and Message Scheduling in Delay-Tolerant Networks

By Yi Xian, Chin-tser Huang and Jorge Cobb

Abstract

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

Topics: Look-Ahead Routing, Message Scheduling
Year: 2011
OAI identifier: oai:CiteSeerX.psu:10.1.1.185.1449
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cse.sc.edu/%7Ehuang... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.