Ad Hoc Network에서 라우팅 성능 향상을 위한 이웃 노드 정보를 이용한 적응성 경로 구성 전송 방식

Adaptive Query Flooding using Neighbor Information for Routing Performance Enhancement in Ad Hoc Networks

  • 발행 : 2004.12.01

초록

무선 이동통신이 실생활에 널리 보편화되면서, 무선 이동 기술은 휴대 무선 통신 장비에 대한 폭발적인 수요와 한께 통신 영역에서 중요한 역할을 담당할 것으로 보인다. 무선 이동통신 기술 중 특히 기존의 통신 인프라의 도움없이 임시적으로 무선 이동 노드들끼리 네트워크론 구성하는 mobile ad hoc network (MANET)이 최근에 주목을 받고 있다. 더욱이, ad hoc network의 특성을 고려할 때 효율적인 라우팅 프로토콜의 설계가 중요하다고 할 수 있다. 최근에는, 라우팅 프로토콜 중에서 on-demand 프로토콜이 낮은 라우팅 부하로 주목을 받고_ 있다. 그러나, on-demand 프로토콜은 경로 구성을 위해 경로 구성 패킷(query packet)을 broadcasting 하는 방식, 즉 flooding 방식, 을 사용하여 많은 수의 경로 구성 패킷을 발생시키는 문제점이 있다. 이러한 flooding 방식은 매우 비효율적이며 또한 broadcast storm문제를 발생시킨다. 본 논문에서는 broadcast storm 문제를 해결하기 위해 Dynamic Adaptation Query flooding Using Neighbor Topology(NT-DAQ) 방식을 제안판다. 경로 구성 과정에서, 각 이동 노드들은 이웃 노드들의 정보를 기초로 하여 경로 구성에 참여 여부를 결정하게 된다. 이러한 제안 방식은 경로 구성 패킷의 수를 최소화하여 네트워크 성능을 향상 시진 수 있으며, 또한 시험을 통해 제안한 방식의 효율성을 입증하였다.

As the wireless mobile communication is being widespread, mobile technologies will have important roles in the communication with the explosive growth of demanding for wireless portable devices. Among the mobile technologies, a great deal of interest has been taken in mobile ad hoc network (MANET), which is a collection of wireless mobile nodes forming a temporary network without the aid of stationary infrastructure in recent. Furthermore, considering characteristic of ad hoc networks, the design of efficient routing protocols is an important issue. In recent years, on-demand protocols among routing protocols have noticed because of the low routing overhead. However, on-demand protocols suffer from production of the enormous query Packets by broadcasting in order to setup routes, that is, a flooding scheme. The flooding scheme is very costly and results in serious problem, which we refer as the broadcast storm problem. In this paper, we propose a Dynamic Adaptation Query flooding Using Neighbor Topology (NT-DAQ) scheme, in order to resolve the broadcast storm Problem. When a route discovery is in progress, each mobile node decides on the basis of neighbor topology information whether discovery process participates or not. Therefore, our proposed scheme enables to improve network performance in which minimize the number of query rackets. We evaluate the efficiency of our proposed scheme through simulation.

키워드

참고문헌

  1. C.K Toh, 'Ad Hoc Mobile Wireless Networks: Protocols and Systems,' Prentice Hall PTR, New Jersey, 2002
  2. J. Macker and S. Corson, Mobile ad hoc networks (MANET), IETF Working Group Charter (2004), http://www.ietf.org/html.charters/manet-charter.html
  3. Charles E. Perkins, 'Ad Hoc Networking,' pp. 173-219, Addison Wesley, 2001
  4. E.M. Royer and C.-K. Toh, 'A review of Current Routing Protocols for Ad-Hoc Wireless Networks:' IEEE personal Communications, vol. 6, no.2, pp. 46-55, April 1999 https://doi.org/10.1109/98.760423
  5. Yunjung Yi and Mario Gerla, 'Efficient Flooding in Ad hoc Networks: a Comparative Performance Study,' UCLS Report
  6. J. Broch, D.B. Johnson, and D.A. Maltz, 'The Dynamic Source Routing Protocol for mobile Ad Hoc Networks.' Intemet Draft, draft-iett-manetdsr-09.txt, April 2003
  7. C.Perkins, E. Belding-Royer, S. Das, 'Ad hoc On-Demand Distance Vector (AODV) Routing,' IETF RFC 3561, http:/;/www.ietf.org/rfc/rfc356l.txt, July 2003
  8. C-K Toh, 'Associativity-Based Routing for Ad Hoc Mobile Networks:' Wireless Personal Communications' vol. 4, no. 2, pp. 103-139, March 1997 https://doi.org/10.1023/A:1008812928561
  9. Yu-Chce Tseng, Sze-Yao Ni, En-Yu Shih, 'Adaptive Approaches to Relieving Broadcast Storms in a Wireless Multihop Ad Hoc Network,' Infocom, 2001
  10. Sze- Yao Ni, Yu-Chee Tseng, Yuh-Shyan Chen, Jang- Ping Sheu, 'The broadcast Strom Problem in a Mobile Ad Hoc Network,' MobiCom '99 https://doi.org/10.1145/313451.313525
  11. Z. Hass and M. Pearlman, 'The Performance of Query Control Schemed for the Zone Routing Protocol,' Proceeding of ACM SIGCOMM' 98, pp. 167-177, September 1998 https://doi.org/10.1145/285243.285279
  12. Hakhu Lee and Sunshin An, 'Redundancy Path Routing Considering Associativity in Ad Hoc Networks,' Proceedings of the 30th KISS autumn conference, vol. 30, no. 2-3, pp. 199-201, October 2003
  13. Simon Haykin, 'Communication systems,' 4th Ed., pp. 521 - 522, John Wiley & Sons, 2001
  14. The CMU Monarch Project, The CMU Monarch Project's Wireless and Mobility Extensions to ns, CS Dept., Carnegie Mellon University, Aug. 1999, http://www .monarch.cs.cmu.edu/
  15. The VINT Project, The UCB/LBNL/VINT Network Simulator-ns (Version2), http//www.isi.edu/ nsnam/ns
  16. IEEE Std. 802.11-1999, 'Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications,' IEEE Std. 802. 11-1999, 1999
  17. S. C and J. M, 'Mobile Ad hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations,' IETF RFC 2501, http://www.ietf.org/rfc/rfc250l.txt, Jan. 1999
  18. Josh Broch, D.A., David B. J, Y -C. H, and J. Jetcheva, 'A Performance Comparison of MultiHop Wireless Ad Hoc Network Routing Protocols,' in Proc of MobiCom'98, October 25-30 https://doi.org/10.1145/288235.288256
  19. Samir R. Das, C.E. Perkins, and E.M. Royer, 'Performance Comparison of Two On-demand Routing Protocols for Ad Hoc Networks,' IEEE INFOCOM 2000, pp. 3-12, March 2000