Mobile Ad Hoc Networks Scenarios Research Articles

Analyze the Impact of Mobility and Pause Time on ACO based Manet Routing Protocols - Review

Abstract: Recently, many researchers have studied its performance within Mobile Ad-hoc Networks (MANETs). Every ad hoc network protocol focuses on a different set of measurements and traits. The majority of the currently utilized mobility models are employed to provide realistic movement patterns for MANET scenarios. A crucial element in the creation of MANET protocols is simulation. The future topology of a network can be predicted, which enables Quality of service- aware routing to choose a dependable link for data transmission. Ant algorithms, also known as swarm intelligence, are a wider field of study that deals with algorithmic approaches that are motivated by the behaviour of ant colonies and other insects. Ant Colony Optimization (ACO) is a subset of this larger topic. Based on the pheromone value deposited over the link, we identified two categories for the link quality in the proposed approach. We have demonstrated how the network's performance is enhanced by the suggested technique. The nodes are moving in the specified terrain dimensions through the Enhanced Manhattan Mobility Model (EMMM). The five QoS performance metrics are analyzed over three MANET routing protocols. The comparison is made over two important factors-mobility and pause time with the proposed ACO technique of reliable links. In the first experiment of different speeds, DSR is 25.5% better than AODV and 5.3% better than DSDVin metric packet dropping, 1.15% better than AODV and 1.01% better than DSDV in Packet Delivery Ratio, 1.5% better than AODV and 1.04% better than DSDV in packet overhead, and 62.7% better than AODV and 73.1% better than DSDV in average end-to-end delay. In the second experiment of pause times, DSR is 25.05% better than AODV and 4.5% better than DSDV in packet dropping, 1.18% better than AODV and 1.01% better than DSDV in packet delivery ratio, 1.01% better than DSDV in throughput, 0 to 0.002% in packet overhead, and 0.02% to 0.005% shorter delay.

Handshake mechanism selection in MANETs with directional antennas: A new evaluation view

AbstractHandshake mechanism plays a significant role in neighbour discovery (ND) algorithms in mobile ad hoc networks (MANETs) with directional antennas. In this letter, aiming at 1) the MANET scenario of uniformly‐distributed nodes and 2) the random beam‐scanning manner, the upper and lower bounds of ND time of the network are theoretically derived for both 1‐way and 2‐way. This analysis indicates that the ND time is approximately linear growth with NDT‐Mutual, where the NDT‐Mutual is defined as the expected time for a node to complete mutual discovery with its neighbours. Then the theoretical expression for NDT‐mutual is derived, which is a function of the number of nodes. The asymptotic analysis reveals that when the number of nodes is very small, the NDT‐mutual of 2‐way is lower than 1‐way, while 1‐way performs better when the number of nodes approaches infinity. The number of nodes when 1‐way and 2‐way perform as well is further presented, which can be utilized to guide the selection of handshake mechanism in MANETs with directional antennas. Simulation results demonstrate the accuracy of our modelling for ND and the effectiveness of using NDT‐mutual to approximate who performs better with 1‐way and 2‐way.

Performance Improvement of AODV in Wireless Networks using Reinforcement Learning Algorithms

This paper investigates the application of reinforcement learning (RL) techniques to enhance the performance of the Ad hoc On-Demand Distance Vector (AODV) routing protocol in mobile ad hoc networks (MANETs). MANETs are self-configuring networks consisting of mobile nodes that communicate without the need for a centralized infrastructure. AODV is a widely used routing protocol in MANETs due to its reactive nature, which reduces overhead and conserves energy. This research explores three popular Reinforcement Learning algorithms: SARSA, Q-Learning and Deep Q-Network (DQN) to optimize the AODV protocol's routing decisions. The RL agents are trained to learn the optimal routing paths by interacting with the network environment, considering factors such as link quality, node mobility, and traffic load. The experiments are conducted using network simulators to evaluate the performance improvements achieved by the proposed RL-based enhancements. The results demonstrate significant enhancements in various performance metrics, including reduced end-to-end delay, increased packet delivery ratio, and improved throughput. Furthermore, the RL-based approaches exhibit adaptability to dynamic network conditions, ensuring efficient routing even in highly mobile and unpredictable MANET scenarios. This study offers valuable insights into harnessing RL techniques for improving the efficiency and reliability of routing protocols in mobile ad hoc networks.

