Algorithm For Mobile Ad Hoc Networks Research Articles

Cross-Layer Energy Efficient (CLEE) Routing Algorithm for Mobile Ad-Hoc Networks

Ad-hoc routing algorithms in Wireless Sensor Networks (WSN) rely on nodes’ position awareness by regularly updating routing data of neighbouring nodes. Meanwhile, the transmission energy usage is not optimised as a result of this repeated updates and routing table deployment. Therefore, it is very critical to consider techniques of optimising or conserving energy in the design of wireless sensor networks (WSNs) in order to prolong the lifetime of the individual nodes. One of these techniques is the Cross-layer design which, is considered as an efficient method for addressing this challenge with WSNs. In this paper, we propose a Cross-Layer Energy Efficient (CLEE) routing algorithm to establish an optimal route from the source node to the destination node by selecting candidate nodes from neighbouring nodes based on the distance between these nodes and the rate of energy consumption by a possible candidate node. Then to select a designated node from the candidate nodes, the algorithm further computes the Signal Strength Quality (SQS) and the Link Lifetime (LL) as well as the Throughput (TH) rate of selected nodes. The proposed algorithm was simulated with a network size of 600 X 600 on Network Simulator 3 (NS3) in order to analyse its performance. An evaluation of the performance of the proposed CLEE protocol with existing similar protocols such as Ad-hoc On-Demand Distance Vector (AODV) and Dynamic Source Routing (DSR) reveals that CLEE outperformes AODV and DSR by conserving about 44% of available energy.

Performance evaluation with scalability varying on energy consumption in S-DYMO, M-DYMO and FB-B-DYMO routing algorithm in MANETs

Mobile Ad Hoc Networks (MANETs) are dynamic and self-configuring networks characterized by node mobility and decentralized operations. Efficient routing protocols play a crucial role in ensuring reliable communication while optimizing resource usage, particularly energy consumption. This paper presents a comparative performance evaluation of three prominent routing algorithms, such as S-DYMO, M-DYMO, and FB-B-DYMO, focusing on their scalability and energy efficiency in MANET environments. This study utilizes simulation-based experiments to assess the performance metrics of S-DYMO, M-DYMO, and FB-B-DYMO. Key parameters evaluated include packet delivery ratio (PDR), end-to-end delay, routing overhead, and energy consumption under varying network sizes and mobility scenarios. Each algorithm's ability to scale with network size and maintain performance under dynamic conditions is analyzed to understand its suitability for real-world MANET deployments. The results indicate that S-DYMO exhibits robust scalability and efficient energy utilization in small to medium-sized networks, leveraging its proactive route discovery approach. Conversely, M-DYMO demonstrates competitive performance in larger networks due to its reactive route maintenance strategy, which balances energy efficiency with scalability challenges. FB-DYMO, integrating feedbackbased mechanisms, shows promising results in mitigating routing overhead and energy consumption but exhibits sensitivity to network dynamics. The findings provide insights into the trade-offs between scalability and energy consumption inherent in S-DYMO, M-DYMO, and FB-B-DYMO routing algorithms, offering guidance for selecting appropriate protocols based on specific MANET deployment scenarios. Future research directions include enhancing protocol adaptability to dynamic network conditions and optimizing energy-efficient routing strategies tailored for evolving MANET environments.

Enhancing Congestion Control and QoS Scheduling Using Novel Rate Aware-Neuro-Fuzzy Algorithm in MANET

