Spread and Erase: Efficient Routing Algorithm Based on Anti-Message Info Relay Hubs for Delay Tolerant Networks

摘要: Absence of end-to-end connectivity nodes in Delay Tolerant Networks (DTNs) posses a challenge towards designing an efficient routing protocol for these networks. In DTNs with having unlimited buffer sizes, Epidemic [16] provides optimal solution terms message delivery ratio and latency but it suffers disadvantage large overhead ratio. Vaccination system (EVS) proposed by [18] improves the problem epidemic immunizing from duplicate copies. We compared EVS other techniques where multiple sources communicating single destination observed that performs better. this paper we propose algorithm further minimizes both latency. DTNs, special called Message Ferry Data Mule have been to carry data source node node. anti-message Info relay hub erase copies instead routing. compare our social grouping based [2] as well non-social scenarios show using simulation results ‘Spread Erase hubs’ outperforms scenarios.