The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Covert Communication With the Help of Relay and Channel Uncertainty
Abstract
Covert communication aims to hide the existence of the transmissions to guarantee the security in wireless communications. In this letter, channel uncertainty is exploited to achieve covert communication in relay networks. The transmitter Alice sends messages to the legitimate receiver Bob with the help of a relay, while the warden Willie wants to detect the existence of the transmission. The channel uncertainty introduces confusions to degrade the performance of Willie's detection. We show that Alice can transmit ${O}$ (${n}$ ) bits in ${n}$ channel uses covertly with the help of relay and channel uncertainty. Numerical results are shown to illustrate the achievability and the performance of the considered scenario.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Limits of Reliable Communication with Low Probability of Detection on AWGN Channels
Bash, B. A., Goeckel, D., & Towsley, D. (2013) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2013.130923 · Cited by 1,075
Cited by
Covert Communications: A Comprehensive Survey
Chen, X., An, J., Xiong, Z., Xing, C., Zhao, N., Yu, F. R., & Nallanathan, A. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3263921 · Cited by 371
Metadata
- Authors
- Wang, J., Tang, W., Zhu, Q., Li, X., Rao, H., & Li, S.
- Venue
- IEEE Wireless Communications Letters
- Published
- 2019-02
- Volume
- 8
- Issue
- 1
- Pages
- 317-320
- ISSN
- 2162-2337 (ISSN-L)
- 2162-2345
- OpenAlex
- W2893082680
- Cited by
- 182
- References
- 1
- FWCI
- 5.46
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.