MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks

Burgess, John; Gallagher, Brian; Jensen, David; Levine, Brian Neil

doi:10.1109/infocom.2006.228

Cited by 1,675 publications

(1,303 citation statements)

References 11 publications

Supporting

Mentioning

1,271

Contrasting

Unclassified

Order By: Relevance

“…In the following, we show an example of the discretized probabilistic contact generated from 55 days of contact traces in the UMassDieselNet trace [8,9], where we consider each From these figures, we can see that the discretized probabilistic contacts between two nodes in a realistic cyclic MobiSpace gather around only a few consecutive time slots, and the number of discretized probabilistic contacts is much smaller than the total number of time slots. Note that the choice of time slot size is a trade-off between the accuracy 1 of EMDs and the computation time.…”

Section: Discretized Probabilistic Contactmentioning

confidence: 99%

“…The orthogonality means that these optimizations can be added to all of our implemented algorithms and they are expected to provide an equal level of improvement in their routing performance. Such optimizations may include buffer management [8], global estimation of message delivery probability [19] and social centrality of the nodes [6], geometric information [20], etc. Similarly, we assume that an ideal mechanism serves to clear out buffers in the network of delivered data.…”

Section: Protocols In Comparisonmentioning

confidence: 99%

“…Before presenting our simulation method and results, we give a brief description of the UMassDieselNet [8,9] testbed and the traces collected on this testbed. We then describe how we pre-process these traces.…”

Section: Umassdieselnet Tracementioning

confidence: 99%

“…Gossip [4], forwards with probability p. Opportunistic routings, such as [5], forward based on the delivery probability. Different delivery probability metrics are proposed including encounter frequency [5], time elapsed since last encounter [8,18,19,23,24], social similarity [6], location similarity [25], geometric distance [20], etc.…”

Section: Related Workmentioning

confidence: 99%

“…In [26], several opportunistic routing algorithms are simulated in large realistic contact traces. A timely-contact probability metric is proposed in this paper which captures the contact frequency of mobile nodes and is similar to [5] and [8] in spirit.…”

Section: Related Workmentioning

confidence: 99%

See 4 more Smart Citations

Routing in a cyclic mobispace

Liu

2008

Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing

View full text Add to dashboard Cite

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.

show abstract

Section: Discretized Probabilistic Contactmentioning

confidence: 99%