Nearly optimal bounds for distributed wireless scheduling in the SINR ...
link.springer.com › article
Jun 7, 2014 · We study the wireless scheduling problem in the SINR model. More specifically, given a set of n links, each a sender–receiver pair, ...
Apr 27, 2011 · We give a distributed O(\log n)-approximation algorithm for the scheduling problem, matching the best ratio known for centralized algorithms. It ...
Nearly Optimal Bounds for Distributed Wireless Scheduling in the SINR ...
link.springer.com › chapter
We study the wireless scheduling problem in the physically realistic SINR model. More specifically: we are given a set of n links, each a sender-receiver ...
We study the wireless scheduling problem in the SINR model. More specifically, given a set of $n$ links, each a sender-receiver pair, we wish to partition ...
We also show that every distributed algorithm uses Ω ( log n ) Ω(logn) slots to schedule certain instances that require only two slots, which implies that the ...
In this work, we use the physical, a.k.a. SINR, model of interference, dened in Sect. 2. It is known to capture reality more faithfully than the graph-based ...
Nearly optimal bounds for distributed wireless scheduling in the SINR model. Profile image of Magnus M. Halldorsson Magnus M. Halldorsson. 2014, Distributed ...
Jun 7, 2014 · Early work on scheduling in the SINR model focused on heuristics and/or non-algorithmic average-case analysis (e.g. [11]). In seminal work, ...
Nearly optimal bounds for distributed wireless scheduling in the SINR model. https://doi.org/10.1007/s00446-014-0222-7. Journal: Distributed Computing, 2014 ...
Dive into the research topics of 'Nearly optimal bounds for distributed wireless scheduling in the SINR model'. Together they form a unique fingerprint. Sort by ...