• Title/Summary/Keyword: radio resource allocation

Search Result 158, Processing Time 0.03 seconds

Cross-layer Resource Allocation Algorithm for Downlink OFDM System

  • Guo, Qianjing;Hwang, Sung-Sue;Kim, Suk-Chan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.8A
    • /
    • pp.828-834
    • /
    • 2010
  • In this paper, an adaptive cross-layer resource allocation algorithm for the downlink multi-user OFDM system is proposed. The proposed algorithm does not only concern the wireless characteristics of physical (PHY) layer, but also pays attention to the user's quality of service (QoS) requirement, fairness, and packet queue state information of medium access control (MAC) layer. The algorithm is composed of two parts: one is to decide the priority of the user, and the other is to assign the radio resource according to its priority. Simulation results show that the proposed algorithm has both steady QoS and low computation complexity, even though the mobile users have different receiving signal to noise ratio (SNR).

Resource Allocation to Support QoE of Handovers in Overlaid Macro-Femto Networks

  • Lee, Moon-Ho;Lee, Jong-Chan
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.12
    • /
    • pp.73-79
    • /
    • 2016
  • This paper proposes a novel resource allocation scheme which enables to guarantee the quality of experience (QoE) for handovers from femtocell to macrocell and vice versa, and between femtocells in the overlaid macro-femto networks. The proposed scheme guarantees QoE to a certain extent during handover by utilizing a fixed amount of radio resource reserved in advance for the dedicated use to support QoE. We take both the type of the handover and the temporal sensitiveness characteristics of user services into consideration in order to support QoE. Performance of our scheme is analyzed by simulation with respect to the outage probability and total throughput.

Cloud Radio Access Network: Virtualizing Wireless Access for Dense Heterogeneous Systems

  • Simeone, Osvaldo;Maeder, Andreas;Peng, Mugen;Sahin, Onur;Yu, Wei
    • Journal of Communications and Networks
    • /
    • v.18 no.2
    • /
    • pp.135-149
    • /
    • 2016
  • Cloud radio access network (C-RAN) refers to the virtualization of base station functionalities by means of cloud computing. This results in a novel cellular architecture in which low-cost wireless access points, known as radio units or remote radio heads, are centrally managed by a reconfigurable centralized "cloud", or central, unit. C-RAN allows operators to reduce the capital and operating expenses needed to deploy and maintain dense heterogeneous networks. This critical advantage, along with spectral efficiency, statistical multiplexing and load balancing gains, make C-RAN well positioned to be one of the key technologies in the development of 5G systems. In this paper, a succinct overview is presented regarding the state of the art on the research on C-RAN with emphasis on fronthaul compression, baseband processing, medium access control, resource allocation, system-level considerations and standardization efforts.

Efficient Resource Allocation Scheme for Improving the Throughput in the PB/MC-CDMA System (PB/MC-CDMA 시스템에서 처리량 향상을 위한 효율적인 자원 할당 기법)

  • Lee, Kyujin;Seo, HyoDuck;Han, DooHee
    • Journal of Convergence Society for SMB
    • /
    • v.4 no.1
    • /
    • pp.1-6
    • /
    • 2014
  • PB/MC-CDMA is an efficient system which divides the whole frequency band into several blocks, unlike a conventional MC-CDMA system. We propose an efficient resource allocation scheme in Multi-Block PB/MC-CDMA (Partial Block Multi-Carrier Code Division Multiple Access). This system aims to improve frequency efficiency and maximize the total throughput while satisfying predefined threshold over various channel conditions. Through computer simulations, we confirm that the performance of the proposed system is more effective in terms of throughput.

  • PDF

FFFR-Based Resource Allocation Mechanism for Interference Mitigation of D2D Communications in LTE-Advanced Networks (LTE-Advanced 네트워크에서 간섭 완화를 위한 FFFR 기반의 D2D 자원 할당 기법)

  • Na, Lee Han;Kim, Hyang-Mi;Kim, SangKyung
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.4 no.1
    • /
    • pp.5-10
    • /
    • 2015
  • D2D (Device-to-Device) communication underlaying LTE-advanced networks is a promising technology to improve the system capacity and spectral efficiency. By sharing the same radio resources with cellular user equipments, D2D communications can significantly enhance the overall spectral efficiency. However, it may cause interference between D2D link and cellular link. Careful resource allocation and interference coordination between cellular and D2D communications are very important and need to be properly handled. This paper proposes a radio resource allocation scheme based on FFFR (Flexible Fractional Frequency Reuse) for D2D communication underlaying cellular networks. The base station selects randomly resource blocks assigned to cellular users, and reuses them for a D2D pair. Through simulations, we have confirmed that the proposed scheme improves the system throughput, reduces the computational complexity, and mitigates the interference of D2D link and cellular link.

Grouping Resource Allocation Scheme for D2D Communications (D2D 통신을 위한 그룹핑 자원 할당 기법)

  • Kim, Hyang-mi;Lee, Han-na;Kim, Sangkyung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.8
    • /
    • pp.1532-1541
    • /
    • 2015
  • D2D(Device-to-Device) communication is a promising technology to improve the system capacity and spectral efficiency. By sharing the same radio resources with cellular user equipments, D2D communications can significantly enhance the overall spectral efficiency. However, it may cause interference between D2D link and cellular link. So, careful resource allocation and interference coordination between them are very important and need to be properly handled. This paper proposes a radio resource allocation scheme that decreases interference through the use of area grouping and D2D pair grouping. Simulations results are provided to verify the performance improvement of the proposed scheme in terms of the number of assigned resource blocks and computational complexity.

