Journal of KIISE:Information Networking (한국정보과학회논문지:정보통신)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

Proximity-based Overlay Network Routing for Service Discovery in Mobile Ad-Hoc Network

이동 애드혹 망에서의 서비스 검색을 위한 근접성 기반 오버레이 네트워크 라우팅

  • 윤현주 (한국과학기술원 전자전산학과) ;
  • 이은주 (삼성전자 정보통신총괄 무선사업부) ;
  • 정현구 (한국과학기술원 전자전산학과) ;
  • 김진수 (한국과학기술원 전자전산학과)
  • Published : 2004.12.01
Download PDF
⟨ Previous Next ⟩

Abstract

Mobile ad hoc networks(MANET) have recently attrarted a lot of attention in the research community as well as in industry. Although the previous research mainly focused on the various problems of MANET in data link and network layers, we consider, in this paper, how to efficiently support applications such as service discovery on top of MANET. Peer-to-Peer(P2P) overlay network can be adopted to service discovery mechanism because P2P and MANET share certain similarities, primarily the fact that both arc instances of self-organizing decentralized systems. Especially, distributed hash table(DHT) systems used for r2r overlay network can be effective in reducing the communication overhead in service discovery. However, since overlay network is independent of physical network topology and existing topology-aware mechanisms are based on the wired network, they are inefficient in MANET. We propose a proximity-based overlay network routing to overcome the inefficiency of routing in overlay network. In the proximity-based overlay network routing, each node collects information of physically close nodes by using one hop broadcast and routes messages to the logically closest node to destination. In a detailed ns-2 simulation study, we show that the proximity-based overlay network routing reduces the number of physical hops comparable to the flooding-based mechanism with low communication overhead. We also find that the proposed scheme works well in the mobile environment.

최근 산업 및 연구 단체에서 이동 애드혹 망에 대한 관심이 높아지고 있다. 지금까지의 연구들은 하위 계층에 초점을 맞추고 있었던 것에 반해, 본 논문에서는 이틀 연구의 결과로 형성된 이동 애드혹망을 실제로 이용하기 위한 응용의 하나로 효율적인 서비스 검색 방법을 제시한다. 통신 오버헤드 측면에서 서비스 검색을 효율적으로 하기 위하여 피어 투 피어(P2P) 오버레이 네트위크에서 사용되는 분산 해쉬 테이블 시스템을 이용한다. 그러나 오버레이 네트워크는 물리적 네트워크 토폴로지와 독립적이기 때문에 기존의 유선망에서 사용되던 토폴로지 기반 메커니즘들은 노드들의 이동이 잦아 물리적 토폴로지가 수시로 바뀌는 이동 애드혹 망에 부적합하다. 본 논문에서는 오버레이 네트워크에서 라우팅의 비효율성을 극복하기 위한 근접성 기반 오버레이 네트워크 라우팅 기법을 제안한다. 근접성 기반 오버레이 네트워크 라우팅 기법에서, 각 노드는 1홉 브로드캐스팅을 통해 물리적으로 가까운 노드의 정보를 모으고, 이론 이용하여 논리적으로 목적지에 가까운 노드론 선택하여 메시지를 전송한다. 이러한 방식으로 메시지를 전송할 경우, 분산 해쉬 테이블 시스템과 같이 낮은 오버헤드를 유지하면서 플러딩 기반 기법과 비슷한 정도로 물리적인 홉 수를 줄일 수 있고, 노드들의 이동성이 있는 환경에서도 좋은 성능을 나타낸다는 것을 ns-2 시뮬레이션을 통해 확인할 수 있다.

Keywords

