A temporal table authenticated routing protocol for adhoc networks

Abstract

Mobile Ad Hoc Network (MANET) is collection of multi-hop wireless mobile nodes that communicate with each other without centralized control or established infrastructure. The wireless links in this network are highly error prone and can go down frequently due to mobility of nodes, interference and less infrastructure. Therefore, routing in MANET is a critical task due to highly dynamic environment. In recent years, several routing protocols have been proposed for mobile ad hoc networks and prominent among them are DSR, AODV and TORA However, the majority of these MANET secure routing protocols did not provide a complete solution for all the MANETs' attacks and assumed that any node participating in the MANET is not selfish and that it will cooperate to support different network functionalities Much work is going on to provide security to the network. One of the solution to the problem is ARAN — (Authenticated routing protocol) which is a secure protocol and provides Integrity, availability, Confidentiality, Authenticity, Non repudiation, Authorization & Anonymity but an authenticated selfish node can infer to this protocol performance and can disturb the network by dropping packets. This paper discusses Temporal table based schemes that can be applied to ARAN to detect selfish node and improve the performance.