Radio aggregation scheduling

Rajiv Gandhi, Magnús M. Halldórsson, Christian Konrad, Guy Kortsarz, Hoon Oh

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

4 Scopus citations

Abstract

We consider the aggregation problem in radio networks: find a spanning tree in a given graph and a conflict-free schedule of the edges so as to minimize the latency of the computation. While a large body of literature exists on this and related problems, we give the first approximation results in graphs that are not induced by unit ranges in the plane. We give a polynomial-time (Formula presented.)-approximation algorithm, where d̅ is the average degree and n the number of vertices in the graph, and show that the problem is Ω(n1-ε)-hard (and Ω((dn)1/2-ε)-hard) to approximate even on bipartite graphs, for any ε > 0, rendering our algorithm essentially optimal. We target geometrically defined graph classes, and in particular obtain a O(log n)-approximation in interval graphs

Original languageEnglish (US)
Title of host publicationAlgorithms for Sensor Systems - 11th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2015, Revised Selected Papers
EditorsKay Römer, Roger Wattenhofer, Leszek Antoni Gąsieniec, Prosenjit Bose
PublisherSpringer Verlag
Pages169-182
Number of pages14
ISBN (Print)9783319284712
DOIs
StatePublished - 2015
Event11th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2015 - Patras, Greece
Duration: Sep 17 2015Sep 18 2015

Publication series

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

Other

Other11th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2015
Country/TerritoryGreece
CityPatras
Period9/17/159/18/15

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Radio aggregation scheduling'. Together they form a unique fingerprint.

Cite this