Mobile Ad Hoc Networks (MANET) provides a vibrant atmosphere wherein data may be substituted deprived of the necessity of human authority or a centralized server, as long as nodes work together for routing. As long as security throughout the multipath routing protocol and data transfer over many routes in a MANET is a difficult problem, this work offers a message security technique. This study presents the congestion control and QoS scheduling mechanism. The goal of this study is to examine standardized MAC protocols on MANET, to measure performance under various node densities and MAC protocols. Initially, this work presents the Centralized Congestion Detection method to detect congestion with baseline parameters. Accordingly, the congestion is avoided using Novel Rate Aware-Neuro-Fuzzy based Congestion Controlling strategy. This method effectively controls the congestion in the Network. This mechanism has been proposed which defines three levels of congestion based on which the data rate, throughput, overhead and delay. However, after controlling the congestion, the optimal routes are given to the packets by proposing an Ambient Intelligence-based Ant colony optimization quality-aware energy routing protocol (AIACOAR). This method finds the most efficient route to a destination and decreases the time and energy required. Accordingly, for securing the network against malicious attacks, an Elliptic Curve Cryptography (ECC) encryption mechanism is presented. Consequently, the multihop scheduler performs QoS-based scheduling in MANET. Schedulers in MANET take into account various QoS parameters such as end-to-end packet delay, packet delivery ratio, flow priority, etc. The proposed method is implemented using Matlab software, and the evaluation metrics are PDR, jitter, congestion detection time, delay, route selection time, and throughput. The performance of the proposed method is compared to the existing AIFSORP and LF-SSO techniques. While compared to these methods, the proposed method’s performance is improved in terms of PDR, delay, throughput, etc. The PDR value of the proposed method reaches approximately 99%, and it produces a very low delay. This produces reliable route discovery, optimized congestion control, and better QoS scheduling, therefore, these improve the system performance. In future, a recent bio-inspired technique is presented to even more minimize energy consumption and further improve the system's performance.

Secure Energy Aware Optimal Routing using Reinforcement Learning-based Decision-Making with a Hybrid Optimization Algorithm in MANET

Mobile ad hoc networks (MANETs) are wireless networks that are perfect for applications such as special outdoor events, communications in areas without wireless infrastructure, crises and natural disasters, and military activities because they do not require any preexisting network infrastructure and can be deployed quickly. Mobile ad hoc networks can be made to last longer through the use of clustering, which is one of the most effective uses of energy. Security is a key issue in the development of ad hoc networks. Many studies have been conducted on how to reduce the energy expenditure of the nodes in this network. The majority of these approaches might conserve energy and extend the life of the nodes. The major goal of this research is to develop an energy-aware, secure mechanism for MANETs. Secure Energy Aware Reinforcement Learning based Decision Making with Hybrid Optimization Algorithm (RL-DMHOA) is proposed for detecting the malicious node in the network. With the assistance of the optimization algorithm, data can be transferred more efficiently by choosing aggregation points that allow individual nodes to conserve power The optimum path is chosen by combining the Particle Swarm Optimization (PSO) and the Bat Algorithm (BA) to create a fitness function that maximizes across-cluster distance, delay, and node energy. Three state-of-the-art methods are compared to the suggested method on a variety of metrics. Throughput of 94.8 percent, average latency of 28.1 percent, malicious detection rate of 91.4 percent, packet delivery ratio of 92.4 percent, and network lifetime of 85.2 percent are all attained with the suggested RL-DMHOA approach.

Enhancing the network lifetime of a wireless sensor network using modified k-means Firefly Optimization

Developing technology including the Internet of Things, digital services, smart microgrids, and machine-to-machine systems encourage the implementation of self-configuring, automated systems in massive wireless sensor networks (WSNs). Effective Power utilization is critical in order to keep a network operational for the maximum possible time. Sensor nodes, which are small, battery-powered devices, are used in WSNs. As a result, one of the significant research issues in improving the lifespan of a WSN is resource management. A modified k-means (Mk-means) algorithm for clustering has been proposed to select Cluster Head (CH) to minimize energy usage of the nodes. Several optimization methods have been suggested in this area to extend the WSN lifetime. Following that, the Firefly Algorithm (FFA) is employed to generate the optimal routing through the CHs to a Base Station (BS), where multiple fitness functions such as residual energy, distance, and routing traffic are taken into account to optimize the FFA. As a result, information transmission among intermediate CHs in a hierarchy cluster-based design aids in lowering node energy usage. The proposed MKMFA (modified k-means Firefly Algorithm) technique’s performance is evaluated with K-means AODV (Ad-hoc On-demand Distance Vector) and IPC-KMAN(Improved Performance Clustering Using Modified K-Means Algorithm in Mobile Adhoc Networks) using network lifetime, throughput, Load Balancing Factor (LBF), and Packet Delivery Ratio (PDR). This work is based on recent advances in WSNs, which include application fields, design parameters, and lifetime prediction designs.

A self-adapting greedy forwarding algorithm for MANETs

As the population application of GPS, some greedy forwarding algorithms based on geographic information for MANETs (mobile ad hoc networks) are proposed in recent years. These algorithms have been well-designed from different aspects to improve its performance. On the basis of analysis of these algorithms, this paper presents modified methods to address some issues of GPSR (greedy perimeter stateless routing): dynamically adjusting the time interval of sending beacons according to the radio transmission; not only considering the distance between each neighbor and the destination, but also the neighbor node surviving ratio. Some relevant algorithms are described in the paper as well. The simulation results show the improved routing algorithm excels GPSR markedly in terms of delivery ratio and routing overhead while the transmission range is larger or the motion velocity of nodes is greater.

