ChaTQ-DR: Chaos-Guided Trust-Aware Q-Learning with Dragonfly Optimization for Secure Routing in MANETs

In mobile ad hoc networks (MANETs), the network topology changes frequently and unpredictably due to the arbitrary mobility of nodes. This feature leads to frequent path failures and route reconstructions, which causes an increase in the routing control overhead. The overhead of a route discovery cannot be neglected. Thus, it is imperative to reduce the overhead of route discovery in the design of routing protocols of MANETs. One of the fundamental challenges of MANETs is the design of dynamic routing protocols with good performance and less overhead. In a route discovery, broadcasting is a fundamental and effective data dissemination mechanism, where a mobile node blindly rebroadcasts the first received route request packets unless it has a route to the destination, and thus it causes the broadcast storm problem. This paper focuses on a probabilistic rebroadcast protocol based on neighbor coverage to reduce the routing overhead in MANETs. Keywords - Mobile Ad Hoc Networks, Neighbor Coverage, and Network Connectivity, Probabilistic Rebroadcast, Routing Overhead, AODV.

Providing security of communications in Mobile Ad hoc Networks (MANETs) is one of the most significant fields for researchers. In order to provide security, the first step is to recognize vulnerabilities and examine different implementable attacks regarding such networks. Secure routing is one of the most important security blind spots regarding MANETs. Security of routing in MANETs can be endangered by uncooperative behavior of nodes. Uncooperative behavior can be done selfishly by refraining from participation in routing or maliciously in the form of an attack against network. One of the most famous and devastating routing attacks regarding MANETs is Black hole. In Optimized Link State Routing (OLSR), as one of the most well-known proactive routing algorithms, Black hole attack can be implemented in different methods. In this paper, effects of different selfish behaviors and different implementations of Black hole on OLSR based MANETs is studied. In order to evaluate network parameters, network simulator (NS-2) tool has been used. Simulation results demonstrate that a special implementation of Black hole, compared to other implementations and selfish nodes, has had more destroying effects on the network. Furthermore, such an attack results in a reduction in routing overhead and delay in transmitting packets compared to basic OLSR. Keywords-Mobile Ad hoc Network; Black hole Attack; Selfish Node; OLSR

The widely-used protocol in Mobile Ad hoc Networks (MANET) achieves a dynamic, self-organizing and on-demand multi-hop routing by means of the AODV routing protocol. In AODV, wireless links disconnect occasionally because the nodes on the routing path are unreachable, which makes AODV inefficient and unreliable. By constructing a mesh structure, AODV-BR improves AODV routing protocols and provides multiple alternate routes. The algorithm establishes the mesh and multi-path with the RREP of AODV, which does not transmit many control messages. In this paper, a new improved protocol AODV-BRL is proposed to increase the adaptation of routing protocols to topology changes by modifying AODV-BR. In AODV-BRL the alternate routes are created by the Extended Hello Message as well as RREP packets. Then the Extended Routing Table and the least hop count first (LHF) are proposed to determine the optimal alternative route that significantly reduces the distance between the repair node and the destination. Finally, the performance improvement is evaluated by simulations. According to simulation results it is evident that compared with AODV-BR and AODV, AODV-BRL has a higher packet delivery ratio and lower routing overhead.

Communication Framework for Jointly Addressing Issues of Routing Overhead and Energy Drainage in MANET

Mobile ad hoc networks (MaNeT) play an important role in connecting devices in pervasive environments. Each node in MaNet can act as source and router. In this paper, we propose a hybrid routing protocol with Unicast Reply(HRP-UR) which combines the merits of both proactive and reactive approach. Like proactive approach, it maintains routing table at every node. However, it differs from proactive approach; that the routing table is not built prior to communication. Routing table are built in incremental steps during route discovery. Route discovery takes place like reactive approach only on demand. HRP-BR takes advantage of broadcast nature in MaNet for route discovery and store maximum information in the routing tables at each node. Broadcast nature avoids handshaking of RTS and CTS and effectively utilize trans-receiver antennas which reduce power consumption and effectively utilize bandwidth. HRP-BR is compared with existing AODV routing protocol which shows significant reduction in routing overhead, end-to-end delay and increases packet delivery ratio.

Mobile ad hoc networks (MANETs) are attractive for many applications because of their easy‐to‐use and self‐organising nature. However, the routing overhead problem has always been a bottleneck restricting the development of MANETs technology. The reason behind is the traditional blind flooding methods and frequent route initiations caused by node mobility. Reducing routing overhead has a huge impact on saving energy consumption of mobile nodes and improving the MANETs performance. In this study, a distributed dynamic routing algorithm is proposed to establish an efficient routing mechanism for MANETs. Based on the mobility of nodes, a fuzzy positional relationship between nodes is constructed. Using this relationship, an improved routing method is designed. The authors characterise this relationship between nodes and implement the proposed algorithm in an ad hoc routing architecture. The simulation results show that the proposed routing algorithm achieves good performance in reducing routing overhead and improves the efficiency of packet transmissions in MANETs.

