Mobile Ad Hoc Networks Research Articles

An Energy-efficient Routing Protocol Based on Elephant Herding Optimization in MANET

Background: A mobile ad hoc network (MANET) is a collection of self-organizing mobile nodes creating an ad hoc network without fixed infrastructure. Routing is a major issue in mobile networks that may reduce network performance due to frequent network topology changes. Routing protocols are so important in dynamic multi-hop networks that many studies have focused on the routing problem in MANETs. Methods: In this research work, a proposed ad hoc on-demand distance vector (AODV) with an elephant herding optimization (EHO) called AODVEHO is used as an optimal path selection method that creates a set of best paths between destination and source. Results: To validate the performance of proposed AODVEHO, AntHocNet, AODV, and designation sequence distance vector (DSDV). Various performance measures are considered to validate our proposed research work, such as packet delivery ratio (PDR), end-to-end delay (E2ED), and average energy consumption (AEC). Conclusion: Experimental results are indicated that the AODVEHO achieved a higher routing overhead (73 %), PDR (89.87 %), low E2ED rate (95.22 %), AEC (75.60 %), and dead nodes (75%) when compared to other routing schemes.

Multipath Routing with Dynamic Load Balancing for Enhanced Energy Efficiency in Zone-Based Wireless Ad Hoc Networks

Mobile Ad hoc Networks (MANETs) consist of independent, self-organized mobile nodes capable of wirelessly communicating with each other in a reliable and secure manner. One of the major challenges in MANETs is energy consumption, as the lifetime of a node's battery is limited. This limitation can affect both network connectivity and the lifetime of individual nodes. Various protocols, proposed by the IETF and other solution providers, have aimed to optimize bandwidth, transmission quality, and power control, but none have significantly improved energy consumption. In response to these challenges, the proposed protocol is the Dynamic Load Balancing in Multipath Energy-Consuming Routing Protocol (DLB-MERP) for Wireless Ad hoc Networks. DLB-MERP can be viewed as an extension of the AOMDV protocol and is classified as a zone-based routing protocol, though it incorporates superior load balancing and energy management techniques. It introduces the concept of virtual zones to manage and distribute energy consumption in an organized way. The protocol selects communication paths based on the availability of node energy and power levels. A leader node is defined within each zone, chosen based on its energy level, load, and channel strength, to optimize energy usage. This method increases network resiliency through multipath routing, thereby enhancing overall network performance and extending network lifetime. DLB-MERP effectively addresses the limitations of existing energy-aware routing methodologies by balancing energy consumption, leading to prolonged network operation.

Implementation of A Delay-Tolerant Routing Protocol in the Network Simulator NS-3

The paper explores the implementation of the Epidemic Routing Protocol using the NS-3 simulator, focusing on its application in intermittently connected networks like Mobile Adhoc Networks (MANETs). The Epidemic Protocol maximizes message delivery by flooding the network with multiple copies, ensuring reliability even in sparse or highly mobile environments. Through NS-3 simulations, the study examines the protocol’s performance, considering factors such as network size, node mobility, and message Time-To-Live (TTL). The simulation, which models an ad-hoc wireless network using IEEE 802.11b, demonstrates that the protocol achieves a 100-percentage packet delivery ratio with minimal latency. Tools like NetAnim provide detailed insights into node interactions and message dissemination, highlighting the protocol’s effectiveness in maintaining communication under challenging conditions. The paper concludes that while the Epidemic Protocol is resource- intensive, it is highly effective for scenarios where traditional routing methods fail, offering a reliable solution for dynamic and partitioned network.

Deep Artificial Immune System With Malicious Node Detection and Secure Routing Protocol in MANET

ABSTRACTIn the context of Mobile Ad Hoc Networks (MANETs), the dynamic and decentralized topology poses significant challenges like unreliable connectivity, limited bandwidth, node mobility, and vulnerability to security threats from malicious nodes. Ensuring secure and energy‐efficient data transmission in such environments is crucial for mission‐critical applications. This research addresses these pressing challenges by introducing a robust routing protocol capable of detecting and mitigating malicious nodes, thereby enhancing MANET's Quality of Service (QoS). The proposed approach, the Dendritic Cell with Adaptive Trust Q‐learning Protocol (dDC‐ATQP), integrates several innovative techniques to tackle these issues. Firstly, the trust evaluation mechanism assesses the behavior of nodes to identify potential malicious actors, mitigating the effect of malicious nodes on system execution. Secondly, the adaptive routing strategy optimizes data transmission paths based on real‐time network conditions, reducing latency and packet loss. To evaluate the effectiveness of this approach, extensive simulations are conducted using a range of performance metrics. The results demonstrate significant improvements over existing methods, including a throughput increase of (79.2% in 50 s), lower end‐to‐end‐delay (0.075 s for 20 nodes), energy consumption of (38.55/J), higher packet delivery ratio (98% for 20 nodes), reduced packet loss ratio (5% for 100 nodes), enhanced security (80% for 70 nodes).

Denial-of-service attack (BH and PDA) effect analysis on AODV Routing Protocol with Random Mobility

Mobile ad hoc networks (MANETs) has received significant attention in the research domain of routing protocol as they provide security to transmit the data at the destination node. Mobile ad hoc networks do not have a fixed infrastructure, and nodes have random mobility due to this network topology changing dynamically and it vulnerable to external threats. Block hole and packet dropping are well-known network layer Denial of service attacks. during the route, discovery phase malicious nodes work normally and it became the shortest path to route the data and after that, it will drop all the data instead of transferring the data to the destination and in case of the packet dropping attack node drop the packet due to the elfishness of a node, Lack of energy resources, Bandwidth consumed by the attacker node, Overflow of the transmission queue, Misbehavior of a malicious node, it will drop the packet in the network. In this paper, we analyze the impact of both attacks on the AODV routing protocol in the random mobility environments with the different simulation parameters. DOI: https://doi.org/10.52783/pst.922

A Secure Routing and Black Hole Attack Detection System using Coot Chimp Optimization Algorithm-Based Deep Q Network in MANET

A Mobile Ad hoc Network (MANET) is a widely used and vibrant network, which is unevenly distributed in the environment. It is a set of self-organized independent mobile nodes interconnected without any centralized infrastructure. However, this topology nature makes the network prompt to various network security attacks. To address this issue, this paper proposes a Coot Chimp Optimization Algorithm- Deep Q-Network (CChOA-DQN) for detecting the black hole attacks in MANET. Here, the designed CChOA is used for the identification of the optimal route in the MANET for transmitting data, which takes into fitness parameters, such as energy, distance, neighbourhood quality, link quality, and trust. The features are extracted using the Fisher score and augmented using the over-sampling technique, which is further allowed for the detection process using DQN. Also, the weights of the DQN are enhanced using the CChOA algorithmic technique to enhance the detection performance. Additionally, the results gathered from the experiment revealed that CChOA attained high performance with a maximum of 0.983Mbps throughput, 93.70% Packet Delivery Ratio (PDR), and minimum end-end delay of 0.096Sec, Residual energy of 0.119J, and Control overhead of 4473.11. Also, the CChOA-DQN technique achieved the minimum False Positive Rate (FPR) of 0.122, False Negative Rate (FNR) of 0.121, Computation time of 0.153 and Run time of 0.094.

ENHANCING QUALITY OF SERVICE IN MANET ENVIRONMENTS WITH CRYPTOGRAPHIC SECURE MECHANISMS TO SECURE SUSTAINABLE SMART CITIES

The utilization of wireless sensor networks to gather, process, and act upon data may be a powerful tool in the development of a city-wide communication network that can accommodate many applications, ultimately leading to smart city solutions. Several challenges might be encountered by a smart city network. These include the need to adapt the network's coverage area to suit various applications, uneven distribution of nodes, a rise in message volume, the use of several communication technologies, and heterogeneity in both nodes and messages. There are many different facets of smart cities that are being studied, and certain applications are being created in each of them. Several options for smart city sensor networks are outlined in this article, which uses a survey format. Applications like ridesharing, emergency medical services, and others that depend on real-time traffic data supplied by the smart traffic domain are used to examine message transmission problems in this study. The versatility and speed with which Mobile Ad Hoc Networks (MANETs) may set up networks have led to their widespread use. Because mobile nodes function best in tandem and have faith in one another, we take a look at MANET routing algorithms and how they handle message transmission for this service.

The Meta-Heuristic routing method by integrating index parameters to optimize energy consumption and real execution time using FANET

