Showing papers on "Relay published in 2012"

Relaying Protocols for Wireless Energy Harvesting and Information Processing

Abstract: An emerging solution for prolonging the lifetime of energy constrained relay nodes in wireless networks is to avail the ambient radio-frequency (RF) signal and to simultaneously harvest energy and process information. In this paper, an amplify-and-forward (AF) relaying network is considered, where an energy constrained relay node harvests energy from the received RF signal and uses that harvested energy to forward the source information to the destination. Based on the time switching and power splitting receiver architectures, two relaying protocols, namely, i) time switching-based relaying (TSR) protocol and ii) power splitting-based relaying (PSR) protocol are proposed to enable energy harvesting and information processing at the relay. In order to determine the throughput, analytical expressions for the outage probability and the ergodic capacity are derived for delay-limited and delay-tolerant transmission modes, respectively. The numerical analysis provides practical insights into the effect of various system parameters, such as energy harvesting time, power splitting ratio, source transmission rate, source to relay distance, noise power, and energy harvesting efficiency, on the performance of wireless energy harvesting and information processing using AF relay nodes. In particular, the TSR protocol outperforms the PSR protocol in terms of throughput at relatively low signal-to-noise-ratios and high transmission rate.

Buffer-Aided Relay Selection for Cooperative Diversity Systems without Delay Constraints

Abstract: In this paper, we study the relay selection problem for a finite buffer-aided decode-and-forward cooperative wireless network. A relay selection policy that fully exploits the flexibility offered by the buffering ability of the relay nodes in order to maximize the achieved diversity gain is investigated. This new scheme incorporates the instantaneous strength of the wireless links as well as the status of the finite relay buffers and adapts the relay selection decision on the strongest available link by dynamically switching between relay reception and transmission. In order to analyse the new relay selection policy in terms of outage probability and diversity gain, a theoretical framework that models the evolution of the relay buffers as a Markov chain (MC) is introduced. The construction of the state transition matrix and the related steady state of the MC are studied and their impact on the derivation of the outage probability is investigated. We show that the proposed relay selection scheme significantly outperforms conventional relay selection policies for all cases and ensures a diversity gain equal to two times the number of relays for large buffer sizes.

Full-Duplex Relay Selection for Amplify-and-Forward Cooperative Networks

Abstract: This paper focuses on the relay selection problem in amplify-and-forward (AF) cooperative communication with full-duplex (FD) operation. Different relay selection schemes assuming the availability of different instantaneous information are studied. We consider optimal relay selection that maximizes the instantaneous FD channel capacity and requires global channel state information (CSI) as well as several sub-optimal relay selection policies that utilize partial CSI knowledge such as a) source-relay and relay-destination links b) loop interference c) source-relay links and loop interference. To facilitate comparison, exact outage probability expressions and asymptotic approximations of these policies that show a zero diversity order are derived. In addition, an optimal relay selection procedure that incorporates a hybrid relaying strategy, which dynamically switches between FD and half-duplex relaying according to the instantaneous CSI, is also investigated.

Full-Duplex MIMO Relaying: Achievable Rates Under Limited Dynamic Range

Abstract: In this paper we consider the problem of full-duplex multiple-input multiple-output (MIMO) relaying between multi-antenna source and destination nodes. 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 its 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 derive an analytic approximation to the achievable rate and numerically demonstrate its accuracy. We then study the behavior of the achievable rate as a function of signal-to-noise ratio, interference-to-noise ratio, transmitter/receiver dynamic range, number of antennas, and training length, using optimized half-duplex signaling as a baseline.

RF Energy Transfer for Cooperative Networks: Data Relaying or Energy Harvesting?

