Research ArticleOpen AccessGoogle Scholar indexed
A Motion and Counting Based-Routing Algorithm for Delay Tolerant Network
School of Information and Electronics Beijing Institute of Technology, Beijing, China
School of Information and Electronics Beijing Institute of Technology, Beijing, China
School of Information and Electronics Beijing Institute of Technology, Beijing, China
School of Information and Electronics Beijing Institute of Technology, Beijing, China
- 1 School of Information and Electronics Beijing Institute of Technology, Beijing, China
- 2 School of Information and Electronics Beijing Institute of Technology, Beijing, China
- 3 School of Information and Electronics Beijing Institute of Technology, Beijing, China
- 4 School of Information and Electronics Beijing Institute of Technology, Beijing, China
International Journal of Communications, Network and System Sciences·Volume 10 (2017)·Pages 14–23·Published 26 May 2017·DOI10.4236/ijcns.2017.105B002
Copy link · social · email
Abstract
Considering the characteristics of Vehicular Ad-hoc Network (VANET), we here propose a Delay-Tolerant Networks (DTN) routing algorithm called Motion and Counting Based-Spray and Seek Routing algorithm (MNCBSS). This algorithm is based upon Spray and Wait Router and describes the method of optimization and specific procedures of the algorithm. Whereafter we perform the simulation over several classic DTN routing algorithms and MNCBSS algorithm, compare the routing algorithms by sketching the statistics and then give the analysis of the different performance of each scheme and eventually demonstrate effectiveness and reliability of the MNCBSS algorithm.
KeywordsDTNRoutingOptimizationMotionCounting
- Fall, K. (2003) A Delay-Tolerant Network Architecture for Challenged Internets. Proc of ACM SIG- COMM’03, New York, 27-34. https://doi.org/10.1145/863955.863960
- Jain, S., Fall, K. and Patra, R. (2004) Routing in a Delay Tolerant Network. ACM SIGCOMM, 34, 145-158. https://doi.org/10.1145/1030194.1015484
- Wang, Z., Wang, X.H. and Sui, J.Q. (2012) Extending Research for ONE Simulator of Opportunistic Network. Application Research of Computers, 29, 272-277.
- Vahdat, A. and Becker, D. (2000) Epidemic Routing for Partially-Connected Ad Hoc Networks. Technical Report CS-2000-06, Duke Univer-sity.
- Lindgren, A., Doria, A. and Schelén, O. (2003) Probabilistic Routing in Intermittently Connected Networks. SIGMOBlLE Mobile Computing Communications Review, 7, 19-20. https://doi.org/10.1145/961268.961272
- Zhang, F. (2011) Research on MAC Protocol for Vehicular Ad Hoc Network. Beijing University of Posts and Telecommunications, Beijing.
- Hossmann, T. (2010) Know Thy Neighbor: Towards Optimal Mapping of Contacts to Social Graphs for DTN Routing. INFOCOM IEEE.
- Spyropoulos, T., Psounis, K. and Raghavendra, C.S. (2008) Efficient Routing in Intermittently Connected Mobile Net-works: The Multiple-Copy Case. IEEE/ ACM Trans. on Network, 16, 77-90. https://doi.org/10.1109/TNET.2007.897964