Online video streaming is becoming more widespread in people’s everyday entertainment routines. Protecting copyright and piracy has become a key concern in real-time video streaming systems. This research provides a revolutionary multi-key and hybrid cryptography approach to offer security. This work describes the software implementation of video encryption and decryption employing continuous systems based on the Elliptic Curve Cryptography approach as pseudorandom encryption key generators. This approach creates several keys to encrypt and decode small chunks of video files that are produced dynamically based on the video data. The suggested approach was implemented on the Android platform, where applications for sender and recipients had been created to enable streaming. The security and performance of the proposed system have been examined by implementing it on devices and streaming videos. The outcomes demonstrate superiority in terms of performance and security.

The safeguarding of intellectual property and maintaining privacy for video content are closely linked to the effectiveness of security protocols employed in internet streaming platforms. The inadequate implementation of security measures by content providers has resulted in security breaches within entertainment applications, hence causing a reduction in the client base. This research aimed to enhance the security measures employed for video content by implementing a multi-key approach for encryption and decryption processes. The aforementioned objective was successfully accomplished through the use of hybrid methodologies, the production of dynamic keys, and the implementation of user-attribute-based techniques. The main aim of the study was to improve the security measures associated with the process of generating video material. The proposed methodology integrates a system of mathematical equations and a pseudorandom key within its execution. This novel approach significantly augments the degree of security the encryption mechanism provides. The proposed methodology utilises a set of mathematical equations that are randomly employed to achieve encryption. Using a random selection procedure contributes to the overall enhancement of the system’s security. The suggested methodology entails the division of the video into smaller entities known as chunks. Following this, every segment is subjected to encryption using unique keys that are produced dynamically in real-time. The proposed methodology is executed via Android platforms. The transmitter application is tasked with the responsibility of facilitating the streaming of the video content, whereas the receiver application serves the purpose of presenting the video to the user. A careful study was conducted to compare and contrast the suggested method with other similar methods that were already in use. The results of the study strongly support the safety and dependability of the procedure that was made available.

Dynamic traffic of multicast communication in the Software Defined Network environment focused less though it is more natural and practical. In multicast communication, the traffic is dynamic due to the dynamic group memberships (i.e., participants join and leave the group anytime), which are not explored much in the previous research works. The multicast in dynamic traffic requires a method to handle dynamic group membership and minimum tree alteration for every join and leave of participants from the multicast group. This paper proposes a multicast tree construction algorithm, which considers receiving devices and network capability as base parameters to construct the multicast path. The proposed routing method uses Dijkstra’s Shortest Path algorithm for initial tree formation, identifies a multicast path, and processes the Shortest Path Tree to reduce the overall hop count and path cost. The multicast tree generated by the proposed enables the dynamic join and leaves of participating devices with reduced tree alteration using more common paths to reach the devices. The implementation and results show that the proposed method works efficiently in resource utilization with a reduced hop count and quality for multicast communication in static and dynamic scenarios. Also, the results demonstrate that the proposed method generates a stable common path for multicast communication.

Vehicular Ad-Hoc Network mainly involves Vehicle to Vehicle (V2V) and Vehicle to Infrastructure (V2I) communication. This communication accelerates in reducing number of accidents, avoiding traffic congestion, enhancing the transport facility with the aid of infotainment and entertainment application. One of the major challenges of VANET application is in routing the packet in efficient manner since the network topology is dynamic. In this paper, proposed solution enhances the efficacy of Distance Based Routing [1] protocol by using Location Service (DBR-LS) which is designed especially for Vehicular Ad hoc Networks (VANET). The proposed algorithm adopts map based location technique. In DBR-LS, a connectivity graph based on the intervehicular distance, the duration of connectivity between neighbouring vehicles, the information from the digital map and location of destination vehicle from location service are collectively used to route the data. In proposed protocol the network traffic is reduced due to the relative position information of the neighbouring vehicles and location servers. The stability of the route path is high due to intervehicular distance based nexthop selection technique as implemented in this protocol. The proposed routing protocol is simulated using NS2 simulator to analyse the efficiency and effectiveness of the protocol.