Theoretical contributions for generalized scenarios of wireless channels

Orientador: Michel Daoud YacoubTese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de ComputaçãoResumo: Recentemente, três novos modelos probabilísticos de canal, modelos a-u, ?-u e ?-u, foram propostos com o intuito de prover uma análise mais realística do sinal propagante. Por apresentarem um grau de liberdade a mais que os demais já existentes na literatura, um melhor ajuste a medidas de campo verificou-se com a utilização dos mesmos. Esta tese provê uma caracterização estatística para estes modelos de desvanecimento generalizados. Tal caracterização engloba tanto estatísticas de primeira como de segunda ordem. Aproximações simples e precisas para a soma de variáveis e processos aleatórios são propostas. Inúmeras métricas de desempenho em ambientes com e sem diversidade na recepção são investigadas de forma exata e aproximada. Dentre estas, podemos citar: probabilidade de outage, taxa de erro de bit, capacidade de canal, taxa de cruzamento de nível, duração média de desvanecimento, dentre outras. Além disso, mostra-se também qual das distribuições generalizadas melhor aproxima a soma de variáveis e processos Nakagami-m, uma vez que todas incluem Nakagami-m como caso especial. Finalmente, expressões exatas e aproximadas para a taxa de cruzamento de nível de canaisWeibull correlacionados e não idênticos em receptores multirramos são apresentadasAbstract: Recently, three new channel models, a-u, ?-u and ?-u, were proposed with the aim to provide a more realistic analysis of the propagate signal. Due to they have one degree of freedom more than those already existing in the literature, a better adjust to field measurement data was attested with their use. This thesis deals with the statistical characterization of these generalized fading models. Such a characterization includes both first and second order statistics. Simple and precise approximations to the sum of random variables and processes are proposed. Several performance metrics in scenarios with and without diversity are investigated in an exact and approximate manner. Among them, we may cite: outage probability, bit error probability, channel capacity, level crossing rate, average fade duration, such others. Furthermore, it is shown what is the generalized distribution that better approximate the sum of Nakagami-m variates and processes, once that all of them include Nakagami-m as special case. Finally, exact and approximate expressions for the crossing rates of non-identical correlated Weibull channels in multibranch receivers are presented.DoutoradoTelecomunicações e TelemáticaDoutor em Engenharia Elétric

Hybrid User Pairing for Spectral and Energy Efficiencies in Multiuser MISO-NOMA Networks with SWIPT

In this paper, we propose a novel hybrid user pairing (HUP) scheme in multiuser multiple-input single-output nonorthogonal multiple access networks with simultaneous wireless information and power transfer. In this system, two information users with distinct channel conditions are optimally paired while energy users perform energy harvesting (EH) under non-linearity of the EH circuits. We consider the problem of jointly optimizing user pairing and power allocation to maximize the overall spectral efficiency (SE) and energy efficiency (EE) subject to userspecific quality-of-service and harvested power requirements. A new paradigm for the EE-EH trade-off is then proposed to achieve a good balance of network power consumption. Such design problems are formulated as the maximization of nonconcave functions subject to the class of mixed-integer non-convex constraints, which are very challenging to solve optimally. To address these challenges, we first relax binary pairing variables to be continuous and transform the design problems into equivalent non-convex ones, but with more tractable forms. We then develop low-complexity iterative algorithms to improve the objectives and converge to a local optimum by means of the inner approximation framework. Simulation results show the convergence of proposed algorithms and the SE and EE improvements of the proposed HUP scheme over state-of-the-art designs. In addition, the effects of key parameters such as the number of antennas and dynamic power at the BS, target data rates, and energy threshold, on the system performance are evaluated to show the effectiveness of the proposed schemes in balancing resource utilization

Adaptive time-switching based energy harvesting relaying protocols

Considering a dual-hop energy-harvesting (EH) relaying system, this paper advocates novel relaying protocols based on adaptive time-switching (TS) for amplify-and-forward and decode-and-forward modes, respectively. The optimal TS factor is first studied, which is adaptively adjusted based on the dual-hop channel state information (CSI), accumulated energy, and threshold signal-to-noise ratio (SNR), to achieve the maximum throughput efficiency per block. To reduce the CSI overhead at the EH relay, a low-complexity TS factor design is presented, which only needs single-hop CSI to determine the TS factor. Theoretical results show that, in comparison with the conventional solutions, the proposed optimal/low-complexity TS factor can achieve higher limiting throughput efficiency for sufficiently small threshold SNR. As the threshold SNR approaches infinity, the throughput efficiency of the proposed optimal/low-complexity TS factor tends to zero in a much slower pace than that of the conventional solutions. Simulation results are presented to corroborate the proposed methodology

Secrecy Enhancement of Multiuser MISO Networks Using OSTBC and Artificial Noise

In this paper, we propose a novel physical layer strategy to improve the secrecy performance of multiuser multiple-input single-output networks. In this strategy, orthogonal space-time block code (OSTBC) is employed at an AAantenna base station (BS) and artificial noise (AN) is employed at an AJ-antenna cooperative relay to enhance the security level of the network. Moreover, two opportunistic scheduling schemes, namely, selection combining (SC) and scan-and-wait combining (SWC), are leveraged to select one legitimate user for data transmission. To evaluate the secrecy performance of the proposed OSTBC-SC-AN and OSTBC-SWC-AN schemes, we derive new exact closed-form expressions for the secrecy outage probability and the effective secrecy throughput. Using numerical results, we show that the OSTBC-SWC-AN scheme outperforms the OSTBC-SC-AN scheme when the switching threshold is carefully chosen. We also show that increasing AA brings down the secrecy performance in the presence of a high switching threshold.ARC Discovery Projects Grant DP150103905