The two-way wiretap channel is considered in this paper. 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, new achievable secrecy rate regions are obtained 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

In this work, we study the problem of band allocation of Mi buffered (i.e., with data queues capable of storing incoming traffic packets) secondary users (SUs) to Mp primary frequency bands licensed to (owned by) Mp buffered primary users. The bands are assigned to SUs in an orthogonal (one-to-one) fashion, such that neither band sharing nor multiband allocations are permitted. In order to study the stability region of the secondary network, the optimization problem used to obtain the stability region's envelope (closure) is established and is shown to be a linear program, which can be solved

In this paper, we derive the capacity of the deterministic relay networks with relay messages. We consider a network that consists of five nodes, four of which can only communicate via the fifth one. However, the fifth node is not merely a relay as it may exchange private messages with the other network nodes. First, we develop an upper bound on the capacity region based on the notion of a single-sided genie. In the course of the achievability proof, we also derive the deterministic capacity of a four-user relay network (without private messages at the relay). The capacity achieving schemes

This paper investigates the maximum throughput for a rechargeable secondary user (SU) sharing the spectrum with a primary user (PU) plugged to a reliable power supply. The SU maintains a finite energy queue and harvests energy from natural resources and primary radio frequency (RF) transmissions. We propose a power allocation policy at the PU and analyze its effect on the throughput of both the PU and SU Furthermore, we study the impact of the bursty arrivals at the PU on the energy harvested by the SU from RF transmissions. Moreover, we investigate the impact of the rate of energy harvesting

We investigate the degrees of freedom (DoF) of the downlink of a cellular relay network. In this network, two base stations transmit to two mobile stations via relays due to the absence of a direct communication link. Each base station and mobile station is equipped with M antennas. Each base station has two messages; one to each mobile station, and uses two relays to transmit to the mobile stations. The relays are half duplex, decode-and-forward and equipped with N antennas each. We consider two configurations of the relays; shared and dedicated relays. In the shared relays configuration, the

We consider a cooperative relaying system with two source terminals, one full duplex relay, and a common destination. Each terminal has a local traffic queue while the relay has two relaying queues to store the relayed source packets. We assume that the source terminals transmit packets in orthogonal frequency bands. In contrast to previous work which assumes a time division multi-access cooperation strategy, we assume that the source terminals and the relay simultaneously transmit their packets to the common destination through a multi-access channel (MAC). A new cooperative MAC scheme for

In this paper, we consider a cooperative relaying scenario with multiple sources transmitting to one or more destination nodes through several relay terminals. Each relay is equipped with multiple receive and transmit antennas. We assume that the relays can estimate their uplink (relay-destination) channels with enough accuracy and that they have access to the training sequences transmitted by the sources. We present two adaptive training-based algorithms for multiuser relay beamforming. Both algorithms use Kalman filtering to estimate the beamforming matrices iteratively. The first algorithm

In this paper, we consider a cognitive radio (CR) network where the primary network's feedback information is utilized to develop an access scheme for the secondary network to exploit the underutilized primary spectrum resources. Secondary users (SUs) identify the spectrum opportunities by sensing the spectrum for primary users (PUs) activities and by listening to the PUs feedback. The feedback signals monitored in this research work are the channel quality indicator (CQI) and automatic repeat request (ARQ) available in the PUs network. For detecting the PUs activities, SUs employ soft energy

In this paper, we introduce a new metric, namely: effective area spectral efficiency (EASE), to quantify the spectral efficiency as well as the spatial properties of decoding and forward (DF) relaying wireless communications networks with interference management. The EASE metric is based on the average affected area, the average ergodic capacity, and a new introduced index, namely: source relay communication index (SRCndx). We derive a closed-form expression for the maximum transmission range under Rayleigh fading environment. Based on the maximum transmission range, we define and derive the

We investigate a cognitive radio scenario involving a single cognitive transmitter equipped with K antennas sharing the spectrum with M primary users (PUs) transmitting over orthogonal bands. Each terminal has a queue to store its incoming traffic. We propose a novel protocol where the cognitive user transmits its packet over a channel formed by the aggregate of the inactive primary bands. We study the impact of the number of PUs, sensing errors, and the number of antennas on the maximum secondary stable throughput. © 2014 IEEE.