Name
Abstract | ||
|---|---|---|
Due to uncertainty in nodal mobility, DTN routing usually employs multi-copy forwarding schemes. To avoid the cost associated with flooding, much effort has been focused on probabilistic forwarding, which aims to reduce the cost of forwarding while retaining a high performance rate by forwarding messages only to nodes that have high delivery probabilities. This paper aims to provide an optimal forwarding protocol which maximizes the expected delivery rate while satisfying a certain constant on the number of forwardings per message. In our proposed optimal probabilistic forwarding (OPF) protocol, we use an optimal probabilistic forwarding metric derived by modeling each forwarding as an optimal stopping rule problem. We also present several extensions to allow OPF to use only partial routing information and work with other probabilistic forwarding schemes such as ticket-based forwarding. We implement OPF and several other protocols and perform trace-driven simulations. Simulation results show that the delivery rate of OPF is only 5% lower than epidemic, and 20% greater than the state-of-the-art delegation forwarding while generating 5% more copies and 5% longer delay. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1145/1530748.1530763 | MobiHoc |
Keywords | Field | DocType |
probabilistic forwarding,state-of-the-art delegation forwarding,optimal probabilistic forwarding protocolin,optimal forwarding protocol,delay tolerant network,multi-copy forwarding scheme,probabilistic forwarding scheme,proposed optimal probabilistic forwarding,delivery rate,ticket-based forwarding,forwarding message,optimal probabilistic forwarding,optimal stopping,routing,satisfiability | Computer science,Computer network,Performance rate,Probabilistic logic,Routing table,IP forwarding,Delegation,Optimal stopping rule,Distributed computing | Conference |
Citations | PageRank | References |
129 | 3.92 | 15 |
Authors | ||
2 | ||