Abstract
Delay Tolerant Network (DTN) is an intermittently connected network where there is no complete path from source to destination for most of the time, and routing becomes one of the most challenging and open problems in DTN. To deal with this issue and avoid random and blindfold forwarding in Binary Spray and Wait (BSW) routing, we present the concept of CoN (Capability of Node), then propose the CoN-ASW routing algorithm, which uses the CoN to calculate the number of message copies to be forwarded and determine whether to forward messages to the encounter node. The simulation results show that the proposed algorithm can significantly improve the delivery utility while enhancing delivery rate and reduce the overhead.
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.
