Robust Transmissions in Wireless Powered Multi-Relay Networks with Chance Interference Constraints

In this paper, we consider a wireless powered multi-relay network in which a multi-antenna hybrid access point underlaying a cellular system transmits information to distant receivers. Multiple relays capable of energy harvesting are deployed in the network to assist the information transmission. The hybrid access point can wirelessly supply energy to the relays, achieving multi-user gains from signal and energy cooperation. We propose a joint optimization for signal beamforming of the hybrid access point as well as wireless energy harvesting and collaborative beamforming strategies of the relays. The objective is to maximize network throughput subject to probabilistic interference constraints at the cellular user equipment. We formulate the throughput maximization with both the time-switching and power-splitting schemes, which impose very different couplings between the operating parameters for wireless power and information transfer. Although the optimization problems are inherently non-convex, they share similar structural properties that can be leveraged for efficient algorithm design. In particular, by exploiting monotonicity in the throughput, we maximize it iteratively via customized polyblock approximation with reduced complexity. The numerical results show that the proposed algorithms can achieve close to optimal performance in terms of the energy efficiency and throughput.Comment: 14 pages, 8 figure

무선 중계 네트워크에서 신호대잡음비의 누적분포함수 기반 중계기 선택 기법의 성능 분석

학위논문 (박사)-- 서울대학교 대학원 : 전기·컴퓨터공학부, 2015. 8. 이재홍.무선 중계 기술은 차세대 무선통신 시스템에서 요구되는 높은 서비스 품질 및 데이터 전송률 달성을 위해 고려되고 있는 대표적인 기술 중 하나이다. 무선 중계 기술이 갖고 있는 다양한 장점으로 인해 현재까지 IEEE 802.16j 및 3GPP LTE-Advanced 등의 무선통신 시스템 표준에 반영되기도 하였다. 실질적으로 두 노드 사이 채널의 통계적 특성은 그들의 위치에 따라 달라지기 때문에 각 채널들의 통계적 특성은 서로 동일하지 않다. 각 채널들의 통계적 특성이 동일하지 않을 때, 무선 중계 기술에서 가장 유용한 기법 중 하나인 중계기 선택 기법은 특정 중계기들이 더 자주 선택되는 등의 공정성 문제를 유발시킬 수 있다. 특히, 이 문제는 제한된 배터리를 가진 중계기들로 구성된 네트워크에서 네트워크의 수명을 줄이게 하는 요인이 될 수 있다. 따라서 이러한 네트워크에서는 사용자들의 통신 신뢰도 뿐만 아니라, 중계기에서의 선택 공정성도 함께 고려할 필요가 있다. 본 논문에서는 무선 중계 네트워크에서 사용자들의 통신 신뢰도와 중계기 간의 선택 공정성을 함께 고려하기 위해 수신 신호대잡음비의 누적분포함수를 기반으로 하는 새로운 중계기 선택 기법을 제안한다. 주요한 연구 결과는 다음과 같다. 먼저, 나카가미-m 페이딩 채널 환경을 가진 일방향 중계 네트워크를 위한 프로액티브(proactive) 및 리액티브(reactive) 방식의 수신 신호대잡음비 누적분포함수 기반 중계기 선택 기법을 제안한다. 각각의 중계기 선택 기법을 위해 중계기 선택 확률을 유도하여 제안된 각 중계기 선택 기법들의 평균 중계기 공정성을 분석한다. 또한 각 선택 기법에 대한 불능 확률을 수식으로 유도하고, 유도한 불능 확률을 점근적 표현으로 나타내어 각 기법들이 얻을 수 있는 다이버시티 차수를 분석한다. 모의실험을 통해 얻어진 평균 중계기 공정성과 불능 확률이 유도한 평균 중계기 공정성 및 불능 확률 값과 일치함을 확인한다. 그리고 제안된 기법이 중계기들 사이에 공정성을 완벽하게 보장하고 네트워크 수명을 증가시키며, 다이버시티 차수가 중계기의 수와 페이딩 파라미터 m 값에 따라 달라짐을 확인한다. 둘째, 나카가미-m 페이딩 채널 환경을 가진 양방향 중계 네트워크를 위한 프로액티브 및 리액티브 방식의 수신 신호대잡음비 누적분포함수 기반 중계기 선택 기법을 제안한다. 제안된 프로액티브 방식의 중계기 선택 기법에 대해서는 정확한 중계기 선택 확률의 유도를 통해 평균 중계기 공정성을 분석한다. 제안된 리액티브 방식의 중계기 선택 기법에 대해서는 중계기 선택 확률의 적분 및 근사 표현을 유도하여 평균 중계기 공정성을 분석한다. 또한 각 선택 기법에 대한 불능 확률을 수식으로 유도하고, 유도한 불능 확률을 점근적 표현으로 나타내어 각 기법들이 얻을 수 있는 다이버시티 차수를 분석한다. 모의실험을 통해 얻어진 평균 중계기 공정성과 불능 확률이 유도한 평균 중계기 공정성 및 불능 확률 값과 일치함을 확인한다. 그리고 제안된 기법이 중계기들 사이에 공정성을 완벽하게 보장하고 네트워크 수명을 증가시키며, 다이버시티 차수가 중계기의 수와 페이딩 파라미터 m 값에 따라 달라짐을 확인한다.Wireless relay technology is one of the most promising technologies for the future communication systems which provide coverage extension and better quality of service (QoS) such as higher data rate and lower outage probability with few excessive network loads. Due to its advantages, it has been adopted in wireless standards such as IEEE 802.16j and 3GPP LTE-Advanced. In practice, since statistics of the channel between any two nodes vary depending on their locations, they are not identical which means that channels can experience different fading. When statistics of the channel are not identical, relay selection, which is one of the most useful techniques for wireless relay technology, can cause fairness problem that particular relays are selected more frequently than other relays. Especially, this problem can cause reduction of lifetime in the network with multiple relays having limited battery power. In this network, it is needed to focus on selection fairness for relays as well as reliability at end-users. In this dissertation, to focus on both selection fairness for relays and reliability at end-users, we propose novel relay selection schemes based on cumulative distribution functions (CDFs) of signal-to-noise ratios (SNRs) in wireless relay networks. The dissertation consists of two main results. First, we propose the proactive and the reactive relay selection schemes based on CDFs of SNRs for one-way relay networks over Nakagami-m fading channels. If a relay is selected before the source transmission, it is called as proactive relay selection. Otherwise, if a relay is selected after the source transmission, it is called as reactive relay selection. For both the proactive and the reactive relay selection schemes, we analyze average relay fairness by deriving relay selection probability. For the proactive relay selection scheme, we obtain diversity order by deriving the integral and asymptotic expressions for outage probability. Also, for the reactive relay selection scheme, we obtain diversity order by deriving the exact closed-form and asymptotic expressions for outage probability. Numerical results show that the analytical results of the proposed schemes match the simulation results well. It is shown that the proposed schemes guarantee strict fairness among relays and extend network lifetime. Also, it is shown that diversity order depends on the number of relays and fading severity parameters. Second, we propose the proactive and the reactive relay selection schemes based on CDFs of SNRs for two-way relay networks over Nakagami-m fading channels. For the proactive relay selection scheme, we analyze average relay fairness by deriving relay selection probability. Also, we analyze diversity order by deriving the integral and asymptotic expressions for outage probability. For the reactive relay selection scheme, we analyze average relay fairness by deriving the integral and asymptotic expressions for relay selection probability. Also, we obtain diversity order by deriving the asymptotic expression for outage probability. Numerical results show that the analytical results of the proposed schemes match the simulation results well. It is shown that the proposed schemes guarantee strict fairness among relays and extend network lifetime. Also, it is shown that diversity order depends on the number of relays and fading severity parameters.Contents Abstract i 1 Introduction 1 1.1 Background and Related Work . . . . . . . . . . . . . . . . . . . . . 2 1.1.1 Diversity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.1.2 Wireless Relay Technology . . . . . . . . . . . . . . . . . . . . 3 1.2 Outline of Dissertation . . . . . . . . . . . . . . . . . . . . . . . . . . 7 1.3 Notations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 2 Relay Selection Based on CDFs of SNRs for One-Way Relay Networks 14 2.1 System Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 2.1.1 Proactive CDF-Based Relay Selection . . . . . . . . . . . . . 19 2.1.2 Reactive CDF-Based Relay Selection . . . . . . . . . . . . . . 20 2.2 Performance Analysis of Proactive CDF-Based Relay Selection . . . . 22 2.2.1 Average Relay Fairness Analysis . . . . . . . . . . . . . . . . . 22 2.2.2 Outage Probability Analysis . . . . . . . . . . . . . . . . . . . 27 2.3 Performance Analysis of Reactive CDF-Based Relay Selection . . . . 34 2.3.1 Average Relay Fairness Analysis . . . . . . . . . . . . . . . . . 34 2.3.2 Outage Probability Analysis . . . . . . . . . . . . . . . . . . . 36 2.4 Numerical Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . 39 2.4.1 Average Relay Fairness . . . . . . . . . . . . . . . . . . . . . . 39 2.4.2 Network Lifetime . . . . . . . . . . . . . . . . . . . . . . . . . 48 2.4.3 Outage Probability . . . . . . . . . . . . . . . . . . . . . . . . 53 2.5 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 65 3 Relay Selection Based on CDFs of SNRs for Two-Way Relay Networks 66 3.1 System Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 67 3.1.1 Proactive CDF-based Relay Selection . . . . . . . . . . . . . . 68 3.1.2 Reactive CDF-based Relay Selection . . . . . . . . . . . . . . 72 3.2 Performance Analysis of Proactive CDF-Based Relay Selection . . . . 73 3.2.1 Average Relay Fairness Analysis . . . . . . . . . . . . . . . . . 73 3.2.2 Outage Probability Analysis . . . . . . . . . . . . . . . . . . . 74 3.3 Performance Analysis of Reactive CDF-Based Relay Selection . . . . 82 3.3.1 Average Relay Fairness Anlaysis . . . . . . . . . . . . . . . . . 82 3.3.2 Outage Probability Analysis . . . . . . . . . . . . . . . . . . . 86 3.4 Numerical Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . 88 3.4.1 Average Relay Fairness . . . . . . . . . . . . . . . . . . . . . . 89 3.4.2 Network Lifetime . . . . . . . . . . . . . . . . . . . . . . . . . 100 3.4.3 Outage Probability . . . . . . . . . . . . . . . . . . . . . . . . 105 3.5 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 115 4 Conclusion 116 4.1 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 116 4.2 Possible Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . 118 4.2.1 Device-to-Device (D2D) Communications . . . . . . . . . . . 118 4.2.2 Low Power Body Sensor Networks . . . . . . . . . . . . . . . 120 4.3 Future Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 121 Bibliography 122 Korean Abstract 139Docto

