%0 Conference Paper
%B IEEE INFOCOM 2008. The 27th Conference on Computer Communications
%D 2008
%T Capacity of Asynchronous Random-Access Scheduling in Wireless Networks
%A Chafekar,D.
%A Levin,D.
%A Kumar,V. S.A
%A Marathe,M. V
%A Parthasarathy,S.
%A Srinivasan, Aravind
%K asynchronous random-access scheduling
%K channel access probability
%K Computer networks
%K Computer science
%K Educational institutions
%K Interference
%K Optimal scheduling
%K Peer to peer computing
%K probability
%K Processor scheduling
%K radio link
%K radio links
%K radio networks
%K Routing
%K scheduling
%K Throughput
%K throughput capacity
%K wireless channels
%K Wireless networks
%X 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.
%B IEEE INFOCOM 2008. The 27th Conference on Computer Communications
%I IEEE
%P 1148 - 1156
%8 2008/04/13/18
%@ 978-1-4244-2025-4
%G eng
%R 10.1109/INFOCOM.2008.170