Please use this identifier to cite or link to this item:
|Title:||Applying generalized Cμ-rule scheduling for resource allocation in OFDMA systems||Authors:||Asyhari, A.T.
|Issue Date:||2006||Citation:||Asyhari, A.T.,Win, H.H.,Tuan, H.A.,Tao, M.,Liang, Y.-C. (2006). Applying generalized Cμ-rule scheduling for resource allocation in OFDMA systems. 2006 IEEE Singapore International Conference on Communication Systems, ICCS 2006 : -. ScholarBank@NUS Repository. https://doi.org/10.1109/ICCS.2006.301410||Abstract:||We study the performance of generalized cμ-rule implementation in OFDMA systems, namely bit-based subcarrier allocation and packet-based subchannel allocation. While cμ-rule is asymptotically optimum in continuous-time server allocation, it needs to be adjusted when applied to discrete-time server allocation in OFDMA systems. Bit-based allocation considers the allocation through bit-based connectivity. Resource wastage is prevented by greedy reassignment in low traffic regime. Packet-based allocation adopts cμ-rule and allocates the servers through multiple-packet rates. The allocation is ordered from the server with lowest connectivity to the server with highest connectivity. Simulation results show that bit-based allocation outperforms packet-based allocation in queue length minimization for small number of users. With increasing number of users, the performance difference becomes smaller and at the certain limit, the packet-based allocation performs better. Furthermore, the packet-based allocation might be better in practical realization due to the lower complexity. © 2006 IEEE.||Source Title:||2006 IEEE Singapore International Conference on Communication Systems, ICCS 2006||URI:||http://scholarbank.nus.edu.sg/handle/10635/69440||ISBN:||1424404118||DOI:||10.1109/ICCS.2006.301410|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jun 2, 2020
checked on May 31, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.