Performance of Ad-Hoc on-Demand Distance Vector Discovery Algorithms Based On Packet Lifetime

Ad hoc On-Demand Distance Vector (AODV) routing protocol is a reactive protocol in Mobile Ad hoc Network (MANET). AODV uses a distance or hop count for determining the best forwarding path and store the sequence number at table entry to ensure the path information is up-to-date. Although the AODV is...

Full description

Saved in:

Bibliographic Details
Main Author:	Ahmad, Noor Azlan
Format:	Thesis
Language:	English English
Published:	2008
Subjects:	Routing protocols (Computer network protocols)
Online Access:	http://psasir.upm.edu.my/id/eprint/5252/1/FSKTM_2008_18A.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-upm-ir.5252
record_format	uketd_dc
spelling	my-upm-ir.52522013-05-27T07:21:29Z Performance of Ad-Hoc on-Demand Distance Vector Discovery Algorithms Based On Packet Lifetime 2008 Ahmad, Noor Azlan Ad hoc On-Demand Distance Vector (AODV) routing protocol is a reactive protocol in Mobile Ad hoc Network (MANET). AODV uses a distance or hop count for determining the best forwarding path and store the sequence number at table entry to ensure the path information is up-to-date. Although the AODV is a better performance compare to other proactive and reactive routing protocol in MANET, this routing still has a limitation and can to be improved. In this research, two algorithms that enhanced the original AODV are proposed. The first algorithm focuses on the AODV route table update management. The combination metrics of the lifetime and the sequence number in the table entry is used to solve the problem of the discarded active path information when the lifetime is expired. From the performance analysis, the proposed algorithm is successful to enhance the original AODV based on the performance of delay, overhead, packet delivery ratio and packet loss ratio. The second proposed algorithm is focused on the AODV route discovery. On the original AODV, packets will be allowed to rebroadcast the packet with a minimal lifetime. This will cause an unnecessary packets are discarded from the broadcasting. To solve this problem, Lifetime Ratio (LR) is proposed to reduce the unnecessary packets rebroadcast until it reaches the destination nodes. Based on the performance analysis, LR algorithm enhances the performance of the overhead, packet delivery ratio and packet loss ratio. The performance analysis of the proposed algorithms was conducted by using the discrete-event simulator, OMNeT++. The simulator was used to simulate the mobility environment and the Open System Interconnections (OSI) layers utilized in wireless simulation. To compare the performance between the original AODV and the proposed algorithms, the performance metrics are based on delay, overhead, packet delivery ratio, packet loss ratio and throughput. From the extensive simulations based on the performance metrics, the two proposed algorithms have shown distinct improvement and subsequently enhancing the performance of AODV. Routing protocols (Computer network protocols) 2008 Thesis http://psasir.upm.edu.my/id/eprint/5252/ http://psasir.upm.edu.my/id/eprint/5252/1/FSKTM_2008_18A.pdf application/pdf en public masters Universiti Putra Malaysia Routing protocols (Computer network protocols) Computer Science and Information Technology English
institution	Universiti Putra Malaysia
collection	PSAS Institutional Repository
language	English English
topic	Routing protocols (Computer network protocols)
spellingShingle	Routing protocols (Computer network protocols) Ahmad, Noor Azlan Performance of Ad-Hoc on-Demand Distance Vector Discovery Algorithms Based On Packet Lifetime
description	Ad hoc On-Demand Distance Vector (AODV) routing protocol is a reactive protocol in Mobile Ad hoc Network (MANET). AODV uses a distance or hop count for determining the best forwarding path and store the sequence number at table entry to ensure the path information is up-to-date. Although the AODV is a better performance compare to other proactive and reactive routing protocol in MANET, this routing still has a limitation and can to be improved. In this research, two algorithms that enhanced the original AODV are proposed. The first algorithm focuses on the AODV route table update management. The combination metrics of the lifetime and the sequence number in the table entry is used to solve the problem of the discarded active path information when the lifetime is expired. From the performance analysis, the proposed algorithm is successful to enhance the original AODV based on the performance of delay, overhead, packet delivery ratio and packet loss ratio. The second proposed algorithm is focused on the AODV route discovery. On the original AODV, packets will be allowed to rebroadcast the packet with a minimal lifetime. This will cause an unnecessary packets are discarded from the broadcasting. To solve this problem, Lifetime Ratio (LR) is proposed to reduce the unnecessary packets rebroadcast until it reaches the destination nodes. Based on the performance analysis, LR algorithm enhances the performance of the overhead, packet delivery ratio and packet loss ratio. The performance analysis of the proposed algorithms was conducted by using the discrete-event simulator, OMNeT++. The simulator was used to simulate the mobility environment and the Open System Interconnections (OSI) layers utilized in wireless simulation. To compare the performance between the original AODV and the proposed algorithms, the performance metrics are based on delay, overhead, packet delivery ratio, packet loss ratio and throughput. From the extensive simulations based on the performance metrics, the two proposed algorithms have shown distinct improvement and subsequently enhancing the performance of AODV.
format	Thesis
qualification_level	Master's degree
author	Ahmad, Noor Azlan
author_facet	Ahmad, Noor Azlan
author_sort	Ahmad, Noor Azlan
title	Performance of Ad-Hoc on-Demand Distance Vector Discovery Algorithms Based On Packet Lifetime
title_short	Performance of Ad-Hoc on-Demand Distance Vector Discovery Algorithms Based On Packet Lifetime
title_full	Performance of Ad-Hoc on-Demand Distance Vector Discovery Algorithms Based On Packet Lifetime
title_fullStr	Performance of Ad-Hoc on-Demand Distance Vector Discovery Algorithms Based On Packet Lifetime
title_full_unstemmed	Performance of Ad-Hoc on-Demand Distance Vector Discovery Algorithms Based On Packet Lifetime
title_sort	performance of ad-hoc on-demand distance vector discovery algorithms based on packet lifetime
granting_institution	Universiti Putra Malaysia
granting_department	Computer Science and Information Technology
publishDate	2008
url	http://psasir.upm.edu.my/id/eprint/5252/1/FSKTM_2008_18A.pdf
_version_	1747810384396419072

Performance of Ad-Hoc on-Demand Distance Vector Discovery Algorithms Based On Packet Lifetime

Similar Items