무선통신망에서 처리율 개선을 위한 신호전달 부하의 저감에 관한 연구

학위논문 (박사)-- 서울대학교 대학원 : 전기·컴퓨터공학부, 2014. 2. 전화숙.무선통신망(wireless networks)은 무선 채널의 상태 변화에 따른 성능 저하를 줄이기 위해 링크 적응(link adaptation) 기술을 기본적으로 사용한다. 링크 적응 기술을 위해서는 채널 상태 정보를 추정하고 수집해야하기 때문에 이에 따른 신호전달 부하(signaling overhead)가 발생하게 된다. 본 논문에서는 무선통신망에서의 신호전달 부하를 줄이기 위한 두 가지 기법을 제안하였다. 먼저 협력 통신 네트워크(cooperative communication networks)에서의 적응적인 전송 기법을 제안하였다. 제안한 기법을 사용하는 협력 통신 네트워크는 ACK(positive acknowledgement)/NACK(negative ACK)와 같은 제한된 피드백 정보로부터 추정된 채널 상태에 기반을 두어 전송 속도를 조절하면서 릴레이(relay)의 사용여부도 함께 결정한다. 제한된 피드백 정보는 실제 채널 상태에 대한 부분적인 정보만을 제공하기 때문에 제안하는 기법을 불확실성 마코브 의사 결정(partially observable Markov decision process)에 따라 설계하였다. 다음으로, 셀룰러 네트워크에서의 기기 간(D2D, device-to-device) 통신을 위한 자원 관리 기법을 제안하였다. 제안한 기법은 두 단계로 구성되고 준 분산적(semi-distributed)으로 동작한다. 첫 번째 단계에서는 중앙 집중적(centralized)으로 기지국이 자원 블록을 B2D(BS-to-user device) 링크와 D2D 링크에게 할당한다. 두 번째 단계에서는 분산적(distributed)으로 기지국은 B2D 링크에 할당된 자원 블록들을 사용하여 전송 스케줄을 결정(scheduling)하고, 각 D2D 링크의 제 1 사용자 기기(primary user device)는 해당 D2D 링크에 할당된 자원 블록들에서의 링크 적응을 수행한다. 이러한 자원 관리 구조는 중앙 집중적 기법처럼 높은 네트워크 용량을 달성할 뿐 아니라 분산적 기법처럼 낮은 신호전달 및 계산(computational) 부하를 필요로 한다. 본 논문에서는 제안한 자원 관리 구조에서 주파수 자원 효율을 최대화하는 자원 블록 할당 문제들을 두 가지 서로 다른 자원 할당 정책에 대하여 만들고 이 문제들을 풀기 위해 탐욕(greedy) 알고리즘과 열 추가 기반(column generation-based) 알고리즘을 제안하였다. 또한 시뮬레이션을 통해 제안하는 기법들이 설계 목표를 달성하고 기존의 기법보다 높은 성능을 보이면서도 신호전달 부하를 줄일 수 있음을 보였다.Wireless networks usually adopt some link adaptation techniques to mitigate the performance degradation due to the time-varying characteristics of wireless channels. Since the link adaptation techniques require to estimate and collect channel state information, signaling overhead is inevitable in wireless networks. In this thesis, we propose two schemes to reduce the signaling overhead in wireless networks. First, we design an adaptive transmission scheme for cooperative communication networks. The cooperative network with the proposed scheme chooses the transmission rate and decides to involve the relay in transmission, adapting to the channel state estimated from limited feedback information (e.g., ACK/NACK feedback). Considering that the limited feedback information provides only partial knowledge about the actual channel states, we design a decision-making algorithm on cooperative transmission by using a partially observable Markov decision process (POMDP) framework. Next, we also propose a two-stage semi-distributed resource management framework for the device-to-device (D2D) communication in cellular networks. At the first stage of the framework, the base station (BS) allocates resource blocks (RBs) to BS-to-user device (B2D) links and D2D links, in a centralized manner. At the second stage, the BS schedules the transmission using the RBs allocated to B2D links, while the primary user device of each D2D link carries out link adaptation on the RBs allocated to the D2D link, in a distributed fashion. The proposed framework has the advantages of both centralized and distributed design approaches, i.e., high network capacity and low signaling/computational overhead, respectively. We formulate the problems of RB allocation to maximize the radio resources efficiency, taking account of two different policies on the spatial reuse of RBs. To solve these problems, we suggest a greedy algorithm and a column generation-based algorithm. By simulation, it is shown that the proposed schemes achieve their design goal properly and outperform existing schemes while reducing the signaling overhead.1 Introduction 1 1.1 Background and Motivation 1 1.2 Approaches to Reduce Signaling Overhead 5 1.3 Proposed Schemes 7 1.3.1 Adaptive Transmission Scheme for Cooperative Communication 7 1.3.2 Resource Management Scheme for D2D Communication in Cellular Networks 8 1.4 Organization 10 2 Adaptive Transmission Scheme for Cooperative Communication 11 2.1 System Model 11 2.2 Cooperative Networks with Limited Feedback 12 2.2.1 Operation of the Proposed Cooperative Network 12 2.2.2 Finite-State Markov Channel Model 15 2.2.3 Packet Error Probability 16 2.2.4 Channel Feedback Schemes 18 2.3 Adaptive Transmission Scheme for Cooperative Communication 19 2.3.1 POMDP Formulation 19 2.3.2 Solution to POMDP 22 3 Resource Management Scheme for D2D Communication in Cellular Networks 25 3.1 System Model 25 3.1.1 Network Model 25 3.1.2 Radio Resource Model 27 3.2 Proposed Resource Management Framework 28 3.2.1 Framework Overview 28 3.2.2 Two-Stage Resource Management 29 3.2.3 Advantages of the Proposed Framework 31 3.3 Conditions for Simultaneous Transmission of B2D and D2D Links 33 3.3.1 Analysis of Interference on B2D and D2D Links 33 3.3.2 Conditions for Simultaneous Transmission of B2D and D2D Links 36 3.4 Resource Block Allocation 38 3.4.1 Resource Block Allocation with Conservative Reuse Policy 39 3.4.2 Resource Block Allocation with Aggressive Reuse Policy 44 4 Performance Evaluation 52 4.1 Adaptive Transmission Scheme for Cooperative Communication 52 4.1.1 Simulation Model 52 4.1.2 Simulation Results 53 4.2 Resource Management Scheme for D2D Communication in Cellular Networks 62 4.2.1 Simulation Model 62 4.2.2 Simulation Results 64 5 Conclusion 75 Bibliography 77 Abstract 85Docto