Cooperative strategies design based on the diversity and multiplexing tradeoff

This thesis focuses on designing wireless cooperative communication strategies that are either optimal or near-optimal in terms of the tradeoff between diversity and multiplexing gains. Starting from classical cooperative broadcast, multiple-access and relay channels with unit degree of freedom, to more general cooperative interference channels with higher degrees of freedom, properties of different network topologies are studied and their unique characteristics together with several advanced interference management techniques are exploited to design cooperative transmission strategies in order to enhance data rate, reliability or both at the same time. Moreover, various algorithms are proposed to solve practical implementation issues and performance is analyzed through both theoretical verifications and simulations

Power Allocation in Wireless Relay Networks

This thesis is mainly concerned with power allocation issues in wireless relay networks where a single or multiple relays assist transmission from a single or multiple sources to a destination. First, a network model with a single source and multiple relays is considered, in which both cases of orthogonal and non--orthogonal relaying are investigated. For the case of orthogonal relaying, two power allocation schemes corresponding to two partial channel state information (CSI) assumptions are proposed. Given the lack of full and perfect CSI, appropriate signal processing at the relays and/or destination is also developed. The performance behavior of the system with power allocation between the source and the relays is also analyzed. For the case of non-orthogonal relaying, it is demonstrated that optimal power allocation is not sufficiently effective. Instead, a relay beamforming scheme is proposed. A comprehensive comparison between the orthogonal relaying with power allocation scheme and the non-orthogonal relaying with beamforming scheme is then carried out, which reveals several interesting conclusions with respect to both error performance and system throughput. In the second part of the thesis, a network model with multiple sources and a single relay is considered. The transmission model is applicable for uplink channels in cellular mobile systems in which multiple mobile terminals communicate with the base station with the help of a single relay station. Single-carrier frequency division multiple access (SC-FDMA) technique with frequency domain equalization is adopted in order to avoid the amplification of the multiple access interference at the relay. Minimizing the transmit power at the relay and optimizing the fairness among the sources in terms of throughput are the two objectives considered in implementing power allocation schemes. The problems are visualized as water-filling and water-discharging models and two optimal power allocation schemes are proposed, accordingly. Finally, the last part of the thesis is extended to a network model with multiple sources and multiple relays. The orthogonal multiple access technique is employed in order to avoid multiple access interference. Proposed is a joint optimal beamforming and power allocation scheme in which an alternative optimization technique is applied to deal with the non-convexity of the power allocation problem. Furthermore, recognizing the high complexity and large overhead information exchange when the number of sources and relays increases, a relay selection scheme is proposed. Since each source is supported by at most one relay, the feedback information from the destination to each relay can be significantly reduced. Using an equal power allocation scheme, relay selection is still an NP-hard combinatorial optimization problem. Nevertheless, the proposed sub-optimal scheme yields a comparable performance with a much lower computational complexity and can be well suited for practical systems

