Opportunistic scheduling in large-scale wireless networks
Name
Sadrabadi-2009-Opportunistic scheduling in large-scale wireless networks.pdf
Size
441.95 KB
Format
Adobe PDF
Checksum (MD5)
9c62886ba1ca8e207ecab7d24ac2e1cf
Author(s)
Modiano, Eytan H.
Ansari Sadrabadi, Mehdi
Bayesteh, Alireza
Date Issued
July 2009
Journal
IEEE International Symposium on Information Theory
Publisher
Institute of Electrical and Electronics Engineers
Citation
Sadrabadi, M.A., A. Bayesteh, and E. Modiano. “Opportunistic scheduling in large-scale wireless networks.” Information Theory, 2009. ISIT 2009. IEEE International Symposium on. 2009. 1624-1628. © 2009, IEEE
Version
Final published version
Abstract
In this paper, we consider a distributed one-hop wireless network with n pairs of transmitters and receivers. It is assumed that each transmitter/receiver node is only connected to k receiver/transmitter nodes which are defined as neighboring nodes. The channel between the neighboring nodes is assumed to be Rayleigh fading. The objective is to find the maximum achievable sum-rate of the network in the asymptotic case of n, k à ¿ à ¿. It is shown that the asymptotic throughput of the system scales as n log k/k. An opportunistic on-off scheduling is proposed and shown to be asymptotically throughput optimal.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ISIT.2009.5205796
