1,039 research outputs found
Secure Full-Duplex Device-to-Device Communication
This paper considers full-duplex (FD) device-to-device (D2D) communications
in a downlink MISO cellular system in the presence of multiple eavesdroppers.
The D2D pair communicate sharing the same frequency band allocated to the
cellular users (CUs). Since the D2D users share the same frequency as the CUs,
both the base station (BS) and D2D transmissions interfere each other. In
addition, due to limited processing capability, D2D users are susceptible to
external attacks. Our aim is to design optimal beamforming and power control
mechanism to guarantee secure communication while delivering the required
quality-of-service (QoS) for the D2D link. In order to improve security,
artificial noise (AN) is transmitted by the BS. We design robust beamforming
for secure message as well as the AN in the worst-case sense for minimizing
total transmit power with imperfect channel state information (CSI) of all
links available at the BS. The problem is strictly non-convex with infinitely
many constraints. By discovering the hidden convexity of the problem, we derive
a rank-one optimal solution for the power minimization problem.Comment: Accepted in IEEE GLOBECOM 2017, Singapore, 4-8 Dec. 201
Secure Full-Duplex Device-to-Device Communication
This paper considers full-duplex (FD) device-to-device (D2D) communications
in a downlink MISO cellular system in the presence of multiple eavesdroppers.
The D2D pair communicate sharing the same frequency band allocated to the
cellular users (CUs). Since the D2D users share the same frequency as the CUs,
both the base station (BS) and D2D transmissions interfere each other. In
addition, due to limited processing capability, D2D users are susceptible to
external attacks. Our aim is to design optimal beamforming and power control
mechanism to guarantee secure communication while delivering the required
quality-of-service (QoS) for the D2D link. In order to improve security,
artificial noise (AN) is transmitted by the BS. We design robust beamforming
for secure message as well as the AN in the worst-case sense for minimizing
total transmit power with imperfect channel state information (CSI) of all
links available at the BS. The problem is strictly non-convex with infinitely
many constraints. By discovering the hidden convexity of the problem, we derive
a rank-one optimal solution for the power minimization problem.Comment: Accepted in IEEE GLOBECOM 2017, Singapore, 4-8 Dec. 201
Secure Communications for the Two-user Broadcast Channel with Random Traffic
In this work, we study the stability region of the two-user broadcast channel
(BC) with bursty data arrivals and security constraints. We consider the
scenario, where one of the receivers has a secrecy constraint and its packets
need to be kept secret from the other receiver. This is achieved by employing
full-duplexing at the receiver with the secrecy constraint, so that it
transmits a jamming signal to impede the reception of the other receiver. In
this context, the stability region of the two-user BC is characterized for the
general decoding case. Then, assuming two different decoding schemes the
respective stability regions are derived. The effect of self-interference due
to the full-duplex operation on the stability region is also investigated. The
stability region of the BC with a secrecy constraint, where the receivers do
not have full duplex capability can be obtained as a special case of the
results derived in this paper. In addition, the paper considers the problem of
maximizing the saturated throughput of the queue, whose packets does not
require to be kept secret under minimum service guarantees for the other queue.
The results provide new insights on the effect of the secrecy constraint on the
stability region of the BC. In particular, it is shown that the stability
region with secrecy constraint is sensitive to the coefficient of
self-interference cancelation under certain cases.Comment: Submitted for journal publicatio
- …