Wireless optical backhauling for optical attocell networks

The backhaul of tens and hundreds of light fidelity (LiFi)-enabled luminaires constitutes a major challenge. The problem of backhauling for optical attocell networks has been approached by a number of wired solutions such as in-building power line communication (PLC), Ethernet and optical fiber. In this work, an alternative solution is proposed based on wireless optical communication in visible light (VL) and infrared (IR) bands. The proposed solution is thoroughly elaborated using a system level methodology. For a multi-user optical attocell network based on direct current biased optical orthogonal frequency division multiplexing (DCO-OFDM) and decode-and-forward (DF) relaying, detailed modeling and analysis of signal-to-interference-plus- noise (SINR) and end-to-end sum rate are presented, taking into account the effects of inter-backhaul and backhaul-to-access interferences. Inspired by concepts developed for radio frequency (RF) cellular networks, full-reuse visible light (FR-VL) and in-band visible light (IB-VL) bandwidth allocation policies are proposed to realize backhauling in the VL band. The transmission power is opportunistically minimized to enhance the backhaul power efficiency. For a two-tier FR-VL network, there is a technological challenge due to the limited capacity of the bottleneck backhaul link. The IR band is employed to add an extra degree of freedom for the backhaul capacity. For the IR backhaul system, a power-bandwidth tradeoff formulation is presented and closed form analytical expressions are derived for the corresponding power control coefficients. The sum rate performance of the network is studied using extensive Monte Carlo simulations. In addition, the effect of imperfect alignment in backhaul links is studied by using Monte Carlo simulation techniques. The emission semi-angle of backhaul LEDs is identified as a determining factor for the network performance. With the assumption that the access and backhaul systems share the same propagation medium, a large semi-angle of backhaul LEDs results in a substantial degradation in performance especially under FR-VL backhauling. However, it is shown both theoretically and by simulations that by choosing a sufficiently small semi-angle value, the adverse effect of the backhaul interference is entirely eliminated. By employing a narrow light beam in the back-haul system, the application of wireless optical backhauling is extended to multi-tier optical attocell networks. As a result of multi-hop backhauling with a tree topology, new challenges arise concerning optimal scheduling of finite bandwidth and power resources of the bottleneck backhaul link, i.e., optimal bandwidth sharing and opportunistic power minimization. To tackle the former challenge, optimal user-based and cell-based scheduling algorithms are developed. The latter challenge is addressed by introducing novel adaptive power control (APC) and fixed power control (FPC) schemes. The proposed bandwidth scheduling policies and power control schemes are supported by an analysis of their corresponding power control coefficients. Furthermore, another possible application of wireless optical backhauling for indoor networks is in downlink base station (BS) cooperation. More specifically, novel cooperative transmission schemes of non-orthogonal DF (NDF) and joint transmission with DF (JDF) in conjunction with fractional frequency reuse (FFR) partitioning are proposed for an optical attocell downlink. Their performance gains over baseline scenarios are assessed using Monte Carlo simulations

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