Abstract: This letter deals with a three-node cooperative network where the relay node harvests energy from radio frequency (RF) radiation. The source node is the only available RF generator and introduces a fundamental switching between energy harvesting and data relaying. A greedy switching (GS) policy where the relay node transmits when its residual energy ensures decoding at the destination is investigated. The GS policy is modeled as a Markov chain for a discretized battery; the stationary distribution and the outage probability of the system are derived in closed form expressions. In addition, an optimal switching policy that incorporates a-priori knowledge of the channel coefficients is proposed and solved by a mixed-integer linear programming formulation.

Max-Max Relay Selection for Relays with Buffers

Abstract: In this paper, we propose a new relay selection scheme for half-duplex relays with buffers. The proposed scheme is referred to as max-max relay selection (MMRS) since the relays with the best source-relay and the best relay-destination channels are selected for reception and transmission, respectively, which is only possible without data loss if the relays have buffers of infinite size. To relax this idealized assumption, we propose hybrid relay selection (HRS) for relays with buffers of finite size. HRS is a combination of conventional best relay selection (BRS) and MMRS and takes into account both the channel state and the buffer state for relay selection. We provide a comprehensive analysis of the outage and symbol error probabilities of both MMRS and HRS for a decode-and-forward protocol in Rayleigh fading. This analysis reveals that BRS, HRS, and MMRS achieve the same diversity gain. However, for N relays, MMRS achieves a signal-to-noise ratio (SNR) gain of 3(1-1/N) dB compared to BRS, and HRS closely approaches the SNR gain of MMRS for moderate buffer sizes (e.g. 30 transmission intervals).

Distributed Beamforming for Physical-Layer Security of Two-Way Relay Networks

Abstract: In this paper, we address the security of a two-way relay network in the presence of an eavesdropper, where each node is only equipped with single antenna. We propose two-phase distributed analog network coding, or distributed beamforming and power allocation to enhance the secrecy sum rate of the data exchange. In the first phase, the two terminals broadcast their information data simultaneously to all the relay nodes. In the second phase, three different security schemes are proposed: optimal beamforming, null-space beamforming, and artificial noise beamforming. In the first scheme, the objective is to achieve the maximum secrecy sum rate of the two terminals. Mathematically, the objective function is difficult to optimize. In the second scheme, we maximize the total information exchanged while we eliminate the information leakage completely, subject to the total transmission power constraint. We show that the problem has a unique and global optimum, which can be solved using bisection method. When the instantaneous channel state information of the eavesdropper is not available, we propose an artificial noise beamforming in the third scheme. We minimize the information transmission power so that the artificial noise power is maximized to eliminate information leakage, under the constraints of quality of service (QoS) required by terminals. It is a second-order convex cone programming (SOCP) problem, thus can be efficiently solved using interior point methods. Numerical results are provided and analyzed to show the properties and efficiency of the proposed designs.

Joint Relay and Jammer Selection for Secure Two-Way Relay Networks

Abstract: In this paper, we investigate joint relay and jammer selection in two-way cooperative networks, consisting of two sources, a number of intermediate nodes, and one eavesdropper, with the constraints of physical-layer security. Specifically, the proposed algorithms select two or three intermediate nodes to enhance security against the malicious eavesdropper. The first selected node operates in the conventional relay mode and assists the sources to deliver their data to the corresponding destinations using an amplify-and-forward protocol. The second and third nodes are used in different communication phases as jammers in order to create intentional interference upon the malicious eavesdropper. First, we find that in a topology where the intermediate nodes are randomly and sparsely distributed, the proposed schemes with cooperative jamming outperform the conventional nonjamming schemes within a certain transmitted power regime. We also find that, in the scenario where the intermediate nodes gather as a close cluster, the jamming schemes may be less effective than their nonjamming counterparts. Therefore, we introduce a hybrid scheme to switch between jamming and nonjamming modes. Simulation results validate our theoretical analysis and show that the hybrid switching scheme further improves the secrecy rate.

Joint Secure Beamforming Design at the Source and the Relay for an Amplify-and-Forward MIMO Untrusted Relay System

