11 citations · 42 across the 12 of their papers we have counts for
4 papers · 1 filter
Wireless Aggregation at Nearly Constant Rate
Magnus M. Halldorsson, Tigran Tonoyan
One of the most fundamental tasks in sensor networks is the computation of a (compressible) aggregation function of the input measurements. What rate of computation can be maintain…
Wireless Link Capacity under Shadowing and Fading
Magnus M. Halldorsson, Tigran Tonoyan
We consider the following basic link capacity (a.k.a., one-shot scheduling) problem in wireless networks: Given a set of communication links, find a maximum subset of links that ca…
Universal Framework for Wireless Scheduling Problems
Magnus M. Halldorsson, Tigran Tonoyan
An overarching issue in resource management of wireless networks is assessing their capacity: How much communication can be achieved in a network, utilizing all the tools available…
Preemptive Online Partitioning of Sequences
Christian Konrad, Tigran Tonoyan
Online algorithms process their inputs piece by piece, taking irrevocable decisions for each data item. This model is too restrictive for most partitioning problems, since data tha…