Analysis of a Reputation System for Mobile Ad-Hoc Networks with Liars
- 25 April 2005
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The application of decentralized reputation systems is a promising approach to ensure cooperation and fairness, as well as to address random failures and malicious attacks in Mobile Ad-Hoc Networks. However, they are potentially vulnerable to liars. With our work, we provide a first step to analyzing robustness of a reputation system based on a deviation test. Using a mean-field approach to our stochastic process model, we show that liars have no impact unless their number exceeds a certain threshold (phase transition). We give precise formulae for the critical values and thus provide guidelines for an optimal choice of parameters.Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Analysis of a robust reputation system for self‐organised networksEuropean Transactions on Telecommunications, 2005
- Self-policing mobile ad hoc networks by reputation systemsIEEE Communications Magazine, 2005
- An incentive compatible reputation mechanismPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A formal model for trust in dynamic networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- The Eigentrust algorithm for reputation management in P2P networksPublished by Association for Computing Machinery (ACM) ,2003
- Performance analysis of the CONFIDANT protocolPublished by Association for Computing Machinery (ACM) ,2002
- Core: A Collaborative Reputation Mechanism to Enforce Node Cooperation in Mobile Ad Hoc NetworksPublished by Springer Nature ,2002
- Managing trust in a peer-2-peer information systemPublished by Association for Computing Machinery (ACM) ,2001