KFTrust: P2P trust model based on evaluation rank using Kalman filter
by Zhigang Chen; Limiao Li; Jingsong Gui; Xiaoheng Deng; Lei Yuan
International Journal of Autonomous and Adaptive Communications Systems (IJAACS), Vol. 8, No. 2/3, 2015

Abstract: Security and privacy have been critically important with the fast expansion of P2P systems, which are open, anonymous and dynamic in nature. Due to such nature of P2P systems, P2P networks present potential threats among nodes. One feasible way to minimise threats is to evaluate the trust values of the interacting nodes. Many trust models have done so, but they fail to properly evaluate the trust values when malicious nodes start to behave in an unpredictable way. To solve the strategically altering behaviour of malicious nodes, this paper designs an evaluation rank-based trust model according to the different recommended trust values. This model computes the trust value by combining the similarity between the nodes and the time decaying features. In the mechanism of finding recommended nodes, a trust-based Kalman filter algorithm is implemented to reduce the system overhead. Finally, in our experiments, we compare our model with other four typical models, the results show that our model is able to defend against malicious nodes' attack effectively and reduce the system overhead.

Online publication date: Wed, 27-May-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Autonomous and Adaptive Communications Systems (IJAACS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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