DocumentCode
511118
Title
A Trust Discovery Model Based on Weighted Closeness
Author
Tian, Junfeng ; Lu, Yuzhen ; Yuan, Peng
Author_Institution
Coll. of Math. & Comput. Sci., HeBei Univ., Baoding, China
fYear
2009
fDate
14-16 Dec. 2009
Firstpage
254
Lastpage
259
Abstract
In order to improve the trustworthiness of network and decrease the cheating behavior among the nodes in the network, a model for trust discovery based on weighted closeness (WCTD) is presented. This model considers the factors such as the transition fading, time decay, and weights of the path and so on when performing the trust path searching and choosing. So trustor can find the node which satisfies its demand with low time complexity and perform the transaction with it. The combination of the trust path is realized by the weighted closeness and the policy to inhibit the malicious recommendation is given. Finally, the experiment has shown that this model has improved the trustworthiness of the network comparing with the existed trust model. The trust combination based on weighted closeness can be used in various trust models and it has better adaptability.
Keywords
computer network security; distributed processing; distributed systems; nodes cheating behavior; time decay; transition fading; trust discovery model; trust path searching; weighted closeness; Computer networks; Computer science; Educational institutions; Fading; Information security; Large-scale systems; Mathematical model; Mathematics; Peer to peer computing; Pervasive computing; trust; trust combination; trust discovery; trust search; weighted closeness;
fLanguage
English
Publisher
ieee
Conference_Titel
Pervasive Systems, Algorithms, and Networks (ISPAN), 2009 10th International Symposium on
Conference_Location
Kaohsiung
Print_ISBN
978-1-4244-5403-7
Type
conf
DOI
10.1109/I-SPAN.2009.31
Filename
5381904
Link To Document