The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Covert Communication Achieved by a Greedy Relay in Wireless Networks
Open accessAbstract
Covert wireless communication aims to hide the very existence of wireless transmissions in order to guarantee a strong security in wireless networks. In this paper, we examine the possibility and achievable performance of covert communication in amplify-and-forward one-way relay networks. Specifically, the relay is greedy and opportunistically transmits its own information to the destination covertly on top of forwarding the source's message, while the source tries to detect this covert transmission to discover the illegitimate usage of the resource (e.g., power and spectrum) allocated only for the purpose of forwarding the source's information. We propose two strategies for the relay to transmit its covert information, namely rate-control and power-control transmission schemes, for which the source's detection limits are analyzed in terms of detection error probability and the achievable effective covert rates from the relay to destination are derived. Our examination determines the conditions under which the rate-control transmission scheme outperforms the power-control transmission scheme, and vice versa, which enables the relay to achieve the maximum effective covert rate. Our analysis indicates that the relay has to forward the source's message to shield its covert transmission and the effective covert rate increases with its forwarding ability (e.g., its maximum transmits power).
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
Mukherjee, A. (2015) · Proceedings of the IEEE · doi:10.1109/jproc.2015.2466548 · Cited by 347
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
Achieving Covert Wireless Communications Using a Full-Duplex Receiver
Shahzad, K., Zhou, X., Yan, S., Hu, J., Shu, F., & Li, J. (2018) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2018.2878014 · Cited by 291
Self-citationDelay-Intolerant Covert Communications With Either Fixed or Random Transmit Power
Yan, S., He, B., Zhou, X., Cong, Y., & Swindlehurst, A. L. (2019) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2018.2846257 · Cited by 261
Self-citationLv, L., Wu, Q., Li, Z., Ding, Z., Al-Dhahir, N., & Chen, J. (2022) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2021.3106346 · Cited by 257
Metadata
- Authors
- Hu, J., Yan, S., Zhou, X., Shu, F., Li, J., & Wang, J.
- Venue
- IEEE Transactions on Wireless Communications
- Published
- 2018-07
- Volume
- 17
- Issue
- 7
- Pages
- 4766-4779
- ISSN
- 1536-1276 (ISSN-L)
- 1558-2248
- OpenAlex
- W2964286662
- Cited by
- 220
- References
- 2
- FWCI
- 8.47
- Type
- journal article
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Covert Communication Achieved by a Greedy Relay in Wireless Networks. https://app.cochat.ai/papers/10.1109/twc.2018.2831217
- The paper
- Hu, J., Yan, S., Zhou, X., Shu, F., Li, J., & Wang, J. (2018). Covert Communication Achieved by a Greedy Relay in Wireless Networks. IEEE Transactions on Wireless Communications. https://doi.org/10.1109/twc.2018.2831217
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.