917 resultados para relay racing
Resumo:
We consider a wireless relay network with one source, one relay and one destination, where communications between nodes are preformed over N orthogonal channels. This, for example, is the case when orthogonal frequency division multiplexing is employed for data communications. Since the power available at the source and relay is limited, we study optimal power allocation strategies at the source and relay in order to maximize the overall source-destination capacity. Depending on the availability of the channel state information at both the source and relay or only at the relay, power allocation is performed at both the source and relay or only at the relay. Considering different setups for the problem, various optimization problems are formulated and solved. Some properties of the optimal solution are also proved.
Resumo:
We propose transmit antenna selection with receive generalized selection combining (TAS/GSC) in dual-hop cognitive decode-and-forward (DF) relay networks for reliability enhancement and interference relaxation. In this paradigm, a single antenna which maximizes the receive signal-to-noise ratio (SNR) is selected at the secondary transmitter and a subset of receive antennas with the highest SNRs are combined at the secondary receiver. To demonstrate the impact of multiple primary users on the cognitive relay network, we derive new closed-form expressions for the exact and asymptotic outage probability with TAS/GSC in the secondary network. Several important design insights are reached. We corroborate that the full diversity gain is achieved, which is entirely determined by the total number of antennas in the secondary network. The negative impact of the primary network on the secondary network is reflected in the SNR gain.
Resumo:
In this paper, we investigate a multiuser cognitive relay network with direct source-destination links and multiple primary destinations. In this network, multiple secondary users compete to communicate with a secondary destination assisted by an amplify-and-forward (AF) relay. We take into account the availability of direct links from the secondary users to the primary and secondary destinations. For the considered system, we select one best secondary user to maximize the received signal-to-noise ratio (SNR) at the secondary destination. We first derive an accurate lower bound of the outage probability, and then provide an asymptotic expression of outage probability in high SNR region. From the lower bound and the asymptotic expressions, we obtain several insights into the system design. Numerical and simulation results are finally demonstrated to verify the proposed studies.
Resumo:
We propose transmit antenna selection (TAS) in decode-and-forward (DF) relaying as an effective approach to reduce the interference in underlay spectrum sharing networks with multiple primary users (PUs) and multiple antennas at the secondary users (SUs). We compare two distinct protocols: 1) TAS with receiver maximal-ratio combining (TAS/MRC) and 2) TAS with receiver selection combining (TAS/SC). For each protocol, we derive new closed-form expressions for the exact and asymptotic outage probability with independent Nakagami-m fading in the primary and secondary networks. Our results are valid for two scenarios related to the maximum SU transmit power, i.e., P, and the peak PU interference temperature, i.e., Q. When P is proportional to Q, our results confirm that TAS/MRC and TAS/SC relaying achieve the same full diversity gain. As such, the signal-to-noise ratio (SNR) advantage of TAS/MRC relaying relative to TAS/SC relaying is characterized as a simple ratio of their respective SNR gains. When P is independent of Q, we find that an outage floor is obtained in the large P regime where the SU transmit power is constrained by a fixed value of Q. This outage floor is accurately characterized by our exact and asymptotic results.
Resumo:
We consider the problem of secure transmission in two-hop amplify-and-forward untrusted relay networks. We analyze the ergodic secrecy capacity (ESC) and present compact expressions for the ESC in the high signal-to-noise ratio regime. We also examine the impact of large scale antenna arrays at either the source or the destination. For large antenna arrays at the source, we confirm that the ESC is solely determined by the channel between the relay and the destination. For very large antenna arrays at the destination, we confirm that the ESC is solely determined by the channel between the source and the relay.
Resumo:
In this paper, we propose a multiuser cognitive relay network, where multiple secondary sources communicate with a secondary destination through the assistance of a secondary relay in the presence of secondary direct links and multiple primary receivers. We consider the two relaying protocols of amplify-and-forward (AF) and decode-and-forward (DF), and take into account the availability of direct links from the secondary sources to the secondary destination. With this in mind, we propose an optimal solution for cognitive multiuser scheduling by selecting the optimal secondary source, which maximizes the received signal-to-noise ratio (SNR) at the secondary destination using maximal ratio combining. This is done by taking into account both the direct link and the relay link in the multiuser selection criterion. For both AF and DF relaying protocols, we first derive closed-form expressions for the outage probability and then provide the asymptotic outage probability, which determines the diversity behavior of the multiuser cognitive relay network. Finally, this paper is corroborated by representative numerical examples.
Resumo:
In this paper, we propose physical layer security for cooperative cognitive radio networks (CCRNs) with relay selection in the presence of multiple primary users and multiple eavesdroppers. To be specific, we propose three relay selection schemes, namely, opportunistic relay selection (ORS), suboptimal relay selection (SoRS), and partial relay selection (PRS) for secured CCRNs, which are based on the availability of channel state information (CSI) at the receivers. For each approach, we derive exact and asymptotic expressions for the secrecy outage probability. Results show that under the assumption of perfect CSI, ORS outperforms both SoRS and PRS.