output
20052026
most citeduFLIP: Understanding Flash IO Patterns

153 citations

Showing cs.NIShow all

8 papers · 1 filter

cs.NI2017

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…

cs.NI201510 cited

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…

cs.NI2014

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…

cs.NI20121 cited

Wireless Network Stability in the SINR Model

Eyjolfur I. Asgeirsson, Magnus M. Halldorsson, Pradipta Mitra

We study the stability of wireless networks under stochastic arrival processes of packets, and design efficient, distributed algorithms that achieve stability in the SINR (Signal t…

cs.NI20128 cited

Towards Tight Bounds for Local Broadcasting

Magnus M. Halldorsson, Pradipta Mitra

We consider the local broadcasting problem in the SINR model, which is a basic primitive for gathering initial information among wireless nodes. Assuming that nodes can measure…

cs.NI20129 cited

Distributed Connectivity of Wireless Networks

Magnus M. Halldorsson, Pradipta Mitra

We consider the problem of constructing a communication infrastructure from scratch, for a collection of identical wireless nodes. Combinatorially, this means a) finding a set of l…