Skip to main content

A Distributed Node Clustering Mechanism in P2P Networks

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6441))

Abstract

A P2P network is an important computing model because of its scalability, adaptability, self-organization, etc. How to organize the nodes in P2P networks effectively is an important research issue. The node clustering aims to provide an effective method to organize the nodes in P2P networks. This paper proposes a distributed node clustering mechanism based on nodes’ queries in P2P networks. In this mechanism, we propose three algorithms: maintaining of node clusters, merging of node clusters and splitting of node clusters. Theoretical analysis shows the time and communication complexity of this clustering mechanism is low. Simulation results show that the clustering accuracy of this clustering mechanism is high.

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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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. Androutsellis, T.S., Spinellis, D.: A Survey of Peer-to-Peer Content Distribution Technologies. ACM Computing Surveys 36(4), 335–337 (2004)

    Article  Google Scholar 

  2. Yang, B., Garcia, M.H.: Designing a super-peer network. In: 19th International Conference on Data Engineering, pp. 49–74. IEEE Press, Bangalore (2003)

    Google Scholar 

  3. McDonald, A., Znati, T.: A mobility based framework for adaptive clustering in wireless ad-hoc networks. IEEE Journal On Selected Area of Communications 17(8), 1466–1487 (1999)

    Article  Google Scholar 

  4. Das, B., Bharghavan, V.: Routing in ad-hoc networks using minimum connected dominating sets. In: IEEE International Conference on Communication, pp. 376–380. IEEE Press, Montreal (1997)

    Google Scholar 

  5. Bettstetter, C., Krausser, R.: Scenario-based stability analysis of the distributed mobility-adaptive clustering (DMAC) algorithm. In: 2nd ACM International Symposium on Mobile ad hoc Networking, pp. 232–241. ACM Press, Long Beach (2001)

    Chapter  Google Scholar 

  6. Chatterjee, M., Das, S., Turgut, D.: WCA: A weighted clustering algorithm for mobile ad hoc networks. Cluster Computing 5(2), 193–204 (2002)

    Article  Google Scholar 

  7. Bandyopadhyay, S., Coyle, J.E.: An energy efficient hierarchical clustering algorithm for wireless sensor networks. In: 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, pp. 1713–1723. IEEE Press, San Francisco (2003)

    Google Scholar 

  8. Younis, O., Fahmy, S.: Distributed Clustering in Ad-hoc Sensor Networks: A Hybrid Energy-Efficient Approach. In: 23nd Annual Joint Conference of the IEEE Computer and Communications Societies, pp. 23–35. IEEE Press, Hong Kong (2004)

    Google Scholar 

  9. Dimokas, N., Katsaros, D., Manolopoulos, Y.: Energy-efficient distributed clustering in wireless sensor networks. Journal of Parallel and Distributed Computing 70(4), 371–383 (2010)

    Article  MATH  Google Scholar 

  10. Amis, A., Prakash, R., Vuong, T., Huynh, D.: Max-min d-cluster formation in wireless ad hoc networks. In: 19th Annual Joint Conference of the IEEE Computer and Communications Societies, pp. 32–41. IEEE Press, Tel Aviv (2000)

    Google Scholar 

  11. Van, D.S.: A cluster algorithm for graphs. Technical Report, National Research Institute for Mathematics and Computer Science in the Netherlands (2000)

    Google Scholar 

  12. Ramaswamy, L., Iyengar, A., Liu, L., Douglis, F.: Connectivity based node clustering in decentralized peer-to-peer networks. In: 3rd International Conference on Peer-to-Peer Computing, pp. 66–74. IEEE Press, Linkoping (2003)

    Google Scholar 

  13. Zheng, W., Zhang, S., Ouyang, Y., Makedon, F., Ford, J.: Node clustering based on link delay in p2p networks. In: ACM Symposium on Applied Computing, pp. 744–749. ACM Press, Santa Fe (2005)

    Google Scholar 

  14. Lacks, D., Chatterjee, M., Kocak, T.: Design and Evaluation of a Distributed Clustering Algorithm for Mobile ad hoc Networks. The Computer Journal 52(6), 656–670 (2009)

    Article  Google Scholar 

  15. FreePastry, http://freepastry.org

  16. Castro, M., Druschel, P., Kermarrec, A.M., Rowstron, A.: Scribe: A large-scale and decentralized application-level multicast infrastructure. IEEE Journal on Selected Areas in Communications 20(8), 1489–1499 (2002)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hai, M., Guo, S. (2010). A Distributed Node Clustering Mechanism in P2P Networks. In: Cao, L., Zhong, J., Feng, Y. (eds) Advanced Data Mining and Applications. ADMA 2010. Lecture Notes in Computer Science(), vol 6441. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17313-4_57

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17313-4_57

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17312-7

  • Online ISBN: 978-3-642-17313-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics