An Adaptive Spray and Wait Routing Algorithm Based on Capability of Node in DTN

2014 
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.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    9
    References
    5
    Citations
    NaN
    KQI
    []