Exploiting Opportunistic Scheduling in Uplink Wiretap Networks

被引:18
作者
Ge, Xin [1 ]
Jin, Hu [2 ]
Zhu, Jun [1 ]
Cheng, Julian [3 ]
Leung, Victor C. M. [1 ]
机构
[1] Univ British Columbia, Dept Elect & Comp Engn, Vancouver, BC V6T 1Z4, Canada
[2] Hanyang Univ, Dept Elect & Commun Engn, Ansan 15588, South Korea
[3] Univ British Columbia, Sch Engn, Kelowna, BC V1V 1V7, Canada
基金
中国国家自然科学基金; 加拿大自然科学与工程研究理事会; 新加坡国家研究基金会;
关键词
Cumulative distribution function (CDF) based scheduling; fair resource sharing; physical layer security; secrecy outage probability; PHYSICAL-LAYER SECURITY; FADING CHANNELS; WIRELESS INFORMATION; SECRECY CAPACITY; TRANSMISSION; SYSTEMS; COMMUNICATION;
D O I
10.1109/TVT.2016.2616679
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Opportunistic scheduling schemes are investigated for uplink wiretap channels with multiple asymmetrically located legitimate users (LUs) and eavesdroppers. To exploit multiuser diversity, the cumulative distribution function-based scheduling method is leveraged to schedule the transmissions of the LUs. Under this scheduling framework, the closed-form expressions of the secrecy outage probability and ergodic secrecy rate are derived, illustrating the interplay among the system parameters, such as the channel statistics and the number of LUs and eavesdroppers. Through the secrecy outage analysis of the proposed scheduling schemes, we observe that the secrecy throughput is not always maximized with a larger channel access ratio (CAR), and consequently, we design a CAR adjustment scheme to maximize the secrecy throughput while satisfying the required secrecy level. We also prove that under our proposed scheduling schemes, the secrecy diversity order of each LU is equal to the reciprocal of the LU's CAR, implying that full diversity order is achieved, and the ergodic secrecy rate of each LU normalized by its CAR achieves the optimal double-logarithmic growth when the number of LUs increases to infinity.
引用
收藏
页码:4886 / 4897
页数:12
相关论文
共 33 条
[1]  
[Anonymous], 2000, Tables of Integrals
[2]   Wireless information-theoretic security [J].
Bloch, Matthieu ;
Barros, Joao ;
Rodrigues, Miguel R. D. ;
McLaughlin, Steven W. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (06) :2515-2534
[3]   Multi-Antenna Relay Aided Wireless Physical Layer Security [J].
Chen, Xiaoming ;
Zhong, Caijun ;
Yuen, Chau ;
Chen, Hsiao-Hwa .
IEEE COMMUNICATIONS MAGAZINE, 2015, 53 (12) :40-+
[4]  
Ge X, 2015, IEEE WCNC, P1422, DOI 10.1109/WCNC.2015.7127677
[5]   Opportunistic Downlink Scheduling With Resource-Based Fairness and Feedback Reduction in Distributed Antenna Systems [J].
Ge, Xin ;
Jin, Hu ;
Leung, Victor C. M. .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2016, 65 (07) :5007-5021
[6]   CDF-Based Scheduling Algorithm for Proportional Throughput Fairness [J].
Ge, Xin ;
Jin, Hu ;
Leung, Victor C. M. .
IEEE COMMUNICATIONS LETTERS, 2016, 20 (05) :1034-1037
[7]  
Ge X, 2015, IEEE ICC, P7370, DOI 10.1109/ICC.2015.7249504
[8]   On the secrecy capacity of fading channels [J].
Gopala, Praveen Kumar ;
Lai, Lifeng ;
El Gamal, Hesham .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (10) :4687-4698
[9]   Random Beamforming with Heterogeneous Users and Selective Feedback: Individual Sum Rate and Individual Scaling Laws [J].
Huang, Yichao ;
Rao, Bhaskar D. .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2013, 12 (05) :2080-2090
[10]   Fundamental Limits of CDF-Based Scheduling: Throughput, Fairness, and Feedback Overhead [J].
Jin, Hu ;
Jung, Bang Chul ;
Leung, Victor C. M. .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2015, 23 (03) :894-907