Secure routing using grasshopper optimization and improved homomorphic cryptosystem in MANET
Srinivas Aluvala, V SrikanthAim
Mobile Ad hoc Networks (MANETs) encounter significant challenges like limited resources, being prone to attacks, managing bandwidth, and extra overhead when transmitting data. This research aims to create a secure and efficient routing framework that addresses these problems while ensuring the network can grow and remain reliable.
Methodology
The framework begins by grouping nodes together using a K-means clustering method that relies on enthalpy, which helps position the cluster centers in a way that makes the clusters more stable. It uses an enhanced version of the Paillier-based homomorphic encryption system to allow for secure data gathering and encrypted path calculations without ever decrypting the data. When selecting the best paths, factors like the number of nearby points, how long connections can remain active, trust levels, energy usage, and movement data are taken into account. The most dependable and efficient routes are determined using the Grasshopper Optimization Algorithm combined with a goal programming method, which ensures the system is both energy-efficient and secure.
Results
The experimental results show that the proposed system greatly improves network performance, lowers the amount of routing overhead, and provides better protection against replay, interception, and collusion attacks. The framework achieves a throughput of 70 and a packet delivery ratio (PDR) of 97.6, which shows how well it keeps communication reliable. By using enthalpy-based clustering, homomorphic encryption, and bio-inspired optimization together, the system provides a secure and robust solution for communication in dynamic MANET environments.