Forward Correction and Fountain Codes in Delay-Tolerant Networks
Delay-tolerant ad hoc networks 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 delivery delay, the information to be delivered is replicated in the network. The authors' objective in this paper is to study a class of replication mechanisms that include coding in order to improve the probability of successful delivery within a given time limit. They propose an analytical approach that allows to quantify tradeoffs between resources and performance measures (energy and delay). They study the effect of coding on the performance of the network while optimizing parameters that govern routing. Their results, based on fluid approximations, are compared to simulations that validate the model.