Investigation of a GNN approach to mitigate congestion in a realistic MANET scenario

Mobile Ad-hoc Networks (MANETs) can be modelled as time-varying graphs as their topology and traffic demands change. Optimizing routing in MANETs by proactively adapting the routes is a challenge, even with a fixed topology and user demand Omniscient Dijkstra Routing (ODRb) is one of the best known approaches, which computes alternative paths but has limitations to mitigate congestions. In this paper, we investigate Graph Neural Networks (GNNs) for routing optimization in MANETs. Our contribution is inspired by the centralized GNN-based Data Driven Routing (GDDR) framework developed by Hope [1]. GDDR was developed for optical fibre networks to support time varying user demands. After failing to obtain good results using the GDDR approach on the tactical Anglova MANET scenario, we adapted GDDR to minimize the maximum number of traversals. Our GNN-t proposal is able to find alternative longer paths mitigating congestion on central nodes. Considering a challenging static topology, the first second of the 24-node Anglova scenario: GNN-t achieves a Completion Ratio of CR=99% for a traffic of acked-messages averaging 1msg/s/node and CR=77% when the traffic is doubled (2msg/s/node). For the challenging first 300s of Anglova CP1, similar performance is reported for ODRb and GNN-t: CR=81% without fading and CR=54% with fading.

SIBLAR: a secured identity-based location aware routing protocol for MANETs

A mobile ad-hoc network (MANET) is a self-organising distributed wireless network without any central infrastructure support wherein every participating node independently acts as a router. Several routing protocols are available for information dissemination in MANETs but their efficiency is limited due to security breaches. Providing security schemes for robust information dissemination is of high prominence for the real time deployment of MANET applications. From the existing literature, it is understood that very few research efforts were made to ensure security for routing protocols and there is a huge scope for the design and development of secured routing protocols for MANETs. In this paper, we have considered the security issues with respect to location aided routing (LAR) and proposed a secured identity-based location aware routing (SIBLAR) protocol to achieve system security with improved key refreshment mechanism. MANET scenarios were created in ns2 and the efficiency of the proposed SIBLAR protocol was evaluated based on certain performance metrics. In the presence of security attacks, the proposed SIBLAR scheme is found efficient when compared to basic LAR.

Performance Analysis of Routing Protocols in Mobile Ad Hoc Networks (MANETs)

Mobile devices are able to build their own networks, which are referred to as mobile ad hoc networks. These networks do not require any kind of permanent wiring or other infrastructure (MANETs). The success of MANETs and their adaptability to a variety of tasks is, to a considerable extent, based on the routing protocols that they use. Using metrics such as routing overhead, end-to-end delay, and packet delivery ratio, we compare and contrast the various routing protocols that can be employed in MANETs, including proactive, reactive, and hybrid protocols. This comparison and contrast is carried out in this study. In addition to this, we discuss the simulation tools that are utilized to evaluate the efficacy of MANET routing algorithms and define the several performance indicators that may be utilizedin the course of this endeavor. This paper makes a contribution to an ongoing body of research into the analysis of routing protocols in MANETs by offering guidance to network engineers and researchers on how to select the most appropriate routing protocol and simulation tool for a particular MANET scenario. In doing so, the paper maximizes the potential for effective and efficient communication between mobile nodes, which is one of the main goals of the research.

WITHDRAWN: Resilience of mobile ad hoc networks to security attacks and optimization of routing process

