Addis Ababa University Libraries Electronic Thesis and Dissertations: AAU-ETD! >
Institute of Technology >
Thesis - Computer Engineering  >

Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/2842

Title: Performance Evaluation and Nodes’ Mobility Effect Analysis on AODV based Internet Gateway Discovery Algorithms in Social Networks
Authors: Wondwossen, Kassahun
Advisors: Dr. Kumuda Raimond
Keywords: MANET
GW Discovery
Copyright: Mar-2010
Date Added: 9-May-2012
Publisher: AAU
Abstract: Mobile Ad hoc networks (MANETs), with gateway (GW) discovery protocols for internet connectivity, allows portable devices to establish communication with hosts in the fixed network (or to the internet). The Ad hoc on Demand Distance Vector (AODV) MANET routing protocol, enhanced to support proactive, reactive and hybrid Gateway Discovery Algorithms(GWDAs), has been proposed and applied in various literature works. For MNs to get connection to the internet, the GW node has to be discovered by using a GWDA and configured. The frequent topology change due to nodes’ movement in MANETs is a challenge in affecting performance of the GWDAs causing frequent link failures. This results in frequent GW discoveries and hence increased total discovery, handover between GW nodes and disconnection time. The link failure also causes packet drops that are being exchanged to the internet. In this thesis work, the impact of nodes’ mobility on the performance of reactive, proactive and hybrid GWDAs is studied thoroughly based on the density of nodes, traveler’s speed and strength of social interaction between nodes. As (MNs) are nothing but portable devices that are carried by humans, a more realistic mobility model (community based mobility model), that can show human socialization and cooperation behavior is used for the simulation. The results of this work showed that, the increase in travelers’ speed up to 10m/s shows improvement in the performances of the algorithms as it helps the distribution of MNs in the simulation area, but after that, performance of all the three algorithms degrades. The high social interaction helps to attain the best performance at lower speed than the low social interaction mobility condition but as travelers’ speed increases it aggravates the performance degradation of the algorithms. The less dense environment is observed to aggravate the effect of mobility on all algorithms. Comparatively the proactive GWDA, with greater routing overhead, out performs the other two. An algorithm which improves the reactive GWDA by performing discovery before a GW route fails, called predictive Performance Evaluation and Nodes’ Mobility Effect Analysis on AODV based Internet Gateway Discovery Algorithms in Social Networks ___________________________________________________________________________________ XIII GWDA is proposed in this thesis work. It is observed to perform much better than the reactive GWDA and has nearly equivalent performance with the proactive GWDA, but with a 5% to7% lesser overhead.
URI: http://hdl.handle.net/123456789/2842
Appears in:Thesis - Computer Engineering

Files in This Item:

File Description SizeFormat
859348290674791324534063010531359186941.99 MBAdobe PDFView/Open

Items in the AAUL Digital Library are protected by copyright, with all rights reserved, unless otherwise indicated.


  Last updated: May 2010. Copyright © Addis Ababa University Libraries - Feedback