Security Routing With Analytical Hierarchy Process in Wireless Ad Hoc Networks

Abstract

Over the past decade wireless multi-hop ad-hoc networks have received a tremendous amount of research focus.In wireless ad-hoc networks a new routing scheme for congestion control is proposed as called Novel Routing Approach. This method adopts reinforcement learning framework to route the data from Source to Destination in the absence of detailed knowledge of entire channel.It proceeds with the overview of routing protocols used in the MANETS their properties and simulation methods. This paper introduces a new routing scheme developed by the use of evolutionary algorithms (EA) and analytical hierarchy process (AHP) is used for getting the optimized output of MANET. Congestion is elastic traffic that degrades the result of the entire network. The concept of multi-hop ad-hoc networking was successfully applied in many classes of networks In order to predict the future congestion situation a relevant estimation is designed for each forwarder node and our proposed algorithm (ABCC) Agent Based Congestion Control routing protocol. In this paper cryptographic technique caser cipher is also employed for making the optimized route secure. This is achieved by both sufficiently exploring the network using data packets and exploiting the best routing opportunities.