RESOURCE ALLOCATION FOR WIRELESS RELAY NETWORKS

In this thesis, we propose several resource allocation strategies for relay networks in the context of joint power and bandwidth allocation and relay selection, and joint power allocation and subchannel assignment for orthogonal frequency division multiplexing (OFDM) and orthogonal frequency division multiple access (OFDMA) systems. Sharing the two best ordered relays with equal power between the two users over Rayleigh flat fading channels is proposed to establish full diversity order for both users. Closed form expressions for the outage probability, and bit error probability (BEP) performance measures for both amplify and forward (AF) and decode and forward (DF) cooperative communication schemes are developed for different scenarios. To utilize the full potentials of relay-assisted transmission in multi user systems, we propose a mixed strategy of AF relaying and direct transmission, where the user transmits part of the data using the relay, and the other part is transmitted using the direct link. The resource allocation problem is formulated to maximize the sum rate. A recursive algorithm alternating between power allocation and bandwidth allocation steps is proposed to solve the formulated resource allocation problem. Due to the conflict between limited wireless resources and the fast growing wireless demands, Stackelberg game is proposed to allocate the relay resources (power and bandwidth) between competing users, aiming to maximize the relay benefits from selling its resources. We prove the uniqueness of Stackelberg Nash Equilibrium (SNE) for the proposed game. We develop a distributed algorithm to reach SNE, and investigate the conditions for the stability of the proposed algorithm. We propose low complexity algorithms for AF-OFDMA and DF-OFDMA systems to assign the subcarriers to the users based on high SNR approximation aiming to maximize the weighted sum rate. Auction framework is proposed to devise competition based solutions for the resource allocation of AF-OFDMA aiming tomaximize either vi the sum rate or the fairness index. Two auction algorithms are proposed; sequential and one-shot auctions. In sequential auction, the users evaluate the subcarrier based on the rate marginal contribution. In the one-shot auction, the users evaluate the subcarriers based on an estimate of the Shapley value and bids on all subcarriers at once

