Sciweavers

Share
MOBIHOC
2008
ACM

Routing in a cyclic mobispace

9 years 1 months ago
Routing in a cyclic mobispace
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 r...
Cong Liu, Jie Wu
Added 24 Dec 2009
Updated 24 Dec 2009
Type Conference
Year 2008
Where MOBIHOC
Authors Cong Liu, Jie Wu
Comments (0)
books