Security Clustering Algorithm Based on Reputation in Hierarchical Peer-to-Peer Network

被引:0
作者
Chen, Mei [1 ]
Luo, Xin [1 ]
Wu, Guowen [1 ]
Tan, Yang [1 ]
Kita, Kenji [2 ]
机构
[1] DongHua Univ, Sch Comp Sci & Technol, Shanghai, Peoples R China
[2] Univ Tokushima, Fac & Sch Engn, Tokushima 7708506, Japan
来源
INTERNATIONAL CONFERENCE ON GRAPHIC AND IMAGE PROCESSING (ICGIP 2012) | 2013年 / 8768卷
基金
日本学术振兴会;
关键词
Hierarchical P2P; security; reputation; cluster; network;
D O I
10.1117/12.2010529
中图分类号
O43 [光学];
学科分类号
070207 ; 0803 ;
摘要
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.
引用
收藏
页数:7
相关论文
共 11 条
[1]  
[Anonymous], 2002, KAZAA FILE SHARING N
[2]  
[Anonymous], 2002, ACM C COMP COMM SEC
[3]  
Bao Li, 2009, COMPUTER DEV APPL, V22, P67
[4]  
Beth Thomas, ESORICS 94
[5]  
CARO GD, 2005, EVALUATION BASIC SER
[6]  
Claudiu D, 2005, P 16 INT WORKSH DAT, P776
[7]  
Hu Mingxiao, 2008, COMPUTER APPL, V28
[8]  
Kamvar S. D., 2003, P 12 INT C WORLD WID, P640
[9]  
Royer E M, 2001, ANAL OPTIMUM NODE DE, P857
[10]   Trust and reputation model in peer-to-peer networks [J].
Wang, Y ;
Vassileva, J .
THIRD INTERNATIONAL CONFERENCE ON PEER-TO-PEER COMPUTING (P2P2003), PROCEEDINGS, 2003, :150-157