782 research outputs found
On Orthogonal Band Allocation for Multi-User Multi-Band Cognitive Radio Networks: Stability Analysis
In this work, we study the problem of band allocation of buffered
secondary users (SUs) to primary bands licensed to (owned by)
buffered primary users (PUs). The bands are assigned to SUs in an orthogonal
(one-to-one) fashion such that neither band sharing nor multi-band allocations
are permitted. In order to study the stability region of the secondary network,
the optimization problem used to obtain the stability region's envelope
(closure) is established and is shown to be a linear program which can be
solved efficiently and reliably. We compare our orthogonal allocation system
with two typical low-complexity and intuitive band allocation systems. In one
system, each cognitive user chooses a band randomly in each time slot with some
assignment probability designed such that the system maintained stable, while
in the other system fixed (deterministic) band assignment is adopted throughout
the lifetime of the network. We derive the stability regions of these two
systems. We prove mathematically, as well as through numerical results, the
advantages of our proposed orthogonal system over the other two systems.Comment: Conditional Acceptance in IEEE Transactions on Communication
Optimal Spectrum Access for Cognitive Radios
In this paper, we investigate a time-slotted cognitive setting with buffered
primary and secondary users. In order to alleviate the negative effects of
misdetection and false alarm probabilities, a novel design of spectrum access
mechanism is proposed. We propose two schemes. First, the SU senses primary
channel to exploit the periods of silence, if the PU is declared to be idle,
the SU randomly accesses the channel with some access probability .
Second, in addition to accessing the channel if the PU is idle, the SU possibly
accesses the channel if it is declared to be busy with some access probability
. The access probabilities as function of the misdetection, false alarm
and average primary arrival rate are obtained via solving an optimization
problem designed to maximize the secondary service rate given a constraint on
primary queue stability. In addition, we propose a variable sensing duration
schemes where the SU optimizes over the optimal sensing time to achieve the
maximum stable throughput of the network. The results reveal the performance
gains of the proposed schemes over the conventional sensing scheme. We propose
a method to estimate the mean arrival rate and the outage probability of the PU
based on the primary feedback channel, i.e., acknowledgments (ACKs) and
negative-acknowledgments (NACKs) messages.Comment: arXiv admin note: substantial text overlap with arXiv:1206.615
A Comprehensive Survey of Potential Game Approaches to Wireless Networks
Potential games form a class of non-cooperative games where unilateral
improvement dynamics are guaranteed to converge in many practical cases. The
potential game approach has been applied to a wide range of wireless network
problems, particularly to a variety of channel assignment problems. In this
paper, the properties of potential games are introduced, and games in wireless
networks that have been proven to be potential games are comprehensively
discussed.Comment: 44 pages, 6 figures, to appear in IEICE Transactions on
Communications, vol. E98-B, no. 9, Sept. 201
Cooperative Secure Transmission by Exploiting Social Ties in Random Networks
Social awareness and social ties are becoming increasingly popular with
emerging mobile and handheld devices. Social trust degree describing the
strength of the social ties has drawn lots of research interests in many fields
in wireless communications, such as resource sharing, cooperative communication
and so on. In this paper, we propose a hybrid cooperative beamforming and
jamming scheme to secure communication based on the social trust degree under a
stochastic geometry framework. The friendly nodes are categorized into relays
and jammers according to their locations and social trust degrees with the
source node. We aim to analyze the involved connection outage probability (COP)
and secrecy outage probability (SOP) of the performance in the networks. To
achieve this target, we propose a double Gamma ratio (DGR) approach through
Gamma approximation. Based on this, the COP and SOP are tractably obtained in
closed-form. We further consider the SOP in the presence of Poisson Point
Process (PPP) distributed eavesdroppers and derive an upper bound. The
simulation results verify our theoretical findings, and validate that the
social trust degree has dramatic influences on the security performance in the
networks.Comment: 30 pages, 11 figures, to be published in IEEE Transactions on
Communication
Optimal Random Access and Random Spectrum Sensing for an Energy Harvesting Cognitive Radio with and without Primary Feedback Leveraging
We consider a secondary user (SU) with energy harvesting capability. We
design access schemes for the SU which incorporate random spectrum sensing and
random access, and which make use of the primary automatic repeat request (ARQ)
feedback. We study two problem-formulations. In the first problem-formulation,
we characterize the stability region of the proposed schemes. The sensing and
access probabilities are obtained such that the secondary throughput is
maximized under the constraints that both the primary and secondary queues are
stable. Whereas in the second problem-formulation, the sensing and access
probabilities are obtained such that the secondary throughput is maximized
under the stability of the primary queue and that the primary queueing delay is
kept lower than a specified value needed to guarantee a certain quality of
service (QoS) for the primary user (PU). We consider spectrum sensing errors
and assume multipacket reception (MPR) capabilities. Numerical results show the
enhanced performance of our proposed systems.Comment: ACCEPTED in EAI Endorsed Transactions on Cognitive Communications.
arXiv admin note: substantial text overlap with arXiv:1208.565
- …