Abstract
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 the notion of second-to-last hop node to a destination. WRP reduces the number of cases in which a temporary routing loop can occur and also provides a mechanism for the reliable transmission of update messages. The performance of WRP has been compared quantitatively by simulations with that of distributed Bellman-Ford (DBF), DUAL (a loop-free, distance-vector algorithm), and an ideal link-state algorithm (ILS) that represents the state of the art of Internet routing in a highly dynamic environment. The simulation results indicate that WRP is the most efficient of the algorithms simulated in a wireless environment.
Keywords
Computer networkComputer scienceZone Routing ProtocolWireless Routing ProtocolDynamic Source RoutingEnhanced Interior Gateway Routing ProtocolRouting protocolLink-state routing protocolPath vector protocolRouting Information ProtocolDistributed computingDistance-vector routing protocolStatic routingDestination-Sequenced Distance Vector routingHazy Sighted Link State Routing ProtocolNetwork packet
Affiliated Institutions
Related Publications
Issues in packet radio network design
There are many design choices that must be made in the development of a packet radio network. There is usually no single correct choice, and the decisions are dependent on the e...
The DARPA packet radio network protocols
In this paper we describe the current state of the DARPA packet radio network. Fully automated algorithms and protocols to organize, control, maintain, and move traffic through ...
Ad-hoc on-demand distance vector routing
An ad-hoc network is the cooperative engagement of acollection of mobile nodes without the required intervention of any centralizedaccess point or existing infrastructure. In th...
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...
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 evaluat...
Publication Info
- Year
- 1995
- Type
- article
- Pages
- 86-95
- Citations
- 210
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
210
OpenAlex
Cite This
Shree Murthy,
J.J. Garcia‐Luna‐Aceves
(1995).
A routing protocol for packet radio networks.
, 86-95.
https://doi.org/10.1145/215530.215560
Identifiers
- DOI
- 10.1145/215530.215560