Randomized routing techniques for Ad-hoc on-demand distance vector of Wireless Networks

Wireless Networks play a vital role and has become an epicenter of all communication networks. In Ad-hoc networks, we need to enhance the effectiveness of dynamic information exchange in existing routing protocols with additional security measures. Our present research work is focused on developing a system that performs leverage search and propagation embedded with an enhanced security in dynamic routing. We are implementing dynamic routing path techniques for onward forwarding of information as divided packets through randomly selected routing paths that can deliver data to the destination node. The proposed analytical work achieves considerably secured packet deliveries between a source node and the corresponding destination node. However, the proposed randomization from routing table in our work is compatible with popular routing protocols, such as Ad-hoc On-demand Distance Vector (AODV) in Wireless Networks. A thorough analytical study on the proposed algorithm is presented with parallel simulation experiments to validate the capability and optimal efficiency of this algorithm.