Abstract

We present a new distance-vector routing protocol for a packet radio network. The new distributed 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 loopfree distance-vector algorithm) and an ideal link-state algorithm (ILS) which 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. 1 Introduction With the recent proliferation of laptop and portable computers, and the development of wireless network interfaces, host mobility is becoming an important issue. An efficient routing protocol is necessary to communicate directly wi...

Citations