358 research outputs found
Adaptive radio resource management schemes for the downlink of the OFDMA-based wireless communication systems
Includes bibliographical references.Due to its superior characteristics that make it suitable for high speed mobile wireless systems OFDMA has been adopted by next generation broadband wireless standards including Worldwide Interoperability for Microwave Access (WiMAX) and Long Term Evolution – Advanced (LTE-A). Intelligent and adaptive Radio Resource Management (RRM) schemes are a fundamental tool in the design of wireless systems to be able to fully and efficiently utilize the available scarce resources and be able to meet the user data rates and QoS requirements. Previous works were only concerned with maximizing system efficiency and thus used opportunistic algorithms that allocate resources to users with the best opportunities to optimize system capacity. Thus, only those users with good channel conditions were considered for resource allocation and users in bad channel conditions were left out to starve of resources. The main objective of our study is to design adaptive radio resource allocation (RRA) algorithms that distribute the scarce resources more fairly among network users while efficiently using the resources to maximize system throughput. Four scheduling algorithms have been formulated and analysed based on fairness, throughputs and delay. This was done for users demanding different services and QoS requirements. Two of the scheduling algorithms, Maximum Sum Rate (MSR) and Round Robin (RR) are used respectively, as references to analyze throughput and fairness among network users. The other two algorithms are Proportional Fair Scheduling (PFS) and Margin Adaptive Scheduling Scheme (MASS)
Resource Allocation for Power Minimization in the Downlink of THP-based Spatial Multiplexing MIMO-OFDMA Systems
In this work, we deal with resource allocation in the downlink of spatial
multiplexing MIMO-OFDMA systems. In particular, we concentrate on the problem
of jointly optimizing the transmit and receive processing matrices, the channel
assignment and the power allocation with the objective of minimizing the total
power consumption while satisfying different quality-of-service requirements. A
layered architecture is used in which users are first partitioned in different
groups on the basis of their channel quality and then channel assignment and
transceiver design are sequentially addressed starting from the group of users
with most adverse channel conditions. The multi-user interference among users
belonging to different groups is removed at the base station using a
Tomlinson-Harashima pre-coder operating at user level. Numerical results are
used to highlight the effectiveness of the proposed solution and to make
comparisons with existing alternatives.Comment: 12 pages, 6 figures, IEEE Trans. Veh. Techno
Recommended from our members
Cross-layer design for OFDMA wireless networks with finite queue length based on game theory
This thesis was submitted for the award of Doctor of Philosophy and was awarded by Brunel University London.In next generation wireless networks such as 4G- LTE and WiMax, the demand for high data rates, the scarcity of wireless resources and the time varying channel conditions has led to the adoption of more sophisticated and robust techniques in PHY such as orthogonal frequency division multiplexing (OFDM) and the corresponding access technique known as orthogonal frequency division multiplexing access (OFDMA). Cross-layer schedulers have been developed in order to describe the procedure of resource allocation in OFDMA wireless networks. The resource allocation in OFDMA wireless networks has received great attention in research, by proposing many different ways for frequency diversity exploitation and system’s optimization. Many cross-layer proposals for dynamic resource allocation have been investigated in literature approaching the optimization problem from different viewpoints i.e. maximizing total data rate, minimizing total transmit power, satisfying minimum users’ requirements or providing fairness amongst users. The design of a cross-layer scheduler for OFDMA wireless networks is the topic of this research. The scheduler utilizes game theory in order to make decisions for subcarrier and power allocation to the users with the main concern being to maintain fairness as well as to maximize overall system’s performance. A very well known theorem in cooperative game theory, the Nash Bargaining Solution (NBS), is employed and solved in a close form way, resulting in a Pareto optimal solution. Two different cases are proposed. The first one is the symmetric NBS (S-NBS) where all users have the same weight and therefore all users have the same opportunity for resources and the second one, is the asymmetric NBS (A-NBS), where users have different weights, hence different priorities where the scheduler favours users with higher priorities at expense of lower priority users. As MAC layer is vital for cross-layer, the scheduler is combined with a queuing model based on Markov chain in order to describe more realistically the incoming procedure from the higher layers
Opportunistic Random Access Scheme Design for OFDMA-based Indoor PLC Networks
International audienceMulti-user systems can benefit from multi-user diversity by assigning channels to users with bestchannel conditions at different time instants. In this paper, we present an opportunistic random accessscheme for OFDMA-based indoor PLC systems, based on time- and frequency-varying channel conditions,to exploit multi-user diversity. The proposed scheme dynamically adjusts the backoff time ofeach user according to its own channel state variations in both time and frequency domains duringthe contention procedure, and thus ’better’ users have higher priority to contend over their favorablesubchannels. Moreover, subchannels are assigned to users with best channel conditions in order tofurther enhance the system throughput. In addition, an analytical throughput model for such a multiuserand multi-channel system is derived to obtain the optimal parameter settings of the proposedaccess scheme. Simulation results show that the proposed scheme provides significant improvement inthe system throughput even in the case where the number of users highly exceeds that of subchannels
Autonomous Algorithms for Centralized and Distributed Interference Coordination: A Virtual Layer Based Approach
Interference mitigation techniques are essential for improving the
performance of interference limited wireless networks. In this paper, we
introduce novel interference mitigation schemes for wireless cellular networks
with space division multiple access (SDMA). The schemes are based on a virtual
layer that captures and simplifies the complicated interference situation in
the network and that is used for power control. We show how optimization in
this virtual layer generates gradually adapting power control settings that
lead to autonomous interference minimization. Thereby, the granularity of
control ranges from controlling frequency sub-band power via controlling the
power on a per-beam basis, to a granularity of only enforcing average power
constraints per beam. In conjunction with suitable short-term scheduling, our
algorithms gradually steer the network towards a higher utility. We use
extensive system-level simulations to compare three distributed algorithms and
evaluate their applicability for different user mobility assumptions. In
particular, it turns out that larger gains can be achieved by imposing average
power constraints and allowing opportunistic scheduling instantaneously, rather
than controlling the power in a strict way. Furthermore, we introduce a
centralized algorithm, which directly solves the underlying optimization and
shows fast convergence, as a performance benchmark for the distributed
solutions. Moreover, we investigate the deviation from global optimality by
comparing to a branch-and-bound-based solution.Comment: revised versio
- …