Average Age of Information Minimization in Reliable Covert Communication on Time-Varying Channels
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2022
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866912490919559168 |
|---|---|
| author | Hosseini, Shima Salar Azmi, Paeiz Mokari, Nader |
| author_facet | Hosseini, Shima Salar Azmi, Paeiz Mokari, Nader |
| contents | In this letter, we propose reliable covert communications with the aim of minimizing age of information (AoI) in the time-varying channels. We named the time duration that channel state information (CSI) is valid as a new metric, as age of channel variation (AoC). To find reliable covert communication in a fresh manner in dynamic environments, this work considers a new constraint that shows a relation between AoI and AoC. With the aid of the proposed constraint, this paper addresses two main challenges of reliable covert communication with the aim of minimizing AoI: 1) users packets with desirable size; 2) guaranteeing the negligible probability of Willies detection, in time-varying networks. In the simulation results, we compare the performance of the proposed constraint in reliable covert communication with the aim of minimizing AoI with conventional optimization of the requirement of information freshness in covert communications. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2205_01533 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Average Age of Information Minimization in Reliable Covert Communication on Time-Varying Channels Hosseini, Shima Salar Azmi, Paeiz Mokari, Nader Information Theory Cryptography and Security Systems and Control In this letter, we propose reliable covert communications with the aim of minimizing age of information (AoI) in the time-varying channels. We named the time duration that channel state information (CSI) is valid as a new metric, as age of channel variation (AoC). To find reliable covert communication in a fresh manner in dynamic environments, this work considers a new constraint that shows a relation between AoI and AoC. With the aid of the proposed constraint, this paper addresses two main challenges of reliable covert communication with the aim of minimizing AoI: 1) users packets with desirable size; 2) guaranteeing the negligible probability of Willies detection, in time-varying networks. In the simulation results, we compare the performance of the proposed constraint in reliable covert communication with the aim of minimizing AoI with conventional optimization of the requirement of information freshness in covert communications. |
| title | Average Age of Information Minimization in Reliable Covert Communication on Time-Varying Channels |
| topic | Information Theory Cryptography and Security Systems and Control |
| url | https://arxiv.org/abs/2205.01533 |