Abstract: An amplify-and-forward (AF) multiple-input multiple-output (MIMO) relay network composed of a source, a relay, and a destination is considered, where transmit beamforming is employed both at the source and at the relay. The relay is a user who is willing to help the communication from the source to the destination. In our paper, however, the relay is untrusted in the sense that it may make a passive security attack; that is, it may decode messages of the source. We consider two ways to transmit confidential information of the source to the destination: noncooperative secure beamforming and cooperative secure beamforming. In the noncooperative scheme, the relay is simply treated as an eavesdropper, and does not participate in communication. In the cooperative scheme, the relay is asked to relay signals from the source to the destination. In this paper, the source and relay beamforming is jointly designed to maximize the secrecy rate in the cooperative scheme. The conditions under which the cooperative scheme achieves a higher secrecy rate than the noncooperative scheme are derived in the low and high signal-to-noise ratio (SNR) regimes of the source-relay and relay-destination links. The performance of the secure beamforming schemes is compared through extensive numerical simulations.

Dynamic Resource Allocation in MIMO-OFDMA Systems with Full-Duplex and Hybrid Relaying

Abstract: In this paper, we formulate a joint optimization problem for resource allocation and scheduling in full-duplex multiple-input multiple-output orthogonal frequency division multiple access (MIMO-OFDMA) relaying systems with amplify-and-forward (AF) and decode-and-forward (DF) relaying protocols. Our problem formulation takes into account heterogeneous data rate requirements for delay sensitive and non-delay sensitive users. We also consider a theoretically optimal hybrid relaying scheme as a performance benchmark, which allows a dynamic selection between AF relaying and DF relaying protocols with full-duplex and half-duplex relays. We show that under some mild conditions the optimal transmitter precoding and receiver post-processing matrices jointly diagonalize the MIMO-OFDMA relay channels for all considered relaying protocols transforming the resource allocation and scheduling problem into a scalar optimization problem. Dual decomposition is employed to solve this optimization problem and a distributed iterative resource allocation and scheduling algorithm with closed-form power and subcarrier allocation is derived. Simulation results not only illustrate that the proposed distributed algorithm converges to the optimal solution in a small number of iterations, but also demonstrate the potential performance gains achievable with full-duplex relaying protocols.

Full-duplex MIMO relaying: Achievable rates under limited dynamic range

Abstract: In this paper we consider the problem of full-duplex multiple-input multiple-output (MIMO) relaying between multi-antenna source and destination nodes. 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 its 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 derive an analytic approximation to the achievable rate and numerically demonstrate its accuracy.

Relaying operation in 3GPP LTE: challenges and solutions

Abstract: With the ever growing demand of data applications, traditional cellular networks face the challenges of providing enhanced system capacity, extended cell coverage, and improved minimum throughput in a cost-effective manner. Wireless relay stations, especially when operating in a halfduplex operation, make it possible without incurring high site acquisition and backhaul costs. Design of wireless relay stations faces the challenges of providing backward compatibility, minimizing complexity, and maximizing efficiency. This article provides an overview of the challenges and solutions in the design of relay stations as one of the salient features for 3GPP LTE advanced.

Amplify-and-Forward Relay Selection with Outdated Channel Estimates

Abstract: We study the effect of outdated channel state information on the outage and error rate performance of amplify-and-forward (AF) relay selection, where only one out of the set of available relays is activated. We consider two variations of AF relay selection, namely best relay selection and partial relay selection, when the selection is based upon outdated channel estimates. For both these variations, closed-form expressions for the outage probability are obtained, along with approximate expressions for the symbol error rate in the medium to high signal-to-noise-ratio (SNR) regime. The diversity gain and coding gain of the above schemes are also explicitly derived. Numerical results manifest that the outage performance of AF relay selection is highly dependent on the level of correlation between the actual channel conditions and their corresponding (outdated) estimates. This result has a significant impact on the deployment of relay selection in practical applications, implying that a high feedback rate may be required in practice in order to attain the full benefits of relay selection. It is further shown that it may be preferable, in terms of outage and symbol error probability, not to include links in the relay selection process that experience a sufficiently high maximum Doppler shift, since in those cases partial relay selection outperforms best relay selection.

