The KIPS Transactions:PartC (정보처리학회논문지C)

Korea Information Processing Society (한국정보처리학회)
권호 표지
DOI QR코드

DOI QR Code

A Maximally Disjoint Multipath Routing Protocol Based on AODV in Mobile Ad Hoc Networks

모바일 애드혹 네트워크에서의 AODV 기반 치대 비중첩 다중경로 라우팅 프로토콜

  • 김중태 (조선대학교 전자계산학과) ;
  • 모상만 (조선대학교 인터넷공학부) ;
  • 정일용 (조선대학교 컴퓨터공학부)
  • Published : 2005.06.01
Download PDF
⟨ Previous Next ⟩

Abstract

A mobile ad hoc network (MANET) is a collection of mobile nodes without any fixed infrastructure or my form of centralized administration such as access points and base stations. The ad hoc on-demand distance vector routing (AODV) protocol is an on-demand routing protocol for MANETs, which is one of the Internet-Drafts submitted to the Internet engineering task force (IETF) MANET working group. This paper proposes a new multipath routing protocol called maximally disjoint multipath AODV (MDAODV), which exploits maximally node- and link-disjoint paths and outperforms the conventional multipath protocol based on AODV as well as the basic AODV protocol. The key idea is to extend only route request (RREQ) message by adding source routing information and to make the destination node select two paths from multiple RREQs received for a predetermined time period. Compared to the conventional multipath routing protocol, the proposed MDAODV provides more reliable and robust routing paths and higher performance. It also makes the destination node determine the maximally node- and link-disjoint paths, reducing the overhead incurred at intermediate nodes. Our extensive simulation study shows that the proposed MDAODV outperforms the conventional multipath routing protocol based on AODV in terms of packet delivery ratio and average end-to-end delay, and reduces routing overhead.

모바일 애드혹 네트워크(MANET)는 어떤 고정 기반구조나 중앙 집중형 관리 구조를 갖지 않는 모바일 노드의 집합으로 구성된다. AODV (Ad hoc On-demand Distance Vector routing)는 MANET용 온디맨드(on-demand) 라우팅 프로토콜로서, IETF (Internet Engineering Task Force)의 MANET 워킹 그룹에 제출된 기고문(Internet Draft)이다. 본 논문에서는 최대의 노드 비중첩 및 링크 비중첩을 제공하고, AODV 프로토콜은 물론 기존의 AODV 기반 다중경로 프로토콜보다 성능이 우수한 새로운 최대 비중첩 다중경로 AODV (MDAODV) 프로토콜을 제안한다. 본 연구의 핵심 아이디어는 경로 요청(RREQ:Route REQuest) 메시지에 소스 라우팅(source routing) 주소 정보를 추가시켜 확장하는 것과 수신 노드가 일정 시간 동안 도착한 다수의 RREQ를 조사하여 2개의 경로를 선택하는 것이다. 제안한 MDAODV 프로토콜은 기존 다중경로 라우팅 프로토콜에 비해 높은 신뢰성과 우수한 견고성을 갖는 경로를 제공할 뿐만 아니라, 수신 노드에서 경로를 결정하므로 중간 노드에서의 오버헤드를 감소시킨다. 성능평가 결과에 의하면, 제안한 MDAODV 프로토콜은 기존의 AODV 기반 다중경로 프로토콜보다 패킷 전달율과 평균 지연시간의 측면에서 성능이 우수한 반면 라우팅 오버헤드는 오히려 감소하는 경향을 나타낸다.

Keywords

