Secure Routing In Mobile Ad Hoc Networks Research Articles

Secure MANET routing with blockchain-enhanced latent encoder coupled GANs and BEPO optimization

ABSTRACT Mobile ad hoc networks (MANETs) facilitate rapid deployment due to independence from established infrastructure, relying instead on wireless technology where each node functions as a source, destination, or intermediary router. However, existing techniques fail to adequately address security and privacy concerns inherent in MANETs, rendering them impractical for real-world deployment. To tackle these challenges, this paper proposes the Blockchain Based Trusted Distributed Routing Scheme for MANET using Latent Encoder Coupled Generative Adversarial Network Optimized with Binary Emperor Penguin Optimizer (LEGAN-BEPO-BCMANET). This scheme leverages blockchain technology to establish a fair proof-of-reputation system, ensuring trusted and decentralized routing based on authenticated blockchain token transactions. By integrating Latent Encoder Coupled Generative Adversarial Network (LEGAN) optimized with Binary Emperor Penguin optimizer (BEPO), the scheme enhances routing efficiency and security. A comprehensive security analysis is performed focusing on aspects such as double-spending prevention, transaction distinguishability, routing information integrity, and self-modification resilience. The proposed approach is implemented in NS3 software, with evaluation metrics including throughput of blockchain token transactions and average energy consumption recorded. Overall, the LEGAN-BEPO-BCMANET scheme offers a robust solution to the security and efficiency challenges faced by MANETs, paving the way for practical deployment in real-world scenarios. The performance of the proposed LEGAN-BEPO-BCMANET technique attains 29.786%, 19.25%, 22.93%, 27.21%, 31.02%, 26.91%, and 25.61% greater throughput, compared to existing methods like Blockchain-based BATMAN protocol utilizing MANET with an ensemble algorithm (BATMAN-MANET), Block chain-based trusted distributed routing scheme with optimized dropout ensemble extreme learning neural network in MANET (DEELNN-MANET), A secured trusted routing utilizing structure of a new directed acyclic graph-blockchain in MANET internet of things environment (DAG-MANET), An Optimized Link State Routing Protocol with Blockchain Framework for Efficient Video-Packet Transmission and Security over MANET (OLSRP-MANET), Auto-metric Graph Neural Network based Blockchain Technology for Protected Dynamic Optimum Routing in MANET (AGNN-MANET) and Data security-based routing in MANETs under key management process (DSR-MANET) respectively.

Optimization Driven-Based Secure Routing in MANET Using Atom Whale Optimization Algorithm

Mobile ad hoc networks (MANETs) routing is a very challenging task because of the dynamic nature of the network. The linking of provisional communication assures based on the infrastructure of MANET, however, there is no centralised monitoring process for making the routing in MANETs in terms of trust and security. Therefore, the stability routing is not considered, which may break easily in dynamic MANETs. Thus, this paper introduces a trust-based secure routing protocol using the proposed atom whale optimisation algorithm (AWOA), which is the trust-aware routing protocol. The developed atom whale optimisation is utilised to select the optimal route with respect to the trust factors, like average encounter rate (AER), and successful cooperation frequency (SCF), integrity factor, and the forwarding rate. Moreover, secure routing is performed between the nodes using the proposed AWOA. The AWOA is the integration of atom search optimisation (ASO), and whale optimisation algorithm (WOA) that inherits the faster global convergence. The fitness function is newly modelled considering mobility, and trust factors. The proposed AWOA outperformed other methods with a minimal end-to-end delay of 0.0083 sec, maximal packet delivery ratio (PDR) of 97.73%, and the maximal throughput of 85.05% respectively.

Optimisation driven-based secure routing in MANET using atom whale optimisation algorithm

Mobile ad hoc networks (MANETs) routing is a very challenging task because of the dynamic nature of the network. The linking of provisional communication assures based on the infrastructure of MANET, however, there is no centralised monitoring process for making the routing in MANETs in terms of trust and security. Therefore, the stability routing is not considered, which may break easily in dynamic MANETs. Thus, this paper introduces a trust-based secure routing protocol using the proposed atom whale optimisation algorithm (AWOA), which is the trust-aware routing protocol. The developed atom whale optimisation is utilised to select the optimal route with respect to the trust factors, like average encounter rate (AER), and successful cooperation frequency (SCF), integrity factor, and the forwarding rate. Moreover, secure routing is performed between the nodes using the proposed AWOA. The AWOA is the integration of atom search optimisation (ASO), and whale optimisation algorithm (WOA) that inherits the faster global convergence. The fitness function is newly modelled considering mobility, and trust factors. The proposed AWOA outperformed other methods with a minimal end-to-end delay of 0.0083 sec, maximal packet delivery ratio (PDR) of 97.73%, and the maximal throughput of 85.05% respectively.

