Browse > Article
http://dx.doi.org/10.9766/KIMST.2013.16.3.332

A Probabilistic Routing Mechanism Considering the Encounter Frequency in the Battlefield Environment  

Lee, Jongmok (Ajou University)
Kang, Kyungran (Ajou University)
Cho, Young-Jong (Ajou University)
Publication Information
Journal of the Korea Institute of Military Science and Technology / v.16, no.3, 2013 , pp. 332-339 More about this Journal
Abstract
The network nodes in a tactical network moves continuously and due to the physical and electronic obstacles, the connections are not always available. Due to the frequent disconnections, it is hard to discover the path among the nodes in a DTN. According to PROPHET(Probabilistic Routing Protocol using History of Encounters and Transitivity), one of the most well-known DTN routing protocols, a DTN node determines whom to forward a packet according to the packet delivery probability. From the viewpoint of a node, the packet delivery probability of another node is degraded while the nodes are disconnected whereas it is improved when they encounter. In this paper, we enhance the algorithm estimating the packet probability by considering the encounter count as an additional parameter. Our algorithm prefers the node that encounters the destination more frequently in selecting the next hop toward the destination. We evaluated the performance of our algorithm by simulating military operations using a DTN-dedicated simulator. Through the simulations, we show that our proposed algorithm achieve higher packet delivery ratio with similar overhead compared with PROPHET.
Keywords
PROPHET; Probabilistic Routing; Encounter Frequency; DTN; Tactical Network;
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
1 김영호, 엄종선, "미 육군 전술인터넷 개념과 시사점", 주간국방논단 제1108호(06-29), 2006.
2 김영안, "전장 환경에서 DTN을 이용한 정보전달 기법", 한국통신학회논문지, Vol. 36, No. 3, 2011.
3 Delay Tolerant Networking Research Group, http:// www.dtnrg.org
4 Luciana Pelusi, Andrea Passarella, and MarcoConti, "Opportunistic Networking : Data Forwarding in Disconnected Mobile Ad hoc Networks", IEEE Communications Magazine Issue on "Ad hoc and Sensor Networks", Vol. 44, No. 11, 2006.
5 Sushant Jain, Kevin Fall, Rabin Patra, "Routing in a Delay Tolerant Network", SIGCOMM 2004.
6 Evan P. C. Jones, Lily Li, Paul A. S. Ward, "Practical Routing in Delay-Tolerant Networks", WDTN 2005.
7 Tara Small et al., "Probabilistic Routing in Intermittently Connected Networks", SIGCOMM'05 Workshops, 2005.
8 A. Vahdat and D. Becker, "Epidemic Routing for Partially-connected Ad hoc Networks", Technical Report CS-2000-06, Duke University, 2000.
9 Thrasyvoulos Spyropoulos, Konstantinos Psounis, Cauligi S. Raghavendra, "Spray and wait : An Efficient Routing Scheme for Intermittently Connected Mobile Networks", SIGCOMM 2005.
10 Lindgren A, "Probabilistic Routing in Intermittently Connected Networks", ACM SIGMOBILE Mobile Computing and Communications Review, Vol. 7, No. 3, pp. 19-20, 2003.   DOI
11 Amin Vahdat, "Epidemic Routing for Partially Connected Ad hoc Networks", Technical Report CS-200006, Duke University, 2000.
12 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.
13 장덕현, 심윤보, 김길수, 최낙중, 류지호, 권태경, 최양희, "이동성 정보를 이용한 DTN 네트워크 라우팅 프로토콜", 정보과학회 정보통신, 제36권, 제2호, pp. 130-136, 2009.
14 소상호, 박만규, 박세철, 이재용, 김병철, 김대영, 신민수, 장대익, 이호진, "이동 노드의 이동 패턴을 고려한 Delay Tolerant Network 라우팅 알고리즘", 대한전자공학회 논문지, 제46권 TC편, 제4 호, pp. 13-28, 2009.   과학기술학회마을