In Mobile Ad-hoc networks (MANET), power conservation and utilization is an acute problem and has received significant attention from academics and industry in recent years. Nodes in MANET function on battery power, which is a rare and limited energy resource. Hence, its conservation and utilization should be done judiciously for the effective functioning of the network. In this paper, a novel protocol namely Energy Reduction Multipath Routing Protocol for MANET using Recoil Technique (AOMDV-ER) is proposed, which conserves the energy along with optimal network lifetime, routing overhead, packet delivery ratio and throughput. It performs better than any other AODV based algorithms, as in AOMDV-ER the nodes transmit packets to their destination smartly by using a varying recoil off time technique based on their geographical location. This concept reduces the number of transmissions, which results in the improvement of network lifetime. In addition, the local level route maintenance reduces the additional routing overhead. Lastly, the prediction based link lifetime of each node is estimated which helps in reducing the packet loss in the network. This protocol has three subparts: an optimal route discovery algorithm amalgamation with the residual energy and distance mechanism; a coordinated recoiled nodes algorithm which eliminates the number of transmissions in order to reduces the data redundancy, traffic redundant, routing overhead, end to end delay and enhance the network lifetime; and a last link reckoning and route maintenance algorithm to improve the packet delivery ratio and link stability in the network. The experimental results show that the AOMDV-ER protocol save at least 16% energy consumption, 12% reduction in routing overhead, significant achievement in network lifetime and packet delivery ratio than Ad hoc on demand multipath distance vector routing protocol (AOMDV), Ad hoc on demand multipath distance vector routing protocol life maximization (AOMR-LM) and Source routing-based multicast protocol (SRMP) algorithms. Hence, the AOMDV-ER algorithm performs better than these recently developed algorithms.

A set of wireless mobile nodes is referred as a Mobile Ad Hoc Network (MANET) that forms a huge system with no centralized management or framework. Because of the mobile nodes that depend on batteries for power, one of the main constraints of MANET seems to be energy consumption. As nodes change and move their places quickly across MANET, batteries quickly run out of power. The capability and behavior of mobile nodes are not similar, and they are typically not identical to one another in a network. For transmitting the data, the path discovery procedure is performed in MANET. Some nodes perform better packet sharing, resulting in variable node energy levels, so those nodes reduce their transmission level to the target from a source node. Because of this procedure, the duration of the system gets reduced, and the utilization of energy becomes higher. Routing with higher energy efficiency and attacks are the most raised problems in MANET. As a result, MANET suffers from more security-related issues. Therefore, an optimization strategy-based energy-efficient routing model is developed in MANET to provide stable communication. In this model, the Fused Locust Swarm with Dragonfly Optimization Algorithm (FLS-DOA) is implemented to optimally select the best paths for better routing in MANET. The multi-parameters like packet delivery ratio, link cost, remaining energy, bandwidth, packet energy cost, hop count, throughput, end-to-delay, security, path loss, routing overhead ratio, battery, and energy consumption are considered during optimization. The developed model is given additional security against unwanted access. From the result, the throughput of the developed model is 0.95 at the 2000 rounds. Accordingly, the throughput of the traditional techniques like ORSMAN, BPSO, GA, and EEE-SR is 0.62, 0.74, 0.79, and 0.85 at the 2000 rounds. The numerical findings are evaluated with the baseline optimization-based routing approach in MANET to guarantee the performance of the offered approach.

An efficient self-attention-based conditional variational auto-encoder generative adversarial networks based multipath cross-layer design routing paradigm for MANET

In dynamic wireless networks like Mobile Ad Hoc Networks (MANETs), where nodes communicate without a fixed infrastructure, ensuring secure and efficient communication is crucial due to inherent vulnerabilities such as malicious attacks and energy constraints. To address this issue, this study introduces a novel approach that combines Tasmanian Devil Optimization (TDO) and Gazelle Optimization Algorithm (GOA), termed Hybrid Tasmanian Gazelle Optimization (HTGO). This approach is designed to enhance energy-efficient routing and secure communication in MANETs. The HTGO method combines the strengths of local exploration from the TDO and global exploitation from the GOA which increases the overall performance in cluster head selection. The system optimizes routing paths by considering various factors such as energy consumption, communication cost, trust, and network load. Additionally, the study integrates fuzzy logic-based trust evaluation to increase security by detecting malicious nodes during data transmission. The system is implemented and tested on a simulation platform, with performance evaluated using key metrics such as Packet Delivery Ratio (PDR), energy consumption, network lifespan, delay, Packet Loss Ratio (PLR), and detection rate of malicious nodes. Experimental results show that HTGO outperforms existing methods by achieving longer network lifetime, higher PDR, lower energy consumption, and a reduced delay. It also demonstrates superior security with a detection rate of 93% for malicious nodes, highlighting its effectiveness in both energy optimization and secure communication in MANETs. This study contributes to more secure and energy-efficient routing in MANETs, which provides an ideal solution for dynamic and vulnerable wireless network environments.

