On Multicopy Opportunistic Forwarding Protocols in Nondeterministic Delay Tolerant Networks

Delay Tolerant Networks (DTNs) are characterized by nondeterministic mobility and connectivity. Message routing in DTNs usually employs a multicopy forwarding scheme. To avoid the cost associated with flooding, much effort has been focused on opportunistic forwarding, which aims to reduce the cost of forwarding while retaining high routing performance by forwarding messages only to nodes that have high delivery probabilities. This paper presents two multicopy forwarding protocols, called optimal opportunistic forwarding (OOF) and OOF-, which maximize the expected delivery rate and minimize the expected delay, respectively, while requiring that the number of forwardings per message does not exceed a certain threshold. Our contributions in this paper are summarized as follows: We apply the optimal stopping rule in the multicopy opportunistic forwarding protocol. Specifically, we propose two optimal opportunistic forwarding metrics to maximize delivery probability and minimize delay, respectively, with a fixed number of copies and within a given time-to-live. We implement and evaluate OOF and OOF- as well as several other representative forwarding protocols, i.e., Epidemic, Spray-and-wait, MaxProp* and Delegation. We perform trace-driven simulations using both real and synthetic traces. Simulation results show that, in the traces where nodes have regular intermeeting times, the delivery rates of OOF and OOF- can be 30 percent greater than the compared routing protocols.