ABSTRACT:

Delay-tolerant spontanepous networks leverage the mobility of relay nodes to atone for lack of permanent connectivity and therefore enable communication between nodes that are out of range of every other. To decrease delivery delay, the data to be delivered is replicated in the network. Our objective during this paper is to review a category of replication mechanisms that embrace coding in order to enhance the probability of successful delivery at intervals a given point in time. We propose an analytical approach that enables to quantify tradeoffs between resources and performance measures (energy and delay). We have a tendency to study the effect of coding on the performance of the network whereas optimizing parameters that govern routing. Our results, based mostly on fluid approximations, are compared to simulations that validate the model