Spectrum sensing for cognitive radios: Algorithms, performance, and limitations

Inefficient use of radio spectrum is becoming a serious problem as more and more wireless systems are being developed to operate in crowded spectrum bands. Cognitive radio offers a novel solution to overcome the underutilization problem by allowing secondary usage of the spectrum resources along with high reliable communication. Spectrum sensing is a key enabler for cognitive radios. It identifies idle spectrum and provides awareness regarding the radio environment which are essential for the efficient secondary use of the spectrum and coexistence of different wireless systems. The focus of this thesis is on the local and cooperative spectrum sensing algorithms. Local sensing algorithms are proposed for detecting orthogonal frequency division multiplexing (OFDM) based primary user (PU) transmissions using their autocorrelation property. The proposed autocorrelation detectors are simple and computationally efficient. Later, the algorithms are extended to the case of cooperative sensing where multiple secondary users (SUs) collaborate to detect a PU transmission. For cooperation, each SU sends a local decision statistic such as log-likelihood ratio (LLR) to the fusion center (FC) which makes a final decision. Cooperative sensing algorithms are also proposed using sequential and censoring methods. Sequential detection minimizes the average detection time while censoring scheme improves the energy efficiency. The performances of the proposed algorithms are studied through rigorous theoretical analyses and extensive simulations. The distributions of the decision statistics at the SU and the test statistic at the FC are established conditioned on either hypothesis. Later, the effects of quantization and reporting channel errors are considered. Main aim in studying the effects of quantization and channel errors on the cooperative sensing is to provide a framework for the designers to choose the operating values of the number of quantization bits and the target bit error probability (BEP) for the reporting channel such that the performance loss caused by these non-idealities is negligible. Later a performance limitation in the form of BEP wall is established for the cooperative sensing schemes in the presence of reporting channel errors. The BEP wall phenomenon is important as it provides the feasible values for the reporting channel BEP used for designing communication schemes between the SUs and the FC

Nano/Bio-Receiver Architectures and Detection Methods for Molecular Communications

Internet of Nano Things (IoNT) is an emerging technology, which aims at extending the connectivity into nanoscale and biological environments with collaborative networks of artificial nanomachines and biological entities integrated into the Internet. To enable the IoNT and its groundbreaking applications, such as real-time intrabody health monitoring, it is imperative to devise nanoscale communication techniques with low-complexity transceiver architectures. Bio-inspired molecular communications (MC), which uses molecules to transfer information, is the most promising technique to realise IoNT due to its inherent biocompatibility and reliability in physiologically-relevant environments. Despite the substantial body of work concerning MC, the implications of an interface between MC channel and practical MC transceiver architectures are largely neglected, leading to a major gap between theory and practice. As the first step to remove this discrepancy, in this thesis, I develop a realistic analytical ICT model for microfluidic MC with surface-based receivers as a convection-diffusion-reaction system. In the second part, I focus on biological MC receivers, which can be implemented in living cells using synthetic biology tools. In this direction, I theoretically develop low-complexity and reliable MC detection methods exploiting the various statistics of the stochastic ligand-receptor interactions at the membrane of biological MC receivers. The estimation and detection theoretical analysis of these detection methods demonstrate that even single type of receptors can provide sufficient statistics to overcome the receptor saturation problem, cope with the interference of non-cognate molecules, and simultaneously sense the concentration of multiple types of ligands. I also propose synthetic receptor designs for the transduction of decision statistics into a representation by concentration of intracellular molecules, and design chemical reaction networks performing decoding with intracellular reactions. Finally, I fabricate a micro/nanoscale MC receiver based on graphene field-effect transistor biosensors and perform its ICT characterisation in a custom-designed microfluidic MC system with the information encoded into the concentration of DNAs. This experimental platform is the first practical demonstration of micro/nanoscale MC, and can serve as a testbed for developing realistic MC methods

SMARAD - Centre of Excellence in Smart Radios and Wireless Research - Activity Report 2011 - 2013

