Survey on Performance Analysis of AODV, DSR and DSDV in MANET

Routing is a crucial issue in MANET due to the absence of fixed infrastructure and centralized administration. Many routing protocols like Ad-hoc On-demand Distance Vector (AODV), Dynamic Source Routing (DSR), and Destination Sequenced Distance Vector (DSDV) have been proposed to find the optimized path from source node to destination nodes. This paper analyzed the performance of AODV, DSR and DSDV on the basis of sent packets, received packets and Quality of Service (QoS) metrics like throughput, end to end delay, packet delivery ratio, packet loss ratio with varying network load and network size. Index Terms: AODV, DSR, DSDV, QoS, Routing Protocols. DOI: 10.7176/CEIS/11-3-03 Publication date:May 31st 2020

Factors affecting the performance of ad hoc on-demand distance vector protocol in simulated mobile ad hoc network scenarios using Taguchi approach

The performance of ad hoc on demand vector (AODV) protocol is affected hugely by some common major factors. These factors are terrain, network size, node velocity, pause time, transmission range, traffic load, and packet rates. The main purpose of this study is to analyse the effects of those factors and some selected two-way interactions on the performance measure of drop rates and average end-to-end delay. Taguchi approach was used in this study. Initially, L16 orthogonal array was used to determine the effects of the seven main factors and eight others two-way interactions between selected factors. The final results revealed that terrain, network size, transmission range, and traffic load have significant effects on drop rates. On the other hand, we discovered that terrain, transmission range, traffic load and interaction between node velocity and pause time have significant effects on average end-to-end. Interaction plot for L16 singled out strong interaction between node velocity and pause time for the effect on average end-to-end delay. Furthermore, L8 orthogonal array was applied to analyse the seven main factors only since most of the interactions effects from L16 were largely insignificant to the response. The most influential factors affecting the drop rates (in descending order) were terrain, transmission range, pause time, network size, packet rates, node velocity, and traffic load. For average end-to-end delay, the most influential factors (in descending order) were transmission range, pause time, terrain, network size, traffic load, packet rates, and node velocity. ANOVA results for L8 shows that terrain and transmission range have significant effects on drop rates. For average end-to-end delay, terrain, pause time and transmission range have significant effects on the response

On the minimum number of neighbours for good routing performance in MANETs

In a mobile ad hoc network, where nodes are deployed without any wired infrastructure and communicate via multihop wireless links, the network topology is based on the nodes’ locations and transmission ranges. The nodes communicate through wireless links, with each node acting as a relay when necessary to allow multihop communications. The network topology can have a major impact on network performance. We consider the impact of number and placement of neighbours on mobile network performance. Specifically, we consider how neighbour node placement affects the network overhead and routing delay. We develop an analytical model, verified by simulations, which shows widely varying performance depending on source node speed and, to a lesser extent, number of neighbour nodes

Mobility in wireless sensor networks : advantages, limitations and effects

The primary aim of this thesis is to study the benefits and limitations of using a mobile base station for data gathering in wireless sensor networks. The case of a single mobile base station and mobile relays are considered. A cluster-based algorithm to determine the trajectory of a mobile base station for data gathering within a specified delay time is presented. The proposed algorithm aims for an equal number of sensors in each cluster in order to achieve load balance among the cluster heads. It is shown that there is a tradeoff between data-gathering delay and balancing energy consumption among sensor nodes. An analytical solution to the problem is provided in terms of the speed of the mobile base station. Simulation is performed to evaluate the performance of the proposed algorithm against the static case and to evaluate the distribution of energy consumption among the cluster heads. It is demonstrated that the use of clustering with a mobile base station can improve the network lifetime and that the proposed algorithm balances energy consumption among cluster heads. The effect of the base station velocity on the number of packet losses is studied and highlights the limitation of using a mobile base station for a large-scale network. We consider a scenario where a number of mobile relays roam through the sensing field and have limited energy resources that cannot reach each other directly. A routing scheme based on the multipath protocol is proposed, and explores how the number of paths and spread of neighbour nodes used by the mobile relays to communicate affects the network overhead. We introduce the idea of allowing the source mobile relay to cache multiple routes to the destination through its neighbour nodes in order to provide redundant paths to destination. An analytical model of network overhead is developed and verified by simulation. It is shown that the desirable number of routes is dependent on the velocity of the mobile relays. In most cases the network overhead is minimized when the source mobile relay caches six paths via appropriately distributed neighbours at the destination. A new technique for estimating routing-path hop count is also proposed. An analytical model is provided to estimate the hop count between source-destination pairs in a wireless network with an arbitrary node degree when the network nodes are uniformly distributed in the sensing field. The proposed model is a significant improvement over existing models, which do not correctly address the low-node density situation

The improvements in ad hoc routing and network performance with directional antennas

The ad hoc network has typically been applied in military and emergency environments. In the past decade, a tremendous amount of MAC protocols and routing protocols have been developed, but most of these protocols are designed for networks where devices equipped with omni-directional antennas. With fast development of the antenna technology, directional antennas have been proposed to improve routing and network performance in ad hoc networks. However, several challenges and design issues (like new hidden terminal problem, deafness problem, neighbor discovery problem and routing overhead problem) arise when applying directional antennas to ad hoc networks, consequently a great number of directional MAC and routing protocols have been proposed. In this thesis the implementation of directional antennas in ad hoc networks is studied from technical point of view. This thesis discusses the problems of utilizing directional antenna in ad hoc networks and reviews several recent proposed MAC algorithms and routing algorithms. The improvement of ad hoc routing and network performance with directional antennas compared with omni-directional antennas are evaluated based on simulations which are done with the QualNet simulator. The main finding of this study is that directional antennas always outperform omni-directional antennas in both static and mobility scenarios, and the advantage of directional antennas is more obvious when channel condition becomes worse or mobility level is larger. This thesis provides a survey of directional MAC and routing protocols in ad hoc networks. The result and principles obtained in this thesis are quite valuable for researchers working in this field. They can use it as reference for further researches. The theory parts of smart antenna technology and IEEE 802.11 MAC protocol can be considered as a technical introduction for beginners

Mobility Metrics for Routing in MANETs

A Mobile Ad hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without the need for base stations or any other pre–existing network infrastructure. In a peer-to-peer fashion, mobile nodes can communicate with each other by using wireless multihop communication. Due to its low cost, high flexibility, fast network establishment and self-reconfiguration, ad hoc networking has received much interest during the last ten years. However, without a fixed infrastructure, frequent path changes cause significant numbers of routing packets to discover new paths, leading to increased network congestion and transmission latency over fixed networks. Many on-demand routing protocols have been developed by using various routing mobility metrics to choose the most reliable routes, while dealing with the primary obstacle caused by node mobility. ¶ In the first part, we have developed an analysis framework for mobility metrics in random mobility model. ... ¶ In the second part, we investigate the mobility metric applications on caching strategies and hierarchy routing algorithm. ..