Decreasing energy consumption in Unmanned Aerial Vehicles (UAVs) while simultaneously enhancing their reliability and processing capabilities is considered a fundamental challenge. The routing mechanisms employed in Flying Ad Hoc Networks (FANETs) are more complex compared to those in Mobile Ad Hoc Networks (MANETs) and Vehicular Ad Hoc Networks (VANETs), a challenge addressed by the FMORT method. To tackle these complex routing challenges, clustering techniques that utilize hybrid Meta-heuristic algorithms can be applied. Data analysis within the FMORT framework identified factors influencing service integration, leading to a reduction in redundant request transmissions and overall redundancy in the proposed method. The identification of food sources in the hybrid Meta-heuristic algorithm of the FMORT method is achieved through the integration of the Sparrow and Dragonfly algorithms. These algorithms work simultaneously to increase energy efficiency and increase network lifetime. This strategy optimizes information exchange by selecting an intelligent threshold detector and categorizing inputs, thereby minimizing node mobility. As a result, it improves performance metrics and decreases delivery costs, energy consumption, and delays. In the proposed method, a balanced performance is achieved by comparing existing methods in terms of transmission delay, Packet Delivery Ratio( PDR), throughput, and energy consumption. Simulation results show that the FMORT approach provides effective and stable outcomes in terms of reliability, decreased delays, and improved packet delivery rates. The FMORT framework includes principles for neighbor selection, determining suitable cluster heads, and scoring based on the average Euclidean distance. Additionally, it manages topology access, ensures proper distribution, guarantees data connectivity, and accurately categorizes inputs. By optimizing the sensitivity rate, this method minimizes the average delays and meekly values input data through effective load balancing. key parameters considered for real time optimization of overall performance include the number of cluster heads during re-clustering, the ratio of request-to-acknowledgment packet transmission, node, and network lifetime, end-to-end delay, and energy consumption. Ultimately, the simulation results show that compared to the MWCRSF algorithm, the average optimization of index parameters,% 0.73 decrease in energy consumption,% 2.23 network lifetime, 1.35 re-cluster construction time and also% 0.11 re-cluster lifetime has increased.

Hybrid optimization-based Effective Path Selection and Multipath routing in MANETs

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.

A Machine Learning-based Secured and Energy-efficient Data Transmission in Mobile Ad-Hoc Networks (MANET)

Mobile hoc networks (MANET) are wireless networks of mobile devices that set up Data Transmission (DT) links independently without a fixed framework. Because topology changes constantly, MANET lines are often interrupted and out of balance. So, making sure that DT works well and reliably while also making good use of network resources is a problematic issue that MANET needs to solve. The suggested solution is to create a DT method to deal with these issues. This method aims to improve DT by sending data as quickly as possible while using as little time. As learning examples, the suggested method uses a range of mobile gadgets. Support Vector Machine (SVM) classes are trained to be weak groups. Supervised SVM can sort the surrounding nodes into groups with better link quality and lower energy use. The results of weak learners are combined to create a robust classifier, which guarantees that the data transfer works well. An experimental test checks the amount of power used, the packet transfer rate, the time it takes, and the output. The number of mobile nodes and data packages will be changed during the analysis.

A Framework for Mitigating Gray Hole Attack On Mobile Ad Hoc Networks

posing a significant challenge to network performance and reliability. In a gray hole attack, a malicious node selectively drops packets while forwarding others, leading to increased packet loss and latency. This paper presents a novel Gray Hole Prevention algorithm designed to detect and mitigate the effects of such attacks, thereby enhancing the security and efficiency of MANETs. The proposed algorithm integrates existing techniques, specifically the Secure Detection Prevention and Elimination Gray Hole (SDPEGH) approach, with proactive measures to improve detection accuracy and minimize the risk of blacklisting legitimate nodes. Extensive simulations were conducted using the NS-2 simulation tool, comparing the performance of the proposed algorithm against traditional methods. The results demonstrate a significant improvement in network performance, with the GRAY-HP algorithm achieving a PDR of 92%, compared to 78% for the SDPEGH algorithm, representing an increase of 18%. Additionally, the throughput improved by 25%, reaching 85 kbps, while the energy consumption was reduced by 15%, indicating a more efficient use of resources. The routing overhead was also minimized by 20%, showcasing the algorithm's effectiveness in maintaining network stability. This research contributes to the field of network security by providing a robust solution to gray hole attacks, thereby enhancing the reliability and performance of MANETs. The findings underscore the importance of proactive security measures in dynamic and decentralized environments, paving the way for future advancements in secure communication protocols for mobile networks.

SDERP: Stable‐aware differential evolution‐based routing protocol for mobile wireless networks

SummaryA mobile ad hoc network (MANET) is a network with non‐wired communications and non‐centralized administration where all its nodes are mobile. Firstly, one of the leading drawbacks of wireless networks is their energy consumption because the constituent nodes of the network have a restricted battery capacity yet greater consumption caused by the mobility of the nodes, their processing power, the frequent sending of data, and so on. Secondly, data packets may be lost due to traffic, noise, or the mobility of nodes, whose data transmission in real‐time applications would be compromised by this loss. In order to resolve the problem of energy consumption and that of the loss of data packets for MANETs, we propose a new stable‐aware differential evolution‐based routing protocol (SDERP). We include a fitness function to select the best new path from all new paths issued at the end of this algorithm. This fitness function is based on energy constraints and link stability. The performance of our proposal is compared with OPAOMDV‐EE, FT‐AORP, EE‐LB‐AOMDV and AOMDV. The results show that our SDERP has better network performance than the other routing protocols. Specifically, it obtains a packet delivery ratio that is higher by up to 17%, an overhead ratio reduced by up to 33%, an energy efficiency better by up to 39%, and end‐to‐end delay reduced by up to 16%.

