2011Unpublished venueRequires access

Performance Enhancement of AODV over DSR on Demand Routing Protocols - Aspect of Packet Salvaging in AODV

Abdul-Fatau Adam

Open publisher page 2 citations

Abstract

Nodes in mobile ad hoc networks communicate with one another via packet radios on wireless multihop links. Because of node mobility and power limitations, the network topology changes frequently. Routing protocols therefore play an important role in mobile multihop network communications. This network is intended for situations when it is not economically practical or physically possible to deploy the necessary infrastructure, for example in temporary or remote locations such as rescue operations or military applications [1]. A recent trend in ad hoc network routing is the reactive on-demand philosophy where routes are established only when required. Most of the protocols in this category, however, use single route and do not utilize multiple alternate paths. In this paper, I propose a scheme to improve existing on-demand routing protocols by creating a mesh and providing multiple alternate routes. My algorithm establishes the mesh and multipaths without transmitting any extra control message. I apply my scheme to the Ad-hoc On-Demand Distance Vector (AODV) protocol and evaluate the performance improvements by simulation.

About this research paper

What this paper is about

Nodes in mobile ad hoc networks communicate with one another via packet radios on wireless multihop links. Because of node mobility and power limitations, the network topology changes frequently. Routing protocols therefore play an important role in mobile multihop network communications. This network is intended for situations when it is not economically practical or physically possible to deploy the necessary infrastructure, for example in temporary or remote locations such as rescue operations or military applications [1]. A recent trend in ad hoc network routing is the reactive on-demand philosophy where routes are established only when required. Most of the protocols in this category, however, use single route and do not utilize multiple alternate paths. In this paper, I propose a scheme to improve existing on-demand routing protocols by creating a mesh and providing multiple alternate routes. My algorithm establishes the mesh and multipaths without transmitting any extra control message. I apply my scheme to the Ad-hoc On-Demand Distance Vector (AODV) protocol and evaluate the performance improvements by simulation.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Nodes in mobile ad hoc networks communicate with one another via packet radios on wireless multihop links. Because of node mobility and power limitations, the network topology changes frequently. Routing protocols therefore play an important role in mobile multihop network communications. This network is intended for situations when it is not economically practical or physically possible to deploy the necessary infrastructure, for example in temporary or remote locations such as rescue operations or military applications [1]. A recent trend in ad hoc network routing is the reactive on-demand philosophy where routes are established only when required. Most of the protocols in this category, however, use single route and do not utilize multiple alternate paths. In this paper, I propose a scheme to improve existing on-demand routing protocols by creating a mesh and providing multiple alternate routes. My algorithm establishes the mesh and multipaths without transmitting any extra control message. I apply my scheme to the Ad-hoc On-Demand Distance Vector (AODV) protocol and evaluate the performance improvements by simulation.

Key concepts: Computer network, Computer science, Ad hoc On-Demand Distance Vector Routing, Dynamic Source Routing, Destination-Sequenced Distance Vector routing, Distance-vector routing protocol, Wireless ad hoc network, Routing protocol

Related papers

Back to paper searchBrowse research topicsOriginal source
Performance Enhancement of AODV over DSR on Demand Routing Protocols - Aspect of Packet Salvaging in AODV — Research Paper | ScholarLens