A SCHEME FOR SOLVING D-S THEORY BASED IGNORANT EVIDENCE FUSION IN P2P NETWORK
For most P2P file-swapping applications, sharing is a volunteer action, and peers are not responsible for their irresponsible bartering history. It is necessary to establish a trust mechanism for the P2P network. Among the existing trust models based on recommendation, the Dempster-Shafer (D-S) evidence theory can solve uncertain problem. But in the existing researches on D-S evidence theory, no one aware the problem of logical evidence fusion when there is a large number of the ignorant evidence in the evidence space. In this paper, we establish a new the D-S evidence theory scheme toenhance the P2P network security.
P2P D-S Evidence Theory Trust Model Recommendation Ignorant Evidence Fusion
ZHEN ZHANG XIAO-MING WANG YUN-XIAO WANG
Department of Computer Science, Jinan University, Gangzhou, 510632, China College of Computer Science and Technology, Jilin University, Qianwei Road 10#, Changchun, 130012, C
国际会议
2006 International Conference on Machine Learning and Cybernetics(IEEE第五届机器学习与控制论坛)
大连
英文
4531-4535
2006-08-13（万方平台首次上网日期，不代表论文的发表时间）