Name
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/INFCOM.2013.6567010 | INFOCOM |
Keywords | Field | DocType |
delay,tour algorithm,time-sensitive forwarding set,forwarding messages,single-copy opportunistic routing algorithm,delays,radio networks,delay tolerant networks,opportunistic routing,time-sensitive opportunistic utility-based routing algorithm,transmission cost,utility,time-sensitive benefit,postal services,telecommunication network routing,postal service,dtn,routing,nickel,exponential distribution,probabilistic logic,probability density function | Equal-cost multi-path routing,Link-state routing protocol,Dynamic Source Routing,Static routing,Policy-based routing,Computer science,Destination-Sequenced Distance Vector routing,Computer network,Routing table,Geographic routing,Distributed computing | Conference |
Volume | Issue | ISSN |
null | null | 0743-166X |
ISBN | Citations | PageRank |
978-1-4673-5944-3 | 26 | 0.82 |
References | Authors | |
10 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mingjun Xiao | 1 | 520 | 41.54 |
| Jie Wu | 2 | 8307 | 592.07 |
| Cong Liu | 3 | 586 | 30.47 |
| Liusheng Huang | 4 | 1082 | 123.52 |