An autonomous dynamic trust management system with uncertainty analysis

被引:10
作者
You, Jing [1 ,3 ,4 ]
Shangguan, Jinglun [2 ]
Zhuang, Lihua [1 ]
Li, Ning [1 ,4 ]
Wang, Yinhai [3 ]
机构
[1] Changzhou Univ, Sch Informat Sci & Engn, Changzhou, Jiangsu, Peoples R China
[2] Jiangsu Hong Guan Smart Technol Co Ltd, Software Dev Dept, Changzhou, Jiangsu, Peoples R China
[3] Univ Washington, Smart Transportat Applicat & Res Lab, Seattle, WA 98195 USA
[4] Minjiang Univ, Fujian Prov Key Lab Informat Proc & Intelligent C, Fuzhou, Fujian, Peoples R China
基金
中国国家自然科学基金;
关键词
Dynamic trust management; Autonomous trust; Uncertainty analysis; Trust system; Collaborative recommendation; REPUTATION; MODEL; FRAMEWORK; NETWORKS;
D O I
10.1016/j.knosys.2018.07.036
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In order to help users select a reliable service in the open and complicated network, an autonomous dynamic trust management system is put forward based on collaborative recommendation mechanism and uncertainty analysis of satisfaction data. Any user in the network can store and update autonomously his trust table which contains direct interaction experience, find easily the reliable referrers according to collaborative recommendation, and collect valuable trust data and calculate the satisfaction and its reliability based on uncertainty analysis. Then the direct, recommended and self-recommended trusts can be calculated and finally be used to compute the global trust which will help the user to make a trust decision. A complicated network environment which includes quite a part of malicious nodes is built for investigating the robustness and effectiveness of the trust system. The experimental results show that the quality of service selection can be improved with the increase of interaction; the system can keep stable even though there are 50% malicious nodes initially in the network or a large number of malicious nodes join the network after stability; the system can resist the collusion attack more effectively and has lower computation and storage overhead than contrastive models.
引用
收藏
页码:101 / 110
页数:10
相关论文
共 50 条