Fuzzy based Combined Trust Scheme for Secure Routing in MANET (FCTRS)

Mobile Ad Hoc network (MANET) is a self-configuring network consisting of mobile nodes without any fixed infrastructure. However due to the nodes has not any fixed infrastructure in MANET, it is susceptible to various security attacks like data modification, information sniff, due to low energy, computing ability and bandwidth. In MANET Black hole is also an attack and it is difficult to detect and prevent. The lack of quality in security aspects of ad-hoc routing protocols won’t provide reliability in the data packets movement between source and destination nodes. Implementing the routing decision with trust is an important one in the MANNET security. Hence, this research work propose an enhanced Fuzzy based combined trust scheme (FCTRS) based on public trust and Quality of Service (QoS) trust to detect black hole attack. It provides secure routing based on certificate authority (CA) to improve the performance of Ad-hoc On-demand Distance Vector (AODV). The results will show the performance improvement of proposed protocol over Enhanced Trusted Routing Scheme with Pattern Discovery (ETRS-PD) and the protocol AODV. The metrics in the performance of network examined with different conditions of mobility and the presence of black hole node positions.

Link breakage maintenance and power-aware secure routing in MANET based on the Fuzzy Krill Herd-based Grasshopper optimization

As Mobile Ad hoc Networks (MANETs) are established using battery-powered nodes, the major concern to minimize the power consumption of the nodes is still a challenge while the lifetime of the network is taken into account. Thus, power-aware routing is the effective way to handle the situation that aims at minimizing the power consumption and network overhead in order to increase the network lifespan. Therefore, an effective power-aware secure routing protocol is designed using the proposed Fuzzy Krill Herd-based Grasshopper Optimization Algorithm (Fuzzy KH-GOA) such that the secure path is determined. Hence, it is evident that the routing path for transmitting the data packets is effectively decided using the proposed algorithm, which is based on the fitness parameters, such as fuzzy function, delay, distance, and power consumed by the path. The significance of this research relies on the link lifetime estimation for which the lifetime of the routes is detected in order to measure the link failure. The performance of the proposed Fuzzy KH-GOA reported the values of 23.858 J, 0.016 sec, 0.783, 0.840, and 10.908 sec, respectively in the absence of the attack and 22.624J, 22.624sec, 0.773, 0.812, and 9.862sec, respectively in the presence of attack for the measures, such as power, delay, Detection Rate (DR), throughput, and average Link Life Time.

Mobility Aware Energy Efficient Cluster Based Secure Routing Protocol for Mobile Adhoc Networks

Mobile ad-hoc network (MANET) is an evolving technology which derives under the class of wireless networks. Due to the inherent characteristics of nodes in MANET, energy efficiency and security still remains a major design issue. This paper intends to develop a multi-objective optimization (MOO) model for effective load distribution and security in the network. The presented MOO technique operates on two main stages namely clustering and secure routing. In the first stage, fuzzy logic technique with multiple input parameters namely energy, distance, link duration, latency, and trust are used for effective cluster construction. In the next stage, Lion Whale optimization (LWO) algorithm is introduced for secure routing. Using the determined MOO variables, a fitness function is derived to select the optimal routes for secure routing in MANET. The effective performance of the presented FLWO model is tested using a set of validation parameters and the proposed model attains maximum performance over other methods in a considerable way.

BP-AODV: Blackhole Protected AODV Routing Protocol for MANETs Based on Chaotic Map

Even though the ad-hoc on-demand distance vector (AODV) is a broadly used routing protocol for mobile ad-hoc networks (MANETs), it is vulnerable to a blackhole attack. Lu et al. developed a secure MANET routing protocol called SAODV to address the security weakness associated with the original AODV protocol and to remedy the blackhole attack. Specifically, the SAODV protocol can protect against blackhole attack performed by a malicious node during the routing process. However, it cannot resist the cooperative blackhole attack, in which two nodes are participating together to mount such attack. Therefore, this paper proposes a secure MANET routing protocol called BP-AODV to overcome the security breaches related to the SAODV protocol along with the original AODV protocol. In addition, the BP-AODV is able to protect against a cooperative blackhole attack launched during the routing process and guards against the blackhole attack that might take place during the forwarding process. The BP-AODV is developed by extending the functionality of the AODV protocol along with utilizing the chaotic map features. The experimental results assure that the BP-AODV protocol is more secure than the SAODV protocol and can effectively fight the blackhole attack achieved by a malicious node or cooperative malicious nodes during the routing process. The results also reveal that the BP-AODV can strongly guard against the blackhole attack that occurs during the forwarding process.

