DOI QR코드

DOI QR Code

Node Density Based Routing in Ad Hoc Networks

노드 밀집도 기반 애드학 라우팅

  • 김상경 (강릉대학교 정보전자공학부) ;
  • 최승식 (인천대학교 정보기술대학 컴퓨터공학과)
  • Published : 2005.08.01

Abstract

This paper proposes an on-demand ad hoc routing protocol, Node Density Based Routing (NDBR), which enhances the routing performance applying a new method to establish alternate patlis. It is important to reserve alternate paths for the route from source to destination in mobile ad hoc networks that are susceptible to failure due to the movement or the power exhaustion of mobile nodes. NDBR aims to establish a route that contains more alternate paths toward the destination by involving intermediate nodes with relatively more adjacent nodes in a possible route, and introduces a new routing criterion called 'node density.' This approach can localize the effects of route failures, and reduce control traffic overhead and route reconfiguration time by enhancing the reachability to the destination node without source-initiated route re-discoveries at route failures. This paper describes the route setup procedure using node density and the route re-configuration procedures employing alternate path information at the intermediate nodes. We show the performance of our routing schemes through a series of simulations using the Network Simulator 2 (ns-2).

본 논문은 새로운 대체경로 확보 방안을 통하여 라우팅 성능을 개선하는 요구형 애드학 라우팅 프로토콜인 Node Density Based Routing(NDBR)을 제안한다. 모바일 노드들의 이동이나 전력 고갈 등으로 인해 애드학 망의 연결은 장애를 일으킬 가능성이 매우 높기 때문에 발신지에서 목적지까지의 연결 설정 시 대체경로를 확보해 두는 것이 중요하다. NDBR은 목적지까지의 대체경로들을 확보하기 위해 상대적으로 더 많은 이웃 노드들을 갖는 중간 노드들로 구성되는 연결 설정을 목표로 하며 이를 위해 노드 밀집도라는 새로운 경로선택기준을 도입한다. NDBR은 경로 장애 발생 시 발신지에 의한 경로재탐색 절차 없이 목적지에 대한 도달성을 향상시킴으로써 경로장애의 영향을 국소화시키고, 제어 트래픽에 의한 오버헤드를 줄이며, 경로재설정 시간을 감소시킬 수 있다 본 논문에서는 노드 밀집도를 이용하여 대체경로를 포함하는 경로설정 절차와 경로 상의 중간 노드에서 대체경로 정보를 유지하여 활용하는 방법에 대해 기술하고 시뮬레이션을 통한 기존 프로토콜과의 비교를 통해 라우팅 성능이 개선됨을 보였다.

Keywords

References

  1. T. Camp, J. Boleng and V. Davies, 'A Survey of Mobility Models for Ad Hoc Network Research', Wireless Communications & Mobile Computing(WCMC), Special issue on Mobile Ad Hoc Networking: Research, Trends and Applications, 2(5), pp.483-502, 2002 https://doi.org/10.1002/wcm.72
  2. M. C. Domingo, D. Remondo and O. Leon, 'A Simple Routing Scheme for Improving Ad Hoc Network Survivability,' in Proc. IEEE GLOBCOM'03, pp.718-723, 2003 https://doi.org/10.1109/GLOCOM.2003.1258332
  3. S. Doshi, S. Bhandare and T. X Brown, 'An On-demand Minimum Energy Routing Protocol for a Wireless Ad Hoc Network', in Mobile Computing and Communications Review, Vol.6, No.3, pp.50-66, 2002 https://doi.org/10.1145/581291.581300
  4. Internet Engineering Task Force (IETF) Mobile Ad Hoc Networks (MANET) Working Group Charter. http://www.ietf.org/html.charters/manet-charter.html
  5. D. B. Jhonson, D. A. Maltz, and J. Broch, 'DSR: The Dynamic Source Routing Protocol for Multi-hop Whireless Ad Hoc Networks', Ad Hoc Networking, edited by C. E. Perkins, pp.139-172, Addison-Wesley, 2001
  6. Y-B KO and H. H. Vaidya, 'Location-Aided Routing (LAR) in Mobile Ad Hoc Networks', ACM/Baltzer Wireless Networks journal, Vol.6-4, pp.66-75, 2000 https://doi.org/10.1023/A:1019106118419
  7. S. Lee and M. Gerla, 'A Simulation Study of Table-Driven and On-Demand Routing Protocols for Mobile Ad Hoc Networks', IEEE Network, pp.48-54, 1999 https://doi.org/10.1109/65.777441
  8. S. Lee and M. Gerla, 'Split Multipath Routing with Maximally Disjoint Paths in Ad Hoc Networks', Technical Report, Computer Science Dept., UCLA, 2000
  9. J. Li and P. Mohapatra, 'LAKER: Location Aided Knowledge Extraction Routing for Mobile Ad Hoc Networks,' in Proc. IEEE WCNC 2003 https://doi.org/10.1109/WCNC.2003.1200538
  10. G. Malkin, 'RIP Version 2 - Carrying Additional Information,' Internet Draft, draft-ietf-ripv2-protool-v2-05.txt, (work in progress), 1998
  11. J. Moy, 'Link-State Routing', Routing in Communications Networks, edited by M.E. Steenstrup, Prentice Hall, pp.135-157, 1995
  12. A. Nasipuri and Samir R. Das, 'On-demand Multipath Routing for Mobile Ad Hoc Networks,' in Proc. of IEEE ICCCN'99, pp.64-70, 1999
  13. V. Park and S. Corson, Temporally-Ordered Routing Algorithm Version 1, Internet Draft, draft-ietf-man-et-tora-spec-04.txt, 2001, (work in progress)
  14. C. Perkins and P. Bhagwat, 'Highly dynamic destination-sequenced vector routing (DSDV) for mobile computers,' ACM SIGCOMM, 1994 https://doi.org/10.1145/190314.190336
  15. C. Perkins and E. Royer, 'Ad Hoc On-Demand Distance Vector Routing', Ad Hoc Networking, edited by C. E. Perkins, pp.174-201, Addison-Wesley, 2001
  16. The VlNT Project, The UCB/LBNL/VINT Network Simulator-ns (version2), http://www.isi.edu/nsnam/ns
  17. C-K Toh, 'Associativity-based routing for ad hoc mobile networks', Wireless Personal Communications, Vol.4, No.2, pp.1-36, 1997 https://doi.org/10.1023/A:1008812928561