Physical Layer Security for Two-Way Untrusted Relaying With Friendly Jammers

Abstract: In this paper, we consider a two-way relay system where the two sources can only communicate through an untrusted intermediate relay and investigate the physical layer security issue in this two-way untrusted relay scenario. Specifically, we regard the intermediate relay as an eavesdropper from which the information transmitted by the sources needs to be kept confidential, despite the fact that its cooperation in relaying this information is essential. We first indicate that a nonzero secrecy rate is indeed achievable in this two-way untrusted relay system even without the help of external friendly jammers. As for the system with friendly jammers, after further analysis, we can obtain the secrecy rate of the sources can be effectively improved by utilizing proper jamming power from the friendly jammers. Then, we formulate a Stackelberg game between the sources and the friendly jammers as a power control scheme to achieve the optimized secrecy rate of the sources, in which the sources are treated as the sole buyer and the friendly jammers are the sellers. In addition, the optimal solutions of the jamming power and the asking prices are given, and a distributed updating algorithm to obtain the Stackelberg equilibrium is provided for the proposed game. Finally, the simulation results verify the properties and efficiency of the proposed Stackelberg-game-based scheme.

Methods and systems for wireless networks with relays

Abstract: Methods and systems are provided for use with wireless networks having one or more cell in which each cell includes a base station (BS), at least one relay station (RS) and at least one mobile station (MS). The at least one relay station can be used as an intermediate station for providing communication between the BS and MS. Methods are provided for allocating OFDM resources for communicating between the BS, RS and/or MS for example dividing transmission resources into uplink and downlink transmissions and methods of inserting pilot symbols into transmission resources used by the RS. In some embodiments on the invention, the methods are consistent and/or can be used in conjunction with existing standards such as 802.16e.

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

Abstract: 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 multiantenna source nodes exchange information via a multiantenna 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 subproblems, and then propose an iterative precoding design algorithm based on alternating optimization. The solution to each subproblem is optimal and unique, thus the convergence of the iterative algorithm is guaranteed. Second, 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 thus reduces the precoding design to a simple power allocation problem. Last, for the special case where only a single data stream is transmitted from each source node, we present a source-antenna-selection (SAS)-based precoding design algorithm. This algorithm selects only one antenna for transmission from each source and thus requires lower signalling overhead. Comprehensive simulation is conducted to evaluate the effectiveness of all the proposed precoding designs.

Physical Layer Security for Two-Way Untrusted Relaying with Friendly Jammers

Abstract: In this paper, we consider a two-way relay network where two sources can communicate only through an untrusted intermediate relay, and investigate the physical layer security issue of this two-way relay scenario. Specifically, we treat the intermediate relay as an eavesdropper from which the information transmitted by the sources needs to be kept secret, despite the fact that its cooperation in relaying this information is essential. We indicate that a non-zero secrecy rate is indeed achievable in this two-way relay network even without external friendly jammers. As for the system with friendly jammers, after further analysis, we can obtain that the secrecy rate of the sources can be effectively improved by utilizing proper jamming power from the friendly jammers. Then, we formulate a Stackelberg game model between the sources and the friendly jammers as a power control scheme to achieve the optimized secrecy rate of the sources, in which the sources are treated as the sole buyer and the friendly jammers are the sellers. In addition, the optimal solutions of the jamming power and the asking prices are given and a distributed updating algorithm to obtain the Stakelberg equilibrium is provided for the proposed game. Finally, the simulations results verify the properties and the efficiency of the proposed Stackelberg game based scheme.

Cooperative relay techniques for cognitive radio systems: Spectrum sensing and secondary user transmissions

