Wireless link scheduling under a graded SINR interference model
Proceedings of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Oblivious interference scheduling
Proceedings of the 28th ACM symposium on Principles of distributed computing
Online capacity maximization in wireless networks
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Distributed contention resolution in wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
Improved algorithms for latency minimization in wireless networks
Theoretical Computer Science
Nearly optimal bounds for distributed wireless scheduling in the SINR model
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Convergence time of power-control dynamics
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Maximizing capacity with power control under physical interference model in simplex mode
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Literature Survey on Power Control Algorithms for Mobile Ad-hoc Network
Wireless Personal Communications: An International Journal
Wireless capacity with oblivious power in general metrics
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Power Control By Geometric Programming
IEEE Transactions on Wireless Communications
Scheduling in wireless networks with rayleigh-fading interference
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Distributed interference compensation for wireless networks
IEEE Journal on Selected Areas in Communications
Connectivity and aggregation in multihop wireless networks
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Brief announcement: universally truthful secondary spectrum auctions
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Maximum independent set of links with power control
WASA'13 Proceedings of the 8th international conference on Wireless Algorithms, Systems, and Applications
| Hi-index | 0.00 |
We consider scheduling problems in wireless networks with respect to flexible data rates. That is, more or less data can be transmitted per time depending on the signal quality, which is determined by the signal-to-interference-plus-noise ratio (SINR). Each wireless link has a utility function mapping SINR values to the respective data rates. We have to decide which transmissions are performed simultaneously and (depending on the problem variant) also which transmission powers are used. In the capacity-maximization problem, one strives to maximize the overall network throughput, i.e., the summed utility of all links. For arbitrary utility functions (not necessarily continuous ones), we present an O(logn)-approximation when having n communication requests. This algorithm is built on a constant-factor approximation for the special case of the respective problem where utility functions only consist of a single step. In other words, each link has an individual threshold and we aim at maximizing the number of links whose threshold is satisfied. On the way, this improves the result in [Kesselheim, SODA 2011] by not only extending it to individual thresholds but also showing a constant approximation factor independent of assumptions on the underlying metric space or the network parameters. In addition, we consider the latency-minimization problem. Here, each link has a demand, e.g., representing an amount of data. We have to compute a schedule of shortest possible length such that for each link the demand is fulfilled, that is, the overall summed utility (or data transferred) is at least as large as its demand. Based on the capacity-maximization algorithm, we show an O(log2n)-approximation for this problem.