Modeling and Performance Analysis of Relay-based Cooperative OFDMA Networks

Next generation wireless communication networks are expected to provide ubiquitous high data rate coverage and support heterogeneous wireless services with diverse quality-of-service (QoS) requirements. This translates into a heavy demand for the spectral resources. In order to meet these requirements, Orthogonal Frequency Division Multiple Access (OFDMA) has been regarded as a promising air-interface for the emerging fourth generation (4G) networks due to its capability to combat the channel impairments and support high data rate. In addition, OFDMA offers flexibility in radio resource allocation and provides multiuser diversity by allowing subcarriers to be shared among multiple users. One of the main challenges for the 4G networks is to achieve high throughput throughout the entire cell. Cooperative relaying is a very promising solution to tackle this problem as it provides throughput gains as well as coverage extension. The combination of OFDMA and cooperative relaying assures high throughput requirements, particularly for users at the cell edge. However, to fully exploit the benefits of relaying, efficient relay selection as well as resource allocation are critical in such kind of network when multiple users and multiple relays are considered. Moreover, the consideration of heterogeneous QoS requirements further complicate the optimal allocation of resources in a relay enhanced OFDMA network. Furthermore, the computational complexity and signalling overhead are also needed to be considered in the design of practical resource allocation schemes. In this dissertation, we conduct a comprehensive research study on the topic of radio resource management for relay-based cooperative OFDMA networks supporting heterogeneous QoS requirements. Specifically, this dissertation investigates how to effectively and efficiently allocate resources to satisfy QoS requirements of 4G users, improve spectrum utilization and reduce computational complexity at the base station. The problems and our research achievements are briefly outlined as follows. Firstly, a QoS aware optimal joint relay selection, power allocation and subcarrier assignment scheme for uplink OFDMA system considering heterogeneous services under a total power constraint is proposed. The relay selection, power allocation and subcarrier assignment problem is formulated as a joint optimization problem with the objective of maximizing the system throughput, which is solved by means of a two level dual decomposition and subgradient method. The computational complexity is finally reduced via the introduction of two suboptimal schemes. The performance of the proposed schemes is demonstrated through computer simulations based on OFDMA network. Numerical results show that our schemes support heterogeneous services while guaranteeing each user's QoS requirements with slight total system throughput degradation. Secondly, we investigate the resource allocation problem subject to the satisfaction of user QoS requirements and individual total power constraints of the users and relays. The throughput of each end-to-end link is modeled considering both the direct and relay links. Due to non-convex nature of the original resource allocation problem, the optimal solution is obtained by solving a relaxed problem via two level dual decomposition. Numerical results reveal that the proposed scheme is effective in provisioning QoS of each user's over the conventional resource allocation counterpart under individual total power constraints of the users and relays . Lastly, decentralized resource allocation schemes are proposed to reduce the computational complexity and CSI feedback overhead at the BS. A user centric distributed (UCD) scheme and a relay centric distributed (RCD) scheme are proposed, where the computation of the centralized scheme is distributed among the users and relays, respectively. We also proposed suboptimal schemes based on simplified relay selection. The suboptimal schemes can be combined with the distributed schemes to further reduce of signalling overhead and computational complexity. Numerical results show that our schemes guarantee user's satisfaction with low computational complexity and signalling overhead, leading to preferred candidates for practical implementation. The research results obtained in this dissertation can improve the resource utilization and QoS assurance of the emerging OFDMA networks.4 month

Resource Allocation for Broadband Wireless Access Networks with Imperfect CSI

