Mobility In Mobile Ad Hoc Networks Research Articles

A COMPARATIVE ANALYSIS OF PROACTIVE ROUTING PROTOCOLS (DSDV, OLSR) & REACTIVE ROUTING PROTOCOLS (AODV, DSR) IN MANET USING NS-3

The abstract outlines a comprehensive analysis focusing on routing protocols in Mobile Ad Hoc Networks (MANETs). Ad-hoc networks are dynamic wireless networks without a central infrastructure. This analysis compares two types of routing protocols—proactive (table-driven) and reactive (on-demand)—using simulation analysis. The protocols DSDV, OLSR, AODV, and DSR are evaluated using NS-3, considering various performance metrics under different scenarios. The research aims to provide insights into protocol strengths and weaknesses, aiding network protocol selection and potential enhancements. This investigation contributes to understanding routing behaviours in ever-changing MANETs, benefiting network design and optimization efforts. Keywords: MANET (Mobile Ad Hoc Network), DSDV (Destination-Sequenced Distance Vector), OLSR (Optimized Link State Routing), AODV (Ad Hoc On-Demand Distance Vector), DSR (Dynamic Source Routing), Routing Information Protocol (RIP)

Selecting Optimal Path in Multiple-Path Routing for MANETs Using Fuzzy Cost

Background/ Objectives: Mobile Ad Hoc Networks (MANETs) consists of a set of nodes, where the nodes tend to change their positions time to time because of their infrastructure less characteristic. In MANETs, the protocol that is considered to be the appropriate for constructing an efficient route is AODV. Broadcast storm is another approach that can be used for establishing a path between the sender and receiver. Due to the concerns related to contention and collision, broadcast is not considered as an efficient mechanism for path selection. Though the aim of broadcasting is to minimize the flooding other issues like bandwidth consumption, collision and contention cannot be controlled. Since MANETs are associated with inadequate bandwidth, the approach of broadcasting is not efficient. Multipath routing approach permits in constructing multiple paths between the communicating nodes (sender and receiver). This approach is complicated due to the problem of node mobility in MANETs. The other paths available are not reliable because of the ad hoc nature of MANETs. The intention is to design a fuzzy controller that assists in reducing the reconstruction of paths using fuzzy cost assigned to each node in the network. Methods: The concept of this paper is to establish an optimal path from sender node to the receiver node from the available multiple paths in MANETs. The path established in this approach uses fuzzy cost. Fuzzy measure is the criteria used for establishing a path. The concept ImRMR used in this paper has been included with few improvements. The basic functionality of ImRMR is that paths are classified based on rank fitness. The proposal is to classify the paths based on its fuzzy cost. This fuzzy cost classifies the paths fitness. Findings: The proposed fuzzy cost approach discussed in this study is compared with On-Demand Multicast Routing Protocol (ODMRP). The result exhibits that the proposed method works better under differing conditions like traffic load, transmission range between nodes and also considers node mobility. The proposed mechanism with inclusion of fuzzy cost shows 5% energy efficiency, reduces the collisions by about 35% and throughput is enhanced by 30%. There has been a considerable decrease in the number of queries by 23%. The simulation results indicate that ODMRP with fuzzy cost is more useful and significant. Hence, consideration of fuzzy cost as a means for selecting an effective route is assumed to be the best. Novelty: This method contributes in reducing the drawbacks of routing approaches whether it is unipath and multi-path approach. The proposed approach changes the value of the attributes for a given route with fuzzy cost. A threshold value will be considered initially and the route having a cost more than the initialized threshold would be advised as the best route. This route would be considered as the efficient route for transmission between the sender and the receiver. Keywords: Uni­path, multiple paths, Fuzzy cost, Fuzzy fitness, Rank fitness

SHM-NDN: A seamless hybrid mobility management scheme for named data mobile ad hoc networks

