WorldWideScience

Sample records for half-duplex relay channel

  1. Capacity of the Degraded Half-Duplex Relay Channel

    CERN Document Server

    Vijayakumaran, Saravanan; Lok, Tat M

    2007-01-01

    A discrete memoryless half-duplex relay channel is constructed from a broadcast channel from the source to the relay and destination and a multiple access channel from the source and relay to the destination. When the relay listens, the channel operates in the broadcast mode. The channel switches to the multiple access mode when the relay transmits. If the broadcast component channel is physically degraded, the half-duplex relay channel will also be referred to as physically degraded. The capacity of this degraded half-duplex relay channel is examined. It is shown that the block Markov coding suggested in the seminal paper by Cover and El Gamal can be modified to achieve capacity for the degraded half-duplex relay channel. In the code construction, the listen-transmit schedule of the relay is made to depend on the message to be sent and hence the schedule carries information itself. If the schedule is restricted to be deterministic, it is shown that the capacity can be achieved by a simple management of infor...

  2. Achieving the capacity of half-duplex degraded relay channels using polar coding

    Institute of Scientific and Technical Information of China (English)

    Duo Bin; Wang Zhenyong; Gu Xuemai; Guo Qing

    2014-01-01

    In this paper, a novel transmission protocol based on polar coding is proposed for the half-duplex degraded relay channel. In the proposed protocol, referred to as the partial message relaying, the relay only needs to forward a part of the decoded source message that the destination needs according to the exquisite nested structure of polar codes. Theoretically, it is proved that the scheme can achieve the capacity of the half-duplex relay channel under the decode-and-forward (DF) cooperation strategy while enjoying low encoding/decoding complexity. Practically, in order to minimize the global transmission power, the optimization of the power allocation is performed between the source and the relay by using information theoretic tools. Furthermore, a joint iterative soft parallel interference cancellation receiver structure is developed to suit to the proposed scheme. Simulation results show that the proposed scheme outperforms the conventional scheme designed by low-density parity-check (LDPC) codes.

  3. The diversity-multiplexing tradeoff of the symmetric MIMO half-duplex relay channel

    CERN Document Server

    Karmakar, Sanjay

    2010-01-01

    The diversity-multiplexing tradeoff (DMT) is obtained for the symmetric MIMO half-duplex (HD) relay channel where the source and the destination have $n$ antennas each and the relay node has $m$ antennas (hereafter, such a channel is referred to as an $(n,m)$-relay channel). The characterization of the DMT requires the joint eigenvalue distribution of three specially correlated central Wishart random matrices, which is derived using a related result in [1], [2]. The explicit characterization of the DMT, besides providing the theoretical benchmark for evaluating performance of practical cooperative protocols on this channel, reveals several interesting facts such as: a) the HD operation of the relay fundamentally limits relay channel performance in the sense that the DMT of the full-duplex (FD) relay channel can be strictly greater than that of the HD relay channel; b) an extra antenna at the relay node on a HD relay channel does not always improve the achievable diversity order, unlike that on an FD relay cha...

  4. The Diversity Multiplexing Tradeoff of the MIMO Half-Duplex Relay Channel

    CERN Document Server

    Karmakar, Sanjay

    2011-01-01

    The fundamental diversity-multiplexing tradeoff of the three-node, multi-input, multi-output (MIMO), quasi-static, Rayleigh faded, half-duplex relay channel is characterized for an arbitrary number of antennas at each node and in which opportunistic scheduling (or dynamic operation) of the relay is allowed, i.e., the relay can switch between receive and transmit modes at a channel dependent time. In this most general case, the diversity-multiplexing tradeoff is characterized as a solution to a simple, two-variable optimization problem. This problem is then solved in closed form for special classes of channels defined by certain restrictions on the numbers of antennas at the three nodes. The key mathematical tool developed here that enables the explicit characterization of the diversity-multiplexing tradeoff is the joint eigenvalue distribution of three mutually correlated random Wishart matrices. Previously, without actually characterizing the diversity-multiplexing tradeoff, the optimality in this tradeoff m...

  5. Performance Analysis over Slow Fading Channels of a Half-Duplex Single-Relay Protocol: Decode or Quantize and Forward

    CERN Document Server

    Ksairi, Nassar; Bianchi, Pascal; Hachem, Walid

    2009-01-01

    In this work, a new static relaying protocol is introduced for half duplex single-relay networks, and its performance is studied in the context of communications over slow fading wireless channels. The proposed protocol is based on a Decode or Quantize and Forward (DoQF) approach. In slow fading scenarios, two performance metrics are relevant and complementary, namely the outage probability gain and the Diversity-Multiplexing Tradeoff (DMT). First, we analyze the behavior of the outage probability P_o associated with the proposed protocol as the SNR tends to infinity. In this case, we prove that SNR^2 P_o converges to a constant. We refer to this constant as the outage gain and we derive its closed-form expression for a general class of wireless channels that includes the Rayleigh and the Rice channels as particular cases. We furthermore prove that the DoQF protocol has the best achievable outage gain in the wide class of half-duplex static relaying protocols. A method for minimizing the outage gain with resp...

  6. A Proposed Chaotic-Switched Turbo Coding Design and Its Application for Half-Duplex Relay Channel

    Directory of Open Access Journals (Sweden)

    Tamer H. M. Soliman

    2015-01-01

    Full Text Available Both reliability and security are two important subjects in modern digital communications, each with a variety of subdisciplines. In this paper we introduce a new proposed secure turbo coding system which combines chaotic dynamics and turbo coding reliability together. As we utilize the chaotic maps as a tool for hiding and securing the coding design in turbo coding system, this proposed system model can provide both data secrecy and data reliability in one process to combat problems in an insecure and unreliable data channel link. To support our research, we provide different schemes to design a chaotic secure reliable turbo coding system which we call chaotic-switched turbo coding schemes. In these schemes the design of turbo codes chaotically changed depending on one or more chaotic maps. Extensions of these chaotic-switched turbo coding schemes to half-duplex relay systems are also described. Results of simulations of these new secure turbo coding schemes are compared to classical turbo codes with the same coding parameters and the proposed system is able to achieve secured reasonable bit error rate performance when it is made to switch between different puncturing and design configuration parameters especially with low switching rates.

  7. Protocols For Half-Duplex Multiple Relay Networks

    CERN Document Server

    Rost, P

    2007-01-01

    In this paper we present several strategies for multiple relay networks which are constrained by a half-duplex operation, i. e., each node either transmits or receives on a particular resource. Using the discrete memoryless multiple relay channel we present achievable rates for a multilevel partial decode-and-forward approach which generalizes previous results presented by Kramer and Khojastepour et al.. Furthermore, we derive a compress-and-forward approach using a regular encoding scheme which simplifies the encoding and decoding scheme and improves the achievable rates in general. Finally, we give achievable rates for a mixed strategy used in a four-terminal network with alternately transmitting relay nodes.

  8. Alternate transmission with half-duplex relaying in MIMO interference relay networks

    KAUST Repository

    Park, Seongho

    2013-12-01

    In this paper, we consider an alternate transmission scheme for a multiple-input multiple-output interference relay channel where multiple sources transmit their own signals to their corresponding destinations via one of two relaying groups alternately every time phase. Each of the relaying groups has arbitrary number of relays, and each relay operates in half-duplex amplify-and-forward mode. In our scheme, the received signals at the relay nodes consist of desired signals and two different interference signals such as the inter-source interferences and the inter-group interferences which are caused by the phase incoherence of relaying. As such, we propose an iterative interference alignment algorithm to mitigate the interferences. We show that our proposed scheme achieves additional degrees of freedom compared to the conventional half-duplex relaying system in the interference relay channels. © 2013 IEEE.

  9. Alternate transmission relaying based on interference alignment in 3-relay half-duplex MIMO systems

    KAUST Repository

    Park, Seongho

    2012-09-01

    In a half-duplex relaying, the capacity pre-log factor 1/2 is a major drawback in spectral efficiency. This paper proposes a linear precoding/decoding scheme and an alternate relaying protocol in a dual-hop half-duplex system where three relays help the communication between the source and the destination. In our proposed scheme, we consider a phase incoherent method in relays in which the source alternately transmits message signals to the different relays. In addition, we propose a linear interference alignment scheme which can suppress the inter-relay interference resulting from the phase incoherence of relaying. Based on our analysis of degrees of freedom and our simulation results, we show that our proposed scheme achieves additional degrees of freedom compared to the conventional half-duplex relaying. © 2012 IEEE.

  10. Interference alignment for degrees of freedom improvement in 3-relay half-duplex systems

    KAUST Repository

    Park, Seongho

    2011-12-01

    In a half-duplex relaying, the capacity pre-log factor is a major drawback in spectral efficiency. This paper proposes a linear precoding scheme and an alternate relaying protocol in a dual-hop half-duplex system where three relays help the communication between the source and the destination. In our proposed scheme, we consider a phase incoherent method in relays in which the source alternately transmits message signals to the different relays. In addition, we propose a linear interference alignment scheme which can eliminate the inter-relay interference resulted from the phase incoherence of relaying. Based on our analysis of degrees of freedom and our simulation results, we show that our proposed scheme achieves additional degrees of freedom compared to the conventional half-duplex relaying. © 2011 IEEE.

  11. Half-Duplex and Full-Duplex AF and DF Relaying with Energy-Harvesting in Log-Normal Fading

    KAUST Repository

    Rabie, Khaled M.

    2017-08-15

    Energy-harvesting (EH) and wireless power transfer in cooperative relaying networks have recently attracted a considerable amount of research attention. Most of the existing work on this topic however focuses on Rayleigh fading channels, which represent outdoor environments. In contrast, this paper is dedicated to analyze the performance of dual-hop relaying systems with EH over indoor channels characterized by log-normal fading. Both half-duplex (HD) and full-duplex (FD) relaying mechanisms are studied in this work with decode-and-forward (DF) and amplify-and-forward (AF) relaying protocols. In addition, three EH schemes are investigated, namely, time switching relaying, power splitting relaying and ideal relaying receiver which serves as a lower bound. The system performance is evaluated in terms of the ergodic outage probability for which we derive accurate analytical expressions. Monte Carlo simulations are provided throughout to validate the accuracy of our analysis. Results reveal that, in both HD and FD scenarios, AF relaying performs only slightly worse than DF relaying which can make the former a more efficient solution when the processing energy cost at the DF relay is taken into account. It is also shown that FD relaying systems can generally outperform HD relaying schemes as long as the loop-back interference in FD is relatively small. Furthermore, increasing the variance of the log-normal channel has shown to deteriorate the performance in all the relaying and EH protocols considered.

  12. Reliability Capacity of Half-Duplex Channels with Strict Deadlines

    DEFF Research Database (Denmark)

    Costa, Rui; Roetter, Daniel Enrique Lucani; Vinhoza, Tiago

    2015-01-01

    A fundamental characterization of a half-duplex wireless system with packet losses under traffic with hard deadlines is instrumental to understanding and developing efficient, coding aware policies for real-time applications. We set forth the concept of reliability capacity with a limited number...

  13. Reliability Capacity of Half-Duplex Channels with Strict Deadlines

    DEFF Research Database (Denmark)

    Costa, Rui; Roetter, Daniel Enrique Lucani; Vinhoza, Tiago;

    2015-01-01

    A fundamental characterization of a half-duplex wireless system with packet losses under traffic with hard deadlines is instrumental to understanding and developing efficient, coding aware policies for real-time applications. We set forth the concept of reliability capacity with a limited number...... and in terms of its advantages towards the mean number of packets that can be transmitted reliably. Optimal schemes for leveraging feedback are presented and the results show that a judicious use of even a single feedback packet can have a significant impact on the mean performance....

  14. Protocol design and stability/delay analysis of half-duplex buffered cognitive relay systems

    CERN Document Server

    Chen, Yan; Zhang, Shunqing; Qiu, Peiliang

    2010-01-01

    In this paper, we quantify the benefits of employing relay station in large-coverage cognitive radio systems which opportunistically access the licensed spectrum of some small-coverage primary systems scattered inside. Through analytical study, we show that even a simple decode-and-forward (SDF) relay, which can hold only one packet, offers significant path-loss gain in terms of the spatial transmission opportunities and link reliability. However, such scheme fails to capture the spatial-temporal burstiness of the primary activities, that is, when either the source-relay (SR) link or relay-destination (RD) link is blocked by the primary activities, the cognitive spectrum access has to stop. To overcome this obstacle, we further propose buffered decode-and-forward (BDF) protocol. By exploiting the infinitely long buffer at the relay, the blockage time on either SR or RD link is saved for cognitive spectrum access. The buffer gain is shown analytically to improve the stability region and average end-to-end dela...

  15. Diversity-Multiplexing Tradeoffs in MIMO Relay Channels

    CERN Document Server

    Gunduz, Deniz; Poor, H Vincent

    2008-01-01

    A multi-hop relay channel with multiple antenna terminals in a quasi-static slow fading environment is considered. For both full-duplex and half-duplex relays the fundamental diversity-multiplexing tradeoff (DMT) is analyzed. It is shown that, while decode-and-forward (DF) relaying achieves the optimal DMT in the full-duplex relay scenario, the dynamic decode-and-forward (DDF) protocol is needed to achieve the optimal DMT if the relay is constrained to half-duplex operation. For the latter case, static protocols are considered as well, and the corresponding achievable DMT performance is characterized.

  16. Half-Duplex Active Eavesdropping in Fast Fading Channels: A Block-Markov Wyner Secrecy Encoding Scheme

    CERN Document Server

    Amariucai, George T

    2010-01-01

    In this paper we study the problem of half-duplex active eavesdropping in fast fading channels. The active eavesdropper is a more powerful adversary than the classical eavesdropper. It can choose between two functional modes: eavesdropping the transmission between the legitimate parties (Ex mode), and jamming it (Jx mode) -- the active eavesdropper cannot function in full duplex mode. We consider a conservative scenario, when the active eavesdropper can choose its strategy based on the legitimate transmitter-receiver pair's strategy -- and thus the transmitter and legitimate receiver have to plan for the worst. We show that conventional physical-layer secrecy approaches perform poorly (if at all), and we introduce a novel encoding scheme, based on very limited and unsecured feedback -- the Block-Markov Wyner (BMW) encoding scheme -- which outperforms any schemes currently available.

  17. Power Allocation Strategies for Fixed-Gain Half-Duplex Amplify-and-Forward Relaying in Nakagami-m Fading

    KAUST Repository

    Zafar, Ammar

    2013-09-01

    In this paper, we study power allocation strategies for a fixed-gain amplify-and-forward relay network employing multiple relays. We consider two optimization problems for the relay network: 1) maximizing the end-to-end signalto- noise ratio (SNR) and 2) minimizing the total power consumption while maintaining the end-to-end SNR over a threshold value. We investigate these two problems for two relaying protocols of all-participate (AP) relaying and selective relaying and two cases of feedback to the relays, full and limited. We show that the SNR maximization problem is concave and the power minimization problem is convex for all protocols and feedback cases considered. We obtain closed-form expressions for the two problems in the case of full feedback and solve the problems through convex programming for limited feedback. Numerical results show the benefit of having full feedback at the relays for both optimization problems. However, they also show that feedback overhead can be reduced by having only limited feedback to the relays with only a small degradation in performance.

  18. Hybrid Transmission Scheme for MIMO Relay Channels

    Directory of Open Access Journals (Sweden)

    Guangming Xu

    2009-11-01

    Full Text Available To improve the achievable rate for the MIMO channels, we propose a hybrid transmission (HT scheme that mixes half-duplex decode-and-forward cooperative relaying transmission (DFRH)with direct transmission (DT. In the HT scheme, the source message is divided into two parts: one is transmitted by DFRH scheme and another is transmitted by DT scheme. Precoding and decoding are considered to convert the original MIMO relay channel into several parallel subchannels so that resource allocation can be easily performed. We focus on the spatial subchannel and power allocation problem. The objective of this problem is to maximize the total achievable rate under the constraints of joint total transmission power. Simulation results show that significant capacity gain can be achieved by the HT scheme compared to the DT scheme and the pure DFRH scheme.

  19. Distributed Antenna Channels with Regenerative Relaying: Relay Selection and Asymptotic Capacity

    Directory of Open Access Journals (Sweden)

    Aitor del Coso

    2007-11-01

    Full Text Available Multiple-input-multiple-output (MIMO techniques have been widely proposed as a means to improve capacity and reliability of wireless channels, and have become the most promising technology for next generation networks. However, their practical deployment in current wireless devices is severely affected by antenna correlation, which reduces their impact on performance. One approach to solve this limitation is relaying diversity. In relay channels, a set of N wireless nodes aids a source-destination communication by relaying the source data, thus creating a distributed antenna array with uncorrelated path gains. In this paper, we study this multiple relay channel (MRC following a decode-and-forward (D&F strategy (i.e., regenerative forwarding, and derive its achievable rate under AWGN. A half-duplex constraint on relays is assumed, as well as distributed channel knowledge at both transmitter and receiver sides of the communication. For this channel, we obtain the optimum relay selection algorithm and the optimum power allocation within the network so that the transmission rate is maximized. Likewise, we bound the ergodic performance of the achievable rate and derive its asymptotic behavior in the number of relays. Results show that the achievable rate of regenerative MRC grows as the logarithm of the Lambert W function of the total number of relays, that is, 𝒞=log⁡2(W0(N. Therefore, D&F relaying, cannot achieve the capacity of actual MISO channels.

  20. Distributed Antenna Channels with Regenerative Relaying: Relay Selection and Asymptotic Capacity

    Directory of Open Access Journals (Sweden)

    del Coso Aitor

    2007-01-01

    Full Text Available Multiple-input-multiple-output (MIMO techniques have been widely proposed as a means to improve capacity and reliability of wireless channels, and have become the most promising technology for next generation networks. However, their practical deployment in current wireless devices is severely affected by antenna correlation, which reduces their impact on performance. One approach to solve this limitation is relaying diversity. In relay channels, a set of wireless nodes aids a source-destination communication by relaying the source data, thus creating a distributed antenna array with uncorrelated path gains. In this paper, we study this multiple relay channel (MRC following a decode-and-forward (D&F strategy (i.e., regenerative forwarding, and derive its achievable rate under AWGN. A half-duplex constraint on relays is assumed, as well as distributed channel knowledge at both transmitter and receiver sides of the communication. For this channel, we obtain the optimum relay selection algorithm and the optimum power allocation within the network so that the transmission rate is maximized. Likewise, we bound the ergodic performance of the achievable rate and derive its asymptotic behavior in the number of relays. Results show that the achievable rate of regenerative MRC grows as the logarithm of the Lambert W function of the total number of relays, that is, . Therefore, D&F relaying, cannot achieve the capacity of actual MISO channels.

  1. Multistage Relaying Using Interference Networks

    CERN Document Server

    Muthuramalingam, Bama; Thangaraj, Andrew

    2010-01-01

    Wireless networks with multiple nodes that relay information from a source to a destination are expected to be deployed in many applications. Therefore, understanding their design and performance under practical constraints is important. In this work, we propose and study three multihopping decode and forward (MDF) protocols for multistage half-duplex relay networks with no direct link between the source and destination nodes. In all three protocols, we assume no cooperation across relay nodes for encoding and decoding. Numerical evaluation in illustrative example networks and comparison with cheap relay cut-set bounds for half-duplex networks show that the proposed MDF protocols approach capacity in some ranges of channel gains. The main idea in the design of the protocols is the use of coding in interference networks that are created in different states or modes of a half-duplex network. Our results suggest that multistage half-duplex relaying with practical constraints on cooperation is comparable to point...

  2. Simple Low-Rate Non-Binary LDPC Coding for Relay Channels

    CERN Document Server

    Suthisopapan, Puripong; Meesomboon, Anupap; Imtawil, Virasit; Sakaniwa, Kohichi

    2011-01-01

    Binary LDPC coded relay systems have been well studied previously with the assumption of infinite codeword length. In this paper, we deal with non-binary LDPC codes which can outperform their binary counterpart especially for practical codeword length. We utilize non-binary LDPC codes and recently invented non-binary coding techniques known as multiplicative repetition to design the low-rate coding strategy for the decode-and-forward half-duplex relay channel. We claim that the proposed strategy is simple since the destination and the relay can decode with almost the same computational complexity by sharing the same structure of decoder. Numerical experiments are carried out to show that the performances obtained by non-binary LDPC coded relay systems surpass the capacity of direct transmission and also approach within less than 1.5 dB from the achievable rate of the relay channels.

  3. Cooperation schemes for rate enhancement in detect-and-forward relay channels

    KAUST Repository

    Benjillali, Mustapha

    2010-05-01

    To improve the spectral efficiency of "Detect-and-Forward" (DetF) half-duplex relaying in fading channels, we propose a cooperation scheme where the relay uses a modulation whose order is higher than the one at the source. In a new common framework, we show that the proposed scheme offers considerable gains - in terms of achievable information rates - compared to the conventional DetF relaying schemes for both orthogonal and non-orthogonal source/relay cooperation. This allows us to propose an adaptive cooperation scheme based on the maximization of the information rate at the destination which needs to observe only the average signal-to-noise ratios of direct and relaying links. ©2010 IEEE.

  4. Interleaving Gains for Receive Diversity Schemes of Distributed Turbo Codes in Wireless Half–Duplex Relay Channels

    Directory of Open Access Journals (Sweden)

    Tamer H. M. Soliman

    2015-06-01

    Full Text Available This paper proposes the interleaving gain in two different distributed turbo-coding schemes: Distributed Turbo Codes (DTC and Distributed Multiple Turbo Codes (DMTC for half-duplex relay system as an extension of our previous work on turbo coding interleaver design for direct communication channel. For these schemes with half-duplex constraint, the source node transmits its information with the parity bit sequence(s to both the relay and the destination nodes during the first phase. The relay received the data from the source and process it by using decode and forward protocol. For the second transmission period, the decoded systematic data at relay is interleaved and re-encoded by a Recursive Systematic Convolutional (RSC encoder and forwarded to the destination. At destination node, the signals received from the source and relay are processed by using turbo log-MAP iterative decoding for retrieving the original information bits. We demonstrate via simulations that the interleaving gain has a large effect with DTC scheme when we use only one RSC encoder at both the source and relay with best performance when using Modified Matched S-Random (MMSR interleaver. Furthermore, by designing a Chaotic Pseudo Random Interleaver (CPRI as an outer interleaver at the source node instead of classical interleavers, our scheme can add more secure channel conditions.

  5. Opportunistic relaying in multipath and slow fading channel: Relay selection and optimal relay selection period

    KAUST Repository

    Sungjoon Park,

    2011-11-01

    In this paper we present opportunistic relay communication strategies of decode and forward relaying. The channel that we are considering includes pathloss, shadowing, and fast fading effects. We find a simple outage probability formula for opportunistic relaying in the channel, and validate the results by comparing it with the exact outage probability. Also, we suggest a new relay selection algorithm that incorporates shadowing. We consider a protocol of broadcasting the channel gain of the previously selected relay. This saves resources in slow fading channel by reducing collisions in relay selection. We further investigate the optimal relay selection period to maximize the throughput while avoiding selection overhead. © 2011 IEEE.

  6. A New Scaling Law on Throughput and Delay Performance of Wireless Mobile Relay Networks over Parallel Fading Channels

    CERN Document Server

    Wang, Rui; Huang, Kaibin

    2009-01-01

    In this paper, utilizing the relay buffers, we propose an opportunistic decode-wait-and-forward relay scheme for a point-to-point communication system with a half-duplexing relay network to better exploit the time diversity and relay mobility. For instance, we analyze the asymptotic throughput-delay tradeoffs in a dense relay network for two scenarios: (1) fixed relays with \\textit{microscopic fading} channels (multipath channels), and (2) mobile relays with \\textit{macroscopic fading} channels (path loss). In the first scenario, the proposed scheme can better exploit the \\textit{multi-relay diversity} in the sense that with $K$ fixed relays and a cost of $\\mathcal{O}(K)$ average end-to-end packet delay, it could achieve the same optimal asymptotic average throughput as the existing designs (such as regular decode-and-forward relay schemes) with $K^2$ fixed relays. In the second scenario, the proposed scheme achieves the maximum throughput of $\\Theta(\\log K)$ at a cost of $\\mathcal{O}(K/q)$ average end-to-end...

  7. Diversity-Multiplexing Tradeoff in the Multiaccess Relay Channel with Finite Block Length

    CERN Document Server

    Lee, Chung-Pi

    2011-01-01

    The Dynamic Decode-and-Forward (DDF) protocol and the Hybrid DDF and Amplified-and-Forward (HDAF) protocol for the multiple-access relay channel (MARC) with quasi static fading are evaluated using the Zheng-Tse diversity-multiplexing tradeoff (DMT). We assume that there are two users, one half-duplex relay, and a common destination, each equipped with single antenna. For the Rayleigh fading, the DDF protocol is well known and has been analyzed in terms of the DMT with infinite block length. By carefully dealing with properties specific to finite block length, we characterize the finite block length DMT which takes into account the fact that the event of decoding error at the relay causes the degradation in error performance when the block length is finite. Furthermore, we consider the situation where the destination does not have a priori knowledge of the relay decision time at which the relay switches from listening to transmitting. By introducing a decision rejection criterion such that the relay forwards m...

  8. Efficient Cooperative Protocols for Full-Duplex Relaying over Nakagami-m Fading Channels

    KAUST Repository

    Khafagy, Mohammad Galal

    2015-02-24

    In this work, efficient protocols are studied for full-duplex relaying (FDR) with loopback interference over Nakagami-m block fading channels. Recently, a selective decodeand- forward (DF) protocol was proposed for FDR, and was shown to outperform existing protocols in terms of outage over Rayleigh-fading channels. In this work, we propose an incremental selective DF protocol that offers additional power savings, yet yields the same outage performance. We evaluate their outage performance over independent non-identically distributed Nakagami-m fading links, and study their relative performance in terms of the signal-to-noise ratio cumulative distribution function via closed-form expressions. The offered diversity gain is also derived. In addition, we study their performance relative to their half-duplex counterparts, as well as known non-selective FDR protocols. We corroborate our theoretical results with simulation, and confirm that selective cooperation protocols outperform the known non-selective protocols in terms of outage. Finally, we show that depending on the loopback interference level, the proposed protocols can outperform their half-duplex counterparts when high spectral efficiencies are targeted.

  9. Secrecy in Cooperative Relay Broadcast Channels

    CERN Document Server

    Ekrem, E

    2008-01-01

    We investigate the effects of user cooperation on the secrecy of broadcast channels by considering a cooperative relay broadcast channel. We show that user cooperation can increase the achievable secrecy region. We propose an achievable scheme that combines Marton's coding scheme for broadcast channels and Cover and El Gamal's compress-and-forward scheme for relay channels. We derive outer bounds for the rate-equivocation region using auxiliary random variables for single-letterization. Finally, we consider a Gaussian channel and show that both users can have positive secrecy rates, which is not possible for scalar Gaussian broadcast channels without cooperation.

  10. Diversity of MIMO Multihop Relay Channels

    CERN Document Server

    Yang, Sheng

    2007-01-01

    We consider slow fading relay channels with a single multi-antenna source-destination terminal pair. The source signal arrives at the destination via N hops through N-1 layers of relays. We analyze the diversity of such channels with fixed network size at high SNR. In the clustered case where the relays within the same layer can have full cooperation, the cooperative decode-and-forward (DF) scheme is shown to be optimal in terms of the diversity-multiplexing tradeoff (DMT). The upper bound on the DMT, the cut-set bound, is attained. In the non-clustered case, we show that the naive amplify-and-forward (AF) scheme has the maximum multiplexing gain of the channel but is suboptimal in diversity, as compared to the cut-set bound. To improve the diversity, space-time relay processing is introduced through the parallel partition of the multihop channel. The idea is to let the source signal go through K different "AF paths" in the multihop channel. This parallel AF scheme creates a parallel channel in the time domai...

  11. DMT of Multi-hop Cooperative Networks - Part II: Half-Duplex Networks with Full-Duplex Performance

    CERN Document Server

    Sreeram, K; Kumar, P Vijay

    2008-01-01

    We consider single-source single-sink (ss-ss) multi-hop relay networks, with slow-fading links and single-antenna half-duplex relay nodes. In a companion paper, we established some basic results which laid the foundation for the results presented here. In the present paper, we consider two families of networks of half-duplex networks. KPP networks may be viewed as the union of K node-disjoint parallel relaying paths. Generalizations of these networks include KPP(I) networks, which permit interference between paths and KPP(D) networks, which possess a direct link between source and sink. We characterize the DMT of these families of networks completely and show that they can achieve the cut-set bound, thus proving that full-duplex performance can be obtained even in the presence of the half-duplex constraint. We then consider layered networks, and prove that a linear DMT between maximum diversity and maximum multiplexing gain is achievable. All protocols in this paper are explicit and use only amplify-and-forwa...

  12. Partial Decode-Forward Binning Schemes for the Causal Cognitive Relay Channels

    CERN Document Server

    Wu, Zhuohua

    2011-01-01

    The causal cognitive relay channel (CRC) has two sender-receiver pairs, in which the second sender obtains information from the first sender causally and assists the transmission of both senders. In this paper, we study both the full- and half-duplex modes. In each mode, we propose two new coding schemes built successively upon one another to illustrate the impact of different coding techniques. The first scheme called \\emph{partial decode-forward binning} (PDF-binning) combines the ideas of partial decode-forward relaying and Gelfand-Pinsker binning. The second scheme called \\emph{Han-Kobayashi partial decode-forward binning} (HK-PDF-binning) combines PDF-binning with Han-Kobayashi coding by further splitting rates and applying superposition coding, conditional binning and relaxed joint decoding. In both schemes, the second sender decodes a part of the message from the first sender, then uses Gelfand-Pinsker binning technique to bin against the decoded message, but in such a way that allows both state nullif...

  13. Amplify-and-forward relaying in wireless communications

    CERN Document Server

    Rodriguez, Leonardo Jimenez; Le-Ngoc, Tho

    2015-01-01

    This SpringerBrief explores the advantage of relaying techniques in addressing the increasing demand for high data rates and reliable services over the air. It demonstrates how to design cost-effective relay systems that provide high spectral efficiency and fully exploit the diversity of the relay channel. The brief covers advances in achievable rates, power allocation schemes, and error performance for half-duplex (HD) and full-duplex (FD) amplify-and-forward (AF) single-relay systems. The authors discuss the capacity and respective optimal power allocation for a wide range of HD protocols ov

  14. Broadcast classical-quantum capacity region of two-phase bidirectional relaying channels

    Energy Technology Data Exchange (ETDEWEB)

    Boche, Holger; Cai, Minglai; Deppe, Christian [Technische Universitaet Muenchen, Fakultaet fuer Elektrotechnik und Informationstechnik, Lehrstuhl fuer Theoretische Informationstechnik (Germany)

    2014-07-01

    The transmission of quantum states over long distances is essential for future applications such as quantum networks. The direct transmission is limited by unavoidable losses of the channel. A promising alternative for long distance quantum states distribution is the use of quantum repeaters. We analyze a quantum repeater protocol which takes advantage of bidirectional communication. We consider a three-node quantum network which enables bidirectional communication between two nodes with a half-duplex relay node. The message m{sub 2} element of M{sub 2} is located at node 1 and the message m{sub 1} element of M{sub 1} is located at node 2, respectively. Our goal is that the message m{sub 2} element of M{sub 2} is known at node 2 and the message m{sub 1} element of M{sub 1} is known at node 1, respectively. We simplify the problem by assuming an a priori separation of the communication into two phases. The capacity of the first phase (MAC) is known. We determine the capacity region of the second phase (broadcast).

  15. Reliable quantum communication over a quantum relay channel

    Energy Technology Data Exchange (ETDEWEB)

    Gyongyosi, Laszlo, E-mail: gyongyosi@hit.bme.hu [Quantum Technologies Laboratory, Department of Telecommunications, Budapest University of Technology and Economics, 2 Magyar tudosok krt, Budapest, H-1117, Hungary and Information Systems Research Group, Mathematics and Natural Sciences, Hungarian Ac (Hungary); Imre, Sandor [Quantum Technologies Laboratory, Department of Telecommunications, Budapest University of Technology and Economics, 2 Magyar tudosok krt, Budapest, H-1117 (Hungary)

    2014-12-04

    We show that reliable quantum communication over an unreliable quantum relay channels is possible. The coding scheme combines the results on the superadditivity of quantum channels and the efficient quantum coding approaches.

  16. Incremental Relaying for the Gaussian Interference Channel with a Degraded Broadcasting Relay

    CERN Document Server

    Zhou, Lei

    2011-01-01

    This paper studies a two-user Gaussian interference channel with an in-band-reception and out-of-band-transmission relay, where the link between the relay and the two receivers is modeled as a degraded broadcast channel. It is shown that %by using the Han-Kobayashi coding a generalized hash-and-forward (GHF) relaying strategy can achieve the capacity region of this channel to within a constant number of bits in a certain weak relay regime, where the transmitter-to-relay link gains are not unboundedly stronger than the interference links between the transmitters and the receivers. In such a regime, the GHF relaying strategy can be performed in an incremental fashion, where the relay message to one receiver is a degraded version of the message to the other receiver. A generalized-degree-of-freedom analysis reveals that in the symmetric channel setting, each common relay bit can improve the sum rate roughly by about one bit or two bits asymptotically, and the rate gain can be thought as coming solely from the im...

  17. Information-guided transmission in decode-and-forward relaying systems: Spatial exploitation and throughput enhancement

    KAUST Repository

    Yang, Yuli

    2011-07-01

    In addressing the issue of achieving high throughput in half-duplex relay channels, we exploit a concept of information-guided transmission for the network consisting of a source node, a destination node, and multiple half-duplex relay nodes. For further benefiting from multiple relay nodes, the relay-selection patterns are defined as the arbitrary combinations of given relay nodes. By exploiting the difference among the spatial channels states, in each relay-help transmission additional information to be forwarded is mapped onto the index of the active relay-selection pattern besides the basic information mapped onto the traditional constellation, which is forwarded by the relay node(s) in the active relay-selection pattern, so as to enhance the relay throughtput. With iterative decoding, the destination node can achieve a robust detection by decoupling the signals forwarded in different ways. We investigate the proposed scheme considering "decode-and-forward" protocol and establish its achievable transmission rate. The analytical results on capacity behaviors prove the efficiency of the proposed scheme by showing that it achieves better capacity performance than the conventional scheme. © 2011 IEEE.

  18. On the Capacity of the Noncausal Relay Channel

    CERN Document Server

    Wang, Lele

    2011-01-01

    This paper studies the noncausal relay channel, also known as the relay channel with unlimited lookahead, introduced by El Gamal, Hassanpour, and Mammen. Unlike the standard relay channel model, where the relay encodes its signal based on the previous received output symbols, the relay in the noncausal relay channel encodes its signal as a function of the entire received sequence. In the existing coding schemes, the relay uses this noncausal information solely to recover the transmitted message and then cooperates with the sender to communicate this message to the receiver. However, it is shown in this paper that by applying the Gelfand--Pinsker coding scheme, the relay can take further advantage of the noncausally available information, which can achieve strictly higher rates than existing coding schemes. This paper also provides a new upper bound on the capacity of the noncausal relay that strictly improves upon the cutset bound. These new lower and upper bounds on the capacity coincide for the class of deg...

  19. Achievable rate regions and outer bounds for a multi-pair bi-directional relay network

    CERN Document Server

    Kim, Sang Joon; Devroye, Natasha

    2010-01-01

    In a bi-directional relay channel, a pair of nodes wish to exchange independent messages over a shared wireless half-duplex channel with the help of relays. Recent work has mostly considered information theoretic limits of the bi-directional relay channel with two terminal nodes (or end users) and one relay. In this work we consider bi-directional relaying with one base station, multiple terminal nodes and one relay, all of which operate in half-duplex modes. We assume that each terminal node communicates with the base-station in a bi-directional fashion through the relay and do not place any restrictions on the channels between the users, relays and base-stations; that is, each node has a direct link with every other node. Our contributions are three-fold: 1) the introduction of four new temporal protocols which fully exploit the two-way nature of the data and outperform simple routing or multi-hop communication schemes by carefully combining network coding, random binning and user cooperation which exploit ...

  20. Secrecy Capacity of a Class of Orthogonal Relay Eavesdropper Channels

    Directory of Open Access Journals (Sweden)

    Aggarwal Vaneet

    2009-01-01

    Full Text Available The secrecy capacity of relay channels with orthogonal components is studied in the presence of an additional passive eavesdropper node. The relay and destination receive signals from the source on two orthogonal channels such that the destination also receives transmissions from the relay on its channel. The eavesdropper can overhear either one or both of the orthogonal channels. Inner and outer bounds on the secrecy capacity are developed for both the discrete memoryless and the Gaussian channel models. For the discrete memoryless case, the secrecy capacity is shown to be achieved by a partial decode-and-forward (PDF scheme when the eavesdropper can overhear only one of the two orthogonal channels. Two new outer bounds are presented for the Gaussian model using recent capacity results for a Gaussian multiantenna point-to-point channel with a multiantenna eavesdropper. The outer bounds are shown to be tight for two subclasses of channels. The first subclass is one in which the source and relay are clustered, and the eavesdropper receives signals only on the channel from the source and the relay to the destination, for which the PDF strategy is optimal. The second is a subclass in which the source does not transmit to the relay, for which a noise-forwarding strategy is optimal.

  1. Physical-Layer Security of a Buffer-Aided Full-Duplex Relaying System

    KAUST Repository

    El Shafie, Ahmed

    2016-07-07

    This letter proposes a novel hybrid half-/full-duplex relaying scheme to enhance the relay channel security. A source node (Alice) communicates with her destination node (Bob) in the presence of a buffer-aided full-duplex relay node (Rooney) and a potential eavesdropper (Eve). Rooney adopts two different relaying, namely randomize-and-forward and decode-andforward relaying strategies, to improve the security of the legitimate system. In the first relaying strategy, Rooney uses a codebook different from that used at Alice. In the second relaying strategy, Rooney and Alice use the same codebooks. In addition, Rooney switches between half-duplex and full-duplex modes to further enhance the security of the legitimate system. The numerical results demonstrate that our proposed scheme achieves a significant average secrecy end-to-end throughput improvement relative to the conventional bufferless full-duplex relaying scheme.

  2. Performance of a Cognitive Relay Network under AF Relay Selection Scheme with Imperfect Channel Estimation

    Directory of Open Access Journals (Sweden)

    B. Prasad

    2016-06-01

    Full Text Available In this paper outage performance of a secondary user (SU is evaluated under amplify and forward (AF relay selection scheme with an imperfect channel state information (CSIwhile sharing spectrum in an underlay cognitive radio network (CRN. In underlay, the SU coexists with primary user (PU in the same band provided the interference produced by SU at the PU receiver is below the interference threshold of PU which limits the transmission power of SU and coverage area. Relays help to improve the performance of SU in underlay. However relays are also constrained in transmit power due to interference constraint imposed by PU. Closed form expression of the outage probability of SU with maximum transmit power constraint of relay under imperfect CSI is derived. A scaling factor based power control is used for the SU transmitter and the relay in order to maintain the interference constraint at PU receiver due to imperfect CSI. The impact of different parameters viz. correlation coefficient, channel estimation error, tolerable interference threshold, number of relays and the maximum transmit power constraint of relay on SU performance is investigated. A MATLAB based test bed has also been developed to carry out simulation in order to validate the theoretical result.

  3. SWIPT in Multiuser MIMO Decode-and-Forward Relay Broadcasting Channel with Energy Harvesting Relays

    KAUST Repository

    Benkhelifa, Fatma

    2017-02-09

    In this paper, we consider a multiuser multiple- input multiple-output (MIMO) decode-and-forward (DF) relay broadcasting channel (BC) with single source, multiple energy harvesting relays and multiple destinations. Since the end-to-end sum rate maximization problem is intractable, we tackle a simplified problem where we maximize the sum of the harvested energy at the relays, we employ the block diagonalization (BD) procedure at the source, and we mitigate the interference between the relay- destination channels. The interference mitigation at the destinations is managed in two ways: either to fix the interference covariance matrices at the destination and update them at each iteration until convergence, or to cancel the interference using an algorithm similar to the BD method. We provide numerical results to show the relevance of our proposed solution.

  4. Hash-and-Forward Relaying for Two-Way Relay Channel

    CERN Document Server

    Yilmaz, Erhan

    2011-01-01

    This paper considers a communication network comprised of two nodes, which have no mutual direct communication links, communicating two-way with the aid of a common relay node (RN), also known as separated two-way relay (TWR) channel. We first recall a cut-set outer bound for the set of rates in the context of this network topology assuming full-duplex transmission capabilities. Then, we derive a new achievable rate region based on hash-and-forward (HF) relaying where the RN does not attempt to decode but instead hashes its received signal, and show that under certain channel conditions it coincides with Shannon's inner-bound for the two-way channel [1]. Moreover, for binary adder TWR channel with additive noise at the nodes and the RN we provide a detailed capacity achieving coding scheme based on structure codes.

  5. Secure amplify-and-forward untrusted relaying networks using cooperative jamming and zero-forcing cancelation

    KAUST Repository

    Park, Kihong

    2015-12-03

    In this paper, we investigate secure transmission in untrusted amplify-and-forward half-duplex relaying networks with the help of cooperative jamming at the destination (CJD). Under the assumption of full channel state information (CSI), conventional CJD using self-interference cancelation at the destination is efficient when the untrusted relay has no capability to suppress the jamming signal. However, if the source and destination are equipped with a single antenna and the only untrusted relay is equipped with N multiple antennas, it can remove the jamming signal from the received signal by linear filters and the full multiplexing gain of relaying cannot be achievable with the conventional CJD due to the saturation of the secrecy rate at the high transmit power regime. We propose in this paper new CJD scheme where neither destination nor relay can acquire CSI of relay-destination link. Our proposed scheme utilizes zero-forcing cancelation based on known jamming signals instead of self-interference subtraction, while the untrusted relay cannot suppress the jamming signals due to the lack of CSI. We show that the secrecy rate of the proposed scheme can enjoy a half of multiplexing gain in half-duplex relaying while that of conventional CJD is saturated at high transmit power for N ???2. The impact of channel estimation error at the destination is also investigated to show the robustness of the proposed scheme against strong estimation errors.

  6. Multiple relay selection for delay-limited applications

    KAUST Repository

    Alsharoa, Ahmad M.

    2013-12-01

    A multiple relay selection system model that implements the decode-and-forward mode is investigated. All communication nodes are assumed to be equipped by multiple antennas. Furthermore, lattices space-time coded multiple-input multiple-output half duplex channel is applied. The main goal is to increase the throughput of the system by selecting multiple number of relays. The selection criteria depends on the maximum decoding delay at relays where the system implements a decoding time-out algorithm at each relay. This leads to a significant saving in the overall system power consumptions and attempts to solve the relays synchronization problem. All results are presented using numerical simulations. © 2012 IEEE.

  7. Achievable Rates and Outer Bound for the Half-Duplex MAC with Generalized Feedback

    CERN Document Server

    Haija, Ahmad Abu Al

    2011-01-01

    This paper provides comprehensive coding and outer bound for the half-duplex multiple access channel with generalized feedback (MAC-GF). Two users communicate with one destination over a discrete memoryless channel using time division. Each transmission block is divided into 3 time slots with variable durations: the destination is always in receive mode, while each user alternatively transmits and receives during the first 2 time slots, then both cooperate to send information during the last one. The paper proposes two decode-forward based coding schemes, analyzes their rate regions, and also derives two outer bounds with rate constraints similar to the achievable regions. Both schemes requires no block Makovity, allowing the destination to decode at the end of each block without any delay. In the first scheme, the codewords in the third time slot are superimposed on the codewords of the first two, whereas in the second scheme, these codewords are independent. While the second scheme is simpler, the first sch...

  8. Physical Layer Security Using Two-Path Successive Relaying.

    Science.gov (United States)

    Liau, Qian Yu; Leow, Chee Yen; Ding, Zhiguo

    2016-06-09

    Relaying is one of the useful techniques to enhance wireless physical-layer security. Existing literature shows that employing full-duplex relay instead of conventional half-duplex relay improves secrecy capacity and secrecy outage probability, but this is at the price of sophisticated implementation. As an alternative, two-path successive relaying has been proposed to emulate operation of full-duplex relay by scheduling a pair of half-duplex relays to assist the source transmission alternately. However, the performance of two-path successive relaying in secrecy communication remains unexplored. This paper proposes a secrecy two-path successive relaying protocol for a scenario with one source, one destination and two half-duplex relays. The relays operate alternately in a time division mode to forward messages continuously from source to destination in the presence of an eavesdropper. Analytical results reveal that the use of two half-duplex relays in the proposed scheme contributes towards a quadratically lower probability of interception compared to full-duplex relaying. Numerical simulations show that the proposed protocol achieves the ergodic achievable secrecy rate of full-duplex relaying while delivering the lowest probability of interception and secrecy outage probability compared to the existing half duplex relaying, full duplex relaying and full duplex jamming schemes.

  9. Physical Layer Security Using Two-Path Successive Relaying

    Directory of Open Access Journals (Sweden)

    Qian Yu Liau

    2016-06-01

    Full Text Available Relaying is one of the useful techniques to enhance wireless physical-layer security. Existing literature shows that employing full-duplex relay instead of conventional half-duplex relay improves secrecy capacity and secrecy outage probability, but this is at the price of sophisticated implementation. As an alternative, two-path successive relaying has been proposed to emulate operation of full-duplex relay by scheduling a pair of half-duplex relays to assist the source transmission alternately. However, the performance of two-path successive relaying in secrecy communication remains unexplored. This paper proposes a secrecy two-path successive relaying protocol for a scenario with one source, one destination and two half-duplex relays. The relays operate alternately in a time division mode to forward messages continuously from source to destination in the presence of an eavesdropper. Analytical results reveal that the use of two half-duplex relays in the proposed scheme contributes towards a quadratically lower probability of interception compared to full-duplex relaying. Numerical simulations show that the proposed protocol achieves the ergodic achievable secrecy rate of full-duplex relaying while delivering the lowest probability of interception and secrecy outage probability compared to the existing half duplex relaying, full duplex relaying and full duplex jamming schemes.

  10. Impact of I/Q imbalance on the performance of two-way CSI-assisted AF relaying

    KAUST Repository

    Qi, Jian

    2013-04-01

    In this paper, we investigate half-duplex two-way dual-hop channel state information (CSI)-assisted amplify-and-forward (AF) relaying in the presence of in-phase and quadrature-phase (I/Q) imbalance. A compensation approach for the I/Q imbalance is proposed, which employs the received signals together with their conjugations to detect the desired signal. We also derive the average symbol error probability of the considered half-duplex two-way dual-hop CSI-assisted AF relaying networks with and without compensation for I/Q imbalance in Rayleigh fading channels. Numerical results are provided and show that the proposed compensation method mitigates the impact of I/Q imbalance to a certain extent. © 2013 IEEE.

  11. PERFORMANCE ANALYSIS OF COOPERATION SCHEMES IN EAVESDROPPER ASSISTED RELAY CHANNEL

    Directory of Open Access Journals (Sweden)

    Vaibhav Kumar Gupta

    2014-06-01

    Full Text Available The prominence of the wireless communication has been urging the monotonically increasing demand of security and privacy. In wireless systems, the notion of perfect secrecy of information with respect to illegitimate nodes can be ensured via physical layer security (PLS techniques. Unfortunately, they can be made less effective if source- eavesdropper wiretap channel is better than the main source-receiver channel. The various node cooperation schemes can be employed to combat this limitation where a relay node assists the communication to improve the performance significantly. In this paper, a four node wireless communication system consisting of a source, a destination, a relay and an eavesdropper as wire-tapper has been considered. The performance of the traditional cooperation schemes in terms of secrecy rate has been investigated with a different scenario where relay node helps the eavesdropper to deteriorate the secrecy rate. In addition, since legitimate receiver can overhear the transmission of relay, it favours the achievable secrecy rate. We formulate an analytical expression of conditional secrecy outage probability for the investigated system. From the obtained simulation results, it has been observed that secrecy rate is monotonically increases with path loss index. Furthermore, the proper selection of the system parameters leads to enhance the secrecy performance of the system even if relay pertains to degrade the performance. Amplify-and-forward, cooperation, decode-and-Forward, secrecy rate, relay.

  12. Gaussian Two-way Relay Channel with Private Information for the Relay

    CERN Document Server

    Ho, Chin Keong; Sun, Sumei

    2011-01-01

    We introduce a generalized two-way relay channel where two sources exchange information (not necessarily of the same rate) with help from a relay, and each source additionally sends private information to the relay. We consider the Gaussian setting where all point-to-point links are Gaussian channels. For this channel, we consider a two-phase protocol consisting of a multiple access channel (MAC) phase and a broadcast channel (BC) phase. We propose a general decode-and-forward (DF) scheme where the MAC phase is related to computation over MAC, while the BC phase is related to BC with receiver side information. In the MAC phase, we time share a capacity-achieving code for the MAC and a superposition code with a lattice code as its component code. We show that the proposed DF scheme is near optimal for any channel conditions, in that it achieves rates within half bit of the capacity region of the two-phase protocol.

  13. Alternate MIMO relaying with three AF relays using interference alignment

    KAUST Repository

    Park, Kihong

    2012-06-01

    In this paper, we study a two-hop half-duplex relaying network with one source, one destination, and three amplify-and-forward (AF) relays equipped with M antennas each. We consider alternate transmission to compensate for the inherent loss of capacity pre-log factor 1/2 in half duplex mode, where source transmit message to two relays and the other relay alternately. The inter-relay interference caused by alternate transmission is aligned to make additional degrees of freedom (DOFs). It is shown that the proposed scheme enables us to exploit 3M/4 DOFs compared with the M/2 DOFs of conventional AF relaying. More specifically, suboptimal linear filter designs for a source and three relays are proposed to maximize the achievable sum-rate. We verify using some selected numerical results that the proposed filter designs give significant improvement of the sum-rate over a naive filter and conventional relaying schemes. © 2012 IEEE.

  14. Joint opportunistic scheduling and network coding for bidirectional relay channel

    KAUST Repository

    Shaqfeh, Mohammad

    2013-07-01

    In this paper, we consider a two-way communication system in which two users communicate with each other through an intermediate relay over block-fading channels. We investigate the optimal opportunistic scheduling scheme in order to maximize the long-term average transmission rate in the system assuming symmetric information flow between the two users. Based on the channel state information, the scheduler decides that either one of the users transmits to the relay, or the relay transmits to a single user or broadcasts to both users a combined version of the two users\\' transmitted information by using linear network coding. We obtain the optimal scheduling scheme by using the Lagrangian dual problem. Furthermore, in order to characterize the gains of network coding and opportunistic scheduling, we compare the achievable rate of the system versus suboptimal schemes in which the gains of network coding and opportunistic scheduling are partially exploited. © 2013 IEEE.

  15. A New Achievability Scheme for the Relay Channel

    CERN Document Server

    Kang, Wei

    2007-01-01

    In this paper, we propose a new coding scheme for the general relay channel. This coding scheme is in the form of a block Markov code. The transmitter uses a superposition Markov code. The relay compresses the received signal and maps the compressed version of the received signal into a codeword conditioned on the codeword of the previous block. The receiver performs joint decoding after it has received all of the B blocks. We show that this coding scheme can be viewed as a generalization of the well-known Compress-And-Forward (CAF) scheme proposed by Cover and El Gamal. Our coding scheme provides options for preserving the correlation between the channel inputs of the transmitter and the relay, which is not possible in the CAF scheme. Thus, our proposed scheme may potentially yield a larger achievable rate than the CAF scheme.

  16. On Buffer-Aided Multiple-Access Relay Channel

    DEFF Research Database (Denmark)

    Liu, Rongkuan; Popovski, Petar; Wang, Gang

    2016-01-01

    This letter treats uplink scenario where M user equipments (UEs) send to a base station (BS), possibly via a common relay station (RS) that is equipped with a buffer. This is a multiple-access relay channel aided by a buffer. We devise a protocol in which the transmission mode is selected...... adaptively, using the buffer at the RS in order to maximize the average system throughput. We consider the general case in which the RS and the BS can have limits on the maximal number of transmitters that can be received over the multiple access channel. In each slot, there are three type possible actions...... entirely at the BS, while simultaneously a number of UEs sends new messages to the BS. The results show that the adaptive selection of direct and buffer-aided relay transmissions leads to significant average throughput gains....

  17. Throughput maximization for buffer-aided hybrid half-/full-duplex relaying with self-interference

    KAUST Repository

    Khafagy, Mohammad Galal

    2015-06-01

    In this work, we consider a two-hop cooperative setting where a source communicates with a destination through an intermediate relay node with a buffer. Unlike the existing body of work on buffer-aided half-duplex relaying, we consider a hybrid half-/full-duplex relaying scenario with loopback interference in the full-duplex mode. Depending on the channel outage and buffer states that are assumed available at the transmitters, the source and relay may either transmit simultaneously or revert to orthogonal transmission. Specifically, a joint source/relay scheduling and relaying mode selection mechanism is proposed to maximize the end-to-end throughput. The throughput maximization problem is converted to a linear program where the exact global optimal solution is efficiently obtained via standard convex/linear numerical optimization tools. Finally, the theoretical findings are corroborated with event-based simulations to provide the necessary performance validation.

  18. Power optimization for maximum channel capacity in MIMO relay system

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    Introducing multiple-input multiple-output (MIMO) relay channel could offer significant capacity gain.And it is of great importance to develop effective power allocation strategies to achieve power efficiency and improve channel capacity in amplify-and-forward relay system.This article investigates a two-hop MIMO relay system with multiple antennas in relay node (RN) and receiver (RX).Maximizing capacity with antenna selection (MCAS) and maximizing capacity with eigen-decomposition (MCED) schemes are proposed to efficiently allocate power among antennas in RN under first and second hop limited scenarios.The analysis and simulation results show that both MCED and MCAS can improve the channel capacity compared with uniform power allocation (UPA) scheme in most of the studied areas.The MCAS bears comparison with MCED with an acceptable capacity loss, but lowers the complexity by saving channel state information (CSI) feedback to the transmitter (TX).Moreover, when the RN is close to RX, the performance of UPA is also close to the upper bound as the performance of first hop is limited.

  19. Appendices for: Improper Signaling in Two-Path Relay Channels

    KAUST Repository

    Gaafar, Mohamed

    2016-12-01

    This document contains the appendices for the work in “Improper Signaling in Two-Path Relay Channels,” which is submitted to 2017 IEEE International Conference on Communications (ICC) Workshop on Full-Duplex Communications for Future Wireless Networks, Paris, France.

  20. Two-way CSI-assisted AF relaying with HPA nonlinearity

    KAUST Repository

    Qi, Jian

    2015-09-11

    In this paper, we investigate half-duplex two-way dual-hop channel state information (CSI)-assisted amplify-andforward (AF) relaying in the presence of high-power amplifier (HPA) nonlinearity at relays. The expression for the end-toend signal-to-noise ratio (SNR) is derived as per the modified system model by taking into account the interference caused by relaying scheme and HPA nonlinearity. The system performance of the considered relaying network is evaluated in terms of average symbol error probability (SEP) in Nakagami-m fading channels, by making use of the moment-generating function (MGF) approach. Numerical results are provided and show the effects of several parameters, such as quadrature amplitude modulation (QAM) order, number of relays, HPA parameters, and Nakagami parameter, on performance. © 2015 IEEE.

  1. Relay Architectures for 3GPP LTE-Advanced

    Directory of Open Access Journals (Sweden)

    Peters StevenW

    2009-01-01

    Full Text Available The Third Generation Partnership Project's Long Term Evolution-Advanced is considering relaying for cost-effective throughput enhancement and coverage extension. While analog repeaters have been used to enhance coverage in commercial cellular networks, the use of more sophisticated fixed relays is relatively new. The main challenge faced by relay deployments in cellular systems is overcoming the extra interference added by the presence of relays. Most prior work on relaying does not consider interference, however. This paper analyzes the performance of several emerging half-duplex relay strategies in interference-limited cellular systems: one-way, two-way, and shared relays. The performance of each strategy as a function of location, sectoring, and frequency reuse are compared with localized base station coordination. One-way relaying is shown to provide modest gains over single-hop cellular networks in some regimes. Shared relaying is shown to approach the gains of local base station coordination at reduced complexity, while two-way relaying further reduces complexity but only works well when the relay is close to the handset. Frequency reuse of one, where each sector uses the same spectrum, is shown to have the highest network throughput. Simulations with realistic channel models provide performance comparisons that reveal the importance of interference mitigation in multihop cellular networks.

  2. Relay Selection and Resource Allocation in One-Way and Two-Way Cognitive Relay Networks

    KAUST Repository

    Alsharoa, Ahmad M.

    2013-05-08

    In this work, the problem of relay selection and resource power allocation in one- way and two-way cognitive relay networks using half duplex channels with different relaying protocols is investigated. Optimization problems for both single and multiple relay selection that maximize the sum rate of the secondary network without degrading the quality of service of the primary network by respecting a tolerated interference threshold were formulated. Single relay selection and optimal power allocation for two-way relaying cognitive radio networks using decode-and-forward and amplify-and-forward protocols were studied. Dual decomposition and subgradient methods were used to find the optimal power allocation. The transmission process to exchange two different messages between two transceivers for two-way relaying technique takes place in two time slots. In the first slot, the transceivers transmit their signals simultaneously to the relay. Then, during the second slot the relay broadcasts its signal to the terminals. Moreover, improvement of both spectral and energy efficiency can be achieved compared with the one-way relaying technique. As an extension, a multiple relay selection for both one-way and two-way relaying under cognitive radio scenario using amplify-and-forward were discussed. A strong optimization tool based on genetic and iterative algorithms was employed to solve the 
formulated optimization problems for both single and multiple relay selection, where discrete relay power levels were considered. Simulation results show that the practical and low-complexity heuristic approaches achieve almost the same performance of the optimal relay selection schemes either with discrete or continuous power distributions while providing a considerable saving in terms of computational complexity.

  3. Efficient incremental relaying for packet transmission over fading channels

    KAUST Repository

    Fareed, Muhammad Mehboob

    2014-07-01

    In this paper, we propose a novel relaying scheme for packet transmission over fading channels, which improves the spectral efficiency of cooperative diversity systems by utilizing limited feedback from the destination. Our scheme capitalizes on the fact that relaying is only required when direct transmission suffers deep fading. We calculate the packet error rate for the proposed efficient incremental relaying (EIR) scheme with both amplify and forward and decode and forward relaying. We compare the performance of the EIR scheme with the threshold-based incremental relaying (TIR) scheme. It is shown that the efficiency of the TIR scheme is better for lower values of the threshold. However, the efficiency of the TIR scheme for higher values of threshold is outperformed by the EIR. In addition, three new threshold-based adaptive EIR are devised to further improve the efficiency of the EIR scheme. We calculate the packet error rate and the efficiency of these new schemes to provide the analytical insight. © 2014 IEEE.

  4. On full duplex Gaussian relay channels with self-interference

    KAUST Repository

    Behboodi, Arash

    2016-08-15

    Self interference (SI) in full duplex (FD) systems is the interference caused by the transmission stream on the reception stream. Being one of the main restrictive factors for performance of practical full duplex systems, however, not too much is known about its effect on the fundamental limits of relaying systems. In this work, we consider the full duplex three-node relay channel with SI where SI is modeled as an additive Gaussian noise whose variance is dependent on instantaneous input power. The classical achievable rates and upper bounds for the single three-node relay channel no longer apply due to the structure of SI. Achievable rates for Decode-and-Forward (DF) and Compress-and-Forward (CF) and upper bounds on the capacity are derived assuming Gaussian inputs and SI. The deterministic model is also introduced and its capacity is characterized. The optimal joint source-relay distributions is discussed. Numerical results are provided comparing the achievable rates and upper bound. © 2016 IEEE.

  5. The Diversity Potential of Relay Selection with Practical Channel Estimation

    CERN Document Server

    Michalopoulos, Diomidis S; Schober, Robert; Karagiannidis, George K

    2011-01-01

    We investigate the diversity order of decode-and-forward relay selection in Nakagami-m fading, in cases where practical channel estimation techniques are applied. In this respect, we introduce a unified model for the imperfect channel estimates, where the effects of noise, time-varying channels, and feedback delays are jointly considered. Based on this model, the correlation between the actual and the estimated channel values, \\rho, is expressed as a function of the signal-to-noise ratio (SNR), yielding closed-form expressions for the overall outage probability as a function of \\rho. The resulting diversity order and power gain reveal a high dependence of the performance of relay selection on the high SNR behavior of \\rho, thus shedding light onto the effect of channel estimation on the overall performance. It is shown that when the channel estimates are not frequently updated in applications involving time-varying channels, or when the amount of power allocated for channel estimation is not sufficiently high...

  6. Joint Relay Selection and Power Allocation for Cooperative Communication over Frequency Selective Fading Channels

    Directory of Open Access Journals (Sweden)

    Youhua Ma

    2012-08-01

    Full Text Available In this paper, we consider the joint problem of relay selection and optimal power allocation for multi-relay amplify-and-forward (AF cooperative communication system over frequency selective fading channels. An optimization model combined relay selection and power allocation under a total transmission power budget is formulated. Then, this combinatorial problem is solved in a distributed strategy. Relay selection with a new threshold-based multiple-relay selection (MRS scheme is implemented at first, and then power is allocated between source and the selected relays in an optimized way to maximize channel capacity. Simulation result shows that the proposed joint scenario with relay selection and power allocation achieves better throughput performance than that of parallel-relay scenario (means that random relay is selected to forward data and allocated part of total power on average. Furthermore, the performances of the new MRS scheme and other relay selection strategies are also investigated.

  7. Gaussian Relay Channel Capacity to Within a Fixed Number of Bits

    CERN Document Server

    Chang, Woohyuk; Lee, Yong H

    2010-01-01

    In this paper, we show that the capacity of the three-node Gaussian relay channel can be achieved to within 1 and 2 bit/sec/Hz using compress-and-forward and amplify-and-forward relaying, respectively.

  8. Sum-Rate Enhancement in Multiuser MIMO Decode-and-Forward Relay Broadcasting Channel with Energy Harvesting Relays

    KAUST Repository

    Benkhelifa, Fatma

    2016-09-20

    In this paper, we consider a multiuser multipleinput multiple-output (MIMO) decode-and-forward (DF) relay broadcasting channel (BC) with single source, multiple energy harvesting (EH) relays and multiple destinations. All the nodes are equipped with multiple antennas. The EH and information decoding (ID) tasks at the relays and destinations are separated over the time, which is termed as the time switching (TS) scheme. As optimal solutions for the sum-rate maximization problems of BC channels and the MIMO interference channels are hard to obtain, the end-to-end sum rate maximization problem of a multiuser MIMO DF relay BC channel is even harder. In this paper, we propose to tackle a simplified problem where we employ the block diagonalization (BD) procedure at the source, and we mitigate the interference between the relaydestination channels using an algorithm similar to the BD method. In order to show the relevance of our low complex proposed solution, we compare it to the minimum mean-square error (MMSE) solution that was shown in the literature to be equivalent to the solution of the sum-rate maximization in MIMO broadcasting interfering channels. We also investigate the time division multiple access (TDMA) solution which separates all the information transmissions from the source to the relays and from the relays to the destinations over time. We provide numerical results to show the relevance of our proposed solution, in comparison with the no co-channel interference (CCI) case, the TDMA based solution and the MMSE based solution.

  9. PERFORMANCE ANALYSIS OF ORTHOGONAL FREQUENCY DIVISION MULTIPLEXING BASED BIDIRECTIONAL RELAY NETWORK IN THE PRESENCE OF PHASE NOISE

    Directory of Open Access Journals (Sweden)

    V. N. Senthil Kumaran

    2013-01-01

    Full Text Available In this study, the performance of OFDM based bidirectional relay network which employs Physical Layer Network Coding (PLNC is analyzed in the presence of phase noise. The bidirectional relay network is assumed to consist of two sources and a relay, where each node has a single antenna and operates in half duplex mode. The PLNC based OFDM system transmits high data streams over numerous sub channels in frequency domain. Each sub channel is a narrow band flat fading channel, thereby achieving high spectral efficiency over wide band channels. In practice, phase noise is introduced with the information symbols transmitted on all subcarriers in OFDM transceiver. The influence of phase noise on the received signals are analyzed at both the Multiple Access Channel (MAC and at the Broadcast Channel (BC environments.

  10. Full Duplex Emulation via Spatial Separation of Half Duplex Nodes in a Planar Cellular Network

    DEFF Research Database (Denmark)

    Thomsen, Henning; Kim, Dong Min; Popovski, Petar;

    2016-01-01

    A Full Duplex Base Station (FD-BS) can be used to serve simultaneously two Half-Duplex (HD) Mobile Stations (MSs), one working in the uplink and one in the downlink, respectively. The same functionality can be realized by having two interconnected and spatially separated Half Duplex Base Stations...... (HD-BSs), which is a scheme termed CoMPflex (CoMP for In-Band Wireless Full Duplex). A FD-BS can be seen as a special case of CoMPflex with separation distance zero. In this paper we study the performance of CoMPflex in a two-dimensional cellular scenario using stochastic geometry and compare...... of communication reliability. Following the trend of wireless network densification, CoMPflex can be regarded as a method with a great potential to effectively use the dense HD deployments....

  11. Buffer-Aided Relaying with Adaptive Link Selection

    CERN Document Server

    Zlatanov, Nikola; Popovski, Petar

    2012-01-01

    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 up...

  12. MIMO Relaying Broadcast Channels with Linear Precoding and Quantized Channel State Information Feedback

    CERN Document Server

    Xu, Wei; Lu, Wu-Sheng; 10.1109/TSP.2010.2056687

    2012-01-01

    Multi-antenna relaying has emerged as a promising technology to enhance the system performance in cellular networks. However, when precoding techniques are utilized to obtain multi-antenna gains, the system generally requires channel state information (CSI) at the transmitters. We consider a linear precoding scheme in a MIMO relaying broadcast channel with quantized CSI feedback from both two-hop links. With this scheme, each remote user feeds back its quantized CSI to the relay, and the relay sends back the quantized precoding information to the base station (BS). An upper bound on the rate loss due to quantized channel knowledge is first characterized. Then, in order to maintain the rate loss within a predetermined gap for growing SNRs, a strategy of scaling quantization quality of both two-hop links is proposed. It is revealed that the numbers of feedback bits of both links should scale linearly with the transmit power at the relay, while only the bit number of feedback from the relay to the BS needs to gr...

  13. Cognitive relaying and power allocation under channel state uncertainties

    KAUST Repository

    Pandarakkottilil, Ubaidulla

    2013-04-01

    In this paper, we present robust joint relay precoder designs and transceiver power allocations for a cognitive radio network under imperfect channel state information (CSI). The secondary (or cognitive) network consists of a pair of single-antenna transceiver nodes and a non-regenerative two-way relay with multiple antennas which aids the communication process between the transceiver pair. The secondary nodes share the spectrum with a licensed primary user (PU) while guaranteeing that the interference to the PU receiver is maintained below a specified threshold. We consider two robust designs: the first is based on the minimization of the total transmit power of the secondary relay node required to provide the minimum quality of service, measured in terms of mean-square error (MSE) of the transceiver nodes, and the second is based on the minimization of the sum-MSE of the transceiver nodes. The robust designs are based on worst-case optimization and take into account known parameters of the error in the CSI to render the performance immune to the presence of errors in the CSI. Though the original problem is non-convex, we show that the proposed designs can be reformulated as tractable convex optimization problems that can be solved efficiently. We illustrate the performance of the proposed designs through some selected numerical simulations. © 2013 IEEE.

  14. Channel allocation and rate adaptation for relayed transmission over correlated fading channels

    KAUST Repository

    Hwang, Kyusung

    2009-09-01

    We consider, in this paper, channel allocation and rate adaptation scheme for relayed transmission over correlated fading channels via cross-layer design. Specifically, jointly considering the data link layer buffer occupancy and channel quality at both the source and relay nodes, we develop an optimal channel allocation and rate adaptation policy for a dual-hop relayed transmission. As such the overall transmit power for the relayed system is minimized while a target packet dropping rate (PDR) due to buffer over flows is guaranteed. In order to find such an optimal policy, the channel allocation and rate adaptation transmission framework is formulated as a constraint Markov decision process (CMDP). The PDR performance of the optimal policy is compared with that of two conventional suboptimal schemes, namely the channel quality based and the buffer occupancy based channel allocation schemes. Numerical results show that for a given power budget, the optimal scheme requires significantly less power than the conventional schemes in order to maintain a target PDR. ©2009 IEEE.

  15. Outage Analysis of PLNC Based Bidirectional Relay Network in the presence of I/Q Imbalance

    Directory of Open Access Journals (Sweden)

    V.N.Senthil Kumaran

    2014-08-01

    Full Text Available Bidirectional relay network consists of two sources and a relay, where each node has a single antenna and operates in half duplex mode. The PLNC based OFDM system transmits numerous high data streams through narrow band flat fading subchannels to achieve high spectral efficiency over wide band channels. However in practice, I/Q imbalance is introduced at the radio frequency sections of the nodes affects the orthogonality among the subcarriers. In this paper, the bidirectional relay network is modelled with I/Q imbalance and the outage performance of Orthogonal Frequency Division Multiplexing (OFDM based bidirectional relay network which employs physical layer network coding (PLNC is analyzed in the presence of In-phase and Quadrature (I/Q imbalance at both the time slots.

  16. Non-Regenerative Multi-Antenna Multi-Group Multi-Way Relaying

    Directory of Open Access Journals (Sweden)

    Klein Anja

    2011-01-01

    Full Text Available Abstract We consider non-regenerative multi-group multi-way (MGMW relaying. A half-duplex non-regenerative multi-antenna relay station (RS assists multiple communication groups. In each group, multiple half-duplex nodes exchange messages. In our proposal, the required number of communication phases is equal to the maximum number of nodes among the groups. In the first phase, all nodes transmit simultaneously to the RS. Assuming perfect channel state information is available at the RS, in the following broadcast (BC phases the RS applies transceive beamforming to its received signal and transmits simultaneously to all nodes. We propose three BC strategies for the BC phases: unicasting, multicasting and hybrid uni/multicasting. For the multicasting strategy, network coding is applied to maintain the same number of communication phases as for the other strategies. We address transceive beamforming maximising the sum rate of non-regenerative MGMW relaying. Due to the high complexity of finding the optimum transceive beamforming maximising the sum rate, we design generalised low complexity transceive beamforming algorithms for all BC strategies: matched filter, zero forcing, minimisation of mean square error and BC-strategy-aware transceive beamforming. It is shown that the sum rate performance of non-regenerative MGMW relaying depends both on the chosen BC strategies and the applied transceive beamforming at the RS.

  17. Partial relay selection based on shadowing side information over generalized composite fading channels

    KAUST Repository

    Yilmaz, Ferkan

    2011-11-01

    In this paper, in contrast to the relay selection protocols available in the literature, we propose a partial relay selection protocol utilizing only the shadowing side information of the relays instead of their full channel side information in order to select a relay in a dual-hop relaying system through the available limited feedback channels and power budget. We then presented an exact unified performance expression combining the average bit error probability, ergodic capacity, and moments-generating function of the proposed partial relay selection over generalized fading channels. Referring to the unified performance expression introduced in [1], we explicitly offer a generic unified performance expression that can be easily calculated and that is applicable to a wide variety of fading scenarios. Finally, as an illustration of the mathematical formalism, some numerical and simulation results are generated for an extended generalized-K fading environment, and these numerical and simulation results are shown to be in perfect agreement. © 2011 IEEE.

  18. Joint Power and Resource Allocation for Block-Fading Relay-Assisted Broadcast Channels

    CERN Document Server

    Shaqfeh, Mohammad

    2012-01-01

    We provide the solution for optimizing the power and resource allocation over block-fading relay-assisted broadcast channels in order to maximize the long term average achievable rates region of the users. The problem formulation assumes regenerative (repetition coding) decode-and-forward (DF) relaying strategy, long-term average total transmitted power constraint, orthogonal multiplexing of the users messages within the channel blocks, possibility to use a direct transmission (DT) mode from the base station to the user terminal directly or a relaying (DF) transmission mode, and partial channel state information. We show that our optimization problem can be transformed into an equivalent "no-relaying" broadcast channel optimization problem with each actual user substituted by two virtual users having different channel qualities and multiplexing weights. The proposed power and resource allocation strategies are expressed in closed-form that can be applied practically in centralized relay-assisted wireless netw...

  19. Capacity of Strong and Very Strong Gaussian Interference Relay-without-delay Channels

    CERN Document Server

    Chang, Hyunseok

    2011-01-01

    In this paper, we study the interference relay-without-delay channel which is an interference channel with a relay helping the communication. We assume the relay's transmit symbol depends not only on its past received symbols but also on its current received symbol, which is an appropriate model for studying amplify-and-forward type relaying when the overall delay spread is much smaller than the inverse of the bandwidth. For the discrete memoryless interference relay-without-delay channel, we show an outer bound using genie-aided outer bounding. For the Gaussian interference relay-without-delay channel, we define strong and very strong interference relay-without-delay channels and propose an achievable scheme based on instantaneous amplify-and-forward (AF) relaying. We also propose two outer bounds for the strong and very strong cases. Using the proposed achievable scheme and outer bounds, we show that our scheme can achieve the capacity exactly when the relay's transmit power is greater than a certain thresh...

  20. On Diversity-Multiplexing Tradeoff in Multiple-Relay Networks

    CERN Document Server

    Gharan, Shahab Oveis; Khandani, Amir K

    2008-01-01

    This paper studies the setup of a multiple-relay network in which $K$ half-duplex multiple-antenna relays assist in the transmission between a/several multiple-antenna transmitter(s) and a multiple-antenna receiver. Each two nodes are assumed to be either connected through a quasi-static Rayleigh fading channel, or disconnected. We propose a new scheme, which we call random sequential (RS), based on the amplify-and-forward relaying. We prove that for general multiple-antenna multiple-relay networks, the proposed scheme achieves the maximum diversity gain. Furthermore, we derive diversity-multiplexing tradeoff (DMT) of the proposed RS scheme for general single-antenna multiple-relay networks. Finally, we show that for single-antenna multiple-access multiple-relay ($K>1$) networks (without direct link between the transmitter(s) and the receiver), the proposed RS scheme achieves the optimum DMT. However, for the case of multiple access single relay setup, the RS scheme reduces to the naive amplify-and-forward re...

  1. On the achievable degrees of freedom of alternate MIMO relaying with multiple AF relays

    KAUST Repository

    Park, Kihong

    2012-03-01

    In this paper, we consider a two-hop relaying network where one source, one destination, and multiple amplify-and-forward (AF) relays equipped with M antennas operate in a half-duplex mode. In order to compensate for the inherent loss of capacity pre-log factor of 1/2 due to half-duplex relaying, we propose a new transmission protocol which combines alternate relaying and inter-relay interference alignment. We prove that the proposed scheme can (i) exploits M degrees of freedom (DOFs) and (ii) perfectly recover the pre-log factor loss if the number of relays is at least six. From our selected numerical results, we show that our proposed scheme gives significant improvement over conventional AF relaying which offers only M/2 DOFs. © 2012 IEEE.

  2. Improved Iterative Decoding of Network-Channel Codes for Multiple-Access Relay Channel.

    Science.gov (United States)

    Majumder, Saikat; Verma, Shrish

    2015-01-01

    Cooperative communication using relay nodes is one of the most effective means of exploiting space diversity for low cost nodes in wireless network. In cooperative communication, users, besides communicating their own information, also relay the information of other users. In this paper we investigate a scheme where cooperation is achieved using a common relay node which performs network coding to provide space diversity for two information nodes transmitting to a base station. We propose a scheme which uses Reed-Solomon error correcting code for encoding the information bit at the user nodes and convolutional code as network code, instead of XOR based network coding. Based on this encoder, we propose iterative soft decoding of joint network-channel code by treating it as a concatenated Reed-Solomon convolutional code. Simulation results show significant improvement in performance compared to existing scheme based on compound codes.

  3. Asymptotic analysis for Nakagami-m fading channels with relay selection

    KAUST Repository

    Zhong, Caijun

    2011-06-01

    In this paper, we analyze the asymptotic outage probability performance of both decode-and-forward (DF) and amplify-and-forward (AF) relaying systems using partial relay selection and the "best" relay selection schemes for Nakagami-m fading channels. We derive their respective outage probability expressions in the asymptotic high signal-to-noise ratio (SNR) regime, from which the diversity order and coding gain are analyzed. In addition, we investigate the impact of power allocation between the source and relay terminals and derive the diversity-multiplexing tradeoff (DMT) for these relay selection systems. The theoretical findings suggest that partial relay selection can improve the diversity of the system and can achieve the same DMT as the "best" relay selection scheme under certain conditions. © 2011 IEEE.

  4. Performance analysis of selective cooperation with fixed gain relays in Nakagami-m channels

    KAUST Repository

    Hussain, Syed Imtiaz

    2012-09-01

    Selecting the best relay using the maximum signal to noise ratio (SNR) among all the relays ready to cooperate saves system resources and utilizes the available bandwidth more efficiently compared to the regular all-relay cooperation. In this paper, we analyze the performance of the best relay selection scheme with fixed gain relays operating in Nakagami-. m channels. We first derive the probability density function (PDF) of upper bounded end-to-end SNR of the relay link. Using this PDF, we derive some key performance parameters for the system including average bit error probability and average channel capacity. The analytical results are verified through Monte Carlo simulations. © 2012 Elsevier B.V.

  5. Performance Analysis of Amplify-and-Forward Two-Way Relaying with Co-Channel Interference and Channel Estimation Error

    KAUST Repository

    Liang Yang,

    2013-06-01

    In this paper, we consider the performance of a two-way amplify-and-forward relaying network (AF TWRN) in the presence of unequal power co-channel interferers (CCI). Specifically, we first consider AF TWRN with an interference-limited relay and two noisy-nodes with channel estimation errors and CCI. We derive the approximate signal-to-interference plus noise ratio expressions and then use them to evaluate the outage probability, error probability, and achievable rate. Subsequently, to investigate the joint effects of the channel estimation error and CCI on the system performance, we extend our analysis to a multiple-relay network and derive several asymptotic performance expressions. For comparison purposes, we also provide the analysis for the relay selection scheme under the total power constraint at the relays. For AF TWRN with channel estimation error and CCI, numerical results show that the performance of the relay selection scheme is not always better than that of the all-relay participating case. In particular, the relay selection scheme can improve the system performance in the case of high power levels at the sources and small powers at the relays.

  6. Optimal Relay Selection with Channel Probing in Wireless Sensor Networks

    CERN Document Server

    Naveen, K P

    2011-01-01

    Motivated by the problem of distributed geographical packet forwarding in a wireless sensor network with sleep-wake cycling nodes, we propose a local forwarding model comprising a node that wishes to forward a packet towards a destination, and a set of next-hop relay nodes, each of which is associated with a reward that summarises the cost/benefit of forwarding the packet through that relay. The relays wake up at random times, at which instants they reveal only the probability distributions of their rewards (e.g., by revealing their locations). To determine a relay's exact reward, the forwarding node has to further probe the relay, incurring a probing cost. Thus, at each relay wake-up instant, the source, given a set of relay reward distributions, has to decide whether to stop (and forward the packet to an already probed relay), continue waiting for further relays to wake-up, or probe an unprobed relay. We formulate the problem as a Markov decision process, with the objective being to minimize the packet forw...

  7. Distributed Cooperative Transmission with Unreliable and Untrustworthy Relay Channels

    Directory of Open Access Journals (Sweden)

    Zhu Han

    2009-01-01

    Full Text Available Cooperative transmission is an emerging wireless communication technique that improves wireless channel capacity through multiuser cooperation in the physical layer. It is expected to have a profound impact on network performance and design. However, cooperative transmission can be vulnerable to selfish behaviors and malicious attacks, especially in its current design. In this paper, we investigate two fundamental questions Does cooperative transmission provide new opportunities to malicious parties to undermine the network performance? Are there new ways to defend wireless networks through physical layer cooperation? Particularly, we study the security vulnerabilities of the traditional cooperative transmission schemes and show the performance degradation resulting from the misbehaviors of relay nodes. Then, we design a trust-assisted cooperative scheme that can detect attacks and has self-healing capability. The proposed scheme performs much better than the traditional schemes when there are malicious/selfish nodes or severe channel estimation errors. Finally, we investigate the advantage of cooperative transmission in terms of defending against jamming attacks. A reduction in link outage probability is achieved.

  8. Lower Bounds on the Capacity of the Relay Channel with States at the Source

    Directory of Open Access Journals (Sweden)

    Abdellatif Zaidi

    2009-01-01

    Full Text Available We consider a state-dependent three-terminal full-duplex relay channel with the channel states noncausally available at only the source, that is, neither at the relay nor at the destination. This model has application to cooperation over certain wireless channels with asymmetric cognition capabilities and cognitive interference relay channels. We establish lower bounds on the channel capacity for both discrete memoryless (DM and Gaussian cases. For the DM case, the coding scheme for the lower bound uses techniques of rate-splitting at the source, decode-and-forward (DF relaying, and a Gel'fand-Pinsker-like binning scheme. In this coding scheme, the relay decodes only partially the information sent by the source. Due to the rate-splitting, this lower bound is better than the one obtained by assuming that the relay decodes all the information from the source, that is, full-DF. For the Gaussian case, we consider channel models in which each of the relay node and the destination node experiences on its link an additive Gaussian outside interference. We first focus on the case in which the links to the relay and to the destination are corrupted by the same interference; and then we focus on the case of independent interferences. We also discuss a model with correlated interferences. For each of the first two models, we establish a lower bound on the channel capacity. The coding schemes for the lower bounds use techniques of dirty paper coding or carbon copying onto dirty paper, interference reduction at the source and decode-and-forward relaying. The results reveal that, by opposition to carbon copying onto dirty paper and its root Costa's initial dirty paper coding (DPC, it may be beneficial in our setup that the informed source uses a part of its power to partially cancel the effect of the interference so that the uninformed relay benefits from this cancellation, and so the source benefits in turn.

  9. Performance of hybrid-ARQ with incremental redundancy over relay channels

    KAUST Repository

    Chelli, Ali

    2012-12-01

    In this paper, we consider a relay network consisting of a source, a relay, and a destination. The source transmits a message to the destination using hybrid automatic repeat request (HARQ) with incremental redundancy (IR). The relay overhears the transmitted messages over the different HARQ rounds and tries to decode the data packet. In case of successful decoding at the relay, both the relay and the source cooperate to transmit the message to the destination. A maximum number M of HARQ rounds is considered. The channel realizations are independent for different HARQ rounds. We assume Rayleigh fading channels for the links source-relay, source-destination, and relay-destination. We investigate the performance of HARQ-IR over relay channel from an information theoretic perspective. Analytical expressions are derived for the information outage probability, the average number of transmissions, and the average transmission rate. We illustrate through our investigation the benefit of relaying. We also show the impact of the target outage probability and the maximum number M of HARQ rounds on the outage probability, the average number of transmissions, and the average transmission rate. © 2012 IEEE.

  10. Cooperative AF Relaying in Spectrum-Sharing Systems: Outage Probability Analysis under Co-Channel Interferences and Relay Selection

    KAUST Repository

    Xia, Minghua

    2012-11-01

    For cooperative amplify-and-forward (AF) relaying in spectrum-sharing wireless systems, secondary users share spectrum resources originally licensed to primary users to communicate with each other and, thus, the transmit power of secondary transmitters is strictly limited by the tolerable interference powers at primary receivers. Furthermore, the received signals at a relay and at a secondary receiver are inevitably interfered by the signals from primary transmitters. These co-channel interferences (CCIs) from concurrent primary transmission can significantly degrade the performance of secondary transmission. This paper studies the effect of CCIs on outage probability of the secondary link in a spectrum-sharing environment. In particular, in order to compensate the performance loss due to CCIs, the transmit powers of a secondary transmitter and its relaying node are respectively optimized with respect to both the tolerable interference powers at the primary receivers and the CCIs from the primary transmitters. Moreover, when multiple relays are available, the technique of opportunistic relay selection is exploited to further improve system performance with low implementation complexity. By analyzing lower and upper bounds on the outage probability of the secondary system, this study reveals that it is the tolerable interference powers at primary receivers that dominate the system performance, rather than the CCIs from primary transmitters. System designers will benefit from this result in planning and designing next-generation broadband spectrum-sharing systems.

  11. The Finite Field Multi-Way Relay Channel with Correlated Sources: The Three-User Case

    CERN Document Server

    Ong, Lawrence; Lechner, Gottfried; Johnson, Sarah J; Kellett, Christopher M

    2011-01-01

    The three-user finite field multi-way relay channel with correlated sources is considered. The three users generate possibly correlated messages, and each user is to transmit its message to the two other users reliably in the Shannon sense. As there is no direct link among the users, communication is carried out via a relay, and the link from the users to the relay and those from the relay to the users are finite field adder channels with additive noise of arbitrary distribution. The problem is to determine the set of all possible achievable rates, defined as channel uses per source symbol for reliable communication. For two classes of source/channel combinations, the solution is obtained using Slepian-Wolf source coding combined with functional-decode-forward channel coding.

  12. ROBUST RADIO RESOURCE ALLOCATION IN LTE NETWORKS BY CHANNEL AND RELAY ASSIGNMENT

    Directory of Open Access Journals (Sweden)

    R. SANTHAKUMAR

    2017-07-01

    Full Text Available The radio resource allocation in wireless communication is analysed in this paper. Pair of users communicates each other through multiple two way relays in orthogonal frequency division multiplexing transmission systems. The total throughput is maximized by relay selection, channel and relay assignment, subcarrier pairing and subcarrier allocation by prim’s algorithm. The graphical theory approach has used to solve the problem optimally in polynomial time. The evaluation of the network total throughput with respect to transmit power node and the number of relay nodes are analysed through simulation. In this work, the improvement in sum rate with optimum carrier assignment using proposed algorithm is demonstrated against the classical work.

  13. Joint Channel and Network Decoding for XOR-Based Relay in Multi-Access Channel

    Science.gov (United States)

    Tang, Suhua; Cheng, Jun; Sun, Chen; Miura, Ryu; Obana, Sadao

    In this paper network coding based relay for multi-access channel is studied. In the system, two nodes send messages to a common access point (AP). A relay assists the two nodes by forwarding a network coded version of the messages. The AP performs joint channel and network decoding to recover the two original messages from three received signals. Two schemes, soft network coding (SoftNC) and turbo network coding (TurboNC), both focusing on bitwise exclusive or (XOR) based network coding, are proposed to salvage messages from erroneous signals. SoftNC is simple and backward compatible with existing protocol stack of wireless networks, and reduces packet errors by maximal ratio combining (MRC). TurboNC improves channel efficiency by letting the relay node transmit only parity check bits of the interleaved XORed message, where reliability is retained by iterative decoding. Simulation results show that compared with the network-layer path diversity scheme [8], both SoftNC and TurboNC greatly improve the reliability, and TurboNC also achieves a much higher throughput. The proposed schemes are suitable for improving the performance of wireless local area networks (WLAN).

  14. Clean relaying aided cognitive radio under the coexistence constraint

    CERN Document Server

    Lin, Pin-Hsun; Su, Hsuan-Jung; Hong, Y -W Peter

    2011-01-01

    We consider the interference-mitigation based cognitive radio where the primary and secondary users can coexist at the same time and frequency bands, under the constraint that the rate of the primary user (PU) must remain the same with a single-user decoder. To meet such a coexistence constraint, the relaying from the secondary user (SU) can help the PU's transmission under the interference from the SU. However, the relayed signal in the known dirty paper coding (DPC) based scheme is interfered by the SU's signal, and is not "clean". In this paper, under the half-duplex constraints, we propose two new transmission schemes aided by the clean relaying from the SU's transmitter and receiver without interference from the SU. We name them as the clean transmitter relaying (CT) and clean transmitter-receiver relaying (CTR) aided cognitive radio, respectively. The rate and multiplexing gain performances of CT and CTR in fading channels with various availabilities of the channel state information at the transmitters ...

  15. Detect-and-forward in two-hop relay channels: a metrics-based analysis

    KAUST Repository

    Benjillali, Mustapha

    2010-06-01

    In this paper, we analyze the coded performance of a cooperative system with multiple parallel relays using "Detect-and-Forward" (DetF) strategy where each relay demodulates the overheard signal and forwards the detected binary words. The proposed method is based on the probabilistic characterization of the reliability metrics given under the form of L-values. First, we derive analytical expressions of the probability density functions (PDFs) of the L-values in the elementary two-hop DetF relay channel with different source-relay channel state information assumptions. Then, we apply the obtained expressions to calculate the theoretically achievable rates and compare them with the practical throughput of a simulated turbo-coded transmission. Next, we derive tight approximations for the end-to-end coded bit error rate (BER) of a general cooperative scheme with multiple parallel relays. Simulation results demonstrate the accuracy of our derivations for different cooperation configurations and conditions. © 2010 IEEE.

  16. Indirect Channel Sensing for Cognitive Amplify-and-Forward Relay Networks

    CERN Document Server

    Liu, Yipeng

    2011-01-01

    In cognitive radio network the primary channel information is beneficial. But it can not be obtained by direct channel estimation in cognitive system as pervious methods. And only one possible way is the primary receiver broadcasts the primary channel information to the cognitive users, but it would require the modification of the primary receiver and additional precious spectrum resource. Cooperative communication is also a promising technique. And this paper introduces an indirect channel sensing method for the primary channel in cognitive amplify-and-forward (AF) relay network. As the signal retransmitted from the primary AF relay node includes channel effects, the cognitive radio can receive retransmitted signal from AF node, and then extract the channel information from them. Afterwards, Least squares channel estimation and sparse channel estimation can be used to address the dense and sparse multipath channels respectively. Numerical experiment demonstrates that the proposed indirect channel sensing met...

  17. A General Achievable Rate Region for Multiple-Access Relay Channels and Some Certain Capacity Theorems

    CERN Document Server

    Osmani-Bojd, Mohammad; Hodtani, Ghosheh Abed

    2011-01-01

    In this paper, we obtain a general achievable rate region and some certain capacity theorems for multiple-access relay channel (MARC), using decode and forward (DAF) strategy at the relay, superposition coding at the transmitters. Our general rate region (i) generalizes the achievability part of Slepian-Wolf multiple-access capacity theorem to the MARC, (ii) extends the Cover-El Gamal best achievable rate for the relay channel with DAF strategy to the MARC, (iii) gives the Kramer-Wijengaarden rate region for the MARC, (iv) meets max-flow min-cut upper bound and leads to the capacity regions of some important classes of the MARC.

  18. Two Birds and One Stone: Gaussian Interference Channel with a Shared Out-of-Band Relay

    CERN Document Server

    Razaghi, Peyman; Zhou, Lei; Yu, Wei; Caire, Giuseppe

    2011-01-01

    The two-user Gaussian interference channel with a shared out-of-band relay is considered. The relay observes a linear combination of the source signals and broadcasts a common message to the two destinations, through a perfect link of fixed rate R_0 bits per channel use. The out-of-band nature of the relay is reflected by the fact that the common relay message does not interfere with the received signal at the two destinations. We are interested in designing "oblivious" relay strategies that incrementally improve upon the communication strategy in place, i.e., the source encoding strategy (apart from rate allocation) is independent of the relay presence. An ideal relay strategy would have a two-for-one gain, i.e., for every common bit relayed, the rate of each user is increased by one bit. We show that this ideal upper bound cannot be always achieved. Still, for a range of weak interference regimes and for R_0 below a certain threshold depending on signal-to-noise and interference-to-noise ratios (SNR and INR...

  19. Throughput Improvement and Its Tradeoff with The Queuing Delay in the Diamond Relay Networks

    CERN Document Server

    Wang, Qing; Letaief, Khaled Ben

    2009-01-01

    Diamond relay channel model, as a basic transmission model, has recently been attracting considerable attention in wireless Ad Hoc networks. Node cooperation and opportunistic scheduling scheme are two important techniques to improve the performance in wireless scenarios. In the paper we consider such a problem how to efficiently combine opportunistic scheduling and cooperative modes in the Rayleigh fading scenarios. To do so, we first compare the throughput of SRP (Spatial Reused Pattern) and AFP (Amplify Forwarding Pattern) in the half-duplex case with the assumption that channel side information is known to all and then come up with a new scheduling scheme. It will that that only switching between SRP and AFP simply does little help to obtain an expected improvement because SRP is always superior to AFP on average due to its efficient spatial reuse. To improve the throughput further, we put forward a new processing strategy in which buffers are employed at both relays in SRP mode. By efficiently utilizing ...

  20. A Cooperative Network Coding Strategy for the Interference Relay Channel

    CERN Document Server

    Bui, Huyen-Chi; Lacan, Jerome; Boucheret, Marie-Laure

    2012-01-01

    In this paper, we study an interference relay network with a satellite as relay. We propose a cooperative strategy based on physical layer network coding and superposition modulation decoding for uni-directional communications among users. The performance of our solution in terms of throughput is evaluated through capacity analysis and simulations that include practical constraints such as the lack of synchronization in time and frequency. We demonstrate throughputs significantly larger than the classical time sharing case.

  1. Pilot power optimization for AF relaying using maximum likelihood channel estimation

    KAUST Repository

    Wang, Kezhi

    2014-09-01

    Bit error rates (BERs) for amplify-and-forward (AF) relaying systems with two different pilot-symbol-aided channel estimation methods, disintegrated channel estimation (DCE) and cascaded channel estimation (CCE), are derived in Rayleigh fading channels. Based on these BERs, the pilot powers at the source and at the relay are optimized when their total transmitting powers are fixed. Numerical results show that the optimized system has a better performance than other conventional nonoptimized allocation systems. They also show that the optimal pilot power in variable gain is nearly the same as that in fixed gain for similar system settings. andcopy; 2014 IEEE.

  2. Investigation of phosphor-LED lamp for real-time half-duplex wireless VLC system

    Science.gov (United States)

    Yeh, Chien-Hung; Chow, Chi-Wai; Chen, Hsing-Yu; Liu, Yen-Liang; Hsu, Dar-Zu

    2016-06-01

    In this investigation, a 71.3 to 148.4 Mbit s-1 white phosphor-LED visible light communication (VLC) system is proposed and demonstrated under the practical transmission length of 140 to 210 cm. Here, a commercial white-light LED lamp with five cascaded phosphor-LED chips is utilized for illumination and communication simultaneously. In the measurement, we utilize the optical orthogonal frequency division multiplexing quadrature amplitude modulation (OFDM-QAM) with bit-loading algorithm and propose an optimal bias-tee circuit design to improve the modulation bandwidth from 1 MHz to 27 MHz. Moreover, a blue optical filter is not used on the client side. Finally, to realize and demonstrate the real-time transmission performance in the proposed LED VLC system, a commercial OFDM-based digital signal processor (DSP) chip is utilized on the LED lighting side and client side, respectively. Hence, the proposed real-time half-duplex VLC transmission could achieve the 70 Mbit s-1 downstream and upstream data throughputs, under a practical transmission length of 200 cm.

  3. Cellular Multi-User Two-Way MIMO AF Relaying via Signal Space Alignment: Minimum Weighted SINR Maximization

    CERN Document Server

    Chiu, Eddy

    2012-01-01

    In this paper, we consider linear MIMO transceiver design for a cellular two-way amplify-and-forward relaying system consisting of a single multi-antenna base station, a single multi-antenna relay station, and multiple multi-antenna mobile stations (MSs). Due to the two-way transmission, the MSs could suffer from tremendous multi-user interference. We apply an interference management model exploiting signal space alignment and propose a transceiver design algorithm, which allows for alleviating the loss in spectral efficiency due to half-duplex operation and providing flexible performance optimization accounting for each user's quality of service priorities. Numerical comparisons to conventional two-way relaying schemes based on bidirectional channel inversion and spatial division multiple access-only processing show that the proposed scheme achieves superior error rate and average data rate performance.

  4. Randomization for Security in Half-Duplex Two-Way Gaussian Channels

    CERN Document Server

    Gamal, Aly El; Gamal, Hesham El

    2009-01-01

    This paper develops a new physical layer framework for secure two-way wireless communication in the presence of a passive eavesdropper, i.e., Eve. Our approach achieves perfect information theoretic secrecy via a novel randomized scheduling and power allocation scheme. The key idea is to allow Alice and Bob to send symbols at random time instants. While Alice will be able to determine the symbols transmitted by Bob, Eve will suffer from ambiguity regarding the source of any particular symbol. This desirable ambiguity is enhanced, in our approach, by randomizing the transmit power level. Our theoretical analysis, in a 2-D geometry, reveals the ability of the proposed approach to achieve relatively high secure data rates under mild conditions on the spatial location of Eve. These theoretical claims are then validated by experimental results using IEEE 802.15.4-enabled sensor boards in different configurations, motivated by the spatial characteristics of Wireless Body Area Networks (WBAN).

  5. On achievable rates of interference and cognitive channels with a relay

    KAUST Repository

    Zorgui, Marwen

    2015-08-30

    We consider a two-user interference channel assisted by a relay. Treating interference as noise at the receivers, and adopting an amplify and forward (AF) strategy at the relay, we derive achievable rates of both users, for given powers. Next, we solve the optimal power allocation problem maximizing the weighted sum rate of both users with and without relay power optimization. In particular, we propose a simple iterative line search algorithm solving the joint optimization problem over the three transmit powers and show that optimizing the relay power enhances the performance of the system. Then, considering the first user as a primary user, we determine the maximum instantaneous rate that the secondary user can achieve subject to an outage constraint with respect to the primary user and a peak power constraint. We show that, likewise the first part, jointly optimizing the secondary user and the relay transmit powers enhances the secondary user performance.

  6. Maximizing Expected Achievable Rates for Block-Fading Buffer-Aided Relay Channels

    KAUST Repository

    Shaqfeh, Mohammad

    2016-05-25

    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.

  7. Relay selection based on MAP estimation for cooperative communication with outdated channel state information

    Institute of Scientific and Technical Information of China (English)

    Ding Wenrui; Fei Li; Gao Qiang; Liu Shuo

    2013-01-01

    In this paper,we consider an amplify-and-forward (AF) cooperative communication system when the channel state information (CSI) used in relay selection differs from that during data transmission,i.e.,the CSI used in relay selection is outdated.The selected relay may not be actually the best for data transmission and the outage performance of the cooperative system will deteriorate.To improve its performance,we propose a relay selection strategy based on maximum a posteriori (MAP) estimation,where relay is selected based on predicted signal-to-noise ratio (SNR).To reduce the computation complexity,we approximate the a posteriori probability density of SNR and obtain a closed-form predicted SNR,and a relay selection strategy based on the approximate MAP estimation (RS-AMAP) is proposed.The simulation results show that this approximation leads to trivial performance loss from the perspective of outage probability.Compared with relay selection strategies given in the literature,the outage probability is reduced largely through RS-AMAP for medium-to-large transmitting powers and medium-to-high channel correlation coefficients.

  8. Cyclic Communication and the Inseparability of MIMO Multi-way Relay Channels

    KAUST Repository

    Chaaban, Anas

    2015-10-27

    The K-user MIMO multi-way relay channel (Ychannel) consisting of K users with M antennas each and a common relay node with N antennas is studied in this paper. Each user wants to exchange messages with all the other users via the relay. A transmission strategy is proposed for this channel. The proposed strategy is based on two steps: channel diagonalization and cyclic communication. The channel diagonalization is applied by using zero-forcing beam-forming. After channel diagonalization, the channel is decomposed into parallel sub-channels. Cyclic communication is then applied, where signal-space alignment for network-coding is used over each sub-channel. The proposed strategy achieves the optimal DoF region of the channel if N M. To prove this, a new degrees-of-freedom outer bound is derived. As a by-product, we conclude that the MIMO Y-channel is not separable, i.e., independent coding on separate sub-channels is not enough, and one has to code jointly over several sub-channels.

  9. Lattice codes for the Gaussian relay channel: Decode-and-Forward and Compress-and-Forward

    CERN Document Server

    Song, Yiwei

    2011-01-01

    Lattice codes are known to achieve capacity in the Gaussian point-to-point channel, thereby achieving the same rates as random Gaussian codebooks. Lattice codes are also known to outperform random codes for certain channel models that are able to exploit their linearity. In this work, we show that lattice codes may be used to achieve the same performance as known Gaussian random coding techniques for the Gaussian relay channel, and show several examples of how this may be combined with the linearity of lattices codes in multi-source relay networks. In particular, we present a nested lattice list decoding technique, by which, lattice codes are shown to achieve the Decode-and-Forward (DF) rate of single source, single destination Gaussian relay channels with one or more relays. We next present a few examples of how this DF scheme may be combined with the linearity of lattice codes to achieve rates which may outperform analogous Gaussian random coding techniques in multi-source relay channels such as the two-way...

  10. Joint Linear Processing for an Amplify-and-Forward MIMO Relay Channel with Imperfect Channel State Information

    Directory of Open Access Journals (Sweden)

    Vandendorpe Luc

    2010-01-01

    Full Text Available The problem of jointly optimizing the source precoder, relay transceiver, and destination equalizer has been considered in this paper for a multiple-input-multiple-output (MIMO amplify-and-forward (AF relay channel, where the channel estimates of all links are assumed to be imperfect. The considered joint optimization problem is nonconvex and does not offer closed-form solutions. However, it has been shown that the optimization of one variable when others are fixed is a convex optimization problem which can be efficiently solved using interior-point algorithms. In this context, an iterative technique with the guaranteed convergence has been proposed for the AF MIMO relay channel that includes the direct link. It has been also shown that, for the double-hop relay case without the receive-side antenna correlations in each hop, the global optimality can be confirmed since the structures of the source precoder, relay transceiver, and destination equalizer have closed forms and the remaining joint power allocation can be solved using Geometric Programming (GP technique under high signal-to-noise ratio (SNR approximation. In the latter case, the performance of the iterative technique and the GP method has been compared with simulations to ensure that the iterative approach gives reasonably good solutions with an acceptable complexity. Moreover, simulation results verify the robustness of the proposed design when compared to the nonrobust design that assumes estimated channels as actual channels.

  11. Joint Linear Processing for an Amplify-and-Forward MIMO Relay Channel with Imperfect Channel State Information

    Science.gov (United States)

    Chalise, Batu K.; Vandendorpe, Luc

    2010-12-01

    The problem of jointly optimizing the source precoder, relay transceiver, and destination equalizer has been considered in this paper for a multiple-input-multiple-output (MIMO) amplify-and-forward (AF) relay channel, where the channel estimates of all links are assumed to be imperfect. The considered joint optimization problem is nonconvex and does not offer closed-form solutions. However, it has been shown that the optimization of one variable when others are fixed is a convex optimization problem which can be efficiently solved using interior-point algorithms. In this context, an iterative technique with the guaranteed convergence has been proposed for the AF MIMO relay channel that includes the direct link. It has been also shown that, for the double-hop relay case without the receive-side antenna correlations in each hop, the global optimality can be confirmed since the structures of the source precoder, relay transceiver, and destination equalizer have closed forms and the remaining joint power allocation can be solved using Geometric Programming (GP) technique under high signal-to-noise ratio (SNR) approximation. In the latter case, the performance of the iterative technique and the GP method has been compared with simulations to ensure that the iterative approach gives reasonably good solutions with an acceptable complexity. Moreover, simulation results verify the robustness of the proposed design when compared to the nonrobust design that assumes estimated channels as actual channels.

  12. On Outage Probability and Diversity-Multiplexing Tradeoff in MIMO Relay Channels

    CERN Document Server

    Loyka, Sergey

    2011-01-01

    Fading MIMO relay channels are studied analytically, when the source and destination are equipped with multiple antennas and the relays have a single one. Compact closed-form expressions are obtained for the outage probability under i.i.d. and correlated Rayleigh-fading links. Low-outage approximations are derived, which reveal a number of insights, including the impact of correlation, of the number of antennas, of relay noise and of relaying protocol. The effect of correlation is shown to be negligible, unless the channel becomes almost fully correlated. The SNR loss of relay fading channels compared to the AWGN channel is quantified. The SNR-asymptotic diversity-multiplexing tradeoff (DMT) is obtained for a broad class of fading distributions, including, as special cases, Rayleigh, Rice, Nakagami, Weibull, which may be non-identical, spatially correlated and/or non-zero mean. The DMT is shown to depend not on a particular fading distribution, but rather on its polynomial behavior near zero, and is the same ...

  13. Diversity of MIMO Multihop Relay Channels - Part I: Amplify-and-Forward

    CERN Document Server

    Yang Sheng

    2007-01-01

    In this two-part paper, we consider the multiantenna multihop relay channels in which the source signal arrives at the destination through N independent relaying hops in series. The main concern of this work is to design relaying strategies that utilize efficiently the relays in such a way that the diversity is maximized. In part I, we focus on the amplify-and-forward (AF) strategy with which the relays simply scale the received signal and retransmit it. More specifically, we characterize the diversity-multiplexing tradeoff (DMT) of the AF scheme in a general multihop channel with arbitrary number of antennas and arbitrary number of hops. The DMT is in closed-form expression as a function of the number of antennas at each node. First, we provide some basic results on the DMT of the general Rayleigh product channels. It turns out that these results have very simple and intuitive interpretation. Then, the results are applied to the AF multihop channels which is shown to be equivalent to the Rayleigh product cha...

  14. Energy-efficient cooperative protocols for full-duplex relay channels

    KAUST Repository

    Khafagy, Mohammad Galal

    2013-12-01

    In this work, energy-efficient cooperative protocols are studied for full-duplex relaying (FDR) with loopback interference. In these protocols, relay assistance is only sought under certain conditions on the different link outages to ensure effective cooperation. Recently, an energy-efficient selective decode-And-forward protocol was proposed for FDR, and was shown to outperform existing schemes in terms of outage. Here, we propose an incremental selective decode-And-forward protocol that offers additional power savings, while keeping the same outage performance. We compare the performance of the two protocols in terms of the end-to-end signal-to-noise ratio cumulative distribution function via closed-form expressions. Finally, we corroborate our theoretical results with simulation, and show the relative relay power savings in comparison to non-selective cooperation in which the relay cooperates regardless of channel conditions. © 2013 IEEE.

  15. The Three-User Finite Field Multi-Way Relay Channel with Correlated Sources

    CERN Document Server

    Ong, Lawrence; Lechner, Gottfried; Johnson, Sarah J; Kellett, Christopher M

    2012-01-01

    This paper studies the three-user finite field multi-way relay channel with correlated sources, where three users exchange possibly correlated messages via a relay. Full data exchange is considered where each user is to decode the messages from the other two users. There is no direct link among the users; the uplink from the users to the relay and the downlinks from the relay to the users are finite field adder channels with independent additive noise of arbitrary distributions. The problem is to determine the set of all achievable rates, defined as channel uses per source symbol for reliable communication. Using the Slepian-Wolf source coding and a functional-decode-forward channel coding scheme, the solution is obtained for two classes of source and channel combinations. Furthermore, for correlated sources with common cores, two new functional-decode-forward coding schemes are constructed and are shown to obtain the set of all achievable rates for any source and channel combination.

  16. Performance Analysis of Beamforming in Fixed-gain AF Relay Networks with Asymmetric Correlated Fading Channels

    Science.gov (United States)

    Li, Min

    2014-07-01

    In this paper, the performance of beamforming (BF) for a dual-hop amplify-and-forward (AF) relay network, where the source and destination are each equipped with multiple antennas, is investigated. It is assumed that the source-relay and relay-destination channels experience mixed fading distributions, namely, correlated Nakagami-m/Rician and correlated Rician/Nakagami-m, respectively. By considering fixed-gain relaying, analytical expressions for outage probability (OP) and average symbol error rate (ASER) are derived in closed-form. Numerical results are presented to demonstrate the efficacy of our performance analysis, also illustrate the impact of channel correlation, fading severity, Rician factor and antenna configuration on the performance of the system. It is shown that the correlated Nakagami-m/Rician fading channel can achieve better performance than the correlated Rician/Nakagami-m fading channel with the increase of fading severity parameter, and the correlated Rician/Nakagami-m fading channel may outperform the correlated Nakagami-m/Rician fading channel by enlarging the Rician factor.

  17. Performance analysis of amplify-and-forward two-way relaying with co-channel interference and channel estimation error

    KAUST Repository

    Yang, Liang

    2013-04-01

    In this paper, we consider the performance of a two-way amplify-and-forward relaying network (AF TWRN) in the presence of unequal power co-channel interferers (CCI). Specifically, we consider AF TWRN with an interference-limited relay and two noisy-nodes with channel estimation error and CCI. We derive the approximate signal-to-interference plus noise ratio expressions and then use these expressions to evaluate the outage probability and error probability. Numerical results show that the approximate closed-form expressions are very close to the exact ones. © 2013 IEEE.

  18. Joint Network Coding and Opportunistic Scheduling for the Bidirectional Relay Channel

    KAUST Repository

    Shaqfeh, Mohammad

    2013-05-27

    In this paper, we consider a two-way communication system in which two users communicate with each other through an intermediate relay over block-fading channels. We investigate the optimal opportunistic scheduling scheme in order to maximize the long-term average transmission rate in the system assuming symmetric information flow between the two users. Based on the channel state information, the scheduler decides that either one of the users transmits to the relay, or the relay transmits to a single user or broadcasts to both users a combined version of the two users’ transmitted information by using linear network coding. We obtain the optimal scheduling scheme by using the Lagrangian dual problem. Furthermore, in order to characterize the gains of network coding and opportunistic scheduling, we compare the achievable rate of the system versus suboptimal schemes in which the gains of network coding and opportunistic scheduling are partially exploited.

  19. Cooperative jamming power control to enhance secrecy communications of AF Relaying systems for Rayleigh fading channel

    KAUST Repository

    Park, Kihong

    2012-09-01

    In this paper, we investigate secrecy communications in two-hop wireless relaying networks which consist of one source, one amplify-and-forward (AF) relay, one legitimate destination, and one eavesdropper. To prevent the eavesdropper from intercepting the source message, we make the destination send the intended noise to the AF relay during the first phase. This is referred to as cooperative jamming. According to the channel information at the destination, we address two types of jamming power allocation; (i) rate-optimal power allocation and (ii) outage-optimal power allocation. More specifically, without the instantaneous channel knowledge for the eavesdropper side, the outage probability of the secrecy rate is minimized with respect to the intended noise power level. We show that the outage-optimal allocation gives almost the same outage probability as the rateoptimal one. In addition, the jamming power consumption can be significantly reduced compared to the fixed and rate-optimal power allocation methods. © 2012 IEEE.

  20. CHANNEL ESTIMATION TECHNIQUE IN MULTI-ANTENNA AF RELAY COMMUNICATION SYSTEMS

    Institute of Scientific and Technical Information of China (English)

    Chen Mingxue; Xu Chengqi

    2011-01-01

    The channel estimation technique is investigated in OFDM communication systems with multi-antenna Amplify-and-Forward (AF) relay.The Space-Time Block Code (STBC) is applied at the transmitter of the relay to obtain diversity gain.According to the transmission characteristics of OFDM symbols on multiple antennas,a pilot-aided Linear Minimum Mean-Square-Error (LMMSE) channel estimation algorithm with low complexity is designed.Simulation results show that,the proposed LMMSE estimator outperforms least-square estimator and approaches the optimal estimator without error in the performance of Symbol Error Ratio (SER) under several modulation modes,and has a good estimation effect in the realistic relay communication scenario.

  1. Block compressed sensing for feedback reduction in relay-aided multiuser full duplex networks

    KAUST Repository

    Elkhalil, Khalil

    2016-08-11

    Opportunistic user selection is a simple technique that exploits the spatial diversity in multiuser relay-aided networks. Nonetheless, channel state information (CSI) from all users (and cooperating relays) is generally required at a central node in order to make selection decisions. Practically, CSI acquisition generates a great deal of feedback overhead that could result in significant transmission delays. In addition to this, the presence of a full-duplex cooperating relay corrupts the fed back CSI by additive noise and the relay\\'s loop (or self) interference. This could lead to transmission outages if user selection is based on inaccurate feedback information. In this paper, we propose an opportunistic full-duplex feedback algorithm that tackles the above challenges. We cast the problem of joint user signal-to-noise ratio (SNR) and the relay loop interference estimation at the base-station as a block sparse signal recovery problem in compressive sensing (CS). Using existing CS block recovery algorithms, the identity of the strong users is obtained and their corresponding SNRs are estimated. Numerical results show that the proposed technique drastically reduces the feedback overhead and achieves a rate close to that obtained by techniques that require dedicated error-free feedback from all users. Numerical results also show that there is a trade-off between the feedback interference and load, and for short coherence intervals, full-duplex feedback achieves higher throughput when compared to interference-free (half-duplex) feedback. © 2016 IEEE.

  2. Joint Channel Estimation and Data Detection for Multihop OFDM Relaying System under Unknown Channel Orders and Doppler Frequencies

    CERN Document Server

    Min, Rui

    2012-01-01

    In this paper, channel estimation and data detection for multihop relaying orthogonal frequency division multiplexing (OFDM) system is investigated under time-varying channel. Different from previous works, which highly depend on the statistical information of the doubly-selective channel (DSC) and noise to deliver accurate channel estimation and data detection results, we focus on more practical scenarios with unknown channel orders and Doppler frequencies. Firstly, we integrate the multilink, multihop channel matrices into one composite channel matrix. Then, we formulate the unknown channel using generalized complex exponential basis expansion model (GCE-BEM) with a large oversampling factor to introduce channel sparsity on delay-Doppler domain. To enable the identification of nonzero entries, sparsity enhancing Gaussian distributions with Gamma hyperpriors are adopted. An iterative algorithm is developed under variational inference (VI) framework. The proposed algorithm iteratively estimate the channel, re...

  3. Outage probability of opportunistic decode-and-forward relaying over Nakagami-m fading channels

    Institute of Scientific and Technical Information of China (English)

    CHUAI Gang; ZHANG Bao-zhi; LIU Xing-mei; GAO Li

    2009-01-01

    In this article, the outage probability behavior of a relay network over Nakagami-m fading channels is analyzed. Both reactive and proactive opportunistic decode-and-forward (DAF) strategies are considered. The closed-form solutions to the outage probabilities on both opportunistic DAF strategies are derived. Simulation results conf'Lrrn the presented mathematical analysis.

  4. On the Capacity of the Interference Channel with a Cognitive Relay

    CERN Document Server

    Rini, Stefano; Devroye, Natasha; Goldsmith, Andrea

    2011-01-01

    The InterFerence Channel with a Cognitive Relay (IFC-CR) consists of the classical interference channel with two independent source-destination pairs whose communication is aided by an additional node, referred to as the cognitive relay, that has a priori knowledge of both sources' messages. This a priori message knowledge is termed cognition and idealizes the relay learning the messages of the two sources from their transmissions over a wireless channel. This paper presents new inner and outer bounds for the capacity region of the general memoryless IFC-CR that are shown to be tight for a certain class of channels. The new outer bound follows from arguments originally devised for broadcast channels among which Sato's observation that the capacity region of channels with non-cooperative receivers only depends on the channel output conditional marginal distributions. The new inner bound is shown to include all previously proposed coding schemes and it is thus the largest known achievable rate region to date. T...

  5. Improper Gaussian signaling in full-duplex relay channels with residual self-interference

    KAUST Repository

    Gaafar, Mohamed

    2016-07-26

    We study the potential employment of improper Gaussian signaling (IGS) in full-duplex cooperative settings with residual self-interference (RSI). IGS is recently shown to outperform traditional proper Gaussian signaling (PGS) in several interference-limited channel settings. In this work, IGS is employed in an attempt to alleviate the RSI adverse effect in full-duplex relaying (FDR). To this end, we derive a tight upper bound expression for the end-to-end outage probability in terms of the relay signal parameters represented in its power and circularity coefficient. We further show that the derived upper bound is either monotonic or unimodal in the relay\\'s circularity coefficient. This result allows for easily locating the global optimal point using known numerical methods. Based on the analysis, IGS allows FDR systems to operate even with high RSI. It is shown that, while the communication totally fails with PGS as the RSI increases, the IGS outage probability approaches a fixed value that depends on the channel statistics and target rate. The obtained results show that IGS can leverage higher relay power budgets than PGS to improve the performance, meanwhile it relieves its RSI impact via tuning the signal impropriety. © 2016 IEEE.

  6. Full-diversity partial interference cancellation for multi-user wireless relaying networks

    KAUST Repository

    El Astal, M. T O

    2013-12-01

    We focus on the uplink channel of multi-user wireless relaying networks in a coverage extension scenario. The network consists of two users, a single half duplex (HD) relay and a destination, all equipped with multiple antennas. Perfect channel state information (CSI) is assumed to be available exclusively at the receiving nodes (i.e., the relay and the destination) while the users are assumed to be completely blind. The communication through the considered network takes place over two phases. During the first phase, both users send their information concurrently to the relay. The second phase consists of decoding the received data and forwarding it simultaneously to the destination. A transmission scheme that achieves full-diversity under partial interference cancellation (PIC) group decoding is proposed. Unlike many existing schemes, it allows the concurrent transmission in both phases while achieving the full-diversity gain of full time division multiple access (TDMA) transmission regardless of the number of antennas at each node. Numerical comparison with existing schemes in the literature is provided to corroborate our theoretical claims. It is found that our interference cancellation (IC) scheme clearly outperforms existing schemes at the expense of an affordable increase in decoding complexity at both of the relay and destination. © 2013 IEEE.

  7. Outage Performance Analysis of Cooperative Diversity with MRC and SC in Correlated Lognormal Channels

    Directory of Open Access Journals (Sweden)

    Skraparlis D

    2009-01-01

    Full Text Available Abstract The study of relaying systems has found renewed interest in the context of cooperative diversity for communication channels suffering from fading. This paper provides analytical expressions for the end-to-end SNR and outage probability of cooperative diversity in correlated lognormal channels, typically found in indoor and specific outdoor environments. The system under consideration utilizes decode-and-forward relaying and Selection Combining or Maximum Ratio Combining at the destination node. The provided expressions are used to evaluate the gains of cooperative diversity compared to noncooperation in correlated lognormal channels, taking into account the spectral and energy efficiency of the protocols and the half-duplex or full-duplex capability of the relay. Our analysis demonstrates that correlation and lognormal variances play a significant role on the performance gain of cooperative diversity against noncooperation.

  8. Performance analysis of best relay selection scheme for amplify-and-forward cooperative networks in identical Nakagami-m channels

    KAUST Repository

    Hussain, Syed Imtiaz

    2010-06-01

    In cooperative communication networks, the use of multiple relays between the source and the destination was proposed to increase the diversity gain. Since the source and all the relays must transmit on orthogonal channels, multiple relay cooperation is considered inefficient in terms of channel resources and bandwidth utilization. To overcome this problem, the concept of best relay selection was recently proposed. In this paper, we analyze the performance of the best relay selection scheme for a cooperative network with multiple relays operating in amplify-and-forward (AF) mode over identical Nakagami-m channels using exact source-relay-destination signal to noise ratio (SNR) expression. We derive accurate closed form expressions for various system parameters including probability density function (pdf) of end-to-end SNR, average output SNR, average probability of bit error and average channel capacity. T he analytical results are verified through extensive simulations. It is shown that the best relay selection scheme performs better than the regular all relay cooperation.

  9. Preamble-based channel estimation in single-relay networks using FBMC/OQAM

    Science.gov (United States)

    Mavrokefalidis, Christos; Kofidis, Eleftherios; Rontogiannis, Athanasios A.; Theodoridis, Sergios

    2014-12-01

    Preamble-based channel estimation in filter bank-based multicarrier (FBMC) systems using offset quadrature amplitude modulation (OQAM) has been extensively studied in the last few years, due to the many advantages this modulation scheme can offer over cyclic prefix (CP)-based orthogonal frequency division multiplexing (OFDM) and in view of the interesting challenges posed on the channel estimator by the interference effect inherent in such an FBMC system. In particular, preambles of short duration and of both the block ( full) and comb ( sparse) types were designed so as to minimize the channel estimation mean squared error (MSE) subject to a given transmit energy. In the light of the important role that relay-based cooperative networks are expected to play in future wireless communication systems, it is of interest to consider FBMC/OQAM, and in particular questions associated to preamble-based channel estimation, in such a context as well. The goal of this paper is to address these problems and come up with optimal solutions that extend existing results in a single relay-based cooperative network. Both low and medium frequency selective channels are considered. In addition to optimal preamble and estimator design, the equalization/detection task is studied, shedding light to a relay-generated interference effect and proposing a simple way to come over it. The reported simulation results corroborate the analysis and reveal interesting behavior with respect to channel frequency selectivity and signal-to-noise ratio.

  10. Superimposed XOR: Approaching Capacity Bounds of the Two-Way Relay Channels

    CERN Document Server

    Liu, Jianquan; Xu, Youyun; Wang, Xiaodong

    2010-01-01

    In two-way relay channels, bitwise XOR and symbol-level superposition coding are two popular network-coding based relaying schemes. However, neither of them can approach the capacity bound when the channels in the broadcast phase are asymmetric. In this paper, we present a new physical layer network coding (PLNC) scheme, called \\emph{superimposed XOR}. The new scheme advances the existing schemes by specifically taking into account the channel asymmetry as well as information asymmetry in the broadcast phase. We obtain its achievable rate regions over Gaussian channels when integrated with two known time control protocols in two-way relaying. We also demonstrate their average maximum sum-rates and service delay performances over fading channels. Numerical results show that the proposed superimposed XOR achieves a larger rate region than both XOR and superposition and performs much better over fading channels. We further deduce the boundary of its achievable rate region of the broadcast phase in an explicit an...

  11. Downlink Error Rates of Half-duplex Users in Full-duplex Networks over a Laplacian Inter-User Interference Limited and EGK fading

    KAUST Repository

    Soury, Hamza

    2017-03-14

    This paper develops a mathematical framework to study downlink error rates and throughput for half-duplex (HD) terminals served by a full-duplex (FD) base station (BS). The developed model is used to motivate long term pairing for users that have non-line of sight (NLOS) interfering link. Consequently, we study the interferer limited problem that appears between NLOS HD users-pair that are scheduled on the same FD channel. The distribution of the interference is first characterized via its distribution function, which is derived in closed form. Then, a comprehensive performance assessment for the proposed pairing scheme is provided by assuming Extended Generalized- $cal{K}$ (EGK) fading for the downlink and studying different modulation schemes. To this end, a unified closed form expression for the average symbol error rate is derived. Furthermore, we show the effective downlink throughput gain harvested by the pairing NLOS users as a function of the average signal-to-interferenceratio when compared to an idealized HD scenario with neither interference nor noise. Finally, we show the minimum required channel gain pairing threshold to harvest downlink throughput via the FD operation when compared to the HD case for each modulation scheme.

  12. A Novel Secure Transmission Scheme in MIMO Two-Way Relay Channels with Physical Layer Approach

    Directory of Open Access Journals (Sweden)

    Qiao Liu

    2017-01-01

    Full Text Available Security issue has been considered as one of the most pivotal aspects for the fifth-generation mobile network (5G due to the increasing demands of security service as well as the growing occurrence of security threat. In this paper, instead of focusing on the security architecture in the upper layer, we investigate the secure transmission for a basic channel model in a heterogeneous network, that is, two-way relay channels. By exploiting the properties of the transmission medium in the physical layer, we propose a novel secure scheme for the aforementioned channel mode. With precoding design, the proposed scheme is able to achieve a high transmission efficiency as well as security. Two different approaches have been introduced: information theoretical approach and physical layer encryption approach. We show that our scheme is secure under three different adversarial models: (1 untrusted relay attack model, (2 trusted relay with eavesdropper attack model, and (3 untrusted relay with eavesdroppers attack model. We also derive the secrecy capacity of the two different approaches under the three attacks. Finally, we conduct three simulations of our proposed scheme. The simulation results agree with the theoretical analysis illustrating that our proposed scheme could achieve a better performance than the existing schemes.

  13. Joint Network Coding and Opportunistic Transmission for Two-Way Relay Fading Channels

    CERN Document Server

    Liu, Jianquan; Xu, Youyun

    2011-01-01

    We investigate a two-way relay (TWR) fading channel where two source nodes wish to exchange information with the help of a relay node. The capacity of two-way relaying is known to be limited by the hop with weak channel condition due to immediate forwarding. In this paper, we introduce store-andforward (SF) relay protocol and present a joint network coding and opportunistic transmission (NCOT) for TWR channel. Through the use of NCOT method, a new upper bound on the ergodic sum-capacity for the TWR fading system is derived when delay tends to infinity. We further propose two alternative awaiting and broadcast (AAB) schemes: pure partial decoding (PPD) with SF-I and combinatorial decoding (CBD) with SF-II, which approach the new upper bound at high SNR with unbounded and bounded delay respectively. Numerical results show that the proposed AAB schemes significantly outperform the traditional physical layer network coding (PLNC) methods without delay. Compared to the traditional TWR schemes without delay, the pr...

  14. Energy-harvesting in cooperative AF relaying networks over log-normal fading channels

    KAUST Repository

    Rabie, Khaled M.

    2016-07-26

    Energy-harvesting (EH) and wireless power transfer are increasingly becoming a promising source of power in future wireless networks and have recently attracted a considerable amount of research, particularly on cooperative two-hop relay networks in Rayleigh fading channels. In contrast, this paper investigates the performance of wireless power transfer based two-hop cooperative relaying systems in indoor channels characterized by log-normal fading. Specifically, two EH protocols are considered here, namely, time switching relaying (TSR) and power splitting relaying (PSR). Our findings include accurate analytical expressions for the ergodic capacity and ergodic outage probability for the two aforementioned protocols. Monte Carlo simulations are used throughout to confirm the accuracy of our analysis. The results show that increasing the channel variance will always provide better ergodic capacity performance. It is also shown that a good selection of the EH time in the TSR protocol, and the power splitting factor in the PTS protocol, is the key to achieve the best system performance. © 2016 IEEE.

  15. Alternative Awaiting and Broadcast for Two-Way Relay Fading Channels

    CERN Document Server

    Liu, Jianquan; Tao, Meixia

    2011-01-01

    We investigate a two-way relay (TWR) fading channel based on store-and-forward (SF), where two source nodes wish to exchange information with the help of a relay node. A new upper bound on the ergodic sum-capacity for the TWR fading system is derived when delay tends to infinity.We further propose two alternative awaiting and broadcast (AAB) schemes: pure partial decoding (PPD) with SF-I and combinatorial decoding (CBD) with SF-II, which approach the new upper bound at high SNR with unbounded and bounded delay respectively. Numerical results show that the proposed AAB schemes significantly outperform the traditional physical layer network coding (PLNC) methods without delay. Compared to the traditional TWR schemes without delay, the proposed CBD with SF-II method significantly improves the maximum sum-rate with an average delay of only some dozen seconds in the relay buffer.

  16. Symbol Error Probability of DF Relay Selection over Arbitrary Nakagami-m Fading Channels

    Directory of Open Access Journals (Sweden)

    George C. Alexandropoulos

    2013-01-01

    Full Text Available We present a new analytical expression for the moment generating function (MGF of the end-to-end signal-to-noise ratio of dual-hop decode-and-forward (DF relaying systems with relay selection when operating over Nakagami-m fading channels. The derived MGF expression, which is valid for arbitrary values of the fading parameters of both hops, is subsequently utilized to evaluate the average symbol error probability (ASEP of M-ary phase shift keying modulation for the considered DF relaying scheme under various asymmetric fading conditions. It is shown that the MGF-based ASEP performance evaluation results are in excellent agreement with equivalent ones obtained by means of computer simulations, thus validating the correctness of the presented MGF expression.

  17. Exact capacity analysis of multihop transmission over amplify-and-forward relay fading channels

    KAUST Repository

    Yilmaz, Ferkan

    2010-09-01

    In this paper, we propose an analytical framework on the exact computation of the average capacity of multihop transmission over amplify-and-forward relay fading channels. Our approach relies on the algebraic combination of Mellin and Laplace transforms to obtain exact single integral expressions which can be easily computed by Gauss-Chebyshev Quadrature (GCQ) rule. As such, the derived results are a convenient tool to analyze the average capacity of multihop transmission over amplify-and-forward relay fading channels. As an application of the analytical framework on the exact computation of the average capacity of multihop transmission, some examples are accentuated for generalized Nakagami-m fading channels. Numerical and simulation results, performed to verify the correctness of the proposed formulation, are in perfect agreement. ©2010 IEEE.

  18. Overlay Cognitive Radios With Channel-Aware Adaptive Link Selection and Buffer-Aided Relaying

    KAUST Repository

    Shaqfeh, Mohammad

    2015-08-01

    The aim of this work is to maximize the long-term average achievable rate region of a primary and a secondary source-destination pairs operating in an overlay setup over block-fading channels. To achieve this objective, we propose an opportunistic strategy to grant channel access to the primary and secondary sources based on the channel conditions in order to exploit the available multiple-link diversity gains in the system. The secondary source has causal knowledge of the primary messages and it acts as a relay of the primary source in return for getting access to the channel. To maximize the gains of relaying, the relay and destination are equipped with buffers to enable the use of channel-aware adaptive link selection. We propose and optimize different link selection policies and characterize their expected achievable rates. Also, we provide several numerical results to demonstrate the evident mutual benefits of buffer-aided cooperation and adaptive link selection to the primary and the secondary source-destination pairs. © 1972-2012 IEEE.

  19. On Amplify-and-Forward Relaying Over Hyper-Rayleigh Fading Channels

    Directory of Open Access Journals (Sweden)

    S. H. Alvi

    2014-12-01

    Full Text Available Relayed transmission holds promise for the next generation of wireless communication systems due to the performance gains it can provide over non-cooperative systems. Recently hyper-Rayleigh fading, which represents fading conditions more severe than Rayleigh fading, has received attention in the context of many practical communication scenarios. Though power allocation for Amplify-and-Forward (AF relaying networks has been studied in the literature, a theoretical analysis of the power allocation problem for hyper-Rayleigh fading channels is a novel contribution of this work. We develop an optimal power allocation (OPA strategy for a dual-hop AF relaying network in which the relay-destination link experiences hyper-Rayleigh fading. A new closed-form expression for the average signal-to-noise ratio (SNR at destination is derived and it is shown to provide a new upper-bound on the average SNR at destination, which outperforms a previously proposed upper-bound based on the well-known harmonic-geometric mean inequality. An OPA across the source and relay nodes, subject to a sum-power constraint, is proposed and it is shown to provide measurable performance gains in average SNR and SNR outage at the destination relative to the case of equal power allocation.

  20. Exact outage analysis of the effect of co-channel interference on secured multi-hop relaying networks

    Science.gov (United States)

    Quang Nguyen, Sang; Kong, Hyung Yun

    2016-11-01

    In this article, the presence of multi-hop relaying, eavesdropper and co-channel interference (CCI) in the same system model is investigated. Specifically, the effect of CCI on a secured multi-hop relaying network is studied, in which the source communicates with the destination via multi-relay-hopping under the presence of an eavesdropper and CCI at each node. The optimal relay at each cluster is selected to help forward the message from the source to the destination. We apply two relay selection approaches to such a system model, i.e. the optimal relay is chosen based on (1) the maximum channel gain from the transmitter to all relays in the desired cluster and (2) the minimum channel gain from the eavesdropper to all relays in each cluster. For the performance evaluation and comparison, we derived the exact closed form of the secrecy outage probability of the two approaches. That analysis is verified by Monte Carlo simulation. Finally, the effects of the number of hops, the transmit power at the source, relays and the external sources, the distance between the external sources and each node in the system, and the location of the eavesdropper are presented and discussed.

  1. Two-Layer Coding Rate Optimization in Relay-Aided Systems

    DEFF Research Database (Denmark)

    Sun, Fan

    2011-01-01

    We consider a three-node transmission system, where a source node conveys a data block to a destination node with the help of a half-duplex decode and-forward (DF) relay node. The whole data block is transmitted as a sequence of packets. For reliable transmission in the three-node system, a two......-layer coding scheme is proposed, where physical layer channel coding is utilized within each packet for error-correction and random network coding is applied on top of channel coding for network error-control. There is a natural tradeoff between the physical layer coding rate and the network coding rate given...... requirement. Numerical results are also provided to show the optimized physical layer coding and network coding rate pairs in different system scenarios....

  2. Exact Performance Analysis of Partial Relay Selection Based on Shadowing Side Information over Generalized Composite Fading Channels

    CERN Document Server

    Yilmaz, Ferkan

    2011-01-01

    Relay technology has recently gained great interest in millimeter wave (60 GHz or above) radio frequencies as a promising transmission technique improving the quality of service, providing high data rate, and extending the coverage area without additional transmit power in deeply shadowed wireless environments. The performance of relay-based systems depends considerably on which relay selection protocols are used. These protocols are typically using the channel side information (CSI). Specifically, the relay terminal (RT) is chosen among all available RTs by a centralized entity (CE) which receives all RTs' CSI via feedback channels. However, in the millimeter wave radio frequencies, the rate of the variation of the CSI is much higher than that of a classical system operating in 6 GHz frequencies under the same mobility conditions, which evidently results in a serious problem causing outdated (inaccurate) CSI for the relay selection protocol at the CE since the feedback channels have a backhaul / transmission...

  3. Parity-Check Network Coding for Multiple Access Relay Channel in Wireless Sensor Cooperative Communications

    Directory of Open Access Journals (Sweden)

    Du Bing

    2010-01-01

    Full Text Available A recently developed theory suggests that network coding is a generalization of source coding and channel coding and thus yields a significant performance improvement in terms of throughput and spatial diversity. This paper proposes a cooperative design of a parity-check network coding scheme in the context of a two-source multiple access relay channel (MARC model, a common compact model in hierarchical wireless sensor networks (WSNs. The scheme uses Low-Density Parity-Check (LDPC as the surrogate to build up a layered structure which encapsulates the multiple constituent LDPC codes in the source and relay nodes. Specifically, the relay node decodes the messages from two sources, which are used to generate extra parity-check bits by a random network coding procedure to fill up the rate gap between Source-Relay and Source-Destination transmissions. Then, we derived the key algebraic relationships among multidimensional LDPC constituent codes as one of the constraints for code profile optimization. These extra check bits are sent to the destination to realize a cooperative diversity as well as to approach MARC decode-and-forward (DF capacity.

  4. An Optimal Transmission Strategy for Joint Wireless Information and Energy Transfer in MIMO Relay Channels

    Directory of Open Access Journals (Sweden)

    Dingcheng Yang

    2015-01-01

    Full Text Available An optimal resource allocation strategy for MIMO relay system is considered in simultaneous wireless information and energy transfer network, where two users with multiple antennas communicate with each other assisted by an energy harvesting MIMO relay that gathers energy from the received signal by applying time switching scheme and forwards the received signal by using the harvesting energy. It is focused on the precoder design and resource allocation strategies for the system to allocate the resources among the nodes in decode-and-forward (DF mode. Specifically, optimal precoder design and energy transfer strategy in MIMO relay channel are firstly proposed. Then, we formulate the resource allocation optimization problem. The closed-form solutions for the time and power allocation are derived. It is revealed that the solution can flexibly allocate the resource for the MIMO relay channel to maximize the sum rate of the system. Simulation results demonstrated that the performance of the proposed algorithm outperforms the traditional fixed method.

  5. Coding and Decoding for the Dynamic Decode and Forward Relay Protocol

    CERN Document Server

    Kumar, K Raj

    2008-01-01

    We study the Dynamic Decode and Forward (DDF) protocol for a single half-duplex relay, single-antenna channel with quasi-static fading. The DDF protocol is well-known and has been analyzed in terms of the Diversity-Multiplexing Tradeoff (DMT) in the infinite block length limit. We characterize the finite block length DMT and give new explicit code constructions. The finite block length analysis illuminates a few key aspects that have been neglected in the previous literature: 1) we show that one dominating cause of degradation with respect to the infinite block length regime is the event of decoding error at the relay; 2) we explicitly take into account the fact that the destination does not generally know a priori the relay decision time at which the relay switches from listening to transmit mode. Both the above problems can be tackled by a careful design of the decoding algorithm. In particular, we introduce a decision rejection criterion at the relay based on Forney's decision rule (a variant of the Neyman...

  6. A Comparative Study of Relaying Schemes with Decode-and-Forward over Nakagami-m Fading Channels

    CERN Document Server

    Alexandropoulos, George C; Sofotasios, Paschalis C

    2011-01-01

    Utilizing relaying techniques to improve performance of wireless systems is a promising avenue. However, it is crucial to understand what type of relaying schemes should be used for achieving different performance objectives under realistic fading conditions. In this paper, we present a general framework for modelling and evaluating the performance of relaying schemes based on the decode-and-forward (DF) protocol over independent and not necessarily identically distributed (INID) Nakagami-m fading channels. In particular, we present closed-form expressions for the statistics of the instantaneous output signal-to-noise ratio of four significant relaying schemes with DF; two based on repetitive transmission and the other two based on relay selection (RS). These expressions are then used to obtain closed-form expressions for the outage probability and the average symbol error probability for several modulations of all considered relaying schemes over INID Nakagami-m fading. Importantly, it is shown that when the...

  7. Broadband transceiver design of distributed amplify-and-forward MIMO relays in correlated channels

    Science.gov (United States)

    Hu, Chia-Chang; Tang, Kang-Tsao

    2013-12-01

    Combined optimization of the source precoder, relay weighting matrices, and destination decoder is proposed in dual-hop amplify-and-forward (AF) multiple-input multiple-output (MIMO) multiple-relay networks with the source-to-destination link in correlated channels. This broadband cooperative transceiver design is studied based on the minimum mean-squared error (MMSE) criterion under correlated fading channels. The optimization problem belongs neither concave nor convex so that an iterative nonlinear matrix conjugate gradient (MCG) search algorithm is applied to explore local optimal solutions. Simulation results show that the broadband cooperative transceiver joint architecture performs better the non-cooperative transceiver design in terms of the bit-error-rate (BER).

  8. On Achievable Rate Regions of the Asymmetric AWGN Two-Way Relay Channel

    CERN Document Server

    Ong, Lawrence; Johnson, Sarah J

    2011-01-01

    This paper investigates the additive white Gaussian noise two-way relay channel, where two users exchange messages through a relay. Asymmetrical channels are considered where the users can transmit data at different rates and at different power levels. We modify and improve existing coding schemes to obtain three new achievable rate regions. Comparing four downlink-optimal coding schemes, we show that the scheme that gives the best sum-rate performance is (i) complete-decode-forward, when both users transmit at low signal-to-noise ratio (SNR); (ii) functional-decode-forward with nested lattice codes, when both users transmit at high SNR; (iii) functional-decode-forward with rate splitting and time-division multiplexing, when one user transmits at low SNR and another user at medium--high SNR.

  9. On the Feedback Reduction of Relay Multiuser Networks using Compressive Sensing

    KAUST Repository

    Elkhalil, Khalil

    2016-01-29

    This paper presents a comprehensive performance analysis of full-duplex multiuser relay networks employing opportunistic scheduling with noisy and compressive feedback. Specifically, two feedback techniques based on compressive sensing (CS) theory are introduced and their effect on the system performance is analyzed. The problem of joint user identity and signal-tonoise ratio (SNR) estimation at the base-station is casted as a block sparse signal recovery problem in CS. Using existing CS block recovery algorithms, the identity of the strong users is obtained and their corresponding SNRs are estimated using the best linear unbiased estimator (BLUE). To minimize the effect of feedback noise on the estimated SNRs, a back-off strategy that optimally backs-off on the noisy estimated SNRs is introduced, and the error covariance matrix of the noise after CS recovery is derived. Finally, closed-form expressions for the end-to-end SNRs of the system are derived. Numerical results show that the proposed techniques drastically reduce the feedback air-time and achieve a rate close to that obtained by scheduling techniques that require dedicated error-free feedback from all network users. Key findings of this paper suggest that the choice of half-duplex or full-duplex SNR feedback is dependent on the channel coherence interval, and on low coherence intervals, full-duplex feedback is superior to the interference-free half-duplex feedback.

  10. Relay Channel with Orthogonal Components and Structured Interference Known at the Source

    OpenAIRE

    Bakanoglu, Kagan; Erkip, Elza; Simeone, Osvaldo; Shamai, Sholomo

    2012-01-01

    A relay channel with orthogonal components that is affected by an interference signal that is noncausally available only at the source is studied. The interference signal has structure in that it is produced by another transmitter communicating with its own destination. Moreover, the interferer is not willing to adjust its communication strategy to minimize the interference. Knowledge of the interferer's signal may be acquired by the source, for instance, by exploiting HARQ retransmissions on...

  11. Transceiver Design at Relay and Destination for Dual-Hop Non-regenerative MIMO-OFDM Relay Systems Under Channel Uncertainties

    CERN Document Server

    Xing, Chengwen; Wu, Yik-Chung; Ng, Tung-Sang

    2010-01-01

    In this paper, joint design of linear relay precoder and destination equalizer for dual-hop non-regenerative amplify-and-forward (AF) MIMO-OFDM systems under channel estimation errors is investigated. Second order moments of channel estimation errors in the two hops are first deduced. Then based on the Bayesian framework, joint design of linear robust precoder at the relay and equalizer at the destination is proposed to minimize the total mean-square-error (MSE) of the output signal at the destination. The optimal designs for both correlated and uncorrelated channel estimation errors are considered. The relationship with existing algorithms is also disclosed. Simulation results show that the proposed robust designs outperform the design based on estimated channel state information only.

  12. Cooperative Transmission for Relay Networks Based on Second-Order Statistics of Channel State Information

    Science.gov (United States)

    Li, Jiangyuan; Petropulu, Athina P.; Poor, H. Vincent

    2011-03-01

    Cooperative beamforming in relay networks is considered, in which a source transmits to its destination with the help of a set of cooperating nodes. The source first transmits locally. The cooperating nodes that receive the source signal retransmit a weighted version of it in an amplify-and-forward (AF) fashion. Assuming knowledge of the second-order statistics of the channel state information, beamforming weights are determined so that the signal-to-noise ratio (SNR) at the destination is maximized subject to two different power constraints, i.e., a total (source and relay) power constraint, and individual relay power constraints. For the former constraint, the original problem is transformed into a problem of one variable, which can be solved via Newton's method. For the latter constraint, the original problem is transformed into a homogeneous quadratically constrained quadratic programming (QCQP) problem. In this case, it is shown that when the number of relays does not exceed three the global solution can always be constructed via semidefinite programming (SDP) relaxation and the matrix rank-one decomposition technique. For the cases in which the SDP relaxation does not generate a rank one solution, two methods are proposed to solve the problem: the first one is based on the coordinate descent method, and the second one transforms the QCQP problem into an infinity norm maximization problem in which a smooth finite norm approximation can lead to the solution using the augmented Lagrangian method.

  13. Transceiver Design for Dual-Hop Nonregenerative MIMO-OFDM Relay Systems Under Channel Uncertainties

    Science.gov (United States)

    Xing, Chengwen; Ma, Shaodan; Wu, Yik-Chung; Ng, Tung-Sang

    2010-12-01

    In this paper, linear transceiver design for dual-hop non-regenerative (amplify-and-forward (AF)) MIMO-OFDM systems under channel estimation errors is investigated. Second order moments of channel estimation errors in the two hops are first deduced. Then based on the Bayesian framework, joint design of linear forwarding matrix at the relay and equalizer at the destination under channel estimation errors is proposed to minimize the total mean-square-error (MSE) of the output signal at the destination. The optimal designs for both correlated and uncorrelated channel estimation errors are considered. The relationship with existing algorithms is also disclosed. Moreover, this design is extended to the joint design involving source precoder design. Simulation results show that the proposed design outperforms the design based on estimated channel state information only.

  14. On the performance of hybrid-ARQ with incremental redundancy and with code combining over relay channels

    KAUST Repository

    Chelli, Ali

    2013-08-01

    In this paper, we consider a relay network consisting of a source, a relay, and a destination. The source transmits a message to the destination using hybrid automatic repeat request (HARQ). The relay overhears the transmitted messages over the different HARQ rounds and tries to decode the data packet. In case of successful decoding at the relay, both the relay and the source cooperate to transmit the message to the destination. The channel realizations are independent for different HARQ rounds. We assume that the transmitter has no channel state information (CSI). Under such conditions, power and rate adaptation are not possible. To overcome this problem, HARQ allows the implicit adaptation of the transmission rate to the channel conditions by the use of feedback. There are two major HARQ techniques, namely HARQ with incremental redundancy (IR) and HARQ with code combining (CC). We investigate the performance of HARQ-IR and HARQ-CC over a relay channel from an information theoretic perspective. Analytical expressions are derived for the information outage probability, the average number of transmissions, and the average transmission rate. We illustrate through our investigation the benefit of relaying. We also compare the performance of HARQ-IR and HARQ-CC and show that HARQ-IR outperforms HARQ-CC. © 2013 IEEE.

  15. Performance analysis of dual-hop relaying systems in the presence of Co-channel interference

    KAUST Repository

    Ikki, Salama Said

    2010-12-01

    In this paper, we investigate the effect of co-channel interference on the performance of dual-hop communications with amplify-and-forward relaying. Based on the derivation of the effective signal-to-interference-plus-noise ratio (SINR) at the destination node of the system, taking into account co-channel interference, we obtain expressions for the error and outage probabilities. Moreover, we study the performance of the system in the high SINR regime. Monte-Carlo simulations are further provided and confirm the accuracy of the analytical results. ©2010 IEEE.

  16. End-to-End Joint Antenna Selection Strategy and Distributed Compress and Forward Strategy for Relay Channels

    Directory of Open Access Journals (Sweden)

    Rahul Vaze

    2009-01-01

    Full Text Available Multihop relay channels use multiple relay stages, each with multiple relay nodes, to facilitate communication between a source and destination. Previously, distributed space-time codes were proposed to maximize the achievable diversity-multiplexing tradeoff; however, they fail to achieve all the points of the optimal diversity-multiplexing tradeoff. In the presence of a low-rate feedback link from the destination to each relay stage and the source, this paper proposes an end-to-end antenna selection (EEAS strategy as an alternative to distributed space-time codes. The EEAS strategy uses a subset of antennas of each relay stage for transmission of the source signal to the destination with amplifying and forwarding at each relay stage. The subsets are chosen such that they maximize the end-to-end mutual information at the destination. The EEAS strategy achieves the corner points of the optimal diversity-multiplexing tradeoff (corresponding to maximum diversity gain and maximum multiplexing gain and achieves better diversity gain at intermediate values of multiplexing gain, versus the best-known distributed space-time coding strategies. A distributed compress and forward (CF strategy is also proposed to achieve all points of the optimal diversity-multiplexing tradeoff for a two-hop relay channel with multiple relay nodes.

  17. On Secrecy Outage of Relay Selection in Underlay Cognitive Radio Networks over Nakagami-m Fading Channels

    KAUST Repository

    Lei, Hongjiang

    2017-10-02

    In this paper, the secrecy outage performance of an underlay cognitive decode-and-forward relay network over independent but not necessarily identical distributed (i.n.i.d) Nakagami-m fading channels is investigated, in which the secondary user transmitter communicates with the secondary destination via relays, and an eavesdropper attempts to overhear the information. Based on whether the channel state information (CSI) of the wiretap links is available or not, we analyze the secrecy outage performance with optimal relay selection (ORS) and suboptimal relay selection (SRS) schemes, and multiple relays combining scheme (MRC) scheme is considered for comparison purpose. The exact and asymptotic closed-form expressions for the secrecy outage probability with three different relay selection schemes are derived and verified by Monte-Carlo simulations. The numerical results illustrate that ORS scheme always outperforms SRS and MRC schemes, and SRS scheme is better than MRC scheme in the lower fading parameters scenario. Furthermore, through asymptotic analysis, we find that these three different schemes achieve the same secrecy diversity order, which is determined by the number of the relays, and the fading parameters of the links among the relays and the destination.

  18. Performance analysis of selective cooperation in amplify-and-forward relay networks over identical Nakagami-m channels

    KAUST Repository

    Hussain, Syed Imtiaz

    2011-05-02

    In cooperative communications, multiple relays between a source and a destination can increase the diversity gain. Because all the nodes must use orthogonal channels, multiple-relay cooperation becomes spectrally inefficient. Therefore, a bestrelay selection scheme was recently proposed. In this paper, we analyzed the performance of this scheme for a system with the relays operating in amplify-and-forward mode over identical Nakagami-m channels using an exact source-relay-destination signal-to-noise ratio (SNR).We derived accurate closed-form expressions for various system parameters including the probability density function of end-to-end SNR, the average output SNR, the bit error probability, and the channel capacity. The analytical results were verified through Monte Carlo simulations. Copyright © 2011 John Wiley & Sons, Ltd.

  19. Transmit power optimization for green multihop relaying over Nakagami-m fading channels

    KAUST Repository

    Randrianantenaina, Itsikiantsoa

    2014-03-01

    In this paper, we investigate the optimal transmit power strategy to maximize the energy efficiency of a multihop relaying network. Considering the communication between a source and a destination through multiple Amplify-and-Forward relays, we first give the expression of the total instantaneous system energy consumption. Then, we define the energy efficiency in our context and obtain its expression in closed-form when the communication is over Nakagami-m fading channels. The analysis yields to the derivation of a global transmit power strategy where each individual node is contributing to the end-to-end overall energy efficiency. Numercial results are presented to illustrate the analysis. Comparison with Monte Carlo simulation results confirms the accuracy of our derivations, and assesses the gains of the proposed power optimization strategy. © 2014 IEEE.

  20. Consumption Factor Optimization for Multihop Relaying over Nakagami-m Fading channels

    KAUST Repository

    Randrianantenaina, Itsikiantsoa

    2015-10-06

    In this paper, the energy efficiency of multihop relaying over Nakagami-m fading channels is investigated. The “consumption factor”, adopted as a metric to evaluate the energy efficiency, is derived for both amplify-and-forward and decodeand- forward relaying strategies. Then, based on the obtained expressions, we propose a power allocation strategy maximizing the consumption factor. In addition, a sub-optimal, low complexity, power allocation algorithm is proposed and analyzed, and the obtained power allocation scheme is compared in terms of energy efficiency to other power allocation schemes from the literature. Analytical and simulation results confirm the accuracy of our derivations, and assess the performance gains of the proposed approach.

  1. Alternate MIMO AF relaying networks with interference alignment: Spectral efficient protocol and linear filter design

    KAUST Repository

    Park, Kihong

    2013-02-01

    In this paper, we study a two-hop relaying network consisting of one source, one destination, and three amplify-and-forward (AF) relays with multiple antennas. To compensate for the capacity prelog factor loss of 1/2$ due to the half-duplex relaying, alternate transmission is performed among three relays, and the inter-relay interference due to the alternate relaying is aligned to make additional degrees of freedom. In addition, suboptimal linear filter designs at the nodes are proposed to maximize the achievable sum rate for different fading scenarios when the destination utilizes a minimum mean-square error filter. © 1967-2012 IEEE.

  2. Resource allocation for two source-destination pairs sharing a single relay with a buffer

    KAUST Repository

    Zafar, Ammar

    2014-05-01

    In this paper, we obtain the optimal resource allocation scheme in order to maximize the achievable rate region in a dual-hop system that consists of two independent source-destination pairs sharing a single half-duplex relay. The relay decodes the received information and possesses buffers to enable storing the information temporarily before forwarding it to the respective destination. We consider both non-orthogonal transmission with successive interference cancellation at the receivers and orthogonal transmission. Also, we consider Gaussian block-fading channels and we assume that the channel state information is known and that no delay constraints are required. We show that, with the aid of buffering at the relay, joint user-and-hop scheduling is optimal and can enhance the achievable rate significantly. This is due to the joint exploitation of multiuser diversity and multihop diversity in the system. We provide closed-form expressions to characterize the average achievable rates in a generic form as functions of the statistical model of the channels. Furthermore, we consider sub-optimal schemes that exploit the diversity in the system partially and we provide numerical results to compare the different schemes and demonstrate the gains of the optimal one. © 2014 IEEE.

  3. Wireless Powered Relaying Networks Under Imperfect Channel State Information: System Performance and Optimal Policy for Instantaneous Rate

    Directory of Open Access Journals (Sweden)

    D. T. Do

    2017-09-01

    Full Text Available In this investigation, we consider wireless powered relaying systems, where energy is scavenged by a relay via radio frequency (RF signals. We explore hybrid time switching-based and power splitting-based relaying protocol (HTPSR and compare performance of Amplify-and-Forward (AF with Decode-and-Forward (DF scheme under imperfect channel state information (CSI. Most importantly, the instantaneous rate, achievable bit error rate (BER are determined in the closed-form expressions under the impact of imperfect CSI. Through numerical analysis, we evaluate system insights via different parameters such as power splitting (PS and time switching (TS ratio of the considered HTPSR which affect outage performance and BER. It is noted that DF relaying networks outperform AF relaying networks. Besides that, the numerical results are given to prove the optimization problems of PS and TS ratio to obtain optimal instantaneous rate.

  4. Pairwise Check Decoding for LDPC Coded Two-Way Relay Block Fading Channels

    CERN Document Server

    Liu, Jianquan; Xu, Youyun

    2011-01-01

    Partial decoding is known to have the potential to achieve a larger rate region than that of full decoding in two-way relay (TWR) channels. Existing partial decoding realizations are however designed for Gaussian channels and with a static physical layer network coding (PLNC) mapping. In this paper, we propose a new channel coding solution at the relay, called \\emph{pairwise check decoding} (PCD), for low-density parity-check (LDPC) coded TWR system over block fading channels. The main idea is to form a check relationship table (check-relation-tab) for the superimposed LDPC coded packet pair in the multiple access (MA) phase in conjunction with an adaptive PLNC mapping in the broadcast (BC) phase. Using PCD, we then present a partial decoding method, two-stage closest-neighbor clustering with PCD (TS-CNC-PCD), with the aim of minimizing the worst pairwise error performance. Moreover, a kind of correlative rows optimization, named as the minimum correlation optimization (MCO), is proposed for selecting the bet...

  5. Comparison of Channel Estimation Protocols for Coherent AF Relaying Networks in the Presence of Additive Noise and LO Phase Noise

    Directory of Open Access Journals (Sweden)

    Stefan Berger

    2010-01-01

    Full Text Available Channel estimation protocols for wireless two-hop networks with amplify-and-forward (AF relays are compared. We consider multiuser relaying networks, where the gain factors are chosen such that the signals from all relays add up coherently at the destinations. While the destinations require channel knowledge in order to decode, our focus lies on the channel estimates that are used to calculate the relay gains. Since knowledge of the compound two-hop channels is generally not sufficient to do this, the protocols considered here measure all single-hop coefficients in the network. We start from the observation that the direction in which the channels are measured determines (1 the number of channel uses required to estimate all coefficient and (2 the need for global carrier phase reference. Four protocols are identified that differ in the direction in which the first-hop and the second-hop channels are measured. We derive a sensible measure for the accuracy of the channel estimates in the presence of additive noise and phase noise and compare the protocols based on this measure. Finally, we provide a quantitative performance comparison for a simple single-user application example. It is important to note that the results can be used to compare the channel estimation protocols for any two-hop network configuration and gain allocation scheme.

  6. Outage Performance of Cooperative Relay Selection with Multiple Source and Destination Antennas over Dissimilar Nakagami-m Fading Channels

    Science.gov (United States)

    Lee, Wooju; Yoon, Dongweon

    Cooperative relay selection, in which one of multiple relays is selected to retransmit the source signal to the destination, has received considerable attention in recent years, because it is a simple way to obtain cooperative diversity in wireless networks. The exact expression of outage probability for a decode-and-forward cooperative relay selection with multiple source and destination antennas over Rayleigh fading channels was recently derived in [9]. In this letter, we derive the exact expressions of outage probability and diversity-multiplexing tradeoff over independent and non-identically distributed Nakagami-m fading channels as an extension of [9]. We then analyze the effects of various parameters such as fading conditions, number of relays, and number of source and destination antennas on the outage probability.

  7. Cognitive two-way relay beamforming: Design with resilience to channel state uncertainties

    KAUST Repository

    Ubaidulla, P.

    2016-07-26

    In this paper, we propose a robust distributed relay beamformer design for cognitive radio network operating under uncertainties in the available channel state information. The cognitive network consists of a pair of transceivers and a set of non-regenerative two-way relays that assist the communication between the transceiver pair. The secondary nodes share the spectrum with a licensed primary user node while ensuring that the interference to the primary receiver is maintained below a certain threshold. The proposed robust design maximizes the worst-case signal-to-interference-plus-noise ratio at the secondary transceivers while satisfying constraints on the interference to the primary user and on the total relay transmit power. Though the robust design problem is not a convex problem in its original form, we show that it can be reformulated as a convex optimization problem, which can be solved efficiently. Numerical results are provided and illustrate the merits of the proposed design for various operating conditions and parameters. © 2016 IEEE.

  8. Channel estimation based on distributed compressed sensing in amplify-and-forward relay networks

    Institute of Scientific and Technical Information of China (English)

    WANG Dong-hao; NIU Kai; HE Zhi-qiang; TIAN Bao-yu

    2010-01-01

    In orthogonal frequency-division multiplexing(OFDM)amplify-and-forward(AF)relay networks,in order to exploit diversity gains over frequency-selective fading channels,the receiver needs to acquire the knowledge of channel state information(CSI).In this article,based on the recent methodology of distributed compressed sensing(DCS),a novel channel estimation scheme is proposed.The joint sparsity model 2(JSM-2)in DCS theory and simultaneous orthogonal matching pursuit(SOMP)are both introduced to improve the estimation performance and increase the spectral efficiency.Simulation results show that compared with current compressed sensing(CS)methods,the estimation error of our scheme is reduced dramatically in high SNR region while the pilot number is still kept small.

  9. Exact Performance Analysis of Dual-Hop Semi-Blind AF Relaying over Arbitrary Nakagami-m Fading Channels

    KAUST Repository

    Xia, Minghua

    2011-10-01

    Relay transmission is promising for future wireless systems due to its significant cooperative diversity gain. The performance of dual-hop semi-blind amplify-and-forward (AF) relaying systems was extensively investigated, for transmissions over Rayleigh fading channels or Nakagami- fading channels with integer fading parameter. For the general Nakagami- fading with arbitrary values, the exact closed-form system performance analysis is more challenging. In this paper, we explicitly derive the moment generation function (MGF), probability density function (PDF) and moments of the end-to-end signal-to-noise ratio (SNR) over arbitrary Nakagami- fading channels with semi-blind AF relay. With these results, the system performance evaluation in terms of outage probability, average symbol error probability, ergodic capacity and diversity order, is conducted. The analysis developed in this paper applies to any semi-blind AF relaying systems with fixed relay gain, and two major strategies for computing the relay gain are compared in terms of system performance. All analytical results are corroborated by simulation results and they are shown to be efficient tools to evaluate system performance.

  10. Design Criteria for Hierarchical Exclusive Code with Parameter-Invariant Decision Regions for Wireless 2-Way Relay Channel

    Directory of Open Access Journals (Sweden)

    Tomas Uricar

    2010-01-01

    Full Text Available The unavoidable parametrization of the wireless link represents a major problem of the network-coded modulation synthesis in a 2-way relay channel. Composite (hierarchical codeword received at the relay is generally parametrized by the channel gain, forcing any processing on the relay to be dependent on channel parameters. In this paper, we introduce the codebook design criteria, which ensure that all permissible hierarchical codewords have decision regions invariant to the channel parameters (as seen by the relay. We utilize the criterion for parameter-invariant constellation space boundary to obtain the codebooks with channel parameter-invariant decision regions at the relay. Since the requirements on such codebooks are relatively strict, the construction of higher-order codebooks will require a slightly simplified design criteria. We will show that the construction algorithm based on these relaxed criteria provides a feasible way to the design of codebooks with arbitrary cardinality. The promising performance benefits of the example codebooks (compared to a classical linear modulation alphabets will be exemplified on the minimum distance analysis.

  11. Outage performance of opportunistic two-way amplify-and-forward relaying with outdated channel state information

    KAUST Repository

    Hwang, Kyusung

    2013-09-01

    In this paper, we study the outage performance of an amplify-and-forward (AF)-based two-way relaying (TWR) system with multiple relays where a single relay selection is performed based on outdated channel state information (CSI). Specifically, we propose a single relay selection scheme in AF-based TWR system under outdated CSI conditions. With this policy, we offer a statistical analysis of the signal-to-noise ratio per hop and analyze the outage probability with asymmetric outage thresholds based on CSI-assisted AF protocol. Additionally, we provide the exact and asymptotic expressions based on the provided statistical/joint statistical analyses of a dual-hop AF transmission. Finally, we verify our analytical results with some selected computer-based simulation results. © 1972-2012 IEEE.

  12. Resource allocation using time division multiple access over wireless relay networks

    Institute of Scientific and Technical Information of China (English)

    DAI Qin-yun; RONG Lu; HU Hong-lin; SU Gang

    2008-01-01

    This article considers a wireless network consisting of multiple sources that communicate with the corresponding destination utilizing a single half-duplex relay, whereas, the sources use the relay opportunistically. By integrating the information theory with the concept of effective capacity, this article proposes a dynamic time allocation strategy over the wireless relay network that aims at maximizing the relay network throughput, subject to a given delay quality of service (QoS) constraint, where time division multiple access (TDMA) is applied in the relay network. The simulation results show that the proposed allocation strategy can significantly improve the effective capacity as compared to the traditional equal time allocation strategy.

  13. A novel framework on exact average symbol error probabilities of multihop transmission over amplify-and-forward relay fading channels

    KAUST Repository

    Yilmaz, Ferkan

    2010-09-01

    In this paper, we propose an analytical framework on the exact computation of the average symbol error probabilities (ASEP) of multihop transmission over generalized fading channels when an arbitrary number of amplify-and-forward relays is used. Our approach relies on moment generating function (MGF) framework to obtain exact single integral expressions which can be easily computed by Gauss-Chebyshev Quadrature (GCQ) rule. As such, the derived results are a convenient tool to analyze the ASEP performance of multihop transmission over amplify-and-forward relay fading channels. Numerical and simulation results, performed to verify the correctness of the proposed formulation, are in perfect agreement. © 2010 IEEE.

  14. Impact of Channel Partitioning and Relay Placement on Resource Allocation in OFDMA Cellular Networks

    Directory of Open Access Journals (Sweden)

    Sultan F. Meko

    2012-07-01

    Full Text Available Tremendous growth in the demand for wireless applications such as streaming audio/videos, Skype and video games require high data rate irrespective of user’s location in the cellular network. However, the Quality of Service (QoS of users degrades at the cell boundary. Relay enhanced multi-hop cellular network is one of the cost effective solution to improve the performance of cell edge users. Optimal deployment of Fixed Relay Nodes (FRNs is essential to satisfy the QoS requirement of edge users. We propose new schemes for channel partitioning and FRN placement in cellular networks. Path-loss, Signal to Interference and Noise Ratio (SINR experienced by users, and effects of shadowing have been considered. The analysis gives more emphasis on the cell-edge users (worst case scenario. The results show that these schemes achieve higher system performance in terms of spectral efficiency and also increase the user data rate at the cell edge.

  15. Performance analysis of relay-assisted all-optical FSO networks over strong atmospheric turbulence channels with pointing errors

    KAUST Repository

    Yang, Liang

    2014-12-01

    In this study, we consider a relay-assisted free-space optical communication scheme over strong atmospheric turbulence channels with misalignment-induced pointing errors. The links from the source to the destination are assumed to be all-optical links. Assuming a variable gain relay with amplify-and-forward protocol, the electrical signal at the source is forwarded to the destination with the help of this relay through all-optical links. More specifically, we first present a cumulative density function (CDF) analysis for the end-to-end signal-to-noise ratio. Based on this CDF, the outage probability, bit-error rate, and average capacity of our proposed system are derived. Results show that the system diversity order is related to the minimum value of the channel parameters.

  16. On the performance of two-way multiuser mixed RF/FSO relay networks with opportunistic scheduling & asymmetric channel gains

    KAUST Repository

    Al-Eryani, Yasser F.

    2017-07-20

    In this paper, the performance of two-way relaying (TWR) multiuser mixed radio frequency/free space optical (RF/FSO) relay networks with opportunistic user scheduling and asymmetric channel fading is studied. First, closed-form expressions for the exact outage probability, asymptotic (high signal-to-noise ration (SNR)) outage probability, and average ergodic channel capacity are derived assuming heterodyne detection (HD) scheme. Additionally, impacts of several system parameters including number of users, pointing errors, and atmospheric turbulence conditions on the overall network performance are investigated. All the theoretical results are validated by Monte-Carlo simulations. The results show that the TWR scheme almost doubles the network ergodic capacity compared to that of one-way relaying (OWR) scheme with the same outage performance. Additionally, the overall diversity order of the network is shown to be affected not only by the number of users, but it is also a function of the pointing error and atmospheric turbulence conditions.

  17. Outage Performance Analysis of Relay Selection Schemes in Wireless Energy Harvesting Cooperative Networks over Non-Identical Rayleigh Fading Channels.

    Science.gov (United States)

    Do, Nhu Tri; Bao, Vo Nguyen Quoc; An, Beongku

    2016-02-26

    In this paper, we study relay selection in decode-and-forward wireless energy harvesting cooperative networks. In contrast to conventional cooperative networks, the relays harvest energy from the source's radio-frequency radiation and then use that energy to forward the source information. Considering power splitting receiver architecture used at relays to harvest energy, we are concerned with the performance of two popular relay selection schemes, namely, partial relay selection (PRS) scheme and optimal relay selection (ORS) scheme. In particular, we analyze the system performance in terms of outage probability (OP) over independent and non-identical (i.n.i.d.) Rayleigh fading channels. We derive the closed-form approximations for the system outage probabilities of both schemes and validate the analysis by the Monte-Carlo simulation. The numerical results provide comprehensive performance comparison between the PRS and ORS schemes and reveal the effect of wireless energy harvesting on the outage performances of both schemes. Additionally, we also show the advantages and drawbacks of the wireless energy harvesting cooperative networks and compare to the conventional cooperative networks.

  18. Effective Relaying in Two-user Interference Channel with Different Models of Channel Output Feedback

    CERN Document Server

    Sahai, Achaleshwar; Yuksel, Melda; Sabharwal, Ashutosh

    2011-01-01

    In this paper, we study the impact of channel output feedback architectures on the capacity of two-user interference channel. For a two-user interference channel, a feedback link can exist between receivers and transmitters in 9 canonical architectures, ranging from only one feedback link to four-feedback links. We derive exact capacity region for the deterministic interference channel and constant-gap capacity region for the Gaussian interference channel for all but two of the 9 architectures (or models). We find that the sum-capacity in deterministic interference channel with only one feedback link, from any one receiver to its own transmitter, is identical to the interference channel with four feedback links; for the Gaussian model, the gap is bounded for all channel gains. However, one feedback link is not sufficient to achieve the whole capacity region of four feedback links. To achieve the full capacity region requires at least two feedback links. To prove the results, we derive several new outer bounds...

  19. Bounds on Minimum Energy per Bit for Optical Wireless Relay Channels

    Directory of Open Access Journals (Sweden)

    A. D. Raza

    2014-09-01

    Full Text Available An optical wireless relay channel (OWRC is the classical three node network consisting of source, re- lay and destination nodes with optical wireless connectivity. The channel law is assumed Gaussian. This paper studies the bounds on minimum energy per bit required for reliable communication over an OWRC. It is shown that capacity of an OWRC is concave and energy per bit is monotonically increasing in square of the peak optical signal power, and consequently the minimum energy per bit is inversely pro- portional to the square root of asymptotic capacity at low signal to noise ratio. This has been used to develop upper and lower bound on energy per bit as a function of peak signal power, mean to peak power ratio, and variance of channel noise. The upper and lower bounds on minimum energy per bit derived in this paper correspond respectively to the decode and forward lower bound and the min-max cut upper bound on OWRC capacity

  20. Spectrum Sharing between Cooperative Relay and Ad-hoc Networks: Dynamic Transmissions under Computation and Signaling Limitations

    CERN Document Server

    Sun, Yin; Li, Yunzhou; Zhou, Shidong; Xu, Xibin

    2010-01-01

    This paper studies a spectrum sharing scenario between an uplink cognitive relay network (CRN) and some nearby low power ad-hoc networks. In particular, the dynamic resource allocation of the CRN is analyzed, which aims to minimize the average interfering time with the ad-hoc networks subject to a minimal average uplink throughput constraint. A long term average rate formula is considered, which is achieved by a half-duplex decode-and-forward (DF) relay strategy with multi-channel transmissions. Both the source and relay are allowed to queue their data, by which they can adjust the transmission rates flexibly based on sensing and predicting the channel state and ad-hoc traffic. The dynamic resource allocation of the CRN is formulated as a non-convex stochastic optimization problem. By carefully analyzing the optimal transmission time scheduling, it is reduced to a stochastic convex optimization problem and solved by the dual optimization method. The signaling and computation processes are designed carefully t...

  1. Evaluation of PLC Channel Capacity and ABER Performances for OFDM-Based Two-Hop Relaying Transmission

    Directory of Open Access Journals (Sweden)

    Sana Ezzine

    2017-01-01

    Full Text Available Powerline network is recognized as a favorable infrastructure for Smart Grid to transmit information in the network thanks to its broad coverage and low cost deployment. The existing works are trying to improve and adapt transmission techniques to reduce Powerline Communication (PLC channel attenuation and exploit the limited bandwidth to support high data rate over long distances. Two-hop relaying BroadBand PLC (BB-PLC system, in which Orthogonal Frequency Division Multiplexing (OFDM is used, is considered in this paper. We derive and compare the PLC channel capacity and the end-to-end Average BER (ABER for OFDM-based direct link (DL BB-PLC system and for OFDM-based two-hop relaying BB-PLC system for Amplify and Forward (AF and Decode and Forward (DF protocols. We analyze the improvements when we consider the direct link in a cooperative communication when the relay node only transmits the correctly decoded signal. Maximum ratio combining is employed at the destination node to detect the transmitted signal. In addition, in this paper, we highlight the impact of the relay location on the channel capacity and ABER for AF and DF transmission protocols. Moreover, an efficient use of the direct link was also investigated in this paper.

  2. Performance analysis of cognitive multihop relaying with m-QAM detect-and-forward in Nakagami-m fading channels

    KAUST Repository

    Benjillali, Mustapha

    2013-09-01

    In this work, we investigate the performance of cognitive multihop regenerative relaying systems in the "underlay" spectrum sharing scenario. The multiple relays perform "detect-and-forward" relaying strategy to convey a message with an order m quadrature amplitude modulation (m-QAM) from the source to the destination over independent but not necessarily identical Nakagami-m fading channels. We adopt a closed-form analysis framework based on univariate and bivariate Meijer G-functions to derive the end-to-end error performance (in terms of bit and symbol error rates), the outage probability, and the ergodic capacity. Various numerical examples are presented to illustrate the results with a large combination of system and fading parameters, and simulation results confirm the accuracy of our closed-form analysis. © 2013 IEEE.

  3. An Opportunistic Relaying Selection Scheme Based on Relay Fairness

    Directory of Open Access Journals (Sweden)

    Ting An

    2013-07-01

    Full Text Available Opportunistic relaying scheme is a single cooperative relay selection method based on Channel State Information. However, the failure probability of the best relay selection may become unacceptable when the number of relays increases. Although most of the existing solutions can reduce the failure probability of relay selection, they ignore the fairness of the relay selection. In order to improve the fairness of the relay selection without affecting the failure probability of the best relay selection, we propose a modified practical best relay selection scheme in this paper,  and by introducing proportional fair algorithm, the relay timer will be given a smaller correlation coefficient. The proposed method makes the probability of selection be improved. In the light of defined fairness factor, the relay fairness is represented. Simulation results show that the new algorithm can improve the fairness of the relay selection on the basis of maintaining the original failure probability of relay selection.

  4. Broadcast Approach and Oblivious Cooperative Strategies for the Wireless Relay Channel - Part I: Sequential Decode-and-Forward (SDF)

    CERN Document Server

    Braginskiy, Evgeniy; Shamai, Shlomo

    2010-01-01

    In this two part paper we consider a wireless network in which a source terminal communicates with a destination and a relay terminal is occasionally present in close proximity to the source without source's knowledge, suggesting oblivious protocols. The source-relay channel is assumed to be a fixed gain AWGN due to the proximity while the source-destination and the relay-destination channels are subject to a block flat Rayleigh fading. A perfect CSI at the respective receivers only is assumed. With the average throughput as a performance measure, we incorporate a two-layer broadcast approach into two cooperative strategies based on the decode-and-forward scheme - Sequential Decoded-and Forward (SDF) in part I and the Block-Markov (BM) in part II. The broadcast approach splits the transmitted rate into superimposed layers corresponding to a "bad" and a "good" channel states, allowing better adaptation to the actual channel conditions In part I, the achievable rate expressions for the SDF strategy are derived ...

  5. Improving throughput of single-relay DF channel using linear constellation precoding

    KAUST Repository

    Fareed, Muhammad Mehboob

    2014-08-01

    In this letter, we propose a transmission scheme to improve the overall throughput of a cooperative communication system with single decode-and-forward relay. Symbol error rate and throughput analysis of the new scheme are presented to facilitate the performance comparison with the existing decode-and-forward relaying schemes. Simulation results are further provided to corroborate the analytical results. © 2012 IEEE.

  6. A study of optimization problem for amplify-and-forward relaying over weibull fading channels

    KAUST Repository

    Ikki, Salama Said

    2010-09-01

    This paper addresses the power allocation and relay positioning problems in amplify-and-forward cooperative networks operating in Weibull fading environments. We study adaptive power allocation (PA) with fixed relay location, optimal relay location with fixed power allocation, and joint optimization of the PA and relay location under total transmit power constraint, in order to minimize the outage probability and average error probability at high signal-to-noise ratios (SNR). Analytical results are validated by numerical simulations and comparisons between the different optimization schemes and their performance are provided. Results show that optimum PA brings only coding gain, while optimum relay location yields, in addition to the latter, diversity gains as well. Also, joint optimization improves both, the diversity gain and coding gain. Furthermore, results illustrate that the analyzed adaptive algorithms outperform uniform schemes. ©2010 IEEE.

  7. On the Error Rate Analysis of Dual-Hop Amplify-and-Forward Relaying in Generalized-K Fading Channels

    Directory of Open Access Journals (Sweden)

    George P. Efthymoglou

    2010-01-01

    Full Text Available We present novel and easy-to-evaluate expressions for the error rate performance of cooperative dual-hop relaying with maximal ratio combining operating over independent generalized- fading channels. For this system, it is hard to obtain a closed-form expression for the moment generating function (MGF of the end-to-end signal-to-noise ratio (SNR at the destination, even for the case of a single dual-hop relay link. Therefore, we employ two different upper bound approximations for the output SNR, of which one is based on the minimum SNR of the two hops for each dual-hop relay link and the other is based on the geometric mean of the SNRs of the two hops. Lower bounds for the symbol and bit error rates for a variety of digital modulations can then be evaluated using the MGF-based approach. The final expressions are useful in the performance evaluation of amplify-and-forward relaying in a generalized composite radio environment.

  8. Error Analysis of Fixed-Gain AF Relaying with MRC Over Nakagami-m Fading Channels

    Directory of Open Access Journals (Sweden)

    S. H. Alvi

    2016-04-01

    Full Text Available This article investigates the error performance of wireless communication systems that employ binary modulations and Amplify-and-Forward (AF relaying over flat Nakagami-m faded links with maximum ratio combining (MRC at destination. Specifically, we derive a simple yet accurate closed-form approximation for the average bit error probability (ABEP and closed-form expressions for its tight upper and lower bounds. The effect of power imbalance between the relayed links is also studied. Numerical investigations show good agreement between proposed theoretical results and simulations whereas our performance bounds are shown to be tighter than previously proposed bounds for the case of unbalanced relayed links.

  9. Achievable Rate of Multi-relay Cognitive Radio MIMO Channel with Space Alignment

    KAUST Repository

    Sboui, Lokman

    2015-04-21

    We study the impact of multiple relays on the primary user (PU) and secondary user (SU) rates of underlay MIMO cognitive radio. Both users exploit amplify-and-forward relays to communicate with the destination. A space alignment technique and a special linear precoding and decoding scheme are applied to allow the SU to use the resulting free eigenmodes. In addition, the SU can communicate over the used eigenmodes under the condition of respecting an interference constraint tolerated by the PU. At the destination, a successive interference cancellation (SIC) is performed to estimate the secondary signal. We present the explicit expressions of the optimal PU and SU powers that maximize their achievable rates. In the numerical results, we show that our scheme provides cognitive rate gain even in absence of tolerated interference. In addition, we show that increasing the number of relays enhances the PU and SU rates at low power regime and/or when the relays power is sufficiently high.

  10. Energy-Efficient Power Allocation for Fixed-Gain Amplify-and-Forward Relay Networks with Partial Channel State Information

    KAUST Repository

    Zafar, Ammar

    2012-06-01

    In this report, energy-efficient transmission and power allocation for fixed-gain amplify-and-forward relay networks with partial channel state information (CSI) are studied. In the energy-efficiency problem, the total power consumed is minimized while keeping the signal-to-noise-ratio (SNR) above a certain threshold. In the dual problem of power allocation, the end-to-end SNR is maximized under individual and global power constraints. Closed-form expressions for the optimal source and relay powers and the Lagrangian multiplier are obtained. Numerical results show that the optimal power allocation with partial CSI provides comparable performance as optimal power allocation with full CSI at low SNR.

  11. Energy-Efficient Power Allocation for Fixed-Gain Amplify-and-Forward Relay Networks with Partial Channel State Information

    KAUST Repository

    Zafar, Ammar

    2012-09-16

    In this letter, energy-efficient transmission and power allocation for fixed-gain amplify-and-forward relay networks with partial channel state information (CSI) are studied. In the energy-efficiency problem, the total power consumed is minimized while keeping the signal-to-noise-ratio (SNR) above a certain threshold. In the dual problem of power allocation, the end-to-end SNR is maximized under individual and global power constraints. Closed-form expressions for the optimal source and relay powers and the Lagrangian multiplier are obtained. Numerical results show that the optimal power allocation with partial CSI provides comparable performance as optimal power allocation with full CSI at low SNR. © 2012 IEEE.

  12. Combined Rate and Power Allocation with Link Scheduling in Wireless Data Packet Relay Networks with Fading Channels

    Directory of Open Access Journals (Sweden)

    Subhrakanti Dey

    2007-08-01

    Full Text Available We consider a joint rate and power control problem in a wireless data traffic relay network with fading channels. The optimization problem is formulated in terms of power and rate selection, and link transmission scheduling. The objective is to seek high aggregate utility of the relay node when taking into account buffer load management and power constraints. The optimal solution for a single transmitting source is computed by a two-layer dynamic programming algorithm which leads to optimal power, rate, and transmission time allocation at the wireless links. We further consider an optimal power allocation problem for multiple transmitting sources in the same framework. Performances of the resource allocation algorithms including the effect of buffer load control are illustrated via extensive simulation studies.

  13. Combined Rate and Power Allocation with Link Scheduling in Wireless Data Packet Relay Networks with Fading Channels

    Directory of Open Access Journals (Sweden)

    Dey Subhrakanti

    2007-01-01

    Full Text Available We consider a joint rate and power control problem in a wireless data traffic relay network with fading channels. The optimization problem is formulated in terms of power and rate selection, and link transmission scheduling. The objective is to seek high aggregate utility of the relay node when taking into account buffer load management and power constraints. The optimal solution for a single transmitting source is computed by a two-layer dynamic programming algorithm which leads to optimal power, rate, and transmission time allocation at the wireless links. We further consider an optimal power allocation problem for multiple transmitting sources in the same framework. Performances of the resource allocation algorithms including the effect of buffer load control are illustrated via extensive simulation studies.

  14. Relay selection from an effective capacity perspective

    KAUST Repository

    Yang, Yuli

    2013-09-01

    In this work, we consider a cooperative network where multiple relay nodes having different modulation capabilities assist the end-to-end communication between a source and its destination. Firstly, we evaluate the effective capacity (EC) performance of the network under study. According to the analysis, an EC-based relay selection criterion is proposed. Based on the proposed selection rule and half-duplex decode-and-forward protocol, the activated relays cooperatively help with the packet transmission from the source. At the destination, packet combining is taken into account to improve the quality of service. Compared to the popular scheme, opportunistic relay selection, numerical results are provided to prove the validity and advantages of our proposed scheme in certain scenarios. Moreover, the analysis presented herein offers a convenient tool to the relaying transmission design, specifically on which relay selection scheme should be used as well as how to choose the receiving strategy between with and without packet combining at the destination. © 2013 IEEE.

  15. On the throughput of a relay-assisted cognitive radio MIMO channel with space alignment

    KAUST Repository

    Sboui, Lokman

    2014-05-01

    We study the achievable rate of a multiple antenna relay-assisted cognitive radio system where a secondary user (SU) aims to communicate instantaneously with the primary user (PU). A special linear precoding scheme is proposed to enable the SU to take advantage of the primary eigenmodes. The used eigenmodes are subject to an interference constraint fixed beforehand by the primary transmitter. Due to the absence of a direct link, both users exploit an amplify-and-forward relay to accomplish their transmissions to a common receiver. After decoding the PU signal, the receiver employs a successive interference cancellation (SIC) to estimate the secondary message. We derive the optimal power allocation that maximizes the achievable rate of the SU respecting interference, peak and relay power constraints. Furthermore, we analyze the SIC detection accuracy on the PU throughput. Numerical results highlight the cognitive rate gain achieved by our proposed scheme without harming the primary rate. In addition, we show that the relay has an important role in increasing or decreasing PU and SU rates especially when varying its power and/or its amplifying gain. © 2014 IFIP.

  16. Exact Outage Probability of Dual-Hop CSI-Assisted AF Relaying Over Nakagami-m Fading Channels

    KAUST Repository

    Xia, Minghua

    2012-10-01

    In this correspondence, considering dual-hop channel state information (CSI)-assisted amplify-and-forward (AF) relaying over Nakagami- m fading channels, the cumulative distribution function (CDF) of the end-to-end signal-to-noise ratio (SNR) is derived. In particular, when the fading shape factors m1 and m2 at consecutive hops take non-integer values, the bivariate H-function and G -function are exploited to obtain an exact analytical expression for the CDF. The obtained CDF is then applied to evaluate the outage performance of the system under study. The analytical results of outage probability coincide exactly with Monte-Carlo simulation results and outperform the previously reported upper bounds in the low and medium SNR regions.

  17. Power Allocation Games in Interference Relay Channels: Existence Analysis of Nash Equilibria

    CERN Document Server

    Belmega, E V

    2011-01-01

    We consider a network composed of two interfering point-to-point links where the two transmitters can exploit one common relay node to improve their individual transmission rate. Communications are assumed to be multi-band and transmitters are assumed to selfishly allocate their resources to optimize their individual transmission rate. The main objective of this paper is to show that this conflicting situation (modeled by a non-cooperative game) has some stable outcomes, namely Nash equilibria. This result is proved for three different types of relaying protocols: decode-and-forward, estimate-and-forward, and amplify-and-forward. We provide additional results on the problems of uniqueness, efficiency of the equilibrium, and convergence of a best-response based dynamics to the equilibrium. These issues are analyzed in a special case of the amplify-and-forward protocol and illustrated by simulations in general.

  18. Performance Analysis of Decode-and-Forward Relaying in Gamma-Gamma Fading Channels

    CERN Document Server

    Bhatnagar, Manav R

    2012-01-01

    Decode-and-forward (DF) cooperative communication based on free space optical (FSO) links is studied in this letter. We analyze performance of the DF protocol in the FSO links following the Gamma-Gamma distribution. The cumulative distribution function (CDF) and probability density function (PDF) of a random variable containing mixture of the Gamma- Gamma and Gaussian random variables is derived. By using the derived CDF and PDF, average bit error rate of the DF relaying is obtained.

  19. Diversity-Multiplexing Tradeoff in Multi-Antenna Multi-Relay Networks: Improvements and Some Optimality Results

    CERN Document Server

    Gharan, Shahab Oveis; Khandani, Amir K

    2009-01-01

    This paper investigates the benefits of Amplify-and-Forward (AF) relaying in the setup of multi-antenna wireless networks. The concept of Random Sequential (RS) relaying is previously introduced in the literature and showed that it achieves the maximum diversity gain in a general multi-antenna network. Here, we show that random unitary matrix multiplication at the relay nodes empowers the RS scheme to achieve a better Diversity-Multiplexing Tradeoff (DMT) as compared to the traditional AF relaying. First, we study the case of a multi-antenna full-duplex single-relay two-hop network, for which we show that the RS achieves the optimum DMT. Applying this result, we derive a new achievable DMT for the case of multi-antenna half-duplex parallel relay network. Interestingly, it turns out that the DMT of the RS scheme is optimum for the case of multi-antenna two parallel non-interfering half-duplex relays. Next, we show that random unitary matrix multiplication also improves the DMT of the Non-Orthogonal AF relaying...

  20. Joint Scheduling for Dual-Hop Block-Fading Broadcast Channels

    KAUST Repository

    Ammar, Zafar

    2012-09-16

    In this paper, we propose joint user-and-hop scheduling over dual-hop block-fading broadcast channels in order to exploit multi-user diversity gains and multi-hop diversity gains all together. To achieve this objective, the first and second hops are scheduled opportunistically based on the channel state information and as a prerequisite we assume that the relay, which is half-duplex and operates using decode-and-forward, is capable of storing the received packets from the source until the channel condition of the destined user becomes good to be scheduled. We formulate the joint scheduling problem as maximizing the weighted sum of the long term achievable rates by the users under a stability constraint, which means that on the long term the rate received by the relay should equal the rate transmitted by it, in addition to constant or variable power constraints. We show that this problem is equivalent to a single-hop broadcast channel by treating the source as a virtual user with an optimal priority weight that maintains the stability constraint. We show how to obtain the source weight either off-line based on channel statistics or on real-time based on channel measurements. Furthermore, we consider special cases including the maximum sum rate scheduler and the proportional fair scheduler. We demonstrate via numerical results that our proposed joint scheduling scheme enlarges the rate region as compared with a scheme that employs multi-user scheduling alone.

  1. Outage Performance Analysis of Relay Selection Schemes in Wireless Energy Harvesting Cooperative Networks over Non-Identical Rayleigh Fading Channels

    Science.gov (United States)

    Do, Nhu Tri; Bao, Vo Nguyen Quoc; An, Beongku

    2016-01-01

    In this paper, we study relay selection in decode-and-forward wireless energy harvesting cooperative networks. In contrast to conventional cooperative networks, the relays harvest energy from the source’s radio-frequency radiation and then use that energy to forward the source information. Considering power splitting receiver architecture used at relays to harvest energy, we are concerned with the performance of two popular relay selection schemes, namely, partial relay selection (PRS) scheme and optimal relay selection (ORS) scheme. In particular, we analyze the system performance in terms of outage probability (OP) over independent and non-identical (i.n.i.d.) Rayleigh fading channels. We derive the closed-form approximations for the system outage probabilities of both schemes and validate the analysis by the Monte-Carlo simulation. The numerical results provide comprehensive performance comparison between the PRS and ORS schemes and reveal the effect of wireless energy harvesting on the outage performances of both schemes. Additionally, we also show the advantages and drawbacks of the wireless energy harvesting cooperative networks and compare to the conventional cooperative networks. PMID:26927119

  2. Relay selection and resource allocation for two-way DF-AF cognitive radio networks

    KAUST Repository

    Alsharoa, Ahmad M.

    2013-08-01

    In this letter, the problem of relay selection and optimal resource allocation for two-way relaying cognitive radio networks using half duplex amplify-and-forward and decode-and-forward protocols is investigated. The primary and secondary users are assumed to access the spectrum simultaneously, in a way that the interference introduced to the primary users should be below a certain tolerated limit. Dual decomposition and subgradient methods are used to find the optimal power allocation. A suboptimal approach based on a genetic algorithm is also presented. Simulation results show that the proposed suboptimal algorithm offers a performance close to the optimal performance with a considerable complexity saving. © 2013 IEEE.

  3. Scheduling for dual-hop block-fading channels with two source-user pairs sharing one relay

    KAUST Repository

    Zafar, Ammar

    2013-09-01

    In this paper, we maximize the achievable rate region of a dual-hop network with two sources serving two users independently through a single shared relay. We formulate the problem as maximizing the sum of the weighted long term average throughputs of the two users under stability constraints on the long term throughputs of the source-user pairs. In order to solve the problem, we propose a joint user-and-hop scheduling scheme, which schedules the first or second hop opportunistically based on instantaneous channel state information, in order to exploit multiuser diversity and multihop diversity gains. Numerical results show that the proposed joint scheduling scheme enhances the achievable rate region as compared to a scheme that employs multi-user scheduling on the second-hop alone. Copyright © 2013 by the Institute of Electrical and Electronic Engineers, Inc.

  4. Performance Analysis of Multibranch Dual-Hop Nonregenerative Relay Systems with EGC in Nakagami-m Channels

    Directory of Open Access Journals (Sweden)

    H. Suzuki

    2010-01-01

    Full Text Available The end-to-end performance of multibranch dual-hop wireless communication systems with nonregenerative relays and equal gain combiner (EGC at the destination over independent Nakagami-m fading channels is studied. We present new closed form expressions for probability distribution function (PDF and cumulative distribution function (CDF of end-to-end signal to noise ratio (SNR per branch in terms of Meijer's G function. From these results, analytical formulae for the moments of the output SNR, the average overall SNR, the amount of fading, and the spectral efficiency are also obtained in closed form. Instead of using moments-based approach to analyze the asymptotic error performance of the system, we employ the characteristic function (CHF method to calculate the average bit error probability (ABEP and the outage probability for several coherent and noncoherent modulation schemes. The accuracy of the analytical formulae is verified by various numerical results and simulations.

  5. Propofol suppresses synaptic responsiveness of somatosensory relay neurons to excitatory input by potentiating GABAA receptor chloride channels

    Directory of Open Access Journals (Sweden)

    Goldstein Peter A

    2005-01-01

    Full Text Available Abstract Propofol is a widely used intravenous general anesthetic. Propofol-induced unconsciousness in humans is associated with inhibition of thalamic activity evoked by somatosensory stimuli. However, the cellular mechanisms underlying the effects of propofol in thalamic circuits are largely unknown. We investigated the influence of propofol on synaptic responsiveness of thalamocortical relay neurons in the ventrobasal complex (VB to excitatory input in mouse brain slices, using both current- and voltage-clamp recording techniques. Excitatory responses including EPSP temporal summation and action potential firing were evoked in VB neurons by electrical stimulation of corticothalamic fibers or pharmacological activation of glutamate receptors. Propofol (0.6 – 3 μM suppressed temporal summation and spike firing in a concentration-dependent manner. The thalamocortical suppression was accompanied by a marked decrease in both EPSP amplitude and input resistance, indicating that a shunting mechanism was involved. The propofol-mediated thalamocortical suppression could be blocked by a GABAA receptor antagonist or chloride channel blocker, suggesting that postsynaptic GABAA receptors in VB neurons were involved in the shunting inhibition. GABAA receptor-mediated inhibitory postsynaptic currents (IPSCs were evoked in VB neurons by electrical stimulation of the reticular thalamic nucleus. Propofol markedly increased amplitude, decay time, and charge transfer of GABAA IPSCs. The results demonstrated that shunting inhibition of thalamic somatosensory relay neurons by propofol at clinically relevant concentrations is primarily mediated through the potentiation of the GABAA receptor chloride channel-mediated conductance, and such inhibition may contribute to the impaired thalamic responses to sensory stimuli seen during propofol-induced anesthesia.

  6. Broadcast Approach and Oblivious Cooperative Strategies for the Wireless Relay Channel - Part II: Block-Markov Decode-and-Forward (BMDF)

    CERN Document Server

    Braginskiy, Evgeniy; Shamai, Shlomo

    2010-01-01

    This is the second in a two part series of papers on incorporation of the broadcast approach into oblivious protocols for the relay channel where the source and the relay are collocated. Part I described the broadcast approach and its benefits in terms of achievable rates when used with the sequential decode- and-forward (SDF) scheme. Part II investigates yet another oblivious scheme, the Block-Markov decode- and-forward (BMDF) under the single and two-layered transmissions. For the single layer, previously reported results are enhanced and a conjecture regarding the optimal correlation coefficient between the source and the relay's transmission is established. For the discrete multi-layer transmission of two or more layers, it is shown that perfect cooperation (2x1 MISO) rates are attained even with low collocation gains at the expense of a longer delay, improving upon those achievable by the SDF.

  7. Kinetics of low threshold calcium channels of relay cells in cat lateral geniculate nucleus

    Institute of Scientific and Technical Information of China (English)

    罗茀荪; S.M.Sherman

    1996-01-01

    Kinetics of the low threshold T-type Ca2+ channel is studied with single electrode voltage damp technique on brain slices of the cat lateral geniculate nucleus (LGN). Space damp is dramatically improved by blocking various K+ and Na+ channels, decreasing Ca2+ current and selecting proper holding potentials. Results from this study are similar to those obtained from acutely dissociated LGN neurons of the rat, indicating that the kinetics of T-Ca2+ channels of the cat LGN neurons is the same as that of the rat LGN. The result reported previously on the cat LGN may result from a defect in space damp.

  8. Novel receivers for AF relaying with distributed STBC using cascaded and disintegrated channel estimation

    KAUST Repository

    Khan, Fahd Ahmed

    2012-04-01

    New coherent receivers are derived for a pilot-symbol-aided distributed space-time block-coded system with imperfect channel state information which do not perform channel estimation at the destination by using the received pilot signals directly for decoding. The derived receivers are based on new metrics that use distribution of the channels and the noise to achieve improved symbol-error-rate (SER) performance. The SER performance of the derived receivers is further improved by utilizing the decision history in the receivers. The decision history is also incorporated in the existing Euclidean metric to improve its performance. Simulation results show that, for 16-quadrature-amplitude-modulation in a Rayleigh fading channel, a performance gain of up to 2.5 dB can be achieved for the new receivers compared with the conventional mismatched coherent receiver. © 2012 IEEE.

  9. Precise outage analysis of mixed RF/unified-FSO DF relaying with HD and 2 IM-DD channel models

    KAUST Repository

    Al-Ebraheemy, Omer Mahmoud S.

    2017-07-20

    This paper derives and analyzes the outage probability of mixed radio frequency (RF)/unified free space optical (FSO) dual-hop decode-and-forward (DF) relaying scheme, where heterodyne detection (HD) and intensity modulation-direct detection (IM-DD) are considered for FSO detection. In doing that, we correctly utilize, for the first time to the best of our knowledge, a precise channel capacity result for the IM-DD channel. Moreover, this is the first time that not only the (IM-DD input-independent) but also the (IM-DD cost-dependent) AWGN channel is considered in such system analysis. This work assumes that the first hop (RF link) follows Naka-gami-m fading, while the second hop (FSO link) follows Málaga (M) turbulence with pointing error. These fading and turbulence models include other ones (such as Rayleigh fading and Gamma-Gamma turbulence) as special cases, so our analysis can be considered as a generalized one from both RF and FSO fading models point of view. Additionally, the system outage probability is investigated asymptotically in high signal-to-noise ratio (SNR) regime, where a new non-reported diversity order and coding gain analysis are shown. Interestingly, we find that in the FSO hop, based on SNR, the HD or IM-DD cost-dependent results in a same diversity order which is twice the one of IM-DD input-independent. However, based on transmitted power all these FSO detectors result in a same diversity order. Furthermore, we offer simulation results which confirm the derived exact and asymptotic expressions.

  10. Performance Analysis of Amplify-and-Forward Relaying over Shadowed Nakagami-m Fading Channels

    Science.gov (United States)

    Cai, Chunxiao; Cai, Yueming; Yang, Weiwei

    2011-11-01

    In the paper, the closed-form approximation for outage probability and symbol error probability are presented for amplify-and-forward cooperative network over shadowed Nakagami-m Fading Channels. Our results are verified through comparison with Monte Carlo simulations. It shows that our theoretical results can provide good approximations to the numerical results.

  11. Quantum cryptography with an ideal local relay

    DEFF Research Database (Denmark)

    Spedalieri, Gaetana; Ottaviani, Carlo; Braunstein, Samuel L.

    2015-01-01

    We consider two remote parties connected to a relay by two quantum channels. To generate a secret key, they transmit coherent states to the relay, where the states are subject to a continuous-variable (CV) Bell detection. We study the ideal case where Alice's channel is lossless, i.e., the relay...

  12. Fortune cookies and smartphones: Weakly unrelayable channels to counter relay attacks

    OpenAIRE

    Cagalj, M; PERKOVIC, T.; Bugaric, M; Li, S.

    2015-01-01

    Smartphones are being increasingly used to perform financial transactions (through m-banking, virtual wallet or as a smartcard). The latter applications involve contactless technology (e.g., NFC) that is known to be vulnerable to mafia fraud attacks. In this work we show that a secret message inside an appropriately folded piece of paper (fortune cookie) can be used to effectively mitigate the mafia fraud attack. Fortune cookies implement a weakly unrelayable channel that, in combination with...

  13. Statistics of α-μ Random Variables and Their Applications inWireless Multihop Relaying and Multiple Scattering Channels

    KAUST Repository

    Wang, Kezhi

    2015-06-01

    Exact results for the probability density function (PDF) and cumulative distribution function (CDF) of the sum of ratios of products (SRP) and the sum of products (SP) of independent α-μ random variables (RVs) are derived. They are in the form of 1-D integral based on the existing works on the products and ratios of α-μ RVs. In the derivation, generalized Gamma (GG) ratio approximation (GGRA) is proposed to approximate SRP. Gamma ratio approximation (GRA) is proposed to approximate SRP and the ratio of sums of products (RSP). GG approximation (GGA) and Gamma approximation (GA) are used to approximate SP. The proposed results of the SRP can be used to calculate the outage probability (OP) for wireless multihop relaying systems or multiple scattering channels with interference. The proposed results of the SP can be used to calculate the OP for these systems without interference. In addition, the proposed approximate result of the RSP can be used to calculate the OP of the signal-To-interference ratio (SIR) in a multiple scattering system with interference. © 1967-2012 IEEE.

  14. Eigen-Direction Alignment Based Physical-Layer Network Coding for MIMO Two-Way Relay Channels

    CERN Document Server

    Yang, Tao; Ping, Li; Collings, Iain B; Yuan, Jinhong

    2012-01-01

    In this paper, we propose a novel communication strategy which incorporates physical-layer network coding (PNC) into multiple-input multiple output (MIMO) two-way relay channels (TWRCs). At the heart of the proposed scheme lies a new key technique referred to as eigen-direction alignment (EDA) precoding. The EDA precoding efficiently aligns the two-user's eigen-modes into the same directions. Based on that, we carry out multi-stream PNC over the aligned eigen-modes. We derive an achievable rate of the proposed EDA-PNC scheme, based on nested lattice codes, over a MIMO TWRC. Asymptotic analysis shows that the proposed EDA-PNC scheme approaches the capacity upper bound as the number of user antennas increases towards infinity. For a finite number of user antennas, we formulate the design criterion of the optimal EDA precoder and present solutions. Numerical results show that there is only a marginal gap between the achievable rate of the proposed EDA-PNC scheme and the capacity upper bound of the MIMO TWRC, in ...

  15. Relay race

    CERN Multimedia

    Staff Association

    2011-01-01

    The CERN relay race will take place around the Meyrin site on Thursday 19th May starting at 12·15. If possible, please avoid driving on the site during this 20-minute period. If you do meet runners while driving your car, please STOP until they have all passed. Thank you for your cooperation. Details on the course, and how to register your team for the relay race, can be found at: https://espace.cern.ch/Running-Club/CERN-Relay Some advice for all runners from the medical service can also be found here: https://espace.cern.ch/Running-Club/CERN-Relay/RelayPagePictures/MedicalServiceAnnoncement.pdf

  16. Relay race

    CERN Multimedia

    Staff Association

    2011-01-01

    The CERN relay race will take place around the Meyrin site on Thursday 19th May starting at 12:15. If possible, please avoid driving on the site during this 20-minute period. If you do meet runners while driving your car, please STOP until they have all passed. Thank you for your cooperation. Details on the course, and how to register your team for the relay race, can be found at: https://espace.cern.ch/Running-Club/CERN-Relay Some advice for all runners from the medical service can also be found here: https://espace.cern.ch/Running-Club/CERN-Relay/RelayPagePictures/MedicalServiceAnnoncement.pdf

  17. Opportunistic Relay Selection in Multicast Relay Networks using Compressive Sensing

    KAUST Repository

    Elkhalil, Khalil

    2014-12-01

    Relay selection is a simple technique that achieves spatial diversity in cooperative relay networks. However, for relay selection algorithms to make a selection decision, channel state information (CSI) from all cooperating relays is usually required at a central node. This requirement poses two important challenges. Firstly, CSI acquisition generates a great deal of feedback overhead (air-time) that could result in significant transmission delays. Secondly, the fed back channel information is usually corrupted by additive noise. This could lead to transmission outages if the central node selects the set of cooperating relays based on inaccurate feedback information. In this paper, we introduce a limited feedback relay selection algorithm for a multicast relay network. The proposed algorithm exploits the theory of compressive sensing to first obtain the identity of the “strong” relays with limited feedback. Following that, the CSI of the selected relays is estimated using linear minimum mean square error estimation. To minimize the effect of noise on the fed back CSI, we introduce a back-off strategy that optimally backs-off on the noisy estimated CSI. For a fixed group size, we provide closed form expressions for the scaling law of the maximum equivalent SNR for both Decode and Forward (DF) and Amplify and Forward (AF) cases. Numerical results show that the proposed algorithm drastically reduces the feedback air-time and achieves a rate close to that obtained by selection algorithms with dedicated error-free feedback channels.

  18. The typical behaviour of relays

    OpenAIRE

    Alamino, Roberto C.; Saad, David

    2007-01-01

    The typical behaviour of the relay-without-delay channel and its many-units generalisation, termed the relay array, under LDPC coding, is studied using methods of statistical mechanics. A demodulate-and-forward strategy is analytically solved using the replica symmetric ansatz which is exact in the studied system at the Nishimori's temperature. In particular, the typical level of improvement in communication performance by relaying messages is shown in the case of small and large number of re...

  19. Full-Duplex opportunistic relay selection in future spectrum-sharing networks

    KAUST Repository

    Khafagy, Mohammad Galal

    2015-06-01

    We propose and analyze the performance of full-duplex relay selection in primary/secondary spectrum-sharing networks. Contrary to half-duplex relaying, full-duplex relaying (FDR) enables simultaneous listening/forwarding at the secondary relay, thereby allowing for a higher spectral efficiency. However, since the source and relay simultaneously transmit in FDR, their superimposed signal at the primary receiver should now satisfy the existing interference constraint which can considerably limit the secondary network throughput. In this regard, relay selection can offer an adequate solution to boost the secondary throughput while satisfying the imposed interference limit. We first analyze the performance of opportunistic relay selection among a cluster of full-duplex decode-and-forward relays with self-interference by deriving the exact cumulative distribution function of its end-to-end signal-to-noise ratio. Second, we evaluate the end-to-end performance of relay selection with interference constraints due to the presence of a primary receiver. Finally, the presented exact theoretical findings are verified by numerical simulations.

  20. Multichannel broadcast based on home channel for cognitive radio sensor networks.

    Science.gov (United States)

    Zeng, Fanzi; Tang, Yuting; Pu, Jianjie

    2014-01-01

    Considering the limited resources and the dynamic spectrum distribution in the cognitive radio sensor networks (CRSN), a half-duplex Multichannel broadcast protocol for CRSN is presented based on the home channel. This protocol maintains the networks topology only through the home channel, so there is no need for the public channel to transmit the control information and no need for the synchronization. After network initialization, node broadcasts data via home channel in half-duplex transmission way. The simulation results show that, compared with complete broadcast, the proposed protocol effectively reduces broadcast delay and overhead.

  1. Performance Analysis of Dual-hop MIMO Relay Systems with MRT&RAS in the Presence of Co-channel Interference

    Science.gov (United States)

    Xu, Xiaoming; Cai, Yueming; Yang, Weiwei

    2013-09-01

    This paper focuses on the downlink dual-hop multiple-input multiple-output (MIMO) amplify-and-forward (AF) relay systems that employ the maximal-ratio transmission and receive antenna selection scheme (MRT&RAS) for use in each hop. The system under consideration is equipped with arbitrary NS, NR, and ND antennas at the base station (BS), relay station (RS), and mobile station (MS), respectively. The system performance has been investigated over Nakagami-m fading in presence of independent but not necessarily identically distributed co-channel interferences (CCIs) at both the RS and MS. First, we derive an accurate closed-form approximate expression for the outage probability and a single-integral expression for the average symbol error rate (SER), respectively. Besides, to render direct insights into the combined effect of multiple-antenna and interference on the system performance, the asymptotic expressions for the outage probability and the average SER are also presented. Furthermore, we determine the optimal power allocation (OPA) by using the exact and asymptotic methods, respectively, such that the outage probability is minimized. Finally, numerical results validate the correctness of the derived expressions and show that OPA offers superior performance over uniform power allocation. Our analysis and results provide insights on investigating and optimizing the performance of the downlink MIMO relay transmission in practical interference-limited wireless networks.

  2. Relay Selection with Limited and Noisy Feedback

    KAUST Repository

    Eltayeb, Mohammed E.

    2016-01-28

    Relay selection is a simple technique that achieves spatial diversity in cooperative relay networks. Nonetheless, relay selection algorithms generally require error-free channel state information (CSI) from all cooperating relays. Practically, CSI acquisition generates a great deal of feedback overhead that could result in significant transmission delays. In addition to this, the fed back channel information is usually corrupted by additive noise. This could lead to transmission outages if the central node selects the set of cooperating relays based on inaccurate feedback information. In this paper, we propose a relay selection algorithm that tackles the above challenges. Instead of allocating each relay a dedicated channel for feedback, all relays share a pool of feedback channels. Following that, each relay feeds back its identity only if its effective channel (source-relay-destination) exceeds a threshold. After deriving closed-form expressions for the feedback load and the achievable rate, we show that the proposed algorithm drastically reduces the feedback overhead and achieves a rate close to that obtained by selection algorithms with dedicated error-free feedback from all relays. © 2015 IEEE.

  3. ARQ strategies for relay cooperative systems

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    We propose two novel automatic repeat request (ARQ) strategies for relay cooperative systems over Rayleigh fading channel: one uses relay ARQ and the other destination ARQ. The BER performance of these two strategies is derived in fast block fading. Numerical analysis and simulation show the systems can get more performance gain when the inter-channel (the source to the relay) quality is bad in the relay ARQ strategy. In the destination ARQ strategy, when the uplink qualities of the source and relay to the destination are poor, the average received SNR of the destination is much low, the systems performance can be improved efficiently.

  4. Energy-Efficient Relay Selection and Optimal Relay Location in Cooperative Cellular Networks with Asymmetric Traffic

    CERN Document Server

    Yang, Wei; Sun, Wanlu

    2010-01-01

    Energy-efficient communication is an important requirement for mobile relay networks due to the limited battery power of user terminals. This paper considers energy-efficient relaying schemes through selection of mobile relays in cooperative cellular systems with asymmetric traffic. The total energy consumption per information bit of the battery-powered terminals, i.e., the mobile station (MS) and the relay, is derived in theory. In the Joint Uplink and Downlink Relay Selection (JUDRS) scheme we proposed, the relay which minimizes the total energy consumption is selected. Additionally, the energy-efficient cooperation regions are investigated, and the optimal relay location is found for cooperative cellular systems with asymmetric traffic. The results reveal that the MS-relay and the relay-base station (BS) channels have different influence over relay selection decisions for optimal energy-efficiency. Information theoretic analysis of the diversity-multiplexing tradeoff (DMT) demonstrates that the proposed sc...

  5. Time of arrival based location estimation for cooperative relay networks

    KAUST Repository

    Çelebi, Hasari Burak

    2010-09-01

    In this paper, we investigate the performance of a cooperative relay network performing location estimation through time of arrival (TOA). We derive Cramer-Rao lower bound (CRLB) for the location estimates using the relay network. The analysis is extended to obtain average CRLB considering the signal fluctuations in both relay and direct links. The effects of the channel fading of both relay and direct links and amplification factor and location of the relay node on average CRLB are investigated. Simulation results show that the channel fading of both relay and direct links and amplification factor and location of relay node affect the accuracy of TOA based location estimation. ©2010 IEEE.

  6. Instantaneous Relaying: Optimal Strategies and Interference Neutralization

    CERN Document Server

    Ho, Zuleita

    2012-01-01

    In a multi-user wireless network equipped with multiple relay nodes, some relays are more intelligent than other relay nodes. The intelligent relays are able to gather channel state information, perform linear processing and forward signals whereas the dumb relays is only able to serve as amplifiers. As the dumb relays are oblivious to the source and destination nodes, the wireless network can be modeled as a relay network with *smart instantaneous relay* only: the signals of source-destination arrive at the same time as source-relay-destination. Recently, instantaneous relaying is shown to improve the degrees-of-freedom of the network as compared to classical cut-set bound. In this paper, we study an achievable rate region and its boundary of the instantaneous interference relay channel in the scenario of (a) uninformed non-cooperative source-destination nodes (source and destination nodes are not aware of the existence of the relay and are non-cooperative) and (b) informed and cooperative source-destination...

  7. Achievable Rates for a Two-Relay Network with Relays-Transmitter Feedbacks

    CERN Document Server

    Tebbi, Mohammad Ali; Attari, Mahmoud Ahmadian; Aref, Mohammad Reza

    2011-01-01

    We consider a relay network with two relays and two feedback links from the relays to the sender. To obtain the achievability results, we use the compress-and-forward and the decode-and-forward strategies to superimpose facility and cooperation analogue to what proposed by Cover and El Gamal for a relay channel. In addition to random binning, we use deterministic binning to perform restricted decoding. We show how to use the feedback links for cooperation between the sender and the relays to transmit the information which is compressed in the sender and the relays.

  8. ABA Signaling in Guard Cells Entails a Dynamic Protein-Protein Interaction Relay from the PYL-RCAR Family Receptors to Ion Channels

    Institute of Scientific and Technical Information of China (English)

    Sung Chul Lee; Chae Woo Lim; Wenzhi Lan; Kai He; Sheng Luan

    2013-01-01

    Plant hormone abscisic acid (ABA) serves as an integrator of environmental stresses such as drought to trigger stomatal closure by regulating specific ion channels in guard cells.We previously reported that SLACl,an outward anion channel required for stomatal closure,was regulated via reversible protein phosphorylation events involving ABA signaling components,including protein phosphatase 2C members and a SnRK2-type kinase (OST1).In this study,we reconstituted the ABA signaling pathway as a protein-protein interaction relay from the PYL/RCAR-type receptors,to the PP2C-SnRK2 phosphatase-kinase pairs,to the ion channel SLACl.The ABA receptors interacted with and inhibited PP2C phosphatase activity against the SnRK2-type kinase,releasing active SnRK2 kinase to phosphorylate,and activate the SLACl channel,leading to reduced guard cell turgor and stomatal closure.Both yeast two-hybrid and bimolecular fluorescence complementation assays were used to verify the interactions among the components in the pathway.These biochemical assays demonstrated activity modifications of phosphatases and kinases by their interaction partners.The SLACl channel activity was used as an endpoint readout for the strength of the signaling pathway,depending on the presence of different combinations of signaling components.Further study using transgenic plants overexpressing one of the ABA receptors demonstrated that changing the relative level of interacting partners would change ABA sensitivity.

  9. Opportunistic Relay Selection With Limited Feedback

    KAUST Repository

    Eltayeb, Mohammed E.

    2015-08-01

    Relay selection is a simple technique that achieves spatial diversity in cooperative relay networks. Generally, relay selection algorithms require channel state information (CSI) feedback from all cooperating relays to make a selection decision. This requirement poses two important challenges, which are often neglected in the literature. Firstly, the fed back channel information is usually corrupted by additive noise. Secondly, CSI feedback generates a great deal of feedback overhead (air-time) that could result in significant performance hits. In this paper, we propose a compressive sensing (CS) based relay selection algorithm that reduces the feedback overhead of relay networks under the assumption of noisy feedback channels. The proposed algorithm exploits CS to first obtain the identity of a set of relays with favorable channel conditions. Following that, the CSI of the identified relays is estimated using least squares estimation without any additional feedback. Both single and multiple relay selection cases are considered. After deriving closed-form expressions for the asymptotic end-to-end SNR at the destination and the feedback load for different relaying protocols, we show that CS-based selection drastically reduces the feedback load and achieves a rate close to that obtained by selection algorithms with dedicated error-free feedback. © 1972-2012 IEEE.

  10. Performance analysis of opportunistic nonregenerative relaying

    KAUST Repository

    Tourki, Kamel

    2013-01-01

    Opportunistic relaying in cooperative communication depends on careful relay selection. However, the traditional centralized method used for opportunistic amplify-and-forward protocols requires precise measurements of channel state information at the destination. In this paper, we adopt the max-min criterion as a relay selection framework for opportunistic amplify-and-forward cooperative communications, which was exhaustively used for the decode-and-forward protocol, and offer an accurate performance analysis based on exact statistics of the local signal-to-noise ratios of the best relay. Furthermore, we evaluate the asymptotical performance and deduce the diversity order of our proposed scheme. Finally, we validate our analysis by showing that performance simulation results coincide with our analytical results over Rayleigh fading channels, and we compare the max-min relay selection with their centralized channel state information-based and partial relay selection counterparts.

  11. Capacity gains of buffer-aided moving relays

    KAUST Repository

    Zafar, Ammar

    2017-03-14

    This work investigates the gain due to reduction in path loss by deploying buffer-aided moving relaying. In particular, the increase in gain due to moving relays is studied for dual-hop broadcast channels and the bidirectional relay channel. It is shown that the exploited gains in these channels due to buffer-aided relaying can be enhanced by utilizing the fact that a moving relay can communicate with the terminal closest to it and store the data in the buffer and then forward the data to the intended destination when it comes in close proximity with the destination. Numerical results show that for both the considered channels the achievable rates are increased as compared to the case of stationary relays. Numerical results also show that more significant increase in performance is seen when the relay moves to-and-fro between the source and the relay.

  12. On information flow in relay networks

    Science.gov (United States)

    El Gamal, A.

    Preliminary investigations conducted by El Gamal and Cover (1980) have shown that a max-flow min-cut interpretation for the capacity expressions of the classes of degraded and semideterministic relay channels can be found. In this paper it is shown that such an interpretation can also be found for fairly general classes of discrete memoryless relay networks. Cover and El Gamal (1979) have obtained general lower and upper bounds to capacity. However, the capacity of the general relay channel is not known. Past results are here extended to establish the capacity of deterministic relay networks with no interference and degraded relay networks. A general upper bound is given to the capacity of any relay network with this upper bound being a natural generalization of Theorem 4 in the study conducted by Cover and El Gamal (1979).

  13. Relay self interference minimisation using tapped filter

    KAUST Repository

    Jazzar, Saleh

    2013-05-01

    In this paper we introduce a self interference (SI) estimation and minimisation technique for amplify and forward relays. Relays are used to help forward signals between a transmitter and a receiver. This helps increase the signal coverage and reduce the required transmitted signal power. One problem that faces relays communications is the leaked signal from the relay\\'s output to its input. This will cause an SI problem where the new received signal at the relay\\'s input will be added with the unwanted leaked signal from the relay\\'s output. A Solution is proposed in this paper to estimate and minimise this SI which is based upon using a tapped filter at the destination. To get the optimum weights for this tapped filter, some channel parameters must be estimated first. This is performed blindly at the destination without the need of any training. This channel parameter estimation method is named the blind-self-interference-channel-estimation (BSICE) method. The next step in the proposed solution is to estimate the tapped filter\\'s weights. This is performed by minimising the mean squared error (MSE) at the destination. This proposed method is named the MSE-Optimum Weight (MSE-OW) method. Simulation results are provided in this paper to verify the performance of BSICE and MSE-OW methods. © 2013 IEEE.

  14. Protocols for Relay-Assisted Free-Space Optical Systems

    CERN Document Server

    Chatzidiamantis, Nestor D; Kriezis, Emmanouil E; Karagiannidis, George K; Schober, Robert

    2011-01-01

    We investigate transmission protocols for relay-assisted free-space optical (FSO) systems, when multiple parallel relays are employed and there is no direct link between the source and the destination. As alternatives to all-active FSO relaying, where all the available relays transmit concurrently, we propose schemes that select only a single relay to participate in the communication between the source and the destination in each transmission slot. This selection is based on the channel state information (CSI) obtained either from all or from some of the FSO links. Thus, the need for synchronizing the relays' transmissions is avoided and the slowly varying nature of the atmospheric channel is exploited. For both relay selection and all-active relaying, novel closed-form expressions for their outage performance are derived, assuming the versatile Gamma-Gamma channel model. Furthermore, based on the derived analytical results, the problem of allocating the optical power resources to the FSO links is addressed, ...

  15. Opportunistic Fixed Gain Bidirectional Relaying with Outdated CSI

    KAUST Repository

    Khan, Fahd Ahmed

    2015-05-01

    In a network with multiple relays, relay selection has been shown as an effective scheme to achieve diversity as well as to improve the overall throughput. This paper studies the impact of using outdated channel state information for relay selection on the performance of a network where two sources communicate with each other via fixed-gain amplify-and-forward relays. For a Rayleigh faded channel, closed-form expressions for the outage probability, moment generating function and symbol error rate are derived. Simulations results are also presented to corroborate the derived analytical results. It is shown that adding relays does not improve the performance if the channel is substantially outdated. Furthermore, relay location is also taken into consideration and it is shown that the performance can be improved by placing the relay closer to the source whose channel is more outdated. © 2015 IEEE.

  16. Decode and Zero-Forcing Forward Relaying with Relay Selection in Cognitive Radio Systems

    KAUST Repository

    Park, Kihong

    2014-05-01

    In this paper, we investigate a cognitive radio (CR) relay network with multiple relay nodes that help forwarding the signal of CR users. Best relay selection is considered to take advantage of its low complexity of implementation. When the primary user (PU) is located close to the relay nodes, the performance of the secondary network is severely degraded due to the interference power constraint during the transmission in the second hop. We propose a decode and zero-forcing forward scheme to suppress the interference power at the relay nodes and analyze the statistics of the end-to-end signal-to-noise ratio when the relay nodes are located arbitrarily and experience therefore non-identical Rayleigh fading channels. Numerical results validate our theoretical results and show that our proposed scheme improves the performance of the CR network when the PU is close to the relay nodes. © 2014 IEEE.

  17. Estimation of the LTE relay influence on the cell

    Directory of Open Access Journals (Sweden)

    V. Ya. Voropayeva

    2014-06-01

    Full Text Available Problem definition. Information technologies are constantly evolving. This process leads to an annual traffic increasing. Also requirements to infocommunication nerworks are increasing too. It stimulates the development of new technologies that will be able to satisfy the growing needs of users. At the present stage of evolution of world telecommunication technologies in mobile communications development and implementation of the fourth generation standard (4G networks are relevant. This type of networks provides a higher data rate and high quality of service with an overall decrease in operating costs of telecommunications equipment. One of the most relevant technologies is Long Term Evolution (LTE, which is the development of the third generation UMTS networks. Now there is a standard of 3GPP - LTE-Advanced, which is an improvement of LTE and the official wireless communications standard of the 4th generation. Relay Nodes has appeared in LTE-Advanced networks for more effective scheduling. Relay catches the signal from a Mobile Station, amplifies it and transmit it further to a Base Station. Selecting the optimal location of relay. In this paper we consider one LTE cell and one repeater type I (in-band, half-duplex. For this type of relay we calculate the best position of installation. The calculated value of the cell radius is 400 m for densely populated city. The type of division duplex is TDD, the frame configuration is 2, the width of the frequency band is 10 MHz. To calculate the cell radius COST231 Hata s 3GPP TS 25.996 v9.0.0 model for urban macro network is used. Scheduling scheme uses an algorithm Fair Work Conserving (FWC. FWC relates to such type of algorithms that operate on a resource allocation equally between the users. Users connect to the network at the speed of λ, which may be various. Estimation of the LTE relay influence on the cell. From these simulation results, we can conclude that the larger amount of resource blocks

  18. Partial QoS-Aware Opportunistic Relay Selection Over Two-Hop Channels: End-to-End Performance Under Spectrum-Sharing Requirements

    KAUST Repository

    Yuli Yang,

    2014-10-01

    In this paper, we propose a partial quality-of-service (QoS)-oriented relay selection scheme with a decode-and-forward (DF) relaying protocol, to reduce the feedback amount required for relay selection. In the proposed scheme, the activated relay is the one with the maximum signal-to-noise power ratio (SNR) in the second hop among those whose packet loss rates (PLRs) in the first hop achieve a predetermined QoS level. For the purpose of evaluating the performance of the proposed scheme, we exploit it with transmission constraints imposed on the transmit power budget and interference to other users. By analyzing the statistics of received SNRs in the first and second hops, we obtain the end-to-end PLR of this scheme in closed form under the considered scenario. Moreover, to compare the proposed scheme with popular relay selection schemes, we also derive the closed-form PLR expressions for partial relay selection (PRS) and opportunistic relay selection (ORS) criteria in the same scenario under study. Illustrative numerical results demonstrate the accuracy of our derivations and substantiate that the proposed relay selection scheme is a promising alternative with respect to the tradeoff between performance and complexity.

  19. On Alternate Relaying with Improper Gaussian Signaling

    KAUST Repository

    Gaafar, Mohamed

    2016-06-06

    In this letter, we investigate the potential benefits of adopting improper Gaussian signaling (IGS) in a two-hop alternate relaying (AR) system. Given the known benefits of using IGS in interference-limited networks, we propose to use IGS to relieve the inter-relay interference (IRI) impact on the AR system assuming no channel state information is available at the source. In this regard, we assume that the two relays use IGS and the source uses proper Gaussian signaling (PGS). Then, we optimize the degree of impropriety of the relays signal, measured by the circularity coefficient, to maximize the total achievable rate. Simulation results show that using IGS yields a significant performance improvement over PGS, especially when the first hop is a bottleneck due to weak source-relay channel gains and/or strong IRI.

  20. Cooperative Relaying with State Available Non-Causally at the Relay

    CERN Document Server

    Zaidi, Abdellatif; Laneman, J Nicholas; Vandendorpe, Luc

    2009-01-01

    We consider a three-terminal state-dependent relay channel with the channel state noncausally available at only the relay. Such a model may be useful for designing cooperative wireless networks with some terminals equipped with cognition capabilities, i.e., the relay in our setup. In the discrete memoryless (DM) case, we establish lower and upper bounds on channel capacity. The lower bound is obtained by a coding scheme at the relay that uses a combination of codeword splitting, Gel'fand-Pinsker binning, and decode-and-forward relaying. The upper bound improves upon that obtained by assuming that the channel state is available at the source, the relay, and the destination. For the Gaussian case, we also derive lower and upper bounds on the capacity. The lower bound is obtained by a coding scheme at the relay that uses a combination of codeword splitting, generalized dirty paper coding, and decode-and-forward relaying; the upper bound is also better than that obtained by assuming that the channel state is avai...

  1. Approximate Capacity of Gaussian Relay Networks

    CERN Document Server

    Avestimehr, Amir Salman; Tse, David N C

    2008-01-01

    We present an achievable rate for general Gaussian relay networks. We show that the achievable rate is within a constant number of bits from the information-theoretic cut-set upper bound on the capacity of these networks. This constant depends on the topology of the network, but not the values of the channel gains. Therefore, we uniformly characterize the capacity of Gaussian relay networks within a constant number of bits, for all channel parameters.

  2. Sort-based relay selection algorithm for decode-and-forward relay system

    Institute of Scientific and Technical Information of China (English)

    XIE Gang; LIU YuanAn; GAO JinChun; LI XingZheng

    2013-01-01

    In this paper, a sort-based relay selection algorithm is proposed for decode-and-forward wireless relay systems. The proposed algorithm can reduce computational complexity and system overhead in the relay selection for practical decode-and-forward wireless relay systems with multiple sources and multiple relays. This would be a very important improvement. Firstly, the sufficient and necessary conditions for a relay to be feasible to a source are derived. By adopting relay transmission via its feasible relay, the source can improve channel capacity compared to direct transmission. Then, a sort-based relay selection algorithm is proposed based on the sufficient and necessary conditions. In the proposed algorithm, each relay makes decision on its feasibility individually, but the final source-relay paring decision is made in a centralized manner. Simulation results show that the proposed algorithm can provide considerable system performance improvement over the existing algorithm. Especially at low signal-to-noise (SNR) region, the performance of the proposed algorithm almost reaches the optimal one.

  3. Beamforming Design of AF MIMO Two-Way Relay Channels Based on MSMSE%基于MSMSE的MIMO放大转发双向中继信道中波束成形设计

    Institute of Scientific and Technical Information of China (English)

    王梓斌; 向良军; 郑林华; 丁宏

    2011-01-01

    本文主要研究了基于最小化均方误差和准则的MIMO放大转发双向中继信道中的波束成形向量(矩阵)的设计.我们分别在集中式与分布式两种应用环境中提出了一套解决方案.在集中式方案中,多个中继之间完全协作,因此将多个单天线中继等效成一个多天线的中继节点,设计了基于所有中继天线的总功率控制的波束成形向量(矩阵).在分布式方案中,中继节点之间无协作,分别设计了基于所有中继总功率控制波束成形向量(矩阵)和基于单个中继功率控制的波束成形向量(矩阵).仿真表明,通过波束成形设计,可以显著提高通信节点平均误码率.由于中继节点之间的完全协作,集中式方案要优于分布式方案.但是,由于中继结构简单,分布式方案更易于在实践中应用.%In this paper, we design the beamforming in multiple-input multiple-output ( MIMO) two-way relay channels to minimize the sum mean squared errors (SMSE). Two source nodes communicate to each other with the help of multiple relays each with a single antenna. A scheme for a centralized model and another scheme for distributed model are proposed, respectively. In the first scheme, relays are assumed to be able to fully cooperate with each other and the multiple relay nodes can be equivalent to a single relay with multiple antennas. Relay beamforming under total power constraint of all relays is unitedly designed with the transmit beamforming and the receive beamforming. In the aecond scheme, there are no coopenration between relay nodes , and beamforming schemes under relay total power constraint and individual power constraint are designed, respectively. the simulation results show that beamforming at source and relay nodes significantly improve the average bit error rate (BER) performance. Furthermore, with cooperation across different relays, the performance of the centralized scheme is better than the distributed one, but the

  4. Double-Directional Information Azimuth Spectrum and Relay Network Tomography for a Decentralized Wireless Relay Network

    CERN Document Server

    Chen, Yifan

    2010-01-01

    A novel channel representation for a two-hop decentralized wireless relay network (DWRN) is proposed, where the relays operate in a completely distributive fashion. The modeling paradigm applies an analogous approach to the description method for a double-directional multipath propagation channel, and takes into account the finite system spatial resolution and the extended relay listening/transmitting time. Specifically, the double-directional information azimuth spectrum (IAS) is formulated to provide a compact representation of information flows in a DWRN. The proposed channel representation is then analyzed from a geometrically-based statistical modeling perspective. Finally, we look into the problem of relay network tomography (RNT), which solves an inverse problem to infer the internal structure of a DWRN by using the instantaneous doubledirectional IAS recorded at multiple measuring nodes exterior to the relay region.

  5. Two-Layer Coding Rate Optimization in Relay-Aided Systems

    DEFF Research Database (Denmark)

    Sun, Fan

    2011-01-01

    We consider a three-node transmission system, where a source node conveys a data block to a destination node with the help of a half-duplex decode and-forward (DF) relay node. The whole data block is transmitted as a sequence of packets. For reliable transmission in the three-node system, a two...... different system performance requirements. For different objectives, two optimization problems are formulated and solutions are presented. One is to minimize the outage probability given the efficiency requirement, while the other one is to maximize the transmission efficiency given the outage probability...... requirement. Numerical results are also provided to show the optimized physical layer coding and network coding rate pairs in different system scenarios....

  6. Relay race

    CERN Multimedia

    Staff Association

    2012-01-01

    The CERN Relay Race will take place around the Meyrin site on Thursday 24th May at 12:00. This annual event is for teams of six runners covering distances of 1000 m, 800 m, 800 m, 500 m, 500 m and 300 m respectively. Teams may be entered in the Seniors, Veterans, Ladies, Mixed or Open categories. There will also this year be a Nordic Walking event, as part of the Medical Service’s initiative “Move more, eat better!” The registration fee is 10 CHF per runner, and each runner will receive a souvenir prize. There will be a programme of entertainment from 12:00 on the arrival area (the lawn in front of Restaurant 1): 12:00 - 12:45  Music from the Old Bottom Street band 12:15 Start of the race 12:45 - 13h Demonstrations by the Fitness club and Dancing club 13:00 Results and prize giving (including a raffle to win an iPad2 3G offered by the Micro club) 13:20 à 14:00 Music from “What’s next” And many information st...

  7. T-current related effects of antiepileptic drugs and a Ca2+ channel antagonist on thalamic relay and local circuit interneurons in a rat model of absence epilepsy.

    Science.gov (United States)

    Broicher, Tilman; Seidenbecher, Thomas; Meuth, Patrick; Munsch, Thomas; Meuth, Sven G; Kanyshkova, Tatyana; Pape, Hans-Christian; Budde, Thomas

    2007-09-01

    Channel blocking, anti-oscillatory, and anti-epileptic effects of clinically used anti-absence substances (ethosuximide, valproate) and the T-type Ca2+ current (IT) blocker mibefradil were tested by analyzing membrane currents in acutely isolated local circuit interneurons and thalamocortical relay (TC) neurons, slow intrathalamic oscillations in brain slices, and spike and wave discharges (SWDs) occurring in vivo in Wistar Albino Glaxo rats from Rijswijk (WAG/Rij). Substance effects in vitro were compared between WAG/Rij and a non-epileptic control strain, the ACI rats. Ethosuximide (ETX) and valproate were found to block IT in acutely isolated thalamic neurons. Block of IT by therapeutically relevant ETX concentrations (0.25-0.75 mM) was stronger in WAG/Rij, although the maximal effect at saturating concentrations (>or=10 mM) was stronger in ACI. Ethosuximide delayed the onset of the low threshold Ca2+ spike (LTS) of neurons recorded in slice preparations. Mibefradil (>or=2 microM) completely blocked IT and the LTS, dampened evoked thalamic oscillations, and attenuated SWDs in vivo. Computational modeling demonstrated that the complete effect of ETX can be replicated by a sole reduction of IT. However, the necessary degree of IT reduction was not induced by therapeutically relevant ETX concentrations. A combined reduction of IT, the persistent sodium current, and the Ca2+ activated K+ current resulted in an LTS alteration resembling the experimental observations. In summary, these results support the hypothesis of IT reduction as part of the mechanism of action of anti-absence drugs and demonstrate the ability of a specific IT antagonist to attenuate rhythmic burst firing and SWDs.

  8. Partial relay selection in underlay cognitive networks with fixed gain relays

    KAUST Repository

    Hussain, Syed Imtiaz

    2012-05-01

    In a communication system with multiple cooperative relays, selecting the best relay utilizes the available spectrum more efficiently. However, selective relaying poses a different problem in underlay cognitive networks compared to the traditional cooperative networks due to interference thresholds to the primary users. In most cases, a best relay is the one which provides the maximum end-to-end signal to noise ratio (SNR). This approach needs plenty of instantaneous channel state information (CSI). The CSI burden could be reduced by partial relay selection. In this paper, a partial relay selection scheme is presented and analyzed for an underlay cognitive network with fixed gain relays operating in the vicinity of a primary user. The system model is adopted in a way that each node needs minimal CSI to perform its task. The best relay is chosen on the basis of maximum source to relay link SNR which then forwards the message to the destination. We derive closed form expressions for the received SNR distributions, system outage, probability of bit error and average channel capacity of the system. The derived results are confirmed through simulations. © 2012 IEEE.

  9. Filter-and-Forward Transparent Relay Design for OFDM Systems

    CERN Document Server

    Kim, Donggun; Sung, Youngchul

    2012-01-01

    In this paper, the filter-and-forward (FF) relay design for orthogonal frequency-division multiplexing (OFDM) transmission systems is considered to improve the system performance over simple amplify-and-forward (AF) relaying. Unlike conventional OFDM relays performing OFDM demodulation and remodulating, to reduce processing complexity, the proposed FF relay directly filters the incoming signal with a finite impulse response (FIR) and forwards the filtered signal to the destination. Two design criteria are considered to optimize the relay filter for given source power allocation. One is to minimize the relay transmit power subject to per-subcarrier signal-to-noise ratio (SNR) constraints and the other is to maximize the worst subcarrier channel SNR subject to the total relay transmit power constraint. It is shown that the two problems reduce to semi-definite programming (SDP) problems. Furthermore, the problem of joint source power allocation and relay filter design is considered for the second criterion, and ...

  10. Joint Uplink and Downlink Relay Selection in Cooperative Cellular Networks

    CERN Document Server

    Yang, Wei; Wu, Gang; Wang, Haifeng; Wang, Ying

    2010-01-01

    We consider relay selection technique in a cooperative cellular network where user terminals act as mobile relays to help the communications between base station (BS) and mobile station (MS). A novel relay selection scheme, called Joint Uplink and Downlink Relay Selection (JUDRS), is proposed in this paper. Specifically, we generalize JUDRS in two key aspects: (i) relay is selected jointly for uplink and downlink, so that the relay selection overhead can be reduced, and (ii) we consider to minimize the weighted total energy consumption of MS, relay and BS by taking into account channel quality and traffic load condition of uplink and downlink. Information theoretic analysis of the diversity-multiplexing tradeoff demonstrates that the proposed scheme achieves full spatial diversity in the quantity of cooperating terminals in this network. And numerical results are provided to further confirm a significant energy efficiency gain of the proposed algorithm comparing to the previous best worse channel selection an...

  11. Cooperative Jamming for Secure Communications in MIMO Relay Networks

    CERN Document Server

    Huang, Jing

    2011-01-01

    Secure communications can be impeded by eavesdroppers in conventional relay systems. This paper proposes cooperative jamming strategies for two-hop relay networks where the eavesdropper can wiretap the relay channels in both hops. In these approaches, the normally inactive nodes in the relay network can be used as cooperative jamming sources to confuse the eavesdropper. Linear precoding schemes are investigated for two scenarios where single or multiple data streams are transmitted via a decode-and-forward (DF) relay, under the assumption that global channel state information (CSI) is available. For the case of single data stream transmission, we derive closed-form jamming beamformers and the corresponding optimal power allocation. Generalized singular value decomposition (GSVD)-based secure relaying schemes are proposed for the transmission of multiple data streams. The optimal power allocation is found for the GSVD relaying scheme via geometric programming. Based on this result, a GSVD-based cooperative jam...

  12. Outage performance of two-way DF relaying systems with a new relay selection metric

    KAUST Repository

    Hyadi, Amal

    2012-04-01

    This paper investigates a new constrained relay selection scheme for two-way relaying systems where two end terminals communicate simultaneously via a relay. The introduced technique is based on the maximization of the weighted sum rate of both users. To evaluate the performance of the proposed system, the outage probability is derived in a general case (where an arbitrary channel is considered), and then over independently but not necessarily identically distributed (i.n.i.d.) Rayleigh fading channels. The analytical results are verified through simulations. © 2012 IEEE.

  13. Efficient incremental relaying

    KAUST Repository

    Fareed, Muhammad Mehboob

    2013-07-01

    We propose a novel relaying scheme which improves the spectral efficiency of cooperative diversity systems by utilizing limited feedback from destination. Our scheme capitalizes on the fact that relaying is only required when direct transmission suffers deep fading. We calculate the packet error rate for the proposed efficient incremental relaying scheme with both amplify and forward and decode and forward relaying. Numerical results are also presented to verify their analytical counterparts. © 2013 IEEE.

  14. Reactive relay selection in underlay cognitive networks with fixed gain relays

    KAUST Repository

    Hussain, Syed Imtiaz

    2012-06-01

    Best relay selection is a bandwidth efficient technique for multiple relay environments without compromising the system performance. The problem of relay selection is more challenging in underlay cognitive networks due to strict interference constraints to the primary users. Generally, relay selection is done on the basis of maximum end-to-end signal to noise ratio (SNR). However, it requires large amounts of channel state information (CSI) at different network nodes. In this paper, we present and analyze a reactive relay selection scheme in underlay cognitive networks where the relays are operating with fixed gains near a primary user. The system model minimizes the amount of CSI required at different nodes and the destination selects the best relay on the basis of maximum relay to destination SNR. We derive close form expressions for the received SNR statistics, outage probability, bit error probability and average channel capacity of the system. Simulation results are also presented to confirm the validity of the derived expressions. © 2012 IEEE.

  15. Nakagami-m信道下DAF选择中继的中断性能分析%Outage Performance of Selection Decode-and-Forward Relay Network over Nakagami-m Fading Channels

    Institute of Scientific and Technical Information of China (English)

    啜钢; 刘振兴; 王涛

    2011-01-01

    To solve the complicated problem of analysis of outage performance in cooperative communication system, a theoretical analysis method is proposed. A selection relay model with a direct link over independent identically distributed Nakagami-m fading channels is considered based on the power restricted cooperative communication system. An analytical expression of outage probability is derived and the outage performance is analyzed for this model. The optimal power allocation is also investigated and a power allocation factor in a specific relay number is given. Simulations show that the outage performance is evidently improved compared with other selection relay models. The optimal power allocation ia also investigated and a power allocation factor in a specific relay number is given.%为了解决协作通信系统中选择中继算法中断性能分析复杂的问题,提出了一种新的中断分析方法.基于功率受限协作通信系统,考虑Nakagami-m独立同分布信道下一种带有直通链路的选择中继模型,在该模型下推导了中断概率表达式,分析了系统的中断性能,经仿真验证了理论分析的准确性.探讨了优化功率分配,给出特定中继数情况下的功率分配系数.分析结果表明,在该模型下的中断性能与已有模型相比均有所提高.

  16. Relaying Strategies and Protocols for Efficient Wireless Networks

    KAUST Repository

    Zafar, Ammar

    2014-10-01

    Next generation wireless networks are expected to provide high data rate and satisfy the Quality-of-Service (QoS) constraints of the users. A significant component of achieving these goals is to increase the effi ciency of wireless networks by either optimizing current architectures or exploring new technologies which achieve that. The latter includes revisiting technologies which were previously proposed, but due to a multitude of reasons were ignored at that time. One such technology is relaying which was initially proposed in the latter half of the 1960s and then was revived in the early 2000s. In this dissertation, we study relaying in conjunction with resource allocation to increase the effi ciency of wireless networks. In this regard, we differentiate between conventional relaying and relaying with buffers. Conventional relaying is traditional relaying where the relay forwards the signal it received immediately. On the other hand, in relaying with buffers or buffer-aided relaying as it is called, the relay can store received data in its buffer and forward it later on. This gives the benefit of taking advantage of good channel conditions as the relay can only transmit when the channel conditions are good. The dissertation starts with conventional relaying and considers the problem of minimizing the total consumed power while maintaining system QoS. After upper bounding the system performance, more practical algorithms which require reduced feedback overhead are explored. Buffer-aided relaying is then considered and the joint user-and-hop scheduler is introduced which exploits multi-user diversity (MUD) and 5 multi-hop diversity (MHD) gains together in dual-hop broadcast channels. Next joint user-and-hop scheduling is extended to the shared relay channel where two source-destination pairs share a single relay. The benefits of buffer-aided relaying in the bidirectional relay channel utilizing network coding are then explored. Finally, a new transmission protocol

  17. Performance limitations of relay neurons.

    Directory of Open Access Journals (Sweden)

    Rahul Agarwal

    Full Text Available Relay cells are prevalent throughout sensory systems and receive two types of inputs: driving and modulating. The driving input contains receptive field properties that must be transmitted while the modulating input alters the specifics of transmission. For example, the visual thalamus contains relay neurons that receive driving inputs from the retina that encode a visual image, and modulating inputs from reticular activating system and layer 6 of visual cortex that control what aspects of the image will be relayed back to visual cortex for perception. What gets relayed depends on several factors such as attentional demands and a subject's goals. In this paper, we analyze a biophysical based model of a relay cell and use systems theoretic tools to construct analytic bounds on how well the cell transmits a driving input as a function of the neuron's electrophysiological properties, the modulating input, and the driving signal parameters. We assume that the modulating input belongs to a class of sinusoidal signals and that the driving input is an irregular train of pulses with inter-pulse intervals obeying an exponential distribution. Our analysis applies to any [Formula: see text] order model as long as the neuron does not spike without a driving input pulse and exhibits a refractory period. Our bounds on relay reliability contain performance obtained through simulation of a second and third order model, and suggest, for instance, that if the frequency of the modulating input increases or the DC offset decreases, then relay increases. Our analysis also shows, for the first time, how the biophysical properties of the neuron (e.g. ion channel dynamics define the oscillatory patterns needed in the modulating input for appropriately timed relay of sensory information. In our discussion, we describe how our bounds predict experimentally observed neural activity in the basal ganglia in (i health, (ii in Parkinson's disease (PD, and (iii in PD during

  18. Robust distributed cognitive relay beamforming

    KAUST Repository

    Pandarakkottilil, Ubaidulla

    2012-05-01

    In this paper, we present a distributed relay beamformer design for a cognitive radio network in which a cognitive (or secondary) transmit node communicates with a secondary receive node assisted by a set of cognitive non-regenerative relays. The secondary nodes share the spectrum with a licensed primary user (PU) node, and each node is assumed to be equipped with a single transmit/receive antenna. The interference to the PU resulting from the transmission from the cognitive nodes is kept below a specified limit. The proposed robust cognitive relay beamformer design seeks to minimize the total relay transmit power while ensuring that the transceiver signal-to-interference- plus-noise ratio and PU interference constraints are satisfied. The proposed design takes into account a parameter of the error in the channel state information (CSI) to render the performance of the beamformer robust in the presence of imperfect CSI. Though the original problem is non-convex, we show that the proposed design can be reformulated as a tractable convex optimization problem that can be solved efficiently. Numerical results are provided and illustrate the performance of the proposed designs for different network operating conditions and parameters. © 2012 IEEE.

  19. Efficient Relay Selection Scheme based on Fuzzy Logic for Cooperative Communication

    Directory of Open Access Journals (Sweden)

    Shakeel Ahmad Waqas

    2016-11-01

    Full Text Available The performance of cooperative network can be increased by using relay selection technique. Therefore, interest in relay selection is sloping upward. We proposed two new relay selection schemes based on fuzzy logic for dual hop cooperative communication. These relay selection schemes require SNR (signal to noise ratio, cooperative gain and channel gain as input fuzzy parameters for selection of best relay. The performance of first proposed relay selection scheme is evaluated in term of BER (bit error rate in Nakagami, Rician and Rayleigh fading channels. In second proposed relay selection scheme, threshold is used with the objective to minimize the power consumption and channel estimation load. Its performance is analyzed in term of BER, number of active relays and load of number of channel estimations.

  20. Securing Relay Networks with Artificial Noise: An Error Performance-Based Approach

    National Research Council Canada - National Science Library

    Ying Liu; Liang Li; George C Alexandropoulos; Marius Pesavento

    2017-01-01

    ... (AN) symbols to jam the relay reception. The objective of our considered AN design is to degrade the error probability performance at the untrusted relay, for different types of channel state information (CSI) at the destination...

  1. Joint Linear Transceiver Design for MIMO Relay Systems Based on Channel Estimation Errors%MIMO中继系统中基于失真信道的联合收发机设计

    Institute of Scientific and Technical Information of China (English)

    钱栋军; 张静; 顾夏珺

    2013-01-01

    In MIMO relay system, the scheme of designing the joint linear transmitters and the receiver considering the joint source, relay and destination based on perfect channel state information ( CSI) is derived. Based on this, the paper considering the channel estimate errors modeled as Gaussian random variables and under power constraint at both the source and the relay node, the transmitters and receiver could be realized through a joint iterative algorithm. Compared with the existing methods, the results show that the proposed scheme could effectively improve the BER performance and reduce the minimum mean square error of the system.%在MIMO中继系统中,基于完全信道状态信息的基站、中继节点和终端联合收发机设计方案能够改善系统的误比特率性能,在放大转发(AF)中继的基础上提出了一种基于不完全信道状态信息的联合收发机设计方案.新方案在基站和中继节点的功率都受限条件下,将信道估计误差建模为高斯随机变量,以最小均方误差(MMSE)为准则,采用迭代算法,得到了基站预编码矩阵、中继转发矩阵和终端解码矩阵.该方案与不考虑信道估计误差的方案相比,能够有效地改善系统的均方误差和误比特率性能.

  2. Relay-and-antenna selection and digital transceiver design for two-way AF-MIMO multiple-relay systems

    Science.gov (United States)

    Hu, Chia-Chang; Su, Hao-Hsian; Tang, Kang-Tsao

    2014-09-01

    This paper considers a two-way multiple-input multiple-output (MIMO) relaying system with multiple relays between two terminals nodes. The relay antenna selection scheme based on channel singular valued decomposition (SVD) is used to reduce energy consumption. To enhance the system performance, we apply a SVD-based algorithm with MSE criterion which calculates optimal linear transceivers precoding jointly at the source nodes and relay nodes for amplify-and-forward (AF) protocols. In computer simulations, we use an iteration method to compute the non-convex function of joint source and relays power allocation. The simulation results show the SVD-based precoding design with SVD-based relay and antenna selection scheme can achieve a superior system bit error rate (BER) performance and reduce the power consume of relay antennas.

  3. Transmission Techniques for Relay-Interference Networks

    CERN Document Server

    Mohajer, Soheil; Fragouli, Christina; Tse, David N C

    2008-01-01

    In this paper we study the relay-interference wireless network, in which relay (helper) nodes are to facilitate competing information flows over a wireless network. We examine this in the context of a deterministic wireless interaction model, which eliminates the channel noise and focuses on the signal interactions. Using this model, we show that almost all the known schemes such as interference suppression, interference alignment and interference separation are necessary for relay-interference networks. In addition, we discover a new interference management technique, which we call interference neutralization, which allows for over-the-air interference removal, without the transmitters having complete access the interfering signals. We show that interference separation, suppression, and neutralization arise in a fundamental manner, since we show complete characterizations for special configurations of the relay-interference network.

  4. Telemetry data via communications relay

    Science.gov (United States)

    Strock, O. J.; Witchey, Michael

    This paper responds to a test range engineer's need to relay one or more channels of various types of telemetry data from a remotely-located receiving station to the central telemetry station at range headquarters for real-time processing and display. Several types of data are identified, and specific equipment and technology for multiplexing, transmission, and demultiplexing up to eight streams from a variety of sources is discussed. The widely-used T3 communications link, also known as DS-3, can relay data via satellite, microwave link, or other high-speed path at 44.736 megabits per second, of which about 95 percent can be actual telemetry data; other standard links operate at lower aggregate rates. Several links and rates are discussed, with emphasis in the high-rate T3 link.

  5. CERN Relay Race

    CERN Multimedia

    CERN Running Club

    2010-01-01

    The CERN relay race will take place around the Meyrin site on Thursday 20 May, starting at 12.15. If possible, please avoid driving on the site during this 20-minute period. If you do meet runners while driving your car, please STOP until they have all passed. Thank you for your cooperation. Details on the route, and how to register your team for the relay race, can be found at: https://espace.cern.ch/Running-Club/CERN-Relay

  6. Protective relay principles

    CERN Document Server

    Sleva, Anthony F

    2009-01-01

    This title lets you improve failure detection and optimize protection. In the ever-evolving field of protective relay technology, an engineer's personal preference and professional judgment are as important to power system protection as the physical relays used to detect and isolate abnormal conditions. With invaluable insights from an experienced expert, ""Protective Relay Principles"" focuses on probable power system failure modes and the important characteristics of the protective relays used to detect these postulated failures.This book presents useful new concepts in a way that is easier

  7. Cognitive Spectrum Efficient Multiple Access Technique using Relay Systems

    DEFF Research Database (Denmark)

    Frederiksen, Flemming Bjerge; Prasad, Ramjee

    2007-01-01

    Methods to enhance the use of the frequency spectrum by automatical spectrum sensing plus spectrum sharing in a cognitive radio technology context will be presented and discussed in this paper. Ideas to increase the coverage of cellular systems by relay channels, relay stations and collaborate ra...

  8. Cognitive Spectrum Efficient Multiple Access Technique using Relay Systems

    DEFF Research Database (Denmark)

    Frederiksen, Flemming Bjerge; Prasad, Ramjee

    2007-01-01

    Methods to enhance the use of the frequency spectrum by automatical spectrum sensing plus spectrum sharing in a cognitive radio technology context will be presented and discussed in this paper. Ideas to increase the coverage of cellular systems by relay channels, relay stations and collaborate...

  9. Performance Analysis of Selective Decode-and-Forward Multinode Incremental Relaying with Maximal Ratio Combining

    KAUST Repository

    Hadjtaieb, Amir

    2013-09-12

    In this paper, we propose an incremental multinode relaying protocol with arbitrary N-relay nodes that allows an efficient use of the channel spectrum. The destination combines the received signals from the source and the relays using maximal ratio Combining (MRC). The transmission ends successfully once the accumulated signal-to-noise ratio (SNR) exceeds a predefined threshold. The number of relays participating in the transmission is adapted to the channel conditions based on the feedback from the destination. The use of incremental relaying allows obtaining a higher spectral efficiency. Moreover, the symbol error probability (SEP) performance is enhanced by using MRC at the relays. The use of MRC at the relays implies that each relay overhears the signals from the source and all previous relays and combines them using MRC. The proposed protocol differs from most of existing relaying protocol by the fact that it combines both incremental relaying and MRC at the relays for a multinode topology. Our analyses for a decode-and-forward mode show that: (i) compared to existing multinode relaying schemes, the proposed scheme can essentially achieve the same SEP performance but with less average number of time slots, (ii) compared to schemes without MRC at the relays, the proposed scheme can approximately achieve a 3 dB gain.

  10. Wireless Network Simplification: the Gaussian N-Relay Diamond Network

    CERN Document Server

    Nazaroglu, Caner; Fragouli, Christina

    2011-01-01

    We consider the Gaussian N-relay diamond network, where a source wants to communicate to a destination node through a layer of N-relay nodes. We investigate the following question: What fraction of the capacity can we maintain by using only k out of the N available relays? We show that in every Gaussian N-relay diamond network, there exists a subset of k relays which alone provide approximately a fraction k/(k+1) of the total capacity. The result holds independent of the number of available relay nodes N, the channel configurations and the operating SNR. The result is tight in the sense that there exists channel configurations for N-relay diamond networks, where every subset of k relays can provide at most a fraction of k/(k+1) of the total capacity. The approximation is within 3logN+3k bits/s/Hz to the capacity. This result also provides a new approximation to the capacity of the Gaussian N-relay diamond network which is up to a multiplicative gap of 1/(k+1) and additive gap of 3logN+3k. The current approxim...

  11. First Things First: Internet Relay Chat Openings.

    Science.gov (United States)

    Rintel, E. Sean; Mulholland, Joan; Pittam, Jeffery

    2001-01-01

    Argues that Internet Relay Chat (IRC) research needs to systematically address links between interaction structures, technological mediation and the instantiation and development of interpersonal relationships. Finds that openings that occur directly following user's entries into public IRC channels are often ambiguous, can disrupt relationship…

  12. First Things First: Internet Relay Chat Openings.

    Science.gov (United States)

    Rintel, E. Sean; Mulholland, Joan; Pittam, Jeffery

    2001-01-01

    Argues that Internet Relay Chat (IRC) research needs to systematically address links between interaction structures, technological mediation and the instantiation and development of interpersonal relationships. Finds that openings that occur directly following user's entries into public IRC channels are often ambiguous, can disrupt relationship…

  13. Relay Precoder Optimization in MIMO-Relay Networks With Imperfect CSI

    KAUST Repository

    Ubaidulla, P.

    2011-11-01

    In this paper, we consider robust joint designs of relay precoder and destination receive filters in a nonregenerative multiple-input multiple-output (MIMO) relay network. The network consists of multiple source-destination node pairs assisted by a MIMO-relay node. The channel state information (CSI) available at the relay node is assumed to be imperfect. We consider robust designs for two models of CSI error. The first model is a stochastic error (SE) model, where the probability distribution of the CSI error is Gaussian. This model is applicable when the imperfect CSI is mainly due to errors in channel estimation. For this model, we propose robust minimum sum mean square error (SMSE), MSE-balancing, and relay transmit power minimizing precoder designs. The next model for the CSI error is a norm-bounded error (NBE) model, where the CSI error can be specified by an uncertainty set. This model is applicable when the CSI error is dominated by quantization errors. In this case, we adopt a worst-case design approach. For this model, we propose a robust precoder design that minimizes total relay transmit power under constraints on MSEs at the destination nodes. We show that the proposed robust design problems can be reformulated as convex optimization problems that can be solved efficiently using interior-point methods. We demonstrate the robust performance of the proposed design through simulations. © 2011 IEEE.

  14. Power system relaying

    CERN Document Server

    Horowitz, Stanley H; Niemira, James K

    2013-01-01

    The previous three editions of Power System Relaying offer comprehensive and accessible coverage of the theory and fundamentals of relaying and have been widely adopted on university and industry courses worldwide. With the third edition, the authors have added new and detailed descriptions of power system phenomena such as stability, system-wide protection concepts and discussion of historic outages. Power System Relaying, 4th Edition continues its role as an outstanding textbook on power system protection for senior and graduate students in the field of electric power engineering and a refer

  15. CERN Relay Race

    CERN Multimedia

    2008-01-01

    The CERN relay race will take place around the Meyrin site on Thursday 5 June starting at 12:15 p.m. If possible, please avoid driving on the site during this 20-minute period. If you do meet runners while driving your car, please STOP until they have all passed. Thank you for your cooperation. Details on how to register your team for the relay race are given on the Staff Association Bulletin web site. You can access the online registration form at: http://cern.ch/club-running-relay/form.html

  16. CERN Relay Race

    CERN Multimedia

    2007-01-01

    The CERN relay race will take place around the Meyrin site on Wednesday 23 May starting at 12:15. If possible, please avoid driving on the site during this 20-minute period. If you do meet runners while driving your car, please STOP until they have all passed. Thank you for your cooperation. Details on how to register your team for the relay race are given on the Staff Association Bulletin web site. You can access the online registration form at: http://cern.ch/club-running-relay/form.html

  17. 多跳噪声量子纠缠信道特性及最佳中继协议∗%Characteristics of multi-hop noisy quantum entanglement channel and optimal relay proto col

    Institute of Scientific and Technical Information of China (English)

    杨光; 廉保旺; 聂敏

    2015-01-01

    在量子通信网络中,最佳中继路径的计算与选择策略是影响网络性能的关键因素。针对噪声背景下量子隐形传态网络中的中继路径选择问题,本文首先研究了相位阻尼信道及振幅阻尼信道上的纠缠交换过程,通过理论推导给出了两种多跳纠缠交换信道上的纠缠保真度与路径等效阻尼系数。在此基础上提出以路径等效阻尼系数为准则的隐形传态网络最佳中继协议,并给出了邻居发现、量子链路噪声参数测量、量子链路状态信息传递、中继路径计算与纠缠资源预留等工作的具体过程。理论分析与性能仿真结果表明,相比于现有的量子网络路径选择策略,本文方法能获得更小的路径平均等效阻尼系数及更高的隐形传态保真度。此外,通过分析链路纠缠资源数量对协议性能的影响,说明在进行量子通信网设计时,可以根据网络的规模及用户的需求合理配置链路纠缠资源。%The optimal relay path calculation and selection are important factors to affect the performance of quantum communication network. Current researches seldom consider the quantum path selection in real noisy environments. One of the difficult problems is how to analyze the influence of the noise on the quantum communication in multi-hop channels. This paper aims to solve the path selection problem of the quantum teleportation network in noisy environments. The process of entanglement swapping in the phase damping channel is first studied with an example of two-hop quantum channel, whose damping factors are p1 and p2. The entanglement states|Φ⟩+12 and|Φ⟩+34 are distributed separately in each hop. After the entanglement swapping, the density matrix of the entanglement state of photon 1 and photon 4 is obtained by performing a partial trace over the environment. Then, the Bures fidelity of this entanglement is calculated. After that, we define the path

  18. Cooperation with an Untrusted Relay: A Secrecy Perspective

    CERN Document Server

    He, Xiang

    2009-01-01

    We consider the communication scenario where a source-destination pair wishes to keep the information secret from a relay node despite wanting to enlist its help. For this scenario, an interesting question is whether the relay node should be deployed at all. That is, whether cooperation with an untrusted relay node can ever be beneficial. We first provide an achievable secrecy rate for the general untrusted relay channel, and proceed to investigate this question for two types of relay networks with orthogonal components. For the first model, there is an orthogonal link from the source to the relay. For the second model, there is an orthogonal link from the relay to the destination. For the first model, we find the equivocation capacity region and show that answer is negative. In contrast, for the second model, we find that the answer is positive. Specifically, we show by means of the achievable secrecy rate based on compress-and-forward, that, by asking the untrusted relay node to relay information, we can ac...

  19. Duplex Schemes in Multiple Antenna Two-Hop Relaying

    Directory of Open Access Journals (Sweden)

    Anja Klein

    2008-04-01

    Full Text Available A novel scheme for two-hop relaying defined as space division duplex (SDD relaying is proposed. In SDD relaying, multiple antenna beamforming techniques are applied at the intermediate relay station (RS in order to separate downlink and uplink signals of a bi-directional two-hop communication between two nodes, namely, S1 and S2. For conventional amplify-and-forward two-hop relaying, there appears a loss in spectral efficiency due to the fact that the RS cannot receive and transmit simultaneously on the same channel resource. In SDD relaying, this loss in spectral efficiency is circumvented by giving up the strict separation of downlink and uplink signals by either time division duplex or frequency division duplex. Two novel concepts for the derivation of the linear beamforming filters at the RS are proposed; they can be designed either by a three-step or a one-step concept. In SDD relaying, receive signals at S1 are interfered by transmit signals of S1, and receive signals at S2 are interfered by transmit signals of S2. An efficient method in order to combat this kind of interference is proposed in this paper. Furthermore, it is shown how the overall spectral efficiency of SDD relaying can be improved if the channels from S1 and S2 to the RS have different qualities.

  20. Ready, steady… relay!

    CERN Multimedia

    2008-01-01

    Thursday 5 June. With another year comes another success for CERN’s Relay Race. With 76 teams taking part it was the second highest turnout in the race’s history. ‘The Shabbys’ won the relay race in 10 minutes 51 seconds.As popular as ever, this year the relay race took on the atmosphere of a mini carnival. Gathering on the lawn outside Restaurant 1, various stalls and attractions added to the party feeling of the event, with beer courtesy of ‘AGLUP’, the Belgian beer club, and a wandering jazz group entertaining spectators and competitors alike. Reflecting the greater involvement of other associations in the relay race, the president of the Staff Association Clubs Committee, James Purvis, was the guest of honour, launching the start of the race and presenting the prizes. As regular followers of the race could have probably predicted, The Shabbys were once again victorious and claimed first place. The team members th...

  1. CERN Relay Race 2009

    CERN Multimedia

    2009-01-01

    The CERN relay race will take place around the Meyrin site on Thursday 14th May starting at 12:15. If possible, please avoid driving on the site during this 20-minute period. If you do meet runners while driving your car, please STOP until they have all passed. Thank you for your cooperation. More details on how to register your team for the relay race

  2. Cognitive Relay Networks: A Comprehensive Survey

    Directory of Open Access Journals (Sweden)

    Ayesha Naeem

    2015-07-01

    Full Text Available Cognitive radio is an emerging technology to deal with the scarcity and requirement of radio spectrum by dynamically assigning spectrum to unlicensed user . This revolutionary technology shifts the paradigm in the wireless system design by all owing unlicensed user the ability to sense, adapt and share the dynamic spectrum. Cognitive radio technology have been applied to different networks and applications ranging from wireless to public saf ety, smart grid, medical, rela y and cellular applications to increase the throughput and spectrum efficiency of the network. Among these applications, cognitive relay networks is one of the application where cognitive radio technology has been applied. Cognitiv e rela y network increases the network throughput by reducing the complete pa th loss and also by ensuring cooper ation among secondary users and cooperation among primary and secondary users. In this paper , our aim is to provide a survey on cognitive relay network. We also provide a detailed review on existing schemes in cognitive relay networks on the basis of relaying protocol, relay cooperation and channel model.

  3. A cooperative MAC protocol with error-aware relay selection for wireless ad hoc networks

    Science.gov (United States)

    Liu, Shanzhi; Liu, Kai; Wang, Rui; Fang, Ruochen; Liu, Feng

    2017-01-01

    To solve performance degradation caused by channel fading, we propose a cooperative MAC protocol with error-aware relay selection for wireless ad hoc networks in this paper. In the protocol, the transmission error of data packet caused by channel fading are considered in order to achieve the best cooperative gain in the poor quality channel. In the relay selection process, potential relay nodes satisfying corresponding requirement can compete to sever as final relay node by means of priority selection and collision resolution process. Finally, simulation results show that the proposed protocol outperforms other protocol in terms of packet error rate and the saturation throughput.

  4. Degrees of Freedom of Multi-Source Relay Networks

    CERN Document Server

    Jeon, Sang-Woon; Jafar, Syed A

    2009-01-01

    We study a multi-source Gaussian relay network consisting of $K$ source--destination pairs having $K$ unicast sessions. We assume $M$ layers of relays between the sources and the destinations. We find achievable degrees of freedom of the network. Our schemes are based on interference alignment at the transmitters and symbol extension and opportunistic interference cancellation at the relays. For $K$-$L$-$K$ networks, i.e., 2-hop network with $L$ relays, we show $\\min\\{K,K/2+L/(2(K-1))\\}$ degrees of freedom are achievable. For $K$-hop networks with $K$ relays in each layer, we show the full $K$ degrees of freedom are achievable provided that $K$ is even and the channel distribution satisfies a certain symmetry.

  5. Coarse Network Coding: A Simple Relay Strategy to Resolve Interference

    CERN Document Server

    Razaghi, Peyman

    2010-01-01

    Reminiscent of the parity function in network coding for the butterfly network, it is shown that forwarding an even/odd indicator bit for a scalar quantization of a relay observation recovers 1 bit of information at the two destinations in a noiseless interference channel where interference is treated as noise. Based on this observation, a coding strategy is proposed to improve the rate of both users at the same time using a relay node in an interference channel. In this strategy, the relay observes a linear combination of the two source signals, and broadcasts a common message to the two destinations over a shared out-of-band link of rate R0 bits per channel use. The relay message consists of the bin index of a structured binning scheme obtained from a 2^R0-way partition of the squared lattice in the complex plane. We show that such scalar quantization-binning relay strategy asymptotically achieves the cut-set bound in an interference channel with a common out-of-band relay link of limited rate, improving th...

  6. Distributed Space Time Coding for Wireless Two-way Relaying

    CERN Document Server

    Muralidharan, Vijayvaradharaj T

    2012-01-01

    We consider the wireless two-way relay channel, in which two-way data transfer takes place between the end nodes with the help of a relay. For the Denoise-And-Forward (DNF) protocol, it was shown by Koike-Akino et. al. that adaptively changing the network coding map used at the relay greatly reduces the impact of Multiple Access interference at the relay. The harmful effect of the deep channel fade conditions can be effectively mitigated by proper choice of these network coding maps at the relay. Alternatively, in this paper we propose a Distributed Space Time Coding (DSTC) scheme, which effectively removes most of the deep fade channel conditions at the transmitting nodes itself without any CSIT and without any need to adaptively change the network coding map used at the relay. It is shown that the deep fades occur when the channel fade coefficient vector falls in a finite number of vector subspaces of $\\mathbb{C}^2$, which are referred to as the singular fade subspaces. DSTC design criterion referred to as ...

  7. Joint design of network-channel coding on relay node%一种中继节点上的网络-信道编码联合设计方案

    Institute of Scientific and Technical Information of China (English)

    纪鹏宇; 谢红; 赵蕴龙

    2012-01-01

    Network coding become the research focus of widespread concerning. Because of it can improve the network throughput, has better robustness, and effectively improve the efficiency of forwarding by relay nodes. Therefore, in the relay node, a joint design of network-channel coding can further improve BER performance of the system BER performance. Based on the research of Razaghi, who designed the two kinds of Bilayer-LDPC codes (divided into Expurgated and Lengthened type), proposes a kind of network-channel coding called NBL-LDPC code (Network Bilayer Lengthened LDPC, referred to as the NBL-LDPC). Meanwhile, This paper shows the process of encoding and decoding, and for this code, the Gaussian density evolution algorithm has to be improved, so the BER performance can be calculated and simulated. Simulation results show that the proposed coding scheme performs better than the NBE-LDPC code(Network Bilayer Expurgated LDPC, referred to as NBE-LDPC).%网络编码技术由于其能提高网络吞吐量、具有较好的鲁棒性、能有效提高中继节点转发效率等优点成为目前广泛关注的研究热点.在中继节点上,采用网络-信道编码联合设计方案能进一步提高系统的误码性能.基于Razaghi等人研究的两种双层LDPC码(Bilayer LDPC,分为删余型和延长型),设计了一种在中继节点上联合设计的网络双层LDPC延长码(Network Bilayer Lengthened LDPC,NBL-LDPC).给出了此码的编译码过程,并针对此码,对高斯密度进化算法进行改进,计算误码率并完成误码性能仿真.仿真结果表明,所提出的编码方案性能要优于利用双层LDPC删余码设计的网络双层LDPC删余码(Network Bilayer Expurgated LDPC,NBE-LDPC).

  8. Opportunistic Cognitive Relaying: A Win-Win Spectrum Sharing Scheme

    Directory of Open Access Journals (Sweden)

    Luo Haiyan

    2010-01-01

    Full Text Available A cost-effective spectrum sharing architecture is proposed to enable the legacy noncognitive secondary system to coexist with the primary system. Specifically, we suggest to install a few intermediate nodes, namely, the cognitive relays, to conduct the spectrum sensing and coordinate the spectrum access. To achieve the goal of win-win between primary and secondary systems, the cognitive relay may act as a cooperator for both of them, and an Opportunistic Cognitive Relaying (OCR scheme is specially devised. In this scheme, the cognitive relay opportunistically switches among three different working modes, that is, Relay for Primary Link (RPL, Relay for Secondary Link (RSL, or Relay for Neither of the Links (RNL, respectively, based on the channel-dependent observation of both systems. In addition, the transmit power for cognitive relay and secondary transmitter in each mode are optimally determined by maximizing the transmission rate of secondary system while keeping or even reducing the outage probability of primary system. Simulation results validate the efficiency of the proposed spectrum sharing scheme.

  9. Cooperative Transmission for a Vector Gaussian Parallel Relay Network

    CERN Document Server

    Kim, Muryong

    2009-01-01

    In this paper, we consider a parallel relay network where two relays cooperatively help a source transmit to a destination. We assume the source and the destination nodes are equipped with multiple antennas. Three basic schemes and their achievable rates are studied: Decode-and-Forward (DF), Amplify-and-Forward (AF), and Compress-and-Forward (CF). For the DF scheme, the source transmits two private signals, one for each relay, where dirty paper coding (DPC) is used between the two private streams, and a common signal for both relays. The relays make efficient use of the common information to introduce a proper amount of correlation in the transmission to the destination. We show that the DF scheme achieves the capacity under certain conditions. We also show that the CF scheme is asymptotically optimal in the high relay power limit, regardless of channel ranks. It turns out that the AF scheme also achieves the asymptotic optimality but only when the relays-to-destination channel is full rank. The relative adva...

  10. Analysis of a Mixed Strategy for Multiple Relay Networks

    CERN Document Server

    Rost, P

    2007-01-01

    In their landmark paper Cover and El Gamal proposed different coding strategies for the relay channel with a single relay supporting a communication pair. These strategies are the decode-and-forward and compress-and-forward approach, as well as a general lower bound on the capacity of a relay network which relies on the mixed application of the previous two strategies. So far, only parts of their work - the decode-and-forward and the compress-and-forward strategy - have been applied to networks with multiple relays. This paper derives a mixed strategy for multiple relay networks using a combined approach of partial decode-and-forward with N +1 levels and the ideas of successive refinement with different side information at the receivers. After describing the protocol structure, we present the achievable rates for the discrete memoryless relay channel as well as Gaussian multiple relay networks. Using these results we compare the mixed strategy with some special cases, e. g., multilevel decode-and-forward, dis...

  11. CERN Relay Race

    CERN Multimedia

    2011-01-01

    The CERN relay race will take place around the Meyrin site on Thursday 19 May starting at 12-15. If possible, please avoid driving on the site during this 20-minute period. If you do meet runners while driving your car, please STOP until they have all passed. Thank you for your cooperation. Details of the course and of how to register your team for the relay race can be found here. Some advice for all runners from the Medical Service can also be found here.   

  12. Unified Analysis of SWIPT Relay Networks with Noncoherent Modulation

    OpenAIRE

    Mohjazi, Lina; Muhaidat, Sami; Dianati, Mehrdad; Al-Qutayri, Mahmoud

    2017-01-01

    Simultaneous wireless information and power transfer (SWIPT) relay networks represent a paradigm shift in the development of wireless networks, enabling simultaneous radio frequency (RF) energy harvesting (EH) and information processing. Different from conventional SWIPT relaying schemes, which typically assume the availability of perfect channel state information (CSI), here we consider the application of noncoherent modulation in order to avoid the need of instantaneous CSI estimation/track...

  13. 2005 CERN Relay Race

    CERN Multimedia

    Patrice Loiez

    2005-01-01

    The CERN Relay Race takes place each year in May and sees participants from all areas of the CERN staff. The winners in 2005 were The Shabbys with Los Latinos Volantes in second and Charmilles Technologies a close third. To add a touch of colour and levity, the CERN Jazz Club provided music at the finishing line.

  14. CERN Relay Race

    CERN Document Server

    2009-01-01

    The CERN relay race, now in its 39th year, is already a well-known tradition, but this year the organizers say the event will have even more of a festival feeling. Just off the starting line of the CERN relay race.For the past few years, spectators and runners at the CERN relay race have been able to enjoy a beer while listening to music from the CERN music and jazz clubs. But this year the organizers are aiming for "even more of a festival atmosphere". As David Nisbet, President of the CERN running club and organizer of the relay race, says: "Work is not just about getting your head down and doing the theory, it’s also about enjoying the company of your colleagues." This year, on top of music from the Santa Luis Band and the Canettes Blues Band, there will be demonstrations from the Aikido and softball clubs, a stretching session by the Fitness club, as well as various stalls and of course, the well-earned beer from AGLUP, the B...

  15. On the Outage Performance of Full-Duplex Selective Decode-and-Forward Relaying

    KAUST Repository

    Khafagy, Mohammad Galal

    2013-02-25

    We evaluate the outage performance in a three-terminal full-duplex relay channel that adopts a selective decode-and-forward protocol, taking relay self-interference into account. Previous work focused on coverage extension scenarios where direct source-destination transmissions are neglected or considered as interference. In this work, we account for the relay self-interference, and exploit the cooperative diversity offered by the independently fading source/relay message replicas that arrive at the destination. We present an approximate, yet accurate, closed-form expression for the end-to-end outage probability that captures their joint effect. With the derived expression in hand, we propose a relay transmit power optimization scheme that only requires the relay knowledge of channel statistics. Finally, we corroborate our analysis with simulations.

  16. Relay Support for the Mars Science Laboratory Mission

    Science.gov (United States)

    Edwards, Charles D. Jr,; Bell, David J.; Gladden, Roy E.; Ilott, Peter A.; Jedrey, Thomas C.; Johnston, M. Daniel; Maxwell, Jennifer L.; Mendoza, Ricardo; McSmith, Gaylon W.; Potts, Christopher L.; Schratz, Brian C.; Shihabi, Mazen M.; Srinivasan, Jeffrey M.; Varghese, Phillip; Sanders, Stephen S.; Denis, Michel

    2013-01-01

    The Mars Science Laboratory (MSL) mission landed the Curiosity Rover on the surface of Mars on August 6, 2012, beginning a one-Martian-year primary science mission. An international network of Mars relay orbiters, including NASA's 2001 Mars Odyssey Orbiter (ODY) and Mars Reconnaissance Orbiter (MRO), and ESA's Mars Express Orbiter (MEX), were positioned to provide critical event coverage of MSL's Entry, Descent, and Landing (EDL). The EDL communication plan took advantage of unique and complementary capabilities of each orbiter to provide robust information capture during this critical event while also providing low-latency information during the landing. Once on the surface, ODY and MRO have provided effectively all of Curiosity's data return from the Martian surface. The link from Curiosity to MRO incorporates a number of new features enabled by the Electra and Electra-Lite software-defined radios on MRO and Curiosity, respectively. Specifically, the Curiosity-MRO link has for the first time on Mars relay links utilized frequency-agile operations, data rates up to 2.048 Mb/s, suppressed carrier modulation, and a new Adaptive Data Rate algorithm in which the return link data rate is optimally varied throughout the relay pass based on the actual observed link channel characteristics. In addition to the baseline surface relay support by ODY and MRO, the MEX relay service has been verified in several successful surface relay passes, and MEX now stands ready to provide backup relay support should NASA's orbiters become unavailable for some period of time.

  17. Research on Microelectromagnetic Relays

    Institute of Scientific and Technical Information of China (English)

    LI De-sheng; LIU Ben-dong

    2006-01-01

    A new microelectromagnetic relay is presented and fabricated based on micromachining technology,aiming at the miniaturization and high manufacturing efficiency of electromagnetic relays.This microrelay is composed of a lower magnetic circuit,a planar exciting coil,and an upper magnetic armature.A complete magnetic circuit is composed.and the"ON"and"OFF"states are controlled by the current of the exciting coil.The dimension Ofthis microrelay i 5 mm×5 mm×0.4 mm.The fabrication process mainly includes lithography,sputtering,electroplating,etching,sacrifice-layer technology,etc.Electromagnetic force is calculated theoretically.The calculation results are used for the optimization design of the armature and the number of tums of the exciting coil.A microelectromagnetic relay is fabricated and the initial test results are given.The resistance of the exciting coil is about 300 Ω.The switch-on state resistance is about 1.7 Ω at an exciting current of about 50 mA.

  18. The Physical Layer Security Experiments of Cooperative Communication System with Different Relay Behaviors.

    Science.gov (United States)

    Su, Yishan; Han, Guangyao; Fu, Xiaomei; Xu, Naishen; Jin, Zhigang

    2017-04-06

    Physical layer security is an attractive security mechanism, which exploits the randomness characteristics of wireless transmission channel to achieve security. However, it is hampered by the limitation of the channel condition that the main channel must be better than the eavesdropper channel. To alleviate the limitation, cooperative communication is introduced. Few studies have investigated the physical layer security of the relay transmission model. In this paper, we performed some experiments to evaluate the physical layer security of a cooperative communication system, with a relay operating in decode-and-forward (DF) cooperative mode, selfish and malicious behavior in real non-ideal transmission environment. Security performance is evaluated in terms of the probability of non-zero secrecy capacity. Experiments showed some different results compared to theoretical simulation: (1) to achieve the maximum secrecy capacity, the optimal relay power according to the experiments result is larger than that of ideal theoretical results under both cooperative and selfish behavior relay; (2) the relay in malicious behavior who forwards noise to deteriorate the main channel may deteriorate the eavesdropper channel more seriously than the main channel; (3) the optimal relay positions under cooperative and selfish behavior relay cases are both located near the destination because of non-ideal transmission.

  19. Error-rate performance analysis of opportunistic regenerative relaying

    KAUST Repository

    Tourki, Kamel

    2011-09-01

    In this paper, we investigate an opportunistic relaying scheme where the selected relay assists the source-destination (direct) communication. In our study, we consider a regenerative opportunistic relaying scheme in which the direct path can be considered unusable, and takes into account the effect of the possible erroneously detected and transmitted data at the best relay. We first derive the exact statistics of each hop, in terms of probability density function (PDF). Then, the PDFs are used to determine accurate closed form expressions for end-to-end bit-error rate (BER) of binary phase-shift keying (BPSK) modulation where the detector may use maximum ration combining (MRC) or selection combining (SC). Finally, we validate our analysis by showing that performance simulation results coincide with our analytical results over linear network (LN) architecture and considering Rayleigh fading channels. © 2011 IEEE.

  20. New results on performance analysis of opportunistic regenerative relaying

    KAUST Repository

    Tourki, Kamel

    2013-12-01

    In this paper, we investigate an opportunistic relaying scheme where the selected relay assists the source-destination (direct) communication. In our study, we consider a regenerative opportunistic relaying scheme in which the direct path may be unusable, and takes into account the effect of the possible erroneously detected and transmitted data at the selected relay. We first derive the signal-to-noise (SNR) statistics for each hop, which are used to determine accurate closed form expressions for end-to-end bit-error rate (BER) of binary phase-shift keying (BPSK) modulation and end-to-end outage probability for a transmission rate R over Rayleigh fading channels. Furthermore, we evaluate the asymptotical performance and deduce the diversity order. Finally, we validate our analysis by showing that performance simulation results coincide with our analytical results over linear network architecture. © 2013 Elsevier B.V.

  1. Bandwidth-Efficient Cooperative Relaying Schemes with Multiantenna Relay

    Directory of Open Access Journals (Sweden)

    Tho Le-Ngoc

    2008-05-01

    Full Text Available We propose coded cooperative relaying schemes in which all successfully decoded signals from multiple sources are forwarded simultaneously by a multiantenna relay to a common multiantenna destination to increase bandwidth efficiency. These schemes facilitate various retransmission strategies at relay and single-user and multiuser iterative decoding techniques at destination, suitable for trade-offs between performance, latency, and complexity. Simulation results show that the proposed schemes significantly outperform direct transmission under the same transmit power and bandwidth efficiency.

  2. Laser Communications Relay Demonstration Project

    Data.gov (United States)

    National Aeronautics and Space Administration — The Laser Communications Relay Demonstration project will advance optical communications technology, expanding industry’s capability to produce competitive,...

  3. Diversity-Multiplexing Trade-off for Coordinated Direct and Relay Schemes

    DEFF Research Database (Denmark)

    Thai, Chan; Popovski, Petar; De Carvalho, Elisabeth

    2013-01-01

    Direct/Relay (CDR) schemes, which involve two flows, of a direct and a relayed user. In this paper we characterize a CDR scheme by deriving/bounding the Diversity-Multiplexing Trade-off (DMT) function. Two cases are considered. In the first case a transmitter knows the Channel State Information (CSI...

  4. Proportional fair scheduling with superposition coding in a cellular cooperative relay system

    DEFF Research Database (Denmark)

    Kaneko, Megumi; Hayashi, Kazunori; Popovski, Petar

    2013-01-01

    Many works have tackled on the problem of throughput and fairness optimization in cellular cooperative relaying systems. Considering firstly a two-user relay broadcast channel, we design a scheme based on superposition coding (SC) which maximizes the achievable sum-rate under a proportional fairn...

  5. Delayed Random Relays

    CERN Document Server

    Ohira, Toru

    2016-01-01

    We present here a system with collection of random walks relaying a signal in one dimension with a presence of a delay. We are interested in the time for a signal to travel from one end (start) to the other end (finish) of the lined group of random walkers. It is found that there is an optimal number of walkers for the signal to travel fastest if the delay is present. We discuss implications of this model and associated behaviors to physical and biological systems.

  6. Toward distributed relay selection for opportunistic amplify-and-forward transmission

    KAUST Repository

    Tourki, Kamel

    2011-05-01

    Opportunistic relaying in cooperative communication depends on careful relay selection. However the traditional centralized method used for opportunistic Amplify-and-Forward (OAF) protocols requires precise measurements of channel state information (CSI) at the destination (CSI-OAF). In this paper, we propose a distributed relay selection framework for opportunistic AF (D-OAF) cooperative communications and offer an accurate performance analysis based on exact statistics of the local signalto- noise ratios of the best relay. Furthermore, we validate our analysis by showing that performance simulation results coincide with our analytical results over different network architectures, and we compare our new results with their CSI-based counterparts. © 2011 IEEE.

  7. Energy-Efficient Relay Selection Scheme for Physical Layer Security in Cognitive Radio Networks

    Directory of Open Access Journals (Sweden)

    Li Jiang

    2015-01-01

    selection and dynamic power allocation in order to maximize SC and to minimize energy consumption. Moreover, we consider finite-state Markov channels and residual relay energy in the relay selection and power allocation process. Specifically, the formulation of the proposed relay selection and power allocation scheme is based on the restless bandit problem, which is solved by the primal-dual index heuristic algorithm. Additionally, the obtained optimal relay selection policy has an indexability property that dramatically reduces the computational complexity. Numerical results are presented to show that our proposed scheme has the maximum SC and minimum energy consumption compared to the existing ones.

  8. Joint Source and Relay Precoding Designs for MIMO Two-Way Relaying Based on MSE Criterion

    CERN Document Server

    Wang, Rui

    2011-01-01

    Properly designed precoders can significantly improve the spectral efficiency of multiple-input multiple-output (MIMO) relay systems. In this paper, we investigate joint source and relay precoding design based on the mean-square-error (MSE) criterion in MIMO two-way relay systems, where two multi-antenna source nodes exchange information via a multi-antenna amplify-and-forward relay node. This problem is non-convex and its optimal solution remains unsolved. Aiming to find an efficient way to solve the problem, we first decouple the primal problem into three tractable sub-problems, and then propose an iterative precoding design algorithm based on alternating optimization. The solution to each sub-problem is optimal and unique, thus the convergence of the iterative algorithm is guaranteed. Secondly, we propose a structured precoding design to lower the computational complexity. The proposed precoding structure is able to parallelize the channels in the multiple access (MAC) phase and broadcast (BC) phase. It th...

  9. CERN Relay Race

    CERN Multimedia

    Running Club

    2010-01-01

    This year’s CERN Relay Race will take place around the Meyrin site on Thursday 20th May at 12h00. This annual event is for teams of 6 runners covering distances of 1000m, 800m, 800m, 500m, 500m and 300m respectively. Teams may be entered in the Seniors, Veterans, Ladies, Mixed or Open categories. The registration fee is 10 CHF per runner, and each runner receives a souvenir prize. As usual, there will be a programme of entertainments from 12h in the arrival area, in front of the Restaurant no. 1. Drinks, food, CERN club information and music will be available for the pleasure of both runners and spectators. The race starts at 12h15, with results and prize giving at 13:15.   For details of the race, and of how to sign up a team, please visit: https://espace.cern.ch/Running-Club/CERN-Relay The event is organised by the CERN Running Club with the support of the CERN Staff Association.  

  10. 47th Relay Race!

    CERN Multimedia

    Staff Association

    2017-01-01

    On Thursday June 1st at 12.15, Fabiola Gianotti, our Director-General, will fire the starting shot for the 47th Relay Race. This Race is above all a festive CERN event, open for runners and walkers, as well as the people cheering them on throughout the race, and those who wish to participate in the various activities organised between 11.30 and 14.30 out on the lawn in front of Restaurant 1. In order to make this sports event accessible for everyone, our Director-General will allow for flexible lunch hours on the day, applicable for all the members of personnel. An alert for the closure of roads will be send out on the day of the event. The Staff Association and the CERN Running Club thank you in advance for your participation and your continued support throughout the years. This year the CERN Running Club has announced the participation of locally and internationally renowned runners, no less! A bit over a week from the Relay Race of 1st June, the number of teams is going up nicely (already almost 40). Am...

  11. Distributed beamforming designs to improve physical layer security in wireless relay networks

    Science.gov (United States)

    Qian, Mujun; Liu, Chen; Fu, Youhua

    2014-12-01

    This paper investigates security-oriented beamforming designs in a relay network composed of a source-destination pair, multiple relays, and a passive eavesdropper. Unlike most of the earlier works, we assume that only statistical information of the relay-eavesdropper channels is known to the relays. We propose beamforming solutions for amplify-and-forward (AF) and decode-and-forward (DF) relay networks to improve secrecy capacity. In an AF network, the beamforming design is obtained by approximating a product of two correlated Rayleigh quotients to a single Rayleigh quotient using the Taylor series expansion. Our study reveals that in an AF network, the secrecy capacity does not always grow as the eavesdropper moves away from the relays or as total relay transmit power increases. Moreover, if the destination is nearer to the relays than the eavesdropper is, a suboptimal power is derived in closed form through monotonicity analysis of secrecy capacity. While in a DF network, secrecy capacity is a single Rayleigh quotient problem which can be easily solved. We also found that if the relay-eavesdropper distances are about the same, it is unnecessary to consider the eavesdropper in a DF network. Numerical results show that for either AF or DF relaying protocol, the proposed beamforming scheme provides higher secrecy capacity than traditional approaches.

  12. The Wiretap Channel with Feedback: Encryption over the Channel

    CERN Document Server

    Lai, Lifeng; Poor, H Vincent

    2007-01-01

    In this work, the critical role of noisy feedback in enhancing the secrecy capacity of the wiretap channel is established. Unlike previous works, where a noiseless public discussion channel is used for feedback, the feed-forward and feedback signals share the same noisy channel in the present model. Quite interestingly, this noisy feedback model is shown to be more advantageous in the current setting. More specifically, the discrete memoryless modulo-additive channel with a full-duplex destination node is considered first, and it is shown that the judicious use of feedback increases the perfect secrecy capacity to the capacity of the source-destination channel in the absence of the wiretapper. In the achievability scheme, the feedback signal corresponds to a private key, known only to the destination. In the half-duplex scheme, a novel feedback technique that always achieves a positive perfect secrecy rate (even when the source-wiretapper channel is less noisy than the source-destination channel) is proposed....

  13. Novel half-coherent receivers for amplify-and-forward relaying

    KAUST Repository

    Khan, Fahd Ahmed

    2012-06-01

    Consider a system in which the signal is transmitted from the source to the destination via an amplify-and-forward relay. For such a system, we derive in this paper, novel receivers that have complete knowledge of either the source-relay link or the relay-destination link. These receivers are termed as, \\'half-coherent receivers\\' as they have channel-state-information (CSI) of only one of two links. These receivers can be very useful in a system in which only the relay can afford high complexity by having a channel estimation module and the destination is unable to support channel estimation or a system in which only the destination can afford higher complexity and includes the channel estimation module. The analytical bit-error-rate (BER) performances of the proposed receivers are derived for Rician fading. Numerical results show considerable performance gains of the new receivers, especially at low signal-to-noise ratio. © 2012 IEEE.

  14. CERN Relay Race

    CERN Document Server

    2005-01-01

    The CERN Relay Race will take place around the Meyrin site on Wednesday 18 May between 12.15 and 12.35. This year, weather permitting, there will be some new attractions in the start/finish area on the field behind the Main Building. You will be able to: listen to music played by the CERN Jazz Club; buy drinks at the bar organised by the CERN Running Club; buy lunch served directly on the terrace by the restaurant Novae. ATTENTION: concerning traffic, the recommendations are the same as always: If possible, please avoid driving on the site during this 20 minute period. If you do meet runners in your car, please STOP until they all have passed. Thank you for your understanding.

  15. Covert Channels within IRC

    Science.gov (United States)

    2011-03-24

    Communications ....................................... 2 1.3 Steganography and Covert Channels .......................................................... 3...Internet Relay Chat ..................................................................................... 7 2.2 Steganography ...13 2.2.2 Encrypted Steganographic Systems .............................................. 15 2.2.3 Text-Based Steganography

  16. Outage Probability and Power Allocation for Two-Way DF Relay Networks with Relay Selection

    Directory of Open Access Journals (Sweden)

    Z. Fan

    2012-09-01

    Full Text Available In this paper, we investigate the outage probability and power allocation for the two-way decode-and-forward (DF relay networks with relay selection.~Specially, we consider independent but not necessarily identical distributed Rayleigh fading channels. Firstly, we derive an exact closed form outage probability expression. To shed light on the relation between the outage probability and the power allocation factor, an upper bound for the outage probability is derived, too. We then propose a power allocation scheme in the sense of minimizing this upper bound. Monte Carlo simulations are conducted to show that the derived outage probability expression excellently matches simulation results, and our proposed power allocation scheme performs effectively.

  17. Relay selection in underlay cognitive networks with fixed transmission power nodes

    KAUST Repository

    Hussain, Syed Imtiaz

    2013-07-31

    Underlay cognitive networks operate simultaneously with primary networks satisfying stringent interference constraints, which reduces their transmission power and coverage area. To reach remote destinations, secondary sources use relaying techniques. Selecting the best relay among the available ones is a well known technique. Recently, selective cooperation is investigated in cognitive networks where the secondary nodes can adapt their transmission power to always satisfy the interference threshold. In this paper, we investigate a situation where the secondary nodes have a fixed transmission power and may violate the interference threshold. We present two relay selection schemes; the first one excludes the relays not satisfying the interference constraint and then picks up a relay from the remaining ones that can provide the maximum signal-to-noise ratio (SNR). The other scheme uses a quotient of the relay link SNR and the interference from the relay to the primary user and optimizes it to maximise the relay link SNR. We derive closed form expressions for outage probability, bit error rate, channel capacity and diversity of the system for both schemes by using tight approximations. We also study mutual effects of interference. Simulation results confirm the analytical results and reveal that the relay selection is feasible at low SNRs. Copyright © 2013 John Wiley & Sons, Ltd.

  18. Outage analysis for underlay relay-assisted cognitive networks

    KAUST Repository

    Tourki, Kamel

    2012-12-01

    Cooperative relay technology was recently introduced into cognitive radio networks in order to enhance network capacity, scalability, and reliability of end-to-end communication. In this paper, we investigate an underlay cognitive network where the quality of service of the secondary link is maintained by triggering an opportunistic regenerative relaying once it falls under an unacceptable level. We first provide the exact cumulative density function (CDF) of received signal-to-noise (SNR) over each hop with co-located relays. Then, the CDFs are used to determine very accurate closed-form expression for the outage probability for a transmission rate R. We validate our analysis by showing that simulation results coincide with our analytical results in Rayleigh fading channels. © 2012 IEEE.

  19. Adaptive FEC coding and cooperative relayed wireless image transmission

    Directory of Open Access Journals (Sweden)

    Hansong Xu

    2015-08-01

    Full Text Available High quality image transmission through smart devices requires high transmission rate, throughput and low Bit Error Rate (BER. At the same time, energy efficiency is always the top issue for the battery-based smart devices such as smart phone, tablets, etc. In this paper, an adaptive Forward Error Correction (FEC coding and cooperative relayed image transmission system is proposed, through which both transmission quality and energy efficiency could be promised under complex mobile communication channel environment. There are four steps in the proposed scheme: (1 Discrete Wavelet Transform (DWT and wavelet based Decomposition, (2 Pixel-Position (PP information and Pixel-Value (PV information split based unequal image resource allocation, (3 transmission through channel fading and AWGN communication environment, (4 multiple-relays and adaptive channel coding. Comparing to traditional methods, our proposed method is more practical to transmit high quality images through battery-limited smart phone platforms.

  20. The 2009 Relay Race

    CERN Multimedia

    2009-01-01

    The 2009 CERN Relay Race was as popular as ever, with a record number of 88 teams competing. var flash_video_player=get_video_player_path(); insert_player_for_external('Video/Public/Movies/2009/CERN-MOVIE-2009-048/CERN-MOVIE-2009-048-0753-kbps-480x360-25-fps-audio-64-kbps-44-kHz-stereo', 'mms://mediastream.cern.ch/MediaArchive/Video/Public/Movies/2009/CERN-MOVIE-2009-048/CERN-MOVIE-2009-048-Multirate-200-to-753-kbps-480x360.wmv', 'false', 288, 216, 'https://mediastream.cern.ch/MediaArchive/Video/Public/Movies/2009/CERN-MOVIE-2009-048/CERN-MOVIE-2009-048-posterframe-480x360-at-10-percent.jpg', '1178303', true, 'Video/Public/Movies/2009/CERN-MOVIE-2009-048/CERN-MOVIE-2009-048-0600-kbps-maxH-360-25-fps-audio-128-kbps-48-kHz-stereo.mp4'); Even the rain didn’t dampen the spirits, and it still managed to capture the ‘festival feeling’ with live music, beer and stalls from various CERN clubs set up outside Restaurant 1. The Powercuts on the podium after win...

  1. The power relay satellite

    Science.gov (United States)

    Glaser, Peter E.

    The availability and use of renewable energy sources compatible with reducing risks to the global environment are key to sustainable development. Large-scale, renewable energy resources at undeveloped or underutilized sites are potentially available on several continents. The Power Relay Satellite (PRS) concept has the potential to access these remote energy resources by coupling primary electricity generation from terrestrial transmission lines. A global PRS network can be envisioned to provide a high degree of flexibility for supplying energy demands worldwide with wireless power transmitted from sites on Earth to geosynchronous orbit and then reflected to receivers interfacing with terrestrial power transmision networks. Past developments in wireless power transmission (WPT) are reviewed and recent successful results are noted. The origins of the PRS concept, and a possible configuration are discussed, principles of WPT at microwave frequencies, functional requirements, and system design contraints are outlined, and space transportation concepts presented. PRS assessments including applicable technologies, economic projections, and societal issues are highlighted. It is concluded that the PRS provides a promising option to access renewable resources at great distances from major markets, and represents an important stage in the future development in the future of solar power satellites.

  2. The Approximate Capacity of the Gaussian N-Relay Diamond Network

    CERN Document Server

    Niesen, Urs

    2010-01-01

    We consider the Gaussian "diamond" or parallel relay network, in which a source node transmits a message to a destination node with the help of N relays. Even for the symmetric setting, in which the channel gains to the relays are identical and the channel gains from the relays are identical, the capacity of this channel is unknown in general. The best known capacity approximation is up to an additive gap of order N bits and up to a multiplicative gap of order N^2, with both gaps independent of the channel gains. In this paper, we approximate the capacity of the symmetric Gaussian N-relay diamond network up to an additive gap of 1.8 bits and up to a multiplicative gap of 14. Both gaps are independent of the channel gains, and, unlike the best previously known result, are also independent of the number of relays N in the network. Achievability is based on bursty amplify-and-forward, showing that this simple scheme is uniformly approximately optimal, both in the low-rate as well as high-rate regimes. The upper ...

  3. Opportunistic Wireless Relay Networks: Diversity-Multiplexing Tradeoff

    CERN Document Server

    Abouelseoud, Mohamed

    2011-01-01

    Opportunistic analysis has traditionally relied on independence assumptions that break down in many interesting and useful network topologies. This paper develops techniques that expand opportunistic analysis to a broader class of networks, proposes new opportunistic methods for several network geometries, and analyzes them in the high-SNR regime. For each of the geometries studied in the paper, we analyze the opportunistic DMT of several relay protocols, including amplify-and-forward, decode-and-forward, compress-and-forward, non-orthogonal amplify-forward, and dynamic decode-forward. Among the highlights of the results: in a variety of multi-user single-relay networks, simple selection strategies are developed and shown to be DMT-optimal. It is shown that compress-forward relaying achieves the DMT upper bound in the opportunistic multiple-access relay channel as well as in the opportunistic nxn user network with relay. Other protocols, e.g. dynamic decode-forward, are shown to be near optimal in several cas...

  4. Cascaded Orthogonal Space-Time Block Codes for Wireless Multi-Hop Relay Networks

    CERN Document Server

    Vaze, Rahul

    2008-01-01

    Distributed space-time block coding is a diversity technique to mitigate the effects of fading in multi-hop wireless networks, where multiple relay stages are used by a source to communicate with its destination. This paper proposes a new distributed space-time block code called the cascaded orthogonal space-time block code (COSTBC) for the case where the source and destination are equipped with multiple antennas and each relay stage has one or more single antenna relays. Each relay stage is assumed to have receive channel state information (CSI) for all the channels from the source to itself, while the destination is assumed to have receive CSI for all the channels. To construct the COSTBC, multiple orthogonal space-time block codes are used in cascade by the source and each relay stage. In the COSTBC, each relay stage separates the constellation symbols of the orthogonal space-time block code sent by the preceding relay stage using its CSI, and then transmits another orthogonal space-time block code to the ...

  5. Error-rate performance analysis of cooperative OFDMA system with decode-and-forward relaying

    KAUST Repository

    Fareed, Muhammad Mehboob

    2014-06-01

    In this paper, we investigate the performance of a cooperative orthogonal frequency-division multiple-access (OFDMA) system with decode-and-forward (DaF) relaying. Specifically, we derive a closed-form approximate symbol-error-rate expression and analyze the achievable diversity orders. Depending on the relay location, a diversity order up to (LSkD + 1) + σ M m = 1 min(LSkRm + 1, LR mD + 1) is available, where M is the number of relays, and LS kD + 1, LSkRm + 1, and LRmD + 1 are the lengths of channel impulse responses of source-to-destination, source-to- mth relay, and mth relay-to-destination links, respectively. Monte Carlo simulation results are also presented to confirm the analytical findings. © 2013 IEEE.

  6. Fast Algorithm for Finding Unicast Capacity of Linear Deterministic Wireless Relay Networks

    CERN Document Server

    Shi, Cuizhu

    2009-01-01

    The deterministic channel model for wireless relay networks proposed by Avestimehr, Diggavi and Tse `07 has captured the broadcast and inference nature of wireless communications and has been widely used in approximating the capacity of wireless relay networks. The authors generalized the max-flow min-cut theorem to the linear deterministic wireless relay networks and characterized the unicast capacity of such deterministic network as the minimum rank of all the binary adjacency matrices describing source-destination cuts whose number grows exponentially with the size of the network. In this paper, we developed a fast algorithm for finding the unicast capacity of a linear deterministic wireless relay network by finding the maximum number of linearly independent paths using the idea of path augmentation. We developed a modified depth-first search algorithm tailored for the linear deterministic relay networks for finding linearly independent paths whose total number proved to equal the unicast capacity of the u...

  7. Novel coherent receivers for AF distributed STBC using disintegrated channel estimation

    KAUST Repository

    Khan, Fahd Ahmed

    2011-05-01

    For a single relay network, disintegrated channel estimation (DCE), where the source-relay channel is estimated at the relay and the relay-destination channel is estimated at the destination, gives better performance than the cascaded channel estimation. We derive novel receivers for the relay network with disintegrated channel estimation. The derived receivers do not require channel estimation at the destination, as they use the received pilot signals and the source-relay channel estimate for decoding directly. We also consider the effect of quantized source-relay channel estimate on the performance of the designed receivers. Simulation results show that a performance gain of up to 2.2 dB can be achieved by the new receivers, compared with the conventional mismatched coherent receiver with DCE. © 2011 IEEE.

  8. Approximately universal, explicit DMT-optimal constructions for the dynamic-decode-and-forward cooperative wireless relay network

    CERN Document Server

    Elia, Petros

    2007-01-01

    Explicit codes are constructed that achieve the diversity-multiplexing gain tradeoff of the cooperative-relay channel under the dynamic decode-and-forward protocol for any network size, for all delays and for all numbers of transmit and receive antennas at the relays.

  9. 中继网络中不准确信道状态信息下抗多窃听者的物理层安全方案%Physical Layer Security Scheme Resistant to Multi-eavesdroppers with Inaccurate Channel State Information in Relay Network

    Institute of Scientific and Technical Information of China (English)

    2015-01-01

    This paper investigates the relay transmission system in the presence of multiple collusion single-antenna eavesdroppers. A physical layer security scheme employing nullspace Artificial Noise (AN) and Amplify-and-Forward (AF) relay beamforming is designed. In the case that channel state information can not be accurately obtained, the weighted matrice of relay beamforming and the nullspace AN covariance are jointed optimized based on the Semi-Definite Programs (SDP), which can effectively reduce the amount of the information likely to be obtained by the multiple collusion eavesdroppers and significantly improve the security capacity of the system. It is an effective physical security transmission scheme with good robustness. Simulation results verify that the scheme has good performance.%该文研究存在多个相互勾结的单天线窃听者的多中继传输系统中,采用零空间人工噪声和放大转发的中继波束赋形的物理层安全传输方案。在中继—窃听端的信道状态信息不准确的情况下,基于半定规划理论,对中继的波束赋形加权矩阵和人工噪声协方差矩阵进行联合优化,有效减少相互勾结的多个窃听者所获得的信息量,显著提高系统保密容量,是一种具有良好鲁棒性的物理层安全传输方案。仿真结果显示方案具有良好的性能。

  10. On the performance of spectrum sharing systems with two-way relaying and multiuser diversity

    KAUST Repository

    Yang, Liang

    2012-08-01

    In this letter, we consider a spectrum sharing network with two-way relaying and multi-user diversity. More specifically, one secondary transmitter with the best channel quality is selected and splits its partial power to relay its received signals to the primary users by using the amplify-and-forward relaying protocol. We derive a tight approximation for the resulting outage probability. Based on this formula, the performance of the spectral sharing region and the cell coverage are analyzed. Numerical results are given to verify our analysis and are discussed to illustrate the advantages of our newly proposed scheme. © 1997-2012 IEEE.

  11. Relay-assisted Network Coding Multicast in the Presence of Neighbours

    DEFF Research Database (Denmark)

    Khamfroush, Hana; Roetter, Daniel Enrique Lucani; Pahlevani, Peyman;

    2015-01-01

    We study the problem of minimizing the cost of packet transmission from a source to two receivers with the help of a relay and using network coding in wireless mesh networks consisting of many active neighbours sharing the same channel. The cost minimization problem is modeled as a Markov Decision...... Process (MDP) and analysed under different network conditions. Two simple heuristics are proposed to estimate the appropriate time for activating the relay to provide close-to-optimal performance. Our numerical results show that a judicious network coding enabled relay can bring up to 2.9x gains...

  12. Airborne relay-based regional positioning system

    National Research Council Canada - National Science Library

    Lee, Kyuman; Noh, Hongjun; Lim, Jaesung

    2015-01-01

    .... To address these pseudolite system limitations, we propose an airborne relay-based regional positioning system that consists of a master station, reference stations, airborne relays and a user...

  13. Generalized routing protocols for multihop relay networks

    KAUST Repository

    Khan, Fahd Ahmed

    2011-07-01

    Performance of multihop cooperative networks depends on the routing protocols employed. In this paper we propose the last-n-hop selection protocol, the dual path protocol, the forward-backward last-n-hop selection protocol and the forward-backward dual path protocol for the routing of data through multihop relay networks. The average symbol error probability performance of the schemes is analysed by simulations. It is shown that close to optimal performance can be achieved by using the last-n-hop selection protocol and its forward-backward variant. Furthermore we also compute the complexity of the protocols in terms of number of channel state information required and the number of comparisons required for routing the signal through the network. © 2011 IEEE.

  14. Network Coded Cooperation Over Time-Varying Channels

    DEFF Research Database (Denmark)

    Khamfroush, Hana; Lucani Rötter, Daniel Enrique; Barros, joao

    2014-01-01

    In this paper, we investigate the optimal design of cooperative network-coded strategies for a three-node wireless network with time-varying, half-duplex erasure channels. To this end, we formulate the problem of minimizing the total cost of transmitting M packets from source to two receivers...... that are suitable for practical systems. We use two wireless channel models to analyse the performance of the proposed heuristics in practical wireless networks, namely, (a) an infrastructure-to-vehicle (I2V) communication in a highway scenario considering Rayleigh fading, and (b) real packet loss measurements...... for WiFi using Aalborg University’s Raspberry Pi testbed. We compare our results with random linear network coding (RLNC) broadcasting schemes showing that our heuristics can provide up to 2x gains in completion time and up to 4x gains in terms of reliably serviced data packets....

  15. Degrees of Freedom of Asymmetrical Multi-Way Relay Networks

    DEFF Research Database (Denmark)

    Sun, Fan; De Carvalho, Elisabeth

    2011-01-01

    In this paper, we introduce an asymmetrical multi-way relay channel where a base station conveys independent symbols to K different users while receiving independent symbols from the users. In this network, user i Shas Mi antennas (i ∈ [1, ..., K]), the base station has Σi=1K Mi antennas and the ...... with a proposed joint multiple access and broadcast precoding design using the signal space alignment concept....

  16. Handover Framework for Relay Enhanced LTE Networks

    DEFF Research Database (Denmark)

    Teyeb, Oumer Mohammed; Van Phan, Vinh; Raaf, Bernhard

    2009-01-01

    Relaying is one of the proposed technologies for future releases of UTRAN Long Term Evolution (LTE) networks. Introducing relaying is expected to increase the coverage and capacity of LTE networks. In order to enable relaying, the architecture, protocol and radio resource management procedures of...

  17. Semi-Blind System Identification in Wireless Relay Networks via Gaussian Process Iterated Conditioning on the Modes Estimation

    CERN Document Server

    Peters, Gareth W; Yuan, Jinhong; Collings, Ian

    2011-01-01

    This paper presents a flexible stochastic model developed for a class of cooperative wireless relay networks, in which the relay processing functionality is not known at the destination. The challenge is then to perform online system identification in this wireless relay network. To address this challenging problem we develop a novel class of statistical models and a computationally efficient algorithm that can be performed in real time processing, to undertake system identification for each relay channel in the presence of partial Channel State Information (CSI). We also develop a lower bound result and several sub-optimal though computationally efficient solutions to the identification problem, for comparison. We provide several examples for different non-linear relay functionalities.

  18. Energy-Efficient Relaying over Multiple Slots with Causal CSI

    CERN Document Server

    Ho, Chin Keong; Sun, Sumei

    2012-01-01

    In many communication scenarios, such as in cellular systems, the energy cost is substantial and should be conserved, yet there is a growing need to support many real-time applications that require timely data delivery. To model such a scenario, in this paper we consider the problem of minimizing the expected sum energy of delivering a message of a given size from a source to a destination subject to a deadline constraint. A relay is present and can assist after it has decoded the message. Causal channel state information (CSI), in the form of present and past SNRs of all links, is available for determining the optimal power allocation for the source and relay. We obtain the optimal power allocation policy by dynamic programming and explore its structure. We also obtain conditions for which the minimum expected sum energy is bounded given a general channel distribution. In particular, we show that for Rayleigh and Rician fading channels, relaying is necessary for the minimum expected sum energy to be bounded....

  19. Approximate Capacity of a Class of Multi-source Gaussian Relay Networks

    CERN Document Server

    Jeon, Sang-Woon; Jafar, Syed A

    2010-01-01

    We study a Gaussian relay network in which multiple source--destination (S--D) pairs communicate through relays without direct links between the sources and the destinations. We observe that the time-varying nature of wireless channels or fading can be used to mitigate the interference. The proposed block Markov amplify-and-forward relaying scheme exploits such channel variations and works for a wide class of channel distributions including Rayleigh fading. We completely characterize the degrees of freedom (DoF) region of the Gaussian relay network. Specifically, the DoF region of the $K$-user $M$-hop Gaussian relay network with $K_m$ nodes in the $m^{\\mbox{th}}$ layer is the set of all $(d_1,\\cdots,d_K)$ such that $d_i\\leq 1$ for all $i$ and $\\sum_{i=1}^K d_i\\leq \\min\\{K_1,\\cdots,K_{M+1}\\}$, where $d_i$ is the DoF of the $i^{\\mbox{th}}$ S--D pair and $K=K_1=K_{M+1}$ is the number of S--D pairs. We further characterize the DoF region of the Gaussian relay network with multi-antenna nodes and general message s...

  20. Sensitivity improvement of time overcurrent relays

    Energy Technology Data Exchange (ETDEWEB)

    Enriquez, Arturo Conde; Martinez, Ernesto Vazquez [Universidad Autonoma de Nuevo Leon, Facultad de Ingenieria Mecanica y Electrica, Apdo. Postal 114-F, Ciudad Universitaria, CP 66450, San Nicolas de los Garza, Nuevo Leon (Mexico)

    2007-02-15

    In this paper, we recommend a new adaptive function for time overcurrent relays. The purpose of the adaptation process is to improve the sensitivity of time overcurrent relays, which then operate with a dynamic pickup setting such as a load current. The results obtained from time overcurrent adaptive relays are collated, and the results from analysis of negative sequence relays and conventional time overcurrent relays are also presented. In this article, we describe the control logic structure of an adaptive pickup current and its performance under different operating states. (author)

  1. Outage Probability Analysis in Power-Beacon Assisted Energy Harvesting Cognitive Relay Wireless Networks

    Directory of Open Access Journals (Sweden)

    Ngoc Phuc Le

    2017-01-01

    Full Text Available We study the performance of the secondary relay system in a power-beacon (PB assisted energy harvesting cognitive relay wireless network. In our system model, a secondary source node and a relay node first harvest energy from distributed PBs. Then, the source node transmits its data to the destination node with the help of the relay node. Also, fading coefficients of the links from the PBs to the source node and relay node are assumed independent but not necessarily identically distributed (i.n.i.d Nakagami-m random variables. We derive exact expressions for the power outage probability and the channel outage probability. Based on that, we analyze the total outage probability of the secondary relay system. Asymptotic analysis is also performed, which provides insights into the system behavior. Moreover, we evaluate impacts of the primary network on the performance of the secondary network with respect to the tolerant interference threshold at the primary receiver as well as the interference introduced by the primary transmitter at the secondary source and relay nodes. Simulation results are provided to validate the analysis.

  2. Opportunistic Relaying for Space-Time Coded Cooperation with Multiple Antenna Terminals

    CERN Document Server

    Maham, Behrouz

    2011-01-01

    We consider a wireless relay network with multiple antenna terminals over Rayleigh fading channels, and apply distributed space-time coding (DSTC) in amplify-and-forward (A&F) mode. The A&F scheme is used in a way that each relay transmits a scaled version of the linear combination of the received symbols. It turns out that, combined with power allocation in the relays, A&F DSTC results in an opportunistic relaying scheme, in which only the best relay is selected to retransmit the source's space-time coded signal. Furthermore, assuming the knowledge of source-relay CSI at the source node, we design an efficient power allocation which outperforms uniform power allocation across the source antennas. Next, assuming M-PSK or M-QAM modulations, we analyze the performance of the proposed cooperative diversity transmission schemes in a wireless relay networks with the multiple-antenna source and destination. We derive the probability density function (PDF) of the received SNR at the destination. Then, th...

  3. Impact of Primary User Traffic on Adaptive Transmission for Cognitive Radio with Partial Relay Selection

    KAUST Repository

    Rao, Anlei

    2012-09-08

    In a cognitive relay system, the secondary user is permitted to transmit data via a relay when licensed frequency bands are detected to be free. Previous studies mainly focus on reducing or limiting the interference of the secondary transmission on the primary users. On the other hand, however, the primary user traffic will also affect the data transmission performance of the secondary users. In this paper, we investigate the impact of the primary user traffic on the bit error rate (BER) of the secondary transmission, when the secondary user adopts adaptive transmission with a relay partially selected. From the numerical results, we can see that the primary user traffic seriously degrades average BER. The worse-link partial selection can perform almost as well as the global selection when the channel conditions of the source-relay links and the relay-destination links differ a lot. In addition, although the relay selection improves the spectral efficiency of the secondary transmission, numerical results show that it only has slight impact on the overall average BER, so that the robustness of the system will not be affected by the relay selection.

  4. Digital transceiver design for two-way AF-MIMO relay systems with imperfect CSI

    Science.gov (United States)

    Hu, Chia-Chang; Chou, Yu-Fei; Chen, Kui-He

    2013-09-01

    In the paper, combined optimization of the terminal precoders/equalizers and single-relay precoder is proposed for an amplify-and-forward (AF) multiple-input multiple-output (MIMO) two-way single-relay system with correlated channel uncertainties. Both terminal transceivers and relay precoding matrix are designed based on the minimum mean square error (MMSE) criterion when terminals are unable to erase completely self-interference due to imperfect correlated channel state information (CSI). This robust joint optimization problem of beamforming and precoding matrices under power constraints belongs to neither concave nor convex so that a nonlinear matrix-form conjugate gradient (MCG) algorithm is applied to explore local optimal solutions. Simulation results show that the robust transceiver design is able to overcome effectively the loss of bit-error-rate (BER) due to inclusion of correlated channel uncertainties and residual self-interference.

  5. A spectrally efficient detect-and-forward scheme with two-tier adaptive cooperation

    KAUST Repository

    Benjillali, Mustapha

    2011-09-01

    We propose a simple relay-based adaptive cooperation scheme to improve the spectral efficiency of "Detect-and-Forward" (DetF) half-duplex relaying in fading channels. In a new common framework, we show that the proposed scheme offers considerable gainsin terms of the achievable information ratescompared to conventional DetF relaying schemes for both orthogonal and non-orthogonal source/relay transmissions. The analysis leads on to a general adaptive cooperation strategy based on the maximization of information rates at the destination which needs to observe only the average signal-to-noise ratios of the links. © 2006 IEEE.

  6. Relay-Assisted Primary and Secondary Transmissions in Cognitive Radio Networks

    KAUST Repository

    Shafie, Ahmed El

    2016-09-27

    We assume a set of cognitive relay nodes that assists both primary and secondary transmissions in a time-slotted cognitive radio networks. To regulate the channel access of the various nodes in the network, we propose an overlapped spectrum sensing strategy for channel sensing, where the secondary source node senses the channel from the beginning of the time slot and the cognitive relay nodes sense the channel for double the sensing time used by the secondary source node to detect the activities of both the primary and secondary source nodes. Hence, the secondary source node has an intrinsic priority over the relay nodes. The relay nodes help both the primary user and the secondary user to deliver their unsuccessfully decoded packets at their destinations. In a given time slot, the scheduled relay node for data transmission starts its transmission when both the primary and secondary users are sensed to be inactive (i.e. have no data to transmit). We propose two optimization-based formulations with quality-of-service (QoS) constraints involving average queueing delay and average service rate requirements. We investigate both cases of perfect and imperfect spectrum sensing. To further enhance the users\\' QoS requirements, we propose three packet decoding strategies at the relay nodes and compare their performance. We derive an upper bound on the secondary queue average service rate to determine which decoding strategy can achieve that bound. Our numerical results show the benefits of relaying and its ability to enhance the performance of both the primary and secondary users. Moreover, the performance of the proposed schemes is close to the derived upper bound.

  7. Resource Allocation and Relay Selection for Collaborative Communications

    CERN Document Server

    Astaneh, Saeed Akhavan

    2008-01-01

    We investigate the relay selection problem for a decode and forward collaborative network. Users are able to collaborate; decode messages of each other, re-encode and forward along with their own messages. We study the performance obtained from collaboration in terms of 1) increasing the achievable rate, 2) saving the transmit energy and 3) reducing the resource requirement (resource means time-bandwidth). To ensure fairness, we fix the transmit-energy-to-rate ratio among all users. We allocate resource optimally for the collaborative protocol (CP), and compare the result with the non-collaborative protocol (NCP) where users transmits their messages directly. The collaboration gain is a function of the channel gain and available energies and allows us 1) to decide to collaborate or not, 2) to select one relay among the possible relay users, and 3) to determine the involved gain and loss of possible collaboration. A considerable gain can be obtained if the direct source-destination channel gain is significantl...

  8. Outage analysis for underlay cognitive networks using incremental regenerative relaying

    KAUST Repository

    Tourki, Kamel

    2013-02-01

    Cooperative relay technology has recently been introduced into cognitive radio (CR) networks to enhance the network capacity, scalability, and reliability of end-to-end communication. In this paper, we investigate an underlay cognitive network where the quality of service (QoS) of the secondary link is maintained by triggering an opportunistic regenerative relaying once it falls under an unacceptable level. Analysis is conducted for two schemes, referred to as the channel-state information (CSI)-based and fault-tolerant schemes, respectively, where different amounts of CSI were considered. We first provide the exact cumulative distribution function (cdf) of the received signal-to-noise ratio (SNR) over each hop with colocated relays. Then, the cdf\\'s are used to determine a very accurate closed-form expression for the outage probability for a transmission rate $R$. In a high-SNR region, a floor of the secondary outage probability occurs, and we derive its corresponding expression. We validate our analysis by showing that the simulation results coincide with our analytical results in Rayleigh fading channels. © 1967-2012 IEEE.

  9. Physical Layer Authentication Enhancement Using Maximum SNR Ratio Based Cooperative AF Relaying

    Directory of Open Access Journals (Sweden)

    Jiazi Liu

    2017-01-01

    Full Text Available Physical layer authentication techniques developed in conventional macrocell wireless networks face challenges when applied in the future fifth-generation (5G wireless communications, due to the deployment of dense small cells in a hierarchical network architecture. In this paper, we propose a novel physical layer authentication scheme by exploiting the advantages of amplify-and-forward (AF cooperative relaying, which can increase the coverage and convergence of the heterogeneous networks. The essence of the proposed scheme is to select the best relay among multiple AF relays for cooperation between legitimate transmitter and intended receiver in the presence of a spoofer. To achieve this goal, two best relay selection schemes are developed by maximizing the signal-to-noise ratio (SNR of the legitimate link to the spoofing link at the destination and relays, respectively. In the sequel, we derive closed-form expressions for the outage probabilities of the effective SNR ratios at the destination. With the help of the best relay, a new test statistic is developed for making an authentication decision, based on normalized channel difference between adjacent end-to-end channel estimates at the destination. The performance of the proposed authentication scheme is compared with that in a direct transmission in terms of outage and spoofing detection.

  10. DESIGN THREE PHASE OVERCURRENT RELAYS

    Directory of Open Access Journals (Sweden)

    Mohammed Y Suliman,

    2013-05-01

    Full Text Available  A new design of three phase overcurrent relay described in this paper. The performance of the new design shows the ability to obtain any shape of characteristic with high accuracy and distinguish between transient and steady state fault. This design used more precise and flexible model Sachdev linear model for get any characteristic, also fast measurement theory to measure load current for less than half cycle and good hardware system design controlled by Pentium version 4 processor.

  11. Energy efficient circuit design using nanoelectromechanical relays

    Science.gov (United States)

    Venkatasubramanian, Ramakrishnan

    Nano-electromechanical (NEM) relays are a promising class of emerging devices that offer zero off-state leakage and behave like an ideal switch. Recent advances in planar fabrication technology have demonstrated that microelectromechanical (MEMS) scale miniature relays could be manufactured reliably and could be used to build fully functional, complex integrated circuits. The zero leakage operation of relays has renewed the interest in relay based low power logic design. This dissertation explores circuit architectures using NEM relays and NEMS-CMOS heterogeneous integration. Novel circuit topologies for sequential logic, memory, and power management circuits have been proposed taking into consideration the NEM relay device properties and optimizing for energy efficiency and area. In nanoscale electromechanical devices, dispersion forces like Van der Waals' force (vdW) affect the pull-in stability of the relay devices significantly. Verilog-A electromechanical model of the suspended gate relay operating at 1V with a nominal air gap of 5 - 10nm has been developed taking into account all the electrical, mechanical and dispersion effects. This dissertation explores different relay based latch and flip-flop topologies. It has been shown that as few as 4 relay cells could be used to build flip-flops. An integrated voltage doubler based flip flop that improves the performance by 2X by overdriving Vgb has been proposed. Three NEM relay based parallel readout memory bitcell architectures have been proposed that have faster access time, and remove the reliability issues associated with previously reported serial readout architectures. A paradigm shift in design of power switches using NEM relays is proposed. An interesting property of the relay device is that the ON state resistance (Ron) of the NEM relay switch is constant and is insensitive to the gate slew rate. This coupled with infinite OFF state resistance (Roff ) offers significant area and power advantages over CMOS

  12. 译码转发中继信道下双层延长LDP C码设计%Design of bilayer lengthened LDPC codes for decode-and-forward in relay channels

    Institute of Scientific and Technical Information of China (English)

    刘洋; 李京娥; 李颖

    2014-01-01

    The bilayer density evolution algorithm is always used to design bilayer lengthened LDPC codes for the decode-and-forward relay system.The general approach is to fix the lower variable degree distribution and then find an upper variable degree distribution,which has higher complexity.To solve this problem,the Gaussian approximation algorithm is proposed to implement the overall optimization for the lower and upper variable degree distributions.The proposed algorithm aims at maximizing the rates of the source-to-relay and the source-to-destination link simultaneously,which has lower complexity.Simulation results show that the gap between the convergence threshold and the theoretical limit of the proposed LDPC codes is smaller and that BER performance is almost the same as that of the ensembles obtained by bilayer density evolution.%译码转发中继系统中双层延长低密度奇偶校验(LDPC)码设计,一般采用双层密度进化算法,固定下层变量节点度分布来搜索上层变量节点度分布,复杂度很高。针对这一问题,提出了高斯近似算法对上下层变量节点度分布进行整体优化,以达到信源到目的和信源到中继两条链路上的传输速率同时最大的目的,复杂度较低。仿真结果表明,文中设计的双层延长 LDPC码的译码阈值与理论限的间隔较小,误码性能与利用双层密度进化算法搜索到的最优码集接近。

  13. Error-rate performance analysis of incremental decode-and-forward opportunistic relaying

    KAUST Repository

    Tourki, Kamel

    2011-06-01

    In this paper, we investigate an incremental opportunistic relaying scheme where the selected relay chooses to cooperate only if the source-destination channel is of an unacceptable quality. In our study, we consider regenerative relaying in which the decision to cooperate is based on a signal-to-noise ratio (SNR) threshold and takes into account the effect of the possible erroneously detected and transmitted data at the best relay. We derive a closed-form expression for the end-to-end bit-error rate (BER) of binary phase-shift keying (BPSK) modulation based on the exact probability density function (PDF) of each hop. Furthermore, we evaluate the asymptotic error performance and the diversity order is deduced. We show that performance simulation results coincide with our analytical results. © 2011 IEEE.

  14. Distributed Beamforming in Wireless Multiuser Relay-Interference Networks with Quantized Feedback

    CERN Document Server

    Koyuncu, Erdem

    2010-01-01

    We study quantized beamforming in wireless amplify-and-forward relay-interference networks with any number of transmitters, relays, and receivers. We design the quantizer of the channel state information to minimize the probability that at least one receiver incorrectly decodes its desired symbol(s). Correspondingly, we introduce a generalized diversity measure that encapsulates the conventional one as the first-order diversity. Additionally, it incorporates the second-order diversity, which is concerned with the transmitter power dependent logarithmic terms that appear in the error rate expression. First, we show that, regardless of the quantizer and the amount of feedback that is used, the relay-interference network suffers a second-order diversity loss compared to interference-free networks. Then, two different quantization schemes are studied: First, using a global quantizer, we show that a simple relay selection scheme can achieve maximal diversity. Then, using the localization method, we construct both ...

  15. Error-rate performance analysis of incremental decode-and-forward opportunistic relaying

    KAUST Repository

    Tourki, Kamel

    2010-10-01

    In this paper, we investigate an incremental opportunistic relaying scheme where the selected relay chooses to cooperate only if the source-destination channel is of an unacceptable quality. In our study, we consider regenerative relaying in which the decision to cooperate is based on a signal-to-noise ratio (SNR) threshold and takes into account the effect of the possible erroneously detected and transmitted data at the best relay. We derive a closed-form expression for the end-to-end biterror rate (BER) of binary phase-shift keying (BPSK) modulation based on the exact probability density function (PDF) of each hop. Furthermore, we evaluate the asymptotic error performance and the diversity order is deduced. We show that performance simulation results coincide with our analytical results. ©2010 IEEE.

  16. Proportional fair scheduling with superposition coding in a cellular cooperative relay system

    DEFF Research Database (Denmark)

    Kaneko, Megumi; Hayashi, Kazunori; Popovski, Petar

    2013-01-01

    Many works have tackled on the problem of throughput and fairness optimization in cellular cooperative relaying systems. Considering firstly a two-user relay broadcast channel, we design a scheme based on superposition coding (SC) which maximizes the achievable sum-rate under a proportional...... fairness constraint. Unlike most relaying schemes where users are allocated orthogonally, our scheme serves the two users simultaneously on the same time-frequency resource unit by superposing their messages into three SC layers. The optimal power allocation parameters of each SC layer are derived...... by analysis. Next, we consider the general multi-user case in a cellular relay system, for which we design resource allocation algorithms based on proportional fair scheduling exploiting the proposed SC-based scheme. Numerical results show that the proposed algorithms allowing simultaneous user allocation...

  17. Efficient power allocation for fixed-gain amplify-and-forward relaying in rayleigh fading

    KAUST Repository

    Zafar, Ammar

    2013-06-01

    In this paper, we study power allocation strategies for a fixed-gain amplify-and-forward relay network employing multiple relays. We consider two optimization problems for the relay network: 1) optimal power allocation to maximize the end-to-end signal-to-noise ratio (SNR) and 2) minimizing the total consumed power while maintaining the end-to-end SNR over a threshold value. We assume that the relays have knowledge of only the channel statistics of all the links. We show that the SNR maximization problem is concave and the power minimization problem is convex. Hence, we solve the problems through convex programming. Numerical results show the benefit of allocating power optimally rather than uniformly. © 2013 IEEE.

  18. Greedy Algorithm Applied to Relay Selection for Cooperative Communication Systems in Amplify-and-Forward Mode

    Institute of Scientific and Technical Information of China (English)

    Cheng-Ying Yang; Yi-Shan Lin; Jyh-Horng Wen

    2014-01-01

    Using a relaying system to provide spatial diversity and improve the system performance is a tendency in the wireless cooperative communications. Amplify-and-forward (AF) mode with a low complexity is easy to be implemented. Under the consideration of cooperative communication systems, the scenario includes one information source, M relay stations and N destinations. This work proposes a relay selection algorithm in the Raleigh fading channel. Based on the exhaustive search method, easily to realize, the optimal selection scheme can be found with a highly complicated calculation. In order to reduce the computational complexity, an approximate optimal solution with a greedy algorithm applied for the relay station selection is proposed. With different situations of the communication systems, the performance evaluation obtained by both the proposed algorithm and the exhaustive search algorithm are given for comparison. It shows the proposed algorithm could provide a solution approach to the optimal one.

  19. Robust Transceiver Design for AF MIMO Relay Systems with Column Correlations

    CERN Document Server

    Xing, Chengwen; Wu, Yik-Chung; Ma, Shaodan; Kuang, Jingming

    2012-01-01

    In this paper, we investigate the robust transceiver design for dual-hop amplify-and-forward (AF) MIMO relay systems with Gaussian distributed channel estimation errors. Aiming at maximizing the mutual information under imperfect channel state information (CSI), source precoder at source and forwarding matrix at the relay are jointly optimized. Using some elegant attributes of matrix-monotone functions, the structures of the optimal solutions are derived first. Then based on the derived structure an iterative waterfilling solution is proposed. Several existing algorithms are shown to be special cases of the proposed solution. Finally, the effectiveness of the proposed robust design is demonstrated by simulation results.

  20. A minimum bit error-rate detector for amplify and forward relaying systems

    KAUST Repository

    Ahmed, Qasim Zeeshan

    2012-05-01

    In this paper, a new detector is being proposed for amplify-and-forward (AF) relaying system when communicating with the assistance of L number of relays. The major goal of this detector is to improve the bit error rate (BER) performance of the system. The complexity of the system is further reduced by implementing this detector adaptively. The proposed detector is free from channel estimation. Our results demonstrate that the proposed detector is capable of achieving a gain of more than 1-dB at a BER of 10 -5 as compared to the conventional minimum mean square error detector when communicating over a correlated Rayleigh fading channel. © 2012 IEEE.

  1. The Laser Communications Relay and the Path to the Next Generation Near Earth Relay

    Science.gov (United States)

    Israel, David J.

    2015-01-01

    NASA Goddard Space Flight Center is currently developing the Laser Communications Relay Demonstration (LCRD) as a Path to the Next Generation Near Earth Space Communication Network. The current NASA Space Network or Tracking and Data Relay Satellite System is comprised of a constellation of Tracking and Data Relay Satellites (TDRS) in geosynchronous orbit and associated ground stations and operation centers. NASA is currently targeting a next generation of relay capability on orbit in the 2025 timeframe.

  2. Uplink Capacity of 802.16j Mobile Multihop Relay Networks with Transparent Relays

    DEFF Research Database (Denmark)

    Wang, Hua; Andrews, Jeffrey G.; Iversen, Villy Bæk

    2009-01-01

    -input multi-output (MIMO) transmission is applied in the relay link. We derived the cell coverage and average spectral efficiency, as well as the system Erlang capacity supporting both voice and data traffic. The numerical results show that MIMO transmission in the relay link can significantly improve the end...... in the relay link, significant capacity gains can be achieved with a two-hop 802.16J relay system compared to the conventional single-hop 802.16e system....

  3. Experimental evaluation of earthquake induced relay chattering

    Energy Technology Data Exchange (ETDEWEB)

    Bandyopadhyay, K.; Hofmayer, C.; Shteyngart, S.

    1990-01-01

    An experimental evaluation of relay performance under vibratory environments is discussed in this paper. Single frequency excitation was used for most tests. Limited tests were performed with random multifrequency inputs. The capacity of each relay was established based on a two-millisecond chatter criterion. The experimental techniques are described and the effects of parameters in controlling the relay capacity levels are illustrated with test data. A wide variation of the capacity levels was observed due to the influence of parameters related to the design of the relay and nature of the input motion. 3 refs., 15 figs.

  4. Precoding Design of MIMO Amplify-and-Forward Communication System With an Energy Harvesting Relay and Possibly Imperfect CSI

    KAUST Repository

    Benkhelifa, Fatma

    2017-03-02

    In this paper, we investigate the simultaneous wireless information and power transfer (SWIPT) in a Multiple-Input Multiple-Output (MIMO) Amplify-and-Forward (AF) relay communication system where the relay is an energy harvesting (EH) node and harvests the energy the signals transmitted from the source. The harvested energy is partially used to forward signals from the source to the destination, and the remaining energy is stored for other usages. The SWIPT in relay-assisted communication is interesting as long as the relay stores energy from the source and the destination receives successfully the data from the source. In this context, we propose to investigate the source and relay precoders that characterize the relationship between the achievable stored energy at the relay and the achievable sourceto- destination rate, namely the rate-stored energy (R-E) tradeo region. First, we consider the ideal scheme where there is the simultaneous operation of the EH and ID receivers at the relay. Then, we consider practical schemes such as the power splitting (PS) and the time switching (TS) that separate the operation of EH and information decoding (ID) receivers over power domain or time domain, respectively. Moreover, we study the case of imperfect channel state information (CSI) at the relay and the destination and characterize its impact on the achievable R-E region. Through the simulation results, we show the eect of the position of the relay and the channel uncertainty on the achievable R-E regions of all the schemes when the used energy at the relay is constant or variable. We also show that, although it provides an outer bound on the achievable rate-energy region in one-hop MIMO systems, the ideal scheme provides only an upper bound on the maximum achievable end-to-end rate and not an outer bound on the R-E region.

  5. Secrecy Capacity of the Wiretap Channel with Noisy Feedback

    CERN Document Server

    Lai, Lifeng; Poor, H Vincent

    2007-01-01

    In this work, the role of noisy feedback in enhancing the secrecy capacity of the wiretap channel is investigated. A model is considered in which the feed-forward and feedback signals share the same noisy channel. More specifically, a discrete memoryless modulo-additive channel with a full-duplex destination node is considered first, and it is shown that a judicious use of feedback increases the perfect secrecy capacity to the capacity of the source-destination channel in the absence of the wiretapper. In the achievability scheme, the feedback signal corresponds to a private key, known only to the destination. Then a half-duplex system is considered, for which a novel feedback technique that always achieves a positive perfect secrecy rate (even when the source-wiretapper channel is less noisy than the source-destination channel) is proposed. These results hinge on the modulo-additive property of the channel, which is exploited by the destination to perform encryption over the channel without revealing its key...

  6. Protective relaying theory and applications

    CERN Document Server

    Elmore, Walter A

    2003-01-01

    Targeting the latest microprocessor technologies for more sophisticated applications in the field of power system short circuit detection, this revised and updated source imparts fundamental concepts and breakthrough science for the isolation of faulty equipment and minimization of damage in power system apparatus. The Second Edition clearly describes key procedures, devices, and elements crucial to the protection and control of power system function and stability. It includes chapters and expertise from the most knowledgeable experts in the field of protective relaying, and describes micropro

  7. MIMO Four-Way Relaying

    DEFF Research Database (Denmark)

    Liu, Huaping; Sun, Fan; De Carvalho, Elisabeth;

    2013-01-01

    Two-way relaying in wireless systems has initiated a large research effort during the past few years. Nevertheless, it represents only a specific traffic pattern and it is of interest to investigate other traffic patterns where such a simultaneous processing of information flows can bring...... in such a way that one RS and the terminals associated with it do not interfere with the other RS, and vice versa. We introduce and analyze a two-phase transmission scheme to serve the four-way traffic pattern defined in this scenario. Each phase consists of combined broadcast and multiple access. We analyze...

  8. Multi-hop Relaying: An End-to-End Delay Analysis

    KAUST Repository

    Chaaban, Anas

    2015-12-01

    The impact of multi-hopping schemes on the communication latency in a relay channel is studied. The main aim is to characterize conditions under which such schemes decrease the communication latency given a reliability requirement. Both decode-forward (DF) and amplify-forward (AF) with block coding are considered, and are compared with the point-to-point (P2P) scheme which ignores the relay. Latency expressions for the three schemes are derived, and conditions under which DF and AF reduce latency are obtained for high signal-to-noise ratio (SNR). Interestingly, these conditions are more strict when compared to the conditions under which the same multi-hopping schemes achieve higher long-term (information-theoretic) rates than P2P. It turns out that the relation between the sourcedestination SNR and the harmonic mean of the SNR’s of the channels to and from the relay dictates whether multi-hopping reduces latency or not.

  9. Energy Efficiency Analysis of a Two Dimensional Cooperative Wireless Sensor Network with Relay Selection

    Directory of Open Access Journals (Sweden)

    M. Kakitani

    2013-06-01

    Full Text Available The energy efficiency of non-cooperative and cooperative transmissions are investigated in a two-dimensional wireless sensor network, considering a target outage probability and the same end-to-end throughput for all transmission schemes. The impact of the relay selection method in the cooperative schemes is also analyzed. We show that under non line-of-sight conditions the relay selection method has a greater impact in the energy efficiency than the availability of a return channel. By its turn, under line-of-sight conditions a return channel is more valuable to the energy efficiency of cooperative transmission than the specific relay selection method. Finally, we demonstrate that the energy efficiency advantage of the cooperative over the non-cooperative transmission increases with the distance among nodes and with the nodes density.

  10. Outage Analysis of Dual-hop Cognitive Networks with Relay Selection over Nakagami-m Fading Environment

    Science.gov (United States)

    Zhang, Zongsheng; Pi, Xurong

    2014-09-01

    In this paper, we investigate the outage performance of decode-and-forward cognitive relay networks for Nakagami-m fading channels, with considering both best relay selection and interference constraints. Focusing on the relay selection and making use of the underlay cognitive approach, an exact closed-form outage probability expression is derived in an independent, non-identical distributed Nakagami-m environment. The closed-form outage probability provides an efficient means to evaluate the effects of the maximum allowable interference power, number of cognitive relays, and channel conditions between the primary user and cognitive users. Finally, we present numerical results to validate the theory analysis. Moreover, from the simulation results, we obtain that the system can obtain the full diversity.

  11. Efficiency Intra-Cluster Device-to-Device Relay Selection for Multicast Services Based on Combinatorial Auction

    Directory of Open Access Journals (Sweden)

    Yong Zhang

    2015-12-01

    Full Text Available In Long Term Evolution-Advanced (LTE-A networks, Device-to-device (D2D communications can be utilized to enhance the performance of multicast services by leveraging D2D relays to serve nodes with worse channel conditions within a cluster. For traditional D2D relay schemes, D2D links with poor channel condition may be the bottleneck of system sum data rate. In this paper, to optimize the throughput of D2D communications, we introduce an iterative combinatorial auction algorithm for efficient D2D relay selection. In combinatorial auctions, the User Equipments (UEs that fails to correctly receive multicast data from eNodeB (eNB are viewed as bidders that compete for D2D relays, while the eNB is treated as the auctioneer. We also give properties of convergency and low-complexity and present numerical simulations to verify the efficiency of the proposed algorithm.

  12. Outage probability of dual-hop partial relay selection with feedback delay in the presence of interference

    KAUST Repository

    Al-Qahtani, Fawaz S.

    2011-09-01

    In this paper, we investigate the outage performance of a dual-hop relaying systems with partial relay selection and feedback delay. The analysis considers the case of Rayleigh fading channels when the relaying station as well as the destination undergo mutually independent interfering signals. Particularly, we derive the cumulative distribution function (c.d.f.) of a new type of random variable involving sum of multiple independent exponential random variables, based on which, we present closed-form expressions for the exact outage probability of a fixed amplify-and-forward (AF) and decode-and-forward (DF) relaying protocols. Numerical results are provided to illustrate the joint effect of the delayed feedback and co-channel interference on the outage probability. © 2011 IEEE.

  13. Minimax robust relay selection based on uncertain long-term CSI

    KAUST Repository

    Nisar, Muhammad Danish

    2014-02-01

    Cooperative communications via multiple relay nodes is known to provide the benefits of increase diversity and coverage. Simultaneous transmission via multiple relays, however, requires strong coordination between nodes either in terms of slot-based transmission or distributed space-time (ST) code implementation. Dynamically selecting a single best relay out of multiple relays and then using it alone for cooperative transmission alleviates the need for this strong coordination while still reaping the benefits of increased diversity and coverage. In this paper, we consider the design of relay selection (RS) under an imperfect knowledge of long-term channel state information (CSI) at the relay nodes, and we pursue minimax optimization to arrive at a robust RS approach that promises the best guarantee on the worst-case end-to-end signal-to-noise ratio (SNR). We provide some intuitive examples and extensive simulation results, not only in terms of worst-case SNR performance but also in terms of average bit-error-rate (BER) performance, to demonstrate the benefits of the proposed minimax robust RS scheme. © 2013 IEEE.

  14. Orthogonal DF Cooperative Relay Networks with Multiple-SNR Thresholds and Multiple Hard-Decision Detections

    Directory of Open Access Journals (Sweden)

    Dian-Wu Yue

    2010-01-01

    Full Text Available This paper investigates a wireless cooperative relay network with multiple relays communicating with the destination over orthogonal channels. Proposed is a cooperative transmission scheme that employs two signal-to-noise ratio (SNR thresholds and multiple hard-decision detections (HDD at the destination. One SNR threshold is used to select transmitting relays, and the other threshold is used at the destination for detection. Then the destination simply combines all the hard-decision results and makes the final binary decision based on majority voting. Focusing on the decode-and-forward (DF relaying protocol, the average bit error probability is derived and diversity analysis is carried out. It is shown that the full diversity order can be achieved by setting appropriate thresholds even when the destination does not know the exact or average SNRs of the source-relay links. The performance analysis is further extended to multi-hop cooperation and/or with the presence of a direct link where multiple thresholds are needed. By combining the multiple-SNR threshold method with a selection of the best relaying link, a high spectral-efficiency cooperative transmission scheme is further presented. Simulation results verify the theoretical analysis and demonstrate performance advantage of our proposed schemes over the existing ones.

  15. On Compress-Forward without Wyner-Ziv Binning for Relay Networks

    CERN Document Server

    Zhong, Peng; Vu, Mai

    2011-01-01

    Noisy network coding is recently proposed for the general multi-source network by Lim, Kim, El Gamal and Chung. This scheme builds on compress-forward (CF) relaying but involves three new ideas, namely no Wyner-Ziv binning, relaxed simultaneous decoding and message repetition. In this paper, using the two-way relay channel as the underlining example, we analyze the impact of each of these ideas on the achievable rate region of relay networks. First, CF without binning but with joint decoding of both the message and compression index can achieve a larger rate region than the original CF scheme for multi-destination relay networks. With binning and successive decoding, the compression rate at each relay is constrained by the weakest link from the relay to a destination; but without binning, this constraint is relaxed. Second, simultaneous decoding of all messages over all blocks without uniquely decoding the compression indices can remove the constraints on compression rate completely, but is still subject to t...

  16. Distributed cognitive two-way relay beamformer designs under perfect and imperfect CSI

    KAUST Repository

    Pandarakkottilil, Ubaidulla

    2011-09-01

    In this paper, we present distributed two-way relay beamformer designs for a cognitive radio network (CRN) in which a pair of cognitive (or secondary) transceiver nodes communicate with each other assisted by a set of cognitive two-way relay nodes. The secondary nodes share the spectrum with a licensed primary user (PU) node, and each node is assumed to be equipped with a single transmit/receive antenna. The interference to the PU resulting from the transmission from the cognitive nodes is kept below a specified limit. First, we consider relay beamformer designs assuming the availability of perfect channel state information (CSI). For this case, a mean-square error (MSE)-constrained beamformer that minimizes the total relay transmit power, and an MSE-balancing beamformer with a constraint on the total relay transmit power are proposed. Next, we consider relay beamformer designs assuming that the available CSI is imperfect. For this case too, we consider the same problems as those in the case of perfect CSI, and propose beamformer designs that are robust to the errors in the CSI. We show that the proposed designs can be reformulated as convex optimization problems that can be solved efficiently. Through numerical simulations, we illustrate the performance of the proposed designs. © 2011 IEEE.

  17. 49 CFR 236.589 - Relays.

    Science.gov (United States)

    2010-10-01

    ... Cab Signal Systems Inspection and Tests; Locomotive § 236.589 Relays. (a) Each relay shall be removed from service, subjected to thorough test, necessary repairs and adjustments made, and shall not be... spring tension to return contacts to deenergized position in noncoded continuous inductive...

  18. Demonstration Model of Self Inductance Using Relay

    Indian Academy of Sciences (India)

    2016-05-01

    Using an electrical component like a relay, the phenomenonof self inductance caneasily be demonstrated to undergraduatestudents. By wiring simple electrical components like relay,neon bulb and a DC power supply, intermittent backelectromotive force (emf) can be generated in the range from60 to 100 volt. The glowing of neon bulb provides visualevidence for the generation of large back emf due to selfinductance.

  19. Capacity of a Class of Multi-source Relay Networks

    CERN Document Server

    Jeon, Sang-Woon

    2009-01-01

    Characterizing the capacity region of multi-source wireless relay networks is one of the fundamental issues in network information theory. The problem is, however, quite challenging because the transmission of other sessions acts as inter-user interference when there exist multiple source-destination (S-D) pairs in the network. By focusing on a special class of networks, we show that the capacity can be found. Namely, we study a linear finite-field network with time-varying channels, which exhibits broadcast, interference, and fading natures of wireless communication. We observe that fading can play an important role in mitigating inter-user interference effectively for both single-hop and multi-hop networks. We propose new block Markov encoding and relaying schemes with randomized channel pairing, which exploit such channel variations, and derive their achievable rates. By comparing them with the general cut-set upper bound, the capacity region of single-hop networks and the sum-capacity of multi-hop network...

  20. Relay-assisted Network Coding Multicast in the Presence of Neighbours

    DEFF Research Database (Denmark)

    Khamfroush, Hana; Roetter, Daniel Enrique Lucani; Pahlevani, Peyman

    2015-01-01

    We study the problem of minimizing the cost of packet transmission from a source to two receivers with the help of a relay and using network coding in wireless mesh networks consisting of many active neighbours sharing the same channel. The cost minimization problem is modeled as a Markov Decisio...

  1. Wireless Power Transfer in Cooperative DF Relaying Networks with Log-Normal Fading

    KAUST Repository

    Rabie, Khaled M.

    2017-02-07

    Energy-harvesting (EH) and wireless power transfer in cooperative relaying networks have recently attracted a considerable amount of research attention. Most of the existing work on this topic however focuses on Rayleigh fading channels which represents outdoor environments. Unlike these studies, in this paper we analyze the performance of wireless power transfer in two-hop decode-and- forward (DF) cooperative relaying systems in indoor channels characterized by log-normal fading. Three well-known EH protocols are considered in our evaluations: a) time switching relaying (TSR), b) power splitting relaying (PSR) and c) ideal relaying receiver (IRR). The performance is evaluated in terms of the ergodic outage probability for which we derive accurate analytical expressions for the three systems under consideration. Results reveal that careful selection of the EH time and power splitting factors in the TSR- and PSR-based system are important to optimize performance. It is also presented that the optimized PSR system has near- ideal performance and that increasing the source transmit power and/or the energy harvester efficiency can further improve performance.

  2. Asymptotic Analysis of Large Cooperative Relay Networks Using Random Matrix Theory

    Directory of Open Access Journals (Sweden)

    H. Poor

    2008-04-01

    Full Text Available Cooperative transmission is an emerging communication technology that takes advantage of the broadcast nature of wireless channels. In cooperative transmission, the use of relays can create a virtual antenna array so that multiple-input/multiple-output (MIMO techniques can be employed. Most existing work in this area has focused on the situation in which there are a small number of sources and relays and a destination. In this paper, cooperative relay networks with large numbers of nodes are analyzed, and in particular the asymptotic performance improvement of cooperative transmission over direction transmission and relay transmission is analyzed using random matrix theory. The key idea is to investigate the eigenvalue distributions related to channel capacity and to analyze the moments of this distribution in large wireless networks. A performance upper bound is derived, the performance in the low signal-to-noise-ratio regime is analyzed, and two approximations are obtained for high and low relay-to-destination link qualities, respectively. Finally, simulations are provided to validate the accuracy of the analytical results. The analysis in this paper provides important tools for the understanding and the design of large cooperative wireless networks.

  3. Conflict-Aware Relay Selection for Multicast in MUD based Wireless Networks

    Directory of Open Access Journals (Sweden)

    Asma Ben Hassouna

    2013-04-01

    Full Text Available Multipoint Relays (MPR [1] selection is a good step toward building a very proficient routing scheme for multicast/broadcast communications. It considers the fact that data transmitted by a node is overheard by all the users in the sender’s communication range, called the Wireless Broadcast Advantage (WBA [2][4][6]. However, when a node elects its MPR nodes it does not consider their channel qualities (i.e. they do not consider the Multi-User Diversity (MUD [3][5] factor, that has a significant influence on the network performance. Many other works consider the MUD and the rate adaptation (RA features [15][16]. However these works are distorted by severe simplifications that are made about some common wireless network problems such as: the number of transmissions, the access scheduling, the interference conflicts, etc. In this paper, we introduce three new MUD, WBA and RA based relay selection schemes. The first one proposed, called the Efficient Multi-user Diversity based Relay (E-MDR selection scheme,  is done over steps by exploiting the channel qualities in term of maximum achievable data rate (or channel capacity. The proposed EMDR based flooding strategy achieves the best multicast throughput without considering concurrent transmissions. It aims jointly (i to reduce the number of relays, (ii to maximize the throughput of each single multicast session (or partition, (iii to reduce the number of transmissions, (iv to exploit extremely the offered link capacities and as a consequence (v to enhance the allover network throughput. The second MUD, WBA and RA based relay selection scheme, called the Conflict free Multi-user Diversity based Relay (C-MDR selection scheme, performs relay selection with consideration of the interference factor. It targets (i to select relay nodes and their data transmission rates that maximize the multicast throughput, (ii to consider the effect of access scheduling when choosing relay nodes and (iii to resolve

  4. Signal-Noise Ratio Control Subsystem of Digital Equipment for Transmission of "Strela" Relay Protection Commands

    Directory of Open Access Journals (Sweden)

    I. Zabenkov

    2012-01-01

    Full Text Available Continuous measurement function of relative noise and interference level in the information transmission channel is considered as an important one for controlling parameters of high-frequency signal. The present paper simulates an algorithm for measuring signal-noise ratio in the transmission channel of high-voltage lines which is used in the digital equipment for transmission of relay protection and emergency automation commands of "Strela" complex.

  5. An improved channel assessment scheme

    KAUST Repository

    Bader, Ahmed

    2014-05-01

    A source node in a multihop network determines whether to transmit in a channel based on whether the channel is occupied by a packet transmission with a large number of relays; whether the source node is in the data tones back-off zone; and the source node is in the busy tone back-off zone.

  6. Joint TAS and power allocation for DF relaying M2M cooperative system

    Science.gov (United States)

    Xu, Lingwei; Zhang, Hao; Gulliver, T. Aaron

    2016-09-01

    The outage probability (OP) performance of transmit antenna selection (TAS) in a decode-and-forward relaying mobile-to-mobile system with relay selection over N-Nakagami fading channels is investigated. Exact closed-form expressions for the OP of two TAS schemes are derived, and the optimal power allocation optimisation problem is formulated. The OP performance is evaluated via Monte Carlo simulation to verify the analysis. The results obtained show that the optimal TAS scheme has better performance than the suboptimal TAS scheme, but the performance gap between these techniques decreases as the number of source antennas increases.

  7. Noncoherent Physical-Layer Network Coding with FSK Modulation: Relay Receiver Design Issues

    Science.gov (United States)

    2011-03-01

    digital network coding ( DNC ) to distinguish it from ANC. Under 0090-6778/11$25.00 c⃝ 2011 IEEE Report Documentation Page Form ApprovedOMB No. 0704-0188...223 2596 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 59, NO. 9, SEPTEMBER 2011 many channel conditions, DNC offers enhanced performance over ANC. This...is because the decoding operation at the relay helps DNC to remove noise from the MAC phase, while the noise is amplied by the relay when ANC is used

  8. Joint TAS and Power Allocation for SDF Relaying M2M Cooperative Networks

    Directory of Open Access Journals (Sweden)

    Lingwei Xu

    2016-01-01

    Full Text Available The outage probability (OP performance of multiple-relay-based selective decode-and-forward (SDF relaying mobile-to-mobile (M2M networks with transmit antenna selection (TAS over N-Nakagami fading channels is investigated. The exact closed-form expressions for OP of the optimal and suboptimal TAS schemes are derived. The power allocation problem is formulated for performance optimization. Then, the OP performance under different conditions is evaluated through numerical simulations to verify the analysis. The simulation results showed that optimal TAS scheme has a better OP performance than suboptimal TAS scheme. Further, the power allocation parameter has an important influence on the OP performance.

  9. Exact outage analysis of incremental decode-and-forward opportunistic relaying

    KAUST Repository

    Tourki, Kamel

    2010-11-01

    In this paper, we investigate a dual-hop decode-andforward opportunistic relaying scheme where the selected relay chooses to cooperate only if the source-destination channel is of an unacceptable quality. In our study, we derive exact closed-form expression for the outage probability based on the exact statistics of each hop. Furthermore, we perform asymptotic analysis and we deduce the diversity order of the scheme. We validate our analysis by showing that performance simulation results coincide with our analytical results over different network architectures. © 2010 IEEE.

  10. On the jamming power allocation for secure amplify-and-forward relaying via cooperative jamming

    KAUST Repository

    Park, Kihong

    2013-09-01

    In this paper, we investigate secure communications in two-hop wireless relaying networks with one eavesdropper. To prevent the eavesdropper from intercepting the source message, the destination sends an intended jamming noise to the relay, which is referred to as cooperative jamming. This jamming noise helps protecting the source message from being captured reliably at the eavesdropper, while the destination cancels its self-intended noise. According to the channel information available at the destination, we derive three jamming power allocation strategies to minimize the outage probability of the secrecy rate. In addition, we derive analytic results quantifying the jamming power consumption of the proposed allocation methods. © 1983-2012 IEEE.

  11. Robust Beamforming for Amplify-and-Forward MIMO Relay Systems Based on Quadratic Matrix Programming

    CERN Document Server

    Xing, Chengwen; Wu, Yik-Chung; Ng, Tung-Sang

    2010-01-01

    In this paper, robust transceiver design based on minimum-mean-square-error (MMSE) criterion for dual-hop amplify-and-forward MIMO relay systems is investigated. The channel estimation errors are modeled as Gaussian random variables, and then the effect are incorporated into the robust transceiver based on the Bayesian framework. An iterative algorithm is proposed to jointly design the precoder at the source, the forward matrix at the relay and the equalizer at the destination, and the joint design problem can be efficiently solved by quadratic matrix programming (QMP).

  12. Study on reliability technology of contactor relay

    Institute of Scientific and Technical Information of China (English)

    LIU Guo-jin; ZHAO Jing-ying; WANG Hai-tao; YANG Chen-guang; SUN Shun-li

    2007-01-01

    In this paper, the reliability of contactor relay is studied. There are three main parts about reliability test and analysis. First, in order to analyze reliability level of contact relay, the failure ratio ranks are established as index base on the product level. Second, the reliability test method is put forward. The sample plan of reliability compliance test is gained from reliability sample theory. The failure criterion is ensured according to the failure modes of contactor relay. Third, after reliability test experiment, the analysis of failure physics is made and the failure reason is found.

  13. Packet scheduling for OFDMA based relay networks

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    The combination of relay networks with orthogonal frequency division multiple access (OFDMA) has been proposed as a promising solution for the next generation wireless system. Considering different traffic classes and user quality of service (QoS), three efficient scheduling algorithms are introduced in such networks. The round-robin (RR) algorithm in relay networks serves as a performance benchmark. Numerical results show that the proposed algorithms achieve significant improvement on system throughput and decrease system packet loss rate, compared with the RR and absence of relaying system (traditional network). Furthermore, comparisons have been carried out among the three proposed algorithms.

  14. Lightweight Distance Bounding Protocol against Relay Attacks

    Science.gov (United States)

    Kim, Jin Seok; Cho, Kookrae; Yum, Dae Hyun; Hong, Sung Je; Lee, Pil Joong

    Traditional authentication protocols are based on cryptographic techniques to achieve identity verification. Distance bounding protocols are an enhanced type of authentication protocol built upon both signal traversal time measurement and cryptographic techniques to accomplish distance verification as well as identity verification. A distance bounding protocol is usually designed to defend against the relay attack and the distance fraud attack. As there are applications to which the distance fraud attack is not a serious threat, we propose a streamlined distance bounding protocol that focuses on the relay attack. The proposed protocol is more efficient than previous protocols and has a low false acceptance rate under the relay attack.

  15. A NEW RELAY DESIGN FOR REACTIVE POWER COMPENSATION AND ECONOMICAL COMPARISION WITH CLASSICAL RELAY

    Directory of Open Access Journals (Sweden)

    Mustafa ŞEKKELİ

    2007-02-01

    Full Text Available In most cases, reactive power compensation is otomatically achieved with reactive power control relay by switching on and off, stationary shunt capasitors to the electrical network. İn this study , a new relay has been designed and developed. İn this method, capasitors which is switched on and of are optimally choosen. İn classical relay , only one capasitor can be added or extructed to the network. But,in designing new relay, 1,2 or 3 capasitor banks which are nearest value for desired inductive reactive power can be optimally choosen. As a result , switching number of capacitor and contactor is reduced minimum value and line is loaded less inductive current , it means that less active power losses. New designed relay has been compared with classical one economically . This relay has been manufactured and approved experimantally.

  16. 49 CFR 236.52 - Relayed cut-section.

    Science.gov (United States)

    2010-10-01

    ... 49 Transportation 4 2010-10-01 2010-10-01 false Relayed cut-section. 236.52 Section 236.52...: All Systems Track Circuits § 236.52 Relayed cut-section. Where relayed cut-section is used in... shall be open and the track circuit shunted when the track relay at such cut-section is in deenergized...

  17. Bilayer Beams and Relay Sharing based OFDMA Cellular Architecture

    Directory of Open Access Journals (Sweden)

    Yanxiong Pan

    2011-08-01

    Full Text Available Over the past decade, researchers have been putting a lot of energy on co-channel interference suppression in the forthcoming fourth generation (4G wireless networks. Existing approaches to interference suppression are mainly based on signal processing, cooperative communication or coordination techniques. Though good performance has been attained already, a more complex receiver is needed, and there is still room for improvement through other ways.Considering spatial frequency reuse, which provides an easier way to cope with the co-channel interference, this paper proposed a bilayer beams and relay sharing based (BBRS OFDMA cellular architecture and corresponding frequency planning scheme. The main features of the novel architecture are as follows. Firstly, the base station (BS uses two beams, one composed of six wide beams providing coverage to mobile stations (MSs that access to the BS, and the other composed of six narrow beams communicating with fixed relay stations (FRSs. Secondly, in the corresponding frequency planning scheme, soft frequency reuse is considered on all FRSs further. System-level simulation results demonstrate that better coverage performance is obtained and the mean data rate of MSs near the cell edge is improved significantly. The BBRS cellular architecture provides a practical method to interference suppression in 4G networks since a better tradeoff between performance and complexity is achieved.

  18. Coded Cooperation for Multiway Relaying in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Zhongwei Si

    2015-06-01

    Full Text Available Wireless sensor networks have been considered as an enabling technology for constructing smart cities. One important feature of wireless sensor networks is that the sensor nodes collaborate in some manner for communications. In this manuscript, we focus on the model of multiway relaying with full data exchange where each user wants to transmit and receive data to and from all other users in the network. We derive the capacity region for this specific model and propose a coding strategy through coset encoding. To obtain good performance with practical codes, we choose spatially-coupled LDPC (SC-LDPC codes for the coded cooperation. In particular, for the message broadcasting from the relay, we construct multi-edge-type (MET SC-LDPC codes by repeatedly applying coset encoding. Due to the capacity-achieving property of the SC-LDPC codes, we prove that the capacity region can theoretically be achieved by the proposed MET SC-LDPC codes. Numerical results with finite node degrees are provided, which show that the achievable rates approach the boundary of the capacity region in both binary erasure channels and additive white Gaussian channels.

  19. Coded Cooperation for Multiway Relaying in Wireless Sensor Networks.

    Science.gov (United States)

    Si, Zhongwei; Ma, Junyang; Thobaben, Ragnar

    2015-06-29

    Wireless sensor networks have been considered as an enabling technology for constructing smart cities. One important feature of wireless sensor networks is that the sensor nodes collaborate in some manner for communications. In this manuscript, we focus on the model of multiway relaying with full data exchange where each user wants to transmit and receive data to and from all other users in the network. We derive the capacity region for this specific model and propose a coding strategy through coset encoding. To obtain good performance with practical codes, we choose spatially-coupled LDPC (SC-LDPC) codes for the coded cooperation. In particular, for the message broadcasting from the relay, we construct multi-edge-type (MET) SC-LDPC codes by repeatedly applying coset encoding. Due to the capacity-achieving property of the SC-LDPC codes, we prove that the capacity region can theoretically be achieved by the proposed MET SC-LDPC codes. Numerical results with finite node degrees are provided, which show that the achievable rates approach the boundary of the capacity region in both binary erasure channels and additive white Gaussian channels.

  20. Development of Learning Board for the Digital Relay Using DSP

    Energy Technology Data Exchange (ETDEWEB)

    Ahn, Yong Jin; Choi, Young Woo [Youho Elec. Ind. Co., LTD. (Korea)

    2002-07-01

    A relaying board is developed for the study of digital relay, which is based on digital Signal Processor(DSP). The present development is capable of understanding and application for digital relay hardware. To support the design of relaying hardware, first A/D convertor, MMI and serial port for communication are embedded, and next a booting cables of three types are supplied. More particularly the relaying board that is convenient to test digital relaying algorithm. This paper concludes by into a relaying board. The hardware test results show practically high performance. (author). 35 refs., 10 figs.

  1. Application of a proposed overcurrent relay in radial distribution networks

    Energy Technology Data Exchange (ETDEWEB)

    Conde, A.; Vazquez, E. [Universidad Autonoma de Nuevo Leon, Facultad de Ingenieria Mecanica y Electrica, A.P. 36-F, CU, CP 66450, San Nicolas de los Garza, Nuevo Leon (Mexico)

    2011-02-15

    This paper contains the application criteria and coordination process for a proposed overcurrent relay in a radial power system with feed from one or multiple sources. This relay uses independent functions to detect faults and to calculate the operation time. Also this relay uses a time element function that allows it to reduce the time relay operation, enhancing the backup protection. Some of the proposed approaches improve the sensitivity of the relay. The selection of the best approach in the proposed relay is defined by the needs of the application. The proposed protection can be considered as an additional function protection to conventional overcurrent relays. (author)

  2. Resource Partitioning and Routing Optimization in Relay Enhanced Cellular Network

    Institute of Scientific and Technical Information of China (English)

    LIU Tao; RONG Meng-tian; SHI Hong-kui; XUE Yi-sheng

    2007-01-01

    A joint routing and resource partitioning scheme were proposed to improve cell capacity and user throughput of cellular network enhanced with two-hop fixed relay nodes (FRNs).Radio resources are partitioned under a reuse partitioning based framework, which guarantees effective and efficient inter-cell interference management.At the same time, each mobile terminal was assigned a channel-dependent route by the routing controller,which tries to maximize the cell capacity under the constraint imposed by reuse partitioning.Intensive computer simulations demonstrate the performance superiority of the FRN enhanced cellular network employing this scheme in comparison with conventional network, as well as the validity of the channel-dependent routing mechanism.

  3. Developing a Domain Model for Relay Circuits

    DEFF Research Database (Denmark)

    Haxthausen, Anne Elisabeth

    2009-01-01

    the statics as well as the dynamics of relay circuits, i.e. how a relay circuit can be composed legally from electrical components as well as how the components may change state over time. Finally the circuit model is transformed into an executable model, and we show how a concrete circuit can be defined......In this paper we stepwise develop a domain model for relay circuits as used in railway control systems. First we provide an abstract, property-oriented model of networks consisting of components that can be glued together with connectors. This model is strongly inspired by a network model...... for railways madeby Bjørner et.al., however our model is more general: the components can be of any kind and can later be refined to e.g. railway components or circuit components. Then we show how the abstract network model can be refined into an explicit model for relay circuits. The circuit model describes...

  4. LTE-Advanced Relay Technology and Standardization

    CERN Document Server

    Yuan, Yifei

    2013-01-01

    LTE-Advanced Relay Technology and Standardization provides a timely reference work for relay technology with the finalizing of LTE Release 10 specifications. LTE-Advanced is quickly becoming the global standard for 4G cellular communications. The relay technology, as one of the key features in LTE-Advanced, helps not only to improve the system coverage and capacity, but also to save the costs of laying wireline backhaul. As a leading researcher in the field of LTE-Advanced standards, the author provides an in-depth description of LTE-A relay technology, and explains in detail the standard specification and design principles.     Readers from both academic and industrial fields can find sections of interest to them: Sections 2 & 4 could benefit researchers in academia and those who are engaged in exploratory work, while Sections 3 & 4 are more useful to engineers. Dr. Yifei Yuan is the Technical Director at the Standards Department of ZTE Inc.

  5. Beamforming in Two-Way Fixed Gain Amplify-and-Forward Relay Systems with CCI

    CERN Document Server

    Duong, Trung Q; Zepernick, Hans-Jurgen; Yuen, Chau

    2012-01-01

    We analyze the outage performance of a two-way fixed gain amplify-and-forward (AF) relay system with beamforming, arbitrary antenna correlation, and co-channel interference (CCI). Assuming CCI at the relay, we derive the exact individual user outage probability in closed-form. Additionally, while neglecting CCI, we also investigate the system outage probability of the considered network, which is declared if any of the two users is in transmission outage. Our results indicate that in this system, the position of the relay plays an important role in determining the user as well as the system outage probability via such parameters as signal-to-noise imbalance, antenna configuration, spatial correlation, and CCI power. To render further insights into the effect of antenna correlation and CCI on the diversity and array gains, an asymptotic expression which tightly converges to exact results is also derived.

  6. Decentralized Fair Scheduling in Two-Hop Relay-Assisted Cognitive OFDMA Systems

    CERN Document Server

    Wang, Rui; Cui, Ying

    2010-01-01

    In this paper, we consider a two-hop relay-assisted cognitive downlink OFDMA system (named as secondary system) dynamically accessing a spectrum licensed to a primary network, thereby improving the efficiency of spectrum usage. A cluster-based relay-assisted architecture is proposed for the secondary system, where relay stations are employed for minimizing the interference to the users in the primary network and achieving fairness for cell-edge users. Based on this architecture, an asymptotically optimal solution is derived for jointly controlling data rates, transmission power, and subchannel allocation to optimize the average weighted sum goodput where the proportional fair scheduling (PFS) is included as a special case. This solution supports decentralized implementation, requires small communication overhead, and is robust against imperfect channel state information at the transmitter (CSIT) and sensing measurement. The proposed solution achieves significant throughput gains and better user-fairness compa...

  7. Towards Resource Allocation Algorithm in Opportunistic Relaying Cooperative UWB Communication System

    Directory of Open Access Journals (Sweden)

    Tingting Yang

    2014-02-01

    Full Text Available A novel communication system named “OR cooperative UWB” is proposed by bringing OR (Opportunistic Relaying to UWB system. Particularly, the exact and closed-form symbol error rate (SER expression is derived firstly in this paper. In order to maximize the capacity considering fairness between users, a definition of equivalent mean channel gain is given, and a joint resource allocation algorithm is also proposed which includes three steps: sub-band allocation algorithm, relaying allocation algorithm and power allocation algorithm. Employing the conception of “relative requirement degree”, the algorithm shows a distributed solution targeting relay partner selecting and increasing capacity while satisfying the users’ QoS (Quality of Service requirement. Simulations results validate the performance of the proposed algorithm.

  8. Joint Transmit Antenna Selection and Power Allocation for ISDF Relaying Mobile-to-Mobile Sensor Networks

    Directory of Open Access Journals (Sweden)

    Lingwei Xu

    2016-02-01

    Full Text Available The outage probability (OP performance of multiple-relay incremental-selective decode-and-forward (ISDF relaying mobile-to-mobile (M2M sensor networks with transmit antenna selection (TAS over N-Nakagami fading channels is investigated. Exact closed-form OP expressions for both optimal and suboptimal TAS schemes are derived. The power allocation problem is formulated to determine the optimal division of transmit power between the broadcast and relay phases. The OP performance under different conditions is evaluated via numerical simulation to verify the analysis. These results show that the optimal TAS scheme has better OP performance than the suboptimal scheme. Further, the power allocation parameter has a significant influence on the OP performance.

  9. Accurate outage analysis of incremental decode-and-forward opportunistic relaying

    KAUST Repository

    Tourki, Kamel

    2011-04-01

    In this paper, we investigate a dual-hop decode-and-forward opportunistic relaying scheme where the selected relay chooses to cooperate only if the source-destination channel is of an unacceptable quality. We first derive the exact statistics of received signal-to-noise (SNR) over each hop with co-located relays, in terms of probability density function (PDF). Then, the PDFs are used to determine very accurate closed-form expression for the outage probability for a transmission rate R. Furthermore, we perform asymptotic analysis and we deduce the diversity order of the scheme. We validate our analysis by showing that performance simulation results coincide with our analytical results over different network architectures. © 2011 IEEE.

  10. Performance analysis of AF cooperative systems with HPA nonlinearity in semi-blind relays

    KAUST Repository

    Qi, Jian

    2012-12-01

    In this paper, dual-hop amplify-and-forward (AF) cooperative systems in the presence of high-power amplifier (HPA) nonlinearity at semi-blind relays, are investigated. Based on the modified AF cooperative system model taking into account the HPA nonlinearity, the expression for the output signal-to-noise ratio (SNR) at the destination node is derived, where the interference due to both the AF relaying mechanism and the HPA nonlinearity is characterized. The performance of the AF cooperative system under study is evaluated in terms of average symbol error probability (SEP), which is derived using the moment-generating function (MGF) approach, considering transmissions over Nakagami-m fading channels. Numerical results are provided and show the effects of some system parameters, such as the HPA parameters, numbers of relays, quadrature amplitude modulation (QAM) order, Nakagami parameters, on performance. © 2012 IEEE.

  11. Moments Based Framework for Performance Analysis of One-Way/Two-Way CSI-Assisted AF Relaying

    KAUST Repository

    Xia, Minghua

    2012-09-01

    When analyzing system performance of conventional one-way relaying or advanced two-way relaying, these two techniques are always dealt with separately and, thus, their performance cannot be compared efficiently. Moreover, for ease of mathematical tractability, channels considered in such studies are generally assumed to be subject to Rayleigh fading or to be Nakagami-$m$ channels with integer fading parameters, which is impractical in typical urban environments. In this paper, we propose a unified moments-based framework for general performance analysis of channel-state-information (CSI) assisted amplify-and-forward (AF) relaying systems. The framework is applicable to both one-way and two-way relaying over arbitrary Nakagami-$m$ fading channels, and it includes previously reported results as special cases. Specifically, the mathematical framework is firstly developed under the umbrella of the weighted harmonic mean of two Gamma-distributed variables in conjunction with the theory of Pad\\\\\\'e approximants. Then, general expressions for the received signal-to-noise ratios of the users in one-way/two-way relaying systems and the corresponding moments, moment generation function, and cumulative density function are established. Subsequently, the mathematical framework is applied to analyze, compare, and gain insights into system performance of one-way and two-way relaying techniques, in terms of outage probability, average symbol error probability, and achievable data rate. All analytical results are corroborated by simulation results as well as previously reported results whenever available, and they are shown to be efficient tools to evaluate and compare system performance of one-way and two-way relaying.

  12. Torch Relay:Love Is Passing on

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    @@ May is not an ordinary month for the whole China, as the 8.0-magnitude earthquake hit sonthwest of China and shocked thc whole nation. And now, the torch relay in China is endowed with more responsibility and significance: to pass on the passion, also the compassion. No matter the torch relay is paused or going on, Olym-pic spirit is passing on. So is the love.

  13. Dual-Hop VLC/RF Transmission System with Energy Harvesting Relay under Delay Constraint

    KAUST Repository

    Rakia, Tamer

    2017-02-09

    In this paper, we introduce a dual-hop visible light communication (VLC) / radio frequency (RF) transmission system to extend the coverage of indoor VLC systems. The relay between the two hops is able to harvest light energy from different artificial light sources and sunlight entering the room. The relay receives data packet over a VLC channel and uses the harvested energy to retransmit it to a mobile terminal over an RF channel. We develop a novel statistical model for the harvested electrical power and analyze the probability of data packet loss. We define a system design parameter (α ∈ [0, 1)) that controls the time dedicated for excess energy harvesting and data packet retransmission. It was found that the parameter has an optimal value which minimizes the packet loss probability. Further more, this optimal value is independent of the RF channel path loss. However, optimal showed inverse dependence on the packet size.

  14. Outage Performance of Decode-and-Forward in Two-Way Relaying with Outdated CSI

    KAUST Repository

    Hyadi, Amal

    2015-01-07

    In this paper, we analyze the outage behavior of decode-and-forward relaying in the context of selective two-way cooperative systems. First, a new relay selection metric is proposed to take into consideration both transmission rates and instantaneous link conditions between cooperating nodes. Afterwards, the outage probability of the proposed system is derived for Nakagami-m fading channels in the case when perfect channel state information is available and then extended to the more realistic scenario where the available channel state information (CSI) is outdated due to fast fading. New expressions for the outage probability are obtained, and the impact of imperfect CSI on the performance is evaluated. Illustrative numerical results, Monte Carlo simulations, and comparisons with similar approaches are presented to assess the accuracy of our analytical derivations and confirm the performance gain of the proposed scheme.

  15. Relay Runners Catch The Rays

    CERN Multimedia

    2004-01-01

    Athletes sizzled around CERN on Wednesday 19 May at the 34th annual relay race. On one of the warmest days of the year so far, sunkissed competitors ran for the finish line and then straight for the drinks table. The Shabbys were on fire again, hurtling across the line first in a time of 10 min. 42.6 sec. and making an even stronger claim to being hailed as the traditional winners of the race with their fourth triumph in a row. Also on form were the Lynx Runners who won the Veteran's trophy, continuing their winning ways since 2002 and placing 29th overall. Ildefons Magrans of the ALICE Quarks on the Loose team ran the fastest 1000m in a time of 2 min. 47 sec. Second-placed Charmilles Technologies won the Open category in a time of 11 min. 03 sec., taking the prize for teams whose members work in different departments or who come from outside CERN. The OPALadies won the women's trophy and placed 48th. With 9 trophies up for grabs, more than 300 people in 55 teams ran the fun run, covering distances of 1000m ...

  16. Data Relay Board with Protocol for High-Speed, Free-Space Optical Communications

    Science.gov (United States)

    Wright, Malcolm; Clare, Loren; Gould, Gary; Pedyash, Maxim

    2004-01-01

    In a free-space optical communication system, the mitigation of transient outages through the incorporation of error-control methods is of particular concern, the outages being caused by scintillation fades and obscurants. The focus of this innovative technology is the development of a data relay system for a reliable high-data-rate free-spacebased optical-transport network. The data relay boards will establish the link, maintain synchronous connection, group the data into frames, and provide for automatic retransmission (ARQ) of lost or erred frames. A certain Quality of Service (QoS) can then be ensured, compatible with the required data rate. The protocol to be used by the data relay system is based on the draft CCSDS standard data-link protocol Proximity-1, selected by orbiters to multiple lander assets in the Mars network, for example. In addition to providing data-link protocol capabilities for the free-space optical link and buffering the data, the data relay system will interface directly with user applications over Gigabit Ethernet and/or with highspeed storage resources via Fibre Channel. The hardware implementation is built on a network-processor-based architecture. This technology combines the power of a hardware switch capable of data switching and packet routing at Gbps rates, with the flexibility of a software- driven processor that can host highly adaptive and reconfigurable protocols used, for example, in wireless local-area networks (LANs). The system will be implemented in a modular multi-board fashion. The main hardware elements of the data relay system are the new data relay board developed by Rockwell Scientific, a COTS Gigabit Ethernet board for user interface, and a COTS Fibre Channel board that connects to local storage. The boards reside in a cPCI back plane, and can be housed in a VME-type enclosure.

  17. Broadcast Reserved Opportunity Assisted Diversity Relaying Scheme and Its Performance Evaluation

    Directory of Open Access Journals (Sweden)

    Xia Chen

    2008-05-01

    Full Text Available Relay-based transmission can over the benefits in terms of coverage extension as well as throughput improvement if compared to conventional direct transmission. In a relay enhanced cellular (REC network, where multiple mobile terminals act as relaying nodes (RNs, multiuser diversity gain can be exploited. We propose an efficient relaying scheme, referred to as Broadcast Reserved Opportunity Assisted Diversity (BROAD for the REC networks. Unlike the conventional Induced Multiuser Diversity Relaying (IMDR scheme, our scheme acquires channel quality information (CQI in which the destined node (DN sends pilots on a reserved radio resource. The BROAD scheme can significantly decrease the signaling overhead among the mobile RNs while achieving the same multiuser diversity as the conventional IMDR scheme. In addition, an alternative version of the BROAD scheme, named as A-BROAD scheme, is proposed also, in which the candidate RN(s feed back partial or full CQI to the base station (BS for further scheduling purpose. The A-BROAD scheme achieves a higher throughput than the BROAD scheme at the cost of extra signalling overhead. The theoretical analysis given in this paper demonstrates the feasibility of the schemes in terms of their multiuser diversity gains in a REC network.

  18. RoCoMAR: Robots’ Controllable Mobility Aided Routing and Relay Architecture for Mobile Sensor Networks

    Directory of Open Access Journals (Sweden)

    Seokhoon Yoon

    2013-07-01

    Full Text Available In a practical deployment, mobile sensor network (MSN suffers from a low performance due to high node mobility, time-varying wireless channel properties, and obstacles between communicating nodes. In order to tackle the problem of low network performance and provide a desired end-to-end data transfer quality, in this paper we propose a novel ad hoc routing and relaying architecture, namely RoCoMAR (Robots’ Controllable Mobility Aided Routing that uses robotic nodes’ controllable mobility. RoCoMAR repeatedly performs link reinforcement process with the objective of maximizing the network throughput, in which the link with the lowest quality on the path is identified and replaced with high quality links by placing a robotic node as a relay at an optimal position. The robotic node resigns as a relay if the objective is achieved or no more gain can be obtained with a new relay. Once placed as a relay, the robotic node performs adaptive link maintenance by adjusting its position according to the movements of regular nodes. The simulation results show that RoCoMAR outperforms existing ad hoc routing protocols for MSN in terms of network throughput and end-to-end delay.

  19. Exploring Relay Cooperation for Secure and Reliable Transmission in Two-HopWireless Networks

    Directory of Open Access Journals (Sweden)

    Yulong Shen

    2014-03-01

    Full Text Available This work considers the problem of secure and reliable information transmission via relay cooperation in two-hop relay wireless networks without the information of both eavesdropper channels and locations. While previous work on this problem mainly studied infinite networks and their asymptotic behavior and scaling law results, this papers focuses on a more practical network with finite number of system nodes and explores the corresponding exact result on the number of eavesdroppers one network can tolerate to ensure desired secrecy and reliability. We first study the scenario where path-loss is equal between all pairs of nodes and consider two transmission protocols there, one adopts an optimal but complex relay selection process with less load balance capacity while the other adopts a random but simple relay selection process with good load balance capacity. Theoretical analysis and numerical results are then provided to determine the maximum number of eavesdroppers one network can tolerate to ensure a desired performance in terms of the secrecy outage probability and transmission outage probability. We further extend our study to the more general scenario where path-loss between each pair of nodes also depends on the distance between them, for which a new transmission protocol with both preferable relay selection and good load balance as well as the corresponding theoretical analysis and numerical results are presented.

  20. Multi-Destination Cognitive Radio Relay Network with SWIPT and Multiple Primary Receivers

    KAUST Repository

    Al-Habob, Ahmed A.

    2017-05-12

    In this paper, we study the performance of simultaneous wireless information and power transfer (SWIPT) technique in a multi-destination dual-hop underlay cognitive relay network with multiple primary receivers. Information transmission from the secondary source to destinations is performed entirely via a decode- and-forward (DF) relay. The relay is assumed to have no embedded power source and to harvest energy from the source signal using a power splitting (PS) protocol and employing opportunistic scheduling to forward the information to the selected destination. We derive analytical expressions for the outage probability assuming Rayleigh fading channels and considering the energy harvesting efficiency at relay, the source maximum transmit power and primary receivers interference constraints. The system performance is also studied at high signal-to-noise ratio (SNR) values where approximate expressions for the outage probability are provided and analyzed in terms of diversity order and coding gain. Monte-Carlo simulations and some numerical examples are provided to validate the derived expressions and to illustrate the effect of various system parameters on the system performance. In contrast to their conventional counterparts where a multi- destination diversity is usually achieved, the results show that the multi-destination cognitive radio relay networks with the SWIPT technique achieve a constant diversity order of one.

  1. Ergodic Capacity Analysis of Multiple Input Multiple Output Systems with Dual Hop Amplify and Forward Relay Networks

    Directory of Open Access Journals (Sweden)

    C. Poongodi

    2011-01-01

    Full Text Available Problem Statement: In MIMO system, capacity mainly depends on the channel and the antenna characteristics. The capacity can be improved by proper design of antenna elements and choosing appropriate array configuration and the directive elements give more capacity than omni directional elements. The dual polarized antennas are better than single polarized antennas as the former can provide two information channels. The mutual coupling also changes the capacity considerably. When the spacing between the elements is less than 0.5λ, the effect of mutual coupling is more. Approach: This study analyzes the capacity of Echelon, H-shaped; V-shaped free standing dipoles and printed dipole arrays of a MIMO system. The channel model for multi-polarized antennas is used in the simulations. The mutual coupling between the dipoles of different orientations is also included to make simulation more realistic. MIMO system with relay network is used to improve the coverage and reliability and to reduce the interference in wireless network. So we have analyzed the characterization of the ergodic capacity of amplify-and-forward (AF MIMO dual-hop relay channels, assuming that the channel state information is available at the destination terminal only. Results: This study presents the results for channel capacity for different antenna configuration and the exact Ergodic capacity, closed form expression for the high SNR regime and tight closed form upper and lower bounds for amplify and forward relay system using the probability density function of an unordered eigenvalues. Conclusion/Recommendations: The Echelon, H-shaped; V-shaped free standing dipoles offer better capacity results in conventional MIMO system. The results produced are valid for all SNR values and for arbitrary numbers of antennas at the source, relay and destination. We also demonstrate a relationship between the conventional point-to-point MIMO Channels and dual-hop AF MIMO relay channel.

  2. COOPERATIVE ARQ PROTOCOL FOR CORRELATED WIRELESS CHANNELS

    Institute of Scientific and Technical Information of China (English)

    Yu Guanding; Zhang Zhaoyang; Qiu Peiliang

    2006-01-01

    A novel Automatic repeat ReQuest (ARQ) protocol called cooperative ARQ is presented in this letter, where a relay terminal is requested to retransmit an erroneously received packet, instead of the source terminal. The data link layer Packet Error Rate (PER) performance of cooperative ARQ is derived in correlated wireless channel. The results show that even though the relay-destination channel is worse than the sourcedestination channel, the new protocol outperforms the traditional one as long as the average SNR of the relaydestination channel is better than a certain threshold. It is also demonstrated that a second order diversity gain can be achieved with the cooperative ARQ protocol.

  3. Coordinated Direct and Relay Transmission with Linear Non-Regenerative Relay Beamforming

    DEFF Research Database (Denmark)

    Sun, Fan; De Carvalho, Elisabeth; Popovski, Petar;

    2012-01-01

    Joint processing of multiple communication flows in wireless systems has given rise to a number of novel transmission techniques, notably the two-way relaying, but also more general traffic scenarios, such as coordinated direct and relay (CDR) transmissions. In a CDR scheme the relay has a central...... role in managing the interference and boosting the overall system performance. In this letter we consider the case in which an amplify-and-forward relay has multiple antennas and can use beamforming to support the coordinated transmissions. We focus on one representative traffic type with one uplink...... user and one downlink user. Two different criteria for relay beamforming are analyzed: maximal weighted sum-rate and maximization of the worst-case weighted SNR. We propose iterative optimal solutions, as well as low-complexity near-optimal solutions....

  4. A genetic algorithm for multiple relay selection in two-way relaying cognitive radio networks

    KAUST Repository

    Alsharoa, Ahmad M.

    2013-09-01

    In this paper, we investigate a multiple relay selection scheme for two-way relaying cognitive radio networks where primary users and secondary users operate on the same frequency band. More specifically, cooperative relays using Amplifyand- Forward (AF) protocol are optimally selected to maximize the sum rate of the secondary users without degrading the Quality of Service (QoS) of the primary users by respecting a tolerated interference threshold. A strong optimization tool based on genetic algorithm is employed to solve our formulated optimization problem where discrete relay power levels are considered. Our simulation results show that the practical heuristic approach achieves almost the same performance of the optimal multiple relay selection scheme either with discrete or continuous power distributions. Copyright © 2013 by the Institute of Electrical and Electronic Engineers, Inc.

  5. Cooperative AF Relaying in Spectrum-Sharing Systems: Performance Analysis under Average Interference Power Constraints and Nakagami-m Fading

    KAUST Repository

    Xia, Minghua

    2012-06-01

    Since the electromagnetic spectrum resource becomes more and more scarce, improving spectral efficiency is extremely important for the sustainable development of wireless communication systems and services. Integrating cooperative relaying techniques into spectrum-sharing cognitive radio systems sheds new light on higher spectral efficiency. In this paper, we analyze the end-to-end performance of cooperative amplify-and-forward (AF) relaying in spectrum-sharing systems. In order to achieve the optimal end-to-end performance, the transmit powers of the secondary source and the relays are optimized with respect to average interference power constraints at primary users and Nakagami-$m$ fading parameters of interference channels (for mathematical tractability, the desired channels from secondary source to relay and from relay to secondary destination are assumed to be subject to Rayleigh fading). Also, both partial and opportunistic relay-selection strategies are exploited to further enhance system performance. Based on the exact distribution functions of the end-to-end signal-to-noise ratio (SNR) obtained herein, the outage probability, average symbol error probability, diversity order, and ergodic capacity of the system under study are analytically investigated. Our results show that system performance is dominated by the resource constraints and it improves slowly with increasing average SNR. Furthermore, larger Nakagami-m fading parameter on interference channels deteriorates system performance slightly. On the other hand, when interference power constraints are stringent, opportunistic relay selection can be exploited to improve system performance significantly. All analytical results are corroborated by simulation results and they are shown to be efficient tools for exact evaluation of system performance.

  6. On Multi-Hop Decode-and-Forward Cooperative Relaying for Industrial Wireless Sensor Networks.

    Science.gov (United States)

    Ai, Yun; Cheffena, Michael

    2017-03-28

    Wireless sensor networks (WSNs) will play a fundamental role in the realization of Internet of Things and Industry 4.0. Arising from the presence of spatially distributed sensor nodes in a sensor network, cooperative diversity can be achieved by using the sensor nodes between a given source-destination pair as intermediate relay stations. In this paper, we investigate the end-to-end average bit error rate (BER) and the channel capacity of a multi-hop relay network in the presence of impulsive noise modeled by the well-known Middleton's class-A model. Specifically, we consider a multi-hop decode-and-forward (DF) relay network over Nakagami-m fading channel due to its generality, but also due to the absence of reported works in this area. Closed-form analytical expressions for the end-to-end average BER and the statistical properties of the end-to-end channel capacity are obtained. The impacts of the channel parameters on these performance quantities are evaluated and discussed.

  7. Non-Markovian Reactivation of Quantum Relays

    CERN Document Server

    Pirandola, Stefano; Jacobsen, Christian S; Spedalieri, Gaetana; Braunstein, Samuel L; Gehring, Tobias; Andersen, Ulrik L

    2015-01-01

    We consider a quantum relay which is used by two parties to perform several continuous-variable protocols: Entanglement swapping, distillation, quantum teleportation, and quantum key distribution. The theory of these protocols is extended to a non-Markovian model of decoherence characterized by correlated Gaussian noise. Even if bipartite entanglement is completely lost at the relay, we show that the various protocols can progressively be reactivated by the separable noise-correlations of the environment. In fact, above a critical amount, these correlations are able to restore the distribution of quadripartite entanglement, which can be localized into an exploitable bipartite form by the action of the relay. Our findings are confirmed by a proof-of-principle experiment and show the potential advantages of non-Markovian effects in a quantum network architecture.

  8. PSMG sets A and B protective relaying

    Energy Technology Data Exchange (ETDEWEB)

    Burnett, J.E.

    1978-07-24

    The ''TAN/LOFT 13.8 kV, 2.4 kV, and 480 V Relay and Circuit Breaker Coordination Study'' presented an analysis to determine overcurrent settings for the LOFT Power System protective relays including those for the drive motors of the PSMG sets. This LTR is written to form the basis of the relay settings entered in Specification ES-60238 Rev. B, for protection of the PSMG generator, primary coolant pump motor and interconnecting power cable. A momentary commercial power voltage dip occurred on January 10, 1978 which caused a trip of the PSMG field breakers. A corrective design to prevent reoccurrence is discussed and recommendations are presented.

  9. Relay Assisted F/TDMA Ad Hoc Networks: Node Classification, Power Allocation and Relaying Strategies

    CERN Document Server

    Serbetli, Semih

    2007-01-01

    This paper considers the design of relay assisted F/TDMA ad hoc networks with multiple relay nodes each of which assists the transmission of a predefined subset of source nodes to their respective destinations. Considering the sum capacity as the performance metric, we solve the problem of optimally allocating the total power of each relay node between the transmissions it is assisting. We consider four different relay transmission strategies, namely regenerative decode-and-forward (RDF), nonregenerative decode-and-forward (NDF), amplify-and-forward (AF) and compress-and-forward (CF). We first obtain the optimum power allocation policies for the relay nodes that employ a uniform relaying strategy for all nodes. We show that the optimum power allocation for the RDF and NDF cases are modified water-filling solutions. We observe that for a given relay transmit power, NDF always outperforms RDF whereas CF always provides higher sum capacity than AF. When CF and NDF are compared, it is observed that either of CF o...

  10. Multiantenna relay beamforming design for QoS discrimination in two-way relay networks.

    Science.gov (United States)

    Xiong, Ke; Zhang, Yu; Li, Dandan; Chang, Chih-Yung; Zhong, Zhangdui

    2013-01-01

    This paper investigates the relay beamforming design for quality of service (QoS) discrimination in two-way relay networks. The purpose is to keep legitimate two-way relay users exchange their information via a helping multiantenna relay with QoS guarantee while avoiding the exchanged information overhearing by unauthorized receiver. To this end, we propose a physical layer method, where the relay beamforming is jointly designed with artificial noise (AN) which is used to interfere in the unauthorized user's reception. We formulate the joint beamforming and AN (BFA) design into an optimization problem such that the received signal-to-interference-ratio (SINR) at the two legitimate users is over a predefined QoS threshold while limiting the received SINR at the unauthorized user which is under a certain secure threshold. The objective of the optimization problem is to seek the optimal AN and beamforming vectors to minimize the total power consumed by the relay node. Since the optimization problem is nonconvex, we solve it by using semidefinite program (SDP) relaxation. For comparison, we also study the optimal relay beamforming without using AN (BFO) under the same QoS discrimination constraints. Simulation results show that both the proposed BFA and BFO can achieve the QoS discrimination of the two-way transmission. However, the proposed BFA yields significant power savings and lower infeasible rates compared with the BFO method.

  11. Performance Analysis of Secondary Link with Cross-Layer Design and Cooperative Relay in Cognitive Radio Networks

    KAUST Repository

    Ma, Hao

    2012-06-01

    In this thesis, we investigate two different system infrastructures in underlay cognitive radio network, in which two popular techniques, cross-layer design and cooperative communication, are considered, respectively. In particular, we introduce the Aggressive Adaptive Modulation and Coding (A-AMC) into the cross-layer design and achieve the optimal boundary points in closed form to choose the AMC and A-AMC transmission modes by taking into account the Channel State Information (CSI) from the secondary transmitter to both the primary receiver and the secondary receiver. What’s more, for the cooperative communication design, we consider three different relay selection schemes: Partial Relay Selection, Opportunistic Relay Selection and Threshold Relay Selection. The Probability Density Functions (PDFs) of the Signal-to- Noise Ratio (SNR) in each hop for different selection schemes are provided, and then the exact closed-form expressions for the end-to-end packet loss rate in the secondary link considering the cooperation of the Decode-and-Forward (DF) relay for different relay selection schemes are derived.

  12. CERN Relay Race: information for drivers

    CERN Multimedia

    2012-01-01

    The CERN relay race will take place around the Meyrin site on Thursday, 24 May starting at 12.15. If possible, please avoid driving on the site during this 20-minute period. If you do meet runners while driving your car, please STOP until they have all passed. In addition, there will be a Nordic Walking event which will finish around 12.50. This should not block the roads, but please drive carefully during this time. Thank you for your cooperation. Details on how to register your team for the relay race can be found here.

  13. Joint Robust Weighted LMMSE Transceiver Design for Dual-Hop AF Multiple-Antenna Relay Systems

    CERN Document Server

    Xing, Chengwen; Fei, Zesong; Wu, Yik-Chung; Kuang, Jingming

    2012-01-01

    In this paper, joint transceiver design for dual-hop amplify-and-forward (AF) MIMO relay systems with Gaussian distributed channel estimation errors in both two hops is investigated. Due to the fact that various linear transceiver designs can be transformed to a weighted linear minimum mean-square-error (LMMSE) transceiver design with specific weighting matrices, weighted mean square error (MSE) is chosen as the performance metric. Precoder matrix at source, forwarding matrix at relay and equalizer matrix at destination are jointly designed with channel estimation errors taken care of by Bayesian philosophy. Several existing algorithms are found to be special cases of the proposed solution. The performance advantage of the proposed robust design is demonstrated by the simulation results.

  14. Robust Transceiver with Tomlinson-Harashima Precoding for Amplify-and-Forward MIMO Relaying Systems

    CERN Document Server

    Xing, Chengwen; Gao, Feifei; Wu, Yik-Chung

    2011-01-01

    In this paper, robust transceiver design with Tomlinson-Harashima precoding (THP) for multi-hop amplify-and-forward (AF) multiple-input multiple-output (MIMO) relaying systems is investigated. At source node, THP is adopted to mitigate the spatial intersymbol interference. However, due to its nonlinear nature, THP is very sensitive to channel estimation errors. In order to reduce the effects of channel estimation errors, a joint Bayesian robust design of THP at source, linear forwarding matrices at relays and linear equalizer at destination is proposed. With novel applications of elegant characteristics of multiplicative convexity and matrix-monotone functions, the optimal structure of the nonlinear transceiver is first derived. Based on the derived structure, the transceiver design problem reduces to a much simpler one with only scalar variables which can be efficiently solved. Finally, the performance advantage of the proposed robust design over non-robust design is demonstrated by simulation results.

  15. Robust Transceiver with Tomlinson-Harashima Precoding for Amplify-and-Forward MIMO Relaying Systems

    KAUST Repository

    Xing, Chengwen

    2012-09-01

    In this paper, robust transceiver design with Tomlinson-Harashima precoding (THP) for multi-hop amplifyand-forward (AF) multiple-input multiple-output (MIMO) relaying systems is investigated. At source node, THP is adopted to mitigate the spatial intersymbol interference. However, due to its nonlinear nature, THP is very sensitive to channel estimationerrors. In order to reduce the effects of channel estimation errors, a joint Bayesian robust design of THP at source, linear forwarding matrices at relays and linear equalizer at destination is proposed. With novel applications of elegant characteristics of multiplicative convexity and matrix-monotone functions, the optimal structure of the nonlinear transceiver is first derived. Based on the derived structure, the transceiver design problem reduces to a much simpler one with only scalar variables which can be efficiently solved. Finally, the performance advantage of the proposed robust design over non-robust design is demonstrated by simulation results.

  16. Towards increasing diversity for the relaying of LT Fountain Codes in Wireless Sensor Networks

    CERN Document Server

    Anya, Apavatjrut; Jaffrès-Runser, Katia; Comaniciu, Cristina; Gorce, Jean-Marie

    2010-01-01

    Diversity is a powerful means to increase the transmission performance of wireless communications. For the case of fountain codes relaying, it has been shown previously that introducing diversity is also beneficial since it counteracts transmission losses on the channel. Instead of simply hop-by-hop forwarding information, each sensor node diversifies the information flow using XOR combinations of stored packets. This approach has been shown to be efficient for random linear fountain codes. However, random linear codes exhibit high decoding complexity. In this paper, we propose diversity increased relaying strategies for the more realistic Luby Transform code in order to maintain high transmission performance with low decoding computational complexity in a linear network. Results are provided herein for a linear network assuming uniform imperfect channel states.

  17. A DISTRIBUTED COOPERATIVE RELAYING OPTIMIZATION SCHEME FOR SECONDARY TRANSMISSION IN COGNITIVE RADIO NETWORKS

    Institute of Scientific and Technical Information of China (English)

    Chen Dan; Ji Hong

    2011-01-01

    In Cognitive Radio (CR) networks,cooperative communication has been recently regarded as a key technology for improving the spectral utilization efficiency and ensuring the Quality of Service (QoS) for Primary Users (PUs).In this paper,we propose a distributed joint relay selection and power allocation scheme for cooperative secondary transmission,taking both Instantaneous Channel State Information (I-CSI) and residual energy into consideration,where secondary source and destination may have different available spectrum.Specifically,we formulate the cognitive relay network as a restless bandit system,where the channel and energy state transition is characterized by the finite-state Markov chain.The proposed policy has indexability property that dramatically reduces the computation and implementation complexity.Analytical and simulation results demonstrate that our proposed scheme can efficiently enhance overall system reward,while guaranteeing a good tradeoff between achievable date rate and average network lifetime.

  18. Advanced Strategic and Tactical Relay Request Management for the Mars Relay Operations Service

    Science.gov (United States)

    Allard, Daniel A.; Wallick, Michael N.; Gladden, Roy E.; Wang, Paul; Hy, Franklin H.

    2013-01-01

    This software provides a new set of capabilities for the Mars Relay Operations Service (MaROS) in support of Strategic and Tactical relay, including a highly interactive relay request Web user interface, mission control over relay planning time periods, and mission management of allowed strategic vs. tactical request parameters. Together, these new capabilities expand the scope of the system to include all elements critical for Tactical relay operations. Planning of replay activities spans a time period that is split into two distinct phases. The first phase is called Strategic, which begins at the time that relay opportunities are identified, and concludes at the point that the orbiter generates the flight sequences for on board execution. Any relay request changes from this point on are called Tactical. Tactical requests, otherwise called Orbit - er Relay State Changes (ORSC), are highly restricted in terms of what types of changes can be made, and the types of parameters that can be changed may differ from one orbiter to the next. For example, one orbiter may be able to delay the start of a relay request, while another may not. The legacy approach to ORSC management involves exchanges of e-mail with "requests for change" and "acknowledgement of approval," with no other tracking of changes outside of e-mail folders. MaROS Phases 1 and 2 provided the infrastructure for strategic relay for all supported missions. This new version, 3.0, introduces several capabilities that fully expand the scope of the system to include tactical relay. One new feature allows orbiter users to manage and "lock" Planning Periods, which allows the orbiter team to formalize the changeover from Strategic to Tactical operations. Another major feature allows users to interactively submit tactical request changes via a Web user interface. A third new feature allows orbiter missions to specify allowed tactical updates, which are automatically incorporated into the tactical change process

  19. 76 FR 72124 - Internet-Based Telecommunications Relay Service Numbering

    Science.gov (United States)

    2011-11-22

    ...] Internet-Based Telecommunications Relay Service Numbering AGENCY: Federal Communications Commission. ACTION... collection associated with the Commission's Internet- Based Telecommunications Relay Service Numbering... notice as an announcement of the effective date of the rules. See Internet-Based Telecommunications...

  20. Dynamic Relaying in 3GPP LTE-Advanced Networks

    Directory of Open Access Journals (Sweden)

    Van Phan Vinh

    2009-01-01

    Full Text Available Relaying is one of the proposed technologies for LTE-Advanced networks. In order to enable a flexible and reliable relaying support, the currently adopted architectural structure of LTE networks has to be modified. In this paper, we extend the LTE architecture to enable dynamic relaying, while maintaining backward compatibility with LTE Release 8 user equipments, and without limiting the flexibility and reliability expected from relaying. With dynamic relaying, relays can be associated with base stations on a need basis rather than in a fixed manner which is based only on initial radio planning. Proposals are also given on how to further improve a relay enhanced LTE network by enabling multiple interfaces between the relay nodes and their controlling base stations, which can possibly be based on technologies different from LTE, so that load balancing can be realized. This load balancing can be either between different base stations or even between different networks.

  1. Slepian-Wolf Coding Over Cooperative Relay Networks

    CERN Document Server

    Yassaee, Mohammad Hossein

    2009-01-01

    This paper deals with the problem of multicasting a set of discrete memoryless correlated sources (DMCS) over a cooperative relay network. Necessary conditions with cut-set interpretation are presented. A \\emph{Joint source-Wyner-Ziv encoding/sliding window decoding} scheme is proposed, in which decoding at each receiver is done with respect to an ordered partition of other nodes. For each ordered partition a set of feasibility constraints are derived. Then, utilizing sub-modular property of entropy function and a novel geometrical approach, the results of different ordered partitions are consolidated, which lead sufficient conditions for our problem. The proposed scheme achieves operational separation between source coding and channel coding. It is shown that sufficient conditions are indeed necessary conditions in two special cooperative networks, namely, Aref network and finite-field deterministic network. Also, in Gaussian cooperative networks, it is shown that reliable transmission of all DMCS whose Slep...

  2. EFFECTS OF THE NUMBER OF RELAY ANTENNAS AND RELAY-POWER ON MIMO PRECODED TWO-WAY RELAYING

    Directory of Open Access Journals (Sweden)

    S.S. Rajeshwari

    2011-06-01

    Full Text Available In this treatise a two-way Amplify and Forward (AF relay-aided system is considered, which employs the so-called Arithmetic Sum of Average Bit Error Rate (ASABER based MIMO precoding technique. The two-way AF relay system is comprised of the pair of transceiver nodes S1 and S2, and the Relay Node (RN R, where each node is equipped with N1, N2 and Nr antennas, respectively. We study the effects of varying Nr for fixed values of N1 and N2, and as well as the effects of having a fixed transmission power at the RN on the achievable ASABER performance. Based on our intensive simulation campaign, we infer that the attainable diversity order is increased approximately by Nr − min (N1, N2, whenever Nr assumes a value higher than min (N1, N2 for fixed N1, N2 values. However, this is observation is only valid for relay power pr ≥ (p1, p2, where p1 and p2 are the transmit power constraints imposed on the sources S1 and S2, respectively. We also observe that the ASABER MIMO precoder’s BER curve exhibits an error floor for pr ≤ (p1, p2.

  3. End-to-end performance of cooperative relaying in spectrum-sharing systems with quality of service requirements

    KAUST Repository

    Asghari, Vahid Reza

    2011-07-01

    We propose adopting a cooperative relaying technique in spectrum-sharing cognitive radio (CR) systems to more effectively and efficiently utilize available transmission resources, such as power, rate, and bandwidth, while adhering to the quality of service (QoS) requirements of the licensed (primary) users of the shared spectrum band. In particular, we first consider that the cognitive (secondary) user\\'s communication is assisted by an intermediate relay that implements the decode-and-forward (DF) technique onto the secondary user\\'s relayed signal to help with communication between the corresponding source and the destination nodes. In this context, we obtain first-order statistics pertaining to the first- and second-hop transmission channels, and then, we investigate the end-to-end performance of the proposed spectrum-sharing cooperative relaying system under resource constraints defined to assure that the primary QoS is unaffected. Specifically, we investigate the overall average bit error rate (BER), ergodic capacity, and outage probability of the secondary\\'s communication subject to appropriate constraints on the interference power at the primary receivers. We then consider a general scenario where a cluster of relays is available between the secondary source and destination nodes. In this case, making use of the partial relay selection method, we generalize our results for the single-relay scheme and obtain the end-to-end performance of the cooperative spectrum-sharing system with a cluster of L available relays. Finally, we examine our theoretical results through simulations and comparisons, illustrating the overall performance of the proposed spectrum-sharing cooperative system and quantify its advantages for different operating scenarios and conditions. © 2011 IEEE.

  4. Cyber and electromagnetic threats in modern relay protection

    CERN Document Server

    Gurevich, Vladimir

    2014-01-01

    PrefaceAbstractAuthorTechnological Advance in Relay Protection: Dangerous TendenciesIssues of Philosophy in Relay ProtectionExtrusion into the Historical DomainAbout Technological AdvanceSmart Grid: One More Dangerous Vector of the ""Technological Advantages"" in Power IndustrySmart Grid Russian StyleSmart Grid: Western StyleDangerous Tendencies in the Development of the Relay ProtectionWhat to Do?ReferencesNatural Electromagnetic Effects on Digital Protective RelaysElectro

  5. The Two Way Wiretap Channel: Theory and Practice

    CERN Document Server

    Gamal, Aly El; Youssef, Moustafa; Gamal, Hesham El

    2010-01-01

    This work considers the two way wiretap channel in which two legitimate users, Alice and Bob, wish to exchange messages securely in the presence of a passive eavesdropper Eve. In the full duplex scenario, where each node can transmit and receive simultaneously, we obtain new achievable secrecy rate regions based on the idea of allowing the two users to jointly optimize their channel prefixing distributions and binning codebooks; in addition to key sharing. The new regions are shown to be strictly larger than the known ones for a wide class of discrete memoryless and Gaussian channels. In the half duplex case, where a user can only transmit or receive on any given degree of freedom, we introduce the idea of randomized scheduling and establish the significant gain it offers in terms of the achievable secrecy sum-rate. We further develop an experimental setup based on a IEEE 802.15.4-enabled sensor boards to validate our theoretical analysis. Using this testbed, it is shown that one can exploit the two way natur...

  6. BER and optimal power allocation for amplify-and-forward relaying using pilot-aided maximum likelihood estimation

    KAUST Repository

    Wang, Kezhi

    2014-10-01

    Bit error rate (BER) and outage probability for amplify-and-forward (AF) relaying systems with two different channel estimation methods, disintegrated channel estimation and cascaded channel estimation, using pilot-aided maximum likelihood method in slowly fading Rayleigh channels are derived. Based on the BERs, the optimal values of pilot power under the total transmitting power constraints at the source and the optimal values of pilot power under the total transmitting power constraints at the relay are obtained, separately. Moreover, the optimal power allocation between the pilot power at the source, the pilot power at the relay, the data power at the source and the data power at the relay are obtained when their total transmitting power is fixed. Numerical results show that the derived BER expressions match with the simulation results. They also show that the proposed systems with optimal power allocation outperform the conventional systems without power allocation under the same other conditions. In some cases, the gain could be as large as several dB\\'s in effective signal-to-noise ratio.

  7. Enhancing the efficiency of constrained dual-hop variable-gain AF relaying under nakagami-m fading

    KAUST Repository

    Zafar, Ammar

    2014-07-01

    This paper studies power allocation for performance constrained dual-hop variable-gain amplify-and-forward (AF) relay networks in Nakagami- $m$ fading. In this context, the performance constraint is formulated as a constraint on the end-to-end signal-to-noise-ratio (SNR) and the overall power consumed is minimized while maintaining this constraint. This problem is considered under two different assumptions of the available channel state information (CSI) at the relays, namely full CSI at the relays and partial CSI at the relays. In addition to the power minimization problem, we also consider the end-to-end SNR maximization problem under a total power constraint for the partial CSI case. We provide closed-form solutions for all the problems which are easy to implement except in two cases, namely selective relaying with partial CSI for power minimization and SNR maximization, where we give the solution in the form of a one-variable equation which can be solved efficiently. Numerical results are then provided to characterize the performance of the proposed power allocation algorithms considering the effects of channel parameters and CSI availability. © 2014 IEEE.

  8. Security-Reliability Trade-Off Analysis for Multiuser SIMO Mixed RF/FSO Relay Networks With Opportunistic User Scheduling

    KAUST Repository

    El-Malek, Ahmed H. Abd

    2016-05-24

    In this paper, we study the performance of multiuser single-input multiple-output mixed radio frequency (RF)/free space optical (FSO) relay network with opportunistic user scheduling. The considered system includes multiple users, one amplify-and-forward relay, one destination, and a multiple-antenna eavesdropper. The users are connected with the relay node through RF links and the relay is connected with the destination through an FSO link. Both maximum ratio combining and selection combining schemes are used at the multiple-antenna relay to combine the signal received from the best user on different antennas. The RF/FSO channels models are assumed to follow Nakagami-m/gamma-gamma fading models with pointing errors. Closed-form expressions are derived for the outage probability, average symbol error probability, and ergodic channel capacity. Then, the power of the selected best user is determined to minimize the system asymptotic outage probability under the dominant RF or FSO link. Then, the considered system secrecy performance is investigated, where the closed-form expressions for the intercept probability are derived. Finally, we propose a new cooperative jamming model in which the worst user is selected by the authorized system to jam the existing eavesdropper. Monte-Carlo simulations are provided to validate the achieved exact and asymptotic results.

  9. Dynamic Relaying in 3GPP LTE-Advanced Networks

    DEFF Research Database (Denmark)

    Teyeb, Oumer Mohammed; Van Phan, Vinh; Redana, Simone

    2009-01-01

    Relaying is one of the proposed technologies for LTE-Advanced networks. In order to enable a flexible and reliable relaying support, the currently adopted architectural structure of LTE networks has to be modified. In this paper, we extend the LTE architecture to enable dynamic relaying, while ma...

  10. 76 FR 58412 - Relay Services for Deaf-Blind Individuals

    Science.gov (United States)

    2011-09-21

    ... COMMISSION 47 CFR Part 64 Relay Services for Deaf-Blind Individuals AGENCY: Federal Communications Commission... Communications and Video Accessibility Act of 2010, Section 105, Relay Services for Deaf-Blind Individuals...-First Century Communications and Video Accessibility Act of 2010, Section 105, Relay Services for...

  11. Asymmetric Modulation Gains in Network Coded Relay Networks

    DEFF Research Database (Denmark)

    Roetter, Daniel Enrique Lucani; Fitzek, Frank

    2015-01-01

    Wireless relays have usually been considered in two ways. On the one hand, a physical layer approach focused on per-packet reliability and involving the relay on each packet transmission. On the other, recent approaches have relied on the judicious activation of the relay at the network level to ...

  12. 76 FR 18490 - Contributions to the Telecommunications Relay Service Fund

    Science.gov (United States)

    2011-04-04

    ... COMMISSION 47 CFR Parts 1 and 64 Contributions to the Telecommunications Relay Service Fund AGENCY: Federal...- interconnected VoIP service to participate in and contribute to the Telecommunications Relay Services (TRS) Fund... summary of the Commission's Contributions to the Telecommunications Relay Service Fund, Notice of...

  13. 76 FR 65965 - Contributions to the Telecommunications Relay Services Fund

    Science.gov (United States)

    2011-10-25

    ... COMMISSION 47 CFR Parts 1 and 64 Contributions to the Telecommunications Relay Services Fund AGENCY: Federal... contributing to the interstate Telecommunications Relay Services (TRS) Fund in a manner prescribed by... to the Telecommunications Relay Service Fund, Report and Order (Order), document FCC 11-150,...

  14. DICOM relay over the cloud.

    Science.gov (United States)

    Silva, Luís A Bastião; Costa, Carlos; Oliveira, José Luis

    2013-05-01

    Healthcare institutions worldwide have adopted picture archiving and communication system (PACS) for enterprise access to images, relying on Digital Imaging Communication in Medicine (DICOM) standards for data exchange. However, communication over a wider domain of independent medical institutions is not well standardized. A DICOM-compliant bridge was developed for extending and sharing DICOM services across healthcare institutions without requiring complex network setups or dedicated communication channels. A set of DICOM routers interconnected through a public cloud infrastructure was implemented to support medical image exchange among institutions. Despite the advantages of cloud computing, new challenges were encountered regarding data privacy, particularly when medical data are transmitted over different domains. To address this issue, a solution was introduced by creating a ciphered data channel between the entities sharing DICOM services. Two main DICOM services were implemented in the bridge: Storage and Query/Retrieve. The performance measures demonstrated it is quite simple to exchange information and processes between several institutions. The solution can be integrated with any currently installed PACS-DICOM infrastructure. This method works transparently with well-known cloud service providers. Cloud computing was introduced to augment enterprise PACS by providing standard medical imaging services across different institutions, offering communication privacy and enabling creation of wider PACS scenarios with suitable technical solutions.

  15. Device-Relaying in Cellular D2D Networks: A Fairness Perspective

    KAUST Repository

    Chaaban, Anas

    2015-10-24

    Device-to-Device (D2D) communication is envisioned to play a key role in 5G networks as a technique for meeting the demand for high data rates. In a cellular network, D2D allows not only direct communication between users, but also device relaying. In this paper, a simple instance of device-relaying is investigated, and its impact on fairness among users is studied. Namely, a cellular network consisting of two D2D-enabled users and a base-station (BS) is considered. Thus, the users who want to establish communication with the BS can act as relays for each other’s signals. While this problem is traditionally considered in the literature as a multiple-access channel with cooperation in the uplink, and a broadcast channel with cooperation in the downlink, we propose a different treatment of the problem as a multi-way channel. A simple communication scheme is proposed, and is shown to achieve significant gain in terms of fairness (measured by the symmetric rate supported) in comparison to the aforementioned traditional treatment.

  16. Performance Analysis of Adaptive Physical Layer Network Coding for Wireless Two-way Relaying

    CERN Document Server

    Muralidharan, Vijayvaradharaj T

    2012-01-01

    The analysis of modulation schemes for the physical layer network-coded two way relaying scenario is presented which employs two phases: Multiple access (MA) phase and Broadcast (BC) phase. It was shown by Koike-Akino et. al. that adaptively changing the network coding map used at the relay according to the channel conditions greatly reduces the impact of multiple access interference which occurs at the relay during the MA phase. Depending on the signal set used at the end nodes, deep fades occur for a finite number of channel fade states referred as the singular fade states. The singular fade states fall into the following two classes: The ones which are caused due to channel outage and whose harmful effect cannot be mitigated by adaptive network coding are referred as the \\textit{non-removable singular fade states}. The ones which occur due to the choice of the signal set and whose harmful effects can be removed by a proper choice of the adaptive network coding map are referred as the \\textit{removable} sin...

  17. A low complexity algorithm for multiple relay selection in two-way relaying Cognitive Radio networks

    KAUST Repository

    Alsharoa, Ahmad M.

    2013-06-01

    In this paper, a multiple relay selection scheme for two-way relaying cognitive radio network is investigated. We consider a cooperative Cognitive Radio (CR) system with spectrum sharing scenario using Amplify-and-Forward (AF) protocol, where licensed users and unlicensed users operate on the same frequency band. The main objective is to maximize the sum rate of the unlicensed users allowed to share the spectrum with the licensed users by respecting a tolerated interference threshold. A practical low complexity heuristic approach is proposed to solve our formulated optimization problem. Selected numerical results show that the proposed algorithm reaches a performance close to the performance of the optimal multiple relay selection scheme either with discrete or continuous power distributions while providing a considerable saving in terms of computational complexity. In addition, these results show that our proposed scheme significantly outperforms the single relay selection scheme. © 2013 IEEE.

  18. Optimal relay selection and power allocation for cognitive two-way relaying networks

    KAUST Repository

    Pandarakkottilil, Ubaidulla

    2012-06-01

    In this paper, we present an optimal scheme for power allocation and relay selection in a cognitive radio network where a pair of cognitive (or secondary) transceiver nodes communicate with each other assisted by a set of cognitive two-way relays. The secondary nodes share the spectrum with a licensed primary user (PU), and each node is assumed to be equipped with a single transmit/receive antenna. The interference to the PU resulting from the transmission from the cognitive nodes is kept below a specified limit. We propose joint relay selection and optimal power allocation among the secondary user (SU) nodes achieving maximum throughput under transmit power and PU interference constraints. A closed-form solution for optimal allocation of transmit power among the SU transceivers and the SU relay is presented. Furthermore, numerical simulations and comparisons are presented to illustrate the performance of the proposed scheme. © 2012 IEEE.

  19. Cable Television Service; Cable Television Relay Service.

    Science.gov (United States)

    Federal Register, 1972

    1972-01-01

    The rules and regulations of the Federal Communications Commission (FCC) concerning cable television service and cable relay service are presented along with the comments of the National Cable Television Association, the National Association of Broadcasters, the Association of Maximum Service Telecasters, and a major group of program suppliers.…

  20. Relay Feedback Analysis for Double Integral Plants

    Directory of Open Access Journals (Sweden)

    Zhen Ye

    2011-01-01

    Full Text Available Double integral plants under relay feedback are studied. Complete results on the uniqueness of solutions, existence, and stability of the limit cycles are established using the point transformation method. Analytical expressions are also given for determining the amplitude and period of a limit cycle from the plant parameters.

  1. Achievable Rates of UAV-Relayed Cooperative Cognitive Radio MIMO Systems

    KAUST Repository

    Sboui, Lokman

    2017-04-19

    We study the achievable rate of an uplink MIMO cognitive radio system where the primary user (PU) and the secondary user (SU) aim to communicate to the closest primary base station (BS) via a multi-access channel through the same unmanned aerial vehicle (UAV) relay. The SU message is then forwarded from the primary BS to the secondary network with a certain incentive reward as a part of the cooperation protocol between both networks. A special linear precoding scheme is proposed to enable the SU to exploit the PU free eigenmodes. We analyze two scenarios in which the UAV relay gain matrix is either fixed or optimized. We derive the optimal power allocation that maximizes the achievable rate of the SU respecting power budget, interference, and relay power constraints. Numerical results highlight the cognitive rate gain of our proposed scheme with respect to various problem parameters. We also highlight the effect of UAV altitude on the SU and PU rates. Finally, when the relay matrix is optimized, we show that the PU rate is remarkably enhanced and that the SU rate is only improved at high power regime.

  2. Full-Duplex MIMO Relaying: Achievable Rates under Limited Dynamic Range

    CERN Document Server

    Day, Brian P; Bliss, Daniel W; Schniter, Philip

    2011-01-01

    In this paper we consider the problem of full-duplex multiple-input multiple-output (MIMO) relaying between a source and destination who do not share a direct link. The principal difficulty in implementing such a system is that, due to the limited attenuation between the relay's transmit and receive antenna arrays, the relay's outgoing signal may overwhelm it's limited-dynamic-range input circuitry, making it difficult-if not impossible-to recover the desired incoming signal. While explicitly modeling transmitter/ receiver dynamic-range limitations and channel estimation error, we derive tight upper and lower bounds on the end-to-end achievable rate of decode-and-forward-based full-duplex MIMO relay systems, and propose a transmission scheme based on maximization of the lower bound. The maximization requires us to (numerically) solve a nonconvex optimization problem, for which we detail a novel approach based on bisection search and gradient projection. To gain insights into system design tradeoffs, we also d...

  3. Cellular Systems with Full-Duplex Compress-and-Forward Relaying and Cooperative Base Stations

    CERN Document Server

    Somekh, Oren; Poor, H Vincent; Shamai, Shlomo

    2008-01-01

    In this paper the advantages provided by multicell processing of signals transmitted by mobile terminals (MTs) which are received via dedicated relay terminals (RTs) are studied. It is assumed that each RT is capable of full-duplex operation and receives the transmission of adjacent relay terminals. Focusing on intra-cell TDMA and non-fading channels, a simplified relay-aided uplink cellular model based on a model introduced by Wyner is considered. Assuming a nomadic application in which the RTs are oblivious to the MTs' codebooks, a form of distributed compress-and-forward (CF) scheme with decoder side information is employed. The per-cell sum-rate of the CF scheme is derived and is given as a solution of a simple fixed point equation. This achievable rate reveals that the CF scheme is able to completely eliminate the inter-relay interference, and it approaches a ``cut-set-like'' upper bound for strong RTs transmission power. The CF rate is also shown to surpass the rate of an amplify-and-forward scheme via ...

  4. Multihop relaying and multiple antenna techniques: performance trade-offs in cellular systems

    Directory of Open Access Journals (Sweden)

    Jacobson Kevin

    2011-01-01

    Full Text Available Abstract Two very important and active areas of wireless research are multihop relaying and multiple antenna techniques. Wireless multihop relaying can increase the aggregate network data capacity and improve coverage of cellular systems by reducing path loss, mitigating shadowing, and enabling spatial reuse. In particular, multihop relaying can improve the throughput for mobiles suffering from poor signal to interference and noise ratio at the edge of a cell and reduce cell size to increase spectral efficiency. On the other hand, multiple antenna techniques can take advantage of scattering in the wireless channel to achieve higher capacity on individual links. Multiple antennas can provide impressive capacity gains, but the greatest gains occur in high scattering environments with high signal to interference and noise ratio, which are not typical characteristics of cellular systems. Emerging standards for fourth generation cellular systems include both multihop relaying and multiple antenna techniques, so it is necessary to study how these two work jointly in a realistic cellular system. In this paper, we look at the joint application of these two techniques in a cellular system and analyze the fundamental tradeoff between them. In order to obtain meaningful results, system performance is evaluated using realistic propagation models.

  5. Performance of amplify-and-forward multihop transmission over relay clusters with different routing strategies

    KAUST Repository

    Yilmaz, Ferkan

    2014-01-01

    We consider a multihop relay network in which two terminals are communicating with each other via a number of cluster of relays. Performance of such networks depends on the routing protocols employed. In this paper, we find the expressions for the Average Symbol Error Probability (ASEP) performance of Amplify-and-Forward (AF) multihop transmission for the simplest routing protocol in which the relay transmits using the channel having the best Signal to Noise Ratio (SNR). The ASEP performance of a better protocol proposed in Gui et al. (2009) known as the adhoc protocol is also analyzed. The derived expressions for the performance are a convenient tool to analyze the performance of AF multihop transmission over relay clusters. Monte-Carlo simulations verify the correctness of the proposed formulation and are in agreement with analytical results. Furthermore, we propose new generalized protocols termed as last-nhop selection protocol, the dual path protocol, the forward-backward last-n-hop selection protocol and the forward-backward dual path protocol, to get improved ASEP performances. The ASEP performance of these proposed schemes is analysed by computer simulations. It is shown that close to optimal performance can be achieved by using the last-n-hop selection protocol and its forwardbackward variant. The complexity of the protocols is also studied. Copyright © 2014 Inderscience Enterprises Ltd.

  6. Enabling Adaptive Rate and Relay Selection for 802.11 Mobile Ad Hoc Networks

    CERN Document Server

    Mehta, Neil; Wang, Wenye

    2011-01-01

    Mobile ad hoc networks (MANETs) are self-configuring wireless networks that lack permanent infrastructure and are formed among mobile nodes on demand. Rapid node mobility results in dramatic channel variation, or fading, that degrades MANET performance. Employing channel state information (CSI) at the transmitter can improve the throughput of routing and medium access control (MAC) protocols for mobile ad hoc networks. Several routing algorithms in the literature explicitly incorporate the fading signal strength into the routing metric, thus selecting the routes with strong channel conditions. While these studies show that adaptation to the time-variant channel gain is beneficial in MANETs, they do not address the effect of the outdated fading CSI at the transmitter. For realistic mobile node speeds, the channel gain is rapidly varying, and becomes quickly outdated due the feedback delay. We analyze the link throughput of joint rate adaptation and adaptive relay selection in the presence of imperfect CSI. Mor...

  7. Uplink Power Saving Potential of Cellular System with Fixed Relays

    Institute of Scientific and Technical Information of China (English)

    SHI Hong-kui; RONG Meng-tian; LIU Tao; YU Dan

    2007-01-01

    This paper presented a scheme of relayed cellular mobile telecommunication network, which only employs fixed digital relays and not more than two-hop relay routes. Power saving potential of the network is deeply studied under the assumption of not occupying additional frequency bands (i. e. relays share the same frequency bands as used by the base stations). Theoretical analysis and simulation results have both shown that, with the same radio coverage requirement, the necessary effective transmission powers in such a relayed network have greatly decreased compared to conventional cellular network.

  8. Using a micromachined magnetostatic relay in commutating a DC motor

    Science.gov (United States)

    Tai, Yu-Chong (Inventor); Wright, John A. (Inventor); Lilienthal, Gerald (Inventor)

    2004-01-01

    A DC motor is commutated by rotating a magnetic rotor to induce a magnetic field in at least one magnetostatic relay in the motor. Each relay is activated in response to the magnetic field to deliver power to at least one corresponding winding connected to the relay. In some cases, each relay delivers power first through a corresponding primary winding and then through a corresponding secondary winding to a common node. Specific examples include a four-pole, three-phase motor in which each relay is activated four times during one rotation of the magnetic rotor.

  9. Outage probability analysis of a secondary user in an underlay dual hop cognitive amplify and forward relay network

    Directory of Open Access Journals (Sweden)

    Kiran Chandra

    2016-09-01

    Full Text Available This paper presents the performance evaluation of a secondary user (SU in an underlay cognitive dual-hop relaying system considering instantaneous as well as average channel information of the interfering links (from the secondary source and relay to the primary receiver and the data link from the secondary source to relay, to calculate transmit power and amplifying gain of secondary system. Comparison of above mentioned cases is done for two different scenarios – with direct path and without direct path. We evaluate the performance considering two different diversity techniques namely as selection combining (SC and maximum ratio combining (MRC. The effect of different fading channels (Rayleigh and Nakagami on the outage performance of the SU for the two diversity techniques is also shown. The outage probability of the SU is reduced when the diversity techniques are used (with direct path as compared to the outage probability of SU without direct path. We find that the outage performance is better for instantaneous channel information as compared to average channel information for the links. We observe that MRC provides better performance than SC. Furthermore, this work shows that the outage performance of the SU has been improved when the Nakagami fading channel (m = 2 is considered instead of Rayleigh fading channel.

  10. Optimised secure transmission through untrusted AF relays using link adaptation

    Science.gov (United States)

    Taki, Mehrdad; Sadeghi, Mohammad

    2016-05-01

    A new transmission scheme is presented for a two-hop relay network including two AF relays, considering physical layer security where relays are not able to detect signal with an acceptable bit error rate (BER) but the combined received signal is detected with an acceptable BER at the final receiver. It is assumed that there is no direct path between the transmitter and the receiver (relay network without diversity). Adaptive modulation and coding is utilised at the transmitter and transmission powers of the transmitter and of the relays are continuously adapted provisioning individual average power constraint for each node. Numerical evaluations show that an acceptable performance degradation is seen by the proposed secure relaying scheme compared to the optimum relay selection scheme without security constraint.

  11. Adult Pacific Lamprey Migration in the Lower Columbia River: 2011 Half-Duplex Pit Tag Studies

    Science.gov (United States)

    2012-01-01

    Kasey Welch, Miro Zyndol, Robert Cordie , Brad Eby, and Mark Plummer. iv Table of Contents Executive Summary...reaches upstream from Bonneville Dam included one reservoir and one dam. Median migration rates ranged from 5-18 km●d-1 in reservoir- plus -dam reaches...River radiotelemetry studies, tributary 26 detection has occurred primarily at the Deschutes, Klickitat, and John Day rivers plus Fifteenmile

  12. Pragmatic Analysis of Internet Relay Chat

    Institute of Scientific and Technical Information of China (English)

    张永芳

    2005-01-01

    This article presents a pragmatic analysis of Internet Relay chat. Text-only chat room conversation has been claimed to be interactionally incoherent due to limitations imposed by messaging systems on turn taking. The article tries to schematize the conversational relationships of the speakers in a text-based medium and apply a pragmatic point of view based on the model of turn allocation and the Cooperative Prjnciple. An extract of flowing logs in an on-line chat room is analyzed thoroughly in an attempt to explore the way in which Internet interactants behave in a virtual space. The paper shows that some pragmatic rules people follow in everyday oral conversation are followed in Internet relay chat too.

  13. Solar concentrator with a toroidal relay module.

    Science.gov (United States)

    Lin, Jhe-Syuan; Liang, Chao-Wen

    2015-10-01

    III-V multijunction solar cells require solar concentrators with a high concentration ratio to reduce per watt cost and to increase solar energy transforming efficiency. This paper discusses a novel solar concentrator design that features a high concentration ratio, high transfer efficiency, thin profile design, and a high solar acceptance angle. The optical design of the concentrator utilizes a toroidal relay module, which includes both the off-axis relay lens and field lens design in a single concentric toroidal lens shape. The optical design concept of the concentrator is discussed and the simulation results are shown. The given exemplary design has an aspect ratio of 0.24, a high averaged optical concentration ratio 1230×, a maximum efficiency of 76.8%, and the solar acceptance angle of ±0.9°.

  14. Distributed Matching Algorithms: Maximizing Secrecy in the Presence of Untrusted Relay

    Directory of Open Access Journals (Sweden)

    B. Ali

    2017-06-01

    Full Text Available In this paper, we propose a secrecy sum-rate maximization based matching algorithm between primary transmitters and secondary cooperative jammers in the presence of an eavesdropper. More explicitly, we consider an untrusted relay scenario, where the relay is a potential eavesdropper. We first show the achievable secrecy regions employing a friendly jammer in a cooperative scenario with employing an untrusted relay. Then, we provide results for the secrecy regions for two scenarios, where in the first case we consider no direct transmission between the source and the destination, while in the second case we include a source to destination direct link in our communication system. Furthermore, a friendly jammer helps to send a noise signal during the first phase of the cooperative transmission, for securing the information transmitted from the source. In our matching algorithm, the selected cooperative jammer or the secondary user, is rewarded with the spectrum allocation for a fraction of time slot from the source which is the primary user. The Conventional Distributed Algorithm (CDA and the Pragmatic Distributed Algorithm (PDA, which were originally designed for maximising the user’s sum rate, are modified and adapted for maximizing the secrecy sum-rate for the primary user. Instead of assuming perfect modulation and/or perfect channel coding, we have also investigated our proposed schemes when practical channel coding and modulation schemes are invoked.

  15. NFCGate - An NFC Relay Application for Android

    OpenAIRE

    Maaß, Max Jakob; Müller, Uwe; Schons, Tom; Wegemer, Daniel; Schulz, Matthias

    2015-01-01

    Near Field Communication (NFC) is a technology widely used for security-critical applications like access control or payment systems. Many of these systems rely on the security assumption that the card has to be in close proximity to communicate with the reader. We developed NFCGate, an Android application capable of relaying NFC communication between card and reader using two rooted but otherwise unmodified Android phones. This enables us to increase the distance between card and reader, eav...

  16. On the Performance of Selection Relaying

    OpenAIRE

    Adinoyi, Abdulkareem; Fan, Yijia; Yanikomeroglu, Halim; Poor, H. Vincent

    2008-01-01

    Interest in selection relaying is growing. The recent developments in this area have largely focused on information theoretic analyses such as outage performance. Some of these analyses are accurate only at high SNR regimes. In this paper error rate analyses that are sufficiently accurate over a wide range of SNR regimes are provided. The motivations for this work are that practical systems operate at far lower SNR values than those supported by the high SNR analysis. To enable designers to m...

  17. Reliable Remote Relay Protection in Smart Grid

    Institute of Scientific and Technical Information of China (English)

    Jiapeng Zhang; Yingfei Dong

    2015-01-01

    As the false trips of remote protection relays are among the main reasons behind cascading blackouts, it is critical to design reli⁃able relay protection. Even though common protection schemes on traditional power systems have been investigated for a few de⁃cades, cascading failures in recent years indicate more research needed in this area. Consequently, researchers have proposed agent⁃based methods on the Smart Grid (SG) to address this issue. However, these existing agent⁃based methods simply use TCP protocol without considering real⁃time communication requirements (such as bandwidth and delay). To deal with this issue, several methods for efficient network resource management are proposed. Furthermore, these existing methods do not consider the poten⁃tial issues in practical communication networks, which may result in delay violation and trigger relay false trips. We have dis⁃cussed simple backup solutions in the previous work. In this paper, in addition to network efficiency, we focus on improving the system reliability by exploring known power system information and minimizing the chances of false trips of important remote re⁃lays, e.g., defining power line priorities based on their importance. Moreover, to further improve the system reliability, we also in⁃vestigate the peer⁃to⁃peer protection approaches to address the single point of failure of centralized control center.

  18. Quantum relay schemes for continuous-variable quantum key distribution

    Science.gov (United States)

    Guo, Ying; Liao, Qin; Huang, Duan; Zeng, Guihua

    2017-04-01

    We propose several concatenated quantum relay continuous-variable quantum key distribution schemes based on the parametric amplifier (PA) and the beam splitter (BS). Instead of using only one BS in the traditional relay scheme, the proposed schemes provide two operations that involve both PA and BS, activating the beam splitting and recombining operations in turn. These schemes would benefit the system performance improvement by providing signal amplification and establishing quantum correlations. We show that the different effects of the relay schemes will cause different system performances because of the varied signal-to-noise ratio (SNR) of output fields. The system's secret key rate will be increased when equipping with the PA-BS relay scheme, because the output fields of the PA are entangled with the correlated quantum noises while input fields of the BS are superimposed, subsequently leading to the quantum noise reduction of the total output fields of relay station, while the reversed BS-PA relay scheme has little advantage over the traditional counterpart that contains only one BS in relay data postprocessing because it will not cause any SNR improvement. Moreover, the reinforced PA-PA relay scheme results in a slight improvement due to the increased SNR. These quantum relay schemes can be performed through the beam splitting, the recombining operations, and the relay data postprocessing, such that it would be suitable for secret information exchange in complex networks with intermediate stations.

  19. On the performance of hybrid ARQ with incremental redundancy over amplify-and-forward dual-hop relay networks

    KAUST Repository

    Hadjtaieb, Amir

    2014-09-01

    In this paper, we consider a three node relay network comprising a source, a relay, and a destination. The source transmits the message to the destination using hybrid automatic repeat request (HARQ) with incremental redundancy (IR). The relay overhears the transmitted message, amplifies it using a variable gain amplifier, and then forwards the message to the destination. This latter combines both the source and the relay message and tries to decode the information. In case of decoding failure, the destination sends a negative acknowledgement. A new replica of the message containing new parity bits is then transmitted in the subsequent HARQ round. This process continues until successful decoding occurs at the destination or a maximum number M of rounds is reached. We study the performance of HARQ-IR over the considered relay channel from an information theoretic perspective. We derive for instance exact expressions and bounds for the information outage probability, the average number of transmissions, and the average transmission rate. The derived exact expressions are validated by Monte Carlo simulations.

  20. Rate Maximization in MIMO Decode-and-Forward Communications With an EH Relay and Possibly Imperfect CSI

    KAUST Repository

    Benkhelifa, Fatma

    2016-08-29

    In this paper, we investigate the simultaneous wireless information and power transfer (SWIPT) in a multiple-input multiple-output (MIMO) decode-and-forward (DF) relay system where the relay is an energy harvesting (EH) multi-antenna node equipped with an EH receiver and an information decoding (ID) receiver. The relay harvests the energy from the radio frequency (RF) signals sent by the source and uses it to forward the signals to the destination. The main objective in this paper is to maximize the achievable transmission rate of the overall link by optimizing the source/relay precoders. First, we study an upper bound on the maximum achievable rate where we assume that the EH and ID receivers operate simultaneously and have access to the whole power of the received signals. Afterwards, we study two practical schemes, which are the power splitting (PS) and time switching (TS) schemes, where the ID and EH receivers have partial access to the power or duration of the received signals. For each scheme, we have studied the complexity and the performance comparison. In addition, we considered the case of the imperfect channel estimation error and we have observed its impact on the achievable end-to-end rate and the harvested energy at the relay. © 1972-2012 IEEE.

  1. Enhancing Physical Layer Security of Multiuser SIMO Mixed RF/FSO Relay Networks with Multi-Eavesdroppers

    KAUST Repository

    El-Malek, Ahmed H. Abd

    2017-02-09

    In this paper, we investigate the secrecy performance of multiuser (MU) single-input multiple-output (SIMO) mixed radio frequency (RF)/free space optical (FSO) relay network with opportunistic user scheduling and multiple eavesdropping attacks. The considered system includes multiple users, one amplify-and-froward (AF) relay, one destination and multiple eavesdroppers. The users are connected with a multi-antenna relay through RF links and the relay is connected with the destination through an FSO link. Maximal ratio combining (MRC) scheme is used at the relay node to combine the received signals at its different antennas. The RF/FSO channels are assumed to follow Nakagami-m/Gamma-Gamma fading models with considering the effect of pointing errors. In particular, we derive closed- form expressions for the exact and asymptotic outage probabilities. The asymptotic outage results are then used to obtain the optimal RF transmission power based on the dominant link between the RF and FSO links. Then, the considered system secrecy performance is investigated in the presence of multi- eavesdroppers where exact closed-form expression for the intercept probability is derived. Finally, a cooperative jamming model is proposed along with power allocation to enhance the system secrecy performance. Monte-Carlo simulations are provided to validate the achieved exact and asymptotic results.

  2. Energy Efficiency and Goodput Analysis in Two-Way Wireless Relay Networks

    CERN Document Server

    Chen, Qing

    2011-01-01

    In this paper, we study two-way relay networks (TWRNs) in which two source nodes exchange their information via a relay node indirectly in Rayleigh fading channels. Both Amplify-and-Forward (AF) and Decode-and-Forward (DF) techniques have been analyzed in the TWRN employing a Markov chain model through which the network operation is described and investigated in depth. Automatic Repeat-reQuest (ARQ) retransmission has been applied to guarantee the successful packet delivery. The bit energy consumption and goodput expressions have been derived as functions of transmission rate in a given AF or DF TWRN. Numerical results are used to identify the optimal transmission rates where the bit energy consumption is minimized or the goodput is maximized. The network performances are compared in terms of energy and transmission efficiency in AF and DF modes.

  3. On the performance of future full-duplex relay selection networks

    KAUST Repository

    Khafagy, Mohammad Galal

    2015-09-01

    In this work, we evaluate the performance of relay selection over Nakagami-m fading channels in the presence of a cluster of full-duplex decode-and-forward relays with self-interference. Specifically, we derive the exact cumulative distribution function of the end-to-end signal-to-interference-plus-noise ratio in the presence of a direct source-destination link. When a direct link exists, all dual-hop paths become mutually correlated due to the common direct-link interference. The presented exact results enable the evaluation of the outage performance and system throughput for fixed-rate transmission systems. The theoretical findings are verified by numerical simulations, where the severity of fading effect in the residual self-interference link is also discussed.

  4. Balanced energy-efficient relay selection scheme in wireless mobile relay networks

    Institute of Scientific and Technical Information of China (English)

    Liu Wei; Ji Hong; Li Xi

    2010-01-01

    In order to resolve the relay selection problem in wireless mobile relay networks (WMRNs), a novel balanced energy-efficient mobile relay selection scheme is proposed in this paper.Compared with traditional counter-based algorithm, distance and energy consumption are considered from network respect to provide a better network lifetime performance in the proposed scheme.Also, it performs well when nodes move freely at high speed.A random assessment delay (RAD) mechanism is added to avoid collisions and improve transmission efficiency.Simulation results reveal that, the proposed scheme has advantages in prolonging network lifetime, balancing energy consumption and reducing the total energy consumption compared with existing counter-based scheme.

  5. Laser Communications Relay Demonstration (LCRD) Update and the Path Towards Optical Relay Operations

    Science.gov (United States)

    Israel, David J.; Edwards, Bernard L.; Staren, John W.

    2017-01-01

    This paper provides a concept for an evolution of NASA's optical communications near Earth relay architecture. NASA's Laser Communications Relay Demonstration (LCRD), a joint project between NASA's Goddard Space Flight Center (GSFC), the Jet Propulsion Laboratory - California Institute of Technology (JPL), and the Massachusetts Institute of Technology Lincoln Laboratory (MIT LL). LCRD will provide a minimum of two years of high data rate optical communications service experiments in geosynchronous orbit (GEO), following launch in 2019. This paper will provide an update of the LCRD mission status and planned capabilities and experiments, followed by a discussion of the path from LCRD to operational network capabilities.

  6. Laser Communications Relay Demonstration (LCRD) Update and the Path Towards Optical Relay Operations

    Science.gov (United States)

    Israel, David J.; Edwards, Bernard L.; Staren, John W.

    2017-01-01

    This Presentation provides a concept for an evolution of NASAs optical communications near Earth relay architecture. NASA's Laser Communications Relay Demonstration (LCRD), a joint project between NASAs Goddard Space Flight Center (GSFC), the Jet Propulsion Laboratory - California Institute of Technology (JPL), and the Massachusetts Institute of Technology Lincoln Laboratory (MIT LL). LCRD will provide a minimum of two years of high data rate optical communications service experiments in geosynchronous orbit (GEO), following launch in 2019. This paper will provide an update of the LCRD mission status and planned capabilities and experiments, followed by a discussion of the path from LCRD to operational network capabilities.

  7. Generalized instantly decodable network coding for relay-assisted networks

    KAUST Repository

    Elmahdy, Adel M.

    2013-09-01

    In this paper, we investigate the problem of minimizing the frame completion delay for Instantly Decodable Network Coding (IDNC) in relay-assisted wireless multicast networks. We first propose a packet recovery algorithm in the single relay topology which employs generalized IDNC instead of strict IDNC previously proposed in the literature for the same relay-assisted topology. This use of generalized IDNC is supported by showing that it is a super-set of the strict IDNC scheme, and thus can generate coding combinations that are at least as efficient as strict IDNC in reducing the average completion delay. We then extend our study to the multiple relay topology and propose a joint generalized IDNC and relay selection algorithm. This proposed algorithm benefits from the reception diversity of the multiple relays to further reduce the average completion delay in the network. Simulation results show that our proposed solutions achieve much better performance compared to previous solutions in the literature. © 2013 IEEE.

  8. RELAY ASSISTED TRANSMISSSION WITH BIT-INTERLEAVED CODED MODULATION

    Institute of Scientific and Technical Information of China (English)

    Meng Qingmin; You Xiaohu; John Boyer

    2006-01-01

    We investigate an adaptive cooperative protocol in a Two-Hop-Relay (THR) wireless system that combines the following: (1) adaptive relaying based on repetition coding; (2) single or two transmit antennas and one receive antenna configurations for all nodes, each using high order constellation; (3) Bit-Interleaved Coded Modulation (BICM). We focus on a simple decoded relaying (i.e. no error correcting at a relay node)and simple signal quality thresholds for relaying. Then the impact of the two simple thresholds on the system performance is studied. Our results suggest that compared with the traditional scheme for direct transmission,the proposed scheme can increase average throughput in high spectral efficiency region with low implementation-cost at the relay.

  9. Approximately achieving Gaussian relay network capacity with lattice codes

    CERN Document Server

    Ozgur, Ayfer

    2010-01-01

    Recently, it has been shown that a quantize-map-and-forward scheme approximately achieves (within a constant number of bits) the Gaussian relay network capacity for arbitrary topologies. This was established using Gaussian codebooks for transmission and random mappings at the relays. In this paper, we show that the same approximation result can be established by using lattices for transmission and quantization along with structured mappings at the relays.

  10. Relay Selection Based Double-Differential Transmission for Cooperative Networks with Multiple Carrier Frequency Offsets: Model, Analysis, and Optimization

    Science.gov (United States)

    Zhao, Kun; Zhang, Bangning; Pan, Kegang; Liu, Aijun; Guo, Daoxing

    2014-07-01

    Due to the distributed nature, cooperative networks are generally subject to multiple carrier frequency offsets (MCFOs), which make the channels time-varying and drastically degrade the system performance. In this paper, to address the MCFOs problem in detect-andforward (DetF) multi-relay cooperative networks, a robust relay selection (RS) based double-differential (DD) transmission scheme, termed RSDDT, is proposed, where the best relay is selected to forward the source's double-differentially modulated signals to the destination with the DetF protocol. The proposed RSDDT scheme can achieve excellent performance over fading channels in the presence of unknown MCFOs. Considering double-differential multiple phase-shift keying (DDMPSK) is applied, we first derive exact expressions for the outage probability and average bit error rate (BER) of the RSDDT scheme. Then, we look into the high signal-to-noise ratio (SNR) regime and present simple and informative asymptotic outage probability and average BER expressions, which reveal that the proposed scheme can achieve full diversity. Moreover, to further improve the BER performance of the RSDDT scheme, we investigate the optimum power allocation strategy among the source and the relay nodes, and simple analytical solutions are obtained. Numerical results are provided to corroborate the derived analytical expressions and it is demonstrated that the proposed optimum power allocation strategy offers substantial BER performance improvement over the equal power allocation strategy.

  11. Performance Analysis of a Two-Hop MIMO Mobile-to-Mobile via Stratospheric-Relay Link Employing Hierarchical Modulation

    Directory of Open Access Journals (Sweden)

    Nikolaos Nomikos

    2013-01-01

    Full Text Available Next generation wireless communication networks intend to take advantage of the integration of terrestrial and aerospace infrastructures. Besides, multiple-input multiple-output (MIMO architecture is the key technology, which has brought the wireless gigabit vision closer to reality. In this direction, high-altitude platforms (HAPs could act as relay stations in the stratosphere transferring information from an uplink to a downlink MIMO channel. This paper investigates the performance of a novel transmission scheme for the delivery of mobile-to-mobile (M-to-M services via a stratospheric relay. It is assumed that the source, relay, and destination nodes are equipped with multiple antennas and that amplify-and-forward (AF relaying is adopted. The performance is analyzed through rigorous simulations in terms of the bit-error rate (BER by using a recently proposed 3D geometry-based reference model in spatially correlated flat-fading MIMO channels, employing a hierarchical broadcast technique and minimum mean square error (MMSE receivers.

  12. Power supply devices and systems of relay protection

    CERN Document Server

    Gurevich, Vladimir

    2013-01-01

    Power Supply Devices and Systems of Relay Protection brings relay protection and electrical power engineers a single, concentrated source of information on auxiliary power supply systems and devices. The book also tackles specific problems and solutions of relay protection power supply systems and devices, which are often not dealt with in the literature. The author, an experienced engineer with more than 100 patents, draws on his own experience to offer practical, tested advice to readers. A Guide to Relay Protection Power Supply for Engineers and Technicians The first chapter reviews the ele

  13. Beamforming Design for Coordinated Direct and Relay Systems

    DEFF Research Database (Denmark)

    Sun, Fan; De Carvalho, Elisabeth; Thai, Chan

    2012-01-01

    Joint processing of multiple communication flows in wireless systems has given rise to a number of novel transmission techniques, notably the two-way relaying based on wireless network coding. Recently, a related set of techniques has emerged, termed coordinated direct and relay (CDR) transmissions......, where the constellation of traffic flows is more general than the two-way. Regardless of the actual traffic flows, in a CDR scheme the relay has a central role in managing the interference. In this paper we investigate the novel transmission modes, based on amplify-and-forward, that arise when the relay...

  14. Relay Telecommunications for the Coming Decade of Mars Exploration

    Science.gov (United States)

    Edwards, C.; DePaula, R.

    2010-01-01

    Over the past decade, an evolving network of relay-equipped orbiters has advanced our capabilities for Mars exploration. NASA's Mars Global Surveyor, 2001 Mars Odyssey, and Mars Reconnaissance Orbiter (MRO), as well as ESA's Mars Express Orbiter, have provided telecommunications relay services to the 2003 Mars Exploration Rovers, Spirit and Opportunity, and to the 2007 Phoenix Lander. Based on these successes, a roadmap for continued Mars relay services is in place for the coming decade. MRO and Odyssey will provide key relay support to the 2011 Mars Science Laboratory (MSL) mission, including capture of critical event telemetry during entry, descent, and landing, as well as support for command and telemetry during surface operations, utilizing new capabilities of the Electra relay payload on MRO and the Electra-Lite payload on MSL to allow significant increase in data return relative to earlier missions. Over the remainder of the decade a number of additional orbiter and lander missions are planned, representing new orbital relay service providers and new landed relay users. In this paper we will outline this Mars relay roadmap, quantifying relay performance over time, illustrating planned support scenarios, and identifying key challenges and technology infusion opportunities.

  15. Relay Telecommunications for the Coming Decade of Mars Exploration

    Science.gov (United States)

    Edwards, C.; DePaula, R.

    2010-01-01

    Over the past decade, an evolving network of relay-equipped orbiters has advanced our capabilities for Mars exploration. NASA's Mars Global Surveyor, 2001 Mars Odyssey, and Mars Reconnaissance Orbiter (MRO), as well as ESA's Mars Express Orbiter, have provided telecommunications relay services to the 2003 Mars Exploration Rovers, Spirit and Opportunity, and to the 2007 Phoenix Lander. Based on these successes, a roadmap for continued Mars relay services is in place for the coming decade. MRO and Odyssey will provide key relay support to the 2011 Mars Science Laboratory (MSL) mission, including capture of critical event telemetry during entry, descent, and landing, as well as support for command and telemetry during surface operations, utilizing new capabilities of the Electra relay payload on MRO and the Electra-Lite payload on MSL to allow significant increase in data return relative to earlier missions. Over the remainder of the decade a number of additional orbiter and lander missions are planned, representing new orbital relay service providers and new landed relay users. In this paper we will outline this Mars relay roadmap, quantifying relay performance over time, illustrating planned support scenarios, and identifying key challenges and technology infusion opportunities.

  16. Hybrid-ARQ in Multihop Networks with Opportunistic Relay Selection

    CERN Document Server

    Lo, Caleb K; Vishwanath, Sriram

    2007-01-01

    This paper develops a contention-based opportunistic feedback technique towards relay selection in a dense wireless network. This technique enables the forwarding of additional parity information from the selected relay to the destination. For a given network, the effects of varying key parameters such as the feedback probability are presented and discussed. A primary advantage of the proposed technique is that relay selection can be performed in a distributed way. Simulation results find its performance to closely match that of centralized schemes that utilize GPS information, unlike the proposed method. The proposed relay selection method is also found to achieve throughput gains over a point-to-point transmission strategy.

  17. Cooperative relay-based multicasting for energy and delay minimization

    KAUST Repository

    Atat, Rachad

    2012-08-01

    Relay-based multicasting for the purpose of cooperative content distribution is studied. Optimized relay selection is performed with the objective of minimizing the energy consumption or the content distribution delay within a cluster of cooperating mobiles. Two schemes are investigated. The first consists of the BS sending the data only to the relay, and the second scheme considers the scenario of threshold-based multicasting by the BS, where a relay is selected to transmit the data to the mobiles that were not able to receive the multicast data. Both schemes show significant superiority compared to the non-cooperative scenarios, in terms of energy consumption and delay reduction. © 2012 IEEE.

  18. Performance analysis of two-way amplify and forward relaying with adaptive modulation over multiple relay network

    KAUST Repository

    Hwang, Kyusung

    2011-02-01

    In this letter, we propose two-way amplify-and-forward relaying in conjunction with adaptive modulation in order to improve spectral efficiency of relayed communication systems while monitoring the required error performance. We also consider a multiple relay network where only the best relay node is utilized so that the diversity order increases while maintaining a low complexity of implementation as the number of relays increases. Based on the best relay selection criterion, we offer an upper bound on the signal-to-noise ratio to keep the performance analysis tractable. Our numerical examples show that the proposed system offers a considerable gain in spectral efficiency while satisfying the error rate requirements. © 2011 IEEE.

  19. Optimal Relay Power Allocation for Amplify-and-Forward Relay Networks with Non-linear Power Amplifiers

    OpenAIRE

    Zhang, Chao; Ren, Pinyi; Peng, Jingbo; Wei, Guo; Du, Qinghe; Wang, Yichen

    2011-01-01

    In this paper, we propose an optimal relay power allocation of an Amplify-and-Forward relay networks with non-linear power amplifiers. Based on Bussgang Linearization Theory, we depict the non-linear amplifying process into a linear system, which lets analyzing system performance easier. To obtain spatial diversity, we design a complete practical framework of a non-linear distortion aware receiver. Consider a total relay power constraint, we propose an optimal power allocation scheme to maxim...

  20. Coordinated Transmission of Interference Mitigation and Power Allocation in Two-User Two-Hop MIMO Relay Systems

    Directory of Open Access Journals (Sweden)

    Hee-Nam Cho

    2010-01-01

    Full Text Available This paper considers coordinated transmission for interference mitigation and power allocation in a correlated two-user two-hop multi-input multioutput (MIMO relay system. The proposed transmission scheme utilizes statistical channel state information (CSI (e.g., transmit correlation to minimize the cochannel interference (CCI caused by the relay. To this end, it is shown that the CCI can be represented in terms of the eigenvalues and the angle difference between the eigenvectors of the transmit correlation matrix of the intended and CCI channel, and that the condition minimizing the CCI can be characterized by the correlation amplitude and the phase difference between the transmit correlation coefficients of these channels. Then, a coordinated user-scheduling strategy is designed with the use of eigen-beamforming to minimize the CCI in an average sense. The transmit power of the base station and relay is optimized under separate power constraint. Analytic and numerical results show that the proposed scheme can maximize the achievable sum rate when the principal eigenvectors of the transmit correlation matrix of the intended and the CCI channel are orthogonal to each other, yielding a sum rate performance comparable to that of the minimum mean-square error-based coordinated beamforming which uses instantaneous CSI.