Federated Deep Reinforcement Learning-Based Intelligent Surface Configuration in 6G Secure Airport Networks

被引:0
作者
Chen, Yang [1 ]
Al-Rubaye, Saba [1 ]
Tsourdos, Antonios [1 ]
Chu, Kai-Fung [2 ]
Wei, Zhuangkun [3 ]
Baker, Lawrence [4 ]
Gillingham, Colin [4 ]
机构
[1] Cranfield Univ, Sch Aerosp Transport & Mfg SATM, Milton Keynes MK43 0AL, England
[2] Univ Cambridge, Dept Engn, Cambridge CB2 1PZ, England
[3] Imperial Coll London, Dept Comp, London SW7 2BX, England
[4] NCC Grp, Manchester M3 3AQ, England
关键词
Airports; 6G mobile communication; Array signal processing; Channel estimation; Atmospheric modeling; Robustness; Heuristic algorithms; Downlink; Wireless networks; Quality of service; Deep reinforcement learning; federated learning; non-convex optimization; smart airports; PRIVACY;
D O I
10.1109/TITS.2024.3463189
中图分类号
TU [建筑科学];
学科分类号
0813 ;
摘要
Reconfigurable Intelligent Surface (RIS) is envisioned to revolutionize 6G wireless networks, particularly in complex environments like smart airports, by customizing analog beamforming with desired direction and magnitude. Through precise configuration refinement, the intelligent surface intends to achieve equivalent Quality of Service (QoS) with fewer antennas, thereby enhancing coverage and capacity in high-demand areas of airports. However, existing model-free algorithms struggle to obtain a stable policy gradient of intelligent surface configuration. Moreover, centralized channel estimation is inefficient to massive communication and more vulnerable to eavesdroppers. To address these challenges, a robust Proximal Policy Optimization-Huber (PPO-Huber) algorithm was developed to improve the efficiency and robustness of digital connectivity within airports. Concerning the privacy of channel models in massive communication, we proposed an optimal Differential Private Federated Learning (DPFL) with noise reduction, ensuring secure access to channel information. Comprehensive convergence analyses are conducted for each proposed algorithm to facilitate hyperparameter tuning and suggest potential research directions. Experimental results demonstrate that our algorithms not only offer flexible deployment of intelligent surface without accurate channel knowledge, but also substantially breaking the communication-privacy-utility trilemma in massive RIS-aided 6G wireless networks of smart airports.
引用
收藏
页数:17
相关论文
共 67 条
  • [1] Deep Learning with Differential Privacy
    Abadi, Martin
    Chu, Andy
    Goodfellow, Ian
    McMahan, H. Brendan
    Mironov, Ilya
    Talwar, Kunal
    Zhang, Li
    [J]. CCS'16: PROCEEDINGS OF THE 2016 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2016, : 308 - 318
  • [2] Airport Connectivity Optimization for 5G Ultra-Dense Networks
    Al-Rubaye, Saba
    Tsourdos, Antonios
    [J]. IEEE TRANSACTIONS ON COGNITIVE COMMUNICATIONS AND NETWORKING, 2020, 6 (03) : 980 - 989
  • [3] A Deep Reinforcement Learning Approach for Airport Departure Metering Under Spatial-Temporal Airside Interactions
    Ali, Hasnain
    Duc-Thinh Pham
    Alam, Sameer
    Schultz, Michael
    [J]. IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2022, 23 (12) : 23933 - 23950
  • [4] Andrew G., 2019, P ADV NEUR INF PROC, V21, P17455
  • [5] Asi Hilal, 2022, P MACHINE LEARNING R
  • [6] Balle B, 2018, ADV NEUR IN, V31
  • [7] Uplink to Downlink Channel Covariance Transformation in FDD Systems
    Bameri, Salime
    Almahrog, Khalid A.
    Gohary, Ramy H.
    El-Keyi, Amr
    Ahmed, Yahia A. Eldemerdash
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2023, 71 : 3196 - 3212
  • [8] Federated Distributionally Robust Optimization for Phase Configuration of RISs
    Ben Issaid, Chaouki
    Samarakoon, Sumudu
    Bennis, Mehdi
    Poor, H. Vincent
    [J]. 2021 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2021,
  • [9] Bertsekas DP., 2003, Convex analysis and optimization, P534
  • [10] The ODE method for convergence of stochastic approximation and reinforcement learning
    Borkar, VS
    Meyn, SP
    [J]. SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 2000, 38 (02) : 447 - 469