Performance Efficient EOMCT Algorithm for Secure Multicast Key Distribution for Mobile Adhoc Networks

Emerging applications require secure multicast communication in adhoc environments like military or public emergency applications. It must consider several challenging factors such as frequent node mobility, limited bandwidth, limited power and constrained energy. Key management is the fundamental challenge in designing secure multicast communications. In many multicast interactions, new member can join and current members can leave at any time and existing members must communicate securely using multicast key distribution within constrained energy for mobile adhoc networks. This has to overcome the challenging element of “1 affects n” problem which is due to high groupdynamism. To solve this problem, multicast group clustering is the best solution. The proposed algorithm is an enhancement of Optimized Multicast Cluster Tree (EOMCT) with Destination Sequenced Distance Vector (DSDV) routing protocol provides efficient multicast key distribution. An analytical model is presented to evaluate its performance in terms of average latency of key distribution and energy consumption. The numerical and simulation results shows that reduction in the average latency of key distribution results in reduction in energy consumption. It also shows that this analytical model can be used to accurately predict the performance efficiency of the proposed approach under varying network conditions.