[1]窦冲,王小明,林亚光,等.基于社会关系和信任关系的机会网络路由算法[J].计算机技术与发展,2018,28(11):69-74.[doi:10.3969/ j. issn.1673-629X.2018.11.016]
 DOU Chong,WANG Xiao-ming,LIN Ya-guang,et al.A Routing Algorithm Based on Social Relationship and Trust Relationship in Opportunistic Networks[J].,2018,28(11):69-74.[doi:10.3969/ j. issn.1673-629X.2018.11.016]
点击复制

基于社会关系和信任关系的机会网络路由算法()
分享到:

《计算机技术与发展》[ISSN:1006-6977/CN:61-1281/TN]

卷:
28
期数:
2018年11期
页码:
69-74
栏目:
智能、算法、系统工程
出版日期:
2018-11-10

文章信息/Info

Title:
A Routing Algorithm Based on Social Relationship and Trust Relationship in Opportunistic Networks
文章编号:
1673-629X(2018)11-0069-06
作者:
窦冲12王小明12林亚光12王冉茵12王新燕12
1. 陕西师范大学 现代教学技术教育部重点实验室,陕西 西安 710119; 2. 陕西师范大学 计算机科学学院,陕西 西安 710119
Author(s):
DOU Chong12WANG Xiao-ming12LIN Ya-guang12WANG Ran-yin12WANG Xin-yan12
1.Key Laboratory for Modern Teaching Technology of Ministry of Education,Shaanxi Normal University,Xi’an 710119,China; 2.School of Computer Science,Shaanxi Normal University,Xi’an 710119,China
关键词:
机会网络自私性信任模型社会关系社会相似度
Keywords:
opportunity networksselfishnesstrust modelsocial relationshipsocial similarity
分类号:
TP393
DOI:
10.3969/ j. issn.1673-629X.2018.11.016
文献标志码:
A
摘要:
机会网络中的节点由于自身资源受限,在转发消息时往往具有自私性等特点。 为了提高机会网络通信性能,针对网络中节点存在自私行为的问题,结合节点间的社会关系,提出一种基于社会关系和信任关系的路由算法。 该算法依据节点间的交互信息和可信邻居节点的推荐信息,综合考虑节点间的直接信任度和间接信任度,建立节点间的信任模型。节点根据该模型选择具有较高信任值的节点参与到消息转发过程,同时优先选择和目的节点社会相似度更大的节点作为中继节点,并且根据社会相似度分配消息副本,使消息沿着社会相似度递增的方向传递。 仿真结果表明,该路由算法可以有效避免自私行为的发生,提高消息的投递率,降低网络的转发时延,减小网络资源的耗费。
Abstract:
The nodes in opportunistic networks are selfish due to their limited resources when forwarding messages. In order to improve the performance of opportunistic networks,aiming at the selfish behavior of the nodes in the network,we propose a routing algorithm based on social relationship and trust relationship in combination of social relations between the nodes. After considering the direct and indirect trust between nodes,this algorithm establishes the trust model according to the interaction information and the recommendation information of the trusted neighbor nodes. The nodes select the node with a higher trust value and select the node with a higher social similarity of the destination node as the relay node and distribute the message copies according to the social similarity,so that the message is transmitted along the direction of increased social similarity. The simulation shows that the proposed algorithm can effectively avoid the occurrence of selfish behavior,improve the delivery ratio of messages and reduce the delivery delay and the consumption of network resources.

相似文献/References:

[1]张登银 闫雪飞.机会网络路由可靠性研究[J].计算机技术与发展,2010,(11):70.
 ZHANG Deng-yin,YAN Xue-fei.Research on Routing Reliability in Opportunistic Networks[J].,2010,(11):70.
[2]陈加忠 鞠增伟 陈常念 李榕 夏涛 王冼.基于社会网络特性的机会计算服务平台[J].计算机技术与发展,2011,(06):197.
 CHEN Jia-zhong,JU Zeng-wei,CHEN Chang-nian,et al.Opportunistic Computing Service Platform Based on Social Network Properties[J].,2011,(11):197.

更新日期/Last Update: 2018-11-10