Portal de Periódicos da CAPES

An efficient routing protocol for wireless networks

1996; Springer Science+Business Media; Volume: 1; Issue: 2 Linguagem: Inglês

10.1007/bf01193336

1572-8153

Shree Murthy, J.J. Garcia‐Luna‐Aceves,

Wireless Networks and Protocols

We present the Wireless Routing Protocol (WRP). In WRP, routing nodes communicate the distance and secondto-last hop for each destination. WRP reduces the number of cases in which a temporary routing loop can occur, which accounts for its fast convergence properties. A detailed proof of correctness is presented and its performance is compared by simulation with the performance of the distributed Bellman-Ford Algorithm (DBF), DUAL (a loop-free distance-vector algorithm) and an Ideal Link-state Algorithm (ILS), which represent the state of the art of internet routing. The simulation results indicate that WRP is the most efficient of the alternatives analyzed.