An Efficient Privacy Preserving Genetic Approach based Routing Protocol for Video Streaming in MANET

Abstract

A Mobile Ad-hoc Network is a self configuring wireless network that operates without centralized administration. The active nodes are movable since arrangement of network is very vibrant and they have restricted energy which becomes one of the constraints for designing multicast routing protocol. Multicast based routing methods are challenging tasks in a wireless sensor network, due to various factors such as energy efficiency, Quality of Service, control overheads etc. Mobile Ad-hoc Network utilizes anonymous routing protocols in order to offer anonymity protection, which hides the node identities and/or routes from external observers. However current anonymous routing protocols such as hop-by-hop encryption or redundant traffic may either generate high cost or cannot provide full anonymity protection to data sources, destinations, and routes. Therefore, the methodology in this work have always considered several techniques such as battery life time, size of control overhead, efficient route reconfiguration by using Genetic Algorithm (GA) based Efficient Geographic Multicast Routing protocol (EGMP). The EGMP protocol allocates the location information which is used to construct zone structure, multicast packet forwarding and construction of multicast tree which efficiently reduces the tree structure maintenance and also the overhead for route searching. Furthermore, the shortest-path multicast tree is built to minimize delay time and design a source-tree-based routing algorithm, by using a small population size in the genetic algorithm. In order to overcome problems such as network partition, data loss, or performance degradation, data can be replicated in movable nodes. The replicas make certain that the performance is not degraded; rather some nodes may not cooperate or behave selfishly. The selfishness of some of the nodes leads to the performance degradation in terms of accessing data. In this work the impact of selfish nodes in a Mobile Ad Hoc Network from the viewpoint of replica allocation is examined. In precise a selfish node detection algorithm has been developed, that considers inequitable selfishness and competent replica allocation techniques to properly surplice with selfish replica allocation. Apart from all these features Dynamic Pseudonym has been used which helps to achieve better route anonymity protection and lower cost compared to other anonymous routing protocols. The simulation result shows that EGMP has less loss, high packet delivery ratio, low cost, low control overhead, and delay under all test scenarios when compared with Genetic Algorithm based Multicast Routing.