A Monitoring Network for Spectrum Governance

Dynamic Spectrum Access (DSA) is an exciting new technology, which has introduced a paradigm shift in spectrum access. As a result it also changes the role of the regulator. On one hand the scarce radio spectrum should be used in an optimal way, so that society is best served. On the other hand interference between users and between networks should be avoided. For that reason rules have to be defined for spectrum use. This topic is called spectrum governance. For evaluation and to check whether devices obey the rules, a monitoring system is needed. In this paper, we propose to use a fleet of mobile monitoring vehicles for this purpose.\u

Dynamic Geospatial Spectrum Modelling: Taxonomy, Options and Consequences

Much of the research in Dynamic Spectrum Access (DSA) has focused on opportunistic access in the temporal domain. While this has been quite useful in establishing the technical feasibility of DSA systems, it has missed large sections of the overall DSA problem space. In this paper, we argue that the spatio-temporal operating context of specific environments matters to the selection of the appropriate technology for learning context information. We identify twelve potential operating environments and compare four context awareness approaches (on-board sensing, databases, sensor networks, and cooperative sharing) for these environments. Since our point of view is overall system cost and efficiency, this analysis has utility for those regulators whose objectives are reducing system costs and enhancing system efficiency. We conclude that regulators should pay attention to the operating environment of DSA systems when determining which approaches to context learning to encourage

A survey of measurement-based spectrum occupancy modeling for cognitive radios

Spectrum occupancy models are very useful in cognitive radio designs. They can be used to increase spectrum sensing accuracy for more reliable operation, to remove spectrum sensing for higher resource usage efficiency, or to select channels for better opportunistic access, among other applications. In this survey, various spectrum occupancy models from measurement campaigns taken around the world are investigated. These models extract different statistical properties of the spectrum occupancy from the measured data. In addition to these models, spectrum occupancy prediction is also discussed, where autoregressive and/or moving-average models are used to predict the channel status at future time instants. After comparing these different methods and models, several challenges are also summarized based on this survey

Distributed Clustering in Cognitive Radio Ad Hoc Networks Using Soft-Constraint Affinity Propagation

Absence of network infrastructure and heterogeneous spectrum availability in cognitive radio ad hoc networks (CRAHNs) necessitate the self-organization of cognitive radio users (CRs) for efficient spectrum coordination. The cluster-based structure is known to be effective in both guaranteeing system performance and reducing communication overhead in variable network environment. In this paper, we propose a distributed clustering algorithm based on soft-constraint affinity propagation message passing model (DCSCAP). Without dependence on predefined common control channel (CCC), DCSCAP relies on the distributed message passing among CRs through their available channels, making the algorithm applicable for large scale networks. Different from original soft-constraint affinity propagation algorithm, the maximal iterations of message passing is controlled to a relatively small number to accommodate to the dynamic environment of CRAHNs. Based on the accumulated evidence for clustering from the message passing process, clusters are formed with the objective of grouping the CRs with similar spectrum availability into smaller number of clusters while guaranteeing at least one CCC in each cluster. Extensive simulation results demonstrate the preference of DCSCAP compared with existing algorithms in both efficiency and robustness of the clusters

Spectrum occupancy measurements and lessons learned in the context of cognitive radio

Various measurement campaigns have shown that numerous spectrum bands are vacant even though licenses have been issued by the regulatory agencies. Dynamic spectrum access (DSA) based on Cognitive Radio (CR) has been regarded as a prospective solution to improve spectrum utilization for wireless communications. Empirical measurement of the radio environment to promote understanding of the current spectrum usage of the different wireless services is the first step towards deployment of future CR networks. In this paper we present our spectrum measurement setup and discuss lessons learned during our measurement activities. The main contribution of the paper is to introduce global spectrum occupancy measurements and address the major drawbacks of previous spectrum occupancy studies by providing a unifying methodological framework for future spectrum measurement campaigns

On the Performance of Spectrum Sensing Algorithms using Multiple Antennas

In recent years, some spectrum sensing algorithms using multiple antennas, such as the eigenvalue based detection (EBD), have attracted a lot of attention. In this paper, we are interested in deriving the asymptotic distributions of the test statistics of the EBD algorithms. Two EBD algorithms using sample covariance matrices are considered: maximum eigenvalue detection (MED) and condition number detection (CND). The earlier studies usually assume that the number of antennas (K) and the number of samples (N) are both large, thus random matrix theory (RMT) can be used to derive the asymptotic distributions of the maximum and minimum eigenvalues of the sample covariance matrices. While assuming the number of antennas being large simplifies the derivations, in practice, the number of antennas equipped at a single secondary user is usually small, say 2 or 3, and once designed, this antenna number is fixed. Thus in this paper, our objective is to derive the asymptotic distributions of the eigenvalues and condition numbers of the sample covariance matrices for any fixed K but large N, from which the probability of detection and probability of false alarm can be obtained. The proposed methodology can also be used to analyze the performance of other EBD algorithms. Finally, computer simulations are presented to validate the accuracy of the derived results.Comment: IEEE GlobeCom 201