Anonym
Anonymous Trust Routing for Ad hoc Networks – A Meta Heuristic Approach
1KALPANA.R And 2RENGARAJAN, N.
1Department of CSE, King College of Technology, Namakkal, Tamil Nadu, India
2Principal, K S R college of Engineering, Tiruchengode, India
Abstract:In this paper a mechanism to address anonymous routing with trust to improve overall ad hoc network security and performance is proposed. Ad hoc networks are vulnerable to denial of services, wormhole attacks and spoofing. End-to-end data security in a network is generally provided by encryption and authentication which increases the overheads, but node’s topology information can be acquired through studying traffic/routing data. Improving the ad hoc network security and its performance using anonymity mechanisms and trust levels is investigated in this paper. Anonymous networks hide identification information such as traffic flow, network topology, paths from malicious attackers. Trust is a prerequisite as selfish/ malicious nodes are a security hazard, decreasing Quality of Service (QoS). Routing based on security mechanisms is proven to be a NP Hard problem. To overcome this, it is proposed to use Ant Colony Optimization (ACO) for faster convergence of the proposed solution. Results show that overall network security improves when the trust factor is taken into account with definite improvement in the QoS.
[KALPANA.R,RENGARAJAN, N. Anonymous Trust Routing for Ad hoc Networks – A Meta Heuristic Approach. Life Sci J 2013;10(4s):517-525] (ISSN: 1097-8135). http://www.lifesciencesite.com. 79
Keywords: Ad hoc network, Anonymous Networks, Trust and Reputation, Security, Ant Colony Optimization (ACO).