The high deployment and maintenance costs of last mile wireline networks (i.e., DSL and cable networks) have urged service providers to search for new cost-effective solutions to provide broadband connectivity. Broadband wireless access (BWA) networks, which offer a wide coverage area and high transmission rates in addition to their fast and low-cost deployment, have emerged as an alternative to last mile wireline networks. Therefore, BWA networks are expected to be deployed in areas with different terrain profiles (e.g., urban, suburban, rural) where wireless communication faces different channel impairments. This fact necessitates the adoption of various transmission technologies that combat the channel impairments of each profile. Implementation scenarios of BWA networks considered in this thesis are multicarrier-based direct transmission and single carrier-based cooperative transmission scenarios. The performance of these transmission technologies highly depends on how resources are allocated. In this thesis, we focus on the development of practical resource allocation schemes for the mentioned BWA networks implementation scenarios. In order to develop practical schemes, the imperfection of channel state information (CSI) and computational power limitations are among considered practical implementation issues. The design of efficient resource allocation schemes at the MAC layer heavily relies on the CSI reported from the PHY layer as a measure of the wireless channel condition. The channel estimation error and feedback delay renders the reported CSI erroneous. The inaccuracy in CSI propagates to higher layers, resulting in performance degradation. Although this effect is intuitive, a quantitative measure of this degradation is necessary for the design of practical resource allocation schemes. An approach to the evaluation of the ergodic mutual information that reflects this degradation is developed for single carrier, multicarrier, direct, and cooperative scenarios with inaccurate CSI. Given the CSI estimates and estimation error statistics, the presented evaluation of ergodic mutual information can be used in resource allocation and in assessing the severity of estimation error on performance degradation. A point-to-multipoint (PMP) network that employs orthogonal frequency division multiple access (OFDMA) is considered as one of the most common implementation scenarios of BWA networks. Replacing wireline networks requires not only providing the last mile connectivity to subscribers but also supporting their diverse services with stringent quality of service (QoS) requirements. Therefore, the resource allocation problem (i.e., subcarriers, rate and power allocation) is modeled as a network utility maximization (NUM) one that captures the characteristics of this implementation scenario. A dual decomposition-based resource allocation scheme that takes into consideration the diversity of service requirements and inaccuracy of the CSI estimation is developed. Numerical evaluations and simulations are conducted to validate our theoretical claims that the scheme maximizes resource utilization, coordinates with the call admission controller to guarantee QoS, and accounts for CSI inaccuracy. Cooperation has recently received great attention from the research community and industry because of its low cost and fast deployment in addition to the performance improvement it brings to BWA networks. In cooperative scenarios, subscribers cooperate to relay each other's signals. For this implementation scenario of BWA networks, a robust and constrained Kalman filter-based power allocation scheme is proposed to minimize power consumption and guarantee bit error probability (BEP) requirements. The proposed scheme is robust to CSI inaccuracy, responsive to changes in BEP requirements, and optimal in allocating resources. In summary, research results presented in this thesis contribute to the development of practical resource allocation schemes for BWA networks

Efficient Device to Device Communications Underlaying Heterogeneous Networks

Device-to-Device communications have the great potential to bring significant performance boost to the conventional heterogeneous network by reusing cellular resources. In cellular networks, Device-to-Device communication is defined as two user equipments in a close range communicating directly with each other without going through the base station, thus offloading cellular traffic from cellular networks. In addition to improve network spectral efficiency, D2D communication can also improve energy efficiency and user experience. However, the co-existence of D2D communication on the same spectrum with cellular users can cause severe interference to the primary cellular users. Thus the performance of cellular users must be assured when supporting underlay D2D users. In this work, we have investigated cross-layer optimization, resource allocation and interference management schemes to improve user experience, system spectral efficiency and energy efficiency for D2D communication underlaying heterogeneous networks. By exploiting frequency reuse and multi-user diversity, this research work aims to design wireless system level algorithms to utilize the spectrum and energy resources efficiently in the next generation wireless heterogeneous network

Energy-Efficient Resource Allocation for Device-to-Device Underlay Communication

