Sciweavers

ICCS
2004
Springer
14 years 4 months ago
On Algorithm for All-Pairs Most Reliable Quickest Paths
Abstract. The reliability problem of the quickest path deals with the transmission of a message of sizeσ from a source to a destination with both the minimum end-to-end delay and ...
Young-Cheol Bang, Inki Hong, Hyunseung Choo
IWCMC
2006
ACM
14 years 5 months ago
Performance analysis of epidemic routing under contention
Epidemic routing has been proposed as a robust transmission scheme for sparse mobile ad hoc networks. Under the assumption of no contention, epidemic routing has the minimum end-t...
Apoorva Jindal, Konstantinos Psounis