This study presents with the routing overhead analysis of impulse radio - Ultra Wide Band based wireless networks which Employs Dynamic Nature Routing (EDNR) method for determining and selecting the stable route in Mobile Adhoc Network (MANET). This method requires only two sample packets and uses piggyback information on Route-Request (RREQ) and Route-Reply (RREP) packets during a route-discovery procedure. Conventional ENDR results in better routing overhead and packet delivery ratio characteristics with higher energy consumption. The proposed method explores the characteristics of UWB nature of routing based on Node lifetime and Link lifetime prediction for reducing the required bandwidth while maintaining higher packet delivery and lower routing overhead. Simulation results illustrate the improvement of packet delivery ratio by 5% and reduction of routing overhead by 4.8% of the proposed UWB EDNR method over the conventional EDNR method. For higher packet delivery ratio and reduced routing overhead with efficient bandwidth utilization can be achieved by applying UWB based EDNR routing that is desired for real time data communications.

On improving the efficiency of truthful routing in MANETs with selfish nodes

In mobile ad hoc network (MANET) for effective routing neighbor discovery and route maintenance is an important process. Neighbor discovery used to find the neighbor nodes inside the coverage region of active nodes. It is initialized by every node which exists in the network. Normally neighbor nodes are discovered by HELLO protocol. In self organizing wireless network HELLO protocol is very important. Additional packets in the network result in routing overhead, which is necessary for a proper session, but decreases the performance of the routing protocol. We focus on reducing the overhead to improve the protocol performance. In the existing hello process, all the nodes exchange hello packets with their neighbors with a fixed interval. Due to the uncertainty and irregularity of the mobile network parameters, the interval of hello packet emission should be determined dynamically. Our proposed hello process allows only the members of the active route and their neighbors to exchange hello packets. The interval of hello packet transmission is computed by each node, independent of others, based on the current number of neighbor table entries. The simulation is done in ns2.34 and Ad Hoc On-Demand Distance Vector (AODV) routing protocol is used for the implementation of the proposed scheme. The routing overheads obtained by the proposed and existing hello processes are compared to show a high reduction in routing overhead by the proposed one.

Mobile Ad Hoc Networks (MANETs) are dynamic, self-organizing networks that lack a fixed infrastructure, making them highly vulnerable to various security threats. One of the critical aspects in MANETs is the establishment of efficient and secure communication among mobile nodes. Routing protocols play a pivotal role in ensuring reliable data transmission in such environments. This paper presents a comprehensive overview of the challenges and solutions related to achieving secure and efficient communication within MANET routing protocols. The main objective of this paper is to define the path for security and to further improve throughput, routing overhead, end-to-end delay, packet delivery ratio, and at the same time to create an energy-enhanced way with excellent security. Implementation of cryptographic algorithms for the information is done in such a way that it is impossible for attackers to compromise the resources of information sent over the web. This paper proposes a new intrusion detection system called Enhanced Adaptive 3 Acknowledgement (ECC-EA3ACK), using EA3ACK with Elliptical Curve Cryptography (ECC) specially designed for MANETs. In this ECC, there is a two-key encryption technique based on elliptic curve theory that can be used to create faster, smaller, more energy-efficient cryptography. The above-developed on-demand routing protocol achieves better results than the existing model through one of the leading simulators called Network Simulator (NS2), which is used to implement and test the proposed system. The proposed cryptography provides secured transmission, reduces routing overhead, improves packet delivery ratio, throughput, and minimizes delay due to increased remaining energy and improved security.

Ad hoc networking refers to as network with no fixed Infrastructure.When the nodes are assumed to be capable of moving in the network, then networks are referred as MANETs (mobile ad hoc networks).Security is a paramount challenge in Ad hoc networks.Because of shared broadcast radio channels, insecure operating system, Limited resources, changing network membership, dynamic and arbitrary topology, no central authority, MANETs networks are sensitive and vulnerable to many security attacks.MANETs have critical application such as military applications and civilian application.In such applications, secure communication is of prime importance.Most of MANETs routing protocols works on trustworthy collaboration among participating nodes which leads to security threats.Lack of authentication and identification mechanism is another shortcoming in routing protocols due to which security issues arises in MANETs.There are many security attacks which occur on MANETs, Blackhole and Grayhole attacks being one of them.AODV protocol is effective and efficient in MANETs environment and is vulnerable to both Blackhole and Grayhole attack.A Blackhole attack is one in which malicious node falsely advertises itself as good path or stable path to destination during route discovery and malicious node starts dropping the packets instead of forwarding to destination.Grayhole attack is an extended version of the Blackhole attack where adversary behaves as a genuine node for certain time and turns into malicious node later on.In this paper, we proposed a modified version of AODV routing protocol that detect attacks before route discovery and during route discovery with high packet delivery ratio, low routing overhead and maintenance overhead.