Centre of Excellence in Smart Radios and Wireless Research (SMARAD), originally established with the name Smart and Novel Radios Research Unit, is aiming at world-class research and education in Future radio and antenna systems, Cognitive radio, Millimetre wave and THz techniques, Sensors, and Materials and energy, using its expertise in RF, microwave and millimeter wave engineering, in integrated circuit design for multi-standard radios as well as in wireless communications. SMARAD has the Centre of Excellence in Research status from the Academy of Finland since 2002 (2002-2007 and 2008-2013). Currently SMARAD consists of five research groups from three departments, namely the Department of Radio Science and Engineering, Department of Micro and Nanosciences, and Department of Signal Processing and Acoustics, all within the Aalto University School of Electrical Engineering. The total number of employees within the research unit is about 100 including 8 professors, about 30 senior scientists and about 40 graduate students and several undergraduate students working on their Master thesis. The relevance of SMARAD to the Finnish society is very high considering the high national income from exports of telecommunications and electronics products. The unit conducts basic research but at the same time maintains close co-operation with industry. Novel ideas are applied in design of new communication circuits and platforms, transmission techniques and antenna structures. SMARAD has a well-established network of co-operating partners in industry, research institutes and academia worldwide. It coordinates a few EU projects. The funding sources of SMARAD are diverse including the Academy of Finland, EU, ESA, Tekes, and Finnish and foreign telecommunications and semiconductor industry. As a by-product of this research SMARAD provides highest-level education and supervision to graduate students in the areas of radio engineering, circuit design and communications through Aalto University and Finnish graduate schools. During years 2011 – 2013, 18 doctor degrees were awarded to the students of SMARAD. In the same period, the SMARAD researchers published 197 refereed journal articles and 360 conference papers

Performance analysis of spectrum sensing techniques for future wireless networks

In this thesis, spectrum sensing techniques are investigated for cognitive radio (CR) networks in order to improve the sensing and transmission performance of secondary networks. Specifically, the detailed exploration comprises of three areas, including single-node spectrum sensing based on eigenvalue-based detection, cooperative spectrum sensing under random secondary networks and full-duplex (FD) spectrum sensing and sharing techniques. In the first technical chapter of this thesis, eigenvalue-based spectrum sensing techniques, including maximum eigenvalue detection (MED), maximum minimum eigenvalue (MME) detection, energy with minimum eigenvalue (EME) detection and the generalized likelihood ratio test (GLRT) eigenvalue detector, are investigated in terms of total error rates and achievable throughput. Firstly, in order to consider the benefits of primary users (PUs) and secondary users (SUs) simultaneously, the optimal decision thresholds are investigated to minimize the total error rate, i.e. the summation of missed detection and false alarm rate. Secondly, the sensing-throughput trade-off is studied based on the GLRT detector and the optimal sensing time is obtained for maximizing the achievable throughput of secondary communications when the target probability of detection is achieved. In the second technical chapter, the centralized GLRT-based cooperative sensing technique is evaluated by utilizing a homogeneous Poisson point process (PPP). Firstly, since collaborating all the available SUs does not always achieve the best sensing performance under a random secondary network, the optimal number of cooperating SUs is investigated to minimize the total error rate of the final decision. Secondly, the achievable ergodic capacity and throughput of SUs are studied and the technique of determining an appropriate number of cooperating SUs is proposed to optimize the secondary transmission performance based on a target total error rate requirement. In the last technical chapter, FD spectrum sensing (FDSS) and sensing-based spectrum sharing (FD-SBSS) are investigated. There exists a threshold pair, not a single threshold, due to the self-interference caused by the simultaneous sensing and transmission. Firstly, by utilizing the derived expressions of false alarm and detection rates, the optimal decision threshold pair is obtained to minimize total error rate for the FDSS scheme. Secondly, in order to further improve the secondary transmission performance, the FD-SBSS scheme is proposed and the collision and spectrum waste probabilities are studied. Furthermore, different antenna partitioning methods are proposed to maximize the achievable throughput of SUs under both FDSS and FD-SBSS schemes

