A performance comparison of the temporally-ordered routing algorithm and ideal link-state routing
- 27 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 592-598
- https://doi.org/10.1109/iscc.1998.702600
Abstract
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 the 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.Keywords
This publication has 10 references indexed in Scilit:
- A highly adaptive distributed routing algorithm for mobile wireless networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- An efficient routing protocol for wireless networksMobile Networks and Applications, 1996
- A distributed routing algorithm for mobile wireless networksWireless Networks, 1995
- OSPF Version 2Published by RFC Editor ,1994
- Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computersPublished by Association for Computing Machinery (ACM) ,1994
- Loop-free routing using diffusing computationsIEEE/ACM Transactions on Networking, 1993
- Another adaptive distributed shortest path algorithmIEEE Transactions on Communications, 1991
- A Responsive Distributed Routing Algorithm for Computer NetworksIEEE Transactions on Communications, 1982
- Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing TopologyIEEE Transactions on Communications, 1981
- A Failsafe Distributed Routing ProtocolIEEE Transactions on Communications, 1979