Simulation Analysis of Ad-Hoc On-Demand Distance Vector Routing Protocol Performance in Mobile Ad Hoc Network Using Taguchi Design Approach

Hazura Mohameda,Muhammad Hisyam Lee,Shaharuddin Salleh,Mazalan Sarahintub,Bahrom Sanugi

doi:10.11113/mjfas.v4n2.47

Hazura Mohameda, Muhammad Hisyam Lee + Show 3 more

Open Access

https://doi.org/10.11113/mjfas.v4n2.47

Copy DOI

Abstract

Mobile ad-hoc network routing protocol performance is evaluated mostly through simulative studies. One-factor-at-atime approach is commonly used to quantify the effect of various factors on the protocol performance. In this work, the effect of several factors was investigated simultaneously and speedily with the application of Taguchi design of experiments. The effect of the factors which include terrain size, node speed, network size, transmission range, transmission rates, pause time, and maximum connection on routing overhead was quantified. Analysis signal-to-noise ratio was performed to determine the best possible combination of factors and analysis of variance (ANOVA) was carried out to identify the significant factors that affect the routing overhead. The results showed that network size, transmission range and maximum connection play a significant role in minimizing routing overhead. The results were confirmed experimentally at 95% confidence interval.

Highlights

Mobile ad hoc networks (MANETs) are collection of wireless nodes communicating among themselves over wireless link without the help of any network infrastructure such base station or access point [11]
Our study has shown that Taguchi method is a powerful technique in quantifying the effect of several factors simultaneously such as terrain, node speed, network size, transmission range, and transmission rates, pause time and maximum connection on the routing overhead
The use of the Taguchi experimental design approach to determine the effects of factors on the Ad hoc Ondemand Distance Vector (AODV) protocol performance with regards to routing overhead has been reported in this paper

Summary

Introduction

Mobile ad hoc networks (MANETs) are collection of wireless nodes communicating among themselves over wireless link without the help of any network infrastructure such base station or access point [11]. Each nodes are responsible for dynamically discovering other nodes that can communicate directly. A key assumption is not all nodes can directly communicate with each other because of limited transmission range. Nodes as routers are required to relay packets on behalf of other nodes in order to deliver data across the network. Numerous routing protocols have been proposed in the literature to solve the routing problem in MANETs. Numerous routing protocols have been proposed in the literature to solve the routing problem in MANETs These protocols may be categorized as table-driven and on-demand, according to the way the mobile nodes exchange routing information. The table-driven protocols, such as Destination Sequence Distance Vector

Objectives

Results

Conclusion