Performance Comparison of Ad-Hoc Routing Protocols for Networks
with Node Energy Constraints

Anne Aaron, amaaron@stanford.edu
Jie Weng, jweng@stanford.edu


Abstract

A major issue with ad-hoc networks is energy consumption since nodes are usually mobile and battery-operated.  In this project we compared the performance of ad-hoc routing protocols in a network where each participating mobile node has a given battery life and will shut-down when a threshold is reached.  We studied two routing protocols, Dynamic Source Routing (DSR), and Destination-Sequenced Distance-Vector Routing (DSDV), by comparing the node termination rate as well as the over-all goodput of the network.  From the simulations we observed that in high node density, DSR performs better than DSDV.  The performance gap can be decreased by smaller number of nodes in the network or more path loss and shadowing variance.

Final Paper

Project Proposal