Formulation and Implementation of Energy Efficient Routing Algorithm for MANET along with Performance Analysis

Mobile adhoc network (MANET) is composed of wireless mobile nodes/devices which are moving randomly in infrastructure-less adhoc environments. Topology among mobile nodes is dynamic in nature and keeps on changing regularly. The adhoc environment is open to all the genuine users as well as intruders/attackers. Moreover, the wireless connection between mobile nodes can break at any time on account of mobility of nodes. Also, the mobile notes depend on their battery power, which may go down because of exhaust of battery power. Hence, it is a very complex task to implement energy efficient routing over MANET. While handling energy efficient routing, the optimum utilization of batter power is required. In this research paper, efforts have been carried out to formulate an algorithm for energy efficient routing over MANET. Its performance has been studied through network simulator. The simulations have been carried out by writing self created network scenarios with 20, 60 and 100 mobile nodes. Moreover, analysis of the proposed energy efficient routing protocol has been done with AODV routing protocol by using various performance evaluation metrics viz. packet delivery ratio, normalized routing load, average end to end delay, packet loss, throughput, average energy consumed and average energy left. It was derived from the performance analysis that proposed protocol provides energy efficient routing over MANET and also gives better or almost same performance in comparison to AODV.

On the vulnerability of the mobile ad hoc network to transmission power controlled Sybil attack: Adopting the mobility-based clustering

The large-scale deployment of Mobile Ad hoc Networks (MANETs) requires dealing with the issues like low throughput, end-to-end delay, and energy exhaustion. In order to resolve these issues, a MANET is organized into a hierarchical structure using a suitable clustering scheme. The nodes belonging to a cluster are referred to as the member nodes. One of the member nodes in each cluster is elected as the cluster head based on its characteristics like identity, residual energy, node degree, and mobility. The representative node is assigned all the cluster management responsibilities making it liable to be the main target for the attackers. After having control of a cluster, the Sybil attacker may disrupt various functions of the MANET. This paper proposes a transmission power-controlled approach by which a Sybil attack is capable of violating the functioning of the mobility-based clustering algorithm in MANETs. We have shown that the transmission power-controlled approach can be used to bias the cluster head election process by repeatedly tilting the results in favor of the Sybil attacker node. The supporting simulation results clearly indicate that the proposed Sybil attack considerably increases the probability of the Sybil attacker node becoming the cluster head.

GAMAN – Genetic Algorithm in Mobile Adhoc Networks for Creating Systematic QoS

MANET is a mobile adhoc network that is made of several mobile nodes that can communicate in multi-way without any fixed or regular infrastructure. Due to its special features, such as its self-organization, easy deployment it has been preferred for many military and civil applications. MANET has also gained popularity in the multimedia field. MANET has certain levels of requirements, such as QoS (Quality of Service), jitter and energy, bandwidth, and end-2-end delay. MANET’s one of the basic requirements is having QoS and should have efficient routing to support other applications. In this research paper, a special Genetic Algorithm known as the GA algorithm based on routing on a mobile adhoc network is designed and termed as GAMAN. The proposed model uses a 2 QoS system for routing. The outcome of this paper showed that the GAMAN method is a significant one for QoS in MANET.

Directional antenna with reproduction optimisation (BFOA) used in mobile ad-hoc network

A re-configurable directional antenna with optimisation carries a proficient solution for decreasing the collision in wireless sensor networks (WSNs). Enhancement has various scenarios: an increased antenna gain which comes under certain circumstances expands the information correspondence extends to optimise the portable hubs requirement. The principal benefits of this work applying RDA with BFOA optimising algorithm for mobile ad-hoc network (MANET) or WSNs are respected meager. Based on received cycle (RDA-RICHER) medium access control rules for WSN sensor hubs devices, various methods are studying there-configurable directional antenna. This situation of the utilisation of the energy is just material to the constrained hub trusts with it. This confinement of the single expectation and energy effectiveness is the issue to be attempted in this work utilising bacteria foraging optimisation and assessing the optimised energy consumption, streamline idleness, received signal quality, and collision rates in percentage.

