The Journal of Korean Institute of Communications and Information Sciences (한국통신학회논문지)

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

Cluster-Based DSDV Routing Protocol in Mobile Ad Hoc Networts

이동 Ad Hoc 네트워크에서 클러스터 기반의 DSDV 라우팅 프로토콜

  • 오훈 (울산대학교 컴퓨터정보통신공학부 UbiCom 연구실)
  • Published : 2007.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

A novel c-DSDV routing protocol is proposed in clustered mobile ad hoc networks. Clusterheads that manage members in their own cluster construct a higher layer backbone to which the DSDV concept is applied. Each clusterhead maintains its own global routing table by exchanging Update Request (UREQ) messages with its neighboring clusterheads. A number of entries in the table is as small as a number of clusterheads unlike a number of nodes in DSDV Since a UREQ message travels from one clusterhead to all its neighboring clusterheads that are at most 3 hops away, the topology convergence range by each UREQ message is at least 9 times as wide as that of DSDV and CGSR, greatly improving accuracy of routing information. However, overhead in c-DSDV is similar to that of DSDV because only clusterheads initiate UREQ messages. Delivery ratio increases by about 32$\sim$50%.

이동 Ad Hoc 네트워크에서 DSDV개념을 적용하는 클러스터 기반 c-DSDV 프로토콜을 제안한다. 각 클러스터에는 멤버들을 관리하는 클러스터헤드가 존재하고 클러스터헤드들끼리 형성하는 상위 계층 네트워크 백본에 DSDV 개념을 수정 및 적용하였다. 클러스터헤드들은 갱신 메시지를 이웃 클러스터헤드들과 교환함으로써 전역 라우팅 테이블을 구성한다. 라우팅 테이블은 전체 클러스터헤드의 수에 해당되는 적은 수의 엔트리를 갖는다. 각 갱신 메시지는 최대 3흡 거리에 있는 이웃 클러스터헤드들에게 가지 플러딩되기 때문에 토폴로지 수렴 범위가 DSDV 및 CGSR의 수렴범위에 비해 최소 9배 커지고 라우팅 정보의 정확도가 크게 향상된다. 하지만, 클러스터 헤드들만 갱신 메시지를 생성하기 때문에 실제 오버헤드는 DSDV의 오버헤드와 비슷하다. 패킷 전송률이 32$\sim$50% 정도 개선되었다.

Keywords

References

  1. D. Bertsekas and R. Gallager, Data Networks, Second Edition, Prentice Hall, Inc., 1992
  2. D. B. John and D. A. Maltz, 'Dynamic source routing in ad hoc wireless networks,' in mobile computing, edited by T. Imielinski and H. Korth, chapter 5, pp. 153-181, Kluwer Academic Publishers, 1996 https://doi.org/10.1007/978-0-585-29603-6_5
  3. C.-C. Chiang, H.-K. Wu, W. Liu, and M. Gerla, 'Routing in clustered multihop, mobile wireless networks with fading channel,' The IEEE Singapore International Conference on Networks, pp. 197-211, IEEE, 1996
  4. C. R. Lin and M. Gerla, 'Adaptive clustering for mobile wireless networks,' IEEE Journal of Selected Areas in Communications, vol. 15, no. 7, pp. 1265-1275, 1997 https://doi.org/10.1109/49.622910
  5. H. Oh and H. S. Park, 'Communication architecture and protocols for broadcast-type mobile multimedia Ad Hoc networks,' 2002 Military Communications Conference, Sponsored by IEEE, pp. 1-6, Oct. 2002
  6. V. D. Park and M. S. Corson, 'A Highly adaptive distributed routing algorithm for mobile wireless networks,' IEEE INFOCOM '97, Kobe,Japan,1997
  7. C. E. Perkins and P. Bhagwat, 'Highly dynamic destination-sequenced distance- vector routing (DSDV) for mobile computers,' ACM SIGCOMM: Computer Communications Review, vol. 24, no. 4, pp.234-244, Oct. 1994 https://doi.org/10.1145/190809.190336
  8. C. E. Perkins and E. M. Royer, 'Ad-hoc on-demand distance vector routing,' Second IEEE Workshop on Mobile Computing Systems and Applications, pp. 90-100, Feb. 1999
  9. UCLA Parallel Computing Laboratory and Wireless Adaptive Mobility Laboratory. GloMoSim: A Scalable Simulation Environment for Wireless and Wired Network Systems, http://pcl.cs.ucla.edu/projects/glomosim