|
Abstract : |
This work proposes a self-organizing, dynamic infrastructure called a spine for efficient routing in ad hoc networks. We present a scalable framework for routing that encompasses a range of knowledge at each spine node, and identify the trade-offs involved for routing at different points in this range. Our routing algorithm requires only partial topology information at each spine node, consisting of the spine structure, dependents of each spine node, propagation of long-lived links, and snooped routing information from ongoing flows. Through worst-case theoretical bounds and simulation of typical scenarios, we show that the spinebased routing with only partial topology information provides good routes at low overhead. 1., |
