Link-state QoS routing protocol under various mobility models

Mobile Ad Hoc Network (MANET) comprises a group of mobile or wireless nodes that are placed randomly and dynamically which causes the constant change between nodes. When considering a routing protocol to deploy in any given situation on MANET, factors such as the mobility model, mobility of nodes, the network size and packet size should be carefully considered because the routing protocols configured with the mobility model can highly affect the performance of MANET. This paper analysed the impact of two different routing protocols (i.e. Dynamic Source Routing (DSR) and Optimized Link State Routing (OLSR)) on the performance of Random WayPoint (RWP) mobility model. Three measures of performance metrics (i.e. average throughput, average delay and average traffic received) were used. In all three-performance metrics, the simulated results indicated that Random WayPoint (RWP) configured with OLSR protocol performed better than RWP configured with DSR protocol. This indicates that the choice of a routing protocol for a specific mobility model should be considered in a network design.

Mobility models are used to evaluate the network protocols of the ad hoc network using the simulation. The random waypoint model is a model for mobility that is usually used for the performance evaluation of ad-hoc mobile networks. Mobile nodes have dynamic mobility in the ad hoc network, so the mobility model plays an important role to evaluate the protocol performance. In this article, we developed modify random waypoint mobility (MRWM) model based on a random waypoint for the mobile ad hoc network. In this article, the comparative analysis of modifying random waypoint mobility and random waypoint model on the ad hoc On-Demand Distance Vector (AODV) routing protocol has been done for a large wireless ad hoc network (100 nodes) with the random mobile environment for the 1800s simulation time. To enhance the confidence in the protocol widespread simulations were accomplished under heavy traffic (i.e. 80 nodes) conditions. The proposed model protocol has been investigated with the performance metrics: throughput; packet delivery ratio; packet dropping ratio; the end-to-end delay and normalized routing overhead. The obtained results revealed that the proposed modified random waypoint mobility model reduces the mobility as compared to the random waypoint mobility model and it is trace is more realistic.

Mobile Ad hoc Network (MANET) is a one that has decentralized, self-organized and self-configurable network. All mobile nodes are moving arbitrarily. It consists of mobile wireless nodes that communicate themselves without any well defined infrastructure and also do not required any interference of third party base station. MANET’s routing protocols are classified in three categories. Proactive, Reactive and Hybrid Routing Protocols are three routing Protocols. But we basically Focus on only one of each routing protocol by varying by Data Dropped and Retransmission. In this paper we analysis performance of routing protocol by using mobility models vector mobility and random way point. We are focusing performance comparison on routing protocols on Optimized Link State Routing (OLSR) is proactive routing protocol also known as table driven protocol, (AODV)Ad Hoc on Demand Distance Vector is Reactive Routing Protocol and also establish a connection on demand and third one is Gathering-based Routing Protocol (GRP) which is hybrid routing protocol. In this paper we have compare two mobility models with above three protocols. In simulation results AODV shows best results by using OPNET 14.5 simulators. We can also compare its performance by using 50 nodes and show its outcome with the help of comparison table.

Vehicular Ad Hoc Networks (VANETs), a subclass of Mobile Ad Hoc Networks (MANETs), rely on efficient routing protocols to maintain reliable communication in highly dynamic and decentralized environments. While numerous routing strategies have been proposed, their performance varies significantly with the choice of underlying mobility models that simulate real vehicular movement. This study presents a two-phase evaluation of five widely used routing protocols—Ad hoc On-Demand Distance Vector (AODV), Dynamic Source Routing (DSR), Destination-Sequenced Distance Vector (DSDV), Optimized Link State Routing (OLSR), and Geographic Routing Protocol (GRP)—across fourteen realistic mobility models, including the Intelligent Driver Model (IDM), Car-Following Model (CFM), and Lighthill–Whitham–Richards (LWR) model. Simulations are executed using Simulation of Urban Mobility (SUMO), Network Simulator 3 (NS-3), and the Veins framework. The performance is assessed using eight key metrics: Packet Delivery Ratio (PDR), End-to-End Delay (E2ED), Throughput, Jitter, Energy Consumption, Packet Loss Ratio (PLR), Normalized Routing Load (NRL), and Link Breakage Rate (LBR). Among the evaluated protocol–mobility combinations, AODV paired with the CFM model demonstrated comparatively favorable performance under the considered simulation configuration: 93% PDR, 79.4 ms E2ED, 332 kbps throughput, 3.4 ms jitter, 3.48 J energy consumption, 7% PLR, 0.3 NRL, and 5 link breakages per simulation. This study provides a systematic and unified comparative evaluation of five widely used routing protocols across fourteen simulation-based vehicular mobility models. The findings provide scenario-specific comparative insights for simulation-based VANET performance evaluation and offer practical, simulation-based guidance for selecting suitable protocol–mobility model combinations under the evaluated experimental conditions.