Named Data Networking (NDN), a counterpart of address-centric networking resolves consumer mobility issues to some extent, however, it confronts excessive bandwidth consumption and network congestion problems in Mobile Adhoc Networks (MANET) due to an inefficient default request re-transmission mechanism. The producer mobility in NDN-based MANET, on the other hand, poses even worse challenges owing to the continuous flooding of location advertisement messages in the network. This paper aims to address the aforementioned producer and consumer mobility issues in MANET and proposes SHM-NDN, a seamless hybrid mobility management scheme for NDN-based MANETs. The proposed scheme features new packet types and extends the functionality of wireless mobile FIB data structure to support efficient mobility management. Moreover, the SHM-NDN proposes a path recovery mechanism to deal with the network partitioning problem caused by a low signal-to-noise ratio and high congestion rate. Through an extensive simulation study, we demonstrate that SHM-NDN achieves on average 12.2% less bandwidth and energy consumption compared to CBILEM. Similarly, SHM-NDN also attains on average 25% less bandwidth and energy consumption compared to EEIF.

Design an Improved Hybrid Routing Protocol Strategy to Minimize Delay & Overhead for MANET

Mobile adhoc networks (MANET) are a self-coordinated wireless network that is worked without perpetual foundation and base station endorsement. In MANETs (Mobile Ad Hoc Networks) every single node activity goes about as the information source and communicator router. It notices its useful neighbours by making themselves by passing the nodes that got terminated of that correspondence range. In this paper, we designed the IHRP routing protocol with the help of combining the AODV, AOMDV and OLSR routing protocol with the network situation based routing adaptation. In the previous analysis, we identify AODV is more compatible for dynamic environment (where node motion is higher).The AOMDV routing protocol is useful for network load balancing and congestion control. OLSR is compatible for stable network which use as maximum link stability base routing. While we are designing the IHRP routing protocol through of the above (AODV, AOMDV and OLSR) protocol .We handle the network behaviour with better performance in any situation. Initially the RREP are broadcasted to find out the route. The poll of routing, select based on the network situation. The proposed IHRP start with a RREQ packet is to search the distance from its origin to its objective node. The network motion is higher than AODV protocol handle the particular situation but in any situation, while the 70% network node are stable then the route selection and transferring of data with the help of an OLSR routing protocol. The propose IHRP routing protocol also handle the network load and control the network congestion through the AOMDV routing protocol. Our proposed protocol IHRP also works in a hybrid manner while the source and destination belong in longer range such as different cluster. At that time situation based routing was followed between the clusters. We saw in the result part the comparison of IHRP and ZRP routing protocol. Execution of the improved hybrid routing protocol (IHRP) is much better than hybrid routing protocol (ZRP). In case of Packet Delivery Ratio analysis for IHRP and ZRP, we clearly show that The Packet Delivery Ratio is 97.99% by IHRP and 79.49% by ZRP, so we can say that the performance of packet delivery ratio in Improved hybrid routing protocol (IHRP) is much better than ZRP, where Improved hybrid routing protocol (IHRP) and hybrid routing protocol (ZRP) both performed the conjunction of proactive and reactive routing protocol features therefore we can say that Packet Delivery Ratio is better in improved hybrid routing protocol (IHRP) as compare to hybrid routing protocol (ZRP).
 We clearly show that the Normal Routing Load analysis for IHRP and ZRP where Normal Routing Load is 0.11% by IHRP and 4.72 % by ZRP, so we can say that performance of Improved Hybrid Routing Protocol (IHRP) in case of a Normal Routing Load is much less than the Hybrid Routing Protocol (ZRP).
 In case of overall parameter matrix (Normal Routing Load, Throughput, Packet Delivery Ratio and Average End To End Delay) the performance of Improved Hybrid Routing Protocol (IHRP) is much better than existing Hybrid routing protocol (ZRP).

Design of Novel Mobility and Obstacle-Aware Algorithm for Optimal MANET Routing

Existence obstacles in terrain area and the mobility of the nodes in the network are the vital constrains that degrade the performance in Mobile Adhoc Network (MANET). To diminish the effect of such obstacles and mobility on the performance of MANET, the protocol used for routing must be efficient enough to handle both the factors. In the present work, we have considered the issues of Mobility and obstacle aware multipath communication in MANET. For avoiding obstacles, DeCasteljau Algorithm with Bezier curve concept has been applied. To the minimize impact of mobility, a speed based mobility prediction concept is used. Here optimal routing path across the obstacle is selected depending on its mobility prediction indicator, link duration, network connectivity and path availability. The performance of the suggested protocol is evaluated with Network Simulator-2. Simulation results confirm that the suggested protocol minimizes average energy consumption, network overhead, average delay and improves data deliverance in MANET.

