1,580 research outputs found
Multiband Spectrum Access: Great Promises for Future Cognitive Radio Networks
Cognitive radio has been widely considered as one of the prominent solutions
to tackle the spectrum scarcity. While the majority of existing research has
focused on single-band cognitive radio, multiband cognitive radio represents
great promises towards implementing efficient cognitive networks compared to
single-based networks. Multiband cognitive radio networks (MB-CRNs) are
expected to significantly enhance the network's throughput and provide better
channel maintenance by reducing handoff frequency. Nevertheless, the wideband
front-end and the multiband spectrum access impose a number of challenges yet
to overcome. This paper provides an in-depth analysis on the recent
advancements in multiband spectrum sensing techniques, their limitations, and
possible future directions to improve them. We study cooperative communications
for MB-CRNs to tackle a fundamental limit on diversity and sampling. We also
investigate several limits and tradeoffs of various design parameters for
MB-CRNs. In addition, we explore the key MB-CRNs performance metrics that
differ from the conventional metrics used for single-band based networks.Comment: 22 pages, 13 figures; published in the Proceedings of the IEEE
Journal, Special Issue on Future Radio Spectrum Access, March 201
Throughput of a Cognitive Radio Network under Congestion Constraints: A Network-Level Study
In this paper we analyze a cognitive radio network with one primary and one
secondary transmitter, in which the primary transmitter has bursty arrivals
while the secondary node is assumed to be saturated (i.e. always has a packet
waiting to be transmitted). The secondary node transmits in a cognitive way
such that it does not impede the performance of the primary node. We assume
that the receivers have multipacket reception (MPR) capabilities and that the
secondary node can take advantage of the MPR capability by transmitting
simultaneously with the primary under certain conditions. We obtain analytical
expressions for the stationary distribution of the primary node queue and we
also provide conditions for its stability. Finally, we provide expressions for
the aggregate throughput of the network as well as for the throughput at the
secondary node.Comment: Presented at CROWNCOM 201
Energy-Efficient Cooperative Cognitive Relaying Schemes for Cognitive Radio Networks
We investigate a cognitive radio network in which a primary user (PU) may
cooperate with a cognitive radio user (i.e., a secondary user (SU)) for
transmissions of its data packets. The PU is assumed to be a buffered node
operating in a time-slotted fashion where the time is partitioned into
equal-length slots. We develop two schemes which involve cooperation between
primary and secondary users. To satisfy certain quality of service (QoS)
requirements, users share time slot duration and channel frequency bandwidth.
Moreover, the SU may leverage the primary feedback message to further increase
both its data rate and satisfy the PU QoS requirements. The proposed
cooperative schemes are designed such that the SU data rate is maximized under
the constraint that the PU average queueing delay is maintained less than the
average queueing delay in case of non-cooperative PU. In addition, the proposed
schemes guarantee the stability of the PU queue and maintain the average energy
emitted by the SU below a certain value. The proposed schemes also provide more
robust and potentially continuous service for SUs compared to the conventional
practice in cognitive networks where SUs transmit in the spectrum holes and
silence sessions of the PUs. We include primary source burstiness, sensing
errors, and feedback decoding errors to the analysis of our proposed
cooperative schemes. The optimization problems are solved offline and require a
simple 2-dimensional grid-based search over the optimization variables.
Numerical results show the beneficial gains of the cooperative schemes in terms
of SU data rate and PU throughput, average PU queueing delay, and average PU
energy savings
Applications of Repeated Games in Wireless Networks: A Survey
A repeated game is an effective tool to model interactions and conflicts for
players aiming to achieve their objectives in a long-term basis. Contrary to
static noncooperative games that model an interaction among players in only one
period, in repeated games, interactions of players repeat for multiple periods;
and thus the players become aware of other players' past behaviors and their
future benefits, and will adapt their behavior accordingly. In wireless
networks, conflicts among wireless nodes can lead to selfish behaviors,
resulting in poor network performances and detrimental individual payoffs. In
this paper, we survey the applications of repeated games in different wireless
networks. The main goal is to demonstrate the use of repeated games to
encourage wireless nodes to cooperate, thereby improving network performances
and avoiding network disruption due to selfish behaviors. Furthermore, various
problems in wireless networks and variations of repeated game models together
with the corresponding solutions are discussed in this survey. Finally, we
outline some open issues and future research directions.Comment: 32 pages, 15 figures, 5 tables, 168 reference
Cooperative Access in Cognitive Radio Networks: Stable Throughput and Delay Tradeoffs
In this paper, we study and analyze fundamental throughput-delay tradeoffs in
cooperative multiple access for cognitive radio systems. We focus on the class
of randomized cooperative policies, whereby the secondary user (SU) serves
either the queue of its own data or the queue of the primary user (PU) relayed
data with certain service probabilities. The proposed policy opens room for
trading the PU delay for enhanced SU delay. Towards this objective, stability
conditions for the queues involved in the system are derived. Furthermore, a
moment generating function approach is employed to derive closed-form
expressions for the average delay encountered by the packets of both users.
Results reveal that cooperation expands the stable throughput region of the
system and significantly reduces the delay at both users. Moreover, we quantify
the gain obtained in terms of the SU delay under the proposed policy, over
conventional relaying that gives strict priority to the relay queue.Comment: accepted for publication in IEEE 12th Intl. Symposium on Modeling and
Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), 201
- …