Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userDecentralized Two-Hop Opportunistic Relaying With Limited Channel State Information
292
0
0.0
(
0
)
Added by
Shengshan Cui
Publication date
2008
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
A network consisting of $n$ source-destination pairs and $m$ relays is considered. Focusing on the large system limit (large $n$), the throughput scaling laws of two-hop relaying protocols are studied for Rayleigh fading channels. It is shown that, under the practical constraints of single-user encoding-decoding scheme, and partial channel state information (CSI) at the transmitters (via integer-value feedback from the receivers), the maximal throughput scales as $log n$ even if full relay cooperation is allowed. Furthermore, a novel decentralized opportunistic relaying scheme with receiver CSI, partial transmitter CSI, and no relay cooperation, is shown to achieve the optimal throughput scaling law of $log n$.
rate research
Read More
Relay networks having $n$ source-to-destination pairs and $m$ half-duplex relays, all operating in the same frequency band in the presence of block fading, are analyzed. This setup has attracted significant attention and several relaying protocols have been reported in the literature. However, most of the proposed solutions require either centrally coordinated scheduling or detailed channel state information (CSI) at the transmitter side. Here, an opportunistic relaying scheme is proposed, which alleviates these limitations. The scheme entails a two-hop communication protocol, in which sources communicate with destinations only through half-duplex relays. The key idea is to schedule at each hop only a subset of nodes that can benefit from emph{multiuser diversity}. To select the source and destination nodes for each hop, it requires only CSI at receivers (relays for the first hop, and destination nodes for the second hop) and an integer-value CSI feedback to the transmitters. For the case when $n$ is large and $m$ is fixed, it is shown that the proposed scheme achieves a system throughput of $m/2$ bits/s/Hz. In contrast, the information-theoretic upper bound of $(m/2)log log n$ bits/s/Hz is achievable only with more demanding CSI assumptions and cooperation between the relays. Furthermore, it is shown that, under the condition that the product of block duration and system bandwidth scales faster than $log n$, the achievable throughput of the proposed scheme scales as $Theta ({log n})$. Notably, this is proven to be the optimal throughput scaling even if centralized scheduling is allowed, thus proving the optimality of the proposed scheme in the scaling law sense.
We consider the opportunistic multiuser diversity in the multiuser two-way amplify-and-forward (AF) relay channel. The relay, equipped with multiple antennas and a simple zero-forcing beam-forming scheme, selects a set of two way relaying user pairs to enhance the degree of freedom (DoF) and consequently the sum throughput of the system. The proposed channel aligned pair scheduling (CAPS) algorithm reduces the inter-pair interference and keeps the signal to interference plus noise power ratio (SINR) of user pairs relatively interference free in average sense when the number of user pairs become very large. For ideal situations, where the number of user pairs grows faster than the system signal to noise ratio (SNR), the DoF of $M$ per channel use can be achieved when $M$ is the relay antenna size. With a limited number of pairs, the system is overloaded and the sum rates saturate at high signal to noise ratio (SNR) though modifications of CAPS can improve the performance to a certain amount. The performance of CAPS can be further enhanced by semi-orthogonal channel aligned pair scheduling (SCAPS) algorithm, which not only aligns the pair channels but also forms semi-orthogonal inter-pair channels. Simulation results show that we provide a set of approaches based on (S)CAPS and modified (S)CAPS, which provides system performance benefit depending on the SNR and the number of user pairs in the network.
This paper presents an analytical investigation on the outage performance of dual-hop multiple antenna amplify-and-forward relaying systems in the presence of interference. For both the fixed-gain and variable-gain relaying schemes, exact analytical expressions for the outage probability of the systems are derived. Moreover, simple outage probability approximations at the high signal to noise ratio regime are provided, and the diversity order achieved by the systems are characterized. Our results suggest that variable-gain relaying systems always outperform the corresponding fixed-gain relaying systems. In addition, the fixed-gain relaying schemes only achieve diversity order of one, while the achievable diversity order of the variable-gain relaying scheme depends on the location of the multiple antennas.
We consider the two-receiver memoryless broadcast channel with states where each receiver requests both common and private messages, and may know part of the private message requested by the other receiver as receiver message side information (RMSI). We address two categories of the channel (i) channel with states known causally to the transmitter, and (ii) channel with states known non-causally to the transmitter. Starting with the channel without RMSI, we first propose a transmission scheme and derive an inner bound for the causal category. We then unify our inner bound for the causal category and the best-known inner bound for the non-causal category, although their transmission schemes are different. Moving on to the channel with RMSI, we first apply a pre-coding to the transmission schemes of the causal and non-causal categories without RMSI. We then derive a unified inner bound as a result of having a unified inner bound when there is no RMSI, and applying the same pre-coding to both categories. We show that our inner bound is tight for some new cases as well as the cases whose capacity region was known previously.
We analyze a secure two-hop mixed radio frequency (RF) and underwater wireless optical communication (UWOC) system using a fixed-gain amplify-and-forward (AF) relay. The UWOC channel is modeled using a unified mixture exponential-generalized Gamma distribution to consider the combined effects of air bubbles and temperature gradients on transmission characteristics. Both legitimate and eavesdropping RF channels are modeled using flexible $alpha-mu$ distributions. Specifically, we first derive both the probability density function (PDF) and cumulative distribution function (CDF) of the received signal-to-noise ratio (SNR) of the mixed RF and UWOC system. Based on the PDF and CDF expressions, we derive the closed-form expressions for the tight lower bound of the secrecy outage probability (SOP) and the probability of non-zero secrecy capacity (PNZ), which are both expressed in terms bivariate Foxs $H$-function. To utilize these analytical expressions, we derive asymptotic expressions of SOP and PNZ using only elementary functions. Also, we use asymptotic expressions to determine the optimal transmitting power to maximize energy efficiency. Further, we thoroughly investigate the effect of levels of air bubbles and temperature gradients in the UWOC channel, and study nonlinear characteristics of the transmission medium and the number of multipath clusters of the RF channel on the secrecy performance. Finally, all analyses are validated using Monte Carlo simulation.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