Advanced Trends in Wireless Communications

Physical limitations on wireless communication channels impose huge challenges to reliable communication. Bandwidth limitations, propagation loss, noise and interference make the wireless channel a narrow pipe that does not readily accommodate rapid flow of data. Thus, researches aim to design systems that are suitable to operate in such channels, in order to have high performance quality of service. Also, the mobility of the communication systems requires further investigations to reduce the complexity and the power consumption of the receiver. This book aims to provide highlights of the current research in the field of wireless communications. The subjects discussed are very valuable to communication researchers rather than researchers in the wireless related areas. The book chapters cover a wide range of wireless communication topics

Spectrum Sensing in Cognitive Radio: Bootstrap and Sequential Detection Approaches

In this thesis, advanced techniques for spectrum sensing in cognitive radio are addressed. The problem of small sample size in spectrum sensing is considered, and resampling-based methods are developed for local and collaborative spectrum sensing. A method to deal with unknown parameters in sequential testing for spectrum sensing is proposed. Moreover, techniques are developed for multiband sensing, spectrum sensing in low signal to noise ratio, and two-bits hard decision combining for collaborative spectrum sensing. The assumption of using large sample size in spectrum sensing often raises a problem when the devised test statistic is implemented with a small sample size. This is because, for small sample sizes, the asymptotic approximation for the distribution of the test statistic under the null hypothesis fails to model the true distribution. Therefore, the probability of false alarm or miss detection of the test statistic is poor. In this respect, we propose to use bootstrap methods, where the distribution of the test statistic is estimated by resampling the observed data. For local spectrum sensing, we propose the null-resampling bootstrap test which exhibits better performances than the pivot bootstrap test and the asymptotic test, as common approaches. For collaborative spectrum sensing, a resampling-based Chair-Varshney fusion rule is developed. At the cognitive radio user, a combination of independent resampling and moving-block resampling is proposed to estimate the local probability of detection. At the fusion center, the parametric bootstrap is applied when the number of cognitive radio users is large. The sequential probability ratio test (SPRT) is designed to test a simple hypothesis against a simple alternative hypothesis. However, the more realistic scenario in spectrum sensing is to deal with composite hypotheses, where the parameters are not uniquely defined. In this thesis, we generalize the sequential probability ratio test to cope with composite hypotheses, wherein the thresholds are updated in an adaptive manner, using the parametric bootstrap. The resulting test avoids the asymptotic assumption made in earlier works. The proposed bootstrap based sequential probability ratio test minimizes decision errors due to errors induced by employing maximum likelihood estimators in the generalized sequential probability ratio test. Hence, the proposed method achieves the sensing objective. The average sample number (ASN) of the proposed method is better than that of the conventional method which uses the asymptotic assumption. Furthermore, we propose a mechanism to reduce the computational cost incurred by the bootstrap, using a convex combination of the latest K bootstrap distributions. The reduction in the computational cost does not impose a significant increase on the ASN, while the protection against decision errors is even better. This work is motivated by the fact that the sequential probability ratio test produces a smaller sensing time than its counterpart of fixed sample size test. A smaller sensing time is preferable to improve the throughput of the cognitive radio network. Moreover, multiband spectrum sensing is addressed, more precisely by using multiple testing procedures. In a context of a fixed sample size, an adaptive Benjamini-Hochberg procedure is suggested to be used, since it produces a better balance between the familywise error rate and the familywise miss detection, than the conventional Benjamini-Hochberg. For the sequential probability ratio test, we devise a method based on ordered stopping times. The results show that our method has smaller ASNs than the Bonferroni procedure. Another issue in spectrum sensing is to detect a signal when the signal to noise ratio is very low. In this case, we derive a locally optimum detector that is based on the assumption that the underlying noise is Student's t-distributed. The resulting scheme outperforms the energy detector in all scenarios. Last but not least, we extend the hard decision combining in collaborative spectrum sensing to include a quality information bit. In this case, the multiple thresholds are determined by a distance measure criterion. The hard decision combining with quality information performs better than the conventional hard decision combining

