Comprehensive survey on quality of service provisioning approaches in cognitive radio networks : part one

Much interest in Cognitive Radio Networks (CRNs) has been raised recently by enabling unlicensed (secondary) users to utilize the unused portions of the licensed spectrum. CRN utilization of residual spectrum bands of Primary (licensed) Networks (PNs) must avoid harmful interference to the users of PNs and other overlapping CRNs. The coexisting of CRNs depends on four components: Spectrum Sensing, Spectrum Decision, Spectrum Sharing, and Spectrum Mobility. Various approaches have been proposed to improve Quality of Service (QoS) provisioning in CRNs within fluctuating spectrum availability. However, CRN implementation poses many technical challenges due to a sporadic usage of licensed spectrum bands, which will be increased after deploying CRNs. Unlike traditional surveys of CRNs, this paper addresses QoS provisioning approaches of CRN components and provides an up-to-date comprehensive survey of the recent improvement in these approaches. Major features of the open research challenges of each approach are investigated. Due to the extensive nature of the topic, this paper is the first part of the survey which investigates QoS approaches on spectrum sensing and decision components respectively. The remaining approaches of spectrum sharing and mobility components will be investigated in the next part

Simultaneous wireless information and power transfer (SWIPT) in cooperative networks

2019 Spring.Includes bibliographical references.In recent years, the capacity and charging speed of batteries have become the bottleneck of mobile communications systems. Energy harvesting (EH) is regarded as a promising technology to significantly extend the lifetime of battery-powered devices. Among many EH technologies, simultaneous wireless information and power transfer (SWIPT) proposes to harvest part of the energy carried by the wireless communication signals. In particular, SWIPT has been successfully applied to energy-constrained relays that are mainly or exclusively powered by the energy harvested from the received signals. These relays are known as EH relays, which attract significant attention in both the academia and the industry. In this research, we investigate the performance of SWIPT-based EH cooperative networks and the optimization problems therein. Due to hardware limitations, the energy harvesting circuit cannot decode the signal directly. Power splitting (PS) is a popular and effective solution to this problem. Therefore, we focus on PS based SWIPT in this research. First, different from existing work that employs time-switching (TS) based SWIPT, we propose to employ PS based SWIPT for a truly full-duplex (FD) EH relay network, where the information reception and transmission take place simultaneously at the relay all the time. This more thorough exploitation of the FD feature consequently leads to a significant capacity improvement compared with existing alternatives in the literature. Secondly, when multiple relays are available in the network, we explore the relay selection (RS) and network beamforming techniques in EH relay networks. Assuming orthogonal bandwidth allocation, both single relay selection (SRS) and general relay selection (GRS) without the limit on the number of cooperating relays are investigated and the corresponding RS methods are proposed. We will show that our proposed heuristic GRS methods outperform the SRS methods and achieve very similar performance compared with the optimal RS method achieved by exhaustive search but with dramatically reduced complexity. Under the shared bandwidth assumption, network beamforming among EH relays is investigated. We propose a joint PS factor optimization method based on semidefinite relaxation. Simulations show that network beamforming achieves the best performance among all other cooperative techniques. Finally, we study the problem of power allocation and PS factor optimization for SWIPT over doubly-selective wireless channels. In contrast to existing work in the literature, we take the channel variation in both time and frequency domains into consideration and jointly optimize the power allocation and the PS factors. The objective is to maximize the achievable data rate with constraints on the delivered energy in a time window. Since the problem is difficult to solve directly due to its nonconvexity, we proposed a two-step approach, named joint power allocation and splitting (JoPAS), to solve the problem along the time and frequency dimensions sequentially. Simulations show significantly improved performance compared with the existing dynamic power splitting scheme. A suboptimal heuristic algorithm, named decoupled power allocation and splitting (DePAS), is also proposed with significantly reduced computational complexity and simulations demonstrate its near-optimum performance

An Enhanced Dynamic Spectrum Allocation Method on Throughput Maximization in Urban 5G FBMC Heterogeneous Network

Reports have shown that the demand for data managed by wireless systems is expected to grow by more than 500 exabytes by 2025 and beyond. 5G networks are predicted to meet these demands, provided that the spectrum resources are well managed. In this paper, an enhanced dynamic spectrum allocation (E-DSA) method is proposed, which incorporates a cooperative type of game theory called the Nash bargaining solution (NBS). It was assumed that there is one primary user (PU) and two secondary users (SU) in the network and their spectrum allocation was analyzed by testing the validity of the algorithm itself by using price weight factors to control the costs of the spectrum sharing. The solution was established by combining a proposed multiplexing method called the Filter Bank Multicarrier (FBMC) for 5G configuration, with the E-DSA algorithm to maximize the throughput of a heterogeneous 5G network. It was shown that the throughputs for 5G with E-DSA implementation were always higher than those of the ones without E-DSA. The simulation was done using the LabVIEW communication software and was analyzed based on a 5G urban macro and micro network configuration to validate the heterogeneity of the network

