The (k,l) coredian tree for ad hoc networks

Amit Dvir, Michael Segal

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

In this paper, we present 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 intermediate 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. While a (k, l)-coredian tree can be constructed at O(n2) time with O(n2) messages. A simulation is presented for various values of n and k.

Original languageEnglish
Title of host publicationProceedings - The 28th International Conference on Distributed Computing Systems Workshops, ICDCS Workshops 2008
Pages267-272
Number of pages6
DOIs
StatePublished - 22 Sep 2008
Event28th International Conference on Distributed Computing Systems Workshops, ICDCS Workshops 2008 - Beijing, China
Duration: 17 Jun 200820 Jun 2008

Publication series

NameProceedings - International Conference on Distributed Computing Systems

Conference

Conference28th International Conference on Distributed Computing Systems Workshops, ICDCS Workshops 2008
Country/TerritoryChina
CityBeijing
Period17/06/0820/06/08

Keywords

  • Ad hoc networks
  • Backbone
  • Sensor networks

Fingerprint

Dive into the research topics of 'The (k,l) coredian tree for ad hoc networks'. Together they form a unique fingerprint.

Cite this