Outdoor experimental comparison of four ad hoc routing algorithms

  • Authors:
  • Robert S. Gray;David Kotz;Calvin Newport;Nikita Dubrovsky;Aaron Fiske;Jason Liu;Christopher Masone;Susan McGrath;Yougu Yuan

  • Affiliations:
  • Dartmouth College, Hanover, NH;Dartmouth College, Hanover, NH;Dartmouth College, Hanover, NH;Dartmouth College, Hanover, NH;Dartmouth College, Hanover, NH;Colorado School of Mines, Golden, CO;Dartmouth College, Hanover, NH;Dartmouth College, Hanover, NH;Dartmouth College, Hanover, NH

  • Venue:
  • MSWiM '04 Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

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 an outdoor comparison of four different routing algorithms, APRL, AODV, ODMRP, and STARA, running on top of thirty-three 802.11-enabled laptops moving randomly through an athletic field. This comparison provides 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. Finally, we describe 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.