XOR network coding for data mule delay tolerant networks

Abstract

We propose a simple yet efficient scalable scheme for improving the performance of Delay Tolerant Networks (DTNs) with data mules by using XOR network coding. We carry out a theoretical analysis based on a model abstracted from the Village Communication Networks (VCNs), beginning with two villages and then extending to N villages. We also examine how the delivery probability is affected by the different overlapping intervals of two data mules. The theoretical analysis indicates that the maximum delivery probability increases by 50% and our simulation results illustrate this point, showing that the overhead ratio and average delay are reduced as well. Finally, our scheme is applied to a real network, the Toulouse public transportation network. We analyze the dataset, calculate the overlapping intervals of inter-vehicles and the amount of data that transit vehicles can exchange in one day, showing a 54.4% improvement in throughput.

An Efficient Content Delivery Infrastructure Leveraging the Public Transportation Network

“…However, it is still possible to apply the XOR scheme of COPE to pairwise communications crossing at a node of the network [13]. Exploiting this feature, we have demonstrated theoretically in previous works [20] that the maximum delivery probability could be increased of up to 50% in a village-to-village communication network.…”

“…This results into an extended contact duration between bus lines at end stations. We have shown in [20] that it is beneficiary to leverage such extended contact duration for exchanging data between the buses. Thus, in our architecture, we only deploy access points at the final stops of bus lines, and do not consider intermediary stops for such purpose.…”

“…It is possible to mitigate the unbalanced bandwidth demand by leveraging inter-session XOR network coding at stations as underlined in [20]. Main concept is represented in Figure 4.…”

“…In [20], a theoretical analysis has been conducted to derive an upper bound on the throughput gain such a XOR network coding strategy can offer for a realistic PTN. Main results are drafted to introduce the gains we can expect for the PTNs of Toulouse, Paris and Helsinki if they are leveraged for content delivery.…”