Browse > Article
http://dx.doi.org/10.6109/jkiice.2014.18.11.2771

Adaptive analysis of characteristic nodes using prediction method in DTN  

Dho, Yoon-Hyung (Department of Computer Engineering, Interdisciplinary Program in Creative Engineering Korea University of Technology and Education)
Jeon, Il-Kyu (Department of Computer Engineering, Interdisciplinary Program in Creative Engineering Korea University of Technology and Education)
Oh, Young-Jun (Department of Computer Engineering, Interdisciplinary Program in Creative Engineering Korea University of Technology and Education)
Lee, Kang-Whan (Department of Computer Engineering, Interdisciplinary Program in Creative Engineering Korea University of Technology and Education)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.18, no.11, 2014 , pp. 2771-2778 More about this Journal
Abstract
In this paper, we propose an algorithm that select efficient relay nodes using information of network environment and nodes. The proposed algorithm can be used changeable weight factors as following network environment in node density. The routing protocols adopting store-carry-forward method are used for solving network problems occurred by unstable end-to-end connection in Delay Tolerant Networks(DTNs). Exiting DTN routing algorithms have problems that large latency and overhead because of deficiency of network informations. The proposed algorithm could be provide a solution this problems using changeable weight factor and prediction of network environment. Thus, selected relay nodes work efficiently in unstable and stressed network environment. Simulation results show that enhancement performance as overhead, delivery ratio, average latency compared to exiting DTN routing algorithm.
Keywords
Delay Tolerant Network; Ad-hoc Network; Prediction-based routing; DTN routing;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Delay Tolerant Networking research group http://www.dtnorg.org
2 Z, Zhang, "Routing in Intermittently Connected Mobile Ad Hoc Networks and Delay Tolerant Network: Overview and Challenges." IEEE Communications Survey and Tutorial, pp. 24-37, jan. 2006.
3 T. Spyropoulos, K. Psounis, and C. S. Raghavendra, "Single-copy routing in intermittently connected mobile networks," In Proc. of IEEE Secon, Apr. 2004.
4 Huai-En Lian, Chien Chen, Je-Wei Chang, Chien-Chung Shen, Rong-Hong Jan, "Shortest Path Routing with Reliability Requirement in Delay Tolerant Networks," Future Information Networks, 2009. ICFIN 2009. First International Conference on, Oct. 2009.
5 A. Vahdat and D. Becker, "Epidemic Routing for Partially-connected Ad hoc Networks", Technical Report CS-2000-06, Duke University, 2000.
6 T. Spyropoulos, K. Psounis, and C. S. Raghavendra, "Spray and Wait : An Efficient Routing Scheme for Intermittently Connected Mobilie Networks", ACM Workshop on Delay Tolerant Networking, pp. 252-259, 2005.
7 Lindgren A, "Probabilistic Routing in Intermittently Connected Networks", ACM SIGMOBILE Mobile Computing and Communications Review, Vol. 7, no. 3, pp. 19-20, 2003.   DOI
8 T. Camp,J. Boleng,V. Davies, "A survey of mobility models for ad hoc network research", Wireless Communications & Mobile Computing 2 (5) (2002) 483-502, Special Issue on Mobile Ad Hoc Networking: Research, Trends and Applications.   DOI   ScienceOn
9 P. Hui, J. Crowcroft, and E. Yoneki. "Bubble rap: socialbased forwarding in delay tolerant networks", Proc. MobiHoc, pages 241-250, 2008.
10 P.-C. Cheng, K. C. Lee, M. Gerla, and J. Harri, "GeoDTN +Nav: Geographic DTN routing with navigator prediction for urban vehicular environments," Mobile Netw. Appl. vol. 15, no. 1, pp. 61-82, Feb. 2010.   DOI
11 Yue Cao, Zhili Sun, Naveed Ahmad, and Haitham Cruickshank, "A Mobility Vector Based Routing Algorithm for Delay Tolerant Networks Using History Geographic Information", 2012 IEEE Wireless Communications and Networking Conference: Mobile and Wireless Networks, 2012.