A constant-factor approximation for wireless capacity maximization with power control in the SINR model

T Kesselheim - Proceedings of the twenty-second annual ACM-SIAM …, 2011 - SIAM
In modern wireless networks devices are able to set the power for each transmission carried
out. Experimental but also theoretical results indicate that such power control can improve …

Wireless capacity with oblivious power in general metrics

MM Halldórsson, P Mitra - Proceedings of the twenty-second annual ACM …, 2011 - SIAM
The capacity of a wireless network is the maximum possible amount of simultaneous
communication, taking interference into account. Formally, we treat the following problem …

Wireless scheduling with power control

MM Halldórsson - ACM Transactions on Algorithms (TALG), 2012 - dl.acm.org
We consider the scheduling of arbitrary wireless links in the physical model of interference to
minimize the time for satisfying all requests. We study here the combined problem of …

Distributed contention resolution in wireless networks

T Kesselheim, B Vöcking - International Symposium on Distributed …, 2010 - Springer
We present and analyze simple distributed contention resolution protocols for wireless
networks. In our setting, one is given n pairs of senders and receivers located in a metric …

[BUCH][B] Wireless link scheduling under physical interference model

PJ Wan, O Frieder, X Jia, F Yao, X Xu, S Tang - 2011 - ieeexplore.ieee.org
Link scheduling is a fundamental problem in multihop wireless networks because the
capacities of the communication links in multihop wireless networks, rather than being fixed …

Shortest link scheduling algorithms in wireless networks under the SINR model

J Yu, B Huang, X Cheng… - IEEE Transactions on …, 2016 - ieeexplore.ieee.org
This paper considers the shortest link scheduling problem in wireless networks under the
signal-to-interferenceplus-noise ratio (SINR) model. We propose an O (log (l max/l min)) …

Maximizing capacity in multihop cognitive radio networks under the SINR model

Y Shi, YT Hou, S Kompella… - IEEE Transactions on …, 2010 - ieeexplore.ieee.org
Cognitive radio networks (CRNs) have the potential to utilize spectrum efficiently and are
positioned to be the core technology for the next-generation multihop wireless networks. An …

Nearly optimal bounds for distributed wireless scheduling in the SINR model

MM Halldórsson, P Mitra - Distributed Computing, 2016 - Springer
We study the wireless scheduling problem in the SINR model. More specifically, given a set
of nn links, each a sender–receiver pair, we wish to partition (or schedule) the links into the …

Distributed algorithms for approximating wireless network capacity

M Dinitz - 2010 Proceedings IEEE INFOCOM, 2010 - ieeexplore.ieee.org
In this paper we consider the problem of maximizing wireless network capacity (aka one-
shot scheduling) in both the protocol and physical models. We give the first distributed …

Improved algorithms for latency minimization in wireless networks

A Fanghänel, T Kesselheim, B Vöcking - Theoretical Computer Science, 2011 - Elsevier
In the interference scheduling problem, one is given a set of n communication requests
described by source–destination pairs of nodes from a metric space. The nodes correspond …