37 citations · 142 across the 37 of their papers we have counts for
14 papers · 1 filter
Effective Wireless Scheduling via Hypergraph Sketches
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…
Spanning Trees With Edge Conflicts and Wireless Connectivity
Magnus M. Halldorsson, Guy Kortsarz, Pradipta Mitra +1
We introduce the problem of finding a spanning tree along with a partition of the tree edges into fewest number of feasible sets, where constraints on the edges define feasibility.…
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…
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…
The Price of Local Power Control in Wireless Scheduling
Magnus M. Halldorsson, Tigran Tonoyan
We consider the problem of scheduling wireless links in the physical model, where we seek an assignment of power levels and a partition of the given set of links into the minimum n…
How Well Can Graphs Represent Wireless Interference?
Magnus M. Halldorsson, Tigran Tonoyan
Efficient use of a wireless network requires that transmissions be grouped into feasible sets, where feasibility means that each transmission can be successfully decoded in spite o…