Macromobility support for mobile ad hoc networks using IPv6 and the OLSR routing protocol

An adhoc network is a collection of mobile nodes connected by a wireless link, where each node acts as a router. In order to facilitate the communication within the network, a routing protocol is needed. Due to bandwidth constraint and dynamic topology of the mobile adhoc Networks supporting Quality of Service (QoS) is challenging task. The aim of this work is to present QoS enabled routing protocol in adhoc networks and compare it with normal routing protocol. The Optimized Link State Routing (OLSR) protocol is an optimization of the classical link state protocol, which is used for implement the QoS. Such protocol is adopted for the reason that it reduces the size of control messages and minimizes the overhead from the flooding of control traffic. The performance of both routing and QoS routing protocols are evaluated using Network simulator Ns-2.QoS enabled routing protocol shows a significant improvement in protocol performance metrics applied in our measurements, such as packet delivery ratio, packet loss and delay.

Ad Hoc Routing with Distributed Ordered Sequences

Wireless technology based on the IEEE 802.11 standard is widely deployed. This technology is used to support multiple types of communication services (data, voice, image) with different QoS requirements. MANET (Mobile Adhoc NETwork) does not require a fixed infrastructure. Mobile nodes communicate through multihop paths. The wireless communication medium has variable and unpredictable characteristics. Furthermore, node mobility creates a continuously changing communication topology in which paths break and new one form dynamically. The routing table of each router in an adhoc network must be kept up-to-date. MANET uses Distance Vector or Link State algorithms which insure that the route to every host is always known. However, this approach must take into account the adhoc networks specific characteristics: dynamic topologies, limited bandwidth, energy constraints, limited physical security, ... Two main routing protocols categories are studied in this paper: proactive protocols (e.g. Optimised Link State Routing - OLSR) and reactive protocols (e.g. Ad hoc On Demand Distance Vector - AODV, Dynamic Source Routing - DSR). The proactive protocols are based on periodic exchanges that update the routing tables to all possible destinations, even if no traffic goes through. The reactive protocols are based on on-demand route discoveries that update routing tables only for the destination that has traffic going through. The present paper focuses on study and performance evaluation of these categories using NS2 simulations. We have considered qualitative and quantitative criteria. The first one concerns distributed operation, loop-freedom, security, sleep period operation. The second are used to assess performance of different routing protocols presented in this paper. We can list end-to-end data delay, jitter, packet delivery ratio, routing load, activity distribution. Comparative study will be presented with number of networking context consideration and the results show the appropriate routing protocol for two kinds of communication services (data and voice).

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

Mobile Ad hoc Networks (MANETs) is about mobile nodes roaming around the network area. Simulation is one of the methods for evaluating the characteristics of Ad Hoc networking protocols. Mobility model of the network simulator is very important. The mobility of the nodes directly impacts the performance of the protocols. The simulation results obtained with unrealistic movement models may not correctly reflect the true performance of the protocols. The majority of existing mobility models for ad hoc networks do not provide realistic movement scenarios; they are limited to random walk models without any obstacles hence the need to address mobility with obstacles. In this paper, we proposed a solution to realize a realistic movement models through the incorporation of obstacles by studying the Performance Evaluation of campus mobility model in Mobile Ad Hoc Networks. Therefore, the objective of our proposed Campus Mobility Model (CMM) has been designed to model the movement of mobile nodes in terrains that resemble the real world topographies. The objects model buildings and other structures that provide a barrier to both the movement of the mobile nodes, as well as the wireless transmission of these nodes. In modeling such a terrain, a user can define the positions, shapes and sizes of these objects. Finally we evaluated the Campus Mobility model based on physical characteristics and the impact on network topology and routing performance. Simulation results showed that the use of obstacles and pathways has a significant impact on the network topology and the performance of the routing protocol.

Mobile Ad-hoc NETworks (MANETs) comprise on wireless mobile nodes that are\ncommunicating with each other without any infrastructure. Vehicular Ad-hoc\nNETwork (VANET) is a special type of MANETs in which vehicles with high\nmobility need to communicate with each other. In this paper, we present a novel\nframework for link availability of paths for static as well as dynamic\nnetworks. Moreover, we evaluate our frame work for routing protocols\nperformance with different number of nodes in MANETs and in VANETs. We select\nthree routing protocols namely Ad-hoc On-demand Distance Vector (AODV),\nFish-eye State Routing (FSR) and Optimized Link State Routing (OLSR).\nFurthermore, we have also modified default parameters of selected protocols to\ncheck their efficiencies. Performance of these protocols is analyzed using\nthree performance metrics; Packet Delivery Ratio (PDR), Normalized Routing\nOverhead (NRO) and End-to-End Delay (E2ED) against varying scalabilities of\nnodes. We perform these simulations with NS-2 using TwoRayGround propagation\nmodel. The SUMO simulator is used to generate a random mobility pattern for\nVANETs. From the extensive simulations, we observe that AODV outperforms among\nall three protocols.\n