Adaptive relay techniques for OFDM-based cooperative communication systems

Cooperative communication has been considered as a cost-effective manner to exploit the spatial diversity, improve the quality-of-service and extend transmission coverage. However, there are many challenges faced by cooperative systems which use relays to forward signals to the destination, such as the accumulation of multipath channels, complex resource allocation with the bidirectional asymmetric traffic and reduction of transmission efficiency caused by additional relay overhead. In this thesis, we aim to address the above challenges of cooperative communications, and design the efficient relay systems. Starting with the channel accumulation problem in the amplify-and-forward relay system, we proposed two adaptive schemes for single/multiple-relay networks respectively. These schemes exploit an adaptive guard interval (GI) technique to cover the accumulated delay spread and enhance the transmission efficiency by limiting the overhead. The proposed GI scheme can be implemented without any extra control signal. Extending the adaptive GI scheme to multiple-relay systems, we propose a relay selection strategy which achieves the trade-off between the transmission reliability and overhead by considering both the channel gain and the accumulated delay spread. We then consider resource allocation problem in the two-way decode-and-forward relay system with asymmetric traffic loads. Two allocation algorithms are respectively investigated for time-division and frequency-division relay systems to maximize the end-to-end capacity of the two-way system under a capacity ratio constraint. For the frequency-division systems, a balanced end-to-end capacity is defined as the objective function which combines the requirements of maximizing the end-to-end capacity and achieving the capacity ratio. A suboptimal algorithm is proposed for the frequency-division systems which separates subcarrier allocation and time/power allocation. It can achieve the similar performance with the optimal one with reduced complexity. In order to further enhance the transmission reliability and maintaining low processing delay, we propose an equalize-and-forward (EF) relay scheme. The EF relay equalizes the channel between source and relay to eliminate the channel accumulation without signal regeneration. To reduce the processing time, an efficient parallel structure is applied in the EF relay. Numerical results show that the EF relay exhibits low outage probability at the same data rate as compared to AF and DF schemes