Abstract The need for efficient routing that can be used to avoid malfunctioning or malicious network known issues, While Mobile Ad-hoc Networks (MANETs) are becoming extremely prevalent and are exploited in various applications, including the application of the Vehicle Ad-hoc Network (VANET), wireless sensor network (WSN) environmental monitoring, and 5G device-to-device (D2D) connectivity. This research presents the Resilience of Mobile Ad hoc Networks to various security attacks and optimizes the routing Process. Moreover, its application to Ant Colony Optimization (ACO), a flippant is implemented, a logic-improved routing algorithm that addresses all such difficulties. To identify the linear nodes of complexity, the distributed fuzzy logic module eliminates them from the Safety Aware Fuzzy Enhanced Ant Colony Optimization (SAFEACO) routing process. The NS-3 simulator follows the SAFEACO routing protocol, and various tests in MANET and VANET scenarios have been carried out. SAFEACO's efficiency is correlated to other innovative and well-known solutions. SAFEACO performs superiorly for each metric of its application, such as the Packet Delivery Ratio (PDR) and the End-to-End delay. SAFEACO also offers greater strength against the black hole, Sybil and inundation attacks due to its ability to classify linear-complexity nodes.

IMPLEMENTATION BASED ON 0.18 µM CMOS TECHNIQUES FOR DIGITAL PLL SYNTHESIZER IN LOW LOCKING TIME .

Currently, Mobile Ad-hoc networks (MANET) are consider as an important portion of the wireless networks and for the communication in MANET, routing mechanism is also play a vital role. MANET routing protocol generates a different performance when it is implemented in a different network scenario. It is a challenge to find the suitable characteristic of MANET routing protocol which conforms to a certain network condition scenario. In the last ten years, many research have been done by the research to analyze the performance of MANET routing protocol but still lots of problems are faces. However, those research are related to the scope of routing protocol based MANET scenario. Basically, there two types of routing mechanism that is known as the Proactive and the Reactive routing protocol. Alternatively, there is a routing protocol which is a combination of both proactive as well as reactive, namely the Hybrid routing protocol. Hybrid routing protocols especially capable to solve the MANET energy consumption by constructing a zone routing protocol (ZRP) and it is superior to over proactive and reactive routing protocols. So, in this research, we proposed an optimized Artificial Neural Network (ANN) based Improved Energy Efficient ZRP (IEE-ZRP) mechanism for MANET with the help of the Grasshopper Optimization Algorithm (GOA). The total MANET simulation area is divided into different zones or clusters or regions to create a secure and energy efficient routing mechanism. The IEE-ZRP mechanism perform better as compare to others routing protocols that clearly mentioned in the results analysis section based on the Quality of Service (QoS) parameters such as Throughput, Packet Delivery Ratio (PDR), Packet Drop Ratio, Delay, Energy Consumption and Control Overhead.

IPBM: an energy efficient reliable interference-aware periodic broadcast messaging protocol for MANETs

Mobile ad-hoc networks (MANETs) have been widely employed in many fields including critical information delivery in open terrains as in tactical area, vehicular or disaster area network scenarios. To provide effective network maintenance for those MANETs, it is essential to adopt proper control communication methods, which provide reliable delivery of network information. However, it is difficult to provide control communication that meets the quality of service requirements due to the broadcasting of control messages and dynamic nature of MANETs. Interference is one of the major problems that degrades this service quality, especially for the networks deployed in open terrain environments. Moreover, large and dense MANET scenarios further complicate this problem. Even though many communication methods have been proposed in the literature, a satisfactory one for periodic and broadcast delivery of control packets considering the interference awareness and at the same time yielding high reliability, goodput, energy efficiency still does not exist for MANETs. To that end, we present a new control communication protocol, which is referred to as the Interference-Aware Periodic Broadcast Messaging (IPBM) protocol, for those MANETs deployed in interference-rich open terrains. We show that the proposed interference awareness mechanism of IPBM, in which the transmission power of the units is increased at certain periods, significantly reduces the packet loss caused by the interference problem. Moreover, IPBM achieves an important amount of increase in the link reliability as well as in goodput with the least power consumption among the evaluated solutions. The mobility support feature of IPBM makes the protocol applicable not only to large and dense but also to highly dynamic MANETs. Besides, IPBM can properly work alongside the deployed main data communication protocol, since it provides valuable network information to be manipulated. Simulation results under both static and dynamic topologies confirm that adopting the IPBM protocol in the intended MANET scenarios significantly increases the reliability and goodput as well as the energy efficiency.

An Adaptive Protocol for Stable and Energy-Aware Routing in MANETs

In mobile ad-hoc networks (MANETs), routing protocols are impaired by its nodes’ mobility, misbehaviour, and insufficient battery power. In order to overcome the above-mentioned impairments of routing protocols, in this paper, we propose a multiple routing metrics based stable and energy-aware routing protocol. In route discovery phase, our proposed protocol establishes a stable, secure, and energy-aware route from a source node to a destination node based on the multiple routing metrics derived considering mobility, energy level, and data packet forwarding statistic of mobile nodes. In route maintenance phase, the protocol monitors neighbours of the intermediate nodes so that it may minimally redefine the established route whenever a link gets disrupted or a node reaches a threshold value with regard to its routing metrics. A trust module is also included in the proposed protocol which gives inputs regarding nodes’ trustworthiness so as to keep a path as reliable as possible. Simulation results show that our protocol increases packet delivery ratio and reduces average end-to-end delay and average energy consumption in different MANET scenarios.

Optimizing Reactive Routing Over Virtual Nodes in VANETs

The virtual node layer (VNLayer) is a cluster-based approach to handle communications in mobile ad hoc networks (MANETs), furnishing an abstraction of fixed geographical regions served by virtual nodes (VNs) as a means to tackle the challenges raised by the mobility of the physical nodes (PNs). Several studies have proved that the VNLayer constructs can be applied to improve the performance of existing routing algorithms, i.e., most notably Ad hoc On-Demand Distance Vector Routing (AODV) in general MANET scenarios. In this paper, however, we show that the same mechanisms do not work well in the more specific and demanding realm of vehicular ad hoc networks (VANETs). In response to this, we present several enhancements to the reference implementations of the VNLayer and the adaptation of AODV to work with VNs, proving by means of mathematical analysis and simulation experiments that our solutions achieve better performance in terms of overhead, packet delivery fraction, and latencies in VANET scenarios.

Leveraging Social Networks for P2P Content-Based File Sharing in Disconnected MANETs

Current peer-to-peer (P2P) file sharing methods in mobile ad hoc networks (MANETs) can be classified into three groups: flooding-based, advertisement-based, and social contact-based. The first two groups of methods can easily have high overhead and low scalability. They are mainly developed for connected MANETs, in which end-to-end connectivity among nodes is ensured. The third group of methods adapts to the opportunistic nature of disconnected MANETs but fails to consider the social interests (i.e., contents) of mobile nodes, which can be exploited to improve the file searching efficiency. In this paper, we propose a P2P content-based file sharing system, namely SPOON, for disconnected MANETs. The system uses an interest extraction algorithm to derive a node's interests from its files for content-based file searching. For efficient file searching, SPOON groups common-interest nodes that frequently meet with each other as communities. It takes advantage of node mobility by designating stable nodes, which have the most frequent contact with community members, as community coordinators for intracommunity searching, and highly mobile nodes that visit other communities frequently as community ambassadors for intercommunity searching. An interest-oriented file searching scheme is proposed for high file searching efficiency. Additional strategies for file prefetching, querying-completion, and loop-prevention, and node churn consideration are discussed to further enhance the file searching efficiency. We first tested our system on the GENI Orbit testbed with a real trace and then conducted event-driven experiment with two real traces and NS2 simulation with simulated disconnected and connected MANET scenarios. The test results show that our system significantly lowers transmission cost and improves file searching success rate compared to current methods.

A New QoS Management Scheme for VoIP Application over Wireless Ad Hoc Networks

