54,218 research outputs found
Transparent Spectrum Co-Access in Cognitive Radio Networks
The licensed wireless spectrum is currently under-utilized by as much as 85%. Cognitive radio networks have been proposed to employ dynamic spectrum access to share this under-utilized spectrum between licensed primary user transmissions and unlicensed secondary user transmissions. Current secondary user opportunistic spectrum access methods, however, remain limited in their ability to provide enough incentive to convince primary users to share the licensed spectrum, and they rely on primary user absence to guarantee secondary user performance. These challenges are addressed by developing a Dynamic Spectrum Co-Access Architecture (DSCA) that allows secondary user transmissions to co-access transparently and concurrently with primary user transmissions. This work exploits dirty paper coding to precode the cognitive radio channel utilizing the redundant information found in primary user relay networks. Subsequently, the secondary user is able to provide incentive to the primary user through increased SINR to encourage licensed spectrum sharing. Then a region of co-accessis formulated within which any secondary user can co-access the licensed channel transparently to the primary user. In addition, a Spectrum Co-Access Protocol (SCAP) is developed to provide secondary users with guaranteed channel capacity and while minimizing channel access times. The numerical results show that the SCAP protocol build on the DSCA architecture is able to reduce secondary user channel access times compared with opportunistic spectrum access and increased secondary user network throughput. Finally, we present a novel method for increasing the secondary user channel capacity through sequential dirty paper coding. By exploiting similar redundancy in secondary user multi-hop networks as in primary user relay networks, the secondary user channel capacity can be increased. As a result of our work in overlay spectrum sharing through secondary user channel precoding, we provide a compelling argument that the current trend towards opportunistic spectrum sharing needs to be reconsidered. This work asserts that limitations of opportunistic spectrum access to transparently provide primary users incentive and its detrimental effect on secondary user performance due to primary user activity are enough to motivate further study into utilizing channel precoding schemes. The success of cognitive radios and its adoption into federal regulator policy will rely on providing just this type of incentive
A dynamic channel access strategy for underlay cognitive radio networks: Markov modelling and performance evaluation
[EN] Unlike in overlay cognitive radio networks, secondary users in underlay cognitive radio networks can access licensed
spectrum even at the presence of a primary user, given that the interference caused by the secondary transmission is
lower than a pre-specified threshold. Based on this underlay access principle, we propose in this paper a dynamic channel
access strategy for multi-channel cognitive radio networks. Different from existing underlay access techniques, channel
assembling, spectrum adaptation and restricted channel occupancy are also considered in the proposed strategy in order
to achieve better performance in the secondary network. Accordingly, a partial channel occupancy mode, which allows
secondary users to access a portion of a channel when co-existing with a primary user, is introduced in this study. The size
of this portion is adjusted by selecting an appropriate value of a configurable parameter ¿ in the partial channel occupancy
mode. The system performance is evaluated for both primary and secondary networks, and a comparison analysis is carried
out to assess the cost against the gain. Numerical results demonstrate that the proposed underlay channel access strategy
outperforms the corresponding overlay strategy in terms of secondary network capacity, blocking probability and dropping
probability. The cost and gain analysis identifies appropriate traffic conditions under which the overall system performance
could be improved by employing the proposed underlay strategy.The work of V. Pla was supported in part by the Ministry of Economy and Competitiveness of Spain under Grant TIN2013-47272-C2-1-R.Jalali, E.; Balapuwaduge, IAM.; Li, FY.; Pla, V. (2017). A dynamic channel access strategy for underlay cognitive radio networks: Markov modelling and performance evaluation. Transactions on Emerging Telecommunications Technologies. 28(1):1-11. https://doi.org/10.1002/ett.2928S11128
Exploiting Multi-Antennas for Opportunistic Spectrum Sharing in Cognitive Radio Networks
In cognitive radio (CR) networks, there are scenarios where the secondary
(lower priority) users intend to communicate with each other by
opportunistically utilizing the transmit spectrum originally allocated to the
existing primary (higher priority) users. For such a scenario, a secondary user
usually has to trade off between two conflicting goals at the same time: one is
to maximize its own transmit throughput; and the other is to minimize the
amount of interference it produces at each primary receiver. In this paper, we
study this fundamental tradeoff from an information-theoretic perspective by
characterizing the secondary user's channel capacity under both its own
transmit-power constraint as well as a set of interference-power constraints
each imposed at one of the primary receivers. In particular, this paper
exploits multi-antennas at the secondary transmitter to effectively balance
between spatial multiplexing for the secondary transmission and interference
avoidance at the primary receivers. Convex optimization techniques are used to
design algorithms for the optimal secondary transmit spatial spectrum that
achieves the capacity of the secondary transmission. Suboptimal solutions for
ease of implementation are also presented and their performances are compared
with the optimal solution. Furthermore, algorithms developed for the
single-channel transmission are also extended to the case of multi-channel
transmission whereby the secondary user is able to achieve opportunistic
spectrum sharing via transmit adaptations not only in space, but in time and
frequency domains as well.Comment: Extension of IEEE PIMRC 2007. 35 pages, 6 figures. Submitted to IEEE
Journal of Special Topics in Signal Processing, special issue on Signal
Processing and Networking for Dynamic Spectrum Acces
Secrecy Outage and Diversity Analysis of Cognitive Radio Systems
In this paper, we investigate the physical-layer security of a multi-user
multi-eavesdropper cognitive radio system, which is composed of multiple
cognitive users (CUs) transmitting to a common cognitive base station (CBS),
while multiple eavesdroppers may collaborate with each other or perform
independently in intercepting the CUs-CBS transmissions, which are called the
coordinated and uncoordinated eavesdroppers, respectively. Considering multiple
CUs available, we propose the round-robin scheduling as well as the optimal and
suboptimal user scheduling schemes for improving the security of CUs-CBS
transmissions against eavesdropping attacks. Specifically, the optimal user
scheduling is designed by assuming that the channel state information (CSI) of
all links from CUs to CBS, to primary user (PU) and to eavesdroppers are
available. By contrast, the suboptimal user scheduling only requires the CSI of
CUs-CBS links without the PU's and eavesdroppers' CSI. We derive closed-form
expressions of the secrecy outage probability of these three scheduling schemes
in the presence of the coordinated and uncoordinated eavesdroppers. We also
carry out the secrecy diversity analysis and show that the round-robin
scheduling achieves the diversity order of only one, whereas the optimal and
suboptimal scheduling schemes obtain the full secrecy diversity, no matter
whether the eavesdroppers collaborate or not. In addition, numerical secrecy
outage results demonstrate that for both the coordinated and uncoordinated
eavesdroppers, the optimal user scheduling achieves the best security
performance and the round-robin scheduling performs the worst. Finally, upon
increasing the number of CUs, the secrecy outage probabilities of the optimal
and suboptimal user scheduling schemes both improve significantly.Comment: 16 pages, 5 figures, accepted to appear, IEEE Journal on Selected
Areas in Communications, 201
- …