通信学报
• 网络安全 • 上一篇 下一篇
郭晶晶,马建峰,李 琦,万 涛,高 聪,张 亮
出版日期:
发布日期:
基金资助:
Online:
Published:
摘要: 采用博弈论的思想为节点间的间接信任信息获取建立了博弈模型,提出了惩罚机制并给出了节点的效用函数。此外,建立了信任演化的复制动态方程来研究在不同参数下节点的演化稳定策略。通过实验验证了方法的正确性及有效性,证明该模型可使节点为了获得最大利益而在间接信任评估过程中趋于选择同邻居节点合作,从而提高信任管理系统的可用性与有效性,同时验证了节点在不同前提条件下的演化稳定策略。
Abstract: A game model is proposed for the indirect trust information obtaining process. A suitable punishment mechanism and design the utility function for nodes in a MANET is given. Moreover, with evolutionary game theory, the trust evolution of nodes using replicator dynamic equation is analyzed and several theorems toillustrate preconditions under which each evolutionarily stable strategy can be achieved are proposed. Experiments verified the correctness and effectiveness of proposed method and simulated the dynamic evolutionary trend of the nodes under different parameters which experimentally proves the proposed theorems.
郭晶晶,马建峰,李 琦,万 涛,高 聪,张 亮. 基于博弈论的移动自组织网络的信任管理方法[J]. 通信学报.
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: https://www.infocomm-journal.com/txxb/CN/
https://www.infocomm-journal.com/txxb/CN/Y2014/V35/I11/6