%0 Conference Paper
%B IEEE INFOCOM 2008. The 27th Conference on Computer Communications
%D 2008
%T Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
%A Chafekar,D.
%A Kumart,V. S.A
%A Marathe,M. V
%A Parthasarathy,S.
%A Srinivasan, Aravind
%K Algorithm design and analysis
%K approximation algorithm
%K Approximation algorithms
%K approximation theory
%K Computer networks
%K Computer science
%K graph theory
%K graph-based model
%K Interference constraints
%K polynomial time algorithm
%K Propagation losses
%K Protocols
%K radio networks
%K radiofrequency interference
%K signal to interference plus noise ratio
%K Signal to noise ratio
%K Throughput
%K wireless interference
%K wireless network
%K Wireless networks
%X 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.
%B IEEE INFOCOM 2008. The 27th Conference on Computer Communications
%I IEEE
%P 1166 - 1174
%8 2008/04/13/18
%@ 978-1-4244-2025-4
%G eng
%R 10.1109/INFOCOM.2008.172