Competitive analysis of single and multi-path routing protocols in mobile Ad-Hoc network

<p>A Mobile Ad-hoc Network (MANET) refers to a dynamic and wireless network, which can be designed without an existing infrastructure as every node serves as a router. A MANET is a self-configuring system of mobile nodes that are connected wirelessly. Every node serves as a sink, as well as a router to send packets. The movement of the nodes is not restricted as they can move in any direction, and they have the ability to get organized into a network. Due to their free and independent movement, they do not have a fixed position; they often change positions. In this study, the Dynamic Source Routing (DSR) and Ad-hoc On Multipath Demand Distance Vector (AOMDV) protocols are compared using Network Simulator NS2.35. DSR is a reactive gateway discovery algorithm whereby the connection of a MANET mobile device is established only on demand. Basically, AOMDV was specially tailored for ad-hoc networks that are highly dynamic to respond to link failures and breakages in the network. It ensures that the paths for destinations are sustained, and it defines the new routing information using destination serial numbers to ensure loop freedom always while avoiding problems. More so, it is a protocol that is based on a timer that can discover ways through which the mobile nodes respond to link breakages and change in topology. A comparison of protocols has been carried out individually and jointly with the aim of evaluating their performance. The performance is measured in terms of End-to-End Delay, Packet Delivery Ratio, Packet Loss Ratio, and Routing Overhead Ratio. The performance of the routing protocols was done using two scenarios; when there is a change in the simulation time and when there is a change in the number of nodes.</p>

MCLMR: A Multicriteria Based Multipath Routing in the Mobile Ad Hoc Networks

In Mobile Ad hoc Networks (MANETs), nodes’ mobility, traffic congestion, and link quality estimation of the intermediate nodes are very crucial factors for establishing a reliable forwarding path between a source and destination node pairs. The unpredictable movement of nodes and random data traffic flow at a single node can cause congestion and network topology instability, which significantly lowers the performance of the ad hoc network. Indeed, the above-highlighted issues can be mitigated by implementing a more reliable mobility-centric, contention, and link quality-aware routing protocol for efficient data transmissions in a mobile network. This paper proposes a routing strategy called Mobility, Contention window, and Link quality sensitive multipath Routing (MCLMR) in MANETs, which considers the nodes mobility, contention window size, and link quality estimated value of the intermediate nodes in the optimal route selection. Also, Technique for Order of Preference by Similarity to Ideal Solution; a multicriteria decision-making technique, which provides weights according to node mobility, contention window size, and link quality estimated values, is also employed for the selection of intermediate nodes, whereas the Expected Number of Transmissions metric is used to minimize the effect of control message storm. The extensive simulations results prove that the proposed MCLMR routing scheme outperforms the conventional Multipath Optimized Link State Routing (MP-OLSR) and MP-OLSRv2 routing schemes in terms of network throughput, end-to-end delay, energy consumption, and packets loss ratio.

A QoS-Assured and Mobility-Aware Routing Protocol for MANETs

In Mobile Ad Hoc Networks (MANETs), lack of a fixed infrastructure, dynamic network topology, device mobility and data communication over wireless channels make the multi-hop routing a very challenging task. Due to mission-critical applications of MANET, dealing with these challenges through the design of a Quality of Service (QoS)-assured protocol is a substantial problem. Mobility in MANETs is commonly considered as a negative factor on quality, although we suggest that the right approach to mobility awareness using wisely selected metrics can lead to a robust and QoS-assured protocol. In this paper, we propose QMAR-AODV, a QoS-assured Mobility-Aware Routing protocol which is an optimized version of AODV protocol. We utilize a combination of stability and quality metrics including Mobility Ratio (MR(C,E)) between nodes in a route, Energy Efficiency and congestion load to choose the most stable and QoS-assured routes. Our simulation results show that QMAR-AODV protocol outperforms E2E-LREEMR and reduces route instability, end-to-end delay, data retransmissions and packet loss by 8.3% 10.9% 10.6% and 5.4 respectively, while increases data reception and network throughput by 5.1% and 4.8% respectively, compared to E2E-LREEMR routing protocol.

Testing Reliable-AODV for Mobile Ad-hoc Network using test-bed architecture

