BIB-VERSION:: CS-TR-v2.0
ID:: ncstrl.dartmouthcs//TR2004-511
ENTRY:: June 18, 2004
ORGANIZATION:: Dartmouth College, Computer Science
TITLE:: Outdoor Experimental Comparison of Four Ad Hoc Routing Algorithms
TYPE:: Technical Report (paper)
REVISION:: 1
AUTHOR:: Gray, Robert S. 
AUTHOR:: Kotz, David
AUTHOR:: Newport, Calvin
AUTHOR:: Dubrovsky, Nikita
AUTHOR:: Fiske, Aaron
AUTHOR:: Liu, Jason
AUTHOR:: Masone, Christopher
AUTHOR:: McGrath, Susan
AUTHOR:: Yuan, Yougu
DATE:: June 2004
RETRIEVAL:: For a paper copy, email <reports@cs.dartmouth.edu>
RETRIEVAL:: For a paper copy, write to
       Technical Report Librarian
       Department of Computer Science
       Dartmouth College
       6211 Sudikoff Laboratory
       Hanover, NH 03755-3510
       USA
RETRIEVAL:: PDF at http://www.cs.dartmouth.edu/reports/TR2004-511.pdf
ABSTRACT:: 
Most comparisons of wireless ad hoc routing
algorithms involve simulated or indoor trial runs,
or outdoor runs with only a small number of nodes,
potentially leading to an incorrect picture of
algorithm performance. In this paper, we report on
the results of an outdoor trial run of four
different routing algorithms, APRL, AODV, GPSR, and
STARA, running on top of thirty-three 802.11-enabled
laptops moving randomly through an athletic
field. The laptops generated random traffic
according to the traffic patterns observed in a
prototype application, and ran each routing
algorithm for a fifteen-minute period over the
course of the hour-long trial run. The 33-laptop
experiment represents one of the largest outdoor
tests of wireless routing algorithms, and three of
the algorithms each come from a different
algorithmic class, providing insight into the
behavior of ad hoc routing algorithms at larger
real-world scales than have been considered so
far. In addition, we compare the outdoor results
with both indoor ("tabletop") and simulation results
for the same algorithms, examining the differences
between the indoor results and the outdoor
reality. The paper also describes the software
infrastructure that allowed us to implement the ad
hoc routing algorithms in a comparable way, and use
the same codebase for indoor, outdoor, and simulated
trial runs.
NOTE:: 
See also TR2004-507 and TR2004-504.
END:: ncstrl.dartmouthcs//TR2004-511