In this survey paper, we characterize the learning problem in cognitive radios (CRs) and state the importance of artificial intelligence in achieving real cognitive communications systems. We review various learning problems that have been studied in the context of CRs classifying them under two main categories: Decision-making and feature classification. Decision-making is responsible for determining policies and decision rules for CRs while feature classification permits identifying and classifying different observation models. The learning algorithms encountered are categorized as either supervised or unsupervised algorithms. We describe in detail several challenging learning issues that arise in cognitive radio networks (CRNs), in particular in non-Markovian environments and decentralized networks, and present possible solution methods to address them. We discuss similarities and differences among the presented algorithms and identify the conditions under which each of the techniques may be applied.

A Survey on Machine-Learning Techniques in Cognitive Radios

Cognitive users need to detect primary users continuously and rapidly.Cooperative spectrum sensing in cognitive radio(CR) networks is analyzed.Cooperative spectrum sensing in the ideal network with two cognitive users can reduce the mean detection time.Detection probability to primary users can be improved by multi-cooperative users in multi-user networks.Finally,the realization of multi-user networks is considered.

Cooperative Spectrum Sensing in Cognitive Radio Networks

Massive multiple-input multiple-output (MIMO) is a key technology to meet the user demands in performance and quality of services (QoS) for next generation communication systems. Due to a large number of antennas and radio frequency (RF) chains, complexity of the symbol detectors increased rapidly in a massive MIMO uplink receiver. Thus, the research to find the perfect massive MIMO detection algorithm with optimal performance and low complexity has gained a lot of attention during the past decade. A plethora of massive MIMO detection algorithms has been proposed in the literature. The aim of this paper is to provide insights on such algorithms to a generalist of wireless communications. We garner the massive MIMO detection algorithms and classify them so that a reader can find a distinction between different algorithms from a wider range of solutions. We present optimal and near-optimal detection principles specifically designed for the massive MIMO system such as detectors based on a local search, belief propagation and box detection. In addition, we cover detectors based on approximate inversion, which has gained popularity among the VLSI signal processing community due to their deterministic dataflow and low complexity. We also briefly explore several nonlinear small-scale MIMO (2-4 antenna receivers) detectors and their applicability in the massive MIMO context. In addition, we present recent advances of detection algorithms which are mostly based on machine learning or sparsity based algorithms. In each section, we also mention the related implementations of the detectors. A discussion of the pros and cons of each detector is provided.

/pdf/massive-mimo-detection-techniques-a-survey-1hj40069of.pdf

Massive MIMO Detection Techniques: A Survey

2009 International Conference on Future Computer and Communication

For conventional wireless networks, the main target of resource allocation (RA) is to efficiently utilize the available resources. Generally, there are no changes in the available spectrum, thus static spectrum allocation policies were adopted. However, these allocation policies lead to spectrum under-utilization. In this regard, cognitive radio networks (CRNs) have received great attention due to their potential to improve the spectrum utilization. In general, efficient spectrum management and resource allocation are essential and very crucial for CRNs. This is due to the fact that unlicensed users should attain the most benefit from accessing the licensed spectrum without causing adverse interference to the licensed ones. The cognitive users or called secondary users have to effectively capture the arising spectrum opportunities in time, frequency, and space to transmit their data. Mainly, two aspects characterize the resource allocation for CRNs: 1) primary (licensed) network protection and 2) secondary (unlicensed) network performance enhancement in terms of quality-of-service, throughput, fairness, energy efficiency, etc. CRNs can operate in one of three known operation modes: 1) interweave; 2) overlay; and 3) underlay. Among which the underlay cognitive radio mode is known to be highly efficient in terms of spectrum utilization. This is because the unlicensed users are allowed to share the same channels with the active licensed users under some conditions. In this paper, we provide a survey for resource allocation in underlay CRNs. In particular, we first define the RA process and its components for underlay CRNs. Second, we provide a taxonomy that categorizes the RA algorithms proposed in literature based on the approaches, criteria, common techniques, and network architecture. Then, the state-of-the-art resource allocation algorithms are reviewed according to the provided taxonomy. Additionally, comparisons among different proposals are provided. Finally, directions for future research are outlined.

Resource Allocation for Underlay Cognitive Radio Networks: A Survey

Particle swarm optimization (PSO) is one of the most well-regarded swarm-based algorithms in the literature. Although the original PSO has shown good optimization performance, it still severely suffers from premature convergence. As a result, many researchers have been modifying it resulting in a large number of PSO variants with either slightly or significantly better performance. Mainly, the standard PSO has been modified by four main strategies: modification of the PSO controlling parameters, hybridizing PSO with other well-known meta-heuristic algorithms such as genetic algorithm (GA) and differential evolution (DE), cooperation and multi-swarm techniques. This paper attempts to provide a comprehensive review of PSO, including the basic concepts of PSO, binary PSO, neighborhood topologies in PSO, recent and historical PSO variants, remarkable engineering applications of PSO, and its drawbacks. Moreover, this paper reviews recent studies that utilize PSO to solve feature selection problems. Finally, eight potential research directions that can help researchers further enhance the performance of PSO are provided.

https://ieeexplore.ieee.org/ielx7/6287639/9668973/09680690.pdf

Particle Swarm Optimization: A Comprehensive Survey

Internet of Things (IoT) connects everything in the smart world, and thus, energy consumption of IoT technology is a challenge and attractive research area. Motivated by achieving a low power consumption IoT, a green IoT is proposed. This paper provides an overview regarding green IoT. It also discusses the life cycle of green IoT which contains green design, green production, green utilization, and green recycling. Furthermore, green IoT technologies such as green tags, green sensing networks and green internet technologies are discussed. In addition, studies of IoT in 5G and IoT for smart cities are presented. Finally, future research directions and open challenges about green IoT are presented.

Green internet of things (IoT): An overview

Preparation, thermal, magnetic and microwave absorption properties of thermoplastic natural rubber matrix impregnated with NiZn ferrite nanoparticles

Joint consideration of interference, resource utilization, fairness, and complexity issues is generally lacking in existing resource allocation schemes for Long-Term Evolution (LTE)/LTE-Advanced femtocell networks. To tackle this, we employ a hybrid spectrum allocation approach whereby the spectrum is split between the macrocell and its nearby interfering femtocells based on their resource demands, whereas the distant femtocells share the entire spectrum. A multiobjective problem is formulated for resource allocation between femtocells and is decomposed using a lexicographic optimization approach into two subproblems. A greedy algorithm of reasonably low complexity is proposed to solve these subproblems sequentially. Simulation results show that the proposed scheme achieves substantial throughput and packet loss improvements in low-density femtocell deployment scenarios while performing satisfactorily in high-density femtocell deployment scenarios with substantial complexity and overhead reduction. The proposed scheme also performs nearly as well as the optimal solution obtained by exhaustive search.

/pdf/fair-resource-allocation-with-interference-mitigation-and-1xwibjephx.pdf

Ayman A. El-Saleh

Papers

2009 International Conference on Future Computer and Communication

Particle Swarm Optimization: A Comprehensive Survey

Green internet of things (IoT): An overview

Preparation, thermal, magnetic and microwave absorption properties of thermoplastic natural rubber matrix impregnated with NiZn ferrite nanoparticles

Fair Resource Allocation With Interference Mitigation and Resource Reuse for LTE/LTE-A Femtocell Networks