3 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

    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

    Energy and computationally efficient resource allocation methods for cellular relay-aided networks with system stability consideration

    Get PDF
    The increasing demand for coverage extension and power gain, along with the need for decreasing implementation costs, raised the idea of relaying cellular systems. Developing relay stations as a coverage extension and low cost mechanism has also brought up the challenge of utilizing the available network resources cooperatively between base stations and relays. The topic of resource allocation in the downlink of a relaying cellular system is studied in the current dissertation with the objective of maximizing transmission rate, encompassing system stability and managing the interference as it has not been investigated as a comprehensive allocation problem in the previous literature. We begin our study by modeling a single cell downlink transmission system with the objective to enhance the throughput of cell-edge users by employing decode-and-forward relay stations. We study the queue length evolution at each hop and propose a rate control mechanism to stabilize the considered queues. Accordingly, we propose a novel allocation model which maximizes user throughput with respect to the channel condition and the stability requirements. To solve the proposed allocation problem, we introduced optimization algorithm as well as heuristic approaches which offer low computation complexity. Next, we enhance the initial allocation method by considering a multi-cell system that accounts for more general and practical cellular networks. The multi-cell model embodies extra constraints for controlling the interference to the users of neighboring cells. We propose a different set of stability constraints which do not enquire a priori knowledge of the statistics of the arriving traffic. In an approach to improve the energy efficiency while respecting the stability and interference criteria, we also suggest an energy-conservative allocation scheme. We solve the defined allocation problems in a central controlling system. As our final contribution, we enhance the proposed multi-cell allocation model with a low overhead and distributed approach. The proposed method is based on the idea of dividing the resource allocation task between each base station and its connected relay stations. In addition, the messaging overhead for controlling inter-cell interference is minimized using the reference-station method. This distributed approach offers high degree of energy efficiency as well as more scalability in comparison to centralized schemes, when the system consists of larger number of cells and users. Since the defined problems embody multiple variables and constraints, we develop a framework to cast the joint design in the optimization form which gives rise to nonlinear and nonconvex problems. In this regard, we employ time-sharing technique to tackle the combinatorial format of the allocation problem. In addition, it is important to consider the situation that the time-shared approach is not beneficial when subcarriers are not allowed to be shared during one time-slot. To overcome this obstacle, we apply heuristic algorithms as well as convex optimization techniques to obtain exclusive subcarrier allocation schemes. To evaluate the performance of the proposed solutions, we compare them in terms of the achieved throughput, transmitted power, queue stability, feedback overhead, and computation complexity. By the means of extensive simulation scenarios as well as numerical analysis, we demonstrate the remarkable advantages of the suggested approaches. The results of the present dissertation are appealing for designing of future HetNet systems specifically when the communication latency and the energy consumption are required to be minimized
    corecore