Cramer-Rao Bounds for Joint RSS/DoA-Based Primary-User Localization in Cognitive Radio Networks

Knowledge about the location of licensed primary-users (PU) could enable several key features in cognitive radio (CR) networks including improved spatio-temporal sensing, intelligent location-aware routing, as well as aiding spectrum policy enforcement. In this paper we consider the achievable accuracy of PU localization algorithms that jointly utilize received-signal-strength (RSS) and direction-of-arrival (DoA) measurements by evaluating the Cramer-Rao Bound (CRB). Previous works evaluate the CRB for RSS-only and DoA-only localization algorithms separately and assume DoA estimation error variance is a fixed constant or rather independent of RSS. We derive the CRB for joint RSS/DoA-based PU localization algorithms based on the mathematical model of DoA estimation error variance as a function of RSS, for a given CR placement. The bound is compared with practical localization algorithms and the impact of several key parameters, such as number of nodes, number of antennas and samples, channel shadowing variance and correlation distance, on the achievable accuracy are thoroughly analyzed and discussed. We also derive the closed-form asymptotic CRB for uniform random CR placement, and perform theoretical and numerical studies on the required number of CRs such that the asymptotic CRB tightly approximates the numerical integration of the CRB for a given placement.Comment: 20 pages, 11 figures, 1 table, submitted to IEEE Transactions on Wireless Communication

Exact analysis of weighted centroid localization

Source localization of primary users (PUs) is a geolocation spectrum awareness feature that can be very useful in enhancing the functionality of cognitive radios (CRs). When the cooperating CRs have limited information about the PU, weighted centroid localization (WCL) based on received signal strength (RSS) measurements represents an attractive low-complexity solution. In this paper, we propose a new analytical framework to calculate the exact performance of WCL in the presence of shadowing, based on results of the ratio of two quadratic forms in normal variables. In particular, we derive an exact expression for the root mean square error (RMSE) of the two-dimensional location estimate. Numerical results confirm that the derived framework is able to predict the performance of WCL capturing all the essential aspects of propagation as well as CR network spatial topology

Distributed Localization of Active Transmitters in a Wireless Sensor Network

In today\u27s military environment, emphasis has been placed on bandwidth efficiency and total use of the available spectrum. Current communication standards divide the spectrum into several different frequency bands, all of which are assigned to one or multiple primary users. Cognitive Radio utilizes potential white spaces that exist between currently defined channels or in time. One under-explored dimension of white space exploration is spatial. If a frequency band is being used in one region, it may be underutilized, or not occupied in another. Using an active localization method can allow for the discovery of spatial white; trying to spatially map all of the frequencies in a large area would become very computationally intensive, and may even be impractical using modern centralized methods. Applying a distributed method and the concepts discussed in Wireless Distributed Computing to the problem can be scaled onto many small wireless sensors and could improve the measuring system\u27s effectiveness. For a bandwidth contested environment that must be spectrally mapped, three metrics stand out: Accuracy, Power Consumption, and Latency. All of these metrics must be explored and measured to determine which method could be most effectively applied to the spectral mapping of a spatial environment

Spectrum Sensing Algorithms for Cognitive Radio Applications

Future wireless communications systems are expected to be extremely dynamic, smart and capable to interact with the surrounding radio environment. To implement such advanced devices, cognitive radio (CR) is a promising paradigm, focusing on strategies for acquiring information and learning. The first task of a cognitive systems is spectrum sensing, that has been mainly studied in the context of opportunistic spectrum access, in which cognitive nodes must implement signal detection techniques to identify unused bands for transmission. In the present work, we study different spectrum sensing algorithms, focusing on their statistical description and evaluation of the detection performance. Moving from traditional sensing approaches we consider the presence of practical impairments, and analyze algorithm design. Far from the ambition of cover the broad spectrum of spectrum sensing, we aim at providing contributions to the main classes of sensing techniques. In particular, in the context of energy detection we studied the practical design of the test, considering the case in which the noise power is estimated at the receiver. This analysis allows to deepen the phenomenon of the SNR wall, providing the conditions for its existence and showing that presence of the SNR wall is determined by the accuracy of the noise power estimation process. In the context of the eigenvalue based detectors, that can be adopted by multiple sensors systems, we studied the practical situation in presence of unbalances in the noise power at the receivers. Then, we shift the focus from single band detectors to wideband sensing, proposing a new approach based on information theoretic criteria. This technique is blind and, requiring no threshold setting, can be adopted even if the statistical distribution of the observed data in not known exactly. In the last part of the thesis we analyze some simple cooperative localization techniques based on weighted centroid strategies

Enhancement of weighted centroid algorithm for indoor mobile non-cooperative localization system