Technology 2001: The Second National Technology Transfer Conference and Exposition, volume 1

Papers from the technical sessions of the Technology 2001 Conference and Exposition are presented. The technical sessions featured discussions of advanced manufacturing, artificial intelligence, biotechnology, computer graphics and simulation, communications, data and information management, electronics, electro-optics, environmental technology, life sciences, materials science, medical advances, robotics, software engineering, and test and measurement

Managing the Influence of Stakeholders on the Scope of Major Construction Projects to Prevent Scope Creep in the BIM Era

The present PhD thesis is centred on investigating the challenge of scope creep within construction projects, denoting the phenomenon of an uncontrolled enlargement of project scope without essential adaptations. Stakeholders are identified as a major source of uncertainty and requests for changes in scope, which can result in risky events. Therefore, an overarching framework is needed to effectively resolve the problem of scope creep caused by stakeholder influence. The adoption of Building Information Modelling (BIM) is suggested as an effective methodology for the streamlined management of information in construction projects, thus enabling project managers to develop an appropriate solution for the identified problem. To develop this framework, a meta-analysis approach and case study strategy is employed to analyse and synthesise secondary data collected from the PMBOK GUIDE’S (PMI, 2017) project management processes, BIM-related standards, and six case study projects. The objective is to identify essential processes and activities, their sequence and interdependencies, problematic issues, and best practices. The outcome of the research is the creation of a Process Framework designed to address the problem of scope creep triggered by stakeholder influence. The elements and concepts of this framework are verified by undertaking semi-structured interviews with five practitioners from the construction and infrastructure industry. The Process Framework functions as a unifying mechanism that combines project management and BIM processes, thereby ensuring coordination and integration towards the overarching objective of managing stakeholder influence on project scope and mitigating scope creep. Additionally, this research contributes to the understanding of the relationship between BIM documents and project management processes. The study explores how BIM fits within project management processes and identifies the benefits of BIM for the resolution of issues in construction projects, including end product visualization, clash detection, and efficient information sharing. This study provides an extensive and meticulous analysis of scope creep within construction projects and presents a pragmatic framework for dealing with this issue

Reinforcement Learning

Brains rule the world, and brain-like computation is increasingly used in computers and electronic devices. Brain-like computation is about processing and interpreting data or directly putting forward and performing actions. Learning is a very important aspect. This book is on reinforcement learning which involves performing actions to achieve a goal. The first 11 chapters of this book describe and extend the scope of reinforcement learning. The remaining 11 chapters show that there is already wide usage in numerous fields. Reinforcement learning can tackle control tasks that are too complex for traditional, hand-designed, non-learning controllers. As learning computers can deal with technical complexities, the tasks of human operators remain to specify goals on increasingly higher levels. This book shows that reinforcement learning is a very dynamic area in terms of theory and applications and it shall stimulate and encourage new research in this field

Estimation Algorithms for Non-Gaussian State-Space Models with Application to Positioning