Mobile Ad hoc Network(MANET) provides wireless communication withoutany infrastructure. MANET generally uses a most popular and well-suited routing protocolthat is Ad hoc on Demand Distance Vector (AODV). Random topology and mobilityin MANET cause link break multiple times in network due to which poor link quality thatresults in packet losses in the network. In this paper, link quality improvement in AODV routing protocol is focused. Link quality issue can be resolved through Cross-layer design(CLD) interaction in the OSI communication model. This technique called as Reliable-AODV. CLD is implemented by interacting Physical firstlayer and network third layer of the OSI model, CLDinteraction help in strong route formation inAODV for Reliable-AODV. The result shows an improvement in the system Performance in terms of metricslike throughput, Packet Delivery Ratio(PDR) and reduction in the packet losses, delay ofthe network. Network simulator used for performance analysis is NS-2.a Simulation tool that shows improvement in results. Castadiva Emulator with Wi-Fi routers and laptop are used as test bed architecture for validating sample results of simulations. It is observed that some small variation in the simulated and emulated result by using real-time experimental setup.

Mobility, Residual Energy, and Link Quality Aware Multipath Routing in MANETs with Q-learning Algorithm

To facilitate connectivity to the internet, the easiest way to establish communication infrastructure in areas affected by natural disaster and in remote locations with intermittent cellular services and/or lack of Wi-Fi coverage is to deploy an end-to-end connection over Mobile Ad-hoc Networks (MANETs). However, the potentials of MANETs are yet to be fully realized as existing MANETs routing protocols still suffer some major technical drawback in the areas of mobility, link quality, and battery constraint of mobile nodes between the overlay connections. To address these problems, a routing scheme named Mobility, Residual energy and Link quality Aware Multipath (MRLAM) is proposed for routing in MANETs. The proposed scheme makes routing decisions by determining the optimal route with energy efficient nodes to maintain the stability, reliability, and lifetime of the network over a sustained period of time. The MRLAM scheme uses a Q-Learning algorithm for the selection of optimal intermediate nodes based on the available status of energy level, mobility, and link quality parameters, and then provides positive and negative reward values accordingly. The proposed routing scheme reduces energy cost by 33% and 23%, end to end delay by 15% and 10%, packet loss ratio by 30.76% and 24.59%, and convergence time by 16.49% and 11.34% approximately, compared with other well-known routing schemes such as Multipath Optimized Link State Routing protocol (MP-OLSR) and MP-OLSRv2, respectively. Overall, the acquired results indicate that the proposed MRLAM routing scheme significantly improves the overall performance of the network.

Performance study of routing protocols based on node mobility in MANETs

Mobile ad hoc network (MANET) is established by a set of smart mobile nodes without any central intelligence. Hence, nodes auto-discover their surrounding and establish needed links between source and destination node. Moreover, mobile nodes change arbitrary their position, which lead to frequent link failure. Therefore, the dynamic behaviour of nodes has a drastic impact on network's performances such as end-to-end delay, packet loss ratio and traffic control that is generated during route update process. Consequently, the main issue in MANET's operations is the design of an efficient routing protocol able to deliver required quality of service in case of nodes' mobility and manage the intrinsic limitation of wireless networks, like scares bandwidth, limited energy and processing capabilities. The purpose of this paper is to study the impact of nodes' mobility on routing performances and look forward an appropriate optimisation that might enhance efficiency of routing protocol in high dynamic environment.

Dynamic Analysis for the Average Shortest Path Length of Mobile Ad Hoc Networks Under Random Failure Scenarios

In general, the mobile ad hoc networks (MANETs) are built on the basis of the random distribution of the nodes, while the nodes of real networks usually have the characteristics of location preference choice. The evolving network model based on local-area choice is proposed for MANET based on the complex network theory. The proposed model of the topology not only considers the scale-free nature of the network and the actual mobility of MANET but also considers the consumption of the node energy. Random failures often occur in MANET. Most of the existing research focuses on the changes in network topology caused by random node failures. In order to describe the impact of random edge failures on the topology of MANET, we focus on the average shortest path length (ASPL) which is an important feature of the network topology and propose the formula for calculating the ASPL of the MANET after the random edge failure. The experimental simulation analyzes the change of the ASPL of MANET in the random failure scenario (after random edge deletion). By comparing with the actual scene results, the proposed estimation formula which describes this change more accurately is proved. The formula proposed in this paper provides a general framework for studying the shortest path of MANET.

