A Merging Clustering Algorithm for Mobile Ad Hoc Networks

  • Orhan Dagdeviren
  • Kayhan Erciyes
  • Deniz Cokuslu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3981)


Clustering is a widely used approach to ease implementation of various problems such as routing and resource management in mobile ad hoc networks (MANET)s. We propose a new fully distributed algorithm for clustering in MANETs that merges clusters to form higher level clusters by increasing their levels. We show the operation of the algorithm and analyze its time and message complexities and provide results in the simulation environment of ns2. Our results conform that the algorithm proposed is scalable and has a lower time and message complexities than the other algorithms.


Span Tree Destination Node Minimum Span Tree Cluster Level Leader State 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Krishna, P., Vaidya, N.H., Chatterjee, M., Pradhan, D.K.: A Cluster-based Approach for Routing in Dynamic Networks. In: SIGCOMM Computer Communications Review, CCR (1997)Google Scholar
  2. 2.
    Nocetti, F.B., Gonzalez, J.S., Stojmneovic, I.: Connectivity Based k-Hop Clustering in Wireless Networks. Telecommunication Systems (22)1-4, 205–220 (2003)Google Scholar
  3. 3.
    Grimaldi, R.P.: Discrete and Combinatorial Mathematics, An Applied Introduction. Addison Wesley Longman, Inc., Amsterdam (1999)MATHGoogle Scholar
  4. 4.
    Banerjee, S., Khuller, S.: A Clustering Scheme for Hierarchical Routing in Wireless Networks, Tech. Report CS-TR-4103, University of Maryland, College Park (2000)Google Scholar
  5. 5.
    Chen, Y.P., Liestman, A.L., Liu, J.: Clustering Algorithms for Ad Hoc Wireless Networks. In: Pan, Y., Xiao, Y. (eds.) Ad Hoc and Sensor Networks, Nova Science Publishers, Bombay, India (2004)Google Scholar
  6. 6.
    Gallagher, R.G., Humblet, P.A., Spira, P.M.: A Distributed Algorithm for Minimum-Weight Spanning Trees. ACM Transactions on Programming Languages and Systems 5, 66–77 (1983)CrossRefGoogle Scholar
  7. 7.
    Awerbuch, B.: Optimal Distributed Algorithms for Minimum Weight Spanning Tree, Counting, Leader Election and related problems. In: Proc. of the 9th Annual ACM Symposium on Theory of Computing, pp. 230–240 (1987)Google Scholar
  8. 8.
    Lien, Y.N.: A New Node-Join-Tree Distributed Algorithm for Minimum Weight Spanning Trees. In: Proc. of the 8th International Conference on Distributed Computing Systems, pp. 334–340 (1988)Google Scholar
  9. 9.
    Ahuja, M., Zhu, Y.: A Distributed Algorithm for Minimum Weight Spanning Trees Based on Echo Algorithms. In: Proc. of the 9th International Conference on Distributed Computing Systems (1989)Google Scholar
  10. 10.
    Garay, J.A., Kutten, S., Peleg, D.: A sub-linear time distributed algorithm for minimum-weight spanning trees. In: Proc. of the 34th Annual Symposium on Foundations of Computer Science, pp. 659–668 (1993)Google Scholar
  11. 11.
    Srivastava, S., Ghosh, R.K.: Distributed Algorithms for finding and maintaining a k-tree core in a dynamic network. Information Processing Letters 88(4), 187–194 (2003)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Orhan Dagdeviren
    • 1
  • Kayhan Erciyes
    • 1
  • Deniz Cokuslu
    • 1
  1. 1.Computer Eng. Dept.Izmir Institute of TechnologyUrla, IzmirTurkey

Personalised recommendations