Contact duration aware data replication in Delay Tolerant Networks

  • Authors:

  • Xuejun Zhuo;Qinghua Li;Wei Gao;Guohong Cao;Yiqi Dai

  • Affiliations:

  • Tsinghua National Laboratory for Information Science and Technology, Department of Computer Science and Technology, Tsinghua University, China;The Pennsylvania State University, USA;The Pennsylvania State University, USA;The Pennsylvania State University, USA;Tsinghua National Laboratory for Information Science and Technology, Department of Computer Science and Technology, Tsinghua University, China

  • Venue:
  • ICNP '11 Proceedings of the 2011 19th IEEE International Conference on Network Protocols
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

The recent popularization of hand-held mobile devices, such as smartphones, enables the inter-connectivity among mobile users without the support of Internet infrastructure. When mobile users move and contact each other opportunistically, they form a Delay Tolerant Network (DTN), which can be exploited to share data among them. Data replication is one of the common techniques for such data sharing. However, the unstable network topology and limited contact duration in DTNs make it difficult to directly apply traditional data replication schemes. Although there are a few existing studies on data replication in DTNs, they generally ignore the contact duration limits. In this paper, we recognize the deficiency of existing data replication schemes which treat the complete data item as the replication unit, and propose to replicate data at the packet level. We analytically formulate the contact duration aware data replication problem and give a centralized solution to better utilize the limited storage buffers and the contact opportunities. We further propose a practical contact Duration Aware Replication Algorithm (DARA) which operates in a fully distributed manner and reduces the computational complexity. Extensive simulations on both synthetic and realistic traces show that our distributed scheme achieves close-to-optimal performance, and outperforms other existing replication schemes.