اخبار و اعلانات
آمار
| تعداد نشریات | 38 |
| تعداد شماره‌ها | 1,258 |
| تعداد مقالات | 9,115 |
| تعداد مشاهده مقاله | 8,324,465 |
| تعداد دریافت فایل اصل مقاله | 5,039,475 |
مخابره پنهان در حضور رله غیر قابل اعتماد | ||
| پدافند الکترونیکی و سایبری | ||
| مقاله 1، دوره 12، شماره 2 - شماره پیاپی 46، شهریور 1403، صفحه 1-14 اصل مقاله (1.82 M) | ||
| نوع مقاله: مقاله پژوهشی | ||
| نویسندگان | ||
| محمدرضا یاری1؛ مسلم فروزش2؛ پائیز عزمی* 3 | ||
| 1دانشجوی دکتری،دانشگاه تربیت مدرس ، تهران، ایران | ||
| 2استادیار،دانشگاه تخصصی فناوری های نوین آمل، آمل ، ایران | ||
| 3استاد، دانشگاه تربیت مدرس، تهران، ایران | ||
| تاریخ دریافت: 18 فروردین 1403، تاریخ بازنگری: 26 تیر 1403، تاریخ پذیرش: 13 مرداد 1403 | ||
| چکیده | ||
| در این مقاله به بررسی توأم مخابره پنهان و ارسال امن نظریه اطلاعاتی در یک شبکه دارای رله غیرقابلاعتماد پرداخته میشود. سناریویی پیشنهاد و مورد ارزیابی قرار میگیرد که منبع و مقصد در آن مجهز به چندین آنتن هستند و با کمک رلة غیرقابلاعتماد تک آنتن با یکدیگر ارتباط برقرار میکنند. ناظر نیز مجهز به چندین آنتن در نظر گرفته میشود و بر اساس مجموع توان دریافتی توسط تمام آنتنها در ارتباط باوجود یا عدم وجود مخابره، تصمیمگیری میکند. باتوجه‌به محدودیت توان کل ارسالی، مسئلة بهینهسازی باهدف بیشینه‌کردن نرخ امن به‌شرط برقراری الزامات مخابره پنهان فرمول‌نویسی میشود. برای حل مسئلة مقید تک‌هدفه از روش تبدیل مسئله تک‌هدفه به چندهدفه استفاده میشود. مسئلة بهینهسازی چندهدفه با الگوریتم NSGA حل میشود. چنانچه نرخ امن ارگودیک به‌عنوان معیار سنجش کارایی در نظر گرفته شود، مقایسه با الگوریتم جست‌وجو جامع نشان میدهد که روش مطرح‌شده، جهت حل مسئله بهینهسازی تخصیص توان با روش جست‌وجوی جامع 6/88 % اختلاف دارد و روشی کارآمد هست. اگر در فاز اول منبع برای ارسال سیگنال داده از روش بیشترین نرخ ارسال در جهت رله غیرقابلاعتماد استفاده نماید؛ نرخ امن ارگودیک نسبت به روش انتخاب بهترین آنتن و انتخاب تصادفی آنتن به ترتیب 9/48 % و 11/53 % بهبود پیدا میکند. همچنین با استفاده از روش بیشترین نرخ ارسال به سمت رله توسط مقصد برای ارسال سیگنال نویز مصنوعی در فاز اول، نرخ امن بالاتری حاصل میشود. علاوه بر این، هرچقدر تعداد آنتنهای منبع افزایش پیدا کند، لازم است که رله، فاصله بیشتری را تا منبع داشته باشد. | ||
| کلیدواژه‌ها | ||
| مخابره پنهان؛ ارسال امن نظریه اطلاعاتی؛ رله غیرقابلاعتماد؛ فن‌های چند آنتنی؛ الگوریتم NSGAI | ||
| عنوان مقاله [English] | ||
| Covert communication in the presence of untrusted relay | ||
| نویسندگان [English] | ||
| MohammadReza Yari1؛ Moslem Forouzesh2؛ Paeize Azmi3 | ||
| 1PhD student, Tarbiat Modares University, Tehran, Iran | ||
| 2Assistant Professor, Amol University of New Technologies, Amol, Iran | ||
| 3Professor, Tarbiat Modares University, Tehran, Iran | ||
| چکیده [English] | ||
| This work discusses covert communication and information theory security in a network with an untrusted relay. In this article, a scenario is proposed and evaluated in which the source and destination are equipped with multiple antennas and communicate with each other by the help of a single antenna untrusted relay. The warden is also considered to be equipped with multiple antennas and based on the total power received by all antennas, he decides on the present or absence of communication. Considering the limitation of the total transmit power, the constrained optimization problem is formulated to maximize the secrecy rate subject to satisfy covert communication requirements. To solve the single-objective constrained problem, the idea of converting the constrained problem into a multi-objective problem is proposed. Finally, we employ the nondominated sorting genetic algorithm (NSGA) to solve it. If the ergodic secrecy rate is considered as a measure of efficiency, comparing the proposed solution with an exhaustive search shows a gap of about 6.888%, and the proposed solution is efficient. If the source employs the maximum ratio transmission method toward the untrusted relay in the first phase, the ergodic secrecy rate is improved by 9.48% and 11.53% compared to best antenna selection and random antenna selection, respectively. A higher secrecy rate can be obtained by using the maximum ratio transmission method toward the untrusted relay by the destination to transmit the artificial noise signal in the first phase. Furthermore, the greater the source’s antennas, the greater the untrusted relay distance from the source. | ||
| کلیدواژه‌ها [English] | ||
| Covert communication, Information theory security, Untrusted relay, multi antennas techniques, NSGA | ||
| مراجع | ||
|
[1] S. Blackburn and S. D. Galbraith, "Certification of secure RSA keys," Electronics Letters, vol. 36, no. 1, pp. 29-30, 2000, doi: 10.1049/el:20000035. [2] J. Han, X. Zeng, X. Xue, and J. Ma, "Physical Layer Secret Key Generation Based on Autoencoder for Weakly Correlated Channels," in 2020 IEEE/CIC International Conference on Communications in China (ICCC), 2020: IEEE, pp. 1220-1225, doi: 10.1109/ICCC49849.2020.9238931. [3] M. Adil, S. Wyne, and S. J. Nawaz, "On quantization for secret key generation from wireless channel samples," IEEE Access, vol. 9, pp. 21653-21668, 2021, doi: 10.1109/ACCESS.2021.3055561. [4] B. A. Bash, D. Goeckel, D. Towsley, and S. Guha, "Hiding information in noise: Fundamental limits of covert wireless communication," IEEE Communications Magazine, vol. 53, no. 12, pp. 26-31, 2015, doi: 10.1109/MCOM.2015.7355562. [5] L. Mucchi et al., "Physical-layer security in 6G networks," IEEE Open Journal of the Communications Society, vol. 2, pp. 1901-1914, 2021, doi: 10.1109/OJCOMS.2021.3103735. [6] K. S. K. Arumugam, M. R. Bloch, and L. Wang, "Covert communication over a physically degraded relay channel with non-colluding wardens," in 2018 IEEE International Symposium on Information Theory (ISIT), 2018: IEEE, pp. 766-770, doi: 10.1109/ISIT.2018.8437505. [7] M. Forouzesh, P. Azmi, A. Kuhestani, and P. L. Yeoh, "Covert communication and secure transmission over untrusted relaying networks in the presence of multiple wardens," IEEE Transactions on Communications, 2020, doi: 10.1109/TCOMM.2020.2978206. [8] M. Forouzesh, P. Azmi, N. Mokari, and D. Goeckel, "Covert Communication Using Null Space and 3D Beamforming," arXiv preprint arXiv:1907.01350, 2019, doi: 10.1109/TVT.2020.2997074. [9] J. Hu, S. Yan, X. Zhou, F. Shu, J. Li, and J. Wang, "Covert communication achieved by a greedy relay in wireless networks," IEEE Transactions on Wireless Communications, vol. 17, no. 7, pp. 4766-4779, 2018, doi: 10.1109/TWC.2018.2831217. [10] K. Shahzad, "Relaying via cooperative jamming in covert wireless communications," in 2018 12th International Conference on Signal Processing and Communication Systems (ICSPCS), 2018: IEEE, pp. 1-6, doi: 10.1109/ICSPCS.2018.8631772. [11] K. Shahzad, X. Zhou, S. Yan, J. Hu, F. Shu, and J. Li, "Achieving covert wireless communications using a full-duplex receiver," IEEE Transactions on Wireless Communications, vol. 17, no. 12, pp. 8517-8530, 2018, doi: 10.1109/TWC.2018.2878014. [12] T. V. Sobers, B. A. Bash, S. Guha, D. Towsley, and D. Goeckel, "Covert communication in the presence of an uninformed jammer," IEEE Transactions on Wireless Communications, vol. 16, no. 9, pp. 6193-6206, 2017, doi: 10.1109/TWC.2017.2720736. [13] J. Wang, W. Tang, Q. Zhu, X. Li, H. Rao, and S. Li, "Covert communication with the help of relay and channel uncertainty," IEEE Wireless Communications Letters, vol. 8, no. 1, pp. 317-320, 2018, doi: 10.1109/LWC.2018.2872058. [14] A. Nosratinia, T. E. Hunter, and A. Hedayat, "Cooperative communication in wireless networks," IEEE communications Magazine, vol. 42, no. 10, pp. 74-80, 2004, doi: 10.1109/MCOM.2004.1341264. [15] A. S. Shah and M. S. Islam, "A survey on cooperative communication in wireless networks," International Journal of Intelligent Systems and Applications, vol. 6, no. 7, p. 66, 2014, doi: 10.5815/ijisa.2014.07.09. [16] X. Chen, D. W. K. Ng, W. H. Gerstacker, and H.-H. Chen, "A survey on multiple-antenna techniques for physical layer security," IEEE Communications Surveys & Tutorials, vol. 19, no. 2, pp. 1027-1053, 2016, doi: 10.1109/COMST.2016.2633387. [17] A. D. Wyner, "The wire‐tap channel," Bell system technical journal, vol. 54, no. 8, pp. 1355-1387, 1975, doi: 10.1002/j.1538-7305.1975.tb02040.x. [18] J. M. Hamamreh, H. M. Furqan, and H. Arslan, "Classifications and applications of physical layer security techniques for confidentiality: A comprehensive survey," IEEE Communications Surveys & Tutorials, vol. 21, no. 2, pp. 1773-1828, 2018, doi: 10.1109/COMST.2018.2878035. [19] D. Fang, N. Yang, M. Elkashlan, P. L. Yeoh, and J. Yuan, "Cooperative jamming protocols in two hop amplify-and-forward wiretap channels," in 2013 IEEE International Conference on Communications (ICC), 2013: IEEE, pp. 2188-2192, doi: 10.1109/ICC.2013.6654852. [20] H.-M. Wang, C. Wang, and D. W. K. Ng, "Artificial noise assisted secure transmission under training and feedback," IEEE Transactions on Signal Processing, vol. 63, no. 23, pp. 6285-6298, 2015, doi: 10.1109/TSP.2015.2465301. [21] Z. Han, N. Marina, M. Debbah, and A. Hjørungnes, "Physical layer security game: interaction between source, eavesdropper, and friendly jammer," EURASIP Journal on Wireless Communications and Networking, vol. 2009, pp. 1-10, 2010, doi: 10.1155/2009/452907. [22] I. Krikidis, J. S. Thompson, and S. McLaughlin, "Relay selection for secure cooperative networks with jamming," IEEE Transactions on Wireless Communications, vol. 8, no. 10, pp. 5003-5011, 2009, doi: 10.1109/TWC.2009.090323. [24] Y. Liu, J. Li, and A. P. Petropulu, "Destination assisted cooperative jamming for wireless physical-layer security," IEEE Transactions on Information Forensics and Security, vol. 8, no. 4, pp. 682-694, 2013, doi: 10.1109/TIFS.2013.2248730. [25] A. Kuhestani, A. Mohammadi, and M. Mohammadi, "Joint relay selection and power allocation in large-scale MIMO systems with untrusted relays and passive eavesdroppers," IEEE Transactions on Information Forensics and Security, vol. 13, no. 2, pp. 341-355, 2017, doi: 10.1109/TIFS.2017.2750102. [26] M. Mitchell, An Introduction to Genetic Algorithms. 1996. [27] C. A. C. Coello and E. M. Montes, "Constraint-handling in genetic algorithms through the use of dominance-based tournament selection," Advanced Engineering Informatics, vol. 16, no. 3, pp. 193-203, 2002, doi: 10.1016/S1474-0346(02)00011-3. [28] C. A. C. Coello, "A comprehensive survey of evolutionary-based multiobjective optimization techniques," Knowledge and Information systems, vol. 1, no. 3, pp. 269-308, 1999, doi: 10.1007/BF03325101. [29] M. Yari, P. Azmi, “Covert communication with untrusted relay,” Thesis, Tarbiat modares Univ, Se, 2020. (In Persian) [30] R. Hinterding, "Gaussian mutation and self-adaption for numeric genetic algorithms," in Proceedings of 1995 IEEE International Conference on Evolutionary Computation, 1995, vol. 1: IEEE, p. 384, doi: 10.1109/ICEC.1995.489178. [31] M. Furqan, H. Hartono, E. Ongko, and M. Ikhsan, "Performance of Arithmetic Crossover and Heuristic Crossover in Genetic Algorithm Based on Alpha Parameter," IOSR Journal of Computer Engineering (IOSR-JCE), vol. 19, no. 1, pp. 31-36, 2017, doi: 10.9790/0661-1905013136. [32] K. Deb, S. Agrawal, A. Pratap, and T. Meyarivan, "A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II," in International conference on parallel problem solving from nature, 2000: Springer, pp. 849-858, doi: 10.1007/3-540-45356-3_83. [33] M. A. Albadr, S. Tiun, M. Ayob, and F. Al-Dhief, "Genetic algorithm based on natural selection theory for optimization problems," Symmetry, vol. 12, no. 11, p. 1758, 2020, doi: 10.3390/sym12111758. [34] A. E. Eiben and S. K. Smit, "Parameter tuning for configuring and analyzing evolutionary algorithms," Swarm and Evolutionary Computation, vol. 1, no. 1, pp. 19-31, 2011, doi: 10.1016/j.swevo.2011.02.001. | ||
|
آمار تعداد مشاهده مقاله: 286 تعداد دریافت فایل اصل مقاله: 63 |
||