By Topic

First Coming Clustering Algorithm Based on Reputation in Peer-to-Peer Network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Mei Chen ; Sch. of Comput. Sci. & Technol., Donghua Univ., Shanghai, China ; Guowen Wu ; Xin Luo ; Kita, K.
more authors

In order to solve the security problem and broadcast storm problem of cluster in P2P, a first coming clustering algorithm based on reputation is presented. This algorithm, taking reputation as one of the criteria for the evaluation of a node, is to improve the secure of the interactions between nodes. And it also effectively resolve the broadcast storm risks by optimizing the structure of cluster, such as adding weights to the nodes, applying criteria on a new initialization, reputation threshold, division, virtual backup and the cluster's disbandment. Simulation results showed that the proposed algorithm improves the security of the system and significantly reduce the broadcast storm.

Published in:

Information Engineering (ICIE), 2010 WASE International Conference on  (Volume:2 )

Date of Conference:

14-15 Aug. 2010