Age of Information for Short-Packet Covert Communication
In this letter, we develop a new framework to jointly characterize covertness and timeliness of short-packet communications, in which a new metric named covert age of information (CAoI) is first proposed and then a closed-form expression for the average CAoI is derived. Our examination explicitly re...
Gespeichert in:
Veröffentlicht in: | IEEE wireless communications letters 2021-09, Vol.10 (9), p.1890-1894 |
---|---|
Hauptverfasser: | , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 1894 |
---|---|
container_issue | 9 |
container_start_page | 1890 |
container_title | IEEE wireless communications letters |
container_volume | 10 |
creator | Yang, Weiwei Lu, Xingbo Yan, Shihao Shu, Feng Li, Zan |
description | In this letter, we develop a new framework to jointly characterize covertness and timeliness of short-packet communications, in which a new metric named covert age of information (CAoI) is first proposed and then a closed-form expression for the average CAoI is derived. Our examination explicitly reveals the tradeoff between communication covertness and timeliness affected by the block-length, transmit power and prior transmission probability. Multiple transmission designs are tackled in order to minimize the average CAoI subject to covertness constraint, where the resultant differences relative to the designs with traditional metrics (e.g., effective covert rate, AoI) as objective functions are clarified. Our examination demonstrates that the optimal block-length is not the largest one, which is optimal in delay-constrained covert communication without considering the communication timeliness, and the optimal prior transmission probability may not be 1/2, which has been widely assumed in the literature of covert communications. |
doi_str_mv | 10.1109/LWC.2021.3085025 |
format | Article |
fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_LWC_2021_3085025</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>9444350</ieee_id><sourcerecordid>2570193385</sourcerecordid><originalsourceid>FETCH-LOGICAL-c291t-7a06161f427a763872b0df4b8cfd198d78c593f3ad44e0336787c4bb4038a79e3</originalsourceid><addsrcrecordid>eNo9kE1LAzEQhoMoWGrvgpcFz1snmWSTHMviR6GgoOIxZLOJbnU3NbsV_Pdubelc3jk87ww8hFxSmFMK-mb1Vs4ZMDpHUAKYOCETRguWM-Ti9LijPCezvl_DOAVQRtWEqMW7z2LIll2IqbVDE7ts3LLnj5iG_Mm6Tz9kZfzxaRdtu-0a909dkLNgv3o_O-SUvN7dvpQP-erxflkuVrljmg65tFDQggbOpJUFKskqqAOvlAs11aqWygmNAW3NuQfEQirpeFVxQGWl9jgl1_u7mxS_t74fzDpuUze-NExIoBpRiZGCPeVS7Pvkg9mkprXp11AwO0VmVGR2isxB0Vi52lca7_0R15xzFIB_C8Ffng</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2570193385</pqid></control><display><type>article</type><title>Age of Information for Short-Packet Covert Communication</title><source>IEL</source><creator>Yang, Weiwei ; Lu, Xingbo ; Yan, Shihao ; Shu, Feng ; Li, Zan</creator><creatorcontrib>Yang, Weiwei ; Lu, Xingbo ; Yan, Shihao ; Shu, Feng ; Li, Zan</creatorcontrib><description>In this letter, we develop a new framework to jointly characterize covertness and timeliness of short-packet communications, in which a new metric named covert age of information (CAoI) is first proposed and then a closed-form expression for the average CAoI is derived. Our examination explicitly reveals the tradeoff between communication covertness and timeliness affected by the block-length, transmit power and prior transmission probability. Multiple transmission designs are tackled in order to minimize the average CAoI subject to covertness constraint, where the resultant differences relative to the designs with traditional metrics (e.g., effective covert rate, AoI) as objective functions are clarified. Our examination demonstrates that the optimal block-length is not the largest one, which is optimal in delay-constrained covert communication without considering the communication timeliness, and the optimal prior transmission probability may not be 1/2, which has been widely assumed in the literature of covert communications.</description><identifier>ISSN: 2162-2337</identifier><identifier>EISSN: 2162-2345</identifier><identifier>DOI: 10.1109/LWC.2021.3085025</identifier><identifier>CODEN: IWCLAF</identifier><language>eng</language><publisher>Piscataway: IEEE</publisher><subject>age of information ; Closed-form solutions ; Communication ; Constraints ; Covert communication ; finite block-length ; Information age ; Linear programming ; Measurement ; short-packet communication ; timeliness</subject><ispartof>IEEE wireless communications letters, 2021-09, Vol.10 (9), p.1890-1894</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2021</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c291t-7a06161f427a763872b0df4b8cfd198d78c593f3ad44e0336787c4bb4038a79e3</citedby><cites>FETCH-LOGICAL-c291t-7a06161f427a763872b0df4b8cfd198d78c593f3ad44e0336787c4bb4038a79e3</cites><orcidid>0000-0003-0073-1965 ; 0000-0002-5207-6504 ; 0000-0002-4586-1926 ; 0000-0002-0220-4088 ; 0000-0003-2699-9943</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/9444350$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/9444350$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Yang, Weiwei</creatorcontrib><creatorcontrib>Lu, Xingbo</creatorcontrib><creatorcontrib>Yan, Shihao</creatorcontrib><creatorcontrib>Shu, Feng</creatorcontrib><creatorcontrib>Li, Zan</creatorcontrib><title>Age of Information for Short-Packet Covert Communication</title><title>IEEE wireless communications letters</title><addtitle>LWC</addtitle><description>In this letter, we develop a new framework to jointly characterize covertness and timeliness of short-packet communications, in which a new metric named covert age of information (CAoI) is first proposed and then a closed-form expression for the average CAoI is derived. Our examination explicitly reveals the tradeoff between communication covertness and timeliness affected by the block-length, transmit power and prior transmission probability. Multiple transmission designs are tackled in order to minimize the average CAoI subject to covertness constraint, where the resultant differences relative to the designs with traditional metrics (e.g., effective covert rate, AoI) as objective functions are clarified. Our examination demonstrates that the optimal block-length is not the largest one, which is optimal in delay-constrained covert communication without considering the communication timeliness, and the optimal prior transmission probability may not be 1/2, which has been widely assumed in the literature of covert communications.</description><subject>age of information</subject><subject>Closed-form solutions</subject><subject>Communication</subject><subject>Constraints</subject><subject>Covert communication</subject><subject>finite block-length</subject><subject>Information age</subject><subject>Linear programming</subject><subject>Measurement</subject><subject>short-packet communication</subject><subject>timeliness</subject><issn>2162-2337</issn><issn>2162-2345</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kE1LAzEQhoMoWGrvgpcFz1snmWSTHMviR6GgoOIxZLOJbnU3NbsV_Pdubelc3jk87ww8hFxSmFMK-mb1Vs4ZMDpHUAKYOCETRguWM-Ti9LijPCezvl_DOAVQRtWEqMW7z2LIll2IqbVDE7ts3LLnj5iG_Mm6Tz9kZfzxaRdtu-0a909dkLNgv3o_O-SUvN7dvpQP-erxflkuVrljmg65tFDQggbOpJUFKskqqAOvlAs11aqWygmNAW3NuQfEQirpeFVxQGWl9jgl1_u7mxS_t74fzDpuUze-NExIoBpRiZGCPeVS7Pvkg9mkprXp11AwO0VmVGR2isxB0Vi52lca7_0R15xzFIB_C8Ffng</recordid><startdate>20210901</startdate><enddate>20210901</enddate><creator>Yang, Weiwei</creator><creator>Lu, Xingbo</creator><creator>Yan, Shihao</creator><creator>Shu, Feng</creator><creator>Li, Zan</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>L7M</scope><orcidid>https://orcid.org/0000-0003-0073-1965</orcidid><orcidid>https://orcid.org/0000-0002-5207-6504</orcidid><orcidid>https://orcid.org/0000-0002-4586-1926</orcidid><orcidid>https://orcid.org/0000-0002-0220-4088</orcidid><orcidid>https://orcid.org/0000-0003-2699-9943</orcidid></search><sort><creationdate>20210901</creationdate><title>Age of Information for Short-Packet Covert Communication</title><author>Yang, Weiwei ; Lu, Xingbo ; Yan, Shihao ; Shu, Feng ; Li, Zan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c291t-7a06161f427a763872b0df4b8cfd198d78c593f3ad44e0336787c4bb4038a79e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>age of information</topic><topic>Closed-form solutions</topic><topic>Communication</topic><topic>Constraints</topic><topic>Covert communication</topic><topic>finite block-length</topic><topic>Information age</topic><topic>Linear programming</topic><topic>Measurement</topic><topic>short-packet communication</topic><topic>timeliness</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Yang, Weiwei</creatorcontrib><creatorcontrib>Lu, Xingbo</creatorcontrib><creatorcontrib>Yan, Shihao</creatorcontrib><creatorcontrib>Shu, Feng</creatorcontrib><creatorcontrib>Li, Zan</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998–Present</collection><collection>IEL</collection><collection>CrossRef</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>IEEE wireless communications letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Yang, Weiwei</au><au>Lu, Xingbo</au><au>Yan, Shihao</au><au>Shu, Feng</au><au>Li, Zan</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Age of Information for Short-Packet Covert Communication</atitle><jtitle>IEEE wireless communications letters</jtitle><stitle>LWC</stitle><date>2021-09-01</date><risdate>2021</risdate><volume>10</volume><issue>9</issue><spage>1890</spage><epage>1894</epage><pages>1890-1894</pages><issn>2162-2337</issn><eissn>2162-2345</eissn><coden>IWCLAF</coden><abstract>In this letter, we develop a new framework to jointly characterize covertness and timeliness of short-packet communications, in which a new metric named covert age of information (CAoI) is first proposed and then a closed-form expression for the average CAoI is derived. Our examination explicitly reveals the tradeoff between communication covertness and timeliness affected by the block-length, transmit power and prior transmission probability. Multiple transmission designs are tackled in order to minimize the average CAoI subject to covertness constraint, where the resultant differences relative to the designs with traditional metrics (e.g., effective covert rate, AoI) as objective functions are clarified. Our examination demonstrates that the optimal block-length is not the largest one, which is optimal in delay-constrained covert communication without considering the communication timeliness, and the optimal prior transmission probability may not be 1/2, which has been widely assumed in the literature of covert communications.</abstract><cop>Piscataway</cop><pub>IEEE</pub><doi>10.1109/LWC.2021.3085025</doi><tpages>5</tpages><orcidid>https://orcid.org/0000-0003-0073-1965</orcidid><orcidid>https://orcid.org/0000-0002-5207-6504</orcidid><orcidid>https://orcid.org/0000-0002-4586-1926</orcidid><orcidid>https://orcid.org/0000-0002-0220-4088</orcidid><orcidid>https://orcid.org/0000-0003-2699-9943</orcidid></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 2162-2337 |
ispartof | IEEE wireless communications letters, 2021-09, Vol.10 (9), p.1890-1894 |
issn | 2162-2337 2162-2345 |
language | eng |
recordid | cdi_crossref_primary_10_1109_LWC_2021_3085025 |
source | IEL |
subjects | age of information Closed-form solutions Communication Constraints Covert communication finite block-length Information age Linear programming Measurement short-packet communication timeliness |
title | Age of Information for Short-Packet Covert Communication |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-01T08%3A16%3A20IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Age%20of%20Information%20for%20Short-Packet%20Covert%20Communication&rft.jtitle=IEEE%20wireless%20communications%20letters&rft.au=Yang,%20Weiwei&rft.date=2021-09-01&rft.volume=10&rft.issue=9&rft.spage=1890&rft.epage=1894&rft.pages=1890-1894&rft.issn=2162-2337&rft.eissn=2162-2345&rft.coden=IWCLAF&rft_id=info:doi/10.1109/LWC.2021.3085025&rft_dat=%3Cproquest_RIE%3E2570193385%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2570193385&rft_id=info:pmid/&rft_ieee_id=9444350&rfr_iscdi=true |