Interference Alignment for Cognitive Radio Communications and Networks: A Survey

© 2019 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).Interference alignment (IA) is an innovative wireless transmission strategy that has shown to be a promising technique for achieving optimal capacity scaling of a multiuser interference channel at asymptotically high-signal-to-noise ratio (SNR). Transmitters exploit the availability of multiple signaling dimensions in order to align their mutual interference at the receivers. Most of the research has focused on developing algorithms for determining alignment solutions as well as proving interference alignment’s theoretical ability to achieve the maximum degrees of freedom in a wireless network. Cognitive radio, on the other hand, is a technique used to improve the utilization of the radio spectrum by opportunistically sensing and accessing unused licensed frequency spectrum, without causing harmful interference to the licensed users. With the increased deployment of wireless services, the possibility of detecting unused frequency spectrum becomes diminished. Thus, the concept of introducing interference alignment in cognitive radio has become a very attractive proposition. This paper provides a survey of the implementation of IA in cognitive radio under the main research paradigms, along with a summary and analysis of results under each system model.Peer reviewe

Beam Selection and Discrete Power Allocation in Opportunistic Cognitive Radio Systems with Limited Feedback Using ESPAR Antennas

We consider an opportunistic cognitive radio (CR) system consisting of a primary user (PU), secondary transmitter (SUtx), and secondary receiver (SUrx), where SUtx is equipped with an electrically steerable parasitic array radiator (ESPAR) antenna with the capability of choosing one beam among M beams for sensing and communication, and there is a limited feedback channel from SUrx to SUtx. Taking a holistic approach, we develop a framework for integrated sector-based spectrum sensing and sector-based data communication. Upon sensing the channel busy, SUtx determines the beam corresponding to PU's orientation. Upon sensing the channel idle, SUtx transmits data to SUrx, using the selected beam corresponding to the strongest channel between SUtx and SUrx. We formulate a constrained optimization problem, where SUtx-SUrx link ergodic capacity is maximized, subject to average transmit and interference power constraints, and the optimization variables are sensing duration, thresholds of channel quantizer at SUrx, and transmit power levels at SUtx. Since this problem is non-convex we develop a suboptimal computationally efficient iterative algorithm to find the solution. Our results demonstrate that our CR system yields a significantly higher capacity, and lower outage and symbol error probabilities, compared with a CR system that its SUtx has an omni-directional antenna.Comment: This paper has been submitted to IEEE Transactions on Cognitive Communications and Networkin

Autonomous Algorithms for Centralized and Distributed Interference Coordination: A Virtual Layer Based Approach

Interference mitigation techniques are essential for improving the performance of interference limited wireless networks. In this paper, we introduce novel interference mitigation schemes for wireless cellular networks with space division multiple access (SDMA). The schemes are based on a virtual layer that captures and simplifies the complicated interference situation in the network and that is used for power control. We show how optimization in this virtual layer generates gradually adapting power control settings that lead to autonomous interference minimization. Thereby, the granularity of control ranges from controlling frequency sub-band power via controlling the power on a per-beam basis, to a granularity of only enforcing average power constraints per beam. In conjunction with suitable short-term scheduling, our algorithms gradually steer the network towards a higher utility. We use extensive system-level simulations to compare three distributed algorithms and evaluate their applicability for different user mobility assumptions. In particular, it turns out that larger gains can be achieved by imposing average power constraints and allowing opportunistic scheduling instantaneously, rather than controlling the power in a strict way. Furthermore, we introduce a centralized algorithm, which directly solves the underlying optimization and shows fast convergence, as a performance benchmark for the distributed solutions. Moreover, we investigate the deviation from global optimality by comparing to a branch-and-bound-based solution.Comment: revised versio

Multiple Access Techniques for Next Generation Wireless: Recent Advances and Future Perspectives

The advances in multiple access techniques has been one of the key drivers in moving from one cellular generation to another. Starting from the first generation, several multiple access techniques have been explored in different generations and various emerging multiplexing/multiple access techniques are being investigated for the next generation of cellular networks. In this context, this paper first provides a detailed review on the existing Space Division Multiple Access (SDMA) related works. Subsequently, it highlights the main features and the drawbacks of various existing and emerging multiplexing/multiple access techniques. Finally, we propose a novel concept of clustered orthogonal signature division multiple access for the next generation of cellular networks. The proposed concept envisions to employ joint antenna coding in order to enhance the orthogonality of SDMA beams with the objective of enhancing the spectral efficiency of future cellular networks

Opportunistic Interference Mitigation Achieves Optimal Degrees-of-Freedom in Wireless Multi-cell Uplink Networks

We introduce an opportunistic interference mitigation (OIM) protocol, where a user scheduling strategy is utilized in $K$-cell uplink networks with time-invariant channel coefficients and base stations (BSs) having $M$ antennas. Each BS opportunistically selects a set of users who generate the minimum interference to the other BSs. Two OIM protocols are shown according to the number $S$ of simultaneously transmitting users per cell: opportunistic interference nulling (OIN) and opportunistic interference alignment (OIA). Then, their performance is analyzed in terms of degrees-of-freedom (DoFs). As our main result, it is shown that $KM$ DoFs are achievable under the OIN protocol with $M$ selected users per cell, if the total number $N$ of users in a cell scales at least as $\text{SNR}^{(K-1)M}$. Similarly, it turns out that the OIA scheme with $S$($<M$) selected users achieves $KS$ DoFs, if $N$ scales faster than $\text{SNR}^{(K-1)S}$. These results indicate that there exists a trade-off between the achievable DoFs and the minimum required $N$. By deriving the corresponding upper bound on the DoFs, it is shown that the OIN scheme is DoF optimal. Finally, numerical evaluation, a two-step scheduling method, and the extension to multi-carrier scenarios are shown.Comment: 18 pages, 3 figures, Submitted to IEEE Transactions on Communication