DTMNs를 위한 방향성 정보와 최대 공동 이웃 노드에 기반한 효율적인 라우팅 프로토콜
An Efficient Routing Algorithm Based on the Largest Common Neighbor and Direction Information for DTMNs
0
조회
0
다운로드
2
인용
0
참고문헌
키워드
초록
DTNs (Delay Tolerant Networks) refer to the networks that can support data transmission in the extreme networking situations such as continuous delay and no connectivity between ends. DTMNs (Delay Tolerant Networks) are a specific range of DTNs, and its chief considerations in the process of message delivery in the routing protocol are the transmission delay,improvement of reliability, and reduction of network loading. This article proposes a new LCN (Largest Common Neighbor) routing algorism to improve Spray and Wait routing protocol that prevents the generation of unnecessary packets in a network by letting mobile nodes limit the number of copies of their messages to all nodes to L. Since higher L is distributed to nodes with directivity to the destination node and the maximum number of common neighbor nodes among the mobile nodes based on the directivity information of each node and the maximum number of common neighbor nodes, more efficient node transmission can be realized. In order to verify this proposed algorism, DTN simulator was designed by using ONE simulator. According to the result of this simulation, the suggested algorism can reduce average delay and unnecessary message generation.
Abstract
DTNs (Delay Tolerant Networks) refer to the networks that can support data transmission in the extreme networking situations such as continuous delay and no connectivity between ends. DTMNs (Delay Tolerant Networks) are a specific range of DTNs, and its chief considerations in the process of message delivery in the routing protocol are the transmission delay,improvement of reliability, and reduction of network loading. This article proposes a new LCN (Largest Common Neighbor) routing algorism to improve Spray and Wait routing protocol that prevents the generation of unnecessary packets in a network by letting mobile nodes limit the number of copies of their messages to all nodes to L. Since higher L is distributed to nodes with directivity to the destination node and the maximum number of common neighbor nodes among the mobile nodes based on the directivity information of each node and the maximum number of common neighbor nodes, more efficient node transmission can be realized. In order to verify this proposed algorism, DTN simulator was designed by using ONE simulator. According to the result of this simulation, the suggested algorism can reduce average delay and unnecessary message generation.
참고문헌 (9)
- 장덕현, "이동성 정보를 이용한 DTN네트워크 라우팅 프로토콜", 정보과학회논문지 : 정보통신, 36(2), pp.130~136 (2009), 한국정보과학회
- "A Delay-Tolerant Networking Research Group"[URL]
- 박용덕, "방위 변화정보를 이용한 DTN 네트워크 라우팅 프로토콜 향상 기법", 한국통신학회추계학술 발표회 (2008)
- 소상호, "이동 노드의 이동 패턴을 고려한Delay Tolerant Network 라우팅 알고리즘", 전자공학회논문지 - TC, 46(4), pp.13~28 (2009), 대한전자공학회
- K. Harras, "Transport Layer Issues in Delay Tolerant Mobile Networks", IFIP Networking Conference (2006)
- Epidemic Routing for Paritally-Connected Ad Hoc Networks, "A. Vahdat", Duke University, ~, pp.CS-2000-06 (2000)
- Thrasyvoulos Spyropoulos, "Spray and wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks", SIGCOMM, ~ (2005)
- "The Opportunistic Network Enviornment simulator"[URL]
- Ari Keranen, "The ONE Simulator for DTN Protocol Evaluation", SIMUTools'09, 2nd International Conference on Simulation Tools and Techniques (2009)