Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

ALGOSENSORS

2009

Springer

2009

Springer

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(log n)approximation for every Steiner tree to the sink. 1 Summary We consider the fundamental problem of data aggregation in sensor networks towards a sink node s. The motivation comes from the hierarchical matching algorithm in [1] that constructs a data aggregation tree that is simultaneously good for all canonical fusion-cost functions f which are concave and non-decreasing. However, every time the data sources change the aggregation tree has to be reconstructed. In order to alleviate this problem, a nove...

Added |
16 Feb 2011 |

Updated |
16 Feb 2011 |

Type |
Journal |

Year |
2009 |

Where |
ALGOSENSORS |

Authors |
Srinivasagopalan Srivathsan, Costas Busch, S. Sitharama Iyengar |

Comments (0)