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

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

DSP Algorithm for Efficient Communication between Clusterheads in Cluster-based Ad hoc Networks

클러스터 기반의 Ad Hoc 네트워크에서 클러스터헤드간 효율적인 통신을 위한 DSP 알고리즘

  • 윤석열 (강원대학교 컴퓨터정보통신공학과 컴퓨터네트워크 연구실) ;
  • 오훈 (울산대학교 컴퓨터정보통신공학과 Ubicom 연구실)
  • Published : 2007.04.30
Download PDF
⟨ Previous Next ⟩

Abstract

Numerous papers that study ad hoc networks have used a hierarchical network structure to enhance scalability. The hierarchical structure typically consists of a number of clusters, each of which has its own clusterhead that maintains information. Clusterheads often need to exchange information among themselves in order to maintain information, and for such cases, a mechanism is needed to efficiently deliver information from one clusterhead to another. Here, we proposed a new distributed algorithm in which every node independently makes the decision about whether or not it forwards a received message. We used a simulation to demonstrate that the algorithm developed for this study is a considerable improvement over the control overhead algorithm.

Ad Hoc 네트워크를 연구한 많은 논문들은 확장성을 향상시키기 위해서 계층적 네트워크 구조를 사용하였다. 계층적 구조는 여러 개의 클러스터들로 구성되고 각 클러스터는 모든 클러스터들에 대하여 정보를 관리하는 클러스터헤드를 가진다. 클러스터헤드는 정확한 정보를 유지하기 위하여 그들끼리 정보를 교환할 필요가 있으며 이를 위하여 클러스터헤드가 이웃하는 다른 클러스터헤드들에게 정보를 보낼 수 있는 효율적인 메커니즘이 필요하다. 이 문제를 해결하기 위한 알고리즘들은 대부분 클러스터헤드가 재전송할 브릿지들을 선정하거나 혹은 부가적인 메시지를 사용하여 재전송 브릿지를 선정하는 메커니즘을 사용하였다. 여기에 제안하는 DSP(Distributed Self-Pruning)알고리즘은 각 노드가 수신한 메시지를 재전송할 것인지에 대하여 독자적으로 판단을 한다. 두 개의 클러스터기반 라우팅 프로토콜에 제안한 알고리즘을 적용함으로써 알고리즘의 적합성을 검증하였다.

Keywords

References

  1. T.-C. Chiiang, P.-Y. Wu, Yueh-Min Huang, 'A limited flooding schmeme for mobile ad hoc networks,' Wireless And Mobile Computing, Networking And Communications, 2005. (WiMob'2005), IEEE International Conference, vol. 3, pp. 473-478, Aug. 2005
  2. P. Jacquet, P. Muhlethaler, T. Clausen, A. Laouiti, A. Qayyum, L. Viennot, 'Optimized link state routing protocol for ad hoc networks.' In IEEE International Multi Topic Conference, 2001
  3. Taek Jin Kwon, Mario Gerla, 'Efficient flooding with passive clustering(PC) in ad hoc networks,' ACM Computer Communication Review, vol. 32, no. 1, pp. 44-56, Jan. 2002 https://doi.org/10.1145/510726.510730
  4. D. M. Ngoc, H. Oh, 'A Group Dynamic Source Routing Protocol for Ad Hoc Networks,' Proc. 1st IFOST 2006, pp. 134-137, Oct. 2006
  5. H Oh, S.Y. Yun, 'Proactive cluster-based distance-vector(PCDV) routing protocol in mobile ad hoc networks', IEICE Trans. On Communications, Vol. E90-B, No. 6, Jun. 2007
  6. H. Oh, H. S. Park, 'Communication architecture and protocols for broadcast-type mobile multimedia ad hoc networks' MILCOM 2002. Proceedings, vol. 1, 7-10 , pp. 442 – 447, Oct. 2002
  7. W. Peng, X.-C. Lu, 'On the Reduction of Broadcast Redundancy in Mobile Ad Hoc Networks,' Proc. First Ann. Workshop Mobile and Ad Hoc Networking and Computing, pp. 129-130, Aug. 2000
  8. 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
  9. I. Stojmenovic, M. Seddigh, J. Zunic, 'Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks,' IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 1, pp. 14-25, Jan. 2002 https://doi.org/10.1109/71.980024
  10. J. Wu, W. Lou, 'Forward-node-set-based broadcast in clustered mobile ad hoc networks,' Wireless Communications and Mobile Computing, a special issue on Algorithmic, Geometric, Graph, Combinatorial, and Vector Aspects of Wireless Networks and Mobile Computing, vol. 3, no. 2, pp. 141-154, March 2003
  11. Vitaly Li, H. S. Park and H. Oh, 'A Cluster-Label Based Mechanism for Backbones on Mobile Ad Hoc Networks, LNCS, vo. 3970, pp. 26-36, May 10-12, 2006