• 제목/요약/키워드: uplink resource

검색결과 88건 처리시간 0.026초

셀 간 협동 CSM에서 상향 링크 용량 개선을 위한 자원 할당 알고리즘 (Radio Resource Management Algorithm for Uplink Coordinated Cooperative Spatial Multiplexing)

  • 문철;조한신
    • 한국전자파학회논문지
    • /
    • 제21권11호
    • /
    • pp.1311-1317
    • /
    • 2010
  • 본 논문에서는 셀 간 협동을 수행하는 cooperative spatial multiplexing(CSM)의 상향 링크 용량을 개선하기 위한 무선 자원 관리 알고리즘을 제안한다. 인접 기지국에 대한 상향 링크 간섭을 억제하기 위해 각 이동국에서 독립적으로 수행되는 최대 송신 전력 제한 알고리즘을 제안한다. 또한 서비스 기지국과 간섭 기지국이 서로 상향 링크 채널 정보를 공유하는 coordinated CSM 시스템에서 셀 간 상향 링크 간섭 억제를 통해 용량을 개선하는 협동 스케줄링 알고리즘을 제안한다. 제안하는 알고리즘들은 낮은 복잡도로 동작하지만 인접 기지국의 상향 링크 간섭을 효과적으로 억제하여 상향 링크 시스템 용량을 증가시킬 수 있다.

Hybrid Multiple Access for Uplink OFDMA System

  • Jung, Bang-Chul;Kang, Min-Suk;Ban, Tae-Won
    • Journal of information and communication convergence engineering
    • /
    • 제10권2호
    • /
    • pp.117-122
    • /
    • 2012
  • We propose a hybrid multiple access (HMA) for uplink orthogonal frequency division multiple access (OFDMA) systems, which combines two resource sharing schemes: a scheduling-based resource allocation (SBRA) scheme and a contentionbased resource allocation (CBRA) scheme. The SBRA scheme is appropriate for non-real time high data rate traffic, and, CBRA is appropriate for near-real time low/medium data rate traffic. Thus, the proposed HMA scheme supports various types of traffic. As a CBRA scheme, our proposed random frequency hopping (RFH)-OFDMA scheme was presented. Simulation results show that the proposed HMA yields the best performance among various resource allocation schemes for uplink OFDMA systems.

Distributed Uplink Resource Allocation in Multi-Cell Wireless Data Networks

  • Ko, Soo-Min;Kwon, Ho-Joong;Lee, Byeong-Gi
    • Journal of Communications and Networks
    • /
    • 제12권5호
    • /
    • pp.449-458
    • /
    • 2010
  • In this paper, we present a distributed resource allocation algorithm for multi-cell uplink systems that increases the weighted sum of the average data rates over the entire network under the average transmit power constraint of each mobile station. For the distributed operation, we arrange each base station (BS) to allocate the resource such that its own utility gets maximized in a noncooperative way. We define the utility such that it incorporates both the weighted sum of the average rates in each cell and the induced interference to other cells, which helps to instigate implicit cooperation among the cells. Since the data rates of different cells are coupled through inter-cell interferences, the resource allocation taken by each BS evolves over iterations. We establish that the resource allocation converges to a unique fixed point under reasonable assumptions. We demonstrate through computer simulations that the proposed algorithm can improve the weighted sum of the average rates substantially without requiring any coordination among the base stations.

이동통신 역방향 스케줄러에서의 고신뢰성 자원 할당 기법 (Reliability Constrained Resource Allocation in Cellular Network Uplink Scheduler)

  • 이성원;정광렬;박애순
    • 한국컴퓨터정보학회논문지
    • /
    • 제15권12호
    • /
    • pp.57-66
    • /
    • 2010
  • 본 연구에서는 3rd Generation Partnership Project (3GPP) Long Term Evolution (LTE)와 같은 이동통신 네트워크에서 역방향 전송이 전용회선 방식이 아닌 패킷 전송으로 이루어지는 환경에서의 고신뢰성 역방향 패킷 스케줄링 기법을 제안하고, 기존 방안과 성능을 비교하여 장단점을 분석한다. 제안하는 고신뢰성 역방향 패킷 스케줄링 기법은 전송속도 혹은 처리용량의 극대화를 추구하는 기존 방식과 다르게 현재 차세대 이동통신의 핵심 연구 분야로 고려되는 Machine Type Communication (MTC) 분야에서, 단말의 위치 및 단말의 무선링크 상태에 독립적으로, 반드시 단말이 생성한 정보가 네트워크로 전송되어야 하는 요구사항을 만족하도록 제안되었으며, 성능 평가를 통하여 제안방안이 기존 방안 대비 우수한 신뢰성을 제공하는 것을 확인하였다.

Traffic Aided Uplink Opportunistic Scheduling with QoS Support in Multiservice CDMA Networks

  • Liao, Dan;Li, Lemin
    • ETRI Journal
    • /
    • 제29권1호
    • /
    • pp.120-123
    • /
    • 2007
  • In this letter, we address the problem of resource allocation with efficiency and quality of service (QoS) support in uplink for a wireless CDMA network supporting real-time (RT) and non-realtime (NRT) communication services. For RT and NRT users, there are different QoS requirements. We introduce and describe a new scheme, namely, traffic aided uplink opportunistic scheduling (TAUOS). While guaranteeing the different QoS requirements, TAUOS exploits the channel condition to improve system throughput. In TAUOS, the cross-layer information, file size information, is used to improve fairness for NRT users. Extensive simulation results show that our scheme can achieve high system throughput in uplink wireless CDMA systems, while guaranteeing QoS requirements.

  • PDF

