418 research outputs found
Outage Performance of Two-Hop OFDM Systems with Spatially Random Decode-and-Forward Relays
In this paper, we analyze the outage performance of different multicarrier
relay selection schemes for two-hop orthogonal frequency-division multiplexing
(OFDM) systems in a Poisson field of relays. In particular, special emphasis is
placed on decode-and-forward (DF) relay systems, equipped with bulk and
per-subcarrier selection schemes, respectively. The exact expressions for
outage probability are derived in integrals for general cases. In addition,
asymptotic expressions for outage probability in the high signal-to-noise ratio
(SNR) region in the finite circle relay distribution region are determined in
closed forms for both relay selection schemes. Also, the outage probabilities
for free space in the infinite relay distribution region are derived in closed
forms. Meanwhile, a series of important properties related to cooperative
systems in random networks are investigated, including diversity, outage
probability ratio of two selection schemes and optimization of the number of
subcarriers in terms of system throughput. All analysis is numerically verified
by simulations. Finally, a framework for analyzing the outage performance of
OFDM systems with spatially random relays is constructed, which can be easily
modified to analyze other similar cases with different forwarding protocols,
location distributions and/or channel conditions
Resource Allocation for Secure Gaussian Parallel Relay Channels with Finite-Length Coding and Discrete Constellations
We investigate the transmission of a secret message from Alice to Bob in the
presence of an eavesdropper (Eve) and many of decode-and-forward relay nodes.
Each link comprises a set of parallel channels, modeling for example an
orthogonal frequency division multiplexing transmission. We consider the impact
of discrete constellations and finite-length coding, defining an achievable
secrecy rate under a constraint on the equivocation rate at Eve. Then we
propose a power and channel allocation algorithm that maximizes the achievable
secrecy rate by resorting to two coupled Gale-Shapley algorithms for stable
matching problem. We consider the scenarios of both full and partial channel
state information at Alice. In the latter case, we only guarantee an outage
secrecy rate, i.e., the rate of a message that remains secret with a given
probability. Numerical results are provided for Rayleigh fading channels in
terms of average outage secrecy rate, showing that practical schemes achieve a
performance quite close to that of ideal ones
Weighted Sum Rate Maximization for Downlink OFDMA with Subcarrier-pair based Opportunistic DF Relaying
This paper addresses a weighted sum rate (WSR) maximization problem for
downlink OFDMA aided by a decode-and-forward (DF) relay under a total power
constraint. A novel subcarrier-pair based opportunistic DF relaying protocol is
proposed. Specifically, user message bits are transmitted in two time slots. A
subcarrier in the first slot can be paired with a subcarrier in the second slot
for the DF relay-aided transmission to a user. In particular, the source and
the relay can transmit simultaneously to implement beamforming at the
subcarrier in the second slot. Each unpaired subcarrier in either the first or
second slot is used for the source's direct transmission to a user. A benchmark
protocol, same as the proposed one except that the transmit beamforming is not
used for the relay-aided transmission, is also considered. For each protocol, a
polynomial-complexity algorithm is developed to find at least an approximately
optimum resource allocation (RA), by using continuous relaxation, the dual
method, and Hungarian algorithm. Instrumental to the algorithm design is an
elegant definition of optimization variables, motivated by the idea of
regarding the unpaired subcarriers as virtual subcarrier pairs in the direct
transmission mode. The effectiveness of the RA algorithm and the impact of
relay position and total power on the protocols' performance are illustrated by
numerical experiments. The proposed protocol always leads to a maximum WSR
equal to or greater than that for the benchmark one, and the performance gain
of using the proposed one is significant especially when the relay is in close
proximity to the source and the total power is low. Theoretical analysis is
presented to interpret these observations.Comment: 8 figures, accepted and to be published in IEEE Transactions on
Signal Processing. arXiv admin note: text overlap with arXiv:1301.293
Enhancing Physical Layer Security in AF Relay Assisted Multi-Carrier Wireless Transmission
In this paper, we study the physical layer security (PLS) problem in the dual
hop orthogonal frequency division multiplexing (OFDM) based wireless
communication system. First, we consider a single user single relay system and
study a joint power optimization problem at the source and relay subject to
individual power constraint at the two nodes. The aim is to maximize the end to
end secrecy rate with optimal power allocation over different sub-carriers.
Later, we consider a more general multi-user multi-relay scenario. Under high
SNR approximation for end to end secrecy rate, an optimization problem is
formulated to jointly optimize power allocation at the BS, the relay selection,
sub-carrier assignment to users and the power loading at each of the relaying
node. The target is to maximize the overall security of the system subject to
independent power budget limits at each transmitting node and the OFDMA based
exclusive sub-carrier allocation constraints. A joint optimization solution is
obtained through duality theory. Dual decomposition allows to exploit convex
optimization techniques to find the power loading at the source and relay
nodes. Further, an optimization for power loading at relaying nodes along with
relay selection and sub carrier assignment for the fixed power allocation at
the BS is also studied. Lastly, a sub-optimal scheme that explores joint power
allocation at all transmitting nodes for the fixed subcarrier allocation and
relay assignment is investigated. Finally, simulation results are presented to
validate the performance of the proposed schemes.Comment: 10 pages, 7 figures, accepted in Transactions on Emerging
Telecommunications Technologies (ETT), formerly known as European
Transactions on Telecommunications (ETT
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
Resource Management in Multicarrier Based Cognitive Radio Systems
The ever-increasing growth of the wireless application and services affirms the importance of the effective usage of the limited radio spectrum. Existing spectrum management policies have led to significant spectrum under-utilization. Recent measurements showed that large range of the spectrum is sparsely used in both temporal and spatial manner. This conflict
between the inefficient usage of the spectrum and the continuous evolution in the wireless communication calls upon the development of more flexible management policies. Cognitive radio (CR) with the dynamic spectrum access (DSA) is considered to be a key technology in making the best solution of this conflict by allowing a group of secondary users (SUs) to share the radio spectrum originally allocated to the primary user (PUs). The operation of CR should not negatively alter the performance of the PUs. Therefore, the interference control along with the highly dynamic nature of PUs activities open up new resource allocation problems in CR systems. The resource allocation algorithms should ensure an effective share of the temporarily available frequency bands and deliver the solutions in timely fashion to cope with quick changes in the network.
In this dissertation, the resource management problem in multicarrier based CR systems is considered. The dissertation focuses on three main issues: 1) design of efficient resource allocation algorithms to allocate subcarriers and powers between SUs such that no harmful interference is introduced to PUs, 2) compare the spectral efficiency of using different multicarrier schemes in the CR physical layer, specifically, orthogonal frequency division multiplexing (OFDM) and filter bank multicarrier (FBMC) schemes, 3) investigate the impact of the different constraints values on the overall performance of the CR system.
Three different scenarios are considered in this dissertation, namely downlink transmission, uplink transmission, and relayed transmission. For every scenario, the optimal solution is examined and efficient sub-optimal algorithms are proposed to reduce the computational burden of obtaining the optimal solution. The suboptimal algorithms are developed by separate the subcarrier and power allocation into two steps in downlink and uplink scenarios. In the relayed scenario, dual decomposition technique is used to obtain an asymptotically optimal solution, and a joint heuristic algorithm is proposed to find the suboptimal solution. Numerical simulations show that the proposed suboptimal algorithms achieve a near optimal performance and perform better than the existing algorithms designed for cognitive and non-cognitive systems. Eventually, the ability of FBMC to overcome the OFDM drawbacks and achieve more spectral efficiency is verified which recommends the consideration of FBMC in the future CR systems.El crecimiento continuo de las aplicaciones y servicios en sistemas inal´ambricos, indica la
importancia y necesidad de una utilizaci´on eficaz del espectro radio. Las pol´ıticas actuales de
gesti´on del espectro han conducido a una infrautilizaci´on del propio espectro radioel´ectrico.
Recientes mediciones en diferentes entornos han mostrado que gran parte del espectro queda
poco utilizado en sus ambas vertientes, la temporal, y la espacial. El permanente conflicto
entre el uso ineficiente del espectro y la evoluci´on continua de los sistemas de comunicaci´on
inal´ambrica, hace que sea urgente y necesario el desarrollo de esquemas de gesti´on del espectro
m´as flexibles.
Se considera el acceso din´amico (DSA) al espectro en los sistemas cognitivos como una
tecnolog´ıa clave para resolver este conflicto al permitir que un grupo de usuarios secundarios
(SUs) puedan compartir y acceder al espectro asignado inicialmente a uno o varios usuarios
primarios (PUs). Las operaciones de comunicaci´on llevadas a cabo por los sistemas radio
cognitivos no deben en ning´un caso alterar (interferir) los sistemas primarios. Por tanto, el
control de la interferencia junto al gran dinamismo de los sistemas primarios implica nuevos
retos en el control y asignaci´on de los recursos radio en los sistemas de comunicaci´on CR. Los
algoritmos de gesti´on y asignaci´on de recursos (Radio Resource Management-RRM) deben
garantizar una participaci´on efectiva de las bandas con frecuencias disponibles temporalmente,
y ofrecer en cada momento oportunas soluciones para hacer frente a los distintos cambios
r´apidos que influyen en la misma red.
En esta tesis doctoral, se analiza el problema de la gesti´on de los recursos radio en sistemas
multiportadoras CR, proponiendo varias soluciones para su uso eficaz y coexistencia con los
PUs. La tesis en s´ı, se centra en tres l´ıneas principales: 1) el dise˜no de algoritmos eficientes de gesti´on de recursos para la asignaci´on de sub-portadoras y distribuci´on de la potencia en
sistemas segundarios, evitando asi cualquier interferencia que pueda ser perjudicial para el
funcionamiento normal de los usuarios de la red primaria, 2) analizar y comparar la eficiencia
espectral alcanzada a la hora de utilizar diferentes esquema de transmisi´on multiportadora en
la capa f´ısica del sistema CR, espec´ıficamente en sistemas basados en OFDM y los basados en
banco de filtros multiportadoras (Filter bank Multicarrier-FBMC), 3) investigar el impacto de
las diferentes limitaciones en el rendimiento total del sistema de CR.
Los escenarios considerados en esta tesis son tres, es decir; modo de transmisi´on
descendente (downlink), modo de transmisi´on ascendente (uplink), y el modo de transmisi´on
”Relay”. En cada escenario, la soluci´on ´optima es examinada y comparada con algoritmos sub-
´optimos que tienen como objetivo principal reducir la carga computacional. Los algoritmos
sub-´optimos son llevados a cabo en dos fases mediante la separaci´on del propio proceso de
distribuci´on de subportadoras y la asignaci´on de la potencia en los modos de comunicaci´on
descendente (downlink), y ascendente (uplink). Para los entornos de tipo ”Relay”, se ha
utilizado la t´ecnica de doble descomposici´on (dual decomposition) para obtener una soluci´on
asint´oticamente ´optima. Adem´as, se ha desarrollado un algoritmo heur´ıstico para poder obtener
la soluci´on ´optima con un reducido coste computacional.
Los resultados obtenidos mediante simulaciones num´ericas muestran que los algoritmos
sub-´optimos desarrollados logran acercarse a la soluci´on ´optima en cada uno de los entornos
analizados, logrando as´ı un mayor rendimiento que los ya existentes y utilizados tanto en
entornos cognitivos como no-cognitivos. Se puede comprobar en varios resultados obtenidos
en la tesis la superioridad del esquema multiportadora FBMC sobre los sistemas basados en
OFDM para los entornos cognitivos, causando una menor interferencia que el OFDM en
los sistemas primarios, y logrando una mayor eficiencia espectral. Finalmente, en base a lo
analizado en esta tesis, podemos recomendar al esquema multiportadora FBMC como una
id´onea y potente forma de comunicaci´on para las futuras redes cognitivas
Power Allocation in Two-Hop Amplify-and-Forward MIMO Relay Systems with QoS requirements
The problem of minimizing the total power consumption while satisfying
different quality-of-service (QoS) requirements in a two-hop multiple-input
multiple-output network with a single non-regenerative relay is considered. As
shown by Y. Rong in [1], the optimal processing matrices for both linear and
non-linear transceiver architectures lead to the diagonalization of the
source-relay-destination channel so that the power minimization problem reduces
to properly allocating the available power over the established links.
Unfortunately, finding the solution of this problem is numerically difficult as
it is not in a convex form. To overcome this difficulty, existing solutions
rely on the computation of upper- and lower-bounds that are hard to obtain or
require the relaxation of the QoS constraints. In this work, a novel approach
is devised for both linear and non-linear transceiver architectures, which
allows to closely approximate the solutions of the non-convex power allocation
problems with those of convex ones easy to compute in closed-form by means of
multi-step procedures of reduced complexity. Computer simulations are used to
assess the performance of the proposed approach and to make comparisons with
alternatives
- …