Abstract
This paper considers a wireless interference network in which the communication between multiple transmitter-user pairs is overheard by multiple eavesdroppers (EVs). Based on knowledge of the channel distribution, the goal is to maximize the worst users' secrecy rate under both long (infinite) blocklength and short (finite) blocklength transmissions. Under long blocklength transmission, the performance of the existing algorithms is unsatisfactory when the wiretapped channels are sufficiently strong. To address this drawback, we adopt a time-fraction based information and artificial noise (AN) transmission, under which first the information is transmitted within the initial fraction of the time slot and then AN is transmitted within the remaining fraction. Accordingly, the problem of join optimization of the time fractions, transmit power, and AN power to maximize the minimum secrecy rate is proposed and computed by a path-following algorithm, which iterates feasible points and converges at least to a locally optimal solution. A similar problem under short blocklength transmission is also proposed and computed. The provided simulations results clearly show the merits of the proposed approach.
Original language | English (US) |
---|---|
Article number | 9348037 |
Journal | Proceedings - IEEE Global Communications Conference, GLOBECOM |
Volume | 2020-January |
DOIs | |
State | Published - Dec 2020 |
Externally published | Yes |
Event | 2020 IEEE Global Communications Conference, GLOBECOM 2020 - Virtual, Taipei, Taiwan, Province of China Duration: Dec 7 2020 → Dec 11 2020 |
All Science Journal Classification (ASJC) codes
- Artificial Intelligence
- Computer Networks and Communications
- Hardware and Architecture
- Signal Processing
Keywords
- URLLC
- interfering network
- outage probability
- path-following algorithms
- secure communication