73 research outputs found

    Review on Radio Resource Allocation Optimization in LTE/LTE-Advanced using Game Theory

    Get PDF
    Recently, there has been a growing trend toward ap-plying game theory (GT) to various engineering fields in order to solve optimization problems with different competing entities/con-tributors/players. Researches in the fourth generation (4G) wireless network field also exploited this advanced theory to overcome long term evolution (LTE) challenges such as resource allocation, which is one of the most important research topics. In fact, an efficient de-sign of resource allocation schemes is the key to higher performance. However, the standard does not specify the optimization approach to execute the radio resource management and therefore it was left open for studies. This paper presents a survey of the existing game theory based solution for 4G-LTE radio resource allocation problem and its optimization

    DR9.3 Final report of the JRRM and ASM activities

    Get PDF
    Deliverable del projecte europeu NEWCOM++This deliverable provides the final report with the summary of the activities carried out in NEWCOM++ WPR9, with a particular focus on those obtained during the last year. They address on the one hand RRM and JRRM strategies in heterogeneous scenarios and, on the other hand, spectrum management and opportunistic spectrum access to achieve an efficient spectrum usage. Main outcomes of the workpackage as well as integration indicators are also summarised.Postprint (published version

    Resource allocation and optimization techniques in wireless relay networks

    Get PDF
    Relay techniques have the potential to enhance capacity and coverage of a wireless network. Due to rapidly increasing number of smart phone subscribers and high demand for data intensive multimedia applications, the useful radio spectrum is becoming a scarce resource. For this reason, two way relay network and cognitive radio technologies are required for better utilization of radio spectrum. Compared to the conventional one way relay network, both the uplink and the downlink can be served simultaneously using a two way relay network. Hence the effective bandwidth efficiency is considered to be one time slot per transmission. Cognitive networks are wireless networks that consist of different types of users, a primary user (PU, the primary license holder of a spectrum band) and secondary users (SU, cognitive radios that opportunistically access the PU spectrum). The secondary users can access the spectrum of the licensed user provided they do not harmfully affect to the primary user. In this thesis, various resource allocation and optimization techniques have been investigated for wireless relay and cognitive radio networks

    Adaptive radio resource management schemes for the downlink of the OFDMA-based wireless communication systems

    Get PDF
    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)

    Opportunities and Challenges in OFDMA-Based Cellular Relay Networks: A Radio Resource Management Perspective

    Full text link
    The opportunities and flexibility in relay networks and orthogonal frequency-division multiple access (OFDMA) make the combination a suitable candidate network and air-interface technology for providing reliable and ubiquitous high-data-r

    Resource management in QoS-aware wireless cellular networks

    Get PDF
    2011 Summer.Includes bibliographical references.Emerging broadband wireless networks that support high speed packet data with heterogeneous quality of service (QoS) requirements demand more flexible and efficient use of the scarce spectral resource. Opportunistic scheduling exploits the time-varying, location-dependent channel conditions to achieve multiuser diversity. In this work, we study two types of resource allocation problems in QoS-aware wireless cellular networks. First, we develop a rigorous framework to study opportunistic scheduling in multiuser OFDM systems. We derive optimal opportunistic scheduling policies under three common QoS/fairness constraints for multiuser OFDM systems--temporal fairness, utilitarian fairness, and minimum-performance guarantees. To implement these optimal policies efficiently, we provide a modified Hungarian algorithm and a simple suboptimal algorithm. We then propose a generalized opportunistic scheduling framework that incorporates multiple mixed QoS/fairness constraints, including providing both lower and upper bound constraints. Next, taking input queues and channel memory into consideration, we reformulate the transmission scheduling problem as a new class of Markov decision processes (MDPs) with fairness constraints. We investigate the throughput maximization and the delay minimization problems in this context. We study two categories of fairness constraints, namely temporal fairness and utilitarian fairness. We consider two criteria: infinite horizon expected total discounted reward and expected average reward. We derive and prove explicit dynamic programming equations for the above constrained MDPs, and characterize optimal scheduling policies based on those equations. An attractive feature of our proposed schemes is that they can easily be extended to fit different objective functions and other fairness measures. Although we only focus on uplink scheduling, the scheme is equally applicable to the downlink case. Furthermore, we develop an efficient approximation method--temporal fair rollout--to reduce the computational cost

    QoS-aware Adaptive Resource Management in OFDMA Networks

    Get PDF
    PhDOne important feature of the future communication network is that users in the network are required to experience a guaranteed high quality of service (QoS) due to the popularity of multimedia applications. This thesis studies QoS-aware radio resource management schemes in different OFDMA network scenarios. Motivated by the fact that in current 4G networks, the QoS provisioning is severely constrained by the availability of radio resources, especially the scarce spectrum as well as the unbalanced traffic distribution from cell to cell, a joint antenna and subcarrier management scheme is proposed to maximise user satisfaction with load balancing. Antenna pattern update mechanism is further investigated with moving users. Combining network densi fication with cloud computing technologies, cloud radio access network (C-RAN) has been proposed as the emerging 5G network architecture consisting of baseband unit (BBU) pool, remote radio heads (RRHs) and fronthaul links. With cloud based information sharing through the BBU pool, a joint resource block and power allocation scheme is proposed to maximise the number of satisfi ed users whose required QoS is achieved. In this scenario, users are served by high power nodes only. With spatial reuse of system bandwidth by network densi fication, users' QoS provisioning can be ensured but it introduces energy and operating effciency issue. Therefore two network energy optimisation schemes with QoS guarantee are further studied for C-RANs: an energy-effective network deployment scheme is designed for C-RAN based small cells; a joint RRH selection and user association scheme is investigated in heterogeneous C-RAN. Thorough theoretical analysis is conducted in the development of all proposed algorithms, and the effectiveness of all proposed algorithms is validated via comprehensive simulations.China Scholarship Counci

    An Optimization Theoretical Framework for Resource Allocation over Wireless Networks

    Get PDF
    With the advancement of wireless technologies, wireless networking has become ubiquitous owing to the great demand of pervasive mobile applications. Some fundamental challenges exist for the next generation wireless network design such as time varying nature of wireless channels, co-channel interferences, provisioning of heterogeneous type of services, etc. So how to overcome these difficulties and improve the system performance have become an important research topic. Dynamic resource allocation is a general strategy to control the interferences and enhance the performance of wireless networks. The basic idea behind dynamic resource allocation is to utilize the channel more efficiently by sharing the spectrum and reducing interference through optimizing parameters such as the transmitting power, symbol transmission rate, modulation scheme, coding scheme, bandwidth, etc. Moreover, the network performance can be further improved by introducing diversity, such as multiuser, time, frequency, and space diversity. In addition, cross layer approach for resource allocation can provide advantages such as low overhead, more efficiency, and direct end-to-end QoS provision. The designers for next generation wireless networks face the common problem of how to optimize the system objective under the user Quality of Service (QoS) constraint. There is a need of unified but general optimization framework for resource allocation to allow taking into account a diverse set of objective functions with various QoS requirements, while considering all kinds of diversity and cross layer approach. We propose an optimization theoretical framework for resource allocation and apply these ideas to different network situations such as: 1.Centralized resource allocation with fairness constraint 2.Distributed resource allocation using game theory 3.OFDMA resource allocation 4.Cross layer approach On the whole, we develop a universal view of the whole wireless networks from multiple dimensions: time, frequency, space, user, and layers. We develop some schemes to fully utilize the resources. The success of the proposed research will significantly improve the way how to design and analyze resource allocation over wireless networks. In addition, the cross-layer optimization nature of the problem provides an innovative insight into vertical integration of wireless networks
    corecore