466 research outputs found
Maximizing Expected Achievable Rates for Block-Fading Buffer-Aided Relay Channels
© 2002-2012 IEEE. In this paper, the long-term average achievable rate over block-fading buffer-aided relay channels is maximized using a hybrid scheme that combines three essential transmission strategies, which are decode-and-forward, compress-and-forward, and direct transmission. The proposed hybrid scheme is dynamically adapted based on the channel state information. The integration and optimization of these three strategies provide a more generic and fundamental solution and give better achievable rates than the known schemes in the literature. Despite the large number of optimization variables, the proposed hybrid scheme can be optimized using simple closed-form formulas that are easy to apply in practical relay systems. This includes adjusting the transmission rate and compression when compress-and-forward is the selected strategy based on the channel conditions. Furthermore, in this paper, the hybrid scheme is applied to three different models of the Gaussian block-fading buffer-aided relay channels, depending on whether the relay is half or full duplex and whether the source and the relay have orthogonal or non-orthogonal channel access. Several numerical examples are provided to demonstrate the achievable rate results and compare them to the upper bounds of the ergodic capacity for each one of the three channel models under consideration
Buffer-Aided Relaying with Adaptive Link Selection - Fixed and Mixed Rate Transmission
We consider a simple network consisting of a source, a half-duplex DF relay
with a buffer, and a destination. We assume that the direct source-destination
link is not available and all links undergo fading. We propose two new
buffer-aided relaying schemes. In the first scheme, neither the source nor the
relay have CSIT, and consequently, both nodes are forced to transmit with fixed
rates. In contrast, in the second scheme, the source does not have CSIT and
transmits with fixed rate but the relay has CSIT and adapts its transmission
rate accordingly. In the absence of delay constraints, for both fixed rate and
mixed rate transmission, we derive the throughput-optimal buffer-aided relaying
protocols which select either the source or the relay for transmission based on
the instantaneous SNRs of the source-relay and the relay-destination links. In
addition, for the delay constrained case, we develop buffer-aided relaying
protocols that achieve a predefined average delay. Compared to conventional
relaying protocols, which select the transmitting node according to a
predefined schedule independent of the link instantaneous SNRs, the proposed
buffer-aided protocols with adaptive link selection achieve large performance
gains. In particular, for fixed rate transmission, we show that the proposed
protocol achieves a diversity gain of two as long as an average delay of more
than three time slots can be afforded. Furthermore, for mixed rate transmission
with an average delay of time slots, a multiplexing gain of
is achieved. Hence, for mixed rate transmission, for
sufficiently large average delays, buffer-aided half-duplex relaying with and
without adaptive link selection does not suffer from a multiplexing gain loss
compared to full-duplex relaying.Comment: IEEE Transactions on Information Theory. (Published
Buffer-Aided Relaying with Adaptive Link Selection
In this paper, we consider a simple network consisting of a source, a
half-duplex decode-and-forward relay, and a destination. We propose a new
relaying protocol employing adaptive link selection, i.e., in any given time
slot, based on the channel state information of the source-relay and the
relay-destination link a decision is made whether the source or the relay
transmits. In order to avoid data loss at the relay, adaptive link selection
requires the relay to be equipped with a buffer such that data can be queued
until the relay-destination link is selected for transmission. We study both
delay constrained and delay unconstrained transmission. For the delay
unconstrained case, we characterize the optimal link selection policy, derive
the corresponding throughput, and develop an optimal power allocation scheme.
For the delay constrained case, we propose to starve the buffer of the relay by
choosing the decision threshold of the link selection policy smaller than the
optimal one and derive a corresponding upper bound on the average delay.
Furthermore, we propose a modified link selection protocol which avoids buffer
overflow by limiting the queue size. Our analytical and numerical results show
that buffer-aided relaying with adaptive link selection achieves significant
throughput gains compared to conventional relaying protocols with and without
buffers where the relay employs a fixed schedule for reception and
transmission.Comment: IEEE Journal on Selected Areas in Communications; Special Issue on
Theories and Methods for Advanced Wireless Relay
Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey
This paper provides a comprehensive review of the domain of physical layer
security in multiuser wireless networks. The essential premise of
physical-layer security is to enable the exchange of confidential messages over
a wireless medium in the presence of unauthorized eavesdroppers without relying
on higher-layer encryption. This can be achieved primarily in two ways: without
the need for a secret key by intelligently designing transmit coding
strategies, or by exploiting the wireless communication medium to develop
secret keys over public channels. The survey begins with an overview of the
foundations dating back to the pioneering work of Shannon and Wyner on
information-theoretic security. We then describe the evolution of secure
transmission strategies from point-to-point channels to multiple-antenna
systems, followed by generalizations to multiuser broadcast, multiple-access,
interference, and relay networks. Secret-key generation and establishment
protocols based on physical layer mechanisms are subsequently covered.
Approaches for secrecy based on channel coding design are then examined, along
with a description of inter-disciplinary approaches based on game theory and
stochastic geometry. The associated problem of physical-layer message
authentication is also introduced briefly. The survey concludes with
observations on potential research directions in this area.Comment: 23 pages, 10 figures, 303 refs. arXiv admin note: text overlap with
arXiv:1303.1609 by other authors. IEEE Communications Surveys and Tutorials,
201
Achievable Rates of Buffer-Aided Full-Duplex Gaussian Relay Channels
We derive closed-form expressions for the achievable rates of a buffer-aided full-duplex (FD) multiple-input multiple-output Gaussian relay channel. The FD relay still suffers from residual self-interference (RSI) after the application of self-interference mitigation techniques. We investigate both cases of a slow-RSI channel where the RSI is fixed over the entire codeword, and a fast-RSI channel where the RSI changes from one symbol duration to another within the codeword. We show that the RSI can be completely eliminated in the slow-RSI case when the FD relay is equipped with a buffer while the fast RSI cannot be eliminated. For the fixed-rate data transmission scenario, we derive the optimal transmission strategy that should be adopted by the source node and relay node to maximize the system throughput. We verify our analytical findings through simulations. 1 2017 IEEE.The work of N. Al-Dhahir was supported by NPRP from the Qatar National Research Fund (a member of Qatar Foundation) under Grant 8-627-2-260. The statements made herein are solely the responsibility of the authors. The work of I. Krikidis was supported by the Research Promotion Foundation, Cyprus, through the Project COM-MED under Project KOINA/ERANETMED/1114/03.Scopu
Full-duplex wireless communications: challenges, solutions and future research directions
The family of conventional half-duplex (HD) wireless systems relied on transmitting and receiving in different time-slots or frequency sub-bands. Hence the wireless research community aspires to conceive full-duplex (FD) operation for supporting concurrent transmission and reception in a single time/frequency channel, which would improve the attainable spectral efficiency by a factor of two. The main challenge encountered in implementing an FD wireless device is the large power difference between the self-interference (SI) imposed by the device’s own transmissions and the signal of interest received from a remote source. In this survey, we present a comprehensive list of the potential FD techniques and highlight their pros and cons. We classify the SI cancellation techniques into three categories, namely passive suppression, analog cancellation and digital cancellation, with the advantages and disadvantages of each technique compared. Specifically, we analyse the main impairments (e.g. phase noise, power amplifier nonlinearity as well as in-phase and quadrature-phase (I/Q) imbalance, etc.) that degrading the SI cancellation. We then discuss the FD based Media Access Control (MAC)-layer protocol design for the sake of addressing some of the critical issues, such as the problem of hidden terminals, the resultant end-to-end delay and the high packet loss ratio (PLR) due to network congestion. After elaborating on a variety of physical/MAC-layer techniques, we discuss potential solutions conceived for meeting the challenges imposed by the aforementioned techniques. Furthermore, we also discuss a range of critical issues related to the implementation, performance enhancement and optimization of FD systems, including important topics such as hybrid FD/HD scheme, optimal relay selection and optimal power allocation, etc. Finally, a variety of new directions and open problems associated with FD technology are pointed out. Our hope is that this treatise will stimulate future research efforts in the emerging field of FD communication
Study on Generalized Buffer-State-Based Relay Selection in Cooperative Cognitive Radio Networks
学位の種別: 修士University of Tokyo(東京大学
Exploiting UAV as NOMA based relay for coverage extension
Unmanned aerial vehicles (UAVs) aided communication
has acquired research interest in many civilian and
military applications. The use of UAV as base stations and as
aerial relays to improve coverage of existing cellular networks is prevalent in current literature. Along with this, a few studies have proposed the use of non-orthogonal multiple access (NOMA) in UAV communications. In this paper, we propose a network where a ground user and an aerial UAV relay is accessed using NOMA, where the UAV acts as decode-and-forward (DF) relay to extend the coverage of source. The performance of the proposed
model is shown by evaluating outage behaviour for different
transmit power and fading environments with Monte Carlo
simulations. System throughput of proposed network appears to be better than orthogonal multiple access (OMA) based equivalent network. The results show that with an adequate height of the UAV NOMA based relay, quality of service (QoS) of cell edge user is satisfactory
- …