Certain Improvements In Secure Anonymous Routing Using Optimized Trust Model For Ad Hoc Networks

Abstract

Security in ad hoc routing protocol is incorporated using encryption newlineauthentication anonymity and trust factors Though encryption and newlineauthentication provides endtoend security mechanisms of data information newlineregarding the nature and location of the nodes can be found by studying newlinetraffic pattern and routing data This security problem of ad hoc network is newlineaddressed by the use of anonymity mechanisms and trust levels in this newlineresearch Identification information like traffic flow network topology paths newlinefrom malicious attackers is hidden in anonymous networks Similarly trust newlineplays a very important role for intermediate node selection in ad hoc newlinenetworks Trust is essential as selfish and malicious nodes not only pose a newlinesecurity issue but also decreases the Quality of Service In this research a newlinerouting is proposed to address anonymous routing with trust which improves newlinethe overall security of the ad hoc network A new approach for an on demand newlineadhoc routing algorithm which is based on swarm intelligence is proposed newlineThe proposed research area investigates the performance of Ad hoc newlineOndemand Distance Vector AODV routing protocol and study the effect of newlineselfish and malicious nodes Analyse the performance degradation in an anonymous newlinead hoc network with selfish nodes under different applications newline Propose a novel routing protocol Mobile Anonymous newlineContinuous Trust MACT to address anonymity and newlinetrust for a wireless network containing selfish and newlinemalicious nodesOptimize the proposed routing protocol using Ant colony newlineOptimization Propose a hybrid optimization based on Memetic newlinealgorithm and Ant colony optimization for the proposed newlineroutingThe investigations showed that the performance of AODV routing newlineprotocol and study the effect of selfish and malicious nodes The performance newlinedegradation in an anonymous ad hoc network with selfish nodes under newlineconstant bit rate was analyzed Simulation was conducted for varying network newlinesize and with varying maliciousness newline newline