Nowadays, mobile ad hoc networks (MANETs) have to support new applications including VoIP (voice over IP) that impose stringent QoS (quality of service) constraints and requirements. However, VoIP applications make a very inefficient use of the MANET resources. Our work represents a first step toward improving aspects at the network layer by addressing issues from the standpoint of adaptation, claiming that effective adaptation of routing parameters can enhance VoIP quality. The most important contribution is the adaptive OLSR-VA algorithm which provides an integrated environment where VoIP activity is constantly detected and routing parameters are adapted in order to meet the application requirements. To investigate the performance advantage achieved by such algorithm, a number of realistic simulations (MANET scenarios) are performed under different conditions. The most important observation is that performance is satisfactory in terms of the perceived voice quality.

On the Delivery Probability of Two-Hop Relay MANETs with Erasure Coding

This paper focuses on the delivery probability performance in a two-hop relay mobile ad hoc network (MANET) with erasure coding. Available works in this line either considered a simple extreme case of achieving the delivery probability 1, or assumed a simple traffic pattern with only one source-destination pair, or studied a very special MANET scenario (i.e., the sparsely distributed MANET) by assuming that whenever two nodes meet together they can transmit to each other. Obviously, such models cannot be applied for an accurate delivery probability analysis in the general MANETs where the interference, medium contention and traffic contention issues are of significant importance. In this paper, a general finite-state absorbing Markov chain theoretical framework is first developed to model the complicated message spreading process in the challenging MANETs. Based on the theoretical framework, closed-form expressions are further derived for the corresponding message delivery probability under any given message lifetime and message size, where all the above important issues in MANETs are carefully incorporated into analysis. As verified through extensive simulation studies, the new framework can be used to accurately predict the message delivery probability behavior and characterize its relationship with the message size, replication factor and node density there.

A Survey on Reactive Routing Protocols of the Mobile Ad hoc Networks

Mobile Ad hoc Networks (MANET) are wireless networks without an infrastructure, which are usually set up on a temporary basis to serve a particular purpose within a specific period of time. An efficient routing protocol for MANET has become a necessary and important issue to be considered before deploying any mobile network. This paper presents a comparison among the reactive routing protocols: Ad-hoc OnDemand Distance Vector Routing (AODV), Dynamic Source Routing (DSR) and Temporally Ordered Routing Algorithm (TORA). The effects on the routing efficiencies with a special focus on the mobility and node density using end to end delay, throughput, retransmission attempts and data dropped as indices of performance evaluation for FTP traffic were observed by using OPNET 14.5 modeler as simulation tool. Based on the observations from literature and empirical study conducted using OPNET, it is found that among the three protocols, no single protocol can successfully provide optimum efficiency in different MANET scenarios. General Terms Performance analysis, simulation, graphs.

Mobility prediction in mobile wireless networks

In realistic mobile ad-hoc network scenarios, the hosts usually travel to the pre-specified destinations, and often exhibit non-random motion behaviors. In such mobility patterns, the future motion behavior of the mobile is correlated with its past and current mobility characteristics. Therefore, the memoryless mobility models are not capable of realistically emulating such a mobility behavior. In this paper, an adaptive learning automata-based mobility prediction method is proposed in which the prediction is made based on the Gauss–Markov random process, and exploiting the correlation of the mobility parameters over time. In this prediction method, using a continuous-valued reinforcement scheme, the proposed algorithm learns how to predict the future mobility behaviors relying only on the mobility history. Therefore, it requires no a prior knowledge of the distribution parameters of the mobility characteristics. Furthermore, since in realistic mobile ad hoc networks the mobiles move with a wide variety of the mobility models, the proposed algorithm can be tuned for duplicating a wide spectrum of the mobility patterns with various randomness degrees. Since the proposed method predicts the basic mobility characteristics of the host (i.e., speed, direction and randomness degree), it can be also used to estimate the various ad-hoc network parameters like link availability time, path reliability, route duration and so on. In this paper, the convergence properties of the proposed algorithm are also studied and a strong convergence theorem is presented to show the convergence of the algorithm to the actual characteristics of the mobility model. The simulation results conform to the theoretically expected convergence results and show that the proposed algorithm precisely estimates the motion behaviors.

A Survey Of Tcp Reno, New Reno And Sack Over Mobile Ad-Hoc Network

