Results 21 to 30 of about 898 (161)

UAV-Enabled Secure Communication With Finite Blocklength [PDF]

open access: yesIEEE Transactions on Vehicular Technology, 2020
In the finite blocklength scenario, which is suitable for practical applications, a method of maximizing the average effective secrecy rate (AESR) is proposed for a UAV-enabled secure communication by optimizing the UAV's trajectory and transmit power subject to the UAV's mobility constraints and transmit power constraints.
Yuntian Wang   +6 more
openaire   +2 more sources

Finite-blocklength bounds for wiretap channels [PDF]

open access: yes2016 IEEE International Symposium on Information Theory (ISIT), 2016
This paper investigates the maximal secrecy rate over a wiretap channel subject to reliability and secrecy constraints at a given blocklength. New achievability and converse bounds are derived, which are shown to be tighter than existing bounds. The bounds also lead to the tightest second-order coding rate for discrete memoryless and Gaussian wiretap ...
Wei Yang 0001   +2 more
openaire   +2 more sources

On Finite Blocklength Lossy Source Coding

open access: yesCoRR, 2023
Submitted to FnT CIT.
Lin Zhou 0002, Mehul Motani
openaire   +2 more sources

Wireless Powered Communications With Finite Battery and Finite Blocklength [PDF]

open access: yesIEEE Transactions on Communications, 2018
32 pages, 9 main figures, Accepted for publication IEEE Trans ...
Onel L. Alcaraz López   +3 more
openaire   +3 more sources

Fairness-Aware Resource Allocation in Multi-Source WPCN in the Finite Blocklength Regime

open access: yesIEEE Access, 2023
In this work, we investigate a wireless powered communication network (WPCN) where multiple sources are jointly utilized for wireless power transfer (WPT).
Ning Guo   +3 more
doaj   +1 more source

Optimum Power Control at Finite Blocklength [PDF]

open access: yesIEEE Transactions on Information Theory, 2015
This paper investigates the maximal channel coding rate achievable at a given blocklength $n$ and error probability $ε$, when the codewords are subject to a long-term (i.e., averaged-over-all-codeword) power constraint. The second-order term in the large-$n$ expansion of the maximal channel coding rate is characterized both for additive white Gaussian ...
Wei Yang 0001   +3 more
openaire   +4 more sources

Secure short-packet communications using a full-duplex receiver

open access: yesInternational Journal of Intelligent Networks, 2023
In this work, we consider the physical layer security in short-packet communications, where a full-duplex (FD) receiver receives information signals from a source while generating artificial noise (AN) to confuse an eavesdropper.
Dechuan Chen   +4 more
doaj   +1 more source

Reinforcement Learning Based Adaptive Blocklength and MCS for Optimizing Age Violation Probability

open access: yesIEEE Access, 2023
As a measure of the freshness of data, Age of Information (AoI) has become an essential performance metric in status update applications with stringent timeliness constraints.
Aysenur Ozkaya   +2 more
doaj   +1 more source

Resource allocation and energy trading in the short blocklength regime for radio access networks

open access: yesIET Communications, Volume 17, Issue 18, Page 2119-2131, November 2023., 2023
For content delivery services in the future network, a Stackelberg game model between service providers, network operators, and users under the short transmission block scheme is proposed to improve network utility and service quality. Abstract With the large‐scale deployment of communication and computation units, the conventional radio access network
Yu Cao   +4 more
wiley   +1 more source

Statistical Power Grid Observability under Finite Blocklength

open access: yes, 2022
We study the stochastic observability of the power grid system under communication constraints in the finite blocklength regime. Compared to the study under the assumption of infinite blocklength, we introduce two new elements: probability of decoding ...
Sun, Hongjian   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy