期刊名称：International Journal of Engineering and Computer Science
印刷版ISSN：2319-7242
出版年度：2014
卷号：3
期号：8
页码：7699-7713
出版社：IJECS
摘要：In Delay Tolerant Networks (DTNs) the core challenge is to cope with lack of persistent connectivity andyet be able to deliver messages from source to destination. In particular, routing schemes that leveragerelays’ memory and mobility are a customary solution in order to improve message delivery delay. So whenlarge files need to be transferred from source to destination, not all packets may be available at the sourceprior to the first transmission. This motivates us to study general packet arrivals at the source, deriveperformance analysis of replication based routing policies and study their optimization under two hoprouting. Here we determine the conditions for optimality in terms of probability of succes sful delivery andmean delay and we devise optimal policies, so-called piecewise-threshold policies. We account for linearblock-codes and rate less random linear coding to efficiently generate redundancy, as well as for an energyconstraint in the optimization.