Adaptive Resource Allocation for MC-CDMA and OFDMA in Reconfigurable Radio Systems

  • Choi, Yonghoon
    • ETRI Journal
    • /
    • 제36권6호
    • /
    • pp.953-959
    • /
    • 2014
  • This paper studies the uplink resource allocation for multiple radio access (MRA) in reconfigurable radio systems, where multiple-input and multiple-output (MIMO) multicarrier-code division multiple access (MC-CDMA) and MIMO orthogonal frequency-division multiple access (OFDMA) networks coexist. By assuming multi-radio user equipment with network-guided operation, the optimal resource allocation for MRA is analyzed as a cross-layer optimization framework with and without fairness consideration to maximize the uplink sum-rate capacity. Numerical results reveal that parallel MRA, which uses MC-CDMA and OFDMA networks concurrently, outperforms the performance of each MC-CDMA and OFDMA network by exploiting the multiuser selection diversity.

Resource Allocation for Cooperative Relay based Wireless D2D Networks with Selfish Users

  • Niu, Jinxin;Guo, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권6호
    • /
    • pp.1996-2013
    • /
    • 2015
  • This paper considers a scenario that more D2D users exist in the cell, they compete for cellular resources to increase their own data rates, which may cause transmission interference to cellular users (CU) and the unfairness of resource allocation. We design a resource allocation scheme for selfish D2D users assisted by cooperative relay technique which is used to further enhance the users' transmission rates, meanwhile guarantee the QoS requirement of the CUs. Two transmission modes are considered for D2D users: direct transmission mode and cooperative relay transmission mode, both of which reuses the cellular uplink frequency resources. To ensure the fairness of resource distribution, Nash bargaining theory is used to determine the transmission mode and solve the bandwidth allocation problem for D2D users choosing cooperative relay transmission mode, and coalition formation game theory is used to solve the uplink frequency sharing problem between D2D users and CUs through a new defined "Selfish order". Through theoretical analysis, we obtain the closed Nash bargaining solution under CUs' rate constraints, and prove the stability of the formatted coalition. Simulation results show that the proposed resource allocation approach achieves better performance on resource allocation fairness, with only little sacrifice on the system sum rates.

A Cloud-Edge Collaborative Computing Task Scheduling and Resource Allocation Algorithm for Energy Internet Environment

  • Song, Xin;Wang, Yue;Xie, Zhigang;Xia, Lin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제15권6호
    • /
    • pp.2282-2303
    • /
    • 2021
  • To solve the problems of heavy computing load and system transmission pressure in energy internet (EI), we establish a three-tier cloud-edge integrated EI network based on a cloud-edge collaborative computing to achieve the tradeoff between energy consumption and the system delay. A joint optimization problem for resource allocation and task offloading in the threetier cloud-edge integrated EI network is formulated to minimize the total system cost under the constraints of the task scheduling binary variables of each sensor node, the maximum uplink transmit power of each sensor node, the limited computation capability of the sensor node and the maximum computation resource of each edge server, which is a Mixed Integer Non-linear Programming (MINLP) problem. To solve the problem, we propose a joint task offloading and resource allocation algorithm (JTOARA), which is decomposed into three subproblems including the uplink transmission power allocation sub-problem, the computation resource allocation sub-problem, and the offloading scheme selection subproblem. Then, the power allocation of each sensor node is achieved by bisection search algorithm, which has a fast convergence. While the computation resource allocation is derived by line optimization method and convex optimization theory. Finally, to achieve the optimal task offloading, we propose a cloud-edge collaborative computation offloading schemes based on game theory and prove the existence of Nash Equilibrium. The simulation results demonstrate that our proposed algorithm can improve output performance as comparing with the conventional algorithms, and its performance is close to the that of the enumerative algorithm.

Adaptive Resource Allocation for Uplink Carrier Aggregation Scheme in LTE-A-Type Networks

  • Choi, Yonghoon;Lee, Yonggyu;Chang, Kapseok
    • ETRI Journal
    • /
    • 제34권5호
    • /
    • pp.759-762
    • /
    • 2012
  • Carrier aggregation is an essential feature in the Long Term Evolution-Advanced (LTE-A) system, which allows the scalable expansion of the effective bandwidth to be delivered to user equipment (UE) through the concurrent use of radio resources across multiple component carriers (CCs). This system's optimal radio-resource use has received much attention under simultaneous access (SA) scenarios for multiple CCs (m-CCs). This letter establishes how many CCs a UE should simultaneously connect to maintain maximum uplink capacity. Under the m-CC LTE-A system, the spectral efficiency of the m-CC SA scheme ($m{\geq}2$) is compared with that of CC selection (CCS). Numerical results reveal that the 2-CC SA scheme outperforms CCS and performs almost equally to the m-CC SA scheme ($m{\geq}3$).

Bidirectional Link Resource Allocation Strategy in GFDM-based Multiuser SWIPT Systems

  • Xu, Xiaorong;Sun, Minghang;Zhu, Wei-Ping;Feng, Wei;Yao, Yingbiao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제16권1호
    • /
    • pp.319-333
    • /
    • 2022
  • In order to enhance system energy efficiency, bidirectional link resource allocation strategy in GFDM-based multiuser SWIPT systems is proposed. In the downlink channel, each SWIPT user applies power splitting (PS) receiver structure in information decoding (ID) and non-linear energy harvesting (EH). In the uplink channel, information transmission power is originated from the harvested energy. An optimization problem is constructed to maximize weighted sum ID achievable rates in the downlink and uplink channels via bidirectional link power allocation as well as subcarriers and subsymbols scheduling. To solve this non-convex optimization problem, Lagrange duality method, sub-gradient-based method and greedy algorithm are adopted respectively. Simulation results show that the proposed strategy is superior to the fixed subcarrier scheme regardless of the weighting coefficients. It is superior to the heuristic algorithm in larger weighting coefficients scenario.