Dynamic control of Coding in Delay Tolerant Networks

TL;DR

This paper investigates how dynamic coding strategies, including Reed-Solomon and network coding, can optimize message delivery success in Delay Tolerant Networks by analyzing and adjusting routing parameters.

Contribution

It introduces an analytical model for evaluating coding-based replication mechanisms and explores their impact on network performance in DTNs.

Findings

Coding improves delivery probability within time constraints.

Optimized routing parameters enhance network efficiency.

Reed-Solomon and network coding outperform simple replication.

Abstract

Delay tolerant Networks (DTNs) leverage the mobility of relay nodes to compensate for lack of permanent connectivity and thus enable communication between nodes that are out of range of each other. To decrease message delivery delay, the information to be transmitted is replicated in the network. We study replication mechanisms that include Reed-Solomon type codes as well as network coding in order to improve the probability of successful delivery within a given time limit. We propose an analytical approach that allows us to compute the probability of successful delivery. We study the effect of coding on the performance of the network while optimizing parameters that govern routing.