社会机会网络中基于节点相似性的信任转发算法  

TRUST FORWARDING ALGORITHM IN SOCIAL OPPORTUNISTIC NETWORKS BASED ON NODE SIMILARITY

作　　者：袁江涛[1] 张振宇[1] 杨文忠[1] 

机构地区：[1]新疆大学信息科学与工程学院,新疆乌鲁木齐830046

出　　处：《计算机应用与软件》2016年第9期97-100,105,共5页Computer Applications and Software

基　　金：国家自然科学基金项目(61262089;61262087);新疆教育厅高校教师科研计划重点项目(XJEDU2012I09)

摘　　要：针对社会机会网络中存在的自私节点,提出一种基于节点相似性的信任转发算法。该算法首先计算了节点的路径相似性和社交相似性;然后根据相似性强度确定节点间的信任关系,并将其量化为具体的信任值;最后引入消费心理学思想,选取稳定性较高的信任节点作为转发节点。实验表明,与经典转发算法对比,该算法在含有自私节点的网络环境中能保证数据可靠传递。To address the problem of existence of selfish nodes in social opportunistic networks, we propose a node similarity-based trust forwarding algorithm. First the algorithm calculates the node path similarity and social similarity; then it determines the trust relationships be- tween nodes based on the similarity strength, and quantifies them to specific trust value; finally it introduces the consumer psychology idea, and chooses the trust nodes with higher stability as the forwarding nodes. It is demonstrated by experiment that comparing with traditional for- warding algorithm,this algorithm guarantees the reliable messages transmission in a network environment containing selfish nodes.

关 键 词：社会机会网络 节点相似度 信任关系 数据转发 自私节点 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]