Browse > Article

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

Yun, Seok-Yeol (강원대학교 컴퓨터정보통신공학과 컴퓨터네트워크 연구실)
Oh, Hoon (울산대학교 컴퓨터정보통신공학과 Ubicom 연구실)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.32, no.4A, 2007 , pp. 351-357 More about this Journal
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.
Keywords
Ad hoc network; Self-pruning; Control overhead; Cluster;
Citations & Related Records
연도 인용수 순위
  • Reference
1 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
2 D. M. Ngoc, H. Oh, 'A Group Dynamic Source Routing Protocol for Ad Hoc Networks,' Proc. 1st IFOST 2006, pp. 134-137, Oct. 2006
3 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
4 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
5 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
6 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
7 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   DOI
8 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   DOI   ScienceOn
9 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
10 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
11 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