Geometric Spanners for Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Connected Dominating Set and its Induced Position-less Sparse Spanner For Mobile Ad Hoc Networks
ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
Weakly-Connected Dominating Sets and Sparse Spanners in Wireless Ad Hoc Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Precomputation schemes for QoS routing
IEEE/ACM Transactions on Networking (TON)
Preemptive quality of service infrastructure for wireless mobile ad hoc networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
CEDAR: a core-extraction distributed ad hoc routing algorithm
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
We define the Quality of Service Routing Tree (QoSRT) for the weighted graph G(V,E), as a subgraph G'(V,E') such that G' is a tree, and the set of intermediate edges of the path between any pair of nodes u and v is a subset of E'. The weight of an edge represents its bandwidth. Furthermore, the lowest weight edge (bottleneck) of the path is maximized. In this paper, we propose a distributed algorithm to construct a QoSRT that adapts quickly to mobile environments. The QoSRT is uniquely constructed for maintenance purposes. A maintenance scheme that responds quickly to mobility and bandwidth changes is also provided. A virtual backbone (VBB) which consists of a subset of the nodes is also constructed. The QoSRT and its VBB are constructed using O(nlog n) messages in O(nlog n) time.