Abstract
Due to network partitioning and intermittent connectivity, one of the most challenging problems in Delay-Tolerant Networks (DTNs) is routing. Namely, an efficient routing scheme should deliver messages properly to achieve a high performance, such as delivery ratio and delivery delay, etc. When considering bandwidth and storage constraints, the routing problem becomes more complicated. This paper investigates such routing problem in bandwidth and storage-constrained DTNs. We firstly formulate the problem of routing in constrained DTNs into multi-commodity dynamic flow problem and then propose our routing scheme based on classical algorithm, named as Optimal Global Routing (OGR). Our OGR is finally evaluated on publicly available data trace RollerNet against three other related protocols. The results show that OGR can achieve high performance on delivery ratio, delay and hop.
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.
