92 research outputs found
Secure Short-Packet Communications via UAV-Enabled Mobile Relaying: Joint Resource Optimization and 3D Trajectory Design
Short-packet communication (SPC) and unmanned aerial vehicles (UAVs) are
anticipated to play crucial roles in the development of 5G-and-beyond wireless
networks and the Internet of Things (IoT). In this paper, we propose a secure
SPC system, where a UAV serves as a mobile decode-and-forward (DF) relay,
periodically receiving and relaying small data packets from a remote IoT device
to its receiver in two hops with strict latency requirements, in the presence
of an eavesdropper. This system requires careful optimization of important
design parameters, such as the coding blocklengths of both hops, transmit
powers, and UAV's trajectory. While the overall optimization problem is
nonconvex, we tackle it by applying a block successive convex approximation
(BSCA) approach to divide the original problem into three subproblems and solve
them separately. Then, an overall iterative algorithm is proposed to obtain the
final design with guaranteed convergence. Our proposed low-complexity algorithm
incorporates 3D trajectory design and resource management to optimize the
effective average secrecy throughput of the communication system over the
course of UAV-relay's mission. Simulation results demonstrate significant
performance improvements compared to various benchmark schemes and provide
useful design insights on the coding blocklengths and transmit powers along the
trajectory of the UAV
Semantically Secure Lattice Codes for Compound MIMO Channels
We consider compound multi-input multi-output (MIMO) wiretap channels where
minimal channel state information at the transmitter (CSIT) is assumed. Code
construction is given for the special case of isotropic mutual information,
which serves as a conservative strategy for general cases. Using the flatness
factor for MIMO channels, we propose lattice codes universally achieving the
secrecy capacity of compound MIMO wiretap channels up to a constant gap
(measured in nats) that is equal to the number of transmit antennas. The
proposed approach improves upon existing works on secrecy coding for MIMO
wiretap channels from an error probability perspective, and establishes
information theoretic security (in fact semantic security). We also give an
algebraic construction to reduce the code design complexity, as well as the
decoding complexity of the legitimate receiver. Thanks to the algebraic
structures of number fields and division algebras, our code construction for
compound MIMO wiretap channels can be reduced to that for Gaussian wiretap
channels, up to some additional gap to secrecy capacity.Comment: IEEE Trans. Information Theory, to appea
- …