检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]河南工业大学信息科学与工程学院,郑州450001
出 处:《计算机科学》2011年第12期73-76,87,共5页Computer Science
基 金:河南省高校青年骨干教师资助计划(2009GGJS-056);郑州市科技攻关计划(2010GYXM364)资助
摘 要:可信网络中节点信誉是一种重要而带有不确定性的信任关系。信誉及其聚合过程具有模糊性和随机性特征。云模型能够科学地描述节点信誉及其形成过程的不确定性。采用逆向云生成算法,揭示了节点信誉及其聚合过程在整个生命期的模糊性和随机性规律;获得其信誉云的数字特征值,指导在局部窗口内其信誉的量化。基于服务满意度评价的确定度值这一具有稳定倾向的随机数,结合衰减系数,设计了信誉度量化模型。模型中的权值是与满意度值有关的有稳定倾向的随机数。所提信誉量化模型切合开放网络信任关系的不确定性规律。仿真结果表明,与其它信誉量化模型相比,所提出的模型计算结果稳定,且具有较强的抗攻击性。Node reputation in trusted networks is an important trust relationship with many uncertainties. Reputation and the process of its aggregation are companied with characteristics of fuzziness and randomness. Cloud model can sci- entifically describe uncertainties of reputation during the process of its aggregation. Converse cloud generation algorithm is adopted to discover the laws of fuzziness and randomness of node reputation and its aggregation process during its whole life. Obtained numeric eigenvalues of reputation cloud are to direct the quantification of node reputation in local computation widows. Based on certainty degree of service satisfaction degree, together with attenuation factor, a reputa- tion quantifaction model was proposed. Certainty degree is a random number with stable tendency. Weights in the model are also random numbers with stable tendency related to service satisfaction degrees. The proposed reputation quantifac- tion model well fits with uncertainty laws of trust relationship in open networks. Simulation results show that the pro- posed model maintains stable output and has good anti-attacking abilities, compared with other models.
关 键 词:可信网络 信誉 云模型 模糊性 随机性 随机权值
分 类 号:TP309[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229