References

  1. M. Satyanarayanan. 'Pervasive Computing: Visioin and Challenges,' IEEE Personal Communications, Aug, 2001 https://doi.org/10.1109/98.943998
  2. E. Guttman, C. Perkins, J. Veizades, M. Day, 'Service Location Protocol, Version 2,' JETF RFC 2608, 1999
  3. http://www.uddi.org
  4. K. Arnold, A. Wollrath, B. O'Sullivan, R Scheifler, and J. Waldo, The Jini specification, Addison- Wesley, Reading, MA, USA, 1999
  5. 'Understanding UPnP: A White Paper,' http://www.upnp.org/resources/, Jun. 2000
  6. SUN Microsystems Inc., 'JXTA v2.0 Protocols Specification,' httpt://www.jxta.org, Feb., 2003
  7. S. Motegi, K. Yoshihara and H. Horiuchi, 'Service Discovery for Wireless Ad Hoc Networks,' The 5th International Symposium on Wireless Personal Multimedia Communication, 2002
  8. D. Chakraborty, A. Joshi, Y. Yesha and T. Finin, 'GSD: A Novel Group-based Service Discovery Protocol for MANET,' IEEE Conference on Mebile and Wireless Communications and Networks, Sep. 2002
  9. A. Datta, 'MobiGrid: P2P Overlay and MANET Rendezvous - a Data Management Perspective,' CAiSE 2003 Doctoral Symposium, 2003
  10. A. Klemm, C. Lindemann, and O.P. Waldhorst, 'A Special-Purpose Peer-to-Peer File Sharing System for Mobile Ad Hoe Networks,' Proc. IEEE Semiannual Vehicular Technology Corference (VTC2003-Fall), Orlando, FL, Oct. 2003
  11. 이세연, 장주옥, 조태경, '모바일 Ad hoc 네트워크에서의 P2P 네트워크 구축', 정보과학회지, 제2권 제3호, Mar. 2004
  12. Michael Klein, Birgitta Konig-Rics, Philipp Obreiter, 'Lanes - A Lightweight Overlay for Service Discovery in Mobile Ad Hoc Networks,' Third Workshop on Applications and Services in Wireless Networks, Berne, Swiss, 2003
  13. Y. Charlie Hu, Saumitra M. Das, and Himabindu Pucha, 'Exploiting the Synergy between Peer-to-Peer and Mobile Ad Hoc Networks,' HotOS-IX: Ninth Workshop on Hot Topics in Operating Systems, Hawaii, May 2003
  14. G. Ding, B. Bhargave, 'Peer-to-Peer File-sharing over Mobile Ad hoc Networks,' The 2nd IEEE Annual Conference on Pervasive Computing and Communications Workshops, Mar. 2004
  15. Clip2. The Gnutella Protocol Specification v0.4 (Document Revision 1.2) Jun. 2001. http://www. clip2.com/GnutellaProtoco104.pdf
  16. S. Ratnasamy, P. Francis, M. Handley, R Karp, and S. Shenker, 'A scalable content-addressable network,' Proc. ACM SIGCOMM'01, San Diego, CA, Aug. 200l
  17. I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H. Balakrishnan, 'Chord: A scalable peer-to-peer lookup service for Internet applications,' Proc. ACM SIGCOMM'01, San Diego, CA, Aug. 2001
  18. A. Rowstron and P. Druschel, 'Pastry: Scalable, distributed object location and routing for largescale peer-to-peer systems,' IFIP/ACM Middleware 2001, Heidelberg, Germany, Nov. 2001
  19. B. Zhao, J. Kubiatowicz, and A. Joseph, 'Tapestry: An infrastructure for fault resilient widearea location and routing,' Technical Report UCB/CSD-0l-1l41, U.C.Berkeley, Apr. 2001
  20. M. Castro, P. Druschel, Y.C. Hu, and A. Howstron, 'Topology-aware routing in structured peer-to-peer overlay networks,' Technical Report MSR-TR-2002-82, Microsoft Research, 2002
  21. L. Garces-Erice, E.W. Biersack, P.A Felber, K.W. Ross and G. Urvoy-Keller, 'Hierarchical Peer-to-peer Systems,' IFIP/ACM International Conference on Parallel and Distributed Computing( Euro- Par), 2003
  22. K. Gummadi, R. Gummadi, S. Gribble, S. Ratnasarny, S. Shenker, and I. Stooica, 'The Impact of DHT Routing Geometry on Resilience and Proximity,' Proc. ACM SIGCOMM'03, Karlsruhe, Germany, Aug. 2003
  23. K.W. Ross, E.W. Biersack, P. Felber, L. GarcesErice, and G. Urvoy-Keller, 'Topology-Centric Look-up Service,' Fifth International Workshop on Networked Group Communications, 2003
  24. C.G. Plaxton, R. Rajaram, and A.W. Richa, 'Accessing nearby copies of replicated objects in a distributed environment, The Ninth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), Jun 1997 https://doi.org/10.1145/258492.258523
  25. K. Fall and K. Varadhan, 'The ns Manual (formerly ns Notes and Documentation),' The VINT Project. http://www.isi.edu/nsnarrv.nslns-documentation.
  26. IEEE Computer Society LAN MAN Standards Committee, 'IEEE Std 802.11-1999, Wireless LAN Medium Access Control (MAC) and Physical Layer(PHY) Specifications,' The Institute of Electrical and Electronics Engineers, New York, 1999
  27. C. Perkins, E. Belding-Royer, S. Das, 'Ad hoc On-Demand Distance Vector (AODV) Routing,' IETF RFC 3561, 2002