A Link’s Fineness Based on Spatial Relation for Multipoint Relays Selection Algorithm in Mobile Ad Hoc Networks Algorithm

The propagation of wireless mobile equipment has given rise to mobile ad hoc networks (MANET), which allow the establishment of networks deprived of infrastructure support. The improvements in these technologies have also resulted in the variety of link quality, scalability, stability and reachability limits. Principally, due to their incapability to guarantee node reliability, MANETs are weak in highly dynamic environment. Since high-speed nodes, low density, and rapid changes in the topology are directly damage networks performances and lifetime. In response, routing is an inspiring issue in these networks. This paper proposed a new routing scheme in MANETS. This technique is integrated in the optimized link state routing (OLSR). In the projected scheme, the author defines a link fineness based on spatial relation between mobile nodes, which exploits different parameters, speed, direction and acceleration, including the sent and received of hello packets. Correspondingly, the proposed selected multipoint relays (MPRs) based the projected methods is included in the algorithm. The scheme elected more stable MPRs with high link’s quality, more neighborhood degree and higher willingness as MPR that can increase the reachability and stability of the network even in an extremely dynamic situation. This version of OLSR is verified by the network simulator (NS3) under the Radom Waypoint mobility model. Results revealed an important improvement for SLF_OLSR. In addition, this scheme can be integrated into other protocols in MANETs.

Multi-objective-derived efficient energy saving in multipath routing for mobile ad hoc networks with the modified aquila–firefly heuristic strategy

Mobile ad hoc networks (MANETs) suffer from a major problem with the energy drainage of network nodes, as the mobile nodes rely on batteries and do not have a permanent power supply. Therefore, a new multipath routing technique, using a novel hybrid heuristic algorithm, is designed to solve the diverse metrics of a multi-objective function, including energy consumption, distance, routing overhead ratio, throughput, end-to-end delay and packet delivery ratio. This approach implements a new hybrid algorithm termed the modified aquila–firefly heuristic strategy (MA-FHS), which integrates the aquila optimizer and the firefly algorithm. This derived fitness function is applied to achieve optimal paths in multipath routing with minimization of the multi-objective function. The simulation demonstrates that the developed routing protocols outperformed traditional protocols under several network constraints.

Hybrid optimization-based secured routing in mobile ad-hoc network

Mobile Ad hoc Networks (MANETs) pose significant routing challenges due to their decentralized and dynamic nature. Node mobility results in frequent changes in network topology, leading to unsFIG connectivity and link quality. Traditional RPs designed for static networks are inadequate for MANETs. To deal with these issues, a secure routing approach is proposed using the Red Panda-Lyrebrid Optimization (RePLO) algorithm, which combines the advantages of the Red Panda Optimization (RPO) and Lyrebird Optimization Algorithm (LOA) algorithms. The proposed approach consists of five steps: (i) configuring the system model, (ii) developing the energy model, (iii) creating the mobility model, (iv) selecting cluster heads using the RePLO algorithm, and (v) routing using the RePLO algorithm. The RePLO algorithm optimizes cluster head selection and routing while considering specific constraints such as delay, distance, energy, & security for Cluster Head (CH) selection, and link quality and enhanced trust for routing optimization. The effectiveness of the proposed approach is evaluated using various metrics to demonstrate its efficiency in MANET routing. By integrating multiple optimization techniques and considering critical constraints, the RePLO algorithm offers a systematic and secure solution for MANET routing. The evaluation results confirm the efficacy of the proposed approach in improving network performance, reliability, and security. Overall, the RePLO algorithm presents a promising approach to tackle the routing issues inherent in MANETs, paving the way for more robust and efficient communication in mobile ad hoc networks.

OPTIMIZED DEEP LEARNING FOR CYBER INTRUSION DETECTION AND SECURED COMMUNICATION IN MANET

