1,028 research outputs found
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
Energy-aware cooperative wireless networks with multiple cognitive users
In this paper, we study and analyze cooperative cognitive radio networks with arbitrary number of secondary users (SUs). Each SU is considered a prospective relay for the primary user (PU) besides having its own data transmission demand. We consider a multi-packet transmission framework that allows multiple SUs to transmit simultaneously because of dirty-paper coding. We propose power allocation and scheduling policies that optimize the throughput for both PU and SU with minimum energy expenditure. The performance of the system is evaluated in terms of throughput and delay under different opportunistic relay selection policies. Toward this objective, we present a mathematical framework for deriving stability conditions for all queues in the system. Consequently, the throughput of both primary and secondary links is quantified. Furthermore, a moment generating function approach is employed to derive a closed-form expression for the average delay encountered by the PU packets. Results reveal that we achieve better performance in terms of throughput and delay at lower energy cost as compared with equal power allocation schemes proposed earlier in the literature. Extensive simulations are conducted to validate our theoretical findings
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
- …