homeresources & publications › ad hoc routing with distributed ordered sequences


Ad hoc routing with distributed ordered sequences


We propose a new hop-by-hop routing protocol for ad hoc wireless networks that uses a novel sequence number scheme to ensure loop-freedom at all times. We use a single large per-destination label space to order nodes in a topological sort (directed acyclic graph). Nodes manipulate the label set in-network without needing destination-controlled resets, so path repair is localized. The label size is large enough that it should never be exhausted in the lifetime of any given network. Route request flooding is performed through a new method that exploits the inherent partial order of the network, so nodes can share RREQ floods. Whereas most previous route request pruning techniques create a request tree, the new technique creates a directed acyclic request graph. Simulation results compared to AODV, DSR and OLSR show that the new protocol has in most cases equivalent or better packet delivery ratio and latency, but with a fraction of the network load.


Mosko, M. ; Garcia-Luna-Aceves, J. J. Ad hoc routing with distributed ordered sequences. IEEE 25th Conference on Computer Communications (INFOCOM 2006); 2006 April 23-29; Barcelona; Spain.