Mobile Ad hoc Network Testbed Using Mobile Robot Technology

MANET (Mobile Ad Hoc Network) researchers have shown increased interest in using mobile robot technology for their testbed platforms. Thus, the main motivation of this paper is to review various robot-based MANET testbeds that have been developed in previously reported research. Additionally, suggestions to heighten mobility mechanisms by using mobile robots to be more practical, easy and inexpensive are also included in this paper, as we unveils ToMRobot, a low-cost MANET robot created from an ordinary remote control car that is capable of performing a real system MANET testbed with the addition of only a few low-cost electronic components. Despite greatly reduced costs, the ToMRobot does not sacrifice any of the necessary MANET basic structures and will still be easily customisable and upgradeable through the use of open hardware technology like Cubieboard2 and Arduino, as its robot controller. This paper will also include guidelines to enable technically limited MANET researchers to design and develop the ToMRobot. It is hoped that this paper achieves its two pronged objectives namely (i) to facilitate other MANET researchers by providing them with a source of reference that eases their decision making for selecting the best and most suitable MANET mobile robots for real mobility in their MANET testbeds (ii) to provide MANET researchers with a prospect of building their own MANET robots that can be applied in their own MANET testbed in the future.

On the Performance of Multi-Message Algebraic Gossip Algorithms in Dynamic Random Geometric Graphs

In this letter, we investigate the performance of algebraic gossip algorithms for information dissemination in mobile ad hoc networks (MANETs). In the gossip algorithms, in each time slot, each node communicates with a neighboring node, which is randomly selected by an Exchange algorithm, to exchange their information. The goal of the algorithm is to efficiently disseminate all the messages to all the nodes as fast as possible. We analyze the convergence time of network coding (NC) based gossip algorithm by taking into account the node mobility in MANETs, and derived a lower bound on the convergence time. It showed that the convergence time of the NC gossip algorithm with node mobility can be reduced by the order of $O(n^{1/2}/\log ^{3/2}n)$ over that without considering node mobility. But it is only $O(\log n)$ quicker than the gossip algorithm with node mobility but no NC.

The Effect of Network’s Size on the Performance of the Gateway Discovery and Selection Scheme for MANEMO

In the era of Internet technology, new applications are developed everyday requiring continuous and seamless connections. This urges for access availability solutions to the new scenarios. One of the critical architecture is the Mobile Ad-Hoc Network Mobility (MANEMO). However, the integration of Ad-hoc and NEMO technologies came out with many complications like redundant tunnels and the existence of multiple Exit Routers. This paper presents a scheme to discover and select the optimum gateway to improve the robustness and the performance of the network irrespective of the used routing protocol. The MANEMO Gateway discovery and selection scheme (MGDSS) extends the Tree Discovery Protocol and the Neighborhood Discovery protocol used by NEMO and Ad-Hoc to carry the necessary gateway selection parameters. To compare the effect of network’s size on the performance of the proposed scheme, the standard NEMO BSP and the Multi-homed MANEMO (M-MANEMO) approaches OPNET Modeler 14.5 was used. The results show that the average data packets dropped, the end-to-end delay and the throughput of the proposed MGDSS outperform those for the standard M-MANEMO and standard NEMO BSP.

The Effect of Network’s Size on the Performance of the Gateway Discovery and Selection Scheme for MANEMO

In the era of Internet technology, new applications are developed everyday requiring continuous and seamless connections. This urges for access availability solutions to the new scenarios. One of the critical architecture is the Mobile Ad-Hoc Network Mobility (MANEMO). However, the integration of Ad-hoc and NEMO technologies came out with many complications like redundant tunnels and the existence of multiple Exit Routers. This paper presents a scheme to discover and select the optimum gateway to improve the robustness and the performance of the network irrespective of the used routing protocol. The MANEMO Gateway discovery and selection scheme (MGDSS) extends the Tree Discovery Protocol and the Neighborhood Discovery protocol used by NEMO and Ad-Hoc to carry the necessary gateway selection parameters. To compare the effect of network’s size on the performance of the proposed scheme, the standard NEMO BSP and the Multi-homed MANEMO (M-MANEMO) approaches OPNET Modeler 14.5 was used. The results show that the average data packets dropped, the end-to-end delay and the throughput of the proposed MGDSS outperform those for the standard M-MANEMO and standard NEMO BSP.