Resource Management in Multicarrier Based Cognitive Radio Systems

The ever-increasing growth of the wireless application and services affirms the importance of the effective usage of the limited radio spectrum. Existing spectrum management policies have led to significant spectrum under-utilization. Recent measurements showed that large range of the spectrum is sparsely used in both temporal and spatial manner. This conflict between the inefficient usage of the spectrum and the continuous evolution in the wireless communication calls upon the development of more flexible management policies. Cognitive radio (CR) with the dynamic spectrum access (DSA) is considered to be a key technology in making the best solution of this conflict by allowing a group of secondary users (SUs) to share the radio spectrum originally allocated to the primary user (PUs). The operation of CR should not negatively alter the performance of the PUs. Therefore, the interference control along with the highly dynamic nature of PUs activities open up new resource allocation problems in CR systems. The resource allocation algorithms should ensure an effective share of the temporarily available frequency bands and deliver the solutions in timely fashion to cope with quick changes in the network. In this dissertation, the resource management problem in multicarrier based CR systems is considered. The dissertation focuses on three main issues: 1) design of efficient resource allocation algorithms to allocate subcarriers and powers between SUs such that no harmful interference is introduced to PUs, 2) compare the spectral efficiency of using different multicarrier schemes in the CR physical layer, specifically, orthogonal frequency division multiplexing (OFDM) and filter bank multicarrier (FBMC) schemes, 3) investigate the impact of the different constraints values on the overall performance of the CR system. Three different scenarios are considered in this dissertation, namely downlink transmission, uplink transmission, and relayed transmission. For every scenario, the optimal solution is examined and efficient sub-optimal algorithms are proposed to reduce the computational burden of obtaining the optimal solution. The suboptimal algorithms are developed by separate the subcarrier and power allocation into two steps in downlink and uplink scenarios. In the relayed scenario, dual decomposition technique is used to obtain an asymptotically optimal solution, and a joint heuristic algorithm is proposed to find the suboptimal solution. Numerical simulations show that the proposed suboptimal algorithms achieve a near optimal performance and perform better than the existing algorithms designed for cognitive and non-cognitive systems. Eventually, the ability of FBMC to overcome the OFDM drawbacks and achieve more spectral efficiency is verified which recommends the consideration of FBMC in the future CR systems.El crecimiento continuo de las aplicaciones y servicios en sistemas inal´ambricos, indica la importancia y necesidad de una utilizaci´on eficaz del espectro radio. Las pol´ıticas actuales de gesti´on del espectro han conducido a una infrautilizaci´on del propio espectro radioel´ectrico. Recientes mediciones en diferentes entornos han mostrado que gran parte del espectro queda poco utilizado en sus ambas vertientes, la temporal, y la espacial. El permanente conflicto entre el uso ineficiente del espectro y la evoluci´on continua de los sistemas de comunicaci´on inal´ambrica, hace que sea urgente y necesario el desarrollo de esquemas de gesti´on del espectro m´as flexibles. Se considera el acceso din´amico (DSA) al espectro en los sistemas cognitivos como una tecnolog´ıa clave para resolver este conflicto al permitir que un grupo de usuarios secundarios (SUs) puedan compartir y acceder al espectro asignado inicialmente a uno o varios usuarios primarios (PUs). Las operaciones de comunicaci´on llevadas a cabo por los sistemas radio cognitivos no deben en ning´un caso alterar (interferir) los sistemas primarios. Por tanto, el control de la interferencia junto al gran dinamismo de los sistemas primarios implica nuevos retos en el control y asignaci´on de los recursos radio en los sistemas de comunicaci´on CR. Los algoritmos de gesti´on y asignaci´on de recursos (Radio Resource Management-RRM) deben garantizar una participaci´on efectiva de las bandas con frecuencias disponibles temporalmente, y ofrecer en cada momento oportunas soluciones para hacer frente a los distintos cambios r´apidos que influyen en la misma red. En esta tesis doctoral, se analiza el problema de la gesti´on de los recursos radio en sistemas multiportadoras CR, proponiendo varias soluciones para su uso eficaz y coexistencia con los PUs. La tesis en s´ı, se centra en tres l´ıneas principales: 1) el dise˜no de algoritmos eficientes de gesti´on de recursos para la asignaci´on de sub-portadoras y distribuci´on de la potencia en sistemas segundarios, evitando asi cualquier interferencia que pueda ser perjudicial para el funcionamiento normal de los usuarios de la red primaria, 2) analizar y comparar la eficiencia espectral alcanzada a la hora de utilizar diferentes esquema de transmisi´on multiportadora en la capa f´ısica del sistema CR, espec´ıficamente en sistemas basados en OFDM y los basados en banco de filtros multiportadoras (Filter bank Multicarrier-FBMC), 3) investigar el impacto de las diferentes limitaciones en el rendimiento total del sistema de CR. Los escenarios considerados en esta tesis son tres, es decir; modo de transmisi´on descendente (downlink), modo de transmisi´on ascendente (uplink), y el modo de transmisi´on ”Relay”. En cada escenario, la soluci´on ´optima es examinada y comparada con algoritmos sub- ´optimos que tienen como objetivo principal reducir la carga computacional. Los algoritmos sub-´optimos son llevados a cabo en dos fases mediante la separaci´on del propio proceso de distribuci´on de subportadoras y la asignaci´on de la potencia en los modos de comunicaci´on descendente (downlink), y ascendente (uplink). Para los entornos de tipo ”Relay”, se ha utilizado la t´ecnica de doble descomposici´on (dual decomposition) para obtener una soluci´on asint´oticamente ´optima. Adem´as, se ha desarrollado un algoritmo heur´ıstico para poder obtener la soluci´on ´optima con un reducido coste computacional. Los resultados obtenidos mediante simulaciones num´ericas muestran que los algoritmos sub-´optimos desarrollados logran acercarse a la soluci´on ´optima en cada uno de los entornos analizados, logrando as´ı un mayor rendimiento que los ya existentes y utilizados tanto en entornos cognitivos como no-cognitivos. Se puede comprobar en varios resultados obtenidos en la tesis la superioridad del esquema multiportadora FBMC sobre los sistemas basados en OFDM para los entornos cognitivos, causando una menor interferencia que el OFDM en los sistemas primarios, y logrando una mayor eficiencia espectral. Finalmente, en base a lo analizado en esta tesis, podemos recomendar al esquema multiportadora FBMC como una id´onea y potente forma de comunicaci´on para las futuras redes cognitivas