Abstract: Cognitive radio is a promising technology that enables an unlicensed user (also known as a cognitive user) to identify the white space of a licensed spectrum band (called a spectrum hole) and utilize the detected spectrum hole for its data transmissions. To design a reliable and efficient cognitive radio system, there are two fundamental issues: to devise an accurate and robust spectrum sensing algorithm to detect spectrum holes as accurately as possible; and to design a secondary user transmission mechanism for the cognitive user to utilize the detected spectrum holes as efficiently as possible. This article investigates and shows that cooperative relay technology can significantly benefit the abovementioned two issues, spectrum sensing and secondary transmissions. We summarize existing research about the application of cooperative relays for spectrum sensing (referred to as the cooperative sensing) and address the related potential challenges. We discuss the use of cooperative relays for the secondary transmissions with a primary user's quality-of-service (QoS) constraint, for which a diversity-multiplexing trade-off is developed. In addition, this article shows a trade-off design of cognitive transmissions with cooperative relays by jointly considering the spectrum sensing and secondary transmissions in cognitive radio networks.

Wireless power transmission apparatus

Abstract: A wireless power transmission apparatus includes: a transmission resonator installed in one side wall within a specific space and configured to comprise a transmission feeding loop for transmitting impedance matching and power and receive and transmit the impedance matching and power using the transmission feeding loop. Further, the wireless power transmission apparatus includes a relay resonator installed in another side wall within the specific space and configured to have a resonant frequency identical with that of the transmission resonator and store energy in the specific space by generating mutual resonance through a resonance characteristic with the transmission resonator; and one or more reception resonators installed within the specific space and configured to have a resonant frequency identical with that of the transmission resonator and receive the energy stored in the specific space.

Destination assisted cooperative jamming for wireless physical layer security

Abstract: A wireless network with one source, one destination, one eavesdropper, and multiple decode-and-forward relays is considered. A two-slot cooperative relaying scheme is proposed that targets at maximizing the secrecy rate. In the first slot, the source transmits the information bearing signal, and at the same time, it cooperates with the destination in jamming the eavesdropper without creating interference at the relay. In the second slot, one optimally selected relay retransmits the decoded source signal, and at the same time, that particular relay cooperates with the source to jam the eavesdropper without creating interference at the destination. Optimal relay selection and also optimal power allocation among the first/second slot data signal and jamming noise are proposed. It is shown that the secrecy rate of the proposed scheme scales with the total system power P0 and the number of available relays K according to 1/2log2(1 + P0 /8logK) - 1.6 bits/channel use . Although the proposed power allocation and relay selection assume global CSI available, the performance under imperfect relay CSI is also investigated. Also, the performance under distributed relay selection with limited feedback is demonstrated.

Cognitive Amplify-and-Forward Relay Networks Over Nakagami- $m$ Fading

Abstract: In this correspondence, the outage probability (OP) of dual-hop cognitive amplify-and-forward (AF) relay networks subject to independent non-identically distributed (i.n.i.d.) Nakagami-m fading is examined. We assume a spectrum-sharing environment, where two different strategies are proposed to determine the transmit powers of the secondary network. Specifically, the transmit power conditions of the proposed spectrum-sharing network are governed by either the combined power constraint of the interference on the primary network and the maximum transmission power at the secondary network or the single power constraint of the interference on the primary network. Closed-form lower bounds and asymptotic expressions for the OP are derived. Regardless of the transmit power constraint, we reveal that the diversity order is strictly defined by the minimum fading severity between the two hops of the secondary network. This aligns with the well-known result for conventional dual-hop AF relaying without spectrum sharing. Furthermore, the impact of the primary network on the diversity-multiplexing tradeoff is investigated. We confirm that the diversity-multiplexing tradeoff is independent of the primary network.

Bounded Relay Hop Mobile Data Gathering in Wireless Sensor Networks

