Establishing Security in Manets Using Friend-Based Ad Hoc Routing Algorithms

Abstract

Establishing security in MANET is challenging issue in any adhoc routing protocol. Neighbor nodes do not updated their routing status and bandwidth consumption during the transmission. AODV used single chain topology so bandwidth offers single chain transmission. To establishing the secure transmission FACES provide new challenges to its neighbor. Proposed system incorporate cache update and aware of routing information this scheme that has been drawn from a network of friends in real life scenarios. This algorithm send request in the form of challenges and sharing nearby neighbor lists to provide trust worthy nodes to the source node through which data transmission finally takes place. Proposed system taking various packet sizes into their account and deals only best effort traffic and AODV used only simple priority algorithm. Due this algorithm network can easily identifies the malicious node and provide secure neighbor node detection in the mobile adhoc network.