Search

The main contribution of this paper is to analyze a long networked flying platform (NFP)-based millimeter wave (mmWave) backhaul link that is offered as a cost effective and easy to deploy solution to connect a disaster or remote area to the nearest core network. For this aim, we characterize the backhaul channel as a function of realistic physical parameters such as heights and distances of obstacles along the route, flight altitude and the intensity of NFPs' vibrations, the real 3D antenna pattern provided by 3GPP, etc. For the characterized channel, we derive an analytical closed-form expression for the outage probability. Finally, using the obtained results, we provide a fast algorithm for the optimal parameter design of the considered system that minimizes the cost.

In this paper, we characterize the asymmetric total degrees of freedom (DoF) of a multiple-input multiple-output (MIMO) 3-way channel. Each node has a separate-antenna full-duplex MIMO transceiver with a different number of antennas, where each antenna can be configured for either signal transmission or reception. We study this system under two message configurations; the first configuration is when each node has two unicast messages to be delivered to the two other nodes, while the second configuration is when each node has two unicast messages as well as one broadcast message to be delivered to the two other nodes. For each configuration, we first derive upper bounds on the total DoF of the system. Cut-set bounds in conjunction with genie-aided bounds are derived to characterize the achievable total DoF. Afterwards, we analytically derive the optimal number of transmit and receive antennas at each node to maximize the total DoF of the system, subject to the total number of antennas at each node. Finally, the achievable schemes for each configuration are constructed. The proposed schemes are mainly based on zero-forcing and null-space transmit beamforming.

We investigate the secure degrees of freedom (SDoF) of the K-user MIMO multiple access (MAC) and the two user MIMO interference channel. An unknown number of eavesdroppers are trying to decode the messages sent by the transmitters. Each eavesdropper is equipped with a number of antennas less than or equal to a known value NE. The legitimate transmitters and receivers are assumed to have global channel knowledge. We present the sum SDoF of the two user MIMO interference channel. We derive an upperbound on the sum SDoF of the K-user MAC channel and present an achievable scheme that partially meets the derived upperbound., Comment: arXiv admin note: substantial text overlap with arXiv:1404.5007

In this letter, we propose the interference cancellation through interference alignment at the downlink of cognitive cellular networks. Interference alignment helps the spatial resources to be shared among primary and secondary cells and thus, it can provide higher degrees of freedom through interference cancellation. We derive and depict the achievable degrees of freedom. We also analyse and calculate the achievable sum rates applying water-filling optimal power allocation.

In this paper, the 3-user Gaussian MIMO interference channel is considered. The asymmetric distribution of the DoF, where different users have different number of DoF, is studied. Two cases are presented, the first is when all transmitters and receivers have equal number of antennas $M$, the other when the transmitters have $M$ antennas each, while the receivers have $N$ antennas each. It is assumed that the channel coefficients are constant and known to all transmitters and receivers. The region of the achievable DoF tuple $(d_1; d_2; d_3)$ is presented.

In this paper, the degrees of freedom (DoF) of the two-user single input single output (SISO) X-channel are investigated. Three cases are considered for the availability of channel state information at the transmitters (CSIT); perfect, delayed, and no-CSIT. A new achievable scheme is proposed to elucidate the potency of interference creation-resurrection (IRC) when the available CSIT alternates between these three cases. For some patterns of alternating CSIT, the proposed scheme achieves $4/3$ DoF, and hence, coincides with the information theoretic upper bound on the DoF of the two-user X-channel with perfect and instantaneous CSIT. The CSIT alternation patterns are investigated where the patterns that provide extraordinary synergistic gain and dissociative ones are identified., accepted at 2014 IEEE International Symposium on Information Theory for presentation at the symposium and for publication in the proceedings

We investigate the secure degrees of freedom (SDoF) of a two-transmitter Gaussian multiple access channel with multiple antennas at the transmitters, the legitimate receiver with the existence of an unknown number of eavesdroppers each with a number of antennas less than or equal to a known value $N_E$. The channel matrices between the legitimate transmitters and the receiver are available everywhere, while the legitimate pair does not know the eavesdroppers' channels matrices. We provide the exact sum SDoF for the considered system. A new comprehensive upperbound is deduced and a new achievable scheme based on utilizing jamming is exploited. We prove that Cooperative Jamming is SDoF optimal even without the instantaneous eavesdropper CSI available at the transmitters.

We investigate a cognitive radio scenario involving a single cognitive transmitter equipped with $\mathcal{K}$ antennas sharing the spectrum with $\mathcal{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.

We investigate the secure degrees of freedom (SDoF) of the wiretap and the K user Gaussian broadcast channels with multiple antennas at the transmitter, the legitimate receivers and an unknown number of eavesdroppers each with a number of antennas less than or equal to a known value NE. The channel matrices between the legitimate transmitter and the receivers are available everywhere, while the legitimate pair have no information about the eavesdroppers' channels. We provide the exact sum SDoF for the considered system. A new comprehensive upperbound is deduced and a new achievable scheme based on utilizing jamming is exploited. We prove that cooperative jamming is SDoF optimal even without the eavesdropper CSI available at the transmitters., Comment: arXiv admin note: text overlap with arXiv:1404.5007

The multi-user diversity in spectrum sharing cognitive radio systems with average power constraints over fading channels is investigated. Average power constraints are imposed for both the transmit power at the secondary transmitter and the interference power received at the primary receiver in order to provide optimal power allocation for capacity maximization at the secondary system and protection at the primary system respectively. Multiple secondary and primary receivers are considered and the corresponding fading distributions for the Rayleigh and Nakagami-m fading channels are derived. Based on the derived formulation of the fading distributions, the average achievable channel capacity and the outage probability experienced at the secondary system are obtained, revealing the impact of the average power constraints on optimal power allocation in multi-user diversity technique in fading environments with multiple secondary and primary receivers that share the same channel. The obtained results highlight the advantage of having on one hand more secondary receivers and on the other hand fewer primary receivers manifested as an increase in the achievable capacity., This paper has been withdrawn since it has been revised significantly and submitted to IEEE Transactions on Communications

Interference is a principal source of capacity limitations in today's multi-access multi-user wireless systems. Despite the fact that the capacity of interference channels is still an unsolved problem, the research community has already established a substantial work towards this goal. In effort to provide alternative attainable expressions for performance limits in interference channels, the concept of the Degrees of Freedom (DoF) has been introduced. DoF describes network capacity in terms of the number of maximum possible simultaneous interference-free streams. X-channel is defined where there are two transmitters, two receivers and each transmitter has an independent message for each receiver. Interference channel, broadcast channel and the multiple access channels are special cases of the X-channel. In this thesis, we further investigate the effect of a relay on the DoF of a single input single output (SISO) X-channel with no channel state information at transmitters (CSIT). In contrast to previous work, which has focused on two antennas at the relay to achieve the optimal 4/3 DoF, we focus on the case of a single antenna half duplex relay. We show that with a single antenna relay and delayed output feedback, the upper bound of 4/3 DoF for the X-channel is achievable and we provide the achievability scheme. We revisit the previously studied case of single antenna relay in the more practical setting of alternating CSIT. We show that the optimal 4/3 DoF achievability does not mandate full CSIT availability. For the case of partial alternating CSIT availability at the relay transmitters, we propose a scheme that can achieve the optimal 4/3 DoF and we deduce the minimum CSIT availability for the proposed scheme to achieve optimality.