Abstrait

Optimal Transmission and Scheduling in Delay Tolerant Network

C.Bhanu Prakash, K.sireesha K.Suma Latha

Delay-tolerant networking (DTN) is an approach to computer network architecture that seeks to address the technical issues in heterogeneous networks that may lack continuous network connectivity. Generally in networks the ability to transport, or route, data from a source to a destination is a fundamental ability all communication networks must have. Delay and disruption-tolerant networks (DTNs) are characterized by their lack of connectivity, resulting in a lack of instantaneous end-to-end paths. In this challenging environment we are able to effectively forward the packets from source to destination. When we need to transfer a large file from source to destination then here we are making all these packets available at source and then transfer as small packets. We are analyzing the performance of packets arriving at the source and then considering the linear blocks and rate less random linear coding to efficiently generate the redundancy as well as the energy constraint in the optimization. And then these small packets of large file are forward through the multiple paths to destination by using optimal user centric allocation and scheduling the packets at receiver side. We determine the conditions for optimality in terms of probability of successful delivery and mean delay and we devise optimal policies, so-called piecewise-threshold policies. We numerically assess the higher efficiency of piecewise-threshold policies compared with other policies by developing heuristic optimization of the thresholds for all flavours of coding considered.