A distributed node clustering mechanism in P2P networks

Authors:
Mo Hai;Shuhang Guo
Affiliations:
School of Information, Central University of Finance and Economics, Beijing, China;School of Information, Central University of Finance and Economics, Beijing, China
Venue:
ADMA'10 Proceedings of the 6th international conference on Advanced data mining and applications - Volume Part II
Year:
2010

Citing 10
Cited 0

Scenario-based stability anlysis of the distributed mobility-adaptive clustering (DMAC) algorithm

MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks

Cluster Computing
A cluster algorithm for graphs

A cluster algorithm for graphs
Connectivity Based Node Clustering in Decentralized Peer-to-Peer Networks

P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
A survey of peer-to-peer content distribution technologies

ACM Computing Surveys (CSUR)
Node clustering based on link delay in P2P networks

Proceedings of the 2005 ACM symposium on Applied computing
Design and Evaluation of a Distributed Clustering Algorithm for Mobile ad hoc Networks

The Computer Journal
Energy-efficient distributed clustering in wireless sensor networks

Journal of Parallel and Distributed Computing
A mobility-based framework for adaptive clustering in wireless ad hoc networks

IEEE Journal on Selected Areas in Communications
Scribe: a large-scale and decentralized application-level multicast infrastructure

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

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.