Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
Chafekar, D.
Kumart, V.S.A.
Marathe, M.V.
Parthasarathy, S.
Srinivasan, A.
Dept. of Comput. Sci., Virginia Tech, Blacksburg, VA;
This paper appears in: INFOCOM 2008. The 27th Conference on Computer Communications. IEEE
Publication Date: 13-18 April 2008
On page(s): 1166-1174
Location: Phoenix, AZ,
ISSN: 0743-166X
ISBN: 978-1-4244-2025-4
INSPEC Accession Number: 9962352
Digital Object Identifier: 10.1109/INFOCOM.2008.172
Current Version Published: 2008-05-02
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.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
