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.
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
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
Improving Wireless Physical Layer Security via Cooperating Relays
Dong, L., Han, Z., Petropulu, A. P., & Poor, H. V. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2038412 · Cited by 1,366
Secure Transmission With Multiple Antennas I: The MISOME Wiretap Channel
Khisti, A., & Wornell, G. W. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2048445 · Cited by 1,350
A tutorial on geometric programming
Boyd, S., Kim, S.-J., Vandenberghe, L., & Hassibi, A. (2007) · Optimization and Engineering · doi:10.1007/s11081-007-9001-7 · Cited by 1,195
On the Achievable Diversity–Multiplexing Tradeoff in Half-Duplex Cooperative Channels
Azarian, K., ElGamal, H., & Schniter, P. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.858920 · Cited by 1,117
Secure Transmission With Multiple Antennas—Part II: The MIMOME Wiretap Channel
Khisti, A., & Wornell, G. W. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2068852 · Cited by 975
Power Control By Geometric Programming
Chiang, M., Tan, C. W., Palomar, D. P., O'neill, D., & Julian, D. (2007) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2007.05960 · Cited by 886
Tekin, E., & Yener, A. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.921680 · Cited by 841
The Relay–Eavesdropper Channel: Cooperation for Secrecy
Lai, L., & El Gamal, H. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.928272 · Cited by 774
A Note on the Secrecy Capacity of the Multiple-Antenna Wiretap Channel
Liu, T., & Shamai, S. S. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2018322 · Cited by 489
Robust Beamforming for Security in MIMO Wiretap Channels With Imperfect CSI
Mukherjee, A., & Swindlehurst, A. L. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2078810 · Cited by 454
Self-citationThe secrecy capacity of the MIMO wiretap channel
Oggier, F., & Hassibi, B. (2008) · 2008 IEEE International Symposium on Information Theory · doi:10.1109/isit.2008.4595041 · Cited by 310
Secrecy capacity of SIMO and slow fading channels
Parada, P., & Blahut, R. (2005) · Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. · doi:10.1109/isit.2005.1523727 · Cited by 277
On Ergodic Secrecy Rate for Gaussian MISO Wiretap Channels
Li, J., & Petropulu, A. P. (2011) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2011.011811.100356 · Cited by 141
Two-Hop Secure Communication Using an Untrusted Relay
He, X., & Yener, A. (2009) · EURASIP Journal on Wireless Communications and Networking · doi:10.1155/2009/305146 · Cited by 88
Capacity Theorems for Relay Channels with Confidential Messages
Oohama, Y. (2007) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2007.4557113 · Cited by 86
Mobile Flexible Networks: The challenges ahead
Debbah, M. A. (2008) · International Conference on Advanced Technologies for Communications · doi:10.1109/atc.2008.4760505 · Cited by 43
Cited by
Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey
Mukherjee, A., Fakoorian, S. A. A., Huang, J., & Swindlehurst, A. L. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2014.012314.00178 · Cited by 1,483
Self-citationOptimal 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
Improving Physical Layer Secrecy Using Full-Duplex Jamming Receivers
Zheng, G., Krikidis, I., Li, J., Petropulu, A. P., & Ottersten, B. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2269049 · Cited by 384
A Comprehensive Survey on Cooperative Relaying and Jamming Strategies for Physical Layer Security
Jameel, F., Wyne, S., Kaddoum, G., & Duong, T. Q. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2865607 · Cited by 271
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
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.