Probabilistic construction of deterministic algorithms: approximating packing integer programs
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Balls and bins: a study in negative dependence
Random Structures & Algorithms
Topology control meets SINR: the scheduling complexity of arbitrary topologies
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Proceedings of the 12th annual international conference on Mobile computing and networking
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Cross-layer latency minimization in wireless networks with SINR constraints
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Improved Algorithms for Latency Minimization in Wireless Networks
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Oblivious interference scheduling
Proceedings of the 28th ACM symposium on Principles of distributed computing
Maximum Independent Set of Links under Physical Interference Model
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
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
Wireless capacity with oblivious power in general metrics
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Joint scheduling and power control for wireless ad hoc networks
IEEE Transactions on Wireless Communications
Efficiency of Wireless Networks: Approximation Algorithms for the Physical Interference Model
Foundations and Trends® in Networking
Approximation algorithms for secondary spectrum auctions
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
The topology of wireless communication
Proceedings of the forty-third annual ACM symposium on Theory of computing
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
Wireless connectivity and capacity
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Wireless capacity with oblivious power in general metrics
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Multi-hop routing and scheduling in wireless networks in the SINR model
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Wireless capacity with arbitrary gain matrix
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
On the capacity of oblivious powers
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Secondary spectrum auctions for symmetric and submodular bidders
Proceedings of the 13th ACM Conference on Electronic Commerce
Low-complexity scheduling for wireless networks
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Scheduling in wireless networks with rayleigh-fading interference
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Distributed connectivity of wireless networks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Dynamic packet scheduling in wireless networks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Towards tight bounds for local broadcasting
FOMC '12 Proceedings of the 8th International Workshop on Foundations of Mobile Computing
Deterministic distributed data aggregation under the SINR model
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Minimum latency aggregation scheduling for arbitrary tree topologies under the SINR model
ADHOC-NOW'12 Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless Networks
Wireless network stability in the SINR model
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Wireless scheduling with power control
ACM Transactions on Algorithms (TALG)
Approximation algorithms for wireless link scheduling with flexible data rates
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Distributed backbone structure for algorithms in the SINR model of wireless networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Online capacity maximization in wireless networks
Journal of Scheduling
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
Constant-approximation for optimal data aggregation with physical interference
Journal of Global Optimization
Maximum independent set of links with a monotone and sublinear power assignment
WASA'13 Proceedings of the 8th international conference on Wireless Algorithms, Systems, and Applications
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 |
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 the network capacity significantly. We study this problem in the physical interference model using SINR constraints. In the SINR capacity maximization problem, we are given n pairs of senders and receivers, located in a metric space (usually a so-called fading metric). The algorithm shall select a subset of these pairs and choose a power level for each of them with the objective of maximizing the number of simultaneous communications. This is, the selected pairs have to satisfy the SINR constraints with respect to the chosen powers. We present the first algorithm achieving a constant-factor approximation in fading metrics. The best previous results depend on further network parameters such as the ratio of the maximum and the minimum distance between a sender and its receiver. Expressed only in terms of n, they are (trivial) Ω(n) approximations. Our algorithm still achieves an O(log n) approximation if we only assume to have a general metric space rather than a fading metric. Furthermore, existing approaches work well together with the algorithm allowing it to be used in singlehop and multi-hop scheduling scenarios. Here, we also get polylog n approximations.