Transmission Control Protocol (TCP) is often preferred to be implemented at the transport layer of a Mobile Ad-hoc Network (MANET) because of its wide range of applications, which enjoys the advantage of reliable data transmission in the Internet. However, because of some unique characteristics of MANET, TCP cannot offer reliable services while using e-mail, internet search and file transmission in such a network. The research investigates how well the different versions of TCP respond to various performance differentials when subjected to different network stresses and topology changes, aside from identifying the most efficient and robust TCP version(s) for different MANET scenarios. Among several TCP variants, three types are considered important for the analysis, namely TCP Reno, TCP New Reno and TCP Selective Acknowledgment (SACK). In most cases, the TCP performance is found in our study to decrease when the node size and mobility rate is increased in the network. There is, however, exception to this. As our simulation results demonstrate, the increases in the node velocity sometimes help the TCP to attain a better performance. The study also reveals that out of the three variants, TCP SACK can adapt relatively well to the changing network sizes while TCP Reno performs most robustly in the presence of different mobility rates within MANET.

A link stability-based multicast routing protocol for wireless mobile ad hoc networks

Recently, several studies have been conducted to design mobility-based multicast routing protocols for wireless mobile ad hoc networks (MANET). These protocols assume that the mobility parameters of the network are fixed, and so they cannot perform well under real MANET scenarios in which the mobility parameters of the hosts vary over time at random. Finding the optimal solution to the multicast routing problem is incredibly hard, if the mobility parameters are assumed to be random variables. This becomes more difficult when the probability distribution function of these random variables is assumed to be unknown. In this paper, we propose a weighted multicast routing algorithm for MANET in which the mobility parameters are supposed to be random variables with unknown distribution. In this method, the multicast routing problem is first transformed into an equivalent stochastic Steiner tree problem in which the random weight associated with a communication link is its expected duration time. Then, a learning automata-based algorithm is proposed for solving the proxy Steiner tree problem. The aim of the proposed algorithm is to find the most stable multicast route (with the maximum duration) against the host mobility. Experimental results confirm the superiority of the proposed method over the best existing mobility-based multicast routing protocols in terms of the packet delivery ratio, multicast route lifetime, control message overhead, and end-to-end delay.

Reducing Blocking Risks of Atomic Transactions in MANETs Using a Backup Coordinator

In this paper, the authors present a probabilistic model to evaluate the reliability of the atomic commit for distributed transactions in mobile ad-hoc networks (MANETs). This model covers arbitrary MANET scenarios as well as strict and semantic transaction models. The authors evaluate the approach to integrate a backup coordinator to reduce blocking risks. For the purpose of showing an example of a MANET scenario, the authors illustrate how the considered blocking probability is very low.

From battlefields to urban grids: New research challenges in ad hoc wireless networks

There has been much talk over the past two decades about commercialization of the mobile ad hoc network (MANET) technology. Potential ad hoc network applications with some commercial appeal are now finally emerging, “drafted” by the enormously successful wireless LAN technology. Closely coupled to commercial applications and critically dependent on commercial ad hoc networks will be the “pervasive computing” applications. Since military and civilian emergency MANETs have been around for over three decades, and since the Government has continuously supported MANET research for as many years, it may seem natural to assume that all the research has already been done and that commercial MANETs can be deployed by simply leveraging the military and civilian research results. Unfortunately, there is a catch. Commercial MANETs (and therefore pervasive computing applications) will evolve in a way totally different from their military counterparts. Most importantly, they will start small, and will initially be tethered to the Internet. They will be extremely cost-aware. They will also need to cater to a variety of different applications. This is in sharp contrast with the large scale, autonomous, special purpose and cost insensitive military networks. In this paper we review a typical “battlefield” MANET application and contrast it to two emerging commercial MANET scenarios—the urban vehicle grid and the Campus network. We compare characteristics and design goals and make the case for new research to help kick off commercial MANETs. In particular we argue that P2P technology will be critical in the early evolution of commercial MANETs and identify research directions for P2P MANETs.