Machine Learning For In-Region Location Verification In Wireless Networks

In-region location verification (IRLV) aims at verifying whether a user is inside a region of interest (ROI). In wireless networks, IRLV can exploit the features of the channel between the user and a set of trusted access points. In practice, the channel feature statistics is not available and we resort to machine learning (ML) solutions for IRLV. We first show that solutions based on either neural networks (NNs) or support vector machines (SVMs) and typical loss functions are Neyman-Pearson (N-P)-optimal at learning convergence for sufficiently complex learning machines and large training datasets . Indeed, for finite training, ML solutions are more accurate than the N-P test based on estimated channel statistics. Then, as estimating channel features outside the ROI may be difficult, we consider one-class classifiers, namely auto-encoders NNs and one-class SVMs, which however are not equivalent to the generalized likelihood ratio test (GLRT), typically replacing the N-P test in the one-class problem. Numerical results support the results in realistic wireless networks, with channel models including path-loss, shadowing, and fading

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

RF channel characterization for cognitive radio using support vector machines

Cognitive Radio promises to revolutionize the ways in which a user interfaces with a communications device. In addition to connecting a user with the rest of the world, a Cognitive Radio will know how the user wants to connect to the rest of the world as well as how to best take advantage of unused spectrum, commonly called white space\u27. Through the concept of Dynamic Spectrum Acccess a Cognitive Radio will be able to take advantage of the white space in the spectrum by first identifying where the white space is located and designing a transmit plan for a particular white space. In general a Cognitive Radio melds the capabilities of a Software Defined Radio and a Cognition Engine. The Cognition Engine is responsible for learning how the user interfaces with the device and how to use the available radio resources while the SDR is the interface to the RF world. At the heart of a Cognition Engine are Machine Learning Algorithms that decide how best to use the available radio resources and can learn how the user interfaces to the CR. To decide how best to use the available radio resources, we can group Machine Learning Algorithms into three general categories which are, in order of computational cost: 1.) Linear Least Squares Type Algorithms, e.g. Discrete Fourier Transform (DFT) and their kernel versions, 2.) Linear Support Vector Machines (SVMs) and their kernel versions, and 3.) Neural Networks and/or Genetic Algorithms. Before deciding on what to transmit, a Cognitive Radio must decide where the white space is located. This research is focused on the task of identifying where the white space resides in the spectrum, herein called RF Channel Characterization. Since previous research into the use of Machine Learning Algorithms for this task has focused on Neural Networks and Genetic Algorithms, this research will focus on the use of Machine Learning Algorithms that follow the Support Vector optimization criterion for this task. These Machine Learning Algorithms are commonly called Support Vector Machines. Results obtained using Support Vector Machines for this task are compared with results obtained from using Least Squares Algorithms, most notably, implementations of the Fast Fourier Transform. After a thorough theoretical investigation of the ability of Support Vector Machines to perform the RF Channel Characterization task, we present results of using Support Vector Machines for this task on experimental data collected at the University of New Mexico.\u2

One-stage blind source separation via a sparse autoencoder framework

Blind source separation (BSS) is the process of recovering individual source transmissions from a received mixture of co-channel signals without a priori knowledge of the channel mixing matrix or transmitted source signals. The received co-channel composite signal is considered to be captured across an antenna array or sensor network and is assumed to contain sparse transmissions, as users are active and inactive aperiodically over time. An unsupervised machine learning approach using an artificial feedforward neural network sparse autoencoder with one hidden layer is formulated for blindly recovering the channel matrix and source activity of co-channel transmissions. The BSS sparse autoencoder provides one-stage learning using the receive signal data only, which solves for the channel matrix and signal sources simultaneously. The recovered co-channel source signals are produced at the encoded output of the sparse autoencoder hidden layer. A complex-valued soft-threshold operator is used as the activation function at the hidden layer to preserve the ordered pairs of real and imaginary components. Once the weights of the sparse autoencoder are learned, the latent signals are recovered at the hidden layer without requiring any additional optimization steps. The generalization performance on future received data demonstrates the ability to recover signal transmissions on untrained data and outperform the two-stage BSS process

Wireless Channel Equalization in Digital Communication Systems

Our modern society has transformed to an information-demanding system, seeking voice, video, and data in quantities that could not be imagined even a decade ago. The mobility of communicators has added more challenges. One of the new challenges is to conceive highly reliable and fast communication system unaffected by the problems caused in the multipath fading wireless channels. Our quest is to remove one of the obstacles in the way of achieving ultimately fast and reliable wireless digital communication, namely Inter-Symbol Interference (ISI), the intensity of which makes the channel noise inconsequential. The theoretical background for wireless channels modeling and adaptive signal processing are covered in first two chapters of dissertation. The approach of this thesis is not based on one methodology but several algorithms and configurations that are proposed and examined to fight the ISI problem. There are two main categories of channel equalization techniques, supervised (training) and blind unsupervised (blind) modes. We have studied the application of a new and specially modified neural network requiring very short training period for the proper channel equalization in supervised mode. The promising performance in the graphs for this network is presented in chapter 4. For blind modes two distinctive methodologies are presented and studied. Chapter 3 covers the concept of multiple cooperative algorithms for the cases of two and three cooperative algorithms. The select absolutely larger equalized signal and majority vote methods have been used in 2-and 3-algoirithm systems respectively. Many of the demonstrated results are encouraging for further research. Chapter 5 involves the application of general concept of simulated annealing in blind mode equalization. A limited strategy of constant annealing noise is experimented for testing the simple algorithms used in multiple systems. Convergence to local stationary points of the cost function in parameter space is clearly demonstrated and that justifies the use of additional noise. The capability of the adding the random noise to release the algorithm from the local traps is established in several cases

Estimation of bit error rate in 2×2 and 4×4 multi-input multi-output-orthogonal frequency division multiplexing systems

Multiple-input, multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) systems with multiple input antennas and multiple output antennas in dynamic environments face the challenge of channel estimation. To overcome this challenge and to improve the performance and signal-to-noise ratio, in this paper we used the Kalman filter for the correct estimation of the signal in dynamic environments. To obtain the original signal at the receiver end bit error rate factor plays a major role. If the signal to noise ratio is high and the bit error rate is low then signal strength is high, the signal received at the receiver end is almost similar to the ith transmitted signal. The dynamic tracking characteristic of Kalman filter is used to establish a dynamic space-time codeword and a collection of orthogonal pilot sequences to prevent interference among transmissions in this paper. Using the simulation, the Kalman filter method can be compared to the other channel estimation method presented in this paper that can track time-varying channels rapidly

Blind source separation using dictionary learning over time-varying channels

Distributed sensors observe radio frequency (RF) sources over flat-fading channels. The activity pattern is sparse and intermittent in the sense that while the number of latent sources may be larger than the number of sensors, only a few of them may be active at any particular time instant. It is further assumed that the source activity is modeled by a Hidden Markov Model. In previous work, the Blind Source Separation (BSS) problem solved for stationary channels using Dictionary Learning (DL). This thesis studies the effect of time-varying channels on the performance of DL algorithms. The performance metric is the probability of detection, where a correct detection is the event that the estimated value of a source exceeds a threshold at a time instant when the true source is active. Using the probability of detection when the channels are stationary as a baseline, it is shown that there is significant degradation for time-varying channels and observation intervals much longer than the time coherence. Detection performance improves when the observation time is approximately equal to the time coherence. Performance is again degraded when the observation is shorter and there is not sufficient information for the DL algorithms to learn from