2,245 research outputs found
Maximum Throughput of a Cooperative Energy Harvesting Cognitive Radio User
In this paper, we investigate the maximum throughput of a saturated
rechargeable secondary user (SU) sharing the spectrum with a primary user (PU).
The SU harvests energy packets (tokens) from the environment with a certain
harvesting rate. All transmitters are assumed to have data buffers to store the
incoming data packets. In addition to its own traffic buffer, the SU has a
buffer for storing the admitted primary packets for relaying; and a buffer for
storing the energy tokens harvested from the environment. We propose a new
cooperative cognitive relaying protocol that allows the SU to relay a fraction
of the undelivered primary packets. We consider an interference channel model
(or a multipacket reception (MPR) channel model), where concurrent
transmissions can survive from interference with certain probability
characterized by the complement of channel outages. The proposed protocol
exploits the primary queue burstiness and receivers' MPR capability. In
addition, it efficiently expends the secondary energy tokens under the
objective of secondary throughput maximization. Our numerical results show the
benefits of cooperation, receivers' MPR capability, and secondary energy queue
arrival rate on the system performance from a network layer standpoint.Comment: Part of this paper was accepted for publication in PIMRC 201
Optimal Cooperative Cognitive Relaying and Spectrum Access for an Energy Harvesting Cognitive Radio: Reinforcement Learning Approach
In this paper, we consider a cognitive setting under the context of
cooperative communications, where the cognitive radio (CR) user is assumed to
be a self-organized relay for the network. The CR user and the PU are assumed
to be energy harvesters. The CR user cooperatively relays some of the
undelivered packets of the primary user (PU). Specifically, the CR user stores
a fraction of the undelivered primary packets in a relaying queue (buffer). It
manages the flow of the undelivered primary packets to its relaying queue using
the appropriate actions over time slots. Moreover, it has the decision of
choosing the used queue for channel accessing at idle time slots (slots where
the PU's queue is empty). It is assumed that one data packet transmission
dissipates one energy packet. The optimal policy changes according to the
primary and CR users arrival rates to the data and energy queues as well as the
channels connectivity. The CR user saves energy for the PU by taking the
responsibility of relaying the undelivered primary packets. It optimally
organizes its own energy packets to maximize its payoff as time progresses
MIMO-OFDM Based Energy Harvesting Cooperative Communications Using Coalitional Game Algorithm
This document is the Accepted Manuscript version. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.In this paper, we consider the problem of cooperative communication between relays and base station in an advanced MIMO-OFDM framework, under the assumption that the relays are supplied by electric power drawn from energy harvesting (EH) sources. In particular, we focus on the relay selection, with the goal to guarantee the required performance in terms of capacity. In order to maximize the data throughput under the EH constraint, we model the transmission scheme as a non-transferable coalition formation game, with characteristic function based on an approximated capacity expression. Then, we introduce a powerful mathematical tool inherent to coalitional game theory, namely: the Shapley value (Sv) to provide a reliable solution concept to the game. The selected relays will form a virtual dynamically-configuredMIMO network that is able to transmit data to destination using efficient space-time coding techniques. Numerical results, obtained by simulating the EH-powered cooperativeMIMO-OFDMtransmission with Algebraic Space-Time Coding (ASTC), prove that the proposed coalitional game-based relay selection allows to achieve performance very close to that obtained by the same system operated by guaranteed power supply. The proposed methodology is finally compared with some recent related state-of-the-art techniques showing clear advantages in terms of link performance and goodput.Peer reviewe
Wireless Information and Energy Transfer for Two-Hop Non-Regenerative MIMO-OFDM Relay Networks
This paper investigates the simultaneous wireless information and energy
transfer for the non-regenerative multipleinput multiple-output orthogonal
frequency-division multiplexing (MIMO-OFDM) relaying system. By considering two
practical receiver architectures, we present two protocols, time switchingbased
relaying (TSR) and power splitting-based relaying (PSR). To explore the system
performance limit, we formulate two optimization problems to maximize the
end-to-end achievable information rate with the full channel state information
(CSI) assumption. Since both problems are non-convex and have no known solution
method, we firstly derive some explicit results by theoretical analysis and
then design effective algorithms for them. Numerical results show that the
performances of both protocols are greatly affected by the relay position.
Specifically, PSR and TSR show very different behaviors to the variation of
relay position. The achievable information rate of PSR monotonically decreases
when the relay moves from the source towards the destination, but for TSR, the
performance is relatively worse when the relay is placed in the middle of the
source and the destination. This is the first time to observe such a
phenomenon. In addition, it is also shown that PSR always outperforms TSR in
such a MIMO-OFDM relaying system. Moreover, the effect of the number of
antennas and the number of subcarriers are also discussed.Comment: 16 pages, 12 figures, to appear in IEEE Selected Areas in
Communication
Wireless Network-Level Partial Relay Cooperation: A Stable Throughput Analysis
In this work, we study the benefit of partial relay cooperation. We consider
a two-node system consisting of one source and one relay node transmitting
information to a common destination. The source and the relay have external
traffic and in addition, the relay is equipped with a flow controller to
regulate the incoming traffic from the source node. The cooperation is
performed at the network level. A collision channel with erasures is
considered. We provide an exact characterization of the stability region of the
system and we also prove that the system with partial cooperation is always
better or at least equal to the system without the flow controller.Comment: Submitted for journal publication. arXiv admin note: text overlap
with arXiv:1502.0113
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
- …