DMCA
Routing in a Cyclic MobiSpace (2008)
Cached
Download Links
| Venue: | MOBIHOC'08 |
| Citations: | 32 - 6 self |
BibTeX
@MISC{Liu08routingin,
author = {Cong Liu and Jie Wu},
title = { Routing in a Cyclic MobiSpace },
year = {2008}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
A key challenge of routing in delay tolerant networks (DTNs) is to find routes that have high delivery rates and low endto-end delays. When oracles are not available for future connectivity, opportunistic routing is preferred in DTNs, in which messages are forwarded to nodes with higher delivery probabilities. We observe that real objects have repetitive motions, but no prior research work has investigated the cyclic delivery probability of messages between nodes. In this paper, we propose to use the expected minimum delay (EMD) as a new delivery probability metric in DTNs with repetitive but non-deterministic mobility. Specifically, we model the network as a probabilistic time-space graph with historical contact information or prior knowledge about the network. We then translate it into a probabilistic state-space graph in which the time dimension is removed. Finally, we apply the Markov decision process to derive the EMDs of the messages at particular times. Our proposed EMD-based routing protocol, called routing in cyclic MobiSpace (RCM), outperforms several existing opportunistic routing protocols when simulated using both real and synthetic traces.
Keyphrases
cyclic mobispace repetitive motion particular time probabilistic state-space graph cyclic delivery probability high delivery rate synthetic trace time dimension delay tolerant network non-deterministic mobility real object low endto-end delay key challenge opportunistic routing opportunistic routing protocol prior knowledge markov decision process delivery probability probabilistic time-space graph prior research work expected minimum delay historical contact information new delivery probability future connectivity
