3 research outputs found

    Estudio y optimizaci贸n de los procedimientos de adaptaci贸n al enlace en HSDPA

    Full text link
    [ES] La tecnolog铆a HSDPA (High Speed Downlink Packet Access) es una evoluci贸n de UMTS creada con el objetivo de aumentar la capacidad de transmisi贸n en el enlace descendente. Su mejora se basa en la utilizaci贸n de un canal compartido de comunicaci贸n gestionado de forma eficiente desde la estaci贸n base (por medio de un packet scheduler), la utilizaci贸n de mecanismos de retransmisi贸n y combinaci贸n de informaci贸n avanzados (hybrid ARQ) y la posibilidad de emplear modulaciones de alto orden (16QAM y 64QAM). Las dos 煤ltimas caracter铆sticas nombradas ser铆an in煤tiles sin unos buenos procedimientos de adaptaci贸n al enlace (link adaptation) que ajustaran los par谩metros de transmisi贸n a la calidad del enlace radio. La presente tesina aborda el estudio y optimizaci贸n de los mecanismos de link adaptation en HSDPA. Para tratar el problema se siguen dos estrategias. Por un lado, se estudia un link adaptation gen茅rico con el fin de obtener conclusiones f谩cilmente trasladables a sistemas particulares como HSDPA. Por otro lado, se aportan soluciones a problemas espec铆ficos de HSDPA como los fallos del link adaptation con baja carga.[EN] HSDPA (High Speed Downlink Packet Access) technology is an evolved version of UMTS focused on the improvement of the downlink capacity. HSDPA enhancement is based on the efficient management of a shared channel done by the Node-B (employing a packet scheduler), the using of advanced retransmission and combination mechanisms (hybrid ARQ) and the availability of high order modulations (16QAM and 64QAM). The later characteristics would be worthless without good link adaptation procedures that adjust transmission parameters according to the radiolink quality. This thesis deals with the study and optimization of link adaptation mechanisms in HSDPA. Two strategies are followed herein. First, a generic link adaptation is studied with the aim of reaching some general conclusions and applying them to real systems as HSDPA. Besides, a more detailed study is done for HSDPA finding solutions for some specific problems as link adaptation failures with low loadMart铆n-Sacrist谩n Gand铆a, D. (2007). Estudio y optimizaci贸n de los procedimientos de adaptaci贸n al enlace en HSDPA. http://hdl.handle.net/10251/12494Archivo delegad

    Sustainable scheduling policies for radio access networks based on LTE technology

    Get PDF
    A thesis submitted to the University of Bedfordshire in partial fulfilment of the requirements for the degree of Doctor of PhilosophyIn the LTE access networks, the Radio Resource Management (RRM) is one of the most important modules which is responsible for handling the overall management of radio resources. The packet scheduler is a particular sub-module which assigns the existing radio resources to each user in order to deliver the requested services in the most efficient manner. Data packets are scheduled dynamically at every Transmission Time Interval (TTI), a time window used to take the user鈥檚 requests and to respond them accordingly. The scheduling procedure is conducted by using scheduling rules which select different users to be scheduled at each TTI based on some priority metrics. Various scheduling rules exist and they behave differently by balancing the scheduler performance in the direction imposed by one of the following objectives: increasing the system throughput, maintaining the user fairness, respecting the Guaranteed Bit Rate (GBR), Head of Line (HoL) packet delay, packet loss rate and queue stability requirements. Most of the static scheduling rules follow the sequential multi-objective optimization in the sense that when the first targeted objective is satisfied, then other objectives can be prioritized. When the targeted scheduling objective(s) can be satisfied at each TTI, the LTE scheduler is considered to be optimal or feasible. So, the scheduling performance depends on the exploited rule being focused on particular objectives. This study aims to increase the percentage of feasible TTIs for a given downlink transmission by applying a mixture of scheduling rules instead of using one discipline adopted across the entire scheduling session. Two types of optimization problems are proposed in this sense: Dynamic Scheduling Rule based Sequential Multi-Objective Optimization (DSR-SMOO) when the applied scheduling rules address the same objective and Dynamic Scheduling Rule based Concurrent Multi-Objective Optimization (DSR-CMOO) if the pool of rules addresses different scheduling objectives. The best way of solving such complex optimization problems is to adapt and to refine scheduling policies which are able to call different rules at each TTI based on the best matching scheduler conditions (states). The idea is to develop a set of non-linear functions which maps the scheduler state at each TTI in optimal distribution probabilities of selecting the best scheduling rule. Due to the multi-dimensional and continuous characteristics of the scheduler state space, the scheduling functions should be approximated. Moreover, the function approximations are learned through the interaction with the RRM environment. The Reinforcement Learning (RL) algorithms are used in this sense in order to evaluate and to refine the scheduling policies for the considered DSR-SMOO/CMOO optimization problems. The neural networks are used to train the non-linear mapping functions based on the interaction among the intelligent controller, the LTE packet scheduler and the RRM environment. In order to enhance the convergence in the feasible state and to reduce the scheduler state space dimension, meta-heuristic approaches are used for the channel statement aggregation. Simulation results show that the proposed aggregation scheme is able to outperform other heuristic methods. When the aggregation scheme of the channel statements is exploited, the proposed DSR-SMOO/CMOO problems focusing on different objectives which are solved by using various RL approaches are able to: increase the mean percentage of feasible TTIs, minimize the number of TTIs when the RL approaches punish the actions taken TTI-by-TTI, and minimize the variation of the performance indicators when different simulations are launched in parallel. This way, the obtained scheduling policies being focused on the multi-objective criteria are sustainable. Keywords: LTE, packet scheduling, scheduling rules, multi-objective optimization, reinforcement learning, channel, aggregation, scheduling policies, sustainable
    corecore