Quality of Service Routing Tree for Wireless Ad Hoc Networks

Abstract — Given the weighted graph G(V; E), where the weight of each edge represents the bandwidth of the corresponding link. We de ne the Quality of Service (QoS) path for any pair of nodes in V as a path with the bottleneck edge maximized. We further de ne the QoS tree G 0 (V; E 0) G(V; E), as a subgraph such that for any pair of nodes u and v in G 0 there exist a QoS path between u and v, and all intermediate edges are a subset of E 0. In this paper, we propose a distributed algorithm to construct a QoS tree, and the internal nodes of the tree form the backbone that maintains the QoS paths. Then we propose a proactive routing schemes that runs on the QoS tree. Only the nodes of the backbone are responsible for the maintenance of the routing tables. The QoS tree and its backbone are constructed using O(n log n) messages in O(n log n) time. I