RETRACTED ARTICLE: Resourceful Routing Algorithm for Mobile Ad-Hoc Network to Enhance Energy Utilization

RETRACTED ARTICLE: Resourceful Routing Algorithm for Mobile Ad-Hoc Network to Enhance Energy Utilization

Cell-Based Broadcasting Algorithms in Mobile Ad-Hoc Networks

Cell-Based Broadcasting Algorithms in Mobile Ad-Hoc Networks

Bio-inspired routing algorithm for MANETs based on fungi networks

The major trends today show that mobile ad hoc networks (MANETs) are increasingly taking up space in the domestic and corporate market with the growth of numbers of users and new applications. Just as various systems were inspired by the behavior of social insects (ants, bees, among others), fungal colonies also demonstrate potential for bio-inspiration of new protocols for MANETs because they exhibit behavior and capacity for self-organization of adaptive, resilient and efficient natural networks in transporting nutrients. In this work, HyphaNet proposes a new bio-inspired approach in the fungi dynamics to develop an algorithm for the creation, optimization and selection of routes for MANETs. In HyphaNet, the routes are built similarly to the fungal mycelium, in which several parallel paths are initially established, but over time, only the hyphae of the best routes receive biomass for reinforcement and thickening of their walls, thus remaining and presenting greater flow attractiveness. Otherwise, less interesting routes remain rare or disappear completely. In this new algorithm, the routing process follows the idea of attractiveness, in which the data flow tends to travel through regions (nodes and links) with a higher concentration of immobile biomass, which indicates lower cost and greater availability of resources. In this model, the routes are reinforced with each data package delivered successfully and the distribution of immobile biomass is a function of the quality of the path between source and destination. The most attractive paths are more likely to be chosen by the route selection heuristic. HyphaNet is reactive, multipath, and the results of the simulations on the NS-2 show good performance compared to the classic AODV and SARA based on ant colony.

Energy Efficiency in Ad-Hoc On Demand Distance Vector and Dynamic Source Routing Protocols Using High Energy First Algorithm for Mobile Ad-Hoc Networks

The main issue that occurs in battery powered applications in Mobile Ad Hoc networks (MANETs) is energy efficiency. Routing protocols are mainly based on energy related parameters which are used to extend the lifetime of networks. In most of the situations Shortest path routing protocols are used in MANETs which do not consider the energy awareness. Hence power failure of the nodes affect the life time of the network. In this paper we focus on Energy efficiency in Ad-hoc On Demand Distance Vector (AODV) and Dynamic Source Routing (DSR) protocol by using High Energy First (HEF) algorithm to overcome the shortcomings that occur in MANETs due to increase in node density. Simulations are performed using NS-2 and we have compared the performance of AODV and DSR using HEF with the performance of existing DSR and AODV to prove the maximization of lifetime of the network. Simulation results show that the proposed protocols with HEF are efficient than the existing protocols.

Performance Evaluation of DSR for MANETs with Channel Fading

Due to the fact that it does not rely on any infrastructure to operate, Mobile Ad Hoc Networks (MANETs) have been experiencing an exponential period of interest and potential application. In these networks, no central entity controls its operation, and rather the devices cooperatively control and coordinate the network. The aim of the current work is to study the performance of Dynamic Source Routing (DSR) algorithm for MANETs. Extensive experiments in different scenarios with several parameters under free space, two-ray ground and shadowing propagation models were performed. The study presented here indicates distinct network performance results depending on the propagation model used. For instance, it shows that the algorithm has difficulties to maintain routes in environments with severe fading. In addition, management of radio power so that the packet transmissions are tailored to reach only the desired nodes seems to be a good compromise between interference and coverage.

Hybrid on-demand greedy routing protocol with backtracking for mobile ad-hoc networks

PurposeThe purpose of this paper is to design an efficient on-demand routing protocol for mobile ad hoc networks (MANETs) which combines greedy forwarding and backtracking.Design/methodology/approachIt uses a hybrid approach. It uses greedy approach to determine a route from source to the destination. If the greedy approach fails, then it uses a backtracking approach. Combining greedy and backtracking approaches results in a more efficient protocol.FindingsA new routing algorithm for MANETs which performs better than some of the existing algorithms.Research limitations/implicationsA major limitation of this work is that the authors did not implement the protocol on a test bed and evaluated the performance. They neither had the infrastructure nor the resources to actually implement the protocol. Instead, like most of the researchers, they evaluated the performance of their protocol based on extensive simulation. The mobility model, the area of deployment and the density of nodes chosen to simulate the protocol are consistent with what many of the other researchers have done. Intuitively, the authors’ protocol, as the performance evaluation indicates, is likely to perform well in small networks.Practical implicationsThe authors did not implement the protocol on a test bed to evaluate the performance of the protocol. The authors used simulation to study the performance of their protocol. Their simulation model is similar to many of the research works published in the literature.Originality/valueTo the authors’ knowledge, no other paper has combined the greedy and backtracking approach to design a routing protocols for MANETs.

