Security Challenges in Multicast Communication for Mobile Ad Hoc Network

Abstract

Problem statement: Multicasting communication network accepted a single message from an application and delivered copies of the message to multiple recipients at different locations. Recently, there has been an explosion of research literature on multicast communication environment. The objective of this study were to contribute the complexity of supporting current multicast applications, (i) the lack of reliable multicast transport mechanisms at the network level and (ii) the lack of network support for large scale multicast communication. The scaling problem of secure multicast key distribution compounded for the case where sender-specific keys need to be distributed to a group and required for sender-specific authentication of data traffic and minimize control overhead (iii) compare RC4, AES-128,RS(2) and RS(3) computation time of both algorithms. Approach: Algorithms were collected and performed computation time. In general the multicast key distribution scheme implemented for distributing 128 bit session keys. Thus the Maximum Distance Separable Codes (MDS Codes) needed for their encoding and decoding process. In rekeying scheme errors were occurred during over period of time or at a particular point of time and to eliminate all these errors in the level of encryption and decryption mechanism. The MDS codes played an important role in providing security services for multicast, such as traffic, integrity, authentication and confidentiality, is particularly problematic since it requires securely distributing a group (session) key to each of a group’s receivers. Results: First we showed that internet multicasting algorithms based on reverse path forwarding were inherently unreliable and present a source-tree-based reliable multicasting scheme also. The new scheme proposed and used as an inter-gateway protocol and worked on top of the previously developed distance vector and link state internet routing schemes. Next, to support large scale applications, we presented a scheme for partial multicasting and introduced a new network level operation, called gather. The partial multicasting mechanism allowed messages to be delivered to subsets of multicast destinations, while the gather operation aids gateways in selectively suppressing redundant messages, thus reducing the message complexity. Conclusion: Hence the findings suggested the control overhead reasonably minimized and using simulations, we investigated the efficiency of our schemes in supporting scalable application domain based multicast communication.