Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Entire DC Network
Experimental Evaluation Of Wireless Simulation Assumptions, David Kotz, Calvin Newport, Robert S. Gray, Jason Liu, Yougu Yuan, Chip Elliot
Experimental Evaluation Of Wireless Simulation Assumptions, David Kotz, Calvin Newport, Robert S. Gray, Jason Liu, Yougu Yuan, Chip Elliot
Dartmouth Scholarship
All analytical and simulation research on ad hoc wireless networks must necessarily model radio propagation using simplifying assumptions. We provide a comprehensive review of six assumptions that are still part of many ad hoc network simulation studies, despite increasing awareness of the need to represent more realistic features, including hills, obstacles, link asymmetries, and unpredictable fading. We use an extensive set of measurements from a large outdoor routing experiment to demonstrate the weakness of these assumptions, and show how these assumptions cause simulation results to differ significantly from experimental results. We close with a series of recommendations for researchers, whether …
Three Power-Aware Routing Algorithms For Sensor Networks, Javed Aslam, Qun Li, Daniela Rus
Three Power-Aware Routing Algorithms For Sensor Networks, Javed Aslam, Qun Li, Daniela Rus
Dartmouth Scholarship
This paper discusses online power‐aware routing in large wireless ad hoc networks (especially sensor networks) for applications in which the message sequence is not known. We seek to optimize the lifetime of the network. We show that online power‐aware routing does not have a constant competitive ratio to the off‐line optimal algorithm. We develop an approximation algorithm called max–min zPmin that has a good empirical competitive ratio. To ensure scalability, we introduce a second online algorithm for power‐aware routing. This hierarchical algorithm is called zone‐based routing. Our experiments show that its performance is quite good. Finally, we …