Quasi-concave optimization of secrecy redundancy rate in HARQ-CC system

被引:0
|
作者
Yue Wu
Shishu Yin
Jian Zhou
Pei Yang
Hongwen Yang
机构
[1] Anhui University of Finance and Economics,School of Management Science and Engineering
[2] Beijing University of Posts and Telecommunications,School of Information and Communication Engineering
来源
关键词
physical layer security (PLS); hybrid automatic repeat request (HARQ); chase combining (CC); effective secrecy throughput (EST); quasi-concave optimization;
D O I
暂无
中图分类号
学科分类号
摘要
In a hybrid automatic repeat request with chase combining (HARQ-CC) system, we analyze physical layer secure performance and determine the secrecy redundancy rate by proposed quasi-concave optimization methods with effective secrecy throughput (EST) criteria. First, key performance metrics, including connection outage probability (COP), secrecy outage probability (SOP), EST, and delay, are discussed. Then, under the constraint of COP, we optimize the secrecy redundancy rate to maximize the EST, which is a quasi-concave function, by both the bisection and fixed-point methods. Furthermore, under the simultaneous constraints of COP and SOP, the bisection and Lagrangian multiplier methods are applied to optimize the secrecy redundancy rate. From the comparison of the numerical and simulated results, it is concluded that EST demonstrates practical secure performance of HARQ-CC, and the proposed optimization methods adjust the secrecy redundancy rate for improved security.
引用
收藏
相关论文
共 18 条
  • [1] Quasi-concave optimization of secrecy redundancy rate in HARQ-CC system
    Yue WU
    Shishu YIN
    Jian ZHOU
    Pei YANG
    Hongwen YANG
    Science China(Information Sciences), 2020, 63 (02) : 160 - 173
  • [2] Quasi-concave optimization of secrecy redundancy rate in HARQ-CC system
    Wu, Yue
    Yin, Shishu
    Zhou, Jian
    Yang, Pei
    Yang, Hongwen
    SCIENCE CHINA-INFORMATION SCIENCES, 2020, 63 (02)
  • [3] Rate Adaption for Secure HARQ-CC System with Multiple Eavesdroppers
    Wu, Yue
    Yin, Shishu
    Zhou, Jian
    Yang, Pei
    Yang, Hongwen
    ENTROPY, 2020, 22 (04)
  • [4] QUASI-CONCAVE OPTIMIZATION - SUFFICIENT CONDITIONS FOR A MAXIMUM
    MUKHERJI, A
    ECONOMICS LETTERS, 1989, 30 (04) : 341 - 343
  • [5] Optimal Differentially Private Learning of Thresholds and Quasi-Concave Optimization
    Cohen, Edith
    Lyu, Xin
    Nelson, Jelani
    Sarlos, Tamas
    Stemmer, Uri
    PROCEEDINGS OF THE 55TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2023, 2023, : 472 - 482
  • [6] Interactive evolutionary multi-objective optimization for quasi-concave preference functions
    Fowler, John W.
    Gel, Esma S.
    Koksalan, Murat M.
    Korhonen, Pekka
    Marquis, Jon L.
    Wallenius, Jyrki
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 206 (02) : 417 - 425
  • [7] Parallel quasi-concave set function optimization for scalability even without submodularity
    Vepakomma, Praneeth
    Kempner, Yulia
    Alfaro, Rodmy Paredes
    Raskar, Ramesh
    2023 IEEE HIGH PERFORMANCE EXTREME COMPUTING CONFERENCE, HPEC, 2023,
  • [8] AN INTERACTIVE INTEGRATED MULTIOBJECTIVE OPTIMIZATION APPROACH FOR QUASI-CONCAVE QUASI-CONVEX UTILITY-FUNCTIONS
    ALALWANI, JE
    HOBBS, BF
    MALAKOOTI, BB
    APPLIED MATHEMATICS AND COMPUTATION, 1993, 54 (2-3) : 241 - 257
  • [9] Rate Selection for Cooperative HARQ-CC Systems over Time-Correlated Nakagami-m Fading Channels
    Shi, Zheng
    Ma, Shaodan
    Tam, Kam-Weng
    2015 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATION WORKSHOP (ICCW), 2015, : 919 - 924
  • [10] Screening for ortholog clusters using multipartite graph clustering by quasi-concave set function optimization
    Vashist, A
    Kulikowski, C
    Muchnik, I
    ROUGH SETS, FUZZY SETS, DATA MINING, AND GRANULAR COMPUTING, PT 2, PROCEEDINGS, 2005, 3642 : 409 - 419