A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any pair of vertices. A lower bound, due to Thorup and Zwick, shows that a distance oracle that returns paths of worst-case stretch (2k − 1) must require space Ω(n) for graphs over n nodes. The hard cases that enforce this ...

The Mobile Backbone Network (MBN) architecture has been introduced to support multimedia applications for mobile adhoc wireless network. Under the MBN architecture, backbone nodes are dynamically elected to construct a mobile backbone network (Bnet). The MBN employs Mobile Backbone Network Routing with Flow Control (MBNR-FC) mechanism. It reduces the routing control overhead by selectively floo...