556 research outputs found

    Decentralized Fair Scheduling in Two-Hop Relay-Assisted Cognitive OFDMA Systems

    Full text link
    In this paper, we consider a two-hop relay-assisted cognitive downlink OFDMA system (named as secondary system) dynamically accessing a spectrum licensed to a primary network, thereby improving the efficiency of spectrum usage. A cluster-based relay-assisted architecture is proposed for the secondary system, where relay stations are employed for minimizing the interference to the users in the primary network and achieving fairness for cell-edge users. Based on this architecture, an asymptotically optimal solution is derived for jointly controlling data rates, transmission power, and subchannel allocation to optimize the average weighted sum goodput where the proportional fair scheduling (PFS) is included as a special case. This solution supports decentralized implementation, requires small communication overhead, and is robust against imperfect channel state information at the transmitter (CSIT) and sensing measurement. The proposed solution achieves significant throughput gains and better user-fairness compared with the existing designs. Finally, we derived a simple and asymptotically optimal scheduling solution as well as the associated closed-form performance under the proportional fair scheduling for a large number of users. The system throughput is shown to be O(N(1qp)(1qpN)lnlnKc)\mathcal{O}\left(N(1-q_p)(1-q_p^N)\ln\ln K_c\right), where KcK_c is the number of users in one cluster, NN is the number of subchannels and qpq_p is the active probability of primary users.Comment: 29 pages, 9 figures, IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSIN

    Dynamic Time-domain Duplexing for Self-backhauled Millimeter Wave Cellular Networks

    Full text link
    Millimeter wave (mmW) bands between 30 and 300 GHz have attracted considerable attention for next-generation cellular networks due to vast quantities of available spectrum and the possibility of very high-dimensional antenna ar-rays. However, a key issue in these systems is range: mmW signals are extremely vulnerable to shadowing and poor high-frequency propagation. Multi-hop relaying is therefore a natural technology for such systems to improve cell range and cell edge rates without the addition of wired access points. This paper studies the problem of scheduling for a simple infrastructure cellular relay system where communication between wired base stations and User Equipment follow a hierarchical tree structure through fixed relay nodes. Such a systems builds naturally on existing cellular mmW backhaul by adding mmW in the access links. A key feature of the proposed system is that TDD duplexing selections can be made on a link-by-link basis due to directional isolation from other links. We devise an efficient, greedy algorithm for centralized scheduling that maximizes network utility by jointly optimizing the duplexing schedule and resources allocation for dense, relay-enhanced OFDMA/TDD mmW networks. The proposed algorithm can dynamically adapt to loading, channel conditions and traffic demands. Significant throughput gains and improved resource utilization offered by our algorithm over the static, globally-synchronized TDD patterns are demonstrated through simulations based on empirically-derived channel models at 28 GHz.Comment: IEEE Workshop on Next Generation Backhaul/Fronthaul Networks - BackNets 201

    Multicast Scheduling and Resource Allocation Algorithms for OFDMA-Based Systems: A Survey

    Get PDF
    Multicasting is emerging as an enabling technology for multimedia transmissions over wireless networks to support several groups of users with flexible quality of service (QoS)requirements. Although multicast has huge potential to push the limits of next generation communication systems; it is however one of the most challenging issues currently being addressed. In this survey, we explain multicast group formation and various forms of group rate determination approaches. We also provide a systematic review of recent channel-aware multicast scheduling and resource allocation (MSRA) techniques proposed for downlink multicast services in OFDMA based systems. We study these enabling algorithms, evaluate their core characteristics, limitations and classify them using multidimensional matrix. We cohesively review the algorithms in terms of their throughput maximization, fairness considerations, performance complexities, multi-antenna support, optimality and simplifying assumptions. We discuss existing standards employing multicasting and further highlight some potential research opportunities in multicast systems

    Advanced Radio Resource Management for Multi Antenna Packet Radio Systems

    Full text link
    In this paper, we propose fairness-oriented packet scheduling (PS) schemes with power-efficient control mechanism for future packet radio systems. In general, the radio resource management functionality plays an important role in new OFDMA based networks. The control of the network resource division among the users is performed by packet scheduling functionality based on maximizing cell coverage and capacity satisfying, and certain quality of service requirements. Moreover, multiantenna transmit-receive schemes provide additional flexibility to packet scheduler functionality. In order to mitigate inter-cell and co-channel interference problems in OFDMA cellular networks soft frequency reuse with different power masks patterns is used. Stemming from the earlier enhanced proportional fair scheduler studies for single-input multiple-output (SIMO) and multiple-input multipleoutput (MIMO) systems, we extend the development of efficient packet scheduling algorithms by adding transmit power considerations in the overall priority metrics calculations and scheduling decisions. Furthermore, we evaluate the proposed scheduling schemes by simulating practical orthogonal frequency division multiple access (OFDMA) based packet radio system in terms of throughput, coverage and fairness distribution among users. As a concrete example, under reduced overall transmit power constraint and unequal power distribution for different sub-bands, we demonstrate that by using the proposed power-aware multi-user scheduling schemes, significant coverage and fairness improvements in the order of 70% and 20%, respectively, can be obtained, at the expense of average throughput loss of only 15%.Comment: 14 Pages, IJWM

    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

    Recent advances in radio resource management for heterogeneous LTE/LTE-A networks

    Get PDF
    As heterogeneous networks (HetNets) emerge as one of the most promising developments toward realizing the target specifications of Long Term Evolution (LTE) and LTE-Advanced (LTE-A) networks, radio resource management (RRM) research for such networks has, in recent times, been intensively pursued. Clearly, recent research mainly concentrates on the aspect of interference mitigation. Other RRM aspects, such as radio resource utilization, fairness, complexity, and QoS, have not been given much attention. In this paper, we aim to provide an overview of the key challenges arising from HetNets and highlight their importance. Subsequently, we present a comprehensive survey of the RRM schemes that have been studied in recent years for LTE/LTE-A HetNets, with a particular focus on those for femtocells and relay nodes. Furthermore, we classify these RRM schemes according to their underlying approaches. In addition, these RRM schemes are qualitatively analyzed and compared to each other. We also identify a number of potential research directions for future RRM development. Finally, we discuss the lack of current RRM research and the importance of multi-objective RRM studies

    Adaptive frame structure and OFDMA resource allocation in mobile multi-hop relay networks

    Get PDF
    The objective of this thesis research is to optimize network throughput and fairness, and enhance bandwidth utilization in wireless mobile multi-hop relay (MMR) networks. To enhance bandwidth utilization, we propose an adaptive OFDMA frame structure which is used by the base station and the non-transparent relay stations. To optimize throughput and fairness, we develop an adaptive OFDMA allocation algorithm by using the proposed adaptive OFDMA frame. The effectiveness of the proposed schemes has been verified by numeric simulations. Providing ubiquitous coverage with wireless metropolitan area networks (WMANs) can be costly, especially in sparsely populated areas. In this scenario, cheaper relay stations (RSs) can be used to provide coverage instead of expensive base stations (BSs). The RS extends the coverage area of traditional BSs. This sort of network is known as a wireless MMR network. This thesis focuses on MMR networks that use orthogonal frequency division multiple access (OFDMA) and time division duplex (TDD) as a multiple access scheme and a duplex communication technique (e.g., WiMAX). The use of OFDMA resources (e.g., OFDMA symbols and subcarriers) and how they are shared in current schemes can reduce system capacity and network throughput in certain scenarios. To increase the capacity of the MMR network, we propose a new protocol that uses an adaptive OFDMA frame structure for BSs and RSs. We also propose adaptive OFDMA resource allocation for subscriber stations (SSs) within a BS or RS. We derive the maximum OFDMA resources that RSs can be assigned and synchronize access zones and relay zones between a superior station and its subordinate RSs. This is bounded by three properties defined in this thesis: a data relay property, a maximum balance property, and a relay zone limitation property. Finally, we propose max-min and proportional fairness schemes that use the proposed adaptive frame structure. The proposed scheme is the first approach that incorporates the adaptive technique for wireless MMR networks. We evaluate our scheme using simulations and numerical analysis. Results show that our technique improves resource allocation in wireless MMR networks. Further, in asymmetric distributions of SSs between access zones and relay zones, the proposed OFDMA allocation scheme performs two times better than the non-adaptive allocation scheme in terms of average max-min fairness and 70% better in terms of average throughput.Ph.D.Committee Chair: Dr. John A. Copeland; Committee Member: Dr. George F. Riley; Committee Member: Dr. Henry L. Owen; Committee Member: Dr. Mary Ann Ingram; Committee Member: Dr. Patrick Trayno

    Multi-cell Coordination Techniques for DL OFDMA Multi-hop Cellular Networks

    Get PDF
    The main objective of this project is to design coordinated spectrum sharing and reuse techniques among cells with the goal of mitigating interference at the cell edge and enhance the overall system capacity. The performance of the developed algorithm will be evaluated in an 802.16m (WiMAX) environment. In conventional cellular networks, frequency planning is usually considered to keep an acceptable signal-to-interference-plus noise ratio (SINR) level, especially at cell boundaries. Frequency assignations are done under a cell-by-cell basis, without any coordination between them to manage interference. Particularly this approach, however, hampers the system spectral efficiency at low reuse rates. For a specific reuse factor, the system throughput depends highly on the mobile station (MS) distribution and the channel conditions of the users to be served. If users served from different base stations (BS) experience a low level of interference, radio resources may be reused, applying a high reuse factor and thus, increasing the system spectral efficiency. On the other side, if the served users experience large interference, orthogonal transmissions are better and therefore a lower frequency reuse factor should be used. As a consequence, a dynamic reuse factor is preferable over a fixed one. This work addresses the design of joint multi-cell resource allocation and scheduling with coordination among neighbouring base stations (outer coordination) or sectors belonging to the same one (inner coordination) as a way to achieve flexible reuse factors. We propose a convex optimization framework to address the problem of coordinating bandwidth allocation in BS coordination problems. The proposed framework allows for different scheduling policies, which have an impact on the suitability of the reuse factor, since they determine which users have to be served. Therefore, it makes sense to consider the reuse factor as a result of the scheduling decision. To support the proposed techniques the BSs shall be capable of exchanging information with each other (decentralized approach) or with some control element in the back-haul network as an ASN gateway or some self-organization control entity (centralized approach)

    Design And Analysis Of Modified-Proportional Fair Scheduler For LTELTE-Advanced

    Get PDF
    Nowadays, Long Term Evolution-Advanced (LTE-Advanced) is well known as a cellular network that can support very high data rates in diverse traffic conditions. One of the key components of Orthogonal Frequency-Division Multiple Access (OFDMA), Radio Resource Management (RRM), is critical in achieving the desired performance by managing key components of both PHY and MAC layers. The technique that can be done to achieve this is through packet scheduling which is the key scheme of RRM for LTE traffic processing whose function is to allocate resources for both frequency and time dimensions. Packet scheduling for LTE-Advanced has been a dynamic research area in recent years, because in evidence, the increasing demands of data services and number of users which is likely to explode the progress of the LTE system traffic. However, the existing scheduling system is increasingly congested with the increasing number of users and requires the new scheduling system to ensure a more efficient data transmission. In LTE system, Round Robin (RR) scheduler has a problem in providing a high data rate to User Equipment’s (UEs). This is because some resources will be wasted because it schedules the resources from/ to UEs while the UEs are suffering from severe deep fading and less than the required threshold. Meanwhile, for Proportional Fair (PF) scheduler, the process of maximizing scheme of data rate could be very unfair and UE that experienced a bad channel quality conditions can be starved. So, the mechanism applied in PF scheduler is to weight the current data rate achievable by a UE by the average rate received by a UE. The main contribution of this study is the design of a new scheduling scheme and its performance is compared with the PF and RR downlink schedulers for LTE by utilizing the LTE Downlink System Level Simulator. The proposed new scheduling algorithm, namely the Modified-PF scheduler, divides a single sub-frame into multiple time slots and allocates the resource block (RB) to the targeted UE in all time slots for each sub-frame based on the instantaneous Channel Quality Indicator (CQI) feedback received from UEs. Besides, the proposed scheduler is also capable to reallocate RB cyclically in turn to target UE within a time slot in order to ensure the process of distributing packet data consistently. The simulation results showed that the Modified-PF scheduler provided the best performance in terms of throughput in the range of up to 90% improvement and almost 40% increment for spectral efficiency with comparable fairness as compared to PF and RR schedulers. Although PF scheduler had the best fairness index, the Modified-PF scheduler provided a better compromise between the throughput in /spectral efficiency and fairness. This showed that the newly proposed scheme improved the LTE output performances while at the same time maintained a minimal required fairness among the UEs
    corecore