Paper
14 March 2013 Security clustering algorithm based on reputation in hierarchical peer-to-peer network
Mei Chen, Xin Luo, Guowen Wu, Yang Tan, Kenji Kita
Author Affiliations +
Proceedings Volume 8768, International Conference on Graphic and Image Processing (ICGIP 2012); 87687X (2013) https://doi.org/10.1117/12.2010529
Event: 2012 International Conference on Graphic and Image Processing, 2012, Singapore, Singapore
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.
© (2013) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Mei Chen, Xin Luo, Guowen Wu, Yang Tan, and Kenji Kita "Security clustering algorithm based on reputation in hierarchical peer-to-peer network", Proc. SPIE 8768, International Conference on Graphic and Image Processing (ICGIP 2012), 87687X (14 March 2013); https://doi.org/10.1117/12.2010529
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Network security

Head

Information security

Computer security

Computer simulations

Molybdenum

Computer science

Back to Top