Mobile Ad hoc Networks (MANETs) represent complex distributed systems that do not rely on any infrastructure or centralized administration. These networks consist of wireless mobile devices which communicate with each other over the wireless channel. Because each mobile node (MN) has a limited transmission range, multi-hop communication is necessary to deliver data across the entire network. Such type of communication requires routing protocols which are capable of discovering multi-hop routes between the sending and receiving nodes. In addition, various mobility models are used to mimic the walking patterns of MNs in real-world environments. These models are generally categorized into two types, i.e., (i) entity and (ii) group-based mobility models depending upon their functionalities. In this paper, we assessed the impacts of different networking contexts on the performance of different mobility models. We selected Random Waypoint (RWP) and Gauss-Markov (GM) models from the first category and Reference Point group (RPGM) and Nomadic Community (NCMM) mobility models from the second. We performed extensive simulations using Network Simulator (NS-2). Simulation results reveal that there is a decline in cost as the speed of MNs is increased. In addition, node density differently impacted the performance of both types of models. The recommendation of this research will provide better understanding of the different mobility models in MANETs and their uses in real-world environments such as search and rescue operations, battlefield situations, tracking operations, people-centric networking and many more.

Recent advances in wireless networking technologies have made it possible to construct a mobile ad hoc network (MANET) which can be applied in infrastructureless situations. However, due to their inherent characteristics, they are much more vulnerable to malicious attacks than a conventional wired network. In MANET, routing plays an important role in providing connectivity for mobile nodes who are not within the same radio range. Existing routing protocols in MANET assume a trusted and reliable environment. However, in hostile environment mobile nodes are susceptible to various types of routing attacks. This paper identifies a new routing attack, called node isolation attack, against optimized link state routing (OLSR) protocol, one of the four standard routing protocols for MANETs. We analyze in detail and demonstrate the impact of this attack in order to show the necessity for a countermeasure to guard against the attack. As a first step to defend against the attack, we present a simple technique to detect the attack and identify the source of the attack

Mobile Ad hoc Networks (MANETs) is a type of wireless ad-hoc network which is a self-arranging network of mobile nodes connected by wireless links which creates a discretionary topology. The mobile nodes are free to move randomly and to arrange themselves in a random manner. Thus, the wireless ad hoc network topology may expand rapidly and unpredictably. In Mobile Adhoc networks, the routing protocol plays an important role in improving Quality of Service (QoS). There are many different types of routing protocols such as reactive, proactive and hybrid. The AODV is a reactive routing protocol which establishes routes on-demand, as they are needed. In this paper, we described a new protocol based on the AODV which gives better performance than the original AODV routing protocol with respect to set of performance metric such as a packet delivery ratio, throughput, energy consumption and overhead, under different conditions. The proposed routing protocol Modified Ad-Hoc On-Demand Distance Vector (M-AODV) describes that the new operation for routing path reconstruction should be made from the source. It also explains a new method for identifying multiple disjoint routes. Performance analysis of routing protocol designed for wireless networks has been very challenging. Hence, simulations are always utilized to obtain the desired performance results. Simulations were performed by Network Simulator (NS2).

Background:AMobileAdHocNetwork (MANET) consistsofmany independentnodes that operate over awireless topology with numerous Quality of Service (QoS) requirements. So, a robust routing protocol that also provides QoS parameters to its different range of applications is needed. Various network parameters like node density, node mobility, field size etc. also effects the QoS parameters of MANETs. Methods: The traditional reactive routing protocols do not have any backup route in case of a node failure and hence are not effective for MANETs. Ad Hoc on Demand Distance Vector Backup Routing (AODV BR) protocol performs better than traditional routing protocols but is not effective when the backup route fails. So, to counter this problem, the authors had proposed AODV nth BR that keeps on providing backup routes when multiple nodes fail and hence successfully transfers the data to the destination. The nodes for backup routing are selected based on their distance from the failed node and energy efficiency. Results: In this paper, the performance of AODV nth BR has been compared with AODV, DSR and AODV BR protocol under varying node density (nodes 20, 60,100) and node mobility conditions (5m/s, 20m/s, 50m/s). The values for Packet Delivery Fraction (PDF) for 60 nodes at speed 20m/s in case of AODV nth BR protocol after 6000 rounds is 0.3054. Comparatively, value of AODV BR is 0.2664, AODV is 0.1936 and DSR is 0.1056. QoS performance is measured in terms of end to end delay, packet delivery fraction and lifetime of devices and it has been shown through simulated results that AODV nth BR protocol gives better output than traditional routing protocols. Conclusion: From the simulated results explained in detail in the paper, it has been observed that route after link breakage is found to be best with AODV nth BR protocol and this can be clearly seen in the QoS parameters obtained.Keywords: AODV BR, AODV nth BR, MANETs, Node Density, Node Mobility