Description: 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.
- [log-distancepathloss] - log_distance path loss model for wireles
- [aodv_v8] - Aodv for NS-2. A mobile ad-hoc network (
- [short] - The algorithm is described in detail the
- [wrls-dsdv] - simulation of the DSDV routing Ad-Hoc pr
- [Okamura] - The model is based on field measurements
- [DSRSourceFiles.tar] - Dynamic source routing protocol source c
- [awds-8.12.tar] - AWDS (Ad-hoc Wireless Distribution Servi
- [AD-HOC] - about ad-hoc
- [pkt_loss] - the program here is in-as awk script. it
- [wrlsdsr-pgm] - A 3-node example for ad-hoc simulation w
File list (Check if you may need any files):
Performance Comparison of Ad-hoc.pdf
Download