DocumentCode :
2987225
Title :
Opportunistic scheduling in large-scale wireless networks
Author :
Sadrabadi, Mehdi Ansari ; Bayesteh, Alireza ; Modiano, Eytan
Author_Institution :
Dept. of Aeronaut. & Astronaut., Massachusetts Inst. of Technol., Cambridge, MA, USA
fYear :
2009
fDate :
June 28 2009-July 3 2009
Firstpage :
1624
Lastpage :
1628
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.
Keywords :
Rayleigh channels; radio networks; scheduling; transceivers; Rayleigh fading channel; distributed one-hop wireless network; large-scale wireless networks; maximum achievable sum-rate; opportunistic scheduling; receivers; transmitter/receiver node; transmitters; Interference; Large-scale systems; Local area networks; Rayleigh channels; Resource management; Routing; Space technology; Throughput; Transmitters; Wireless networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2009. ISIT 2009. IEEE International Symposium on
Conference_Location :
Seoul
Print_ISBN :
978-1-4244-4312-3
Electronic_ISBN :
978-1-4244-4313-0
Type :
conf
DOI :
10.1109/ISIT.2009.5205796
Filename :
5205796
Link To Document :
بازگشت