Radio Resource Management Modeling in IEEE 802.16e Networks (IEEE 802.16 망을 위한 무선 자원 관리 모델링)

  • Ro, Cheul-Woo;Kim, Kyung-Min
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.1
    • /
    • pp.169-176
    • /
    • 2008
  • In this paper, we develop radio resource management queueing model in IEEE 802.IS networks considering both connection and packet level. In the upper level connection, we model connection admission control depending on availability of bandwidth and priority queue in each service class. In the lower level packet, we model dynamic bandwidth allocation considering threshold and availability of bandwidth in each service class simultaneously. Hierarchical model is built using an extended Petri Nets, SRN (Stochastic Reward Nets). Bandwidth utilization and normal throughput as performance index for all service classes of traffic are calculated and numerical results are obtained.

Resource scheduling scheme for 5G mmWave CP-OFDM based wireless networks with delay and power allocation optimizations

  • Marcus Vinicius G. Ferreira;Flavio H. T. Vieira;Alisson A. Cardoso
    • ETRI Journal
    • /
    • v.45 no.1
    • /
    • pp.45-59
    • /
    • 2023
  • In this paper, to optimize the average delay and power allocation (PA) for system users, we propose a resource scheduling scheme for wireless networks based on Cyclic Prefix Orthogonal Frequency Division Multiplexing (CP-OFDM) according to the first fifth-generation standards. For delay minimization, we solve a throughput maximization problem that considers CPOFDM systems with carrier aggregation (CA). Regarding PA, we consider an approach that involves maximizing goodput using an effective signal-to-noise ratio. An algorithm for jointly solving delay minimization through computation of required user rates and optimizing the power allocated to users is proposed to compose the resource allocation approach. In wireless network simulations, we consider a scenario with the following capabilities: CA, 256-Quadrature Amplitude Modulation, millimeter waves above 6 GHz, and a radio frame structure with 120 KHz spacing between the subcarriers. The performance of the proposed resource allocation algorithm is evaluated and compared with those of other algorithms from the literature using computational simulations in terms of various Quality of Service parameters, such as the throughput, delay, fairness index, and loss rate.

Mixed-Integer Programming based Techniques for Resource Allocation in Underlay Cognitive Radio Networks: A Survey

  • Alfa, Attahiru S.;Maharaj, B.T.;Lall, Shruti;Pal, Sougata
    • Journal of Communications and Networks
    • /
    • v.18 no.5
    • /
    • pp.744-761
    • /
    • 2016
  • For about the past decade and a half research efforts into cognitive radio networks (CRNs) have increased dramatically. This is because CRN is recognized as a technology that has the potential to squeeze the most out of the existing spectrum and hence virtually increase the effective capacity of a wireless communication system. The resulting increased capacity is still a limited resource and its optimal allocation is a critical requirement in order to realize its full benefits. Allocating these additional resources to the secondary users (SUs) in a CRN is an extremely challenging task and integer programming based optimization tools have to be employed to achieve the goals which include, among several aspects, increasing SUs throughput without interfering with the activities of primary users. The theory of the optimization tools that can be used for resource allocations (RA) in CRN have been well established in the literature; convex programming is one of them, in fact the major one. However when it comes to application and implementation, it is noticed that the practical problems do not fit exactly into the format of well established tools and researchers have to apply approximations of different forms to assist in the process. In this survey paper, the optimization tools that have been applied to RA in CRNs are reviewed. In some instances the limitations of techniques used are pointed out and creative tools developed by researchers to solve the problems are identified. Some ideas of tools to be considered by researchers are suggested, and direction for future research in this area in order to improve on the existing tools are presented.

Joint wireless and computational resource allocation for ultra-dense mobile-edge computing networks

  • Liu, Junyi;Huang, Hongbing;Zhong, Yijun;He, Jiale;Huang, Tiancong;Xiao, Qian;Jiang, Weiheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.7
    • /
    • pp.3134-3155
    • /
    • 2020
  • In this paper, we study the joint radio and computational resource allocation in the ultra-dense mobile-edge computing networks. In which, the scenario which including both computation offloading and communication service is discussed. That is, some mobile users ask for computation offloading, while the others ask for communication with the minimum communication rate requirements. We formulate the problem as a joint channel assignment, power control and computational resource allocation to minimize the offloading cost of computing offloading, with the precondition that the transmission rate of communication nodes are satisfied. Since the formulated problem is a mixed-integer nonlinear programming (MINLP), which is NP-hard. By leveraging the particular mathematical structure of the problem, i.e., the computational resource allocation variable is independent with other variables in the objective function and constraints, and then the original problem is decomposed into a computational resource allocation subproblem and a joint channel assignment and power allocation subproblem. Since the former is a convex programming, the KKT (Karush-Kuhn-Tucker) conditions can be used to find the closed optimal solution. For the latter, which is still NP-hard, is further decomposed into two subproblems, i.e., the power allocation and the channel assignment, to optimize alternatively. Finally, two heuristic algorithms are proposed, i.e., the Co-channel Equal Power allocation algorithm (CEP) and the Enhanced CEP (ECEP) algorithm to obtain the suboptimal solutions. Numerical results are presented at last to verify the performance of the proposed algorithms.