Average Age of Information Minimization in Reliable Covert Communication on Time-Varying Channels

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 communicati...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2022-05
Hauptverfasser: Shima Salar Hosseini, Azmi, Paeiz, Mokari, Nader
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Shima Salar Hosseini
Azmi, Paeiz
Mokari, Nader
description 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 Article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2659401420</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2659401420</sourcerecordid><originalsourceid>FETCH-proquest_journals_26594014203</originalsourceid><addsrcrecordid>eNqNi0EKwjAURIMgWLR3CLgupElbdVmKogs3Im5LlLT-kvxo0gp6egP1AMIMwzBvJiTiQqTJOuN8RmLvO8YYL1Y8z0VEZPlSTraKlsG2oQdsrDOyB4v0CAgGPmMBpCelQV61opUNpz6EMQPCbQSCzmBUcpHuDdjS6i4RlfYLMm2k9ir-5Zwsd9tztU8ezj4H5fu6s4PDMNW8yDcZSzPOxH_UFxNhRQg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2659401420</pqid></control><display><type>article</type><title>Average Age of Information Minimization in Reliable Covert Communication on Time-Varying Channels</title><source>Free E- Journals</source><creator>Shima Salar Hosseini ; Azmi, Paeiz ; Mokari, Nader</creator><creatorcontrib>Shima Salar Hosseini ; Azmi, Paeiz ; Mokari, Nader</creatorcontrib><description>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.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Age ; Channels ; Communication ; Freshness ; Optimization</subject><ispartof>arXiv.org, 2022-05</ispartof><rights>2022. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>780,784</link.rule.ids></links><search><creatorcontrib>Shima Salar Hosseini</creatorcontrib><creatorcontrib>Azmi, Paeiz</creatorcontrib><creatorcontrib>Mokari, Nader</creatorcontrib><title>Average Age of Information Minimization in Reliable Covert Communication on Time-Varying Channels</title><title>arXiv.org</title><description>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.</description><subject>Age</subject><subject>Channels</subject><subject>Communication</subject><subject>Freshness</subject><subject>Optimization</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNqNi0EKwjAURIMgWLR3CLgupElbdVmKogs3Im5LlLT-kvxo0gp6egP1AMIMwzBvJiTiQqTJOuN8RmLvO8YYL1Y8z0VEZPlSTraKlsG2oQdsrDOyB4v0CAgGPmMBpCelQV61opUNpz6EMQPCbQSCzmBUcpHuDdjS6i4RlfYLMm2k9ir-5Zwsd9tztU8ezj4H5fu6s4PDMNW8yDcZSzPOxH_UFxNhRQg</recordid><startdate>20220503</startdate><enddate>20220503</enddate><creator>Shima Salar Hosseini</creator><creator>Azmi, Paeiz</creator><creator>Mokari, Nader</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20220503</creationdate><title>Average Age of Information Minimization in Reliable Covert Communication on Time-Varying Channels</title><author>Shima Salar Hosseini ; Azmi, Paeiz ; Mokari, Nader</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_26594014203</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Age</topic><topic>Channels</topic><topic>Communication</topic><topic>Freshness</topic><topic>Optimization</topic><toplevel>online_resources</toplevel><creatorcontrib>Shima Salar Hosseini</creatorcontrib><creatorcontrib>Azmi, Paeiz</creatorcontrib><creatorcontrib>Mokari, Nader</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Shima Salar Hosseini</au><au>Azmi, Paeiz</au><au>Mokari, Nader</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Average Age of Information Minimization in Reliable Covert Communication on Time-Varying Channels</atitle><jtitle>arXiv.org</jtitle><date>2022-05-03</date><risdate>2022</risdate><eissn>2331-8422</eissn><abstract>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.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2022-05
issn 2331-8422
language eng
recordid cdi_proquest_journals_2659401420
source Free E- Journals
subjects Age
Channels
Communication
Freshness
Optimization
title Average Age of Information Minimization in Reliable Covert Communication on Time-Varying Channels
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T04%3A34%3A18IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Average%20Age%20of%20Information%20Minimization%20in%20Reliable%20Covert%20Communication%20on%20Time-Varying%20Channels&rft.jtitle=arXiv.org&rft.au=Shima%20Salar%20Hosseini&rft.date=2022-05-03&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2659401420%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2659401420&rft_id=info:pmid/&rfr_iscdi=true