The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Improving Wireless Physical Layer Security via Cooperating Relays
Abstract
Physical (PHY) layer security approaches for wireless communications can prevent eavesdropping without upper layer data encryption. However, they are hampered by wireless channel conditions: absent feedback, they are typically feasible only when the source-destination channel is better than the source-eavesdropper channel. Node cooperation is a means to overcome this challenge and improve the performance of secure wireless communications. This paper addresses secure communications of one source-destination pair with the help of multiple cooperating relays in the presence of one or more eavesdroppers. Three cooperative schemes are considered: decode-and-forward (DF), amplify-and-forward (AF), and cooperative jamming (CJ). For these schemes, the relays transmit a weighted version of a reencoded noise-free message signal (for DF), a received noisy source signal (for AF), or a common jamming signal (for CJ). Novel system designs are proposed, consisting of the determination of relay weights and the allocation of transmit power, that maximize the achievable secrecy rate subject to a transmit power constraint, or, minimize the transmit power subject to a secrecy rate constraint. For DF in the presence of one eavesdropper, closed-form optimal solutions are derived for the relay weights. For other problems, since the optimal relay weights are difficult to obtain, several criteria are considered leading to suboptimal but simple solutions, i.e., the complete nulling of the message signals at all eavesdroppers (for DF and AF), or the complete nulling of jamming signal at the destination (for CJ). Based on the designed relay weights, for DF in the presence of multiple eavesdroppers, and for CJ in the presence of one eavesdropper, the optimal power allocation is obtained in closed-form; in all other cases the optimal power allocation is obtained via iterative algorithms. Numerical evaluation of the obtained secrecy rate and transmit power results show that the proposed design can significantly improve the performance of secure wireless communications.
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
Fundamentals of Wireless Communication
Tse, D., & Viswanath, P. (2005) · doi:10.1017/cbo9780511807213 · Cited by 13,162
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
User cooperation diversity-part I: system description
Sendonaris, A., Erkip, E., & Aazhang, B. (2003) · IEEE Transactions on Communications · doi:10.1109/tcomm.2003.818096 · Cited by 6,285
Golub, G. H., & Loan, C. F. V. (1996) · Johns Hopkins University Press eBooks · Cited by 6,027
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
Zero-Forcing Methods for Downlink Spatial Multiplexing in Multiuser MIMO Channels
Spencer, Q. H., Swindlehurst, A. L., & Haardt, M. (2004) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2003.821107 · Cited by 3,148
Godara, L. C. (1997) · Proceedings of the IEEE · doi:10.1109/5.622504 · Cited by 2,073
Leung-Yan-Cheong, S., & Hellman, M. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055917 · Cited by 2,004
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
Minimization by Random Search Techniques
Solis, F. J., & Wets, R. J.-B. (1981) · Mathematics of Operations Research · doi:10.1287/moor.6.1.19 · Cited by 1,671
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
On the Secrecy Capacity of Fading Channels
Gopala, P. K., Lai, L., & El Gamal, H. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.928990 · Cited by 1,261
The Secrecy Capacity of the MIMO Wiretap Channel
Oggier, F., & Hassibi, B. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2158487 · Cited by 887
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
Information Theoretic Security
Liang, Y., Poor, H. V., & Shamai (Shitz), S. (2007) · now publishers, Inc. eBooks · doi:10.1561/9781601982414 · Cited by 686
Self-citationA 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
Havary-Nassab, V., Shahbazpanahi, S., Grami, A., & Luo, Z.-Q. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2008.925945 · Cited by 440
The 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
Resource Allocation for Wireless Networks: Basics, Techniques, and Applications
Han, Z., & Liu, K. J. R. (2008) · Cambridge University Press eBooks · doi:10.1017/cbo9780511619748 · Cited by 295
Self-citationSecure space-time communication
Hero, A. O. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.820010 · Cited by 294
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
Cooperative jamming for wireless physical layer security
Dong, L., Han, Z., Petropulu, A. P., & Poor, H. V. (2009) · IEEE Statistical Signal Processing Workshop (SSP) · doi:10.1109/ssp.2009.5278549 · Cited by 128
Self-citationCapacity 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
Relay Channels with Confidential MessagesPreprint
Oohama, Y. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0611125 · Cited by 63
A secure communication game with a relay helping the eavesdropper
Yüksel, M., Liu, X., & Erkip, E. (2009) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2009.5351368 · Cited by 13
Cited by
Cooperative spectrum sensing in cognitive radio networks: A survey
Akyildiz, I. F., Lo, B. F., & Balakrishnan, R. (2011) · Physical Communication · doi:10.1016/j.phycom.2010.12.003 · Cited by 1,829
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
Secure integration of IoT and Cloud Computing
Stergiou, C., Psannis, K. E., Kim, B.-G., & Gupta, B. (2018) · Future Generation Computer Systems · doi:10.1016/j.future.2016.11.031 · Cited by 1,094
Simultaneous Wireless Information and Power Transfer (SWIPT): Recent Advances and Future Challenges
Ponnimbaduge Perera, T. D., Jayakody, D. N. K., Sharma, S. K., Chatzinotas, S., & Li, J. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2783901 · Cited by 920
Robust and Secure Wireless Communications via Intelligent Reflecting Surfaces
Yu, X., Xu, D., Sun, Y., Ng, D. W. K., & Schober, R. (2020) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2020.3007043 · Cited by 833
Metadata
- Authors
- Dong, L., Han, Z., Petropulu, A. P., & Poor, H. V.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2010-03
- Volume
- 58
- Issue
- 3
- Pages
- 1875-1888
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2171006634
- Cited by
- 1,366
- References
- 28
- FWCI
- 29.57
- 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.