A performance comparison of the temporally-ordered routing algorithm and ideal link-state routing

We present a relative performance comparison of the Temporally-Ordered Routing Algorithm (TORA) with an Ideal Link State (ILS) routing algorithm. The performance metrics evaluated include bandwidth efficiency for both control and data, as well as end-to-end message packet delay and throughput. The routing algorithms are compared in the context of a dynamic, multihop, wireless network employing broadcast transmissions. The network parameters varied include network size, average rate of topological changes and average network connectivity. While the average network connectivity was found not to be a significant factor, the relative performance of TORA and ILS was found to be critically dependent on the network size, and average rate of topological changes. The results further indicate that for a given available bandwidth—as either the size of network increases or the rate of network topological change increases, the performance of TORA eventually exceeds that of ILS.