Opportunistic scheduling in large-scale wireless networks

Authors:
Mehdi Ansari Sadrabadi;Alireza Bayesteh;Eytan Modiano
Affiliations:
Dept. of Aeronautics and Astronautics, Massachusetts Institute of Technology, Cambridge, MA;Dept. of Electrical Engineering, University of Waterloo, Waterloo, ON;Dept. of Aeronautics and Astronautics, Massachusetts Institute of Technology, Cambridge, MA
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Year:
2009

Citing 15
Cited 0

Mobility increases the capacity of ad hoc wireless networks

IEEE/ACM Transactions on Networking (TON)
Wi-Fi Handbook: Building 802.11b Wireless Networks

Wi-Fi Handbook: Building 802.11b Wireless Networks
Connectivity of wireless multihop networks in a shadow fading environment

Wireless Networks
Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey

IEEE Communications Surveys & Tutorials
The capacity of wireless networks

IEEE Transactions on Information Theory
Opportunistic beamforming using dumb antennas

IEEE Transactions on Information Theory
A network information theory for wireless communication: scaling laws and optimal operation

IEEE Transactions on Information Theory
A deterministic approach to throughput scaling in wireless networks

IEEE Transactions on Information Theory
The transport capacity of wireless networks over fading channels

IEEE Transactions on Information Theory
Communication over a wireless network with random connections

IEEE Transactions on Information Theory
Resource Allocation for Wireless Fading Relay Channels: Max-Min Solution

IEEE Transactions on Information Theory
Throughput Optimal Control of Cooperative Relay Networks

IEEE Transactions on Information Theory
Throughput Scaling Laws for Wireless Networks With Fading Channels

IEEE Transactions on Information Theory
Distributed interference compensation for wireless networks

IEEE Journal on Selected Areas in Communications
Spectrum sharing for unlicensed bands

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

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 nlogk/k. An opportunistic on-off scheduling is proposed and shown to be asymptotically throughput optimal.