Outdoor Experimental Comparison of Four Ad Hoc Routing Algorithms Export

@inproceedings{gray:outdoor, abstract = {Most comparisons of wireless ad hoc routing algorithms involve simulated or {\\\\\\\\\\\\\\\\em 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 {\\\\\\\\\\\\\\\\em same} codebase for indoor, outdoor, and simulated trial runs.}, author = {Gray, Robert S. and Kotz, David and Newport, Calvin and Dubrovsky, Nikita and Fiske, Aaron and Liu, Jason and Masone, Christopher and Mcgrath, Susan and Yuan, Yougu}, booktitle = {Proceedings of the ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM)}, citeulike-article-id = {2820530}, citeulike-linkout-0 = {http://www.cs.dartmouth.edu/~dfk/papers/gray:compare.pdf}, comment = {Finalist for Best Paper award}, keywords = {crawdad, dartmouth\_outdoor, measurement, wireless}, month = {October}, pages = {220--229}, posted-at = {2008-05-21 17:13:03}, priority = {2}, publisher = {ACM Press}, title = {Outdoor Experimental Comparison of Four Ad Hoc Routing Algorithms}, url = {http://www.cs.dartmouth.edu/~dfk/papers/gray:compare.pdf}, year = {2004} }

TY - CONF ID - gray:outdoor L3 - citeulike-article-id:2820530 N2 - Most comparisons of wireless ad hoc routing algorithms involve simulated or {\\\\\\\\\\\\\\\\em 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 {\\\\\\\\\\\\\\\\em same} codebase for indoor, outdoor, and simulated trial runs. EP - 229 TI - Outdoor Experimental Comparison of Four Ad Hoc Routing Algorithms PB - ACM Press T2 - Proceedings of the ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM) SP - 220 KW - crawdad KW - dartmouth_outdoor KW - measurement KW - wireless N1 - Finalist for Best Paper award AU - Gray, Robert AU - Kotz, David AU - Newport, Calvin AU - Dubrovsky, Nikita AU - Fiske, Aaron AU - Liu, Jason AU - Masone, Christopher AU - Mcgrath, Susan AU - Yuan, Yougu PY - 2004/October// UR - http://www.cs.dartmouth.edu/~dfk/papers/gray:compare.pdf ER -