Using node accountability in credential based routing for mobile ad-hoc networks

This paper propose a secure and efficient routing scheme using a game theoretical approach and trust relationships between the nodes. We assume a ldquoBayesian Gamerdquo model among the nodes to find the optimal behavior of legitimate and malicious nodes. Moreover, using a ldquowatchdogrdquo mechanism and an ldquoacknowledgementrdquo mechanism (ACK), we construct trust relationships between the nodes.

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

[2]  Michael Luby,et al.  LT codes , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[3]  Jean-Yves Le Boudec,et al.  The Effect of Rumor Spreading in Reputation Systems for Mobile Ad-hoc Networks , 2003 .

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

[5]  Zhu Han,et al.  Information theoretic framework of trust modeling and evaluation for ad hoc networks , 2006, IEEE Journal on Selected Areas in Communications.

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

[7]  Cristina Comaniciu,et al.  A Bayesian game approach for intrusion detection in wireless ad hoc networks , 2006, GameNets '06.