Toward Intelligent Caching in DSR Protocols: Route Compression, Hierarchical Structures, and Link-Aware Optimization in MANETs

Wireless sensor network (WSN) with several sensors is used to group measurements of certain physical quantities or environmental conditions, including sound, temperature, pressure, vibration, motion, or pollution, at various locations and ranges. In WSNs, several protocols address the issue of routing. Sensor nodes in WSN usually have limited energy resources and storage capacities. Therefore, the issue of energy usage in sensors and protocols is very important. This paper analyzes and compares the quality of service (QoS) performances of three important routing protocols of the mobile ad-hoc network (MANET) including Ad-hoc on-demand distance vector (AODV), dynamic source routing (DSR), and destination sequenced distance vector (DSDV), in a smart building case study. The QoS evaluation metrics include residual energy of nodes, instant throughput (IT), average throughput (AT), packet delivery ratio (PDR), packet loss ratio (PLR), and route discovery latency (RDL) based on IEEE 802.15.4 MAC protocol standard. The simulation is carried out using NS2, and the WSN has 16 fixed and 4 mobility nodes with different speeds and paths. The simulation results illustrate that average throughput in AODV is 1.985118 (kbps), however, the figures for DSR and DSDV are 1.977780 and 1.720700 (kbps), respectively. PDR, also, in DSR stands at 1.0, but the figures for AODV and DSDV are lower with the range of 0.999572 and 0.997930, respectively. Overall, The DSR protocol provides a better performance compared to AODV and DSDV routing protocols in terms of PLR and PDR. Also, AODV has better efficiency in RDL and AT compared to other assumed protocols.

Exploration on enhanced Quality of Services for MANET through modified Lumer and Fai-eta algorithm with modified AODV and DSR protocol

Mobile ad hoc networks (MANET) are composed of moving wireless hosts which, within range of each other, form wireless networks. For communication to occur between hosts that are not within each other's range, routes involving intermediate nodes must be established; however, since the hosts may be in motion, a host that was part of a route may move away from its upstream and downstream partners, thus breaking the route. In this paper, we propose anticipated route maintenance (ARM) protocol with two extensions to route discovery based routing scheme: Extend the route when nodes on a link move apart from each other and they have common neighbor that can be “inserted” in the path, and shrink route when a node discovers that one of its neighbor which is not the next hop is also on the same route several hops later on. By utilizing only local geographic information (now a part of some route finding algorithms), a host can anticipate its neighbor's departure and, if other hosts are available, choose a host to bridge the gap, keeping the path connected. We present a distributed algorithm that anticipates route failure and performs preventative route maintenance using location information to increase a route lifespan. The benefits are that this reduces the need to find new routes (which is very expensive) and prevents interruptions in service. As the density of nodes increases, the chance to successfully utilize our route maintenance approach increases, and so does the savings. We have compared the performance of two protocols, pure dynamic source routing (DSR) protocol and DSR with ARM. The simulation results show how ARM improves the functionality of DSR by preventing the links in the route from breaking. Packets delivery ratio could be increased using ARM and achieved approximately 100% improvement. The simulations clarify also how ARM shows a noticeable improvement in dropped packets and links stability over DSR, even though there is more traffic and channel overhead in ARM.

Mobile Ad-hoc Networks (MANETs) features such as open medium, dynamic topology, lack of centralised management and lack of infrastructure expose them to a number of security attacks. Black hole attack is one type of attack that is more common in MANET reactive routing protocols such as Ad-hoc On-demand Distance Vector (AODV) and Dynamic Source Routing (DSR). Black hole attack takes advantage of route discovery process in reactive routing protocols. In this type of attack, a malicious node misleads other nodes in the network by pretending to have the shortest and updated route to a target node whose packets it wants to interrupt. It then redirects all packets destined to a target node to itself and discards them instead of forwarding. This paper analyses the performance of AODV and DSR when attacked by black hole, by varying the mobility of the nodes in the network. The analysis is carried out by simulating scenarios of AODV based MANET and DSR based MANET using Network Simulator 2 (NS-2) and introducing the black hole attack in each of the scenarios. The different scenarios are generated by changing the mobility of the nodes. The performance metrics that are used to do the analysis are throughput, packet delivery ratio and end-to-end delay. The simulation results show that the performance of both AODV and DSR degrades in the presence of black hole attack. Throughput and packet delivery ratio decrease when the network is attacked by black hole because the malicious node absorbs or discards some of the packets. End-to-end delay is also reduced in the presence of a black hole attack because a malicious node pretends to have a valid route to destination without checking the routing table, and therefore shortens the route discovery process. The results also show that throughput decreases slightly when mobility of the nodes is increased in the network. The increase in the speed of the nodes decreases both end-to-end delay and packet delivery ratio.

The rapid advances in the wireless communication industry have paved the way for the enhancement of wireless mobile ad-hoc networks (MANETs) to support various domains including civilian environments, emergency operations, and military affairs. Source routing in MANETs is subject to some issues such as changes in the network topology, which lead to frequent link breakages that may increase the requests of route discoveries. Thus, this paper aims to enhance on-demand source routing protocols by proposing two mechanisms, a zone-based route discovery mechanism (ZRDM) and a link failure prediction mechanism (LFPM). ZRDM aims to control the flooding of route requests, and LFPM aims to avoid route breakages caused by node mobility. The performance of the proposed mechanisms was evaluated using network simulator 3 in terms of normalized routing load, average end-to-end delay, and packet delivery ratio. The experimental results showed that the proposed mechanisms outperform well-known mechanisms such as the dynamic source routing (DSR) protocol, reliable DSR, and zone-based DSR and segment-based DSR.

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.

