Multihop Routing in Ad Hoc Networks
Information Theory
2016-11-17 v1 Networking and Internet Architecture
math.IT
Abstract
This paper presents a dual method of closed-form analysis and lightweight simulation that enables an evaluation of the performance of mobile ad hoc networks that is more realistic, efficient, and accurate than those found in existing publications. Some features accommodated by the new analysis are shadowing, exclusion and guard zones, and distance-dependent fading. Three routing protocols are examined: least-delay, nearest-neighbor, and maximum-progress routing. The tradeoffs among the path reliabilities, average conditional delays, average conditional number of hops, and area spectral efficiencies are examined.
Cite
@article{arxiv.1309.3582,
title = {Multihop Routing in Ad Hoc Networks},
author = {Don Torrieri and Salvatore Talarico and Matthew C. Valenti},
journal= {arXiv preprint arXiv:1309.3582},
year = {2016}
}
Comments
6 pages, 6 figures, to appear in IEEE Military Commun. Conf. (MILCOM), 2013