Scalable Schedule Routing and Minimizing Delay in Tolerant Networks

Journal Title: IOSR Journals (IOSR Journal of Computer Engineering) - Year 2014, Vol 16, Issue 1

Abstract

 There are many routing strategies for message delivery in Delay Tolerant Networks. Among them Multicopying routing strategies have been considered the most applicable DTNs. Epidemic routing and two-hop forwarding routing are the two best approaches of DTN. These two approaches belong to multicopying routing strategies as they allow multiple message replicas to increase message delivery delay. This is an advantage, but it might cause expense of additional buffer space and bandwidth overhead. Hence the message scheduling strategy should determine which messages should be dropped in case if buffer is full. Thus, this work deals with a new message scheduling framework for epidemic and two hop forwarding routing in DTNs, such that the decision for forwarding/dropping can be made at a node during each contact for either optimal message delivery ratio or message delivery delay. Extensive simulation results show that this message scheduling framework can achieve better performance.

Authors and Affiliations

Dhanasekaran. P

Keywords

Related Articles

 Client Based System on Wireless Sensor Network for Efficient Packet Transmission

Abstract : Wireless sensor networks are vulnerable to the node distributor dividend, and several distributed protocols has been transfer the data in secure .Where MD5 algorithm that implements adaptive TTL, piggybacking,...

 Comparison of Different Genetic Crossover operators fortravelling salesman problem

 Abstract: The travelling salesman problem (TSP) is the most well-known combinatorial optimization problem. TSP is used to find a routing of a salesman who starts from a home location, visits a prescribed set of cit...

 Occlusion detection in video sequences

Abstract: An occlusion is the region between two overlapping objects with disparate motion. Detecting these occluded objects is crucial for many of the video processing. The Occlusion detection is decomposed into two ind...

 Studying the Performance of a Local Area Network through a Statistical Results of a Simulation Program

 The ring topology was selected among several topologies,since in the ring topology easy to isolate faults and it has good performs under heavy network load, but the most problem that face in the ring topology is th...

An Approach To Sentiment Analysis Using Lexicons With Comparative Analysis of Different Techniques

Abstract : The World Wide Web is growing at an astonishing rate. This has resulted in enormous increase in online communication. The online communication data consist of feedback, comments and reviews that are posted on...

Download PDF file
  • EP ID EP115662
  • DOI -
  • Views 108
  • Downloads 0

How To Cite

Dhanasekaran. P (2014).  Scalable Schedule Routing and Minimizing Delay in Tolerant Networks. IOSR Journals (IOSR Journal of Computer Engineering), 16(1), 12-15. https://europub.co.uk/articles/-A-115662