Validation of Fuzzy-Based Routing Algorithm for DTN

Article Preview

Abstract:

In the research of Delay Tolerant Network (DTN), DTN routing algorithm is a key research issue. The performance of a non-flooding routing algorithm is verified in our paper. The verified algorithm is an Adaptive Priority Routing Algorithm (APRA) which is based on fuzzy strategies. Firstly, we introduce the principle of APRA, then using Opportunistic Network Environment (ONE) -simulation software to compare the performance of Epidemic algorithm, Spray and Wait algorithm, PRoPHET algorithm and APRA. By comparing overhead of netword, rate of messages delivered and average dealy, it finds that the APRA performs better. At last, the weaknesses of this paper and further improvement are also discussed.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1931-1934

Citation:

Online since:

September 2014

Export:

Price:

* - Corresponding Author

[1] Fall K. A delay-tolerant network architecture for challenged internets [C]/Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications. ACM, 2003: 27-34.

DOI: 10.1145/863955.863960

Google Scholar

[2] Wang Xiang. Study on routing in delay tolerant network [D]. Journal of Chongqing University of Posts and Telecommunications, (2010).

Google Scholar

[3] Hu Si-quan, Wang Hong-bing, Wang Jun-feng. Opportunistic network research [J]. Computer science, 2009, 36(10): 32-37.

Google Scholar

[4] Tang L, Zheng Q, Liu J, et al. SMART: A selective controlled-flooding routing for delay tolerant networks[C]/Broadband Communications, Networks and Systems, 2007. BROADNETS 2007. Fourth International Conference on. IEEE, 2007: 356-365.

DOI: 10.1109/broadnets.2007.4550455

Google Scholar

[5] Kalantari M, La R J. A DTN packet forwarding scheme inspired by thermodynamics[C]/CISS. 2008: 1216-1221.

DOI: 10.1109/ciss.2008.4558704

Google Scholar

[6] Sun Jian-zhi, Zhang Ying-xin, Chen Dan, et al. Epidemic routing algorithm with backoff mechanism [J]. Computer engineering and science, 2013, 35(3): 66-71.

Google Scholar

[7] Spyropoulos T, Psounis K, Raghavendra C S. Spray and wait: an efficient routing scheme for intermittently connected mobile networks[C]/Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking. ACM, 2005: 252-259.

DOI: 10.1145/1080139.1080143

Google Scholar

[8] Lindgren A, Doria A, Schelén O. Probabilistic routing in intermittently connected networks[J]. ACM SIGMOBILE mobile computing and communications review, 2003, 7(3): 19-20.

DOI: 10.1145/961268.961272

Google Scholar