%0 Journal Article
%A Li Wenna
%A Lin Zhiting
%A Sun Libing
%A Wang Pengfei
%A Xiang Yaqin
%T Key nodes of the trust transitivity in social Internet of things
%D 2018
%R 10.19682/j.cnki.1005-8885.2018.1017
%J 中国邮电高校学报（英文）
%P 56-65
%V 25
%N 4
%X 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,<br>
weighted, and non-fully connected social Internet of things (SIoT) networks.
%U https://jcupt.bupt.edu.cn/CN/10.19682/j.cnki.1005-8885.2018.1017