Routing in mobile ad hoc networks

Abstract

This paper describes a simulation-based evaluation of several unicast routing protocols tailored specifically for mobile ad hoc networks. Four protocols were evaluated: the wireless Internet routing protocol (WIRP), a link state (LS) algorithm with constrained LS updates, a distance vector variant of WIRP, and temporally ordered routing algorithm (TORA). The goal was to determine how well these routing protocols worked in specific tactical conditions, supporting a given mix of traffic. Factors varied included tactical scenario, network size, and loading. Tactical scenario included different connectivities (e.g., "dense" versus "sparse") and link fluctuation rates (e.g., "high" versus "low"). Metrics collected included average end-to end delay per application, path length, total efficiency, and fraction of user messages received. We found that certain protocols performed better in densely connected networks than in sparser networks (e.g., TORA), while some performed better in sparser networks (e.g., LS). One protocol, WIRP, performed well in both types of networks over the scenarios evaluated, Several remaining issues and areas for continued research are identified.