Self-constraint Reputation Updating Model

【Abstract】Encounter or interactions between nodes unknown to each other are inevitable in Internet transaction. Reputation mechanism is to facilitate the entities trust relationship in decentralized environments. This paper provides a computational model based on directed trust and recommender trust, introduces a self-constraint reputation updating model, which focuses on the reputation rating fluctuating factor. It puts forward an idea about malicious user’s reputation punishment. By comparing with Bayesian probabilistic trust model, it shows some benefits from simulation result: in the model, reputation rating will drop off fast whenever continuous failure transactions.

[1]  Gert Willems,et al.  Performance analysis of optimized smooth handoff in mobile IP , 2002, MSWiM '02.

[2]  Kurt Rothermel,et al.  Towards a Generic Trust Model - Comparison of Various Trust Update Algorithms , 2005, iTrust.

[3]  Kurt Rothermel,et al.  Architecture and Algorithms for a Distributed Reputation System , 2003, iTrust.

[4]  Tao Liu,et al.  A distributed-agent scheme in Mobile IP networks , 2004, Canadian Conference on Electrical and Computer Engineering 2004 (IEEE Cat. No.04CH37513).

[5]  Srinivasan Seshan,et al.  Improving reliable transport and handoff performance in cellular wireless networks , 1995, Wirel. Networks.

[6]  Abbas Jamalipour,et al.  A new explicit loss notification with acknowledgment for wireless TCP , 2001, 12th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. PIMRC 2001. Proceedings (Cat. No.01TH8598).

[7]  Charles E. Perkins,et al.  Mobility support in IPv6 , 1996, MobiCom '96.

[8]  Vijay Varadharajan,et al.  Interaction Trust Evaluation in Decentralized Environments , 2004, EC-Web.