			Home About us Contact

Resource Allocation Algorithms (resource + allocation_algorithms)

Distribution by Scientific Domains

Engineering	100%

Selected Abstracts

Resource allocation algorithms for minimum rates scheduling in MIMO-OFDM systems,

EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, Issue 5 2010
Johannes Georg Klotz
In this paper, we consider a multiple-input-multiple-output-orthogonal frequency division multiplexing (MIMO-OFDM) downlink scenario, where each receiving mobile station has quality of service requirements, namely minimum rate requirements. For this problem we propose three heuristic resource allocation algorithms, which have a much lower complexity than the existing optimal solution (opt). We compare and evaluate these algorithms according to sum rate performance and complexity. The first strategy is based on a heuristic sum rate maximisation algorithm using the so-called eigenvalue updates. In our second algorithm, we make use of the duality of uplink and downlink, which allows us to do the allocation in the dual uplink. Finally, our third algorithm is based on the well-known zero-forcing dirty paper coding (ZF-DPC) principles, which use the Gram--Schmidt process to orthogonalise the transmissions towards the different users. Copyright © 2010 John Wiley & Sons, Ltd. [source]

QOS considerations for future military satcom networks with link layer dynamic resource allocation

INTERNATIONAL JOURNAL OF SATELLITE COMMUNICATIONS AND NETWORKING, Issue 5 2006
Aradhana Narula-Tam
Abstract To efficiently utilize limited RF resources, future military packet-switched satellite networks will dynamically allocate resources on the uplink and downlink. Designing the resource allocation algorithms to maximize link layer efficiency is insufficient. The resource allocation algorithms must work cooperatively with the network layer and transport layer to optimize network layer performance and provide quality of service (QoS) to applications and users. Several mechanisms for facilitating this required cooperation between the layers are presented. The individual roles and actions of the layers as well as their interaction are defined. QoS schedulers that continue to provide service differentiation in the presence of link variations are illustrated. Downlink scheduling architectures that provide terminal QoS guarantees are demonstrated. Finally, the interaction between TCP and the dynamic resource allocation algorithms is investigated, leading to suggested modifications of either the resource allocation algorithms, the TCP protocol, or both. Copyright © 2006 John Wiley & Sons, Ltd. [source]