Brief announcement: Universal data aggregation trees for sensor networks in low doubling metrics

Srivathsan Srinivasagopalan, Costas Busch, S. Sitharama Iyengar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and independent of the number of data sources and fusion-costs at intermediate nodes. The tree construction is in polynomial time, and for low doubling dimension topologies it guarantees a O(log2 n)-approximation of the optimal aggregation cost. With constant fusion-cost functions our aggregation tree gives a O(logn)-approximation for every Steiner tree to the sink.

Original languageEnglish (US)
Title of host publicationAlgorithmic Aspects of Wireless Sensor Networks - 5th International Workshop, ALGOSENSORS 2009, Revised Selected Papers
Pages151-152
Number of pages2
DOIs
StatePublished - 2009
Externally publishedYes
Event5th International Workshop on Algorithmic Aspects of Wireless Sensor Networks, ALGOSENSORS 2009 - Rhodes, Greece
Duration: Jul 10 2009Jul 11 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5804 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th International Workshop on Algorithmic Aspects of Wireless Sensor Networks, ALGOSENSORS 2009
CountryGreece
CityRhodes
Period7/10/097/11/09

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Brief announcement: Universal data aggregation trees for sensor networks in low doubling metrics'. Together they form a unique fingerprint.

Cite this