The (k, l) Coredian Tree for Ad Hoc Networks

In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth and delay. Given a tree network T, a coredian path is a path in T that minimizes the centdian function, a k-coredian tree is a subtree of T with k leaves that minimizes the centdian function, and a (k, l)coredian tree is a subtree of T with k leaves and diameter l at most that minimizes the centdian function. The (k, l)-coredian tree can serve as a backbone for a network, where the internal nodes belong to the backbone and the leaves serve as the heads of the clusters covering the rest of the network. We show that a coredian path can be constructed at O() time with O(n) messages and a k-coredian tree can be constructed at O(k) time with O(kn) messages. We provide an O(n2 ) time construction algorithm for the (k, l)-coredian tree that requires O(n2 ) messages. We also give upper and lower bounds for a number ...

• Type: Journal
• Year: 2008
• Where: AHSWN
• Authors: Amit Dvir, Michael Segal
• Keywords: AHSWN 2008, Centdian Function, Tree, Tree Network