Skip to main content

Clustering in Mobile Ad Hoc Networks Using Comprehensive Learning Particle Swarm Optimization (CLPSO)

  • Conference paper

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 56))

Abstract

In this work, we propose a Comprehensive Learning Particle Swarm Optimization (CLPSO) based weighted clustering algorithm for mobile ad hoc networks. It finds the optimal number of clusters to efficiently manage the resources of the network. The proposed CLPSO based clustering algorithm takes into consideration the ideal degree, transmission power, mobility, and battery power of the mobile nodes. A weight is assigned to each of these parameters of the network. Each particle contains information about the cluster-heads and the members of each cluster. The simulation results are compared with two other well-known clustering algorithms. Results show that the proposed technique works better than the other techniques especially in dense networks.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Liang, J.J., Qin, A.K., Suganthan, P.N., Baskar, S.: Comprehensive Learning Particle Swarm Optimizer for Global Optimization of Multimodal Functions. IEEE Trans. Evol. Comput. 10(3), 281–295 (2006)

    Article  Google Scholar 

  2. Ji, C., Zhang, Y., Gao, S., Yuan, P., Li, Z.: Particle Swarm Optimization for Mobile Ad Hoc Networks Clustering. In: Proceedings of the 2004 IEEE International Conference on Networking, Sensing & Control, Taipei. Taiwan, March 21-23 (2004)

    Google Scholar 

  3. Chatterjee, M., Das, S.K., Turgut, D.: WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks. Cluster Computing 5, 193–204 (2002)

    Article  Google Scholar 

  4. Turgut, D., Das, S.K., Elmasri, R., Turgut, B.: Optimizing Clustering Algorithm in Mobile Ad hoc Networks Using Genetic Algorithmic Approach. In: Proceedings of GLOBECOM 2002, Taipei, Taiwan, pp. 62–66 (2002)

    Google Scholar 

  5. Gerla, M., Tsai, J.T.C.: Multicluster, Mobile, Multimedia Radio Network. Wireless Networks 1(3), 255–265 (1995)

    Article  Google Scholar 

  6. Baker, D.J., Ephremides, A.: The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm. IEEE Transactions on Communications, 1694–1701 (1981)

    Google Scholar 

  7. Er, I.I., Seah, W.K.G.: Mobility-based D-hop Clustering Algorithm for Mobile Ad hoc Networks. In: IEEE WCNC, Atlanta, USA (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shahzad, W., Khan, F.A., Siddiqui, A.B. (2009). Clustering in Mobile Ad Hoc Networks Using Comprehensive Learning Particle Swarm Optimization (CLPSO). In: Ślęzak, D., Kim, Th., Chang, A.CC., Vasilakos, T., Li, M., Sakurai, K. (eds) Communication and Networking. FGCN 2009. Communications in Computer and Information Science, vol 56. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10844-0_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10844-0_41

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10843-3

  • Online ISBN: 978-3-642-10844-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics