Performance Evaluation and Enhancement of OMCT Algorithm in MANET

Many emerging applications in mobile adhoc networks involve group-oriented communication. Multicast is an efficient means of distributing data to a group of participants. Key management is the fundamental challenge in designing secure multicast communications. In many group interactions, new member can join and current members can leave at any time and existing members must communicate securely using multicast key distribution. This has to overcome the challenging element of "1affects n" phenomenon. To solve this problem, multicast clustering is the best solution. This paper presents an efficient clustering approach for secure multicast key distribution in mobile adhoc networks. The construction of clusters is based on localization and mobility of nodes. The proposal of this paper is to enhance OMCT (Optimized Multicast Cluster Tree) by integrating with DSDV (Destination Sequenced Distance Vector) routing protocol, which makes easy to elect the Local Controllers of the clusters and updates periodically as the node joins and leaves the cluster. The proposed model is simulated and its performance is evaluated in terms of average latency of key delivery, energy consumption and key delivery ratio. Thus this approach ensures a fast and efficient clustering approach for secure multicast key distribution in mobile adhoc networks compared to OMCT algorithm.