中国邮电高校学报(英文版) ›› 2018, Vol. 25 ›› Issue (4): 56-65.doi: 10.19682/j.cnki.1005-8885.2018.1017

• Networks • 上一篇    下一篇

Key nodes of the trust transitivity in social Internet of things

Li Wenna, Lin Zhiting, Sun Libing, Xiang Yaqin, Wang Pengfei   

  1. School of Electronic and Information Engineering, Anhui University, Hefei 230601, China
  • 收稿日期:2017-12-04 修回日期:2018-09-25 出版日期:2018-08-30 发布日期:2018-11-02
  • 通讯作者: Lin Zhiting,E-mail:ztlin@ahu.edu.cn E-mail:ztlin@ahu.edu.cn
  • 作者简介:Lin Zhiting,E-mail:ztlin@ahu.edu.cn
  • 基金资助:
    This work was supported by the National Natural Science Foundation of China (61571012).

Key nodes of the trust transitivity in social Internet of things

Li Wenna, Lin Zhiting, Sun Libing, Xiang Yaqin, Wang Pengfei   

  1. School of Electronic and Information Engineering, Anhui University, Hefei 230601, China
  • Received:2017-12-04 Revised:2018-09-25 Online:2018-08-30 Published:2018-11-02
  • Contact: Lin Zhiting,E-mail:ztlin@ahu.edu.cn E-mail:ztlin@ahu.edu.cn
  • About author:Lin Zhiting,E-mail:ztlin@ahu.edu.cn
  • Supported by:
    This work was supported by the National Natural Science Foundation of China (61571012).

摘要: The trustee and the trustor may have no previous interaction experiences before. So, intermediate nodes which are trusted by both the trustor and the trustee are selected to transit trust between them. But only a few intermediate nodes are key nodes which can significantly affect the transitivity of trust. To the best of our knowledge, there are no algorithms for finding key nodes of the trust transitivity. To solve this problem, the concept of trust is presented, and a comprehensive model of the transitivity of trust is provided. Then, the key nodes search (KNS) algorithm is proposed to find out the key nodes of the trust transitivity. The KNS algorithm is verified with three real social network datasets and the results show that the algorithm can find out all the key nodes for each node in directed,
weighted, and non-fully connected social Internet of things (SIoT) networks.

关键词: KNS, SIoT, trust, the transitivity of trust

Abstract: The trustee and the trustor may have no previous interaction experiences before. So, intermediate nodes which are trusted by both the trustor and the trustee are selected to transit trust between them. But only a few intermediate nodes are key nodes which can significantly affect the transitivity of trust. To the best of our knowledge, there are no algorithms for finding key nodes of the trust transitivity. To solve this problem, the concept of trust is presented, and a comprehensive model of the transitivity of trust is provided. Then, the key nodes search (KNS) algorithm is proposed to find out the key nodes of the trust transitivity. The KNS algorithm is verified with three real social network datasets and the results show that the algorithm can find out all the key nodes for each node in directed,
weighted, and non-fully connected social Internet of things (SIoT) networks.

Key words: KNS, SIoT, trust, the transitivity of trust