The primary focus of this paper is to present an adon technique named ‘Explicit No’ with reduced complexity, for evaluating trust worthiness of a neighboring node. This scheme helps in mitigating the effect of malicious nodes by correct identification. Results are presented through simulation in NS2. | International Journal of Computer Networks and Communications Security C , , NOVEMBER 2013, 210–215 Available online at: ISSN 2308-9830 N C S Mitigating the effect of malicious node in Mobile Ad Hoc Networks using Trust based Explicit No Technique Dr. Islam1, Misbah Zareen2 1, 2 Center of Advance Studies in Engineering, Department of Computer Engineering, Taxila Pakistan E-mail: 1mhasanislam@, ABSTRACT Mobile Ad Hoc Networks (MANETS) are vulnerable to malicious node attacks because they spoil the integrity of network by consuming network resources, dropping packets and false routing. Routing misbehavior can be avoided by following trusted path for data transmission. Existing Trust based mechanisms for secure routing increase overhead and complexity processing and architecture. We compare multiple trust based secure routing techniques. The primary focus of this paper is to present an adon technique named ‘Explicit No’ with reduced complexity, for evaluating trust worthiness of a neighboring node. This scheme helps in mitigating the effect of malicious nodes by correct identification. Results are presented through simulation in NS2. Keywords: MANETS, Trust, Malicious nodes, AODV, Network Simulator (NS2), Security. 1 INTRODUCTION In MANETS, the core concept is information sharing, dissemination and collaboration among routing devices [7]. Node cooperation is mandatory for proper functioning of MANETS and this can be compromised by black sheep. To mitigate the effect of malicious misbehavior of nodes, we introduce a trust based secure routing scheme that helps in evaluation of node trustworthiness using a special packet called ‘Explicit No’. We have studied the existing ad on techniques and have compared their performance with our proposed algorithm. Results show that ‘Explicit No’ technique is convergent, less complex with simple design and more reliable for calculating the .