Electrical and Computer Engineering Research Report 2008

Department Research New Chair Publications Enterprisehttps://digitalcommons.mtu.edu/ece-annualreports/1005/thumbnail.jp

Adaptive relay techniques for OFDM-based cooperative communication systems

Cooperative communication has been considered as a cost-effective manner to exploit the spatial diversity, improve the quality-of-service and extend transmission coverage. However, there are many challenges faced by cooperative systems which use relays to forward signals to the destination, such as the accumulation of multipath channels, complex resource allocation with the bidirectional asymmetric traffic and reduction of transmission efficiency caused by additional relay overhead. In this thesis, we aim to address the above challenges of cooperative communications, and design the efficient relay systems. Starting with the channel accumulation problem in the amplify-and-forward relay system, we proposed two adaptive schemes for single/multiple-relay networks respectively. These schemes exploit an adaptive guard interval (GI) technique to cover the accumulated delay spread and enhance the transmission efficiency by limiting the overhead. The proposed GI scheme can be implemented without any extra control signal. Extending the adaptive GI scheme to multiple-relay systems, we propose a relay selection strategy which achieves the trade-off between the transmission reliability and overhead by considering both the channel gain and the accumulated delay spread. We then consider resource allocation problem in the two-way decode-and-forward relay system with asymmetric traffic loads. Two allocation algorithms are respectively investigated for time-division and frequency-division relay systems to maximize the end-to-end capacity of the two-way system under a capacity ratio constraint. For the frequency-division systems, a balanced end-to-end capacity is defined as the objective function which combines the requirements of maximizing the end-to-end capacity and achieving the capacity ratio. A suboptimal algorithm is proposed for the frequency-division systems which separates subcarrier allocation and time/power allocation. It can achieve the similar performance with the optimal one with reduced complexity. In order to further enhance the transmission reliability and maintaining low processing delay, we propose an equalize-and-forward (EF) relay scheme. The EF relay equalizes the channel between source and relay to eliminate the channel accumulation without signal regeneration. To reduce the processing time, an efficient parallel structure is applied in the EF relay. Numerical results show that the EF relay exhibits low outage probability at the same data rate as compared to AF and DF schemes

Distributed resource allocation for inter cell interference mitigation in irregular geometry multicell networks