Device-to-device (D2D) communication underlaying cellular networks is expected to bring significant benefits for utilizing resources, improving user throughput and extending battery life of user equipments. However, the allocation of radio and power resources to D2D communication needs elaborate coordination, as D2D communication can cause interference to cellular communication. In this paper, we study joint channel and power allocation to improve the energy efficiency of user equipments. To solve the problem efficiently, we introduce an iterative combinatorial auction algorithm, where the D2D users are considered as bidders that compete for channel resources, and the cellular network is treated as the auctioneer. We also analyze important properties of D2D underlay communication, and present numerical simulations to verify the proposed algorithm.Comment: IEEE Transactions on Wireless Communication

Optimum Power Allocation for Cooperative Communications

Cooperative communication is a new class of wireless communication techniques in which wireless nodes help each other relay information and realize spatial diversity advantages in a distributed manner. This new transmission technique promises significant performance gains in terms of link reliability, spectral efficiency, system capacity, and transmission range. Analysis and design of cooperative communication wireless systems have been extensively studied over the last few years. The introduction and integration of cooperative communication in next generation wireless standards will lead to the design of an efficient and reliable fully-distributed wireless network. However, there are various technical challenges and open issues to be resolved before this promising concept becomes an integral part of the modern wireless communication devices. A common assumption in the literature on cooperative communications is the equal distribution of power among the cooperating nodes. Optimum power allocation is a key technique to realize the full potentials of relay-assisted transmission promised by the recent information-theoretic results. In this dissertation, we present a comprehensive framework for power allocation problem. We investigate the error rate performance of cooperative communication systems and further devise open-loop optimum power allocation schemes to optimize the performance. By exploiting the information about the location of cooperating nodes, we are able to demonstrate significant improvements in the system performance. In the first part of this dissertation, we consider single-relay systems with amplify-and-forward relaying. We derive upper bounds for bit error rate performance assuming various cooperation protocols and minimize them under total power constraint. In the second part, we consider a multi-relay network with decode-and-forward relaying. We propose a simple relay selection scheme for this multi-relay system to improve the throughput of the system, further optimize its performance through power allocation. Finally, we consider a multi-source multi-relay broadband cooperative network. We derive and optimize approximate symbol error rate of this OFDMA (orthogonal frequency division multiple access) system

Distributed radio resource management in LTE-advanced networks with type 1 relay

Long Term Evolution (LTE)-Advanced is proposed as a candidate of the 4th generation (4G) mobile telecommunication systems. As an evolved version of LTE, LTE- Advanced is also based on Orthogonal Frequency Division Multiplexing (OFDM) and in addition, it adopts some emerging technologies, such as relaying. Type I relay nodes, de_ned in LTE-Advanced standards, can control their cells with their own reference signals and have Radio Resource Management (RRM) functionalities. The rationale of RRM is to decide which resources are allocated to which users for optimising performance metrics, such as throughput, fairness, power consumption and Quality of Service (QoS). The RRM techniques in LTE-Advanced networks, including route selection, resource partitioning and resource scheduling, are facing new challenges brought by Type 1 relay nodes and increasingly becoming research focuses in recent years. The research work presented in this thesis has made the following contributions. A service-aware adaptive bidirectional optimisation route selection strategy is proposed to consider both uplink optimisation and downlink optimisation according to service type. The load between di_erent serving nodes, including eNBs and relay nodes, are rebalanced under the _xed resource partitioning. The simulation results show that larger uplink throughputs and bidirectional throughputs can be achieved, compared with existing route selection strategies. A distributed two-hop proportional fair resource allocation scheme is proposed in order to provide better two-hop end-to-end proportional fairness for all the User Equipments (UEs), especially for the relay UEs. The resource partitioning is based on the cases of none Frequency Reuse (FR) pattern, full FR pattern and partial FR patterns. The resource scheduling in access links and backhaul links are considered jointly. A proportional fair joint route selection and resource partitioning algorithm isproposed to obtain an improved solution to the two-hop Adaptive Partial Frequency Reusing (APFR) problem with one relay node per cell. In addition, two special situations of APFR, full FR and no FR, are utilised to narrow the iterative search range of the proposed algorithm and reduce its complexity