DMCA
TOUR: Time-sensitive Opportunistic Utility-based Routing in Delay Tolerant Networks
| Citations: | 4 - 0 self |
BibTeX
@MISC{Xiao_tour:time-sensitive,
author = {Mingjun Xiao and Jie Wu and Cong Liu and Liusheng Huang},
title = {TOUR: Time-sensitive Opportunistic Utility-based Routing in Delay Tolerant Networks},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract—In this paper, we propose a time-sensitive utility model for delay tolerant networks (DTNs), in which each message has an attached time-sensitive benefit that decays over time. The utility of a message is the benefit minus the transmission cost incurred by delivering the message. This model is analogous to the postal service in the real world, which inherently provides a good balance between delay and cost. Under this model, we propose a Time-sensitive Opportunistic Utility-based Routing (TOUR) algorithm. TOUR is a single-copy opportunistic routing algorithm, in which a time-sensitive forwarding set is maintained for each node by considering the probabilistic contacts in DTNs. By forwarding messages via nodes in these sets, TOUR can achieve the optimal expected utilities. We show the outstanding performance of TOUR through extensive simulations with several real DTN traces. To the best of our knowledge, TOUR is the first utility-based routing algorithm in DTNs. Index Terms—Delay tolerant networks, opportunistic routing, utility. I.
Keyphrases
time-sensitive opportunistic utility-based routing delay tolerant network probabilistic contact postal service good balance optimal expected utility several real dtn trace time-sensitive utility model time-sensitive benefit first utility-based routing algorithm transmission cost opportunistic routing outstanding performance index term delay tolerant network time-sensitive forwarding set single-copy opportunistic routing algorithm extensive simulation real world
