Capacity of Asynchronous Random-Access Scheduling in Wireless Networks
Chafekar, D.
Levin, D.
Kumar, 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): 1148-1156
Location: Phoenix, AZ,
ISSN: 0743-166X
ISBN: 978-1-4244-2025-4
INSPEC Accession Number: 9962350
Digital Object Identifier: 10.1109/INFOCOM.2008.170
Current Version Published: 2008-05-02
Abstract
We study the throughput capacity of wireless networks which employ (asynchronous) random-access scheduling as opposed to deterministic scheduling. The central question we answer is: how should we set the channel-access probability for each link in the network so that the network operates close to its optimal throughput capacity? We design simple and distributed channel-access strategies for random-access networks which are provably competitive with respect to the optimal scheduling strategy, which is deterministic, centralized, and computationally infeasible. We show that the competitiveness of our strategies are nearly the best achievable via random-access scheduling, thus establishing fundamental limits on the performance of random- access. A notable outcome of our work is that random access compares well with deterministic scheduling when link transmission durations differ by small factors, and much worse otherwise. The distinguishing aspects of our work include modeling and rigorous analysis of asynchronous communication, asymmetry in link transmission durations, and hidden terminals under arbitrary link-conflict based wireless interference models.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