Trust Based Certificate Revocation for Secure Routing in MANET

Many trust establishment solutions in mobile ad hoc networks (MANETs) rely on public key certificates. Therefore, they should be accompanied by an efficient mechanism for certificate revocation and validation. In order to reduce the hazards from nodes and to enhance the security of network we propose to develop a CA distribution and a Trust based threshold revocation method. Initially the trust value is computed from the direct and indirect trust values. And the certificate authorities distributes the secret key to al the nodes. Followed by this a trust based threshold revocation method is computed. Here the misbehaving nodes are eliminated.

Secure routing in MANETs: a bio-inspired approach with honey bees

Mobile Ad Hoc Networks (MANETs) have created ample interest in recent times owing to their various advantages compared to the networks that require basic infrastructure for them to work. This paper elaborates various attacks that can be perpetrated on MANETs and their current solutions. Bio-inspired methods have recently gained importance in computing owing to the need for flexible, adaptable ways of solving engineering problems. Bio-inspired algorithms are based on the structure and functioning of complex natural systems and tend to solve problems in an adaptable and distributed fashion. Thus, bio-inspired techniques can accurately apply to MANETs to solve various issues in the design and working of MANETs. Our bee-inspired protocol is an on-demand path routing algorithm for MANETs inspired by the behavioural principles of honey bees. The algorithm works with multiple types of agents: scouts, workers and soldiers.

A Study on High Secure and Efficient MANET Routing Scheme

In mobile ad hoc networks (MANETs), the more applications we use, the more security is required. In this paper, we propose a high secure and efficient routing scheme that not only satisfies the properties of anonymity, security, authentication, nonrepudiation, and unforgeability that the previous paper achieved for ad hoc networks, but also satisfies other necessary properties such as confidentiality, traceability, and flexibility for multipaths in order to make the ad hoc environment more secure and practicable.

A Test-Bed Implementation for Securing OLSR In Mobile Ad-Hoc Networks

Contemporary personal computing devices are increasingly required to be portable and mobile enabling user’s wireless access, to wired network infrastructures and services. This approach to mobile computing and communication is only appropriate in situations where a coherent infrastructure is available. There are many situations where these requirements are not fulfilled such as; developing nations, rural areas, natural disasters, and military conflicts to name but a few. A practical solution is to use mobile devices interconnected via a wireless medium to form a network, known as a Mobile Ad-hoc Network (MANET), and provide the services normally found in wired networks. Security in MANETs is an issue of paramount importance due to the wireless nature of the communication links. Additionally due to the lack of central administration security issues are different from conventional networks. For the purposes of this article we have used the “WMN testbed” to enable secure routing in MANETs. The use of cryptography is an efficient proven way of securing data in communications, but some cryptographic algorithms are not as efficient as others and require more processing power, which is detrimental to MANETs. In this article we have assessed different cryptographic approaches to securing the OLSR (Optimised Link State Routing) protocol to provide a basis for research. We conclude the paper with a series of performance evaluation results regarding different cryptographic and hashing schemes. Our findings clearly show that the most efficient combination of algorithms used for authentication and encryption are SHA-1 (Secure Hash Algorithm-1) and AES (Advanced Encryption Standard) respectively. Using this combination over their counterparts will lead to a considerable reduction in processing time and delay on the network, creating an efficient transaction moving towards satisfying resource constraints and security requirements.

An end‐to‐end approach to secure routing in MANETs

AbstractProviding secure routing in mobile ad hoc networks (MANETs) is far more difficult than establishing secure routing in wired networks or static wireless networks. Node mobility and the relative scarcity of bandwidth render prior solutions ineffective. Solutions based on securing link or path information do not work well in MANETs because the dynamic nature of links requires extensive use of flooding to establish effective countermeasures. On the other hand, solutions based on hop‐by‐hop exchanges of distance information are easily compromised. Instead of trying to secure the ordering of nodes, we argue that secure routing in MANETs must be based on the end‐to‐end verification of physical‐path characteristics aided by the exploitation of path diversity to increase the probability of finding secure paths. We apply this approach to the design of the Secure Routing through Diversity and Verification (SRDV) protocol, a secure routing protocol that we show to be as efficient as unsecured on‐demand or proactive routing approaches in the absence of attacks. We prove that the countermeasures used in SRDV can defend against a variety of known attacks to routing protocols, including attacks involving collusion, and the fabrication and modification of routing packets. We also show the effectiveness of the end‐to‐end mechanisms via simulations. Copyright © 2009 John Wiley & Sons, Ltd.