State-space models (SSMs) are used to model systems with hidden time-varying state and observable measurement output. In statistical SSMs, the state dynamics is assumed known up to a random term referred to as the process noise, and the measurements contain random measurement noise. Kalman filter (KF) and Rauch– Tung–Striebel smoother (RTSS) are widely-applied closed-form algorithms that provide the parameters of the exact Bayesian filtering and smoothing distributions for discrete-time linear statistical SSMs where the process and measurement noises follow Gaussian distributions. However, when the SSM involves nonlinear functions and/or non-Gaussian noises, the Bayesian filtering and smoothing distributions cannot in general be solved using closed-form algorithms. This thesis addresses approximate Bayesian time-series inference for two positioning-related problems where the assumption of Gaussian noises cannot capture all useful knowledge of the considered system’s statistical properties: map-assisted indoor positioning and positioning using time-delay measurements.The motion constraints imposed by the indoor map are typically incorporated in the position estimate using the particle filter (PF) algorithm. The PF is a Monte Carlo algorithm especially suited for statistical SSMs where the Bayesian posterior distributions are too complicated to be adequately approximated using a well-known distribution family with a low-dimensional parameter space. In mapassisted indoor positioning, the trajectories that cross walls or floor levels get a low probability in the model. In this thesis, improvements to three different PF algorithms for map-assisted indoor positioning are proposed and compared. In the wall-collision PF, weighted random samples, also known as particles, are moved based on inertial sensor measurements, and the particles that collide with the walls are downweighted. When the inertial sensor measurements are very noisy, map information is used to guide the particles such that fewer particles collide with the walls, which implies that more particles contribute to the estimation. When no inertial sensor information is used, the particles are moved along the links of a graph that is dense enough to approximate the set of expected user paths.Time-delay based ranging measurements of e.g. ultra-wideband (UWB) and Global Navigation Satellite Systems (GNSSs) contain occasional positive measurement errors that are large relative to the majority of the errors due to multipath effects and denied line of sight. In this thesis, computationally efficient approximate Bayesian filters and smoothers are proposed for statistical SSMs where the measurement noise follows a skew t -distribution, and the algorithms are applied to positioning using time-delay based ranging measurements. The skew t -distribution is an extension of the Gaussian distribution, which has two additional parameters that affect the heavytailedness and skewness of the distribution. When the measurement noise model is heavy-tailed, the optimal Bayesian algorithm is robust to occasional large measurement errors, and when the model is positively (or negatively) skewed, the algorithms account for the fact that most large errors are known to be positive (or negative). Therefore, the skew t -distribution is more flexible than the Gaussian distribution and captures more statistical features of the error distributions of UWB and GNSS measurements. Furthermore, the skew t -distribution admits a conditionally Gaussian hierarchical form that enables approximating the filtering and smoothing posteriors with Gaussian distributions using variational Bayes (VB) algorithms. The proposed algorithms can thus be computationally efficient compared to Monte Carlo algorithms especially when the state is high-dimensional. It is shown in this thesis that the skew-t filter improves the accuracy of UWB based indoor positioning and GNSS based outdoor positioning in urban areas compared to the extended KF. The skew-t filter’s computational burden is higher than that of the extended KF but of the same magnitude.Tila-avaruusmalleilla mallinnetaan järjestelmiä, joilla on tuntema-ton ajassa muuttuva tila sekä mitatattava ulostulo. Tilastollisissa tila-avaruusmalleissa järjestelmän tilan muutos tunnetaan lukuunotta-matta prosessikohinaksi kutsuttua satunnaista termiä, ja mittauk-set sisältävät satunnaista mittauskohinaa. Kalmanin suodatin sekäRauchin Tungin ja Striebelin siloitin ovat yleisesti käytettyjä sulje-tun muodon estimointialgoritmeja, jotka tuottavat tarkat bayesiläi-set suodatus- ja siloitusjakaumat diskreettiaikaisille lineaarisille ti-lastollisille tila-avaruusmalleille, joissa prosessi- ja mittauskohinatnoudattavat gaussisia jakaumia. Jos käsiteltyyn tila-avaruusmalliinkuitenkin liittyy epälineaarisia funktioita tai epägaussisia kohinoita,bayesiläisiä suodatus- ja siloitusjakaumia ei yleensä voida ratkais-ta suljetun muodon algoritmeilla. Tässä väitöskirjassa tutkitaan ap-proksimatiivista bayesiläistä aikasarjapäättelyä ja sen soveltamistakahteen paikannusongelmaan, joissa gaussinen jakauma ei mallinnariittävän hyvin kaikkea hyödyllistä tietoa tutkitun järjestelmän tilas-tollisista ominaisuuksista: kartta-avusteinen sisätilapaikannus sekäsignaalin kulkuaikamittauksiin perustuva paikannus.Sisätilakartan tuottamat liikerajoitteet voidaan liittää paikkaestimaat-tiin käyttäen partikkelisuodattimeksi kutsuttua algoritmia. Partik-kelisuodatin on Monte Carlo -algoritmi, joka soveltuu erityisesti ti-lastollisille tila-avaruusmalleille, joissa bayesiläisen posteriorijakau-man tiheysfunktio on niin monimutkainen, että sen approksimointitunnetuilla matalan parametridimension jakaumilla ei ole mielekäs-tä. Kartta-avusteisessa sisätilapaikannuksessa reitit, jotka leikkaavatseiniä tai kerrostasoja, saavat muita pienemmät todennäköisyydet.Tässä väitöskirjassa esitetään parannuksia kolmeen eri partikkelisuo-datusalgoritmiin, joita sovelletaan kartta-avusteiseen sisätilapaikan-vnukseen. Seinätörmayssuodattimessa painolliset satunnaisnäytteeteli partikkelit liikkuvat inertiasensorimittausten mukaisesti, ja sei-nään törmäävät partikkelit saavat pienet painot. Kun inertiasensori-mittauksissa on paljon kohinaa, partikkeleita voidaan ohjata siten,että seinätörmäysten määrä vähenee, jolloin suurempi osa partikke-leista vaikuttaa estimaattiin. Kun inertiasensorimittauksia ei käytetälainkaan, sisätilakartta voidaan esittää graafina, jonka kaarilla partik-kelit liikkuvat ja joka on riittävän tiheä approksimoimaan odotetta-vissa olevien reittien joukkoa.Esimerkiksi laajan taajuuskaistan radioista (UWB, ultra-wideband)tai paikannussatelliiteista saatavat radiosignaalin kulkuaikaan pe-rustuvat etäisyysmittaukset taas voivat sisältää monipolkuheijastus-ten ja suoran reitin estymisen aiheuttamia positiivismerkkisiä vir-heitä, jotka ovat huomattavan suuria useimpiin mittausvirheisiinverrattuna. Tässä väitöskirjassa esitetään laskennallisesti tehokkaitabayesiläisen suodattimen ja siloittimen approksimaatioita tilastol-lisille tila-avaruusmalleille, joissa mittauskohina noudattaa vinoat -jakaumaa. Vino t -jakauma on gaussisen jakauman laajennos, jasillä on kaksi lisäparametria, jotka vaikuttavat jakauman paksuhän-täisyyteen ja vinouteen. Kun mittauskohinaa mallintava jakaumaoletetaan paksuhäntäiseksi, optimaalinen bayesiläinen algoritmi eiole herkkä yksittäisille suurille mittausvirheille, ja kun jakauma olete-taan positiivisesti (tai negatiivisesti) vinoksi, algoritmit hyödyntävättietoa, että suurin osa suurista virheistä on positiivisia (tai negatiivi-sia). Vino t -jakauma on siis gaussista jakaumaa joustavampi, ja sillävoidaan mallintaa kulkuaikaan perustuvien mittausten virhejakau-maa tarkemmin kuin gaussisella jakaumalla. Vinolla t -jakaumalla onmyös ehdollisesti gaussinen esitys, joka soveltuu suodatus- ja siloi-tusposteriorien approksimointiin variaatio-Bayes-algoritmilla. Näinollen esitetyt algoritmit voivat olla laskennallisesti tehokkaampiakuin Monte Carlo -algoritmit erityisesti tilan ollessa korkeaulotteinen.Tässä väitöskirjassa näytetään, että vino-t -virhejakauman käyttö pa-rantaa UWB-radioon perustuvan sisätilapaikannuksen tarkkuuttasekä satelliittipohjaisen ulkopaikannuksen tarkkuutta kaupunkiym-päristössä verrattuna laajennettuun Kalmanin suodattimeen. Vino-t -suodatuksen laskennallinen vaativuus on suurempi mutta samaakertaluokkaa kuin laajennetun Kalmanin suodattimen