DocumentCode
1801699
Title
DSmT based scheduling algorithm in opportunistic beamforming systems
Author
Long, Feichi ; Lv, Tiejun ; Gao, Hui ; Chang, Pengfei
Author_Institution
Key Lab. of Universal Wireless Commun., Beijing Univ. of Posts & Telecommun., Beijing, China
fYear
2011
fDate
8-11 May 2011
Firstpage
534
Lastpage
538
Abstract
A novel approach based on Dezert-Smarandache Theory (DSmT) is proposed for scheduling in opportunistic beamforming (OBF) systems. By jointly optimizing among system throughput, fairness and time delay of each user, the proposed algorithm can achieve larger system throughput and lower average time delay with approximately the same fairness and acceptable complexity, as compared with the proportional fair scheduler (PFS). Furthermore, unlike the case in PFS, the parameter used for tradeoff between system throughput and fairness is valid for various practical settings, since the weight that each user accounts for in the base station´s (BS) choice can be appropriately calculated in DSmT´s framework. Simulation results verify that the proposed algorithm outperforms PFS and other conventional scheduling algorithms in terms of the four proposed indexes.
Keywords
array signal processing; communication complexity; delays; scheduling; DSmT based scheduling algorithm; Dezert-Smarandache Theory; opportunistic beamforming systems; proportional fair scheduler; time delay; Array signal processing; Delay effects; Fading; Indexes; Interference; Scheduling algorithm; Throughput;
fLanguage
English
Publisher
ieee
Conference_Titel
Telecommunications (ICT), 2011 18th International Conference on
Conference_Location
Ayia Napa
Print_ISBN
978-1-4577-0025-5
Type
conf
DOI
10.1109/CTS.2011.5898983
Filename
5898983
Link To Document