An Efficient Routing Protocol for Wireless Networks-英文文献.pdf

Baltzer Journals An Ecient Routing Proto col for Wireless Networks Shree Murthy and J.J. Garcia-Luna-Aceves Computer Engineering, University of California, Santa Cruz, CA 95064 We present the wireless routing proto col (WRP). In WRP, routing no des commu- nicate the distance and second-to-last hop for each destination. WRP reduces the numb er of cases in which a temp orary routing lo op can o ccur, which accounts for its fast convergence prop erties. A detailed pro of of correctness is presented and its p erformance is compared by simulation with the p erformance of the distributed Bellman-Ford algorithm (DBF), DUAL (a lo op-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 ecient of the alternatives analyzed. Keywords : routing, packet radio, wireless, distance-vector, link-state, shortest- path 1 { Intro duction The routing proto cols used in multihop packet-radio networks implemented in the past [2 , 3, 11] were based on shortest-path routing algorithms that have b een typically based on the distributed Bellman-Ford algorithm (DBF) [4]. According to DBF, a routing no de knows the length of the shortest path from each neighb or to every network destination and this information is used to compute the shortest path and successor in the path to each destination. An up date message contains a vector of one or more entries, each of which sp ecies as a minimum, the distance to a given destination. A ma jor p erformance problem with DBF is that it takes