33,393 research outputs found
Recommended from our members
Novel channel sensing and access strategies in opportunistic spectrum access networks
textTraditionally radio spectrum was considered a commodity to be allocated in a fixed and centralized manner, but now the technical community and the regulators approach it as a shared resource that can be flexibly and intelligently shared between competing entities. In this thesis we focus on novel strategies to sense and access the radio spectrum within the framework of Opportunistic Spectrum Access via Cognitive Radio Networks (CRNs).
In the first part we develop novel transmit opportunity detection methods that effectively exploit the gray space present in packet based networks. Our methods proactively detect the maximum safe transmit power that does not significantly affect the primary network nodes via an implicit feedback mechanism from the Primary network to the Secondary network. A novel use of packet interarrival duration is developed to robustly perform change detection in the primary network's Quality of Service. The methods are validated on real world IEEE 802.11 WLANs.
In the second part we study the inferential use of Goodness-of-Fit tests for spectrum sensing applications. We provide the first comprehensive framework for decision fusion of an ensemble of goodness-of-fit tests through use of p-values. Also, we introduce a generalized Phi-divergence statistic to formulate goodness-of-fit tests that are tunable via a single parameter. We show that under uncertainty in the noise statistics or non-Gaussianity in the noise, the performance of such non-parametric tests is significantly superior to that of conventional spectrum sensing methods. Additionally, we describe a collaborative spatially separated version of the test for robust combining of tests in a distributed spectrum sensing setting.
In the third part we develop the sequential energy detection problem for spectrum sensing and formulate a novel Sequential Energy Detector. Through extensive simulations we demonstrate that our doubly hierarchical sequential testing architecture delivers a significant throughput improvement of 2 to 6 times over the fixed sample size test while maintaining equivalent operating characteristics as measured by the Probabilities of Detection and False Alarm. We also demonstrate the throughput gains for a case study of sensing ATSC television signals in IEEE 802.22 systems.Electrical and Computer Engineerin
Distributed Nonparametric Sequential Spectrum Sensing under Electromagnetic Interference
A nonparametric distributed sequential algorithm for quick detection of
spectral holes in a Cognitive Radio set up is proposed. Two or more local nodes
make decisions and inform the fusion centre (FC) over a reporting Multiple
Access Channel (MAC), which then makes the final decision. The local nodes use
energy detection and the FC uses mean detection in the presence of fading,
heavy-tailed electromagnetic interference (EMI) and outliers. The statistics of
the primary signal, channel gain or the EMI is not known. Different
nonparametric sequential algorithms are compared to choose appropriate
algorithms to be used at the local nodes and the FC. Modification of a recently
developed random walk test is selected for the local nodes for energy detection
as well as at the fusion centre for mean detection. It is shown via simulations
and analysis that the nonparametric distributed algorithm developed performs
well in the presence of fading, EMI and is robust to outliers. The algorithm is
iterative in nature making the computation and storage requirements minimal.Comment: 8 pages; 6 figures; Version 2 has the proofs for the theorems.
Version 3 contains a new section on approximation analysi
Byzantine Attack and Defense in Cognitive Radio Networks: A Survey
The Byzantine attack in cooperative spectrum sensing (CSS), also known as the
spectrum sensing data falsification (SSDF) attack in the literature, is one of
the key adversaries to the success of cognitive radio networks (CRNs). In the
past couple of years, the research on the Byzantine attack and defense
strategies has gained worldwide increasing attention. In this paper, we provide
a comprehensive survey and tutorial on the recent advances in the Byzantine
attack and defense for CSS in CRNs. Specifically, we first briefly present the
preliminaries of CSS for general readers, including signal detection
techniques, hypothesis testing, and data fusion. Second, we analyze the spear
and shield relation between Byzantine attack and defense from three aspects:
the vulnerability of CSS to attack, the obstacles in CSS to defense, and the
games between attack and defense. Then, we propose a taxonomy of the existing
Byzantine attack behaviors and elaborate on the corresponding attack
parameters, which determine where, who, how, and when to launch attacks. Next,
from the perspectives of homogeneous or heterogeneous scenarios, we classify
the existing defense algorithms, and provide an in-depth tutorial on the
state-of-the-art Byzantine defense schemes, commonly known as robust or secure
CSS in the literature. Furthermore, we highlight the unsolved research
challenges and depict the future research directions.Comment: Accepted by IEEE Communications Surveys and Tutoiral
Coalition Formation Games for Collaborative Spectrum Sensing
Collaborative Spectrum Sensing (CSS) between secondary users (SUs) in
cognitive networks exhibits an inherent tradeoff between minimizing the
probability of missing the detection of the primary user (PU) and maintaining a
reasonable false alarm probability (e.g., for maintaining a good spectrum
utilization). In this paper, we study the impact of this tradeoff on the
network structure and the cooperative incentives of the SUs that seek to
cooperate for improving their detection performance. We model the CSS problem
as a non-transferable coalitional game, and we propose distributed algorithms
for coalition formation. First, we construct a distributed coalition formation
(CF) algorithm that allows the SUs to self-organize into disjoint coalitions
while accounting for the CSS tradeoff. Then, the CF algorithm is complemented
with a coalitional voting game for enabling distributed coalition formation
with detection probability guarantees (CF-PD) when required by the PU. The
CF-PD algorithm allows the SUs to form minimal winning coalitions (MWCs), i.e.,
coalitions that achieve the target detection probability with minimal costs.
For both algorithms, we study and prove various properties pertaining to
network structure, adaptation to mobility and stability. Simulation results
show that CF reduces the average probability of miss per SU up to 88.45%
relative to the non-cooperative case, while maintaining a desired false alarm.
For CF-PD, the results show that up to 87.25% of the SUs achieve the required
detection probability through MWCComment: IEEE Transactions on Vehicular Technology, to appea
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
- …