Dynamic trust evaluation based routing model for ad hoc networks

The performance and security of ad hoc networks rely on the cooperative and the trusted between the distributed links. To route and forward the data, it is important to evaluate the transmission behavior of link in network. This paper defines the trust value in routing protocol as the records associated with the behaviors of links to deliver message to the intended next node reliably, timely, and integrally. After using a trust graph theoretic model to evaluate dynamically, to maintain trust relationships, and to make trust-based routing decisions, five trust-based theoretic strategies have been presented for routing selection. The simulation shows that the proposed strategies can detect effectively malicious behaviors and improve the network throughput in ad hoc networks.

[1]  Bo Li,et al.  A unified framework for resource discovery and QoS-aware provider selection in ad hoc networks , 2002, MOCO.

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

[3]  Lik Mui,et al.  A Computational Model of Trust and Reputation for E-businesses , 2002 .

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

[5]  Yih-Chun Hu,et al.  SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks , 2003, Ad Hoc Networks.

[6]  Yih-Chun Hu,et al.  A survey of secure wireless ad hoc routing , 2004, IEEE Security & Privacy Magazine.

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

[8]  Joan Feigenbaum,et al.  Decentralized trust management , 1996, Proceedings 1996 IEEE Symposium on Security and Privacy.

[9]  L. Mui,et al.  A computational model of trust and reputation , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.