Cross-Layer Resource Allocation and Scheduling
| Autor: | Mikko Hiivala, Dimitris Toumpakaris, Huiling Zhu, Vinay Uday Prabhu, Ilkka Harjula |
|---|---|
| Přispěvatelé: | Gomes, Nathan J., Monteiro, Paulo P., Gameiro, Atílio |
| Jazyk: | angličtina |
| Rok vydání: | 2012 |
| Předmět: |
Beamforming
distributed antenna systems Computer science business.industry Distributed computing Orthogonal frequency-division multiple access Scheduling (production processes) channel estimation resource allocation orthogonal frequency division multiple access Fair-share scheduling beamforming Superposition principle Wireless broadband Cross layer pilot subcarriers scheduling business Coherence bandwidth Computer network |
| Zdroj: | Next Generation Wireless Communications Using Radio over Fiber Harjula, I, Hiivala, M, Prabhu, V U, Toumpakaris, D & Zhu, H 2012, Cross-Layer Resource Allocation and Scheduling . in N J Gomes, P P Monteiro & A Gameiro (eds), Next Generation Wireless Communications Using Radio over Fiber . Wiley, pp. 191-210 . https://doi.org/10.1002/9781118306017.ch9 |
| Popis: | The aim of this chapter is to justify the need for reduced-complexity, reduced-overhead and cross-layer approaches to resource allocation, scheduling and channel estimation and to present some possible approaches. A resource allocation algorithm is first examined that employs chunks of subcarriers instead of individual subcarriers, thus resulting in reduced complexity and overhead. It is shown that, by appropriately choosing the chunk size as a function of the coherence bandwidth of the channel, the algorithm can be employed in Distributed Broadband Wireless systems without significant penalty. A cross-layer user scheduling and resource allocation is then presented. The algorithm modifies previous approaches that had focused on the sum rate, in order to also provide Quality-of-Service guarantees. It is demonstrated that the algorithm can improve fairness and accommodate MAC layer requests at the cost of some additional control overhead. Finally, the problem of channel estimation is considered, which is of crucial importance for the operation of scheduling and resource allocation algorithms. A scheme that relies on careful placement of pilots and superposition of pilots to data symbols is proposed. It is shown that the scheme can reduce the overhead that is required for channel estimation. Moreover, the complexity for the hardware implementation of the scheme is considered. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|