An Opportunistic Routing Protocol for Mobile Ad Hoc Networks Based on Stable Ideology

In mobile ad hoc networks (MANETs), traditional routing protocols send packets along pre-determined paths which are vulnerable in dealing with unreliable and unpredictable wireless medium. The main difference between the opportunistic routing and the traditional routing is that the former can employ several lossy broadcast links to support a reliable transmission. In order to improve the performance of opportunistic routing, nowadays, the tendency is to blend the idea of stable routing into opportunistic routing algorithms more or less. Just based on this ideology, this paper presents a stable ideology-based opportunistic routing (SIOR) for MANETs. Different from the existing protocols for MANETs, in SIOR, the stable ideology is infused into every step. In this paper, SIOR is described in detail around three issues of opportunistic routing. The first issue is how to select the forwarders among the neighbors; the second one is how to communicate among these forwarders to select a relay; the last one is how and when to relay the packets. The novel contribution of this paper is in dealing with the third issue. The ultimate target is to adapt SIOR to the mobility of MANETs. And then, the theory analysis is depicted on the basis of probability theory to compare SIOR with several relevant mechanisms. Finally, we have implemented simulation experiments. The simulation results show SIOR has prominent performance than other relevant protocols.

Fine-Grained Analysis of Packet Loss in MANETs

Most existing trust-based security schemes for mobile ad-hoc networks (MANETs) consider packet loss an indicator of possible attacks by malicious nodes. There may be several reasons for packet losses, such as interference, queue overflow, and node mobility. Identifying the real underlying cause of a packet loss event is important for any security solution. To detect truly malicious nodes, it is necessary to carry out a fine-grained analysis (FGA) to determine the underlying cause of such loss. Without such analysis, the performance of any security solution may degrade, due to the punishment of innocent nodes while actual malicious nodes may remain undetected. Therefore, approaches are required that can correctly identify the reason for packet losses and can react accordingly. In this paper, we present a scheme that is able to correctly identify malicious nodes, using network parameters to determine whether packet losses are due to queue overflows or node mobility in MANETs. The contributions of this paper include the FGA scheme for packet loss and the development of a comprehensive trust model for malicious node identification and isolation. Our proposed FGA scheme is evaluated in terms of effectiveness and performance metrics under different network parameters and configurations. The experimental results show that our proposed trust model achieves a significant reduction in false positives rate and an increase in the rate of detection of truly malicious nodes compared with traditional non-FGA schemes.

Using trust to detect denial of service attacks in the internet of things over MANETs

The rapid growth of employing devices as tools in daily life and the technological revolution have led to the invention of a novel paradigm; the Internet of Things (IoT). It includes a group of ubiquitous devices that communicate and share data with each other. These devices use the Internet Protocol (IP) to manage network nodes through mobile ad hoc networks (MANET). IoT is beneficial to MANET as the nodes are self-organising and the information reach can be expanded according to the network range. Due to the nature of MANET, such as dynamic topology, a number of challenges are inherent, such as Denial of Service (DoS) attacks. DoS attacks prohibit legitimate users from accessing their authorised services. In addition, because of the high mobility of MANET, the network can merge with other networks. In this situation, two or more networks of untrusted nodes may join one another leaving each of the networks open to attack. This paper proposes a novel method to detect DoS attacks immediately prior to the merger of two MANETs. To demonstrate the applicability of the proposed approach, a Grayhole attack is used in this study to evaluate the performance of the proposed method in detecting attacks.

Comparison and Analysis Study between AODV and DSR Routing Protocols in VANET with IEEE 802.11

Mobile Ad-Hoc networks (MANET) have become related to several aspects in human life while normal users uses the wireless mobile systems without prior knowledge about how such systems works. In order to support the mobility in MANETs, the routing protocols are needed to handle the data transmission between the wireless nodes from a source to destination. Ad-Hoc On demand Distance Vector (AODV) and Dynamic Source Routing (DSR) is a popular routing protocols used in MANET. Vehicular Ad-Hoc Networks (VANET) is a special type of MANET which is used to support the high mobility between moving cars on the roads. In this paper the AODV and DSR are applied on a VANET over two different scenarios, dense and sparse traffic based on cars density on the road, and then both protocols are evaluated based on different performance metrics