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
Computer scienceComputer networkBandwidth (computing)AlgorithmLink-state routing protocolTopology (electrical circuits)Routing protocolCircuit switchingStatic routingDistributed computingRouting (electronic design automation)Mathematics
Affiliated Institutions
Related Publications
A routing protocol for packet radio networks
Abstract : The authors present a new distance-vector routing protocol for a packet radio network. The new distributed routing protocol, Wireless Routing Protocol (WRP), works on...
A highly adaptive distributed routing algorithm for mobile wireless networks
We present a new distributed routing protocol for mobile, multihop, wireless networks. The protocol is one of a family of protocols which we term “link reversal” algorithms. The...
System capacity, latency, and power consumption in multihop-routed SS-CDMA wireless networks
Ad-hoc wireless networking presents challenges that are different from those of tethered networks in several significant ways. In addition to high error rates and constantly var...
Matched filter performance bounds for diversity combining receivers in digital mobile radio
By employing the technique known as the matched filter bound, the authors derive analytical expressions for the distribution and average of the bit-error-rate in an ideal space ...
Resilient overlay networks
A Resilient Overlay Network (RON) is an architecture that allows distributed Internet applications to detect and recover from path outages and periods of degraded performance wi...
Publication Info
- Year
- 2002
- Type
- article
- Pages
- 592-598
- Citations
- 104
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
104
OpenAlex
Cite This
V.D. Park,
M. Scott Corson
(2002).
A performance comparison of the temporally-ordered routing algorithm and ideal link-state routing.
, 592-598.
https://doi.org/10.1109/iscc.1998.702600
Identifiers
- DOI
- 10.1109/iscc.1998.702600