43 research outputs found
An Equivalence Between Secure Network and Index Coding
We extend the equivalence between network coding and index coding by Effros,
El Rouayheb, and Langberg to the secure communication setting in the presence
of an eavesdropper. Specifically, we show that the most general versions of
secure network-coding setup by Chan and Grant and the secure index-coding setup
by Dau, Skachek, and Chee, which also include the randomised encoding setting,
are equivalent
Full-Duplex Cooperative Cognitive Radio Networks with Wireless Energy Harvesting
This paper proposes and analyzes a new full-duplex (FD) cooperative cognitive
radio network with wireless energy harvesting (EH). We consider that the
secondary receiver is equipped with a FD radio and acts as a FD hybrid access
point (HAP), which aims to collect information from its associated EH secondary
transmitter (ST) and relay the signals. The ST is assumed to be equipped with
an EH unit and a rechargeable battery such that it can harvest and accumulate
energy from radio frequency (RF) signals transmitted by the primary transmitter
(PT) and the HAP. We develop a novel cooperative spectrum sharing (CSS)
protocol for the considered system. In the proposed protocol, thanks to its FD
capability, the HAP can receive the PT's signals and transmit energy-bearing
signals to charge the ST simultaneously, or forward the PT's signals and
receive the ST's signals at the same time. We derive analytical expressions for
the achievable throughput of both primary and secondary links by characterizing
the dynamic charging/discharging behaviors of the ST battery as a finite-state
Markov chain. We present numerical results to validate our theoretical analysis
and demonstrate the merits of the proposed protocol over its non-cooperative
counterpart.Comment: 6 pages, 3 figures, conferenc
Optimal Power Allocation by Imperfect Hardware Analysis in Untrusted Relaying Networks
By taking a variety of realistic hardware imperfections into consideration,
we propose an optimal power allocation (OPA) strategy to maximize the
instantaneous secrecy rate of a cooperative wireless network comprised of a
source, a destination and an untrusted amplify-and-forward (AF) relay. We
assume that either the source or the destination is equipped with a large-scale
multiple antennas (LSMA) system, while the rest are equipped with a single
antenna. To prevent the untrusted relay from intercepting the source message,
the destination sends an intended jamming noise to the relay, which is referred
to as destination-based cooperative jamming (DBCJ). Given this system model,
novel closed-form expressions are presented in the high signal-to-noise ratio
(SNR) regime for the ergodic secrecy rate (ESR) and the secrecy outage
probability (SOP). We further improve the secrecy performance of the system by
optimizing the associated hardware design. The results reveal that by
beneficially distributing the tolerable hardware imperfections across the
transmission and reception radio-frequency (RF) front ends of each node, the
system's secrecy rate may be improved. The engineering insight is that equally
sharing the total imperfections at the relay between the transmitter and the
receiver provides the best secrecy performance. Numerical results illustrate
that the proposed OPA together with the most appropriate hardware design
significantly increases the secrecy rate.Comment: 29 pages, 7 figures, Submitted to IEEE Transactions on Wireless
Communication