Advertisement

Hierarchical Clustering Algorithm Based on Mobility in Mobile Ad Hoc Networks

  • Sulyun Sung
  • Yuhwa Seo
  • Yongtae Shin
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3982)

Abstract

This paper proposes a hierarchical clustering method based on the relative mobility pattern in mobile ad hoc environment. The relative mobility pattern between two nodes is evaluated by using a received message and the cluster is created by grouping nodes with a relative mobility below a specific threshold. Also, we create a hierarchical clustering structure by allowing a merge among clusters based on the mobility pattern. In this way, the proposed mechanism can increase a continuity of total cluster structure. Since we allow the combination of clusters, we can reduce the number of cluster and message required for a routing. To evaluate a performance of our mechanism, we compared ours with the existing LCC and WCA by a Glomosim. The simulation results show that our scheme can provide the higher stability and efficiency than existing schemes.

Keywords

Cluster Head Neighboring Node Mobility Pattern Relative Mobility Hierarchical Cluster Algorithm 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Basagni, S.: Distributed clustering for ad hoc networks. In: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms, and Networks, Australia, pp. 310–315 (June 1999)Google Scholar
  2. 2.
    Belding-Royer, E.M.: Hierarchical routing in ad hoc mobile networks. To appear in the Wireless Communications and Mobile Computing (2002)Google Scholar
  3. 3.
    Chiang, C.-C., Wu, H.-k., Liu, W., Gerla, M.: Routing in clustered multihop, mobile wireless networks with fading channel. In: Proceedings of IEEE Singapore International Conference on Networks (SICON), pp. 197–211 (April 1997)Google Scholar
  4. 4.
    Hong, X., Gerla, M., Pei, G., Chiang, C.: A group mobility model for ad hoc wireless networks. In: Proceedings of ACM/IEE MSWiM, Seattle, WA (August 1999)Google Scholar
  5. 5.
    Ramanathan, R., Steenstrup, M.: Hierarchically-organized, multihop mobile wireless networks for Quality-of-service support. ACM/Baltzer Mobile Networking and Applications 3(1), 101–118 (1998)CrossRefGoogle Scholar
  6. 6.
    Hass, Z.: A new routing protocol for the reconfigurable wireless networks. In: Proceedings of the ICUPC 1997 (1997)Google Scholar
  7. 7.
    Lee, S.-J., Su, W., Hsu, j., Gerla, M., Bagrodia, R.: A performance comparison study of ad hoc wireless multicast protocols. In: Proceedings of the IEEE INFOCOM 2000 (2000)Google Scholar
  8. 8.
    Mitelman, B., Zaslavsky, A.: Link State Routing Protocol with Cluster Based Flooding for Mobile Ad-hoc Computer Networks. In: Proceedings of the workshop on Computer Science and Information Technologies (CSIT), Moscow Russia (1999)Google Scholar
  9. 9.
    GloMoSim: Global Mobile Information Systems Simulation, http://pcl.cs.ucla.edu/projects/glomosim/
  10. 10.
    PARSEC: Parallel Simulation Environment for Complex Systems, http://pcl.cs.ucla.edu/projects/parsec/
  11. 11.
    Lin, C.R., Gerla, M.: Adaptive clustering for mobile wireless networks. IEEE Journal on Selected Areas in Communications 15(7), September 126501275 (1997)Google Scholar
  12. 12.
    Amis, A.D., Prakash, R., Vuong, T.H.P.: Max-min d-cluster formation in wireless ad hoc networks. In: proceedings of IEEE INFOCOME 2000, vol. 1, pp. 32–41 (March 2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Sulyun Sung
    • 1
  • Yuhwa Seo
    • 1
  • Yongtae Shin
    • 1
  1. 1.Dept. of Computer ScienceSoongsil UniversitySeoulKorea

Personalised recommendations