论文信息 - Transitional approaches in DTN routing algorithm

Transitional approaches in DTN routing algorithm

We propose the routing algorithm which improves nonstandard parts in ProPhet while keeping its interoperability with the standard. Key idea is that contact duration is reflected for delivery predictability (DP) calculation, and bundle forwarding decision and sorting algorithm are optimized based on how many times each bundle is forwarded. Through the analysis, we show that the proposed DP calculation method is robust even in DP distortion environments, and increases the possibility to improve the performance of forwarding decision and sorting.

Young-Sun Kim | Byung-Tak Lee | Seung-Hun Oh | Seok-Kap Ko | Il-Kyun Park

[1] Anders Lindgren,et al. Probabilistic Routing in Intermittently Connected Networks , 2004, SAPIR.

[2] Anders Lindgren,et al. Probabilistic Routing Protocol for Intermittently Connected Networks , 2012, RFC.

[3] Johny Jose,et al. Routing Approaches in Delay Tolerant Networks: A Survey , 2010 .

[4] Brian Gallagher,et al. MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.