A named data approach for DTN routing
Y Li, Y Li, L Wolf, A Lingren, J Wang - 2017 wireless days, 2017 - ieeexplore.ieee.org
Y Li, Y Li, L Wolf, A Lingren, J Wang
2017 wireless days, 2017•ieeexplore.ieee.orgMany common DTN routing protocols are replication-based, which have relatively good
performance in terms of message delivery ratio but high overhead, and leave the issue of
garbage collection open. In this paper, we propose Named Data Distance Routing (NDDR),
a named data based DTN routing approach which makes routing decisions for named data
based on topological distance information. This helps to reduce the overhead of routing. We
have implemented NDDR in the ONE simulation environment and the simulation results …
performance in terms of message delivery ratio but high overhead, and leave the issue of
garbage collection open. In this paper, we propose Named Data Distance Routing (NDDR),
a named data based DTN routing approach which makes routing decisions for named data
based on topological distance information. This helps to reduce the overhead of routing. We
have implemented NDDR in the ONE simulation environment and the simulation results …
Many common DTN routing protocols are replication-based, which have relatively good performance in terms of message delivery ratio but high overhead, and leave the issue of garbage collection open. In this paper, we propose Named Data Distance Routing (NDDR), a named data based DTN routing approach which makes routing decisions for named data based on topological distance information. This helps to reduce the overhead of routing. We have implemented NDDR in the ONE simulation environment and the simulation results show that the proposed routing method has better performance in terms of message delivery ratio and network overhead compared with several typical replication-based DTN routing protocols.
ieeexplore.ieee.org
Showing the best result for this search. See all results