Extensive increase in mobile broadband applications and proliferation of smart phones and gadgets require higher data rates of wireless cellular networks. However, limited frequency spectrum has led to aggressive frequency reuse to improve network capacity at the expense of increased Inter Cell Interference (ICI). Fractional Frequency Reuse (FFR) has been acknowledged as an effective ICI mitigation scheme but in irregular geometric multicellular network, ICI mitigation poses a very challenging issue. The thesis developed a decentralized ICI mitigation scheme to improve both spectral and energy efficiency in irregular geometric multicellular networks. ICI mitigation was realized through Distributed Resource Allocation (DRA) deployed at the cell level and region level of an irregular geometric cell. The irregular geometric cell consists of a minimum of four regions comprising three sectors and a central region. DRA at the cell level is defined as Multi Sector DRA (MSDRA), and at the region level is defined as Distributed Channel Selection and Power Allocation (DCSPA). MSDRA allocates discrete power to every region in a cell based on Game Theory and Regret Learning Process with correlated equilibrium as the optimum decision level. The DCSPA allocates power to every channel in a region based on non-coalesce liquid droplet phenomena by selecting optimum channels in a region and reserving appropriate power for the selected channels. The performance was evaluated through simulation in terms of data rate, spectral efficiency and energy efficiency. The results showed that MSDRA significantly improved cell data rate by 58.64% and 37.92% in comparision to Generalized FFR and Fractional Frequency Reuse-3 (FFR-3) schemes, respectively. The performance of MSDRA at the cell level showed that its spectral and energy efficiency improved 32% and 22%, respectively in comparison to FFR-3. When the number of sectors increased from three to four, data rate was improved by 30.26% and for three to six sectors, it was improved by 56.32%. The DCSPA further improved data rate by 41.07% when compared with Geometric Water Filling, and 86.46% in comparison to Asynchronous Iterative Water Filling. The DCSPA enhanced data rate achieved in MSDRA by 15.6%. Overall, DRA has shown to have significant improvement in data rate by 53.6%, and spectral efficiency by 38.10% as compared to FFR-3. As a conclusion, the DRA scheme is a potential candidate for Long Term Evaluation – Advanced, Fifth Generation networks and can be deployed in future heterogeneous irregular geometric multicellular Orthogonal Frequency Division Multiple Access networks

Low Complexity Scalable Iterative Algorithms for IEEE 802.11p Receivers

In this paper, we investigate receivers for Vehicular to Vehicular (V2V) and Vehicular to Infrastructure (V2I) communications. Vehicular channels are characterized by multiple paths and time variations, which introduces challenges in the design of receivers. We propose an algorithm for IEEE 802.11p compliant receivers, based on Orthogonal Frequency Division Multiplexing (OFDM). We employ iterative structures in the receiver as a way to estimate the channel despite variations within a frame. The channel estimator is based on factor graphs, which allow the design of soft iterative receivers while keeping an acceptable computational complexity. Throughout this work, we focus on designing a receiver offering a good complexity performance trade-off. Moreover, we propose a scalable algorithm in order to be able to tune the trade-off depending on the channel conditions. Our algorithm allows reliable communications while offering a considerable decrease in computational complexity. In particular, numerical results show the trade-off between complexity and performance measured in computational time and BER as well as FER achieved by various interpolation lengths used by the estimator which both outperform by decades the standard least square solution. Furthermore our adaptive algorithm shows a considerable improvement in terms of computational time and complexity against state of the art and classical receptors whilst showing acceptable BER and FER performance

Optimum Design of Spectral Efficient Green Wireless Communications

This dissertation focuses on the optimum design of spectral efficient green wireless communications. Energy efficiency (EE), which is defined as the inverse of average energy required to successfully deliver one information bit from a source to its destination, and spectral efficiency (SE), which is defined as the average data rate per unit bandwidth, are two fundamental performance metrics of wireless communication systems. We study the optimum designs of a wide range of practical wireless communication systems that can either maximize EE, or SE, or achieve a balanced tradeoff between the two metrics. There are three objectives in this dissertation. First, an accurate frame error rate (FER) expression is developed for practical coded wireless communication systems operating in quasi-static Rayleigh fading channels. The new FER expression enables the accurate modeling of EE and SE for various wireless communication systems. Second, the optimum designs of automatic repeat request (ARQ) and hybrid ARQ (HARQ) systems are performed to by using the EE and SE as design metrics. Specifically, a new metric of normalized EE, which is defined as the EE normalized by the SE, is proposed to achieve a balanced tradeoff between the EE and SE. Third, a robust frequency-domain on-off accumulative transmission (OOAT) scheme has been developed to achieve collision-tolerant media access control (CT-MAC) in a wireless network. The proposed frequency domain OOAT scheme can improve the SE and EE by allowing multiple users to transmit simultaneously over the same frequency bands, and the signal collisions at the receiver can be resolved by using signal processing techniques in the physical layer