A novel reputation computation model based on subjective logic for mobile ad hoc networks

Mobile ad hoc networks are deployed under the assumption that participating nodes are willing to forward other nodes' packets. However, for civilian applications where nodes are not owned by a single entity but are profit-oriented independent agents, cooperation cannot be taken for granted. In this paper, we present a novel reputation computation model to discover and prevent selfish behaviors by combining familiarity values with subjective opinions. The familiarity value represents a node's familiar degree with another individual node. In our model, a node that queries another's reputation first accumulates subjective opinions from their common neighbors. The familiarity values are used to calculate the weighting factor that determines how much a node's recommending opinion impacts on the reputation computation result. The utilization of this familiarity allows nodes to obtain opinions with lower uncertainty values, which helps nodes to recognize selfish nodes much earlier and can decrease the convergence time for isolating selfish nodes. We evaluate the performance of our model based on ns-2 simulations to analyze the impact of different parameters on the network performance. The simulation results show that our model outperforms the pure subjective logic-based model and achieves up to a 25% improvement in the convergence time.

[1]  Luiz A. DaSilva,et al.  A reputation-based mechanism for isolating selfish nodes in ad hoc networks , 2005, The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services.

[2]  Levente Buttyán,et al.  Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks , 2003, Mob. Networks Appl..

[3]  Ratul Mahajan,et al.  Sustaining cooperation in multi-hop wireless networks , 2005, NSDI.

[4]  Fan Wu,et al.  Incentive-compatible opportunistic routing for wireless networks , 2008, MobiCom '08.

[5]  Ramayya Krishnan,et al.  The impact of free-riding on peer-to-peer networks , 2004, 37th Annual Hawaii International Conference on System Sciences, 2004. Proceedings of the.

[6]  Carla-Fabiana Chiasserini,et al.  Energy Efficiency of Ad Hoc Wireless Networks with Selfish Users , 2002 .

[7]  Audun Jøsang,et al.  Trust network analysis with subjective logic , 2006, ACSC.

[8]  Sonja Buchegger,et al.  Cooperative Routing in Mobile Ad-hoc Networks: Current Efforts Against Malice and Selfishness , 2002, GI Jahrestagung.

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

[10]  Hector Garcia-Molina,et al.  The Eigentrust algorithm for reputation management in P2P networks , 2003, WWW '03.

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

[12]  Jon Crowcroft,et al.  Modelling incentives for collaboration in mobile ad hoc networks , 2004, Perform. Evaluation.

[13]  Qi He,et al.  SORI: a secure and objective reputation-based incentive scheme for ad-hoc networks , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[14]  Stephan Eidenbenz,et al.  Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents , 2003, MobiCom '03.

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

[16]  R. Srikant,et al.  DARWIN: distributed and adaptive reputation mechanism for wireless ad-hoc networks , 2007, MobiCom '07.

[17]  Azzedine Boukerche,et al.  A security management scheme using a novel computational reputation model for wireless and mobile ad hoc networks , 2008, PE-WASUN '08.

[18]  Vikram Srinivasan,et al.  Cooperation in wireless ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[19]  J.-P. Hubaux,et al.  Enforcing service availability in mobile ad-hoc WANs , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).

[20]  Audun Jøsang,et al.  Simplification and analysis of transitive trust networks , 2006, Web Intell. Agent Syst..

[21]  Mary Baker,et al.  Observation-based Cooperation Enforcement in Ad Hoc Networks , 2003, ArXiv.

[22]  Sheng Zhong,et al.  Sprite: a simple, cheat-proof, credit-based system for mobile ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[23]  James C. Browne,et al.  Using uncertainty in reputation methods to enforce cooperation in ad-hoc networks , 2006, WiSe '06.

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

[25]  Violet R. Syrotiuk,et al.  The performance of a watchdog protocol for wireless network security , 2007, Int. J. Wirel. Mob. Comput..

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

[27]  Guanhua Yan,et al.  Mobi-watchdog: you can steal, but you can't run! , 2009, WiSec '09.

[28]  Audun Jøsang,et al.  A Logic for Uncertain Probabilities , 2001, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[29]  Refik Molva,et al.  Analysis of coalition formation and cooperation strategies in mobile ad hoc networks , 2005, Ad Hoc Networks.