Abstract
In challenged networks, such as opportunistic networks or Delay Tolerant Networks (DTNs), due to frequent network partition an end-to-end connection between source and destination may not always be possible due to nodes move unpredictably with high speeds. For such type of networks, traditional routing protocols fails to transmit and also no guarantee on delivery of data to specified destination because these protocols deliver data definitely whenever there exists continuous end-to-end connectivity between source and destination over time. To provide efficient routing for such networks replication based routing schemes were proposed to achieve higher delivery probability. Unlike Internet protocols, Delay Tolerant Networks routing protocols follow store-carryforward mechanism to reduce packets dropping probability, tolerate delays and improve delivery performance in terms of delivery ratio and delivery latency. This paper defines the most efficient replication based routing protocols such as epidemic, PROPHET, spray and wait and Encounter based routing. This paper also explains how message TTL, buffer sizes and area of grid impact performance of replication based routing protocol in terms of delivery ratio and Average latency and overhead ratio.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
