Dynamic trust evaluation model based on bidding and multi-attributes for social networks Online publication date: Wed, 24-Apr-2019
by Gang Wang; Jaehong Park; Ravi Sandhu; Jun Wang; Xiaolin Gui
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 13, No. 4, 2019
Abstract: Mutual trust is the most important basis in social networks. However, many malicious nodes often deceive, collaboratively cheat, and maliciously recommend other nodes for getting the more benefits. Meanwhile, because of lacking effective incentive strategy, many nodes are neither to evaluate nor to recommend. Thus, malicious actions have been aggravated in social networks. To solve these issues, we designed a bidding strategy to incentivise nodes to do their best to recommend or evaluate service node. At the same time, we also employed TOPSIS method of selecting a correct service node for system from networks. To guarantee reliability of service node selected, we brought recommendation time influential function, service content similarity function and recommendation acquaintance function into the model to compute general trust of node. Finally, we gave an update method for trust degree of node and experiments analysis.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Computing and Networking (IJHPCN):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook