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

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.

Routing in mobile ad hoc networks (MANETs) is a hectic challenge due to the dynamic nature of the network. The provisional communication links are assured due to the infrastructure-independent capability of MANET, but with no proper centralized monitoring process, which makes routing in MANETs with respect to the security and trust a major issue. Thus, the paper introduces Advanced Encryption Standard-enabled Trust-based Secure Routing protocol based on the proposed Dolphin Cat Optimizer (AES-TDCO), which is an energy and trust-aware routing protocol. The proposed Dolphin Cat Optimizer is engaged in the optimal route selection based on the modeled objective function based on the trust factors, recent trust, historical trust, direct and indirect trust in addition to delay, distance and link lifetime. The Dolphin Cat Optimizer is the integration of Dolphin Echolocation and Cat Swarm Optimization algorithm that inherits the faster global convergence. The simulation using 75 nodes revealed that the proposed routing protocol acquired the maximal throughput, minimal delay, minimal packet drop and detection rate of 0.6531, 0.0107, 0.3267 and 0.9898 in the absence of network attacks and 0.7693, 0.0112, 0.3605 and 0.9961 in the presence of the network attacks.

A Mobile Ad Hoc Network (MANET) is a dynamic wireless network that can be formed without the need for any pre-existing infrastructure in which each node can act as a router. Due to bandwidth constraint and dynamic topology of mobile ad hoc networks, multipath supported routing is a very important research issue. This paper proposes a Network Coding-based AOMDV routing algorithm in MANET (NC-AOMDV). It is typically proposed in order to increase the reliability of data transmission or to provide load balancing. In our simulation, we compare NC-AOMDV routing protocol with AODVM routing protocol, in terms of the packet delivery ratio, packet overhead, and average end-to-end delay when a packet is transmitted. The simulation results show that the NC-AOMDV routing protocol provide an accurate and efficient method of estimating and evaluating the route stability in dynamic MANETs.

Quality of service (QoS) and security have been considered as two competent units to govern and administer end-to-end traffic across network. A mobile ad hoc network (MANET) is a type of wireless communication, every node can act as a router or base station. Secure QoS-based routing is an important problem in MANET. A hierarchical key ranking (HKR) model is presented here for secure group communications in MANETs. To enhance the security, one-to-one random mapping is performed using hash-based message authentication code (HashMAC). Due to the dynamic nature and topological changes in MANET, group safeguarding is efficiently accomplished. For secure group communication and efficient QoS routing in MANET, a sector key (SK) is shared among group members to encrypt group messages which is obtained using secured message authenticated code (SMAC). The primary design is to include the group members in sector to vigorously contribute to the security of the multicast group, as a result dropping the communication and calculating load on the source. Experimental evaluation is done to estimate the performance of the proposed secure QoS routing and communication using hierarchical key ranking [SRHKR] in MANET in terms of delivery rate, security level, delay.

Applications of mobile ad hoc networks (MANETs) have gained increasing popularity among different areas of human life and significantly attracted the attention of the researchers in this field. Routing in a MANET plays the vital role in its real-world application. Further, routing in MANET is associated with a set of issues that need to be addressed before its implementation. The issues include satisfaction of specified quality of service (QoS) requirements and security issues. In this paper, we have addressed security issues as our point of focus. Again, security issues can be addressed using various algorithms and out of all, evolutionary technique-based algorithms appear to be more effective for the purpose. Ant colony optimization (ACO) is one of the most popular evolutionary algorithms for optimization. We have carried out an extensive review of ant colony optimization (ACO)-based secure MANET routing protocols and the contents of this paper can help researchers in the field of MANET to devise secure routing protocols, especially using ACO algorithm for addressing the security issues in a MANET.

A dynamic network self configuring and multi-hop in nature without having any fixed infrastructure is called a mobile ad-hoc network(MANET).The main drawback of such types of networks is the occurrence of various attacks such as unauthorized data modification impersonation etc which affect their performance. Biometric perception is specified as the most novel method to protract security in various networks by involving exclusive identification features. The attainment of biometric perception depends upon image procurement and biometric perception system. Simulation as well as experimental results signifies that this proposed method achieves better performance parameters values for various mobile ad-hoc networks.

The system in which wireless device self configure, establish and communicate from one end to the other using wireless channel with no existing fixed network is known as Mobile ad hoc network (MANET). The MANET is another varient of Ad-hoc network, which creates short-lived network using wirelss mobile devices. In ddition to MANET, the behaviour of this kind of temporary networks depends on routing protocols. The large number of routing techniques has been presented in the literature, but it is also been stated that routing is one of the key research issue even till today. This research article examines the performance of nature inspired algorithm such as Petal Ant Routing (PAR) with classical based routing such as Dynamic source routing in MANET. The simulation of both routing is carried using Network Simulator (NS2 version 2.35) and evaluted for different network parameters.

Mobile Adhoc Networks (MANETs) have emerged as a popular technology because of their wide application and independent mobility. Nevertheless, communication through MANETs can be effective because of their inherent nature of high mobility, which in turn results in a higher rate of data loss and delay. Therefore, for effective communication to be achieved, the MANETs’ routing performance must be enhanced. Some extant routing protocols like AOMDV can yield moderate Routing Overhead (RO) during communication. The review of previous studies shows that there is a need for improvement in the following areas: Computational E2E delay: the proposed Genetic Algorithm- Ant Colony Optimization (GA-ACO) was unable to reduce the computational E2E delay that occurs during communication. RO: The schemes that were proposed failed to minimize the RO in the network. Energy consumption: the reduction energy consumed by the network was reduced, however, high throughput and PDR could not be achieved by the method. On the contrary, the EHO-based AOMDV routing protocol achieved low E2E delay and RO but was unable to decrease the energy consumed by the network. Throughput and PDR: The protocol proposed failed to achieve high Quality of Services (QoS). Consequently, this paper aims to provide a solution to this communication problem by proposing a Hybrid Optimization-based Effective Path Selection and Multipath routing (HOEPSM) approach for MANETs. The proposed approach, which is HOEPSM is made up of two parts: Elephant Herding Optimization (EHO)-based AOMDV routing protocol, which makes use of EHO for the identification of the shortest path from the source to the destination. The second part which is the Hybrid optimization using Genetic Ant Optimization (GAO) algorithm, involves finding the best solution through the use of a GAO-based hybrid optimization algorithm. The results of the study revealed that the use of the HOEPSM causes a significant decrease in routing RO while enhancing the network’s Quality of Forwarding (QoF) of the network. Also, the simulation of the proposed approach was carried out in NS2, and afterward, compared with earlier proposed methods like DRARP and MDRARP. Based on the simulation results, the HOEPSM outperformed the other methods, with high Energy Efficiency (EE) (91%), Packet Delivery Ratio (PDR) (95%), RO (155), and End to End (E2E delay) (102ms). These results can be attributed to the HOEPSM’s choice of the best and steady route from the source nodes and destination nodes.

ZhuJi,WeiYuandK.J.RayLiu,Fellow, IEEE Abstract—In self-organized mobile ad hoc networks (MANETs) where each user is its own authority, fully cooperative behaviors, such as unconditionally forwarding packets for each other or honestly revealing its private information, cannot be directly assumed. The pricing mechanism is one way to provide incentives for the users to act cooperatively by awarding some payment for cooperative behaviors. In this paper, we consider efficient routing in self-organized MANETs and model it as multi-stage dynamic pricing games. A game theoretical framework for dynamic pricing-based routing in MANETs is proposed to maximize the sender/receiver’s payoff by considering the dynamic nature of MANETs. Meanwhile, the forwarding incentives of the relay nodes can also be maintained by optimally pricing their packet-forwarding services based on the auction rules and introducing the Cartel Maintenance enforcing mechanism. The simulation results illustrate that the proposed dynamic pricing-based routing approach has significant performance gains over the existing static pricing approaches.

Routing in Mobile Ad Hoc Networks (MANETs) is critical. As such, there are many routing protocols that have been proposed over the years. Each routing protocol has weaknesses and strengths. Currently, much of research on routing protocols in MANETs concentrates on literature reviews, performance comparison and proposition of new protocols. However, there has been very little or no attempt to examine the possibility of combining several routing protocols for effective routing in MANET. By highlighting the characteristics, strengths and weaknesses of eight routing protocols selected from the Flat Routing, Hierarchical/hybrid Routing, and Geographical Position Assisted Routing protocols, this article attempts to establish whether different routing protocols in MANETs can be combined for effective routing. A hypothetical situation that uses a combined Zone Routing Protocol (ZRP) and Location-Aided Routing (LAR) for cluster networking is used for the sake of the proposition. This paper refers to such protocol as ZRP-LAR driven. According to the findings from the literature review on MANETs routing protocols, this study establishes that it is possible to combine more than one routing protocols in MANETs to achieve effectiveness in packets transmission.

This study principally addresses the challenges associated with streaming videos in wireless Mobile ad hoc networks (MANETs), primarily constrained by wireless channels and node mobility. This study proposes a novel routing protocol incorporating a feedback mechanism and cross-layer architecture, supported by three key enhancements. First, it incorporates a route recovery strategy for detecting link failures and re-establishing connections based on predefined Quality of Service (QoS) metrics. Second, a novel algorithm estimates the available bandwidth, enabling dynamic adaptation of bitrate at the application layer concerning the source video. This novel rate-adaptive approach utilizes a scalable layered structure of the video coding, thereby removing layers that the network cannot efficiently support due to bandwidth limitations. Third, a gateway discovery procedure enhances the connectivity among MANETs and other infrastructure networks. This method employs available bandwidth as a parameter while selecting appropriate gateways and dynamically adjusts operational parameters like proactive area size and advertisement message frequency. The performances of the proposed Enhanced OLSR (E-OLSR) protocol are compared with the state-of-the-art routing procedures such as Adhoc on-demand distance vector (AODV), destination sequenced distance vector (DSDV), and optimized link state routing (OLSR), in terms of metrics like packet delivery ratio (PDR), end-to-end (E2E) delay, throughput, as well as energy consumption. The simulation results demonstrated notable improvements, including reduced packet delay, fewer dropped packets, and decreased link failures, indicating effective utilization of available bandwidth. The overall performance of the proposed E-OLSR protocol exceeds other traditional protocols and its security is enhanced through the integration of Blockchain Technology.

Mobile ad hoc networks (MANETs) are infrastructureless and distributed communication systems that require sophisticated approaches to routing to cope with node mobility and heterogeneous application requirements. In the past few years, distributed hash table (DHT) has come forth as a useful additional technique to the design and specification of spontaneous and self-organized networks. Researchers have exploited its advantages by implementing it at the network layer and developing scalable routing protocols for MANETs. The implementation of DHT-based routing in a MANET requires different algorithms and specifications compared to routing in the Internet because a MANET has its unique characteristics, such as node mobility, spontaneous networking, decentralized architecture, limited transmission range, dynamic topology, and frequent network partitioning/merging. In this article, we present a comprehensive survey of research related to DHT-based routing that aims at enhancing the scalability of MANETs. We present a vivid taxonomy of DHT-based routing protocols and the guidelines to design such protocols for MANETs. We compare the features, strengths, and weaknesses of existing DHT-based routing protocols and highlight key research challenges that are vital to address. The outcome of the analysis serves as a guide for anyone willing to delve into research on DHT-based routing in MANETs.

The need for supporting real time multimedia applications for users of Mobile Ad hoc Network (MANET) is becoming essential. The aim of this paper is to construct bandwidth-satisfied multicast tree for QoS routing in TDMA-based mobile ad hoc networks. The paper proposes an efficient path bandwidth calculation algorithm. An effective multicasting routing algorithm is presented to build a multicast tree among all the multicast members. Simulation results show that compared with MAODV, our proposed QoS routing algorithm can significantly improve the performance of QoS multicast routing in MANETs in terms of success ratio and average delay.

The demands of a higher degree of security level for the mobile ad-hoc network are yet to meet the best solution. Owing to the dynamic topology and decentralization issue, the mobile node suffers from a consistent security problem during communication stage. This paper has reviewed the existing system towards secure routing in mobile ad-hoc network and explored that there are still a lot of scopes to enhance the security level. This paper presents a non-cryptographic technique called as JIR2TA or Joint Invocation of Resource-based Thresholding and Trust-oriented Authentication using resource and trust factor to intensify the routing policies for strengthening the authentication process of a mobile node. The outcome of the study shows better packet delivery ratio, computational time, throughput, and end-to-end delay in contrast to existing secure routing technique.

Mobile ad hoc networks (MANETs) are consists of mobile devices connected wirelessly. Mobile nodes in MANET are applicable of routing functionality, where messages are forwarded in a multi-hop fashion. In such a communication scheme a routing protocol play an important role in the network performances. The wireless connectivity and node mobility in MANET networks contributes in rapid topological changes, which brings the need for a channel aware routing protocol. To overcome this problem, many channel aware routing metrics are proposed in the literature, however these routing metrics are either utilizing the shared bandwidth to measure the link quality, or they implies less awareness to the link quality. This paper proposed a SNR-based routing metric for Dynamic Sequence Distance Vector (DSDV) routing protocol. This paper starts by investigate and compare the performance among common routing protocols in MANET. Secondly a cross layer approach is proposed for the new routing metric. Simulation scenarios are used for the work of the paper. The new metrics is implemented in one of the MANET common routing protocols DSDV module in MONET++. The results show that SNR-based DSVD improves the performance of the MANET in terms of throughput and delay.