References

  1. C. E.Perkins, Ad Hoc Networking, Addison Wesley, 2000
  2. Internet Engineering Task Force (IETF) Mobile Ad Hoc Networks(MANET) Working Group Charter, http://www.ietf.org/html.charters/manet-charter.html, 2004
  3. C. R. Lin and M. Gerla, 'Real-time Support in Multihop Wireless Networks,' Proc. of the ACM Wireless Networks, pp.125-135, Mar., 1999 https://doi.org/10.1023/A:1019182523928
  4. E. M. Royer and C. Tho, 'A Reivew of Currnet Routing Protocols for Ad Hoc Mobile Wireless Networks,' IEEE Personal Communications, pp.46-55. April, 1999
  5. M. Abolhasan, T. Whsocki, and E. Dutkiewicz, 'A Review of Routing Protocols for Mobile Ad Hoc Networks,' Ad Hoc Networks, Vol.2, pp.1-22, 2002 https://doi.org/10.1016/S1570-8705(03)00043-X
  6. C. E. Perkins and T. J. Watson, 'Highly Dynamic Destination Sequenced Distance Vector Routing (DSDV) for Mobile Computers,' Proc. of Int. Conf. on Communications Archi-tectures(ACM SIGCOMM'94), pp234-244, Oct., 1994 https://doi.org/10.1145/190314.190336
  7. C,-C. Chiang, 'Routing in Clustered Multihop Mobile Wireless Networks with Fading Channel,' Proc. of IEEE SICON, pp.197-211, April, 1997
  8. J. Broch, D. Johnson, and D. Maltz, 'The Dynamic Source Routing Protocol for Mobile Ad Hoc Netsork', Mobile Computing, pp.153-181, 1996
  9. D. Johnson, D. Maltz, J. Jetcheva, 'The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks,' Internet-Draft, draft-ietf-manet-dsr-07.txt, Feb., 2002
  10. C. E. Perkins, E. M. Royer, and S. R. Das, 'Ad Hoc On-Demand Distance Vector (AODV) Routing,' Internet-Draft, draft-ietf-manet-aodv-13.txt, Feb. 2003
  11. S. J. Lee and M. Gerla, 'AODV-BR: Backup Routing in Ad hoc Networks,' Proc. of the IEEE Wireless Communications and Networking Conference (WCNC 2000), Vol1, pp. 1311-1316, Sep., 2000 https://doi.org/10.1109/WCNC.2000.904822
  12. S.-J. Lee, E. M. Belding-Royer, and C. E. Perkins, 'Scalability Study of the Ad Hoc On-Demand Distance Vector Routing Protocol,' Int. Journal of Network Management, Vol.13, pp.97-114, 2003 https://doi.org/10.1002/nem.463
  13. T. Larsson and N. Hedman, 'Routing Protocols in Wireless Ad-Hoc Networks: A Simulation Study,' Master's thesis at Lulea University of Technology, Stockholm, pp.1402-1617, 1998
  14. Z. J. Hass and M. R Pearlman, 'Zone Routing Protocol for Ad-Hoc Network,' Internet Draft, draft-itef-manet-zrp-02.txt, Jul., 2002
  15. J. Chen, P. Druschel, and D. Subramanian, 'An Efficient Multipath Forwarding Method,' Proc. of the IEEE INFOCOM'98, pp.1418-1425, Mar., 1998 https://doi.org/10.1109/INFCOM.1998.662959
  16. I. Cidon, R. Rom, and Y. Shavitt, 'Analysis of Multi-Path Routing,' Proc. of the IEEE/ACM Transactions on Networking, Vol.7, No.6, pp.885-896, Dec., 1999 https://doi.org/10.1109/90.811453
  17. P. Johansson, T. Larsson, N. Hedman, B. Mielczarek, and M. Degermark, 'Scenario-based Performance Analysis of Routing Protocols for Mobile Ad-hoc Networks,' Proc. of the ACM/IEEE MOBICOM'99, pp195-206, Aug., 1999 https://doi.org/10.1145/313451.313535
  18. R. Krishnan and J.A. Silvester, 'Choice of Allocation Granularity in Multipath Source Routing Schemes,' Proc. of the IEEE INFOCIM'93, pp.32-329, Mar., 1993 https://doi.org/10.1109/INFCOM.1993.253345
  19. S. Murthy and J.J. Garcia-Luna-Aceves, 'Congestion-Oriented Shortest Multipath Routing,' Proc. of the IEEE INFOCOM'96, pp,1028-1036, Mar., 1996 https://doi.org/10.1109/INFCOM.1996.493045
  20. V.D. Park and M.S. Corson, 'A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks,' Proc. of the IEEE INFOCOM'97, pp.1405-1413, Apr., 1997 https://doi.org/10.1109/INFCOM.1997.631180
  21. S. Vutukury and J.J. Garcia-Luna-Aceves, 'An Algorithm for Multipath Computation Using Distance-Vectors with Predecessor Information,' Proc. of the IEEE ICCCN'99m pp. 534-539, Oct., 1999 https://doi.org/10.1109/ICCCN.1999.805570
  22. J. Raju and J.J. Garcia-Luna-Aceves, 'A New Approach to On-demand Loop-Free Multipath Routing,' Proc. of the ICCCN'99, pp.522-527, Oct., 1999 https://doi.org/10.1109/ICCCN.1999.805568
  23. W.T. Zaumen and J.J. Garcia-Luna-Aceves, 'Loop-Free Multipath Routing Using Generalized Diffusing Computations,' Proc. of the IEEE INFOCOM' 98, pp.1408-1417, Mar., 1998 https://doi.org/10.1109/INFCOM.1998.662958
  24. S.-J. Lee and M. Gerla, 'Split Multipath Routing with Maximally Disjoint Paths in Ad Hoc Networks,' Proc. IEEE Int. Conf. on Communications 2001 (ICC'01), pp.3201-3205, Jun., 2001 https://doi.org/10.1109/ICC.2001.937262
  25. R. Ogier, V. Rutenburg, and N. Shacham, 'Distributed Algorithms for Computing Shortest Pairs of Disjoint Paths,' Proc. of the IEEE Transactions on Information Theory, Vol.39, No.2, pp.443-455, Mar., 1993 https://doi.org/10.1109/18.212275
  26. D. Sidhu, R. Nair, and S. Abdallah, 'Finding Disjoint Paths in Networks,' Proc. of the ACM SIGCOMM'91, pp.43-51, Sep., 1991 https://doi.org/10.1145/115992.115998
  27. N. Taft-Plotkin, B. Bellur, and R. Ogier, 'Quality-of-Service Routing Using Maximally Disjoint Paths,' Proc. of the IEEE IWQoW'99, pp.119-128, Jun., 1999 https://doi.org/10.1109/IWQOS.1999.766485
  28. M. K. Marina and S. R. Das, 'On-Demand Multipath Distance Vector Routing for Ad Hoc Networks,' Proc. of the Int. Conf. on Network Protocols (ICNP), pp.14-23, Nov. 2001
  29. M. K. Marina and S. R. Das, 'Ad Hoc On-Demand Multipath Distance Vector Routing,' http://www.ececs.uc.edu.sdas, Technical Report, Computer Science Department, Stony Brook University, Apr., 2003
  30. Ad hoc On-demand Multipath Distance Vector (AOMDV) Routing , http://www.cs.sunysb.edu/~mahesh/aomdv/,2004
  31. The Network Simulator ns-02, http://www.isi,edu/nsnam/ns/,2004
  32. K. Fall and K. Varadhan, The ns Manual, The VINT Project UC Berkeley, LBL, USC/ISI, and Xerox PARC, Apr., 2002
  33. CMU Monarch Project, http://www.monarch.cs.cmu.edu/cmu-ns.html, 2004
  34. J. Broch, D. Maltz, D. Johnson, Y.-C. Hu, and J. Jetcheva, 'A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols,' Proc. of the 4th Annual Int. Conf. on Mobile Computing and Networking (MobiCom'98), pp.56-67, Oct., 1998