Improved Schemes for Node Clustering in Decentralized Peer-to-Peer Networks

Node Clustering has wide ranging applications in decentralized Peer-to-Peer (P2P) networks such as P2P file sharing systems, mobile ad-hoc networks, P2P sensor networks and so forth. In this work, We propose two distributed approaches for node clustering that based on the scaled coverage measure (SCM), a measure of the accuracy of the partition of the network into clusters. The novelty of our approaches is to process nodes in local vicinity in special orders. Simulation study shows that our approach derives a more accurate partition with less orphan nodes, and converges faster than previously proposed methods, for both random topologies and power law topologies.

[1]  Dhiraj K. Pradhan,et al.  A cluster-based approach for routing in dynamic networks , 1997, CCRV.

[2]  Ulrik Brandes,et al.  Experiments on Graph Clustering Algorithms , 2003, ESA.

[3]  Lakshmish Ramaswamy,et al.  Connectivity based node clustering in decentralized peer-to-peer networks , 2003, Proceedings Third International Conference on Peer-to-Peer Computing (P2P2003).

[4]  Lakshmish Ramaswamy,et al.  A distributed approach to node clustering in decentralized peer-to-peer networks , 2005, IEEE Transactions on Parallel and Distributed Systems.

[5]  S. Dongen A new cluster algorithm for graphs , 1998 .

[6]  Yan Li,et al.  SACA: SCM-based adaptive clustering algorithm , 2005, 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems.

[7]  Julio Solano-González,et al.  Connectivity Based k-Hop Clustering in Wireless Networks , 2003, Telecommun. Syst..

[8]  Yan Li,et al.  SDC: A Distributed Clustering Protocol for Peer-to-Peer Networks , 2006, Networking.

[9]  Julio Solano-González,et al.  Connectivity Based k-Hop Clustering in Wireless Networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[10]  Dahlia Malkhi,et al.  K-clustering in wireless ad hoc networks , 2002, POMC '02.

[11]  S. vanDongen Performance criteria for graph clustering and Markov cluster experiments , 2000 .

[12]  Adrian Barbu,et al.  Graph partition by Swendsen-Wang cuts , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.