Share Email Print
cover

Proceedings Paper

Security clustering algorithm based on reputation in hierarchical peer-to-peer network
Author(s): Mei Chen; Xin Luo; Guowen Wu; Yang Tan; Kenji Kita
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

For the security problems of the hierarchical P2P network (HPN), the paper presents a security clustering algorithm based on reputation (CABR). In the algorithm, we take the reputation mechanism for ensuring the security of transaction and use cluster for managing the reputation mechanism. In order to improve security, reduce cost of network brought by management of reputation and enhance stability of cluster, we select reputation, the historical average online time, and the network bandwidth as the basic factors of the comprehensive performance of node. Simulation results showed that the proposed algorithm improved the security, reduced the network overhead, and enhanced stability of cluster.

Paper Details

Date Published: 14 March 2013
PDF: 7 pages
Proc. SPIE 8768, International Conference on Graphic and Image Processing (ICGIP 2012), 87687X (14 March 2013); doi: 10.1117/12.2010529
Show Author Affiliations
Mei Chen, DongHua Univ. (China)
Xin Luo, DongHua Univ. (China)
Guowen Wu, DongHua Univ. (China)
Yang Tan, DongHua Univ. (Japan)
Kenji Kita, The Univ. of Tokushima (Japan)


Published in SPIE Proceedings Vol. 8768:
International Conference on Graphic and Image Processing (ICGIP 2012)
Zeng Zhu, Editor(s)

© SPIE. Terms of Use
Back to Top