RF-Powered Cognitive Radio Networks: Technical Challenges and Limitations

The increasing demand for spectral and energy efficient communication networks has spurred a great interest in energy harvesting (EH) cognitive radio networks (CRNs). Such a revolutionary technology represents a paradigm shift in the development of wireless networks, as it can simultaneously enable the efficient use of the available spectrum and the exploitation of radio frequency (RF) energy in order to reduce the reliance on traditional energy sources. This is mainly triggered by the recent advancements in microelectronics that puts forward RF energy harvesting as a plausible technique in the near future. On the other hand, it is suggested that the operation of a network relying on harvested energy needs to be redesigned to allow the network to reliably function in the long term. To this end, the aim of this survey paper is to provide a comprehensive overview of the recent development and the challenges regarding the operation of CRNs powered by RF energy. In addition, the potential open issues that might be considered for the future research are also discussed in this paper.Comment: 8 pages, 2 figures, 1 table, Accepted in IEEE Communications Magazin

Partner selection in indoor-to-outdoor cooperative networks: an experimental study

In this paper, we develop a partner selection protocol for enhancing the network lifetime in cooperative wireless networks. The case-study is the cooperative relayed transmission from fixed indoor nodes to a common outdoor access point. A stochastic bivariate model for the spatial distribution of the fading parameters that govern the link performance, namely the Rician K-factor and the path-loss, is proposed and validated by means of real channel measurements. The partner selection protocol is based on the real-time estimation of a function of these fading parameters, i.e., the coding gain. To reduce the complexity of the link quality assessment, a Bayesian approach is proposed that uses the site-specific bivariate model as a-priori information for the coding gain estimation. This link quality estimator allows network lifetime gains almost as if all K-factor values were known. Furthermore, it suits IEEE 802.15.4 compliant networks as it efficiently exploits the information acquired from the receiver signal strength indicator. Extensive numerical results highlight the trade-off between complexity, robustness to model mismatches and network lifetime performance. We show for instance that infrequent updates of the site-specific model through K-factor estimation over a subset of links are sufficient to at least double the network lifetime with respect to existing algorithms based on path loss information only.Comment: This work has been submitted to IEEE Journal on Selected Areas in Communications in August 201

Power Optimisation and Relay Selection in Cooperative Wireless Communication Networks

Cooperative communications have emerged as a significant concept to improve reliability and throughput in wireless systems. In cooperative networks, the idea is to implement a scheme in wireless systems where the nodes can harmonize their resources thereby enhancing the network performance in different aspects such as latency, BER and throughput. As cooperation spans from the basic idea of transmit diversity achieved via MIMO techniques and the relay channel, it aims to reap somewhat multiple benefits of combating fading/burst errors, increasing throughput and reducing energy use. Another major benefit of cooperation in wireless networks is that since the concept only requires neighbouring nodes to act as virtual relay antennas, the concept evades the negative impacts of deployment costs of multiple physical antennas for network operators especially in areas where they are difficult to deploy. In cooperative communications energy efficiency and long network lifetimes are very important design issues, the focus in this work is on ad hoc and sensor network varieties where the nodes integrate sensing, processing and communication such that their cooperation capabilities are subject to power optimisation. As cooperation communications leads to trade-offs in Quality of Services and transmit power, the key design issue is power optimisation to dynamically combat channel fluctuations and achieve a net reduction of transmit power with the goal of saving battery life. Recent researches in cooperative communications focus on power optimisation achieved via power control at the PHY layer, and/or scheduling mechanism at the MAC layer. The approach for this work will be to review the power control strategy at the PHY layer, identify their associated trade-offs, and use this as a basis to propose a power control strategy that offers adaptability to channel conditions, the road to novelty in this work is a channel adaptable power control algorithm that jointly optimise power allocation, modulation strategy and relay selection. Thus, a novel relay selection method is developed and implemented to improve the performance of cooperative wireless networks in terms of energy consumption. The relay selection method revolves on selection the node with minimum distance to the source and destination. The design is valid to any wireless network setting especially Ad-hoc and sensor networks where space limitations preclude the implementation of bigger capacity battery. The thesis first investigates the design of relay selection schemes in cooperative networks and the associated protocols. Besides, modulation strategy and error correction code impact on energy consumption are investigated and the optimal solution is proposed and jointly implemented with the relay selection method. The proposed algorithm is extended to cooperative networks in which multiple nodes participate in cooperation in fixed and variable rate system. Thus, multi relay selection algorithm is proposed to improve virtual MIMO performance in terms of energy consumption. Furthermore, motivated by the trend of cell size optimisation in wireless networks, the proposed relay selection method is extended to clustered wireless networks, and jointly implemented with virtual clustering technique. The work will encompass three main stages: First, the cooperative system is designed and two major protocols Decode and Forward (DF) and amplify and forward (AF) are investigated. Second, the proposed algorithm is modelled and tested under different channel conditions with emphasis on its performance using different modulation strategies for different cooperative wireless networks. Finally, the performance of the proposed algorithm is illustrated and verified via computer simulations. Simulation results show that the distance based relay selection algorithm exhibits an improved performance in terms of energy consumption compared to the conventional cooperative schemes under different cooperative communication scenarios

Peak to average power ratio based spatial spectrum sensing for cognitive radio systems

The recent convergence of wireless standards for incorporation of spatial dimension in wireless systems has made spatial spectrum sensing based on Peak to Average Power Ratio (PAPR) of the received signal, a promising approach. This added dimension is principally exploited for stream multiplexing, user multiplexing and spatial diversity. Considering such a wireless environment for primary users, we propose an algorithm for spectrum sensing by secondary users which are also equipped with multiple antennas. The proposed spatial spectrum sensing algorithm is based on the PAPR of the spatially received signals. Simulation results show the improved performance once the information regarding spatial diversity of the primary users is incorporated in the proposed algorithm. Moreover, through simulations a better performance is achieved by using different diversity schemes and different parameters like sensing time and scanning interval

On the Throughput of Large-but-Finite MIMO Networks using Schedulers

This paper studies the sum throughput of the {multi-user} multiple-input-single-output (MISO) networks in the cases with large but finite number of transmit antennas and users. Considering continuous and bursty communication scenarios with different users' data request probabilities, we derive quasi-closed-form expressions for the maximum achievable throughput of the networks using optimal schedulers. The results are obtained in various cases with different levels of interference cancellation. Also, we develop an efficient scheduling scheme using genetic algorithms (GAs), and evaluate the effect of different parameters, such as channel/precoding models, number of antennas/users, scheduling costs and power amplifiers' efficiency, on the system performance. Finally, we use the recent results on the achievable rates of finite block-length codes to analyze the system performance in the cases with short packets. As demonstrated, the proposed GA-based scheduler reaches (almost) the same throughput as in the exhaustive search-based optimal scheduler, with substantially less implementation complexity. Moreover, the power amplifiers' inefficiency and the scheduling delay affect the performance of the scheduling-based systems significantly