• 전자공학회논문지
• /
• 제51권6호
• /
• pp.9-17
• /
• 2014

이종 네트워크(HetNet)란 매크로셀 내에 소형셀이 혼재한 네트워크이다. 이종 네트워크에서는 대형셀로부터 소형셀 사용자에게 미치는 간섭이 소형셀 사용자의 성능을 열화시키는 주 원인 중 하나이며, 이 간섭을 줄이기 위해 향상된 셀간 간섭 조정기법(eICIC)이 필요하다. 기존의 eICIC 관련 연구에서는 프레임별 채널 변화를 거의 고려하지 않고 네트워크의 장기 처리율을 최대화하는 데 치중되어 성능 향상이 제한적이었다. 이 논문에서는 네트워크 전체 효용을 최대화하기 위해 매 프레임마다 동적으로 셀간 간섭을 제어하고 사용자를 스케줄링하며, 전수검색보다 계산 복잡도가 낮은 새로운 알고리즘을 제안한다. 제안된 알고리즘이 기존 알고리즘보다 네트워크 전체 처리율을 향상시키며, 사용자의 수가 많을 때 사용자간 공평성을 향상시킴을 컴퓨터 모의실험을 통해 보인다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권11호
• /
• pp.3876-3895
• /
• 2014

Recently, Heterogeneous Network (HetNet) with Coordinated Multi-Point (CoMP) scheme is introduced into Long Term Evolution-Advanced (LTE-A) systems to improve digital services for User Equipments (UEs), especially for cell-edge UEs. However, Radio Resource Management (RRM), including Resource Block (RB) scheduling and Power Allocation (PA), in this scenario becomes challenging, due to the intercell cooperation. In this paper, we investigate the RRM problem for downlink transmission of HetNet system with Joint Processing (JP) CoMP (both joint transmission and dynamic cell selection schemes), aiming at maximizing weighted sum data rate under the constraints of both transmission power and backhaul capacity. First, joint RB scheduling and PA problem is formulated as a constrained Mixed Integer Programming (MIP) which is NP-hard. To simplify the formulation problem, we decompose it into two problems of RB scheduling and PA. For RB scheduling, we propose an algorithm with less computational complexity to achieve a suboptimal solution. Then, according to the obtained scheduling results, we present an iterative Karush-Kuhn-Tucker (KKT) method to solve the PA problem. Extensive simulations are conducted to verify the effectiveness and efficiency of the proposed algorithms. Two kinds of JP CoMP schemes are compared with a non-CoMP greedy scheme (max capacity scheme). Simulation results prove that the CoMP schemes with the proposed RRM algorithms dramatically enhance data rate of cell-edge UEs, thereby improving UEs' fairness of data rate. Also, it is shown that the proposed PA algorithms can decrease power consumption of transmission antennas without loss of transmission performance.

• 한국통신학회논문지
• /
• 제40권12호
• /
• pp.2410-2418
• /
• 2015

In this paper, we consider the femto users and their mutual interference as graph elements, nodes and weighted edges, respectively. The total bandwidth is divided into a number of resource blocks (RBs) and these are assigned to the femto user equipment (FUEs) using a graph coloring algorithm. In addition, resources blocks are assigned to the femto users to avoid inter-cell interference. The proposed scheme is compared with the traditional scheduling schemes in terms of throughput and fairness and performance improvement is achieved by exploiting the graph coloring scheme.

• Journal of Communications and Networks
• /
• 제12권1호
• /
• pp.30-42
• /
• 2010

In this work we consider the problem of downlink resource allocation for proportional fairness of long term received rates of data users and quality of service for real time sessions in an OFDMA-based wireless system. The base station allocates available power and subchannels to individual users based on long term average received rates, quality of service (QoS) based rate constraints and channel conditions. We formulate and solve a joint bandwidth and power optimization problem, solving which provides a performance improvement with respect to existing resource allocation algorithms. We propose schemes for flat as well as frequency selective fading cases. Numerical evaluation results show that the proposed method provides better QoS to voice and video sessions while providing more and fair rates to data users in comparison with existing schemes.

