The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Cooperative Jamming for Secure Communications in MIMO Relay Networks
Open accessAbstract
Secure communications can be impeded by eavesdroppers in conventional relay systems. This paper proposes cooperative jamming strategies for two-hop relay networks where the eavesdropper can wiretap the relay channels in both hops. In these approaches, the normally inactive nodes in the relay network can be used as cooperative jamming sources to confuse the eavesdropper. Linear precoding schemes are investigated for two scenarios where single or multiple data streams are transmitted via a decode-and-forward (DF) relay, under the assumption that global channel state information (CSI) is available. For the case of single data stream transmission, we derive closed-form jamming beamformers and the corresponding optimal power allocation. Generalized singular value decomposition (GSVD)-based secure relaying schemes are proposed for the transmission of multiple data streams. The optimal power allocation is found for the GSVD relaying scheme via geometric programming. Based on this result, a GSVD-based cooperative jamming scheme is proposed that shows significant improvement in terms of secrecy rate compared to the approach without jamming. Furthermore, the case involving an eavesdropper with unknown CSI is also investigated in this paper. Simulation results show that the secrecy rate is dramatically increased when inactive nodes in the relay network participate in cooperative jamming.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Cooperative Diversity in Wireless Networks: Efficient Protocols and Outage Behavior
Laneman, J. N., Tse, D. N. C., & Wornell, G. W. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.838089 · Cited by 12,193
Wyner, A. D. (1975) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1975.tb02040.x · Cited by 7,075
Inequalities: Theory of Majorization and its Applications.
Arnold, B. C., Marshall, A. W., & Olkin, I. (1981) · Journal of the American Statistical Association · doi:10.2307/2287859 · Cited by 4,870
Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks
Laneman, J. N., & Wornell, G. W. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.817829 · Cited by 4,002
Broadcast channels with confidential messages
Csiszar, I., & Korner, J. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055892 · Cited by 3,332
Inequalities - Theory of Majorization and Its Applications
(1979) · Mathematics in Science and Engineering · doi:10.1016/c2009-0-22048-4 · Cited by 2,870
Guaranteeing Secrecy using Artificial Noise
Goel, S., & Negi, R. (2008) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2008.060848 · Cited by 1,917
Wireless Information-Theoretic Security
Bloch, M., Barros, J., Rodrigues, M. R. D., & McLaughlin, S. W. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.921908 · Cited by 1,847
Cited by
Optimal Relay Selection for Physical-Layer Security in Cooperative Wireless Networks
Zou, Y., Wang, X., & Shen, W. (2013) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2013.131011 · Cited by 513
A Survey on Multiple-Antenna Techniques for Physical Layer Security
Chen, X., Ng, D. W. K., Gerstacker, W. H., & Chen, H.-H. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2633387 · Cited by 474
Metadata
- Authors
- Huang, J., & Swindlehurst, A. L.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2011-10
- Volume
- 59
- Issue
- 10
- Pages
- 4871-4884
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2124071994
- Cited by
- 347
- References
- 26
- FWCI
- 21.84
- 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: Cooperative Jamming for Secure Communications in MIMO Relay Networks. https://app.cochat.ai/papers/10.1109/tsp.2011.2161295
- The paper
- Huang, J., & Swindlehurst, A. L. (2011). Cooperative Jamming for Secure Communications in MIMO Relay Networks. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2011.2161295
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.