Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
Deepti Chafekar,V.S.A. Kumart,Madhav V. Marathe,Srinivasan Parthasarathy,Aravind Srinivasan +4 more
- pp 1166-1174
TLDR
This paper develops polynomial time algorithms to provably approximate the total throughput in this setting of the capacity estimation problem using the more general Signal to Interference Plus Noise Ratio model for interference, on arbitrary wireless networks.Abstract:
A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which data can be sent on these connections. Most of the research in this direction has focused on either random distributions of points, or has assumed simple graph-based models for wireless interference. In this paper, we study capacity estimation problem using the more general Signal to Interference Plus Noise Ratio (SINR) model for interference, on arbitrary wireless networks. The problem becomes much harder in this setting, because of the non-locality of the SINR model. Recent work by Moscibroda et al. (2006) has shown that the throughput in this model can differ from graph based models significantly. We develop polynomial time algorithms to provably approximate the total throughput in this setting.read more
Citations
More filters
Proceedings ArticleDOI
Capacity of Arbitrary Wireless Networks
TL;DR: This work proposes the first scheduling algorithm with approximation guarantee independent of the topology of the network, and proves that the analysis of the algorithm is extendable to higher-dimensional Euclidean spaces, and to more realistic bounded-distortion spaces, induced by non-isotropic signal distortions.
Proceedings ArticleDOI
Maximizing Capacity in Arbitrary Wireless Networks in the SINR Model: Complexity and Game Theory
Matthew Andrews,Michael Dinitz +1 more
TL;DR: It is shown that maximizing the number of supported connections is NP-hard, even when there is no background noise, in contrast to the problem of determining whether or not a given set of connections is feasible since that problem can be solved via linear programming.
Book ChapterDOI
Wireless Communication Is in APX
TL;DR: The main result proves that wireless scheduling is in APX, and a robustness result is presented, showing that constant parameter and model changes will modify the result only by a constant.
Proceedings ArticleDOI
Oblivious interference scheduling
TL;DR: It is proved that oblivious power assignments cannot yield approximation ratios better than Ω(n) for the directed version of the interference scheduling problem, which is the worst possible performance guarantee as there is a straightforward algorithm that achieves an O(n)-approximation.
Proceedings ArticleDOI
Wireless link scheduling under physical interference model
TL;DR: A unified algorithmic framework is built and approximation algorithms for link scheduling with or without power control are developed for maximizing throughput capacity or minimizing the communication latency in multihop wireless networks under the physical interference model.
References
More filters
Proceedings ArticleDOI
Characterizing achievable rates in multi-hop wireless networks: the joint routing and scheduling problem
TL;DR: The approach that is used is quite flexible and is a promising method to handle more sophisticated interference conditions, multiple channels, multiple antennas, and routing with diversity requirements.
Proceedings ArticleDOI
The Complexity of Connectivity in Wireless Networks
TL;DR: This paper presents a novel scheduling algorithm that successfully schedules a strongly connected set of links in time O(logn) even in arbitrary worst-case networks, and proves that the scheduling complexity of connectivity grows only polylogarithmically in the number of nodes.
Proceedings ArticleDOI
Capacity, delay and mobility in wireless ad-hoc networks
Nikhil Bansal,Zhen Liu +1 more
TL;DR: A theoretical framework is considered and a routing algorithm is proposed which exploits the patterns in the mobility of nodes to provide guarantees on the delay and the throughput achieved by the algorithm is only a poly-logarithmic factor off from the optimal.
Proceedings ArticleDOI
Topology control meets SINR: the scheduling complexity of arbitrary topologies
TL;DR: This paper defines and study a generalized version of the SINR model and obtains theoretical upper bounds on the scheduling complexity of arbitrary topologies in wireless networks, and proves that even in worst-case networks, if the signals are transmitted with correctly assigned transmission power levels, the number of time slots required to successfully schedule all links of an arbitrary topology is proportional to the squared logarithm.
Proceedings ArticleDOI
Throughput capacity of random ad hoc networks with infrastructure support
Ulas C. Kozat,Leandros Tassiulas +1 more
TL;DR: This paper shows that the per source node capacity of T(W/log(N)) can be achieved in a random network scenario with the following assumptions: (i) the number of ad hoc nodes per access point is bounded above, (ii) each wireless node, including the access points, is able to transmit at W bits/sec using a fixed transmission range, and