Analysis of different key-distribution schemes for Mobile Ad-hoc NETwork

Due to the characteristics of Mobile Ad-hoc NETwork (MANET) like dynamic infrastructure, unreliable multi-hop communication channel, node mobility, resource limitation and physical vulnerability, securing MANET is becoming more challenging. MANET has no any pre-existing fixed structure and mobile nodes sends packets to the destination nodes directly or via the neighboring nodes, it is of potential security concern because neighbor nodes cannot be trusted so distributing encryption keys between mobile nodes in an authenticated manner is a challenging task. Because MANET has dynamic nature, a node needs to generate a new session key when a new node enters or leaves the network to maintain forward or backward secrecy. Keys should be distributed securely so that any unauthenticated node cannot gain the access of it and they should be updated to maintain communication between old and newly joined nodes. There are so many schemes are proposed to provide efficient key distribution in MANET. In this paper, we aim to evaluate and present an overview of different key distribution schemes for MANET like key distribution through Network coding scheme, Message relaying scheme and Enhanced Optimized Multicast Cluster Tree(EOMCT) algorithm. Network Coding Scheme allows any two nodes to setup a shared key through a multi-hop route efficiently and provides light-weight key distribution for MANET. The analysis of Message relaying has been done to show the impact of message overhead at network layer and Medium Access Control (MAC) layer and provide scalability. EOMCT algorithm shows the improvement in parameters like average latency and energy consumption for secure multicasting.