Enhanced delegation forwarding in delay tolerant networks

Abstract

Delay tolerant network (DTN) is a sparse wireless mobile network that does not guarantee a path between a source and a destination at any time. In DTN, one critical issue is to reliably deliver data with low latency. In an N-node network, naive forwarding approaches such as flooding and its derivatives make the routing cost very high (). Recently, an approach called delegation forwarding (DF) caught significant attention in the research community because it reduces the cost to while maintaining good performance. In this paper, we enhance the DF algorithm by proposing a probability delegation forwarding (PDF) that further reduces the cost to and a threshold-based probability delegation forwarding (TPDF) that closes the latency gap between DF and PDF. Simulation results show that both PDF and TPDF can achieve similar delivery ratio as DF at a lower cost if p is not too small.

Keywords:

• delay tolerant networks
• forwarding algorithms
• routing
• traces

Acknowledgement

This research was supported in part by NSF grants CNS 0835834, CNS 0531410 and CNS 0626240.