TY - JOUR

T1 - Radio aggregation scheduling

AU - Gandhi, Rajiv

AU - Halldórsson, Magnús M.

AU - Konrad, Christian

AU - Kortsarz, Guy

AU - Oh, Hoon

N1 - Publisher Copyright:
© 2020

PY - 2020/11/6

Y1 - 2020/11/6

N2 - 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 O˜(dn)-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 also obtain a O(logn)-approximation in interval graphs.

AB - 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 O˜(dn)-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 also obtain a O(logn)-approximation in interval graphs.

KW - Approximation algorithms

KW - Data aggregation

KW - Radio networks

UR - http://www.scopus.com/inward/record.url?scp=85090479558&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2020.07.032

DO - 10.1016/j.tcs.2020.07.032

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:85090479558

SN - 0304-3975

VL - 840

SP - 143

EP - 153

JO - Theoretical Computer Science

JF - Theoretical Computer Science

ER -