Hybrid PSO-DE algorithm-based trust and congestion aware cluster routing algorithm for MANET

In mobile ad hoc networks (MANET) focuses on network life time parameter link with energy problems that nodes faces during the prediction of direction and limited battery. The process changes network topology and network security. The paper concentrate on the life time energy based clustering algorithm using the fitness value incorporated with the hybrid PSO and differential algorithm for evaluation. Here, the algorithm focuses on election of the cluster head and energy relates with selection of cluster heads nodes during the hybrid PSODE for clustering algorithm. The proposed work may be extremely being intensively for the NS-3 network simulator, which incorporates with the other existing algorithms. Some results may be effectiveness for the proposed algorithm might be in terms of network life time, average life time, number of average clusters formation, average number of reclustering required with the energy consumption and the other parameter such as the packet delivery ratio.

Hybrid PSO-DE algorithm-based trust and congestion aware cluster routing algorithm for MANET

In mobile ad hoc networks (MANET) focuses on network life time parameter link with energy problems that nodes faces during the prediction of direction and limited battery. The process changes network topology and network security. The paper concentrate on the life time energy based clustering algorithm using the fitness value incorporated with the hybrid PSO and differential algorithm for evaluation. Here, the algorithm focuses on election of the cluster head and energy relates with selection of cluster heads nodes during the hybrid PSODE for clustering algorithm. The proposed work may be extremely being intensively for the NS-3 network simulator, which incorporates with the other existing algorithms. Some results may be effectiveness for the proposed algorithm might be in terms of network life time, average life time, number of average clusters formation, average number of reclustering required with the energy consumption and the other parameter such as the packet delivery ratio.

Multicast Routing Protocols for Mobile ADHOC Networks

Mobile Ad-hoc Networks (MANETs) is a self-configuring network that doesn’t follows any predetermined infrastructure. In MANETs there are collections of independent nodes which are associated through wireless and at the same instance it is allowed to change its links to other nodes frequently without any fixed infrastructure. Multicast routing is concurrently sending a message from single source to several destinations and it is an efficient approach to establish the communication between groups of nodes in the wireless network. Multicast routing plays very important roles in the fields of video conferencing, co-operative works, distance education, video on demand, cyber database updating and querying, etc. These applications can provide themselves to manage multicast operations. Almost all different type of multicast routing algorithms in MANETs are facing various issues like limited bandwidth, possibility packets loose, delay variance, energy consumption and transmission overhead problem. There are several multicast routing protocol has been proposed to overcome the challenges of multicast routing and play very significant roles in the current scenario. Nowadays, dissimilar multicast routing algorithms with unique characteristic have been introduced. In this paper complete survey on multicast routing algorithm to highlight their advantages, limitation and also show the future direction in multicast routing in MANETs.

A Parametric Oriented Research on Routing Algorithms in Mobile Adhoc Networks

Due to the infrastructure-less and no central administration architecture, Mobile Adhoc Networks (MANETs) gained significant interest in various wireless information transfer related applications. However, the selection of an optimal path to transmit the data is a more critical issue in MANETs because the nodes are resource-constrained and also have mobility. To provide an optimal solution to this constraint, various methods are proposed in earlier. Initially, some basic routing protocols are developed and further by modifying the base protocols so many strategies are developed. The proposed Research paper outlines a detailed survey about the earlier developed such strategies and also done a fined classification based on the methodology they followed. Broadly the comprehensive routing approaches are classified into two classes, namely single metric-based approaches and multiple metrics-based approaches. The further classification is done based on the routing protocol used at the base. Due to the widespread utilization of meta-heuristic algorithms, some authors used those techniques also in the discovery of an optimal path and some approaches are outlined in this paper. Moreover, at every phase, a fine and detailed comparison is shown through various constraints.