Comparison between graph-based and interference-based STDMA scheduling
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Linear degree extractors and the inapproximability of max clique and chromatic number
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Topology control meets SINR: the scheduling complexity of arbitrary topologies
Proceedings of the 7th 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
A measurement study of interference modeling and scheduling in low-power wireless networks
Proceedings of the 6th ACM conference on Embedded network sensor systems
Improved Algorithms for Latency Minimization in Wireless Networks
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Wireless Communication Is in APX
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Oblivious interference scheduling
Proceedings of the 28th ACM symposium on Principles of distributed computing
Distributed contention resolution in wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The capacity of wireless networks
IEEE Transactions on Information Theory
Efficiency of Wireless Networks: Approximation Algorithms for the Physical Interference Model
Foundations and Trends® in Networking
The topology of wireless communication
Proceedings of the forty-third annual ACM symposium on Theory of computing
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
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
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
Scheduling in wireless networks with rayleigh-fading interference
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Dynamic packet scheduling in wireless networks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
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
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
| Hi-index | 0.00 |
The capacity of a wireless network is the maximum possible amount of simultaneous communication, taking interference into account. Formally, we treat the following problem. Given is a set of links, each a sender-receiver pair located in a metric space, and an assignment of power to the senders. We seek a maximum subset of links that are feasible in the SINR model: namely, the signal received on each link should be larger than the sum of the interferences from the other links. We give a constant-factor approximation that holds for any length-monotone, sub-linear power assignment and any distance metric. We use this to give essentially tight characterizations of capacity maximization under power control using oblivious power assignments. Specifically, we show that the mean power assignment is optimal for capacity maximization of bi-directional links, and give a tight θ(log n)-approximation of scheduling bi-directional links with power control using oblivious power. For uni-directional links we give a nearly optimal O(log n + log log Δ)-approximation to the power control problem using mean power, where Δ is the ratio of longest and shortest links. Combined, these results clarify significantly the centralized complexity of wireless communication problems.