Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
Citations
296 citations
Cites background from "Approximation Algorithms for Comput..."
...In [4], an algorithm with approximation guarantee of O(log Δ) was proposed, where Δ is the ratio between the maximum and the minimum distances between nodes....
[...]
...2 This problem was shown to be NP-complete in [9], and the few algorithms with provable approximation guarantee proposed so far yield arbitrarily bad performance, depending on the topology of the network [2], [4], [9] (see Related Work Section)....
[...]
220 citations
Cites background from "Approximation Algorithms for Comput..."
...Previous papers that consider the complexity of capacity maximization in the SINR model include [3], [5], [9], [15],...
[...]
168 citations
Additional excerpts
...[6])....
[...]
123 citations
Cites background from "Approximation Algorithms for Comput..."
...This implies that the loss in this class is in [4, 4)....
[...]
...The objective in [3] is to minimize the end-to-end latency, while [4] aims at maximizing throughput....
[...]
...However, these requests might violate the interference constraints with gain β because of the following reasons: a) We assumed that the loss in class Ci is exactly 4 −αi rather than from the interval [4, 4)....
[...]
...Some recent theoretical studies [12, 13, 3, 4] use a more realistic model, the so-called physical model, which is wellaccepted in the engineering community....
[...]
...[3, 4] study a multi-hop version of the interference scheduling problem on two-dimensional Euclidean instances, that is, they additionally consider the aspect of routing on top of the tasks power assignment and coloring....
[...]
103 citations
References
9,008 citations
1,828 citations
"Approximation Algorithms for Comput..." refers background in this paper
...The vectors f̄ and x̄ are called the flow vector and link utilization vector respectively....
[...]
...The algorithmic aspects of network capacity have been studied in a number of papers, such as [2], [9]–[11], [13], [20]....
[...]
1,154 citations
825 citations
"Approximation Algorithms for Comput..." refers background in this paper
...The algorithmic aspects of network capacity have been studied in a number of papers, such as [2], [9]–[11], [13], [20]....
[...]
679 citations
"Approximation Algorithms for Comput..." refers background in this paper
...The algorithmic aspects of network capacity have been studied in a number of papers, such as [2], [9]–[11], [13], [20]....
[...]