Abstract: Recent study reveals that great benefit can be achieved for data gathering in wireless sensor networks by employing mobile collectors that gather data via short-range communications. To pursue maximum energy saving at sensor nodes, intuitively, a mobile collector should traverse the transmission range of each sensor in the field such that each data packet can be directly transmitted to the mobile collector without any relay. However, this approach may lead to significantly increased data gathering latency due to the low moving velocity of the mobile collector. Fortunately, it is observed that data gathering latency can be effectively shortened by performing proper local aggregation via multihop transmissions and then uploading the aggregated data to the mobile collector. In such a scheme, the number of local transmission hops should not be arbitrarily large as it may increase the energy consumption on packet relays, which would adversely affect the overall efficiency of mobile data gathering. Based on these observations, in this paper, we study the tradeoff between energy saving and data gathering latency in mobile data gathering by exploring a balance between the relay hop count of local data aggregation and the moving tour length of the mobile collector. We first propose a polling-based mobile gathering approach and formulate it into an optimization problem, named bounded relay hop mobile data gathering (BRH-MDG). Specifically, a subset of sensors will be selected as polling points that buffer locally aggregated data and upload the data to the mobile collector when it arrives. In the meanwhile, when sensors are affiliated with these polling points, it is guaranteed that any packet relay is bounded within a given number of hops. We then give two efficient algorithms for selecting polling points among sensors. The effectiveness of our approach is validated through extensive simulations.

Relay Placement for Physical Layer Security: A Secure Connection Perspective

Abstract: This work studies the problem of secure connection in cooperative wireless communication with two relay strategies, decode-and-forward (DF) and randomize-and-forward (RF). The four-node scenario and cellular scenario are considered. For the typical four-node (source, destination, relay, and eavesdropper) scenario, we derive the optimal power allocation for the DF strategy and find that the RF strategy is always better than the DF to enhance secure connection. In cellular networks, we show that without relay, it is difficult to establish secure connections from the base station to the cell edge users. The effect of relay placement for the cell edge users is demonstrated by simulation. For both scenarios, we find that the benefit of relay transmission increases when path loss becomes severer.

Optimal Power Allocation and Outage Analysis for Cognitive Full Duplex Relay Systems

Abstract: This paper investigates the use of full duplex relaying (FDR) in cognitive radio systems. Cognitive full duplex relay networks (CogFRNs) offer the advantage not only of increasing spectral efficiency by spectrum sharing but also of extending coverage through the use of relays. Concurrent transmissions at the source and relay in CogFRNs can overcome a loss of resource efficiency in a way that conventional half duplex relay (HDR) systems cannot. However, in CogFRNs, the primary user experiences interference from the secondary source and relay simultaneously due to the effects of full duplexing. Satisfying the interference constraint by simply reducing transmission power results in performance degradation for the secondary user. What is therefore needed is a way to optimize the transmission powers at the secondary source and relay. To address this need, we propose an optimal power allocation scheme based on minimizing the outage probability in CogFRNs. We then analyze the outage probability of the secondary user in the noise-limited and interference-limited environments. In addition, we also propose an outage-constrained power allocation scheme which does not require the instantaneous channel state information (CSI) for the link between the primary and secondary users. Simulation results show that the proposed schemes achieve performance improvement in terms of outage probability.

Cognitive Relay Networks With Multiple Primary Transceivers Under Spectrum-Sharing

Abstract: We examine the impact of multiple primary transmitters and receivers (PU-TxRx) on the outage performance of cognitive decode-and-forward relay networks. In such a joint relaying/spectrum-sharing arrangement, we address fundamental questions concerning three key power constraints: 1) maximum transmit power at the secondary transmitter (SU-Tx), 2) peak interference power at the primary receivers (PU-Rx), and 3) interference power at SU-Rx caused by the primary transmitter (PU-Tx). Our answers to these are given in new analytical expressions for the exact and asymptotic outage probability of the secondary relay network. Based on our asymptotic expressions, important design insights into the impact of primary transceivers on the performance of cognitive relay networks is reached. We have shown that zero diversity order is attained when the peak interference power at the PU-Rx is independent of the maximum transmit power at the SU-Tx.

