Using labeled paths for loop-free on-demand routing in ad hoc networks
H. Rangarajan, Jose Joaquin Garcia-Luna-Aceves · 2004
We present the Feasible Label Routing (FLR) protocol for mobilead hoc networks, which uses path information to establish routes to destinations on demand. FLR enables loop-free incremental(hop-by-hop) routing of data packets using only the addresses of their destinations. Like the dynamic source routing (DSR) protocol, FLR avoids the need for any time-stamps or sequence numbers by the use of path vectors exchanged when routes are established or repaired. Instantaneous loop freedom is attained by using path information for a destination as labels with which routers are ordered lexicographically with respect to the destination, i.e., FLR ensures that the labels of routers for a given destination become "smaller" the closer they are to the destination. Simulation experiments in Qualnet show that the performance of FLR is far better than the performance of the ad-hoc on-demand distance vector (AODV) protocol, the dynamic source routing (DSR) protocol, and the optimized link state routing (OLSR) protocol, in terms of the packet delivery ratio and average delivery latencies achieved, as well as the overhead incurred in the network.