Please use this identifier to cite or link to this item:
http://hdl.handle.net/10773/13582
Title: | Low complexity scheduling algorithm for the downlink of distributed antenna systems |
Author: | Gameiro, Atílio Castañeda, Eduardo Samano, Ramiro |
Issue Date: | 2013 |
Publisher: | IEEE |
Abstract: | In this paper we present a low-complexity user selection algorithm for the downlink of a distributed antenna system (DAS) that achieves an optimum solution for a weighted matching problem. The user selection process is modeled as a linear sum assignment problem (LSAP). The proposed solution consists of two phases. In the first phase, a set of potential users to be scheduled is found by combining two complementary approaches: greedy and minimum-throughput-loss selection. In the second phase, the set of scheduled users is refined by selecting the users that maximize sum throughput. We provide numerical results to confirm the optimality of our user selection algorithm and to compare its performance with existing solutions. |
Peer review: | yes |
URI: | http://hdl.handle.net/10773/13582 |
DOI: | 10.1109/VTCSpring.2013.6692620 |
ISSN: | 1550-2252 |
Appears in Collections: | DETI - Comunicações |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Low complexity scheduling algorithm for the downlink of distributed antenna systems.pdf | 166.33 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.