Nowadays, indoor wireless localization is being challenged research by providing high accuracy of location information. However lower processing time, resistant to environmental condition, simple network topology are also become main concern. Noncooperative localization based on RSSI allow the anchor nodes as the reference nodes communicate directly to the target node by exchanging the location data. High sensitivity of RSSI to the indoor environment, make difficulties in modelling propagation characteristic called as PLE. Incompatibility the PLE value can influence to the estimated position result. Weighted centroid localization (WCL) is feasible solution for RSSI-based that can obtain the target node location just by RSSI and anchor nodes coordinate without PLE value and estimated distance. While, the centroid determination of WCL give better estimation only to the centralized position of target node between all anchor nodes position. Therefore, we propose enhancement of WCL (eWCL) by replacing the weight based on RSSI with different estimated distance from WCL calculation. The simulation result show that using eWCL can reduce the error estimation around 60.42% compared to the WCL algorithm with 1.85 meters MSE value. Then, compared to the cooperative localization based on trilateration algorithm achieve 12.15% error estimation larger than eWCL at non-cooperative scheme

Thirty Years of Machine Learning: The Road to Pareto-Optimal Wireless Networks

Future wireless networks have a substantial potential in terms of supporting a broad range of complex compelling applications both in military and civilian fields, where the users are able to enjoy high-rate, low-latency, low-cost and reliable information services. Achieving this ambitious goal requires new radio techniques for adaptive learning and intelligent decision making because of the complex heterogeneous nature of the network structures and wireless services. Machine learning (ML) algorithms have great success in supporting big data analytics, efficient parameter estimation and interactive decision making. Hence, in this article, we review the thirty-year history of ML by elaborating on supervised learning, unsupervised learning, reinforcement learning and deep learning. Furthermore, we investigate their employment in the compelling applications of wireless networks, including heterogeneous networks (HetNets), cognitive radios (CR), Internet of things (IoT), machine to machine networks (M2M), and so on. This article aims for assisting the readers in clarifying the motivation and methodology of the various ML algorithms, so as to invoke them for hitherto unexplored services as well as scenarios of future wireless networks.Comment: 46 pages, 22 fig

Blind localization of radio emitters in wireless communications

The proliferation of wireless services is expected to increase the demand for radio spectrum in the foreseeable future. Given the limitations of the radio spectrum, it is evident that the current fixed frequency assignment policy fails to accommodate this increasing demand. Thus, the need for innovative technologies that can scale to accommodate future demands both in terms of spectrum efficiency and high reliable communication. Cognitive radio (CR) is one of the emerging technologies that offers a more flexible use of frequency bands allowing unlicensed users to exploit and use portions of the spectrum that are temporarily unused without causing any potential harmful interference to the incumbents. The most important functionality of a CR system is to observe the radio environment through various spectrum awareness techniques e.g., spectrum sensing or detection of spectral users in the spatio-temporal domain. In this research, we mainly focus on one of the key cognitive radio enabling techniques called localization, which provides crucial geo-location of the unknown radio transmitter in the surrounding environment. Knowledge of the user’s location can be very useful in enhancing the functionality of CRs and allows for better spectrum resource allocations in the spatial domain. For instance, the location-awareness feature can be harnessed to accomplish CR tasks such as spectrum sensing, dynamic channel allocation and interference management to enable cognitive radio operation and hence to maximize the spectral utilization. Additionally, geo-location can significantly expand the capabilities of many wireless communication applications ranging from physical layer security, geo-routing, energy efficiency, and a large set of emerging wireless sensor network and social networking applications. We devote the first part of this research to explore a broad range of existing cooperative localization techniques and through Monte-Carlo simulations analyze the performance of such techniques. We also propose two novel techniques that offer better localization performance with respect to the existing ones. The second and third parts of this research put forth a new analytical framework to characterize the performance of a particular low-complexity localization technique called weighted centroid localization (WCL), based on the statistical distribution of the ratio of two quadratic forms in normal variables. Specifically, we evaluate the performance of WCL in terms of the root mean square error (RMSE) and cumulative distribution function (CDF). The fourth part of this research focuses on studying the bias of the WCL and also provides solutions for bias correction. Throughout this research, we provide a case study analysis to evaluate the performance of the proposed approaches under changing channel and environment conditions. For the new theoretical framework, we compare analytical and Monte-Carlo simulation results of the performance metric of interest. A key contribution in our analysis is that we present not only the accurate performance in terms of the RMSE and CDF, but a new analytical framework that takes into consideration the finite nature of the network, overcoming the limitations of asymptotic results based on the central limit theorem. Remarkably, the numerical results unfold that the new analytical framework is able to predict the performance of WCL capturing all the essential aspects of propagation as well as the cognitive radio network spatial topology. Finally, we present conclusions gained from this research and possible future directions

Multitask Diffusion Adaptation over Networks

Adaptive networks are suitable for decentralized inference tasks, e.g., to monitor complex natural phenomena. Recent research works have intensively studied distributed optimization problems in the case where the nodes have to estimate a single optimum parameter vector collaboratively. However, there are many important applications that are multitask-oriented in the sense that there are multiple optimum parameter vectors to be inferred simultaneously, in a collaborative manner, over the area covered by the network. In this paper, we employ diffusion strategies to develop distributed algorithms that address multitask problems by minimizing an appropriate mean-square error criterion with $\ell_2$-regularization. The stability and convergence of the algorithm in the mean and in the mean-square sense is analyzed. Simulations are conducted to verify the theoretical findings, and to illustrate how the distributed strategy can be used in several useful applications related to spectral sensing, target localization, and hyperspectral data unmixing.Comment: 29 pages, 11 figures, submitted for publicatio