Abstrait

TRUST BASED SECURE AODV IN MANET

Pankaj Sharma , Yogendra Kumar Jain

The nature of self-organization and the limitation of individual resources, MANET always confront security and selfishness issues. In this thesis, we design trusted routing protocols using trusted frame works and intrusion detection system (secure protocol) for MANET. Trust combination algorithms and trust mapping functions are provided in this model, where the former can aggregate different opinions together to get a new recommendation opinion. Based on this trust model, we design our trusted routing protocols for MANET called TAODV on top of Ad Hoc On-demand Distance Vector (AODV) routing protocol. We extend the routing table and the routing messages of ADOV with trust information which can be updated directly through monitoring in the neighborhood. When performing trusted routing discovery, unlike those cryptographic schemes that perform signature generation or verification at every routing packet, we just combine the recommended opinions together and make a routing judgment based on each element of the new opinion. In this way the computation overhead can be largely reduced, and the trustworthiness of the routing procedure can be guaranteed as well. In this thesis, we implement the security and selfishness issues of wireless networks, either in non-cooperative form or in cooperative form. Our results show that the cumulative utilities of cooperative nodes are increased steadily and the selfish nodes cannot get more utilities by behaving selfishly than cooperatively.