TY - CONF
T1 - Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
T2 - IEEE INFOCOM 2008. The 27th Conference on Computer Communications
Y1 - 2008
A1 - Chafekar,D.
A1 - Kumart,V. S.A
A1 - Marathe,M. V
A1 - Parthasarathy,S.
A1 - Srinivasan, Aravind
KW - Algorithm design and analysis
KW - approximation algorithm
KW - Approximation algorithms
KW - approximation theory
KW - Computer networks
KW - Computer science
KW - graph theory
KW - graph-based model
KW - Interference constraints
KW - polynomial time algorithm
KW - Propagation losses
KW - Protocols
KW - radio networks
KW - radiofrequency interference
KW - signal to interference plus noise ratio
KW - Signal to noise ratio
KW - Throughput
KW - wireless interference
KW - wireless network
KW - Wireless networks
AB - 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.
JA - IEEE INFOCOM 2008. The 27th Conference on Computer Communications
PB - IEEE
SN - 978-1-4244-2025-4
M3 - 10.1109/INFOCOM.2008.172
ER -