Development of self-organizing methods for radio spectrum sensing

A problem of wide-band radio spectrum analysis in real time was solved and presented in the dissertation. The goal of the work was to develop a spectrum sensing method for primary user emission detection in radio spectrum by investigating new signal feature extraction and intelligent decision making techniques. A solution of this problem is important for application in cognitive radio systems, where radio spectrum is analyzed in real time. In thesis there are reviewed currently suggested spectrum analysis methods, which are used for cognitive radio. The main purpose of these methods is to optimize spectrum description feature estimation in real-time systems and to select suitable classification threshold. For signal spectrum description analyzed methods used signal energy estimation, analyzed energy statistical difference in time and frequency. In addition, the review has shown that the wavelet transform can be used for signal pre-processing in spectrum sensors. For classification threshold selection in literature most common methods are based on statistical noise estimate and energy statistical change analysis. However, there are no suggested efficient methods, which let classification threshold to change adaptively, when RF environment changes. It were suggested signal features estimation modifications, which let to increase the efficiency of algorithm implementation in embedded system, by decreasing the amount of required calculations and preserving the accuracy of spectrum analysis algorithms. For primary signal processing it is suggested to use wavelet transform based features extraction, which are used for spectrum sensors and lets to increase accuracy of noisy signal detection. All primary user signal emissions were detected with lower than 1% false alarm ratio. In dissertation, there are suggested artificial neural network based methods, which let adaptively select classification threshold for the spectrum sensors. During experimental tests, there was achieved full signals emissions detection with false alarm ratio lower than 1%. It was suggested self organizing map structure modification, which increases network self-training speed up to 32 times. This self-training speed is achieved due to additional inner weights, which are added in to self organizing map structure. In self-training stage network structure changes especially fast and when topology, which is suited for given task, is reached, in further self-training iterations it can be disordered. In order to avoid this over-training, self-training process monitoring algorithms must be used. There were suggested original methods for self-training process control, which let to avoid network over-training and decrease self-training iteration quantity

Machine Learning in Wireless Sensor Networks: Algorithms, Strategies, and Applications

Wireless sensor networks monitor dynamic environments that change rapidly over time. This dynamic behavior is either caused by external factors or initiated by the system designers themselves. To adapt to such conditions, sensor networks often adopt machine learning techniques to eliminate the need for unnecessary redesign. Machine learning also inspires many practical solutions that maximize resource utilization and prolong the lifespan of the network. In this paper, we present an extensive literature review over the period 2002-2013 of machine learning methods that were used to address common issues in wireless sensor networks (WSNs). The advantages and disadvantages of each proposed algorithm are evaluated against the corresponding problem. We also provide a comparative guide to aid WSN designers in developing suitable machine learning solutions for their specific application challenges.Comment: Accepted for publication in IEEE Communications Surveys and Tutorial

Markov Decision Processes with Applications in Wireless Sensor Networks: A Survey

Wireless sensor networks (WSNs) consist of autonomous and resource-limited devices. The devices cooperate to monitor one or more physical phenomena within an area of interest. WSNs operate as stochastic systems because of randomness in the monitored environments. For long service time and low maintenance cost, WSNs require adaptive and robust methods to address data exchange, topology formulation, resource and power optimization, sensing coverage and object detection, and security challenges. In these problems, sensor nodes are to make optimized decisions from a set of accessible strategies to achieve design goals. This survey reviews numerous applications of the Markov decision process (MDP) framework, a powerful decision-making tool to develop adaptive algorithms and protocols for WSNs. Furthermore, various solution methods are discussed and compared to serve as a guide for using MDPs in WSNs

Distributed Detection and Estimation in Wireless Sensor Networks

In this article we consider the problems of distributed detection and estimation in wireless sensor networks. In the first part, we provide a general framework aimed to show how an efficient design of a sensor network requires a joint organization of in-network processing and communication. Then, we recall the basic features of consensus algorithm, which is a basic tool to reach globally optimal decisions through a distributed approach. The main part of the paper starts addressing the distributed estimation problem. We show first an entirely decentralized approach, where observations and estimations are performed without the intervention of a fusion center. Then, we consider the case where the estimation is performed at a fusion center, showing how to allocate quantization bits and transmit powers in the links between the nodes and the fusion center, in order to accommodate the requirement on the maximum estimation variance, under a constraint on the global transmit power. We extend the approach to the detection problem. Also in this case, we consider the distributed approach, where every node can achieve a globally optimal decision, and the case where the decision is taken at a central node. In the latter case, we show how to allocate coding bits and transmit power in order to maximize the detection probability, under constraints on the false alarm rate and the global transmit power. Then, we generalize consensus algorithms illustrating a distributed procedure that converges to the projection of the observation vector onto a signal subspace. We then address the issue of energy consumption in sensor networks, thus showing how to optimize the network topology in order to minimize the energy necessary to achieve a global consensus. Finally, we address the problem of matching the topology of the network to the graph describing the statistical dependencies among the observed variables.Comment: 92 pages, 24 figures. To appear in E-Reference Signal Processing, R. Chellapa and S. Theodoridis, Eds., Elsevier, 201

Exploratory Analysis of Functional Data via Clustering and Optimal Segmentation

We propose in this paper an exploratory analysis algorithm for functional data. The method partitions a set of functions into $K$ clusters and represents each cluster by a simple prototype (e.g., piecewise constant). The total number of segments in the prototypes, $P$, is chosen by the user and optimally distributed among the clusters via two dynamic programming algorithms. The practical relevance of the method is shown on two real world datasets

A self-organized model for cell-differentiation based on variations of molecular decay rates

Systemic properties of living cells are the result of molecular dynamics governed by so-called genetic regulatory networks (GRN). These networks capture all possible features of cells and are responsible for the immense levels of adaptation characteristic to living systems. At any point in time only small subsets of these networks are active. Any active subset of the GRN leads to the expression of particular sets of molecules (expression modes). The subsets of active networks change over time, leading to the observed complex dynamics of expression patterns. Understanding of this dynamics becomes increasingly important in systems biology and medicine. While the importance of transcription rates and catalytic interactions has been widely recognized in modeling genetic regulatory systems, the understanding of the role of degradation of biochemical agents (mRNA, protein) in regulatory dynamics remains limited. Recent experimental data suggests that there exists a functional relation between mRNA and protein decay rates and expression modes. In this paper we propose a model for the dynamics of successions of sequences of active subnetworks of the GRN. The model is able to reproduce key characteristics of molecular dynamics, including homeostasis, multi-stability, periodic dynamics, alternating activity, differentiability, and self-organized critical dynamics. Moreover the model allows to naturally understand the mechanism behind the relation between decay rates and expression modes. The model explains recent experimental observations that decay-rates (or turnovers) vary between differentiated tissue-classes at a general systemic level and highlights the role of intracellular decay rate control mechanisms in cell differentiation.Comment: 16 pages, 5 figure