Coping with False Accusations in Misbehavior Reputation Systems for Mobile Ad-hoc Networks

Some misbehavior detection and reputation systems in mobile ad-hoc networks rely on the dissemination of information of observed behavior, which makes them vulnerable to false accusations. This vulnerability could be removed by forbidding the dissemination of information on observed behavior in the first place, but, as we show here, this has more drawbacks than a solution that allows dissemination and copes with false accusations. We propose a method for reducing the impact of false accusations. In our approach, nodes collect first-hand information about the behavior of other nodes by direct observation. In addition, nodes maintain a rating about every other node that they care about, in the form of a continuous variable per node. From time to time nodes exchange their first-hand information with others, but, using the Bayesian approach we designed and present in this paper, only second-hand information that is not incompatible with the current rating is accepted. Ratings are slightly modified by accepted information. The reputation of a given node is the collection of ratings maintained by others about this node. By means of simulation we evaluated the robustness of our approach against several types of adversaries that spread false information, and its efficiency at detecting malicious nodes. The simulation results indicate that our system largely reduces the impact of false accusations, while still benefiting from the accelerated detection of malicious nodes provided by second-hand information. We also found that when information dissemination is not used, the time until malicious nodes are detected can be unacceptable.

[1]  Calvin L. Williams,et al.  Modern Applied Statistics with S-Plus , 1997 .

[2]  Radia J. Perlman,et al.  Network layer protocols with Byzantine robustness , 1988 .

[3]  Chrysanthos Dellarocas,et al.  Immunizing online reputation reporting systems against unfair ratings and discriminatory behavior , 2000, EC '00.

[4]  Pietro Michiardi,et al.  Simulation-based analysis of security exposures in mobile ad hoc networks , 2002 .

[5]  Jean-Yves Le Boudec,et al.  Nodes bearing grudges: towards routing security, fairness, and robustness in mobile ad hoc networks , 2002, Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing.

[6]  Paul Resnick,et al.  Trust among strangers in internet transactions: Empirical analysis of eBay' s reputation system , 2002, The Economics of the Internet and E-commerce.

[7]  M. Degroot Optimal Statistical Decisions , 1970 .

[8]  Jean-Yves Le Boudec,et al.  Performance analysis of the CONFIDANT protocol , 2002, MobiHoc '02.

[9]  Gabriel Montenegro,et al.  Statistically Unique and Cryptographically Verifiable (SUCV) Identifiers and Addresses , 2002, NDSS.

[10]  P. Kollock The Production of Trust in Online Markets , 1999 .

[11]  Mary Baker,et al.  Mitigating routing misbehavior in mobile ad hoc networks , 2000, MobiCom '00.

[12]  J. Berger Statistical Decision Theory and Bayesian Analysis , 1988 .

[13]  Paul Resnick,et al.  Reputation systems , 2000, CACM.

[14]  Ross Ihaka,et al.  Gentleman R: R: A language for data analysis and graphics , 1996 .

[15]  Refik Molva,et al.  Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks , 2002, Communications and Multimedia Security.

[16]  Karl Aberer,et al.  Managing trust in a peer-2-peer information system , 2001, CIKM '01.