The popularity of the Mobile Ad-Hoc Network increases with low expense solutions to the real time applications. The dynamic nature, limited centralized system with low bandwidth often susceptible to the security threads and became the hot topic. To protect the MANET system it is essential to implement a secured system. The purpose of this work is to design an intelligent Cyber Security System (CSS) by collecting the threads data from the MANET system. Initially, the data is pre-processed using the Min-Max normalization technique, followed by the feature selection with the newly approached Mother Optimization algorithm (MOA). The feature selection is effectuated for speedy classification of intrusions and prevent the attacks and therein significantly enhances the security. To provide the security to the MANET system the work proposes a novel Adaptive Deep Belief Network (ADBN). This classifies the attacks and normal data and prevents the system from falling for the threat. Simulation is performed in NS2 and analyzed the effectiveness of the proposed work with existing systems. Our proposed work effectively enhances the security of the MANET system and surpasses all the other works.

An efficient optimization approach with mobility management for enhanced QoS and secure communication in flying adhoc networks

In biomedical Applications, Network plays a vital role to transmit the health-related information from patient to doctors which helps to save the human lives. During the data transmission, there is the possibility of data loss, delayed delivery, malicious attack and that leads to huge loss in human lives. To overcome this issue, a new technique Smart & secure Flying Adhoc Networks (FANET) architecture was proposed for the Quality-of-Service (QoS) improvement in biomedical applications. This research work helps society to save human lives during any emergency. With the integration of optimization and clustering techniques, the design configuration of the proposed architecture includes mobility management and secure transmission. The first phase includes sensing the patient's information by using Arduino IDE hardware. The sensed data will be transmitted through different types of networks including mobile ad-hoc networks, vehicular ad-hoc networks and flying ad-hoc networks. The routing protocol concentrates on clustering formation, mobility management, secure transmission and optimization. When compared to other type of networks, the proposed Smart & secure Flying Adhoc Networks (FANET) improves the network performance. The quality-of-service was achieved using the parameters such as network throughput, latency, delivery rate, routing overhead and control overhead.

Retraction notice: Intrusion detection in mobile ad-hoc network using Hybrid Reactive Search and Bat Algorithm

Retraction notice: Intrusion detection in mobile ad-hoc network using Hybrid Reactive Search and Bat Algorithm

An Analysis of Routing Protocol in Mobile Adhoc Networks and its Applications

Each hub in a mobile ad-hoc network (MANET) sends parcels bound for different hubs in the network by means of remote (radio transmission) transmission on a wilful premise, making it a self-beginning, powerful network made up of mobile hubs. Multi-bounce transferring is the essential inspiration for the advancement of ad hoc networking. Remote Ad hoc networks, otherwise called foundation less networks, can be set up rapidly and effectively using radio waves as the network's transmission channel. There is no principal server or referee in an ad hoc network. Every hub in a MANET is fit for playing out its own networking errands, for example, routing and bundle sending, in a decentralized and independent style. Uses of routing protocols like Ad hoc On-request Distance Routing Protocol (AODV), Dynamic Source Routing (DSR), Transiently Requested Routing Calculation (TORA), and Enhanced Connection State Routing (OLSR) are fascinating in light of the fact that routing is the focal issue in MANETs. These routing protocols are simulated using OPNET, and their effectiveness is investigated using various metrics. With the use of metrics, the most efficient channel for data transfer can be determined. The results demonstrate the viability of AODV and TORA for topology-changing in large-scale networks using a variety of criteria.

An effective channel allocation designed using hybrid memory dragonfly with imperialist competitive algorithm in distributed mobile adhoc network

SummaryThe channel availability problem reaches a higher degree in mobile ad hoc networks (MANETs) and garners a lot of attention in communication networks. Because increased mobile usage might result in a lack of channel allocation, an improved channel allocation technique is presented to tackle the availability problem. The distributed dynamic channel allocation (DDCA) model is built in this paper using the hybrid memory dragonfly with imperialist competitive (HMDIC) method. Based on optimization logic, this strategy assigns the channel to mobile hosts. The MANET provides a dispersed network within the coverage region in the absence of base station infrastructure. The HMDIC optimizer approach in this circumstance randomly begins every respective node to update and store their pbest value utilizing RAM dragonfly employing satellite images. The constraint values are then used to construct the cost function, which results in a strong kind of global optimum solution. The channels are therefore distributed in an effective manner. The HMDIC algorithm is used in this research to build a novel channel allocation system. It makes advantage of the exploration capabilities to successfully explore the individual node using MDA (Modified Dragonfly Algorithm) and locate the global best solution using imperialist competitive algorithm (ICA). Both of these combined tactics are more effective in accelerating the convergence of the allocation model. To validate the performance, the HMDIC‐based DDCA system provides promising results in terms of assigning available channels, thereby enhancing channel reuse efficiency and fractional interference.