• Journal of Communications and Networks
• /
• 제13권3호
• /
• pp.232-239
• /
• 2011

This paper investigates the user selection problem of successive zero-forcing precoded multiuser multiple-input multiple-output (MU-MIMO) downlink systems, in which the base station and mobile receivers are equipped with multiple antennas. Assuming full knowledge of the channel state information at the transmitter, dirty paper coding (DPC) is an optimal precoding strategy, but practical implementation is difficult because of its excessive complexity. As a suboptimal DPC solution, successive zero-forcing DPC (SZF-DPC) was recently proposed; it employs partial interference cancellation at the transmitter with dirty paper encoding. Because of a dimensionality constraint, the base station may select a subset of users to serve in order to maximize the total throughput. The exhaustive search algorithm is optimal; however, its computational complexity is prohibitive. In this paper, we develop two low-complexity user scheduling algorithms to maximize the sum rate capacity of MU-MIMO systems with SZF-DPC. Both algorithms add one user at a time. The first algorithm selects the user with the maximum product of the maximum column norm and maximum eigenvalue. The second algorithm selects the user with the maximum product of the minimum column norm and minimum eigenvalue. Simulation results demonstrate that the second algorithm achieves a performance similar to that of a previously proposed capacity-based selection algorithm at a high signal-to-noise (SNR), and the first algorithm achieves performance very similar to that of a capacity-based algorithm at a low SNR, but both do so with much lower complexity.

• Journal of Communications and Networks
• /
• 제18권3호
• /
• pp.420-428
• /
• 2016

In this paper, we investigate the scheduling and power allocation for coordinated multi-point transmission in downlink long term evolution advanced (LTE-A) systems, where orthogonal frequency division multiple-access is used. The proposed scheme jointly optimizes user selection, power allocation, and modulation and coding scheme (MCS) selection to maximize the weighted sum throughput with fairness consideration. Considering practical constraints in LTE-A systems, the MCSs for the resource blocks assigned to the same user need to be the same. Since the optimization problem is a combinatorial and non-convex one with high complexity, a low-complexity algorithm is proposed by separating the user selection and power allocation into two subproblems. To further simplify the optimization problem for power allocation, the instantaneous signal-to-interference-plus-noise ratio (SINR) and the average SINR are adopted to allocate power in a single cell and multiple coordinated cells, respectively. Simulation results show that the proposed scheme can improve the average system throughput and the cell-edge user throughput significantly compared with the existing schemes with limited feedback.

• 한국정보통신학회논문지
• /
• 제17권7호
• /
• pp.1597-1601
• /
• 2013

향후 폭발적인 증가가 예상되는 모바일 데이터 트래픽을 효과적으로 수용하기 위해서 다중 안테나 기술이 차세대 이동통신 시스템의 핵심 기술로 주목을 받고 있다. 특히, 기지국에 수십 개의 안테나를 탑재하여 동시에 복수의 단말에게 데이터를 동시에 전송하는 다중 사용자 기반 다중 안테나 기술에 대한 연구가 활발히 진행되고 있다. 본 논문에서는, 이러한 다중 사용자 기반 다중 안테나 통신 시스템에서 시스템의 성능을 향상시키기 위해서 채널 상태에 따라서 적응적으로 데이터를 전송할 단말 조합을 선택할 수 있는 알고리즘을 제안한다. Monte-Carlo 기반 시뮬레이션을 통한 성능 분석 결과 제안 방식은 단말 선택 기법을 적용하지 않는 기존 방식 대비 우수한 성능을 나타내며 Exhaustive Search 기반 최적 방식에 근접하는 성능을 보여준다. 반면에, 시스템 내 단말의 수를 K라고 할 때 제안 방식은 최적 방식 대비 계산양을 $K/(2^K-1)$로 줄일 수 있다.