Performance Study of Two-Hop Amplify-and-Forward Systems With Untrustworthy Relay Nodes

Abstract: This paper investigates the problem of secure communication for amplify-and-forward (AF) systems with untrustworthy relay nodes. To achieve positive secrecy rate, the destination-based jamming (DBJ) technique is applied. We first focus on the single-relay scenario, for which the closed-form expression for the lower bound of the ergodic secrecy capacity (ESC) is derived. Afterward, we extend the DBJ method to the multi-relay scenario and propose a secure relay selection scheme that can maximize the achievable secrecy rate. Based on the extreme-value theory, the approximate ESC is characterized. Our work reveals an interesting result that, when the relay nodes are untrustworthy, the system performance worsens as the number of relays increases.

Relay Placement for Physical Layer Security: A Secure Connection Perspective

Abstract: This work studies the problem of secure connection in cooperative wireless communication with two relay strategies, decode-and-forward (DF) and randomize-and-forward (RF). The four-node scenario and cellular scenario are considered. For the typical four-node (source, destination, relay, and eavesdropper) scenario, we derive the optimal power allocation for the DF strategy and find that the RF strategy is always better than the DF to enhance secure connection. In cellular networks, we show that without relay, it is difficult to establish secure connections from the base station to the cell edge users. The effect of relay placement for the cell edge users is demonstrated by simulation. For both scenarios, we find that the benefit of relay transmission increases when path loss becomes severer.

Energy-Efficient Relay Selection and Power Allocation for Two-Way Relay Channel with Analog Network Coding

Abstract: In this letter, we consider a two-way relay channel (TWRC) with two end nodes and k relay nodes, where end nodes have the full channel-state information (CSI) and relay nodes only have the channel-amplitude information (CAI). With the objective of minimizing transmit power consumption at required end-to-end rates, energy-efficient relay selection (RS) and power allocation (PA) scheme is studied for TWRC based on analog network coding (ANC). Firstly, we propose an energy-efficient single RS and PA (E-SRS-PA) scheme, where the best relay node is selected to minimize total transmit power. Then, we prove that E-SRS-PA scheme is the optimal energy-efficient RS and PA (OE-RS-PA) scheme in ANC-based TWRC, and thus the optimal number of relay nodes to be selected in energy efficiency sense is equal to one. In addition, the closed-form expressions of optimal power allocation of E-SRS-PA scheme are derived. Numerical simulations confirm the optimality of proposed E-SRS-PA and demonstrate the energy efficiency of ANC-based TWRC compared with the other relaying schemes.

Spectrum-Aware Opportunistic Routing in Multi-Hop Cognitive Radio Networks

Abstract: In this paper, cognitive routing coupled with spectrum sensing and sharing in a multi-channel multi-hop cognitive radio network (CRN) is investigated. Recognizing the spectrum dynamics in CRN, we propose an opportunistic cognitive routing (OCR) protocol that allows users to exploit the geographic location information and discover the local spectrum access opportunities to improve the transmission performance over each hop. Specifically, based on location information and channel usage statistics, a secondary user (SU) distributedly selects the next hop relay and adapts its transmission to the dynamic spectrum access opportunities in its neighborhood. In addition, we introduce a novel metric, namely, cognitive transport throughput (CTT), to capture the unique properties of CRN and evaluate the potential relay gain of each relay candidate. A heuristic algorithm is proposed to reduce the searching complexity of the optimal selection of channel and relay. Simulation results are given to demonstrate that our proposed OCR well adapts to the spectrum dynamics and outperforms existing routing protocols in CRN.

Optimal Relay Selection and Power Allocation for Cognitive Two-Way Relaying Networks

Abstract: 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.