Power consumption is a crucial design concern in mobile ad‐hoc networks (MANETs), since the nodes are powered by batteries with limited battery power, whereas the existing dynamic source routing (DSR) protocol does not take the battery power limitation of the MANET nodes into account. The mobile hosts in MANETs are constrained by the battery power for their operation. Hence, the battery power of a node is a precious resource that must be used efficiently in order to avoid early termination of a node or a network. In the MANET, power is one of the major issues, since the devices have limited battery power to execute the tasks. This study proposes a new scheme called efficient power routing DSR (EPRDSR) to improve the existing on‐demand routing protocols by introducing a power efficient scheme in the whole MANET. In the route discovery, the EPRDSR selects the bandwidth and the power constraints are built into the DSR route discovery mechanism. Hence, it enhances the network lifetime and delays the repair and reconstruction of the route. The main goal of EPRDSR is not only to extend the lifetime of each node, but also to prolong the lifetime of each connection.

The reactive dynamic source routing (DSR) protocol is a commonly applied protocol in mobile ad hoc networks ( MANETs). When the network size is increased, it is observed that the overhead is also getting increased due to the source routing nature of DSR and this in turn reduces the efficiency of DSR protocol. In order to improve the scalability of DSR,in this paper, a modification is proposed for DSR. Simulation results show that the modified DSR (MDSR) has less overhead and delay compared to conventional DSR irrespective of network size.

In mobile ad hoc networks (MANET), links are created and destroyed in an unpredictable way, which makes quite challenging the determination of routes between each pair of nodes. In this paper, we evaluate the performance of the dynamic source routing (DSR) protocol in a multi-services MANET. Simulation results reveal that DSR enables to provide packet delivery ratio higher than 99% for low mobility level and low traffic intensity.

Ad Hoc Routing with Distributed Ordered Sequences

Mobile Ad hoc Network (MANET) is the cornerstone for the Internet of Things (IoT) and Vehicle to Everything (V2X) networks, its devices are remarkable of lightweight to be portable and free to join or disjoined the network. Therefore, one of the MANET routing types is reactive routing protocols. Reactive routing protocols set up the connection between devices either on-demand such as Ad Hoc On-demand Distance Vector (AODV) protocol or source routing such as Dynamic Source Routing (DSR) protocol. Reactive routing protocols increase routing overhead on discovering new routes. Thus routing overhead, and delay will increase. In this paper, the method of generating a fuzzy model is presented. Also, a tuned fuzzy stability model is introduced to handle the imprecision of routing decisions by the Fuzzy Stability model for Ad Hoc On-demand Distance Vector (FSAODV) and Fuzzy Stability model for Dynamic Source Routing (FSDSR). The results showed that FSAODV and FSDSR have outperformed the state of art protocols AODV and DSR respectively.

A significant problem in missions employing multiple autonomous underwater vehicles (AUVs) is the difficulty of communicating effectively. This challenging communication problem is best addressed in the realm of mobile, ad hoc networking (MANET). This paper describes work towards improving location-aware source routing (LASR), our modification of the dynamic source routing (DSR) protocol to add location awareness and link quality metrics. Specifically designed for use in underwater acoustic networks, LASR is explained and results of investigations into the sensitivity of LASR to medium-model error, tracking error and compression of communicated routing data are shown.

A mobile ad-hoc network comprises of a number of low power wireless nodes. Each of these participating nodes endeavours to pass packets for other nodes based upon a preagreed protocol. The dynamic source routing (DSR) protocol is one of the most commonly used protocols in ad-hoc wireless networks. In a DSR based network, each transmitted data packet contains the complete list of node addresses that the packet has to traverse in order to reach its final destination. Intermediate nodes blindly forward these packets as per the attached list without taking into consideration the behavioural pattern of the subsequent nodes. In this paper, we present a variant of the DSR protocol in which intermediary nodes act as trust gateways. These gateways take into account the contemporary trust levels of the network nodes and thus facilitate in detecting and evading malicious nodes. With the help of extensive simulations, we demonstrate that the proposed DSR protocol augments the performance of the standard DSR protocol by up to 30% in a network where 40% of the nodes act maliciously. The proposed scheme is also independent of cryptographic mechanisms and does not impose any superfluous conditions upon the network establishment and operation phase.

Effects of Velocity on Performance of DYMO, AODV and DSR Routing Protocols in Mobile Ad-hoc Networks

ABSTRACTQuality of service (QoS) provisioning in mobile ad hoc networks (MANETs) is one of the fundamental concerns in this area. Autonomous mobility of nodes is one of the main factors affecting the network QoS. A lack of fixed infrastructure and central control on the nodes complicate guaranteeing the QoS in MANETs. Security is a major factor affecting the QoS in such networks. This paper proposes a new routing method based on trust among the nodes and applies a clustering approach to MANETs. This routing scheme can calculate the trustworthiness of the route and the shortest routes to the destination by avoiding identified malicious nodes. The effects of node mobility and number of malicious nodes on routing performances are investigated in the reported research. Simulation is used to show the effectiveness of the proposed approach in comparison with a categorized trust method, Ad hoc On‐demand Distance Vector, trust vector‐based Ad hoc On‐demand Distance Vector, and trust vector‐based dynamic source routing in terms of end‐to‐end delay, network throughput, and packet delivery ratio at the expense of a moderate increase in the routing overhead. The proposed trust‐based routing method finds the trustworthy route by applying end‐to‐end trust calculation and finds the optimal route by performing clustering scheme from the source node to the destination node. In the extended proposed routing method, adding a nonce‐based encryption scheme results in improved packet delivery ratio, network throughput, and malicious node detection rate. Copyright © 2013 John Wiley & Sons, Ltd.