Secrecy-oriented user association in ultra dense heterogeneous networks against strategically colluding adversaries

被引:0
|
作者
Su, Gongchao [1 ]
Dai, Mingjun [1 ]
Chen, Bin [1 ]
Lin, Xiaohui [1 ]
Wang, Hui [1 ]
机构
[1] Shenzhen Univ, Coll Elect & Informat Engn, Shenzhen, Guangdong, Peoples R China
关键词
PHYSICAL-LAYER SECURITY; TRANSMISSION;
D O I
10.1049/cmu2.12372
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Network densification is recognized as the key technology to meet the ever growing demand of data traffic in next generation wireless networks. However the proliferation of small cell base stations (SCBSs) introduces vulnerabilities to information security, as they are prone to eavesdropping attacks. In this paper, it is studied how user association strategies can be specifically tailored to meet this security challenge in a ultra dense heterogeneous cellular network(UDHCN) with a group of colluding eavesdroppers. In particular, the situation is considered where eavesdroppers may have limited capabilities in intercepting and decoding data traffic. In this setting each eavesdropper has to make its own decision on eavesdropping targets, and they are able to take concerted actions to sabotage information security. To address this challenge, a zero sum game framework to reflect the conflicting interests of users and eavesdroppers is proposed and a user association scheme is devised that aims to maximize system sum secrecy rate against these adversaries whose actions intend to minimize sum secrecy rate. The case that all adversaries have limited eavesdropping capabilities is first considered, and it is shown that the corresponding zero sum game is indeed a bilinear game, and its Nash equilibrium solution can be readily approximated using a saddle point Frank Wolfe(SP-FW)algorithm. Then the framework is extended to the case where adversaries with a diverse configuration of eavesdropping capabilities exist. In this case, it is shown that the underlying minimax optimization problem is indeed a nonsmooth convex-nonconcave one. A two stage method is proposed by first smoothing the objective function with a Hermite cubic polynomial approximation, and then obtaining a nearly stationary solution via a recently proposed proximal point gradient descent method. Simulation results show that the proposed framework leads to significant increases in sum secrecy rate and secrecy probability against both the capability-limited adversaries and a hybrid type of adversaries.
引用
收藏
页码:695 / 709
页数:15
相关论文
共 50 条
  • [1] Robust User Association for Ultra Dense Networks
    Liakopoulos, Nikolaos
    Paschos, Georgios
    Spyropoulos, Thrasyvoulos
    IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2018), 2018, : 2690 - 2698
  • [2] User Association and Resource Allocation in Unified NOMA Enabled Heterogeneous Ultra Dense Networks
    Qin, Zhijin
    Yue, Xinwei
    Liu, Yuanwei
    Ding, Zhiguo
    Nallanathan, Arumugam
    IEEE COMMUNICATIONS MAGAZINE, 2018, 56 (06) : 86 - 92
  • [3] User Association for Ultra Dense Networks with QoS Guarantees
    Liakopoulos, Nikolaos
    Paschos, Georgios
    Spyropoulos, Thrasyvoulos
    2018 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2018,
  • [4] Joint User Association and BS Operation for Green Communications in Ultra-Dense Heterogeneous Networks
    Zhou, Tianqing
    Fu, Yanyan
    Qin, Dong
    Li, Xuan
    Li, Chunguo
    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2024, 73 (02) : 2305 - 2319
  • [5] Joint User Association and Time Partitioning for Load Balancing in Ultra-Dense Heterogeneous Networks
    Tianqing Zhou
    Junhui Zhao
    Dong Qin
    Xuan Li
    Chunguo Li
    Luxi Yang
    Mobile Networks and Applications, 2021, 26 : 909 - 922
  • [6] User Association and Power Allocation Based on Q-Learning in Ultra Dense Heterogeneous Networks
    Li, Dong
    Zhang, Haijun
    Long, Keping
    Wei Huangfu
    Dong, Jiangbo
    Nallanathan, Arumugam
    2019 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2019,
  • [7] Joint User Association and Time Partitioning for Load Balancing in Ultra-Dense Heterogeneous Networks
    Zhou, Tianqing
    Zhao, Junhui
    Qin, Dong
    Li, Xuan
    Li, Chunguo
    Yang, Luxi
    MOBILE NETWORKS & APPLICATIONS, 2021, 26 (02): : 909 - 922
  • [8] Difference Based Matching Algorithm for User Association Problem in Ultra-Dense Heterogeneous Networks
    Su, Chunxia
    Ye, Fang
    Cong, Shanya
    Tian, Yuan
    2020 IEEE USNC-CNC-URSI NORTH AMERICAN RADIO SCIENCE MEETING (JOINT WITH AP-S SYMPOSIUM), 2020, : 81 - 82
  • [9] User-Cell Association for Security and Energy Efficiency in Ultra-Dense Heterogeneous Networks
    Marabissi, Dania
    Mucchi, Lorenzo
    Morosi, Simone
    SENSORS, 2021, 21 (02) : 1 - 15
  • [10] Secure User Association in Ultra Dense Heterogeneous Cellular Networks with non-Uniformly Distributed Eavesdroppers
    Su, Gongchao
    Dai, Mingjun
    Lin, Xiaohui
    Chen, Bin
    Wang, Hui
    2019 ELEVENTH INTERNATIONAL CONFERENCE ON UBIQUITOUS AND FUTURE NETWORKS (ICUFN 2019), 2019, : 164 - 168