ECSORRMAN: Optimal Random Route Selection and Elliptic Curve Cryptography Based Security Schema for Mobile ADHOC Network

T. Manjula and B. Anand

The crucial work of MANET is to improvise performance in Securing communications. Usually there is a high chance of attack in the network by creating security holes. Multiple domains helps random multiple paths to attain network security and reliability by identification and transmission of packet data from origin to destination nodes. Travelling on a packet data between nodes in a similar path leads to lesser security than the usual security algorithm. The alternate path is chosen randomly if threat arises in path in transmission of data send from one node to another node in the same path for obtaining high security. The high challenges are addressed by a novel secure framework called Elliptic Curve Cryptography Security with Optimal Random Routing for Mobile Ad hoc Networks (ECSORRMAN) is proposed. The reliability, efficiency, and security in MANETs are improved by consideration of mobile nodes as routers to transmit the packets from a source to a destination node inclusive of multipath for identification of multiple paths. In this work, the selection of route is done using Particle Swarm Optimization (PSO) that mobile nodes death rate are minimized and maximize the multipath routing in lifetime. Here that Elliptic Curve Cryptography Based Security has been introduced for encryption of packets from the source to destination. Reproduction results comparing ECSORRMAN with MDKESR, SUPERMAN, SAODV and SOLSR are given to show the proposed structures reasonableness for wireless communication security.

Volume 12 | 03-Special Issue

Pages: 409-419

DOI: 10.5373/JARDCS/V12SP3/20201276