Performance Analysis of Geographic Routing Protocols in Ad Hoc Networks

TL;DR

This paper compares the performance of geographic routing protocols and AODV in ad hoc networks using a combined analytical and simulation approach, considering realistic factors like shadowing and fading.

Contribution

It introduces a dual method of analysis that offers a more realistic performance evaluation of routing protocols in finite ad hoc networks.

Findings

Geographic routing reduces topology storage requirements.

Trade-offs between reliability, delay, hops, and spectral efficiency are characterized.

The analysis incorporates shadowing, exclusion zones, and fading effects.

Abstract

Geographic routing protocols greatly reduce the requirements of topology storage and provide flexibility in the accommodation of the dynamic behavior of ad hoc networks. This paper presents performance evaluations and comparisons of two geographic routing protocols and the popular AODV protocol. The trade-offs among the average path reliabilities, average conditional delays, average conditional number of hops, and area spectral efficiencies and the effects of various parameters are illustrated for finite ad hoc networks with randomly placed mobiles. This paper uses a dual method of closed-form analysis and simple simulation that is applicable to most routing protocols and provides a much more realistic performance evaluation than has previously been possible. Some features included in the new analysis are shadowing, exclusion and guard zones, and distance-dependent fading.