An Improved Hybrid Secure Multipath Routing Protocol for MANET

Abstract

Mobile ad hoc networks (MANETs) are self-organizing nodes in a mobile network that collaborate to form dynamic network architecture to establish connections. In MANET, data must traverse several intermediary nodes before reaching its destination. There must be security in place to prevent hostile nodes from accessing this data. Multiple methods were suggested in literature for securing routing; these techniques tackle different aspects of security. In order to enhance fault tolerance, wireless network multipath routing is typically used instead of the original single path routing. The routing protocol Genetic Algorithm with Hill climbing (GAHC) described in this article shows a hybrid GA-Hill Climbing algorithm that picks the optimal route in multipath. Prior to this in the beginning, the Improved fuzzy C-means algorithm method was built on density peak, and cluster heads (CHs) were chosen in a predicted manner, based on recent, indirect, and direct trust. The computation is based worth nodes are at the trust threshold found in addition. Even CHs take part in the alternate paths, the blend of all the many paths from these Cluster Heads that chooses the optimal route, which is based on the predicted hybrid protocol, as well as the optimum route's aggregate features such as throughput, latency, and connection. This suggested technique requires a minimum amount of energy of 0.10 m joules and a small amount of delay time of 0.004 msec, which also yields a maximum throughput of 0.85 bits per second, a maximum detection rate of 91 percent and maximum packet delivery ratio of 89percent . The suggested approach was put through the paces with the selective packet dropping attack INDEX TERMS MANET, Genetic Algorithm (GA), Cluster heads (CHs), Hill climbing (HC), Selective packet dropping attack.

Improved Metaheuristics-Based Clustering with Multihop Routing Protocol for Underwater Wireless Sensor Networks

“…The chaotic values 𝜔 generated by a logistical map with three hundred runs and 𝜔 = 0.001 is represented by. In the case of CKHA [22], The standard KH method adapts the Lagrangian algorithm as follows:…”

“…The chaotic values ω chebychev j generated by a logistical map with three hundred runs and ω chebychev 0 = 0.001 is represented by. In the case of CKHA [22],…”

“…This study introduces an improved metaheuristics-based clustering with a multihop routing protocol for UWSN, named the IMCMR-UWSN technique. The IMCMR-UWSN technique intends to properly arrange the nodes into clusters and determine the shortest routes for inter-cluster data transmission in the UWSN [22,23]. To accomplish this, the IMCMR-UWSN technique designs the chaotic krill head algorithm (CKHA)-based clustering and self-adaptive glowworm swarm optimization algorithm (SA-GSO)-based multihop routing protocols [24][25][26].…”

Performance Analysis of Public Safety Cognitive Radio MANET for Diversified Traffic

“…These questions are recently very intensively studied and published. Some of them analyze the robustness of routing protocols for MANET, proposing modifications of the classical algorithms such as OLSR [16], or new hybrid solutions [17], Key Management Method [18], and method using efficient trust establishment [19]. Comparative analysis of chosen routing algorithms security is presented in [20][21][22], and the intrusive detection methods using ML algorithms are proposed for MANET by [23].…”

Data Security-Based Routing in MANETs Using Key Management Mechanism

“…Recently, many secure and energy-aware multipath routing protocols have been designed for MANETs, such as the Trust Aware Secure Energy Efficient Hybrid Protocol (TASEEHP) [22], Hybrid Secure Multipath Routing Protocol (HSMRP) [23], Signcryption Technique (ST) [24], and Recurrent Reward-Based Learning (RRBL) [25]. These protocols have shown remarkable performance against various security threats.…”