This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Federated Spectrum Learning for Reconfigurable Intelligent Surfaces-Aided Wireless Edge Networks

Bo Yang, Xuelin Cao, Chongwen Huang, Chau Yuen, , Marco Di Renzo, , Yong Liang Guan, , Dusit Niyato, , Lijun Qian, , and Mérouane Debbah, B. Yang is with the School of Computer Science, Northwestern Polytechnical University, Xi’an, Shaanxi, 710129, China (email: yang_\_[email protected]) X. Cao is with the School of Cyber Engineering, Xidian University, Xian 710071, China, and also with the Engineering Product Development Pillar, Singapore University of Technology and Design, Singapore 487372 (email: [email protected]). C. Yuen is with the Engineering Product Development Pillar, Singapore University of Technology and Design, Singapore 487372 (email: [email protected]). C. Huang is with College of Information Science and Electronic Engineering, Zhejiang University, Hangzhou 310027, China, and with International Joint Innovation Center, Zhejiang University, Haining 314400, China, and also with Zhejiang-Singapore Innovation and AI Joint Research Lab and Zhejiang Provincial Key Laboratory of Info. Proc., Commun. & Netw. (IPCAN), Hangzhou 310027, China. (E-mail: [email protected] ). M. Di Renzo is with Université Paris-Saclay, CNRS, CentraleSupélec, Laboratoire des Signaux et Systèmes, 3 Rue Joliot-Curie, 91192 Gif-sur-Yvette, France (email: [email protected]). Y. L. Guan is with the School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore (e-mail: [email protected]). D. Niyato is with the School of Computer Science and Engineering, Nanyang Technological University, Singapore (email: [email protected]) . L. Qian is with the Department of Electrical and Computer Engineering and CREDIT Center, Prairie View A&\&M University, TX 77446, USA (email: [email protected]). M. Debbah is with the Technology Innovation Institute, 9639 Masdar City, Abu Dhabi, United Arab Emirates (email: [email protected]) and also with CentraleSupelec, University Paris-Saclay, 91192 Gif-sur-Yvette, France.
Abstract

Increasing concerns on intelligent spectrum sensing call for efficient training and inference technologies. In this paper, we propose a novel federated learning (FL) framework, dubbed federated spectrum learning (FSL), which exploits the benefits of reconfigurable intelligent surfaces (RISs) and overcomes the unfavorable impact of deep fading channels. Distinguishingly, we endow conventional RISs with spectrum learning capabilities by leveraging a fully-trained convolutional neural network (CNN) model at each RIS controller, thereby helping the base station to cooperatively infer the users who request to participate in FL at the beginning of each training iteration. To fully exploit the potential of FL and RISs, we address three technical challenges: RISs phase shifts configuration, user-RIS association, and wireless bandwidth allocation. The resulting joint learning, wireless resource allocation, and user-RIS association design is formulated as an optimization problem whose objective is to maximize the system utility while considering the impact of FL prediction accuracy. In this context, the accuracy of FL prediction interplays with the performance of resource optimization. In particular, if the accuracy of the trained CNN model deteriorates, the performance of resource allocation worsens. The proposed FSL framework is tested by using real radio frequency (RF) traces and numerical results demonstrate its advantages in terms of spectrum prediction accuracy and system utility: a better CNN prediction accuracy and FL system utility can be achieved with a larger number of RISs and reflecting elements.

Index Terms:
Intelligent spectrum sensing, federated learning, reconfigurable intelligent surface.

I Introduction

Sixth-generation (6G) networks are envisioned to provide new services and applications to the users. Due to the limited spectrum resources, spectrum sensing, which is defined as the task of ascertaining the spectrum usage and the activity of mobile users, has become urgent and meaningful to improve the spectrum usage efficiency and address the spectrum scarcity problem in heterogeneous wireless networks [1, 2]. For instance, the desire for better spectrum utilization has triggered spectrum sharing such as the coexistence of WiFi and Long Term Evolution (LTE) in unlicensed spectrum (LTE-U) [3]. However, large-scale dynamical networks lead to spectrum characteristics uncertainty, which entails great difficulty in robust and accurate spectrum sensing. To address this challenge, deep learning (DL) has been employed to intelligently identify the spectrum characteristics [4, 5]. Specifically, learning deep features from the radio frequency (RF) signals via appropriately offline trained deep neural networks (DNNs) has become popular [6, 7, 8, 9].

It is worth noting that, in traditional DL-based spectrum sensing methods, pre-trained DNNs that detect RF signals usually need to be fine-tuned or even re-trained once the spectrum occupancy changes significantly. As for the training of DNNs, conventional centralized training approaches (e.g., training at a central cloud) that require uploading a large amount of raw data may not be feasible in practice due to the limited communication bandwidth, data privacy and security concerns. In this case, federated learning (FL) has emerged as a suitable solution to leverage personalized dataset from a large number of mobile users in order to collaboratively train a shared DNN in a decentralized way, while achieving differential data locality [10, 11]. In each iteration of FL (called round), the users train their local models based on their own data and then upload, via wireless links, the model updates to an edge server where the global aggregation is performed.

I-A Motivation and Scope

In the depicted context, several new research challenges emerge for the conventional FL process:

  • Challenge-1: Before the start of local training at each iteration of the conventional FL process, the edge server first needs to perform resource allocation (such as users selection and bandwidth allocation) by solving the corresponding optimization problem. Due to the existence of shadowing and multi-path fading in radio environments, some users may not be able to reliably send their requests to the base station (BS) via the direct links, which may be severely degraded and then unreliable. In this case, the BS cannot perform the resource allocation well since some of the requests may be missed.

  • Challenge-2: In conventional FL, the users who finish the local training send via wireless links their local models to the BS for global model aggregation. Due to the possible unreliability of the wireless direct links and the limited wireless bandwidth, the convergence of FL may be degraded because of the low efficiency of uploading the local models. In this case, the accuracy of FL prediction may be degraded since some of the local models may be received unsuccessfully at the BS.

To address the aforementioned challenges in conventional FL implementations, emerging and advanced technologies such as terahertz (THz) communications and ultra-massive multiple-input-multiple-output (MIMO), can be exploited to improve the wireless transmission. However, excessive hardware costs and energy consumption pose design challenges due to the relatively high operating frequency of THz communications and the large number of RF chains required. In recent years, reconfigurable intelligent surfaces (RISs), benefited from breakthroughs on the fabrication of programmable metasurfaces, have emerged as a promising technology for improving the quality of wireless links and for configuring the wireless environment by, e.g., appropriately reflecting the incident signals with the aid of a large number of nearly-passive reflecting elements with low power consumption [12, 13, 14, 15, 16]. Recently, innovative RIS technologies improving wireless communications with low cost and energy consumption have been proposed [17, 18]. For example, holographic MIMO surfaces (HMIMOS) attracted great research attention as a possible solution for realizing massive MIMO systems at a lower cost and power consumption [19, 20]. In addition, to collect users’ training requests subject to deep fading conditions, cooperative RF spectrum sensing constitutes a promising approach for improving the sensing performance by capitalizing on the spatial sensing diversity of distributed sensors [21, 22, 23]. Motivated by these considerations, it is desirable to address the two mentioned challenges of FL by integrating FL with RISs, thereby achieving cooperative RF spectrum sensing (to improve the performance of optimization) and enhancing the quality of the wireless links (to improve the accuracy of FL prediction) [24].

I-B Related Work

Recently, some researchers have investigated the potential benefits of using RISs for improving the performance of FL [25, 26]. In these papers, however, the considered system scenarios are limited to a single-RIS setup, and the user-RIS association problem was not relevant. A more complex and general FL system has been investigated in [27], where multiple RISs are deployed for performance enhancement. However, none of the above existing works explored the interplay between FL and RISs. Thus, this motivates us to design a novel federated spectrum learning (FSL) framework, thereby achieving efficient spectrum learning for wireless edge networks.

In wireless networks, the potential opportunities offered by the distributed FL paradigm have not been fully exploited, mainly because of the straggler effect and the unreliability of wireless channels under limited wireless resources [28]. Due to the unreliability of wireless channels, in particular, it may be difficult to receive correct local updates at the edge, especially when the wireless channel undergoes deep fading. As a result, the convergence performance of FL may be degraded. In this context, it is imperative to improve the FL performance from the communications perspective [28, 29, 30, 31]. Specifically, Chen et al. [28] investigated a joint learning, wireless resource allocation, and user selection problem in FL by taking into account the wireless link packet errors and the availability of wireless resources. Samarakoon et al. [29] introduced FL to help with the joint design of power control and resource allocation for application to vehicular communication networks. To mitigate the straggler effect, Yang et al. [30] proposed a fast global model aggregation approach to improve the performance and the convergence rate of FL via over-the-air computation (AirComp). Since uploading of the local parameters at every iteration is often inefficient in FL, Wang et al. [31] presented a control algorithm that determines the best tradeoff between local update and global aggregation so as to minimize the loss function of FL.

Unlike other transmission technologies such as active relay, RISs can help to reflect the incident signals through adjusting the phase shifts of their scattering elements smartly, thereby improving the wireless transmissions [32]. In order to explore the benefits of RISs in wireless networks, designing RIS-aided wireless communication systems based on deep learning techniques has recently received major attention [33]. In particular, Hu et al. [34] considered a metasurface assisted RF sensing method which can sense the locations of objects in a 3D space, and proposed a deep reinforcement learning (DRL) algorithm to solve the formulated optimization problem. Huang et al. [35] analyzed the joint design of transmit beamforming at the base station and phase shifts at the RIS to maximize the sum rate utilizing DRL. Cao et al. [36] investigated an RIS-assisted multi-user downlink aerial-terrestrial communication system via multi-task learning. Yang et al. [37] proposed an RIS-assisted anti-jamming solution for securing wireless communications via RL. Although some works focused on deep learning for RIS systems, e.g., reflecting beamforming matrix optimization [34, 37, 35, 36] and channel estimation [38, 39, 40], endowing RISs with active learning capabilities for data-driven wireless networks still presents many open issues to be explored and addressed.

I-C Contributions and Organizations

In this paper, our goal is to propose a novel FSL framework to improve the accuracy of FL with the aid of RISs, as well as to endow conventional RISs with spectrum sensing capabilities, thereby improving the system performance in a cooperative way, especially in radio environments subject to deep fading channels. In this context, our major contributions are summarized as follows:

  1. 1.

    We develop a novel FSL framework for RISs-aided wireless edge networks by investigating the interplay between FL and RISs. Based on collected RF data traces, the mobile users train their local models and then upload them to an edge server via RIS-assisted links, thereby achieving a fast yet reliable model aggregation. At the beginning of each iteration, in addition, the aggregated model is deployed at each RIS controller to help the BS collect the requests of users by cooperatively sensing the spectrum, thereby improving the performance, especially in complex shadowing and fading radio environments.

  2. 2.

    We jointly optimize the user-RIS association, the phase shifts configuration and the wireless bandwidth allocation. In the considered FSL framework subject to limited wireless resources and a limited number of RISs, specifically, we formulate a joint user-RIS association, phase shifts design, and wireless bandwidth allocation problem, whose goal is to maximize the FL system utility. To solve the user-RIS association problem, we propose a matching game-based association scheme in which the users who achieve larger gains in terms of achievable SNR have higher probabilities to be associated with an RIS. The optimized phase shifts guarantee that the achieved gain of each user served by the RISs is maximized. Also, we employ the bisection search method to handle the wireless bandwidth allocation problem.

  3. 3.

    We demonstrate the advantages of the proposed FSL framework in terms of the training and inference performance. The proposed FSL framework is tested by using real RF traces, and numerical simulations demonstrate that the proposed FSL framework outperforms other benchmark schemes regarding spectrum sensing accuracy and system utility. Based on the conducted study, the following considerations can be made:

    • The proposed FSL framework assisted by a larger number of RISs can achieve a better prediction accuracy and lower training loss.

    • As the number of reflecting elements of each RIS increases, the FL system utility can be significantly improved.

    • The performance of the proposed FSL framework is determined by the learning rate in the presence of multiple RISs. Therefore, an appropriate learning rate needs to be chosen as a function of the number of available RISs.

To our best knowledge, this is an early work that investigates the interplay between FL and RISs for efficient spectrum learning over wireless edge networks. The rest of this paper is organized as follows. We describe the proposed FSL framework in Section II. We introduce the system model and problem formulation in Section III. We present the algorithm solution to the considered optimization problem in Section IV. We illustrate the simulation results in Section V. Finally, conclusions are drawn in Section VI.

Notations: A bold letter indicates a vector or matrix. An upper case letter indicates a random variable or random parameter and a lower case letter indicates a realization of a random variable or a random parameter. max{}\max\{\cdot\} and min{}\min\{\cdot\} represent the maximum value and the minimum value, respectively. The amplitude of a complex number aa is denoted by |a|\left|a\right|. The symbol \leftarrow denotes the ‘assignment’ relation.

Refer to caption
(a) RIS-aided resource allocation stage
Refer to caption
(b) RIS-aided FL training stage
Figure 1: The proposed FSL framework encompasses two stages: the RIS-aided resource allocation stage (shown in (a)) and the RIS-aided training stage (shown in (b)). These two stages interplay with each other and constitute one iteration (or round) of FL, which is repeated several times until the FL model converges. In (a), the FL model is deployed at each RIS controller to infer the users who send requests (called requested users). In (b), RISs help to improve the wireless transmissions between the users and the base station.

II Federated Spectrum Learning Framework

II-A Network Scenario

As shown in Fig. 1, we consider a wireless network that consists of one base station (BS) co-located with an edge server, which serves a set \cal M of MM users via KK RISs, where ={1,2,,M}{\cal M}=\{1,2,\ldots,M\}. There may exist obstacles (e.g., buildings) between the users and the BS, and the RISs can help improve the quality of wireless transmission between the users and the BS. We denote the mmth user as Um,mU_{m},\ m\in{\cal{M}}, the local training dataset by 𝒟m{\cal D}_{m} with Dm=|𝒟m|D_{m}=|{\cal D}_{m}| being the number of data samples. In the dataset 𝒟m={𝒙m,s,ym,s}s=1Dm{\cal D}_{m}=\{\bm{x}_{m,s},{y}_{m,s}\}^{D_{m}}_{s=1}, each data sample is constituted by an input vector 𝒙m,sNd×1\bm{x}_{m,s}\in\mathbb{R}^{N_{d}\times 1} and its corresponding output value ym,s{y}_{m,s}\in\mathbb{R}. As far as the data locality is concerned, we assume that the collected datasets are non-overlapping with each other, i.e., 𝒙i𝒙j\bm{x}_{i}\neq\bm{x}_{j}, ij,i,ji\neq j,\ \forall i,j\in\cal M.

II-B Design Basics

In this paper, a novel FSL framework is proposed to exploit the interplay between FL and RISs. In the considered FL wireless network, specifically, only some users may send requests (called requested users) to participate in the training procedure of FL. Therefore, it is necessary to identify them and to appropriately allocate the available resources (e.g., wireless bandwidth) for maximizing the FL performance. In the proposed FSL framework, the requested users are inferred with the aid of neural networks deployed at the controller of the RISs. The latter neural networks are in turn trained by leveraging an FL framework that relies on the availability of RISs for reliable data transmission. These two phases are intertwined and, therefore, each training iteration of the proposed FSL framework consists of two stages: 1) the RIS-aided resource allocation stage, and 2) the RIS-aided FL training stage.

Specifically, in the RIS-aided resource allocation stage shown in Fig. 1(a), an initial convolutional neural network (CNN) model is deployed at each RIS controller to collaboratively infer the requested users from the impinging RF signals111We assume that the RIS controller has sufficient computation resources, e.g., field programmable gate array (FPGA) [41], to run the trained model for inference., and then the obtained estimates are reported to the BS for resource allocation. In the RIS-aided federated training stage shown in Fig. 1(b), given to the allocated resources, the CNN model available at the RISs’ controllers are further trained with the aid of FL, where the requested users upload their local model parameters via RISs-aided wireless links. It is worth noting that FL training and resource allocation (or optimization) are two intertwined problems, as illustrated in Fig. 2. In particular, if the resource allocation cannot yield an optimal solution, i.e., the wireless bandwidth is not appropriately allocated to the requested users, then the accuracy of the CNN model trained via FL worsens. If the accuracy of the trained CNN model deteriorates, in turn, the performance of resource allocation worsens. Indeed, this is a typical ‘chicken-and-egg’ issue. To address this issue, we propose the FSL framework by leveraging a fully-trained CNN model at each RIS controller and by jointly optimizing the user-RIS association, the phase shifts configuration and the wireless bandwidth allocation.

Refer to caption

Figure 2: The interplay between the two stages in the proposed FSL framework.

II-C RIS-aided Resource Allocation Stage

As illustrated in Fig. 1(a), the RIS-aided resource allocation stage involves three steps: i) Users send requests: the users who aim to participate in the current iteration of FL send requests to the BS; ii) RIS controllers infer the set of requested users: the CNN model deployed at each RIS controller estimates the ID of the requested users, which are then reported to the BS via a dedicated channel; iii) Edge server performs configurations: Based on the inferred results, the edge server performs the resource allocation by solving the optimization problem and broadcasts the result to the users and the RIS controllers. Specifically, when arriving at the RISs, the incident RF signals first undergo analog-to-digital conversion (ADC) and frequency down-conversion. Then the baseband In-phase (I) and Quadrature (Q) sequences are fed into the trained CNN model to perform online inference at the RIS controller. To achieve wireless spectrum learning at the RIS controllers, we introduce Assumption 1.

Assumption 1.

To enable the RISs to identify the requested users according to the incident signal, we assume that each RIS is equipped with a few ‘semi-active’ RIS elements, which obtain the I/Q sequences by performing ADC and down-conversion of the incident RF signals.

By performing feed-forward calculation via the trained CNN model, the set of inferred requested users obtained by the kkth RIS controller is represented by

𝒰~k={{Um},m,if n~k1,,if n~k=0,\widetilde{\cal U}_{k}=\begin{cases}\{U_{m}\},\ \forall m\in{\cal M},&\text{if }\widetilde{n}_{k}\geq 1,\\ \varnothing,&\text{if }\widetilde{n}_{k}=0,\end{cases} (1)

where n~k\widetilde{n}_{k} indicates the inferred total number of requested users in the incident signal.

II-D RIS-aided FL Training Stage

In the considered FSL framework, for a data sample with input 𝒙m\bm{x}_{m}, the task is to find a model parameter vector 𝝎m\bm{\omega}_{m} that characterizes the output ymy_{m} by minimizing the loss function f(𝝎m,𝒙m,s,ym,s)f(\bm{\omega}_{m},\bm{x}_{m,s},{y}_{m,s}). Since the dataset of UmU_{m} is 𝒟m{\cal D}_{m}, the loss function of UmU_{m} can be obtained as

Jm(𝝎m)=1Dms=1Dmf(𝝎m,𝒙m,s,ym,s).\ J_{m}(\bm{\omega}_{m})=\frac{1}{D_{m}}\sum_{s=1}^{D_{m}}f(\bm{\omega}_{m},\bm{x}_{m,s},{y}_{m,s}). (2)

We denote D=mDmD=\sum_{m\in\cal M}D_{m} as the total data samples of all users, and the FL training process is performed to solve the following optimization problem:

min𝝎mJ(𝝎m)min𝝎m{1Dm=1Ms=1Dmf(𝝎m,𝐱m,s,ym,s)}.\underset{\bm{\omega}_{m}}{\rm min}\ J(\bm{\omega}_{m})\triangleq\underset{\bm{\omega}_{m}}{\rm min}\left\{\frac{1}{D}\sum_{m=1}^{M}\sum_{s=1}^{D_{m}}f(\bm{\omega}_{m},\bm{x}_{m,s},{y}_{m,s})\right\}. (3)

The FL training process is illustrated in Fig. 1(b), which includes three steps: i) Users train local models: each user UmU_{m} trains the local model 𝝎m\bm{\omega}_{m} based on the local dataset 𝒟m{\cal D}_{m}; ii) Users upload local models: the users upload their trained local models (e.g., 𝝎1,,𝝎m\bm{\omega}_{1},...,\bm{\omega}_{m}) via the RISs-aided wireless links to the edge server; iii) Model aggregation and broadcasting: upon receiving all the uploaded gradients, the edge server aggregates the local updates and generates an updated model, 𝝎G\bm{\omega}_{G}, which is sent back to the requested users and the RIS controllers222Note that, different learning algorithms can be used to update the local FL model, e.g., gradient descent, to update the local FL model. The update of the global model 𝝎G\bm{\omega}_{G} is given by 𝝎G=m=1MDm𝝎mD\bm{\omega}_{G}=\frac{\sum_{m=1}^{M}D_{m}\bm{\omega}_{m}}{D}.. This training procedure is repeated several times until the global CNN model converges.

For each communication round, the uploading of the user’s local FL model (𝝎m\bm{\omega}_{m}) can be considered as a transmission that occurs in one time slot, which may not be recovered correctly at the edge server due to the impact of the wireless channel between the users and the edge server, especially when the wireless channel undergoes deep fading due to the presence of obstacles. In this case, the local FL model parameters cannot be used for the aggregation at the edge server. To improve the quality of the global model that is aggregated at the edge server, the users can upload their local model parameters with the aid of RISs333Note that the user-RIS association may need to be updated at the beginning of each FL round by using the proposed user-RIS association algorithm..

Therefore, the aggregated FL model at a considered iteration in the proposed FSL framework is

𝝎G=m=1MDmα~m𝝎mQ(𝝎m)m=1MDmα~mQ(𝝎m).\bm{\omega}_{G}=\frac{\sum_{m=1}^{M}D_{m}\widetilde{\alpha}_{m}\bm{\omega}_{m}Q(\bm{\omega}_{m})}{\sum_{m=1}^{M}D_{m}\widetilde{\alpha}_{m}Q(\bm{\omega}_{m})}. (4)

We suppose that the cooperative prediction accuracy of the FL model at a considered iteration is η\eta. We introduce a binary variable αm{\alpha}_{m} for indicating whether the mmth user sends a request or not and let α~m\widetilde{\alpha}_{m} be the inferred value of αm{\alpha}_{m}, so we have

α~m{=αm,withprobabilityη,αm,withprobability 1η.\widetilde{\alpha}_{m}\begin{cases}=\alpha_{m},\ \ {\rm with\ probability}\ \eta,\\ \neq\alpha_{m},\ \ {\rm with\ probability}\ 1-\eta.\end{cases} (5)

Moreover, the binary variable Q(𝝎m)Q(\bm{\omega}_{m}) in (4) indicates that the local model received at the edge server can be recovered correctly or not, which is given by

Q(𝝎m)={1,withprobabilityp,0,withprobability 1p.Q(\bm{\omega}_{m})=\begin{cases}1,\ \ {\rm with\ probability}\ p,\\ 0,\ \ {\rm with\ probability}\ 1-p.\end{cases} (6)

In (6), p=Pr{γmγT}p={\rm{Pr}}\left\{\gamma_{m}\geq\gamma_{T}\right\} indicates the probability that 𝝎m\bm{\omega}_{m} is received correctly at the BS, and 1p1-p otherwise. γm\gamma_{m} denotes the received SNR of UmU_{m} and γT\gamma_{T} is an SNR threshold. For instance, Q(𝝎m)=0Q(\bm{\omega}_{m})=0 indicates that the received local FL model parameter cannot be correctly received, otherwise, Q(𝝎m)=1Q(\bm{\omega}_{m})=1.

II-E An Intuitive Example

Different from the conventional FL procedure that is usually subject to the wireless bandwidth for model parameters uploading, the proposed RIS-aided FSL framework aims at improving FL performance by achieving wireless spectrum learning at the RIS controllers. Here, we consider an intuitive application scenario - the coexistence of multiple wireless systems, in which the wireless spectrum learning problem must be appropriately designed and addressed. Specifically, we suppose that two different wireless systems, such as WiFi and LTE-U systems, share the same unlicensed band and there exists interference between the two systems. To coordinate a fair share of the spectrum without causing undesired interference, improved wireless spectrum sensing and signal identification to detect spectrum users are needed [6]. However, traditional power estimation and spectrum sensing can only detect whether the spectrum is occupied or not as in energy detection. To address this issue, the proposed FSL framework achieves appropriate wireless resources coordination of the two systems via RISs-enabled cooperative spectrum sensing, where the CNN model deployed at the RIS controllers for RF spectrum learning is trained via FL.

An intuitive example with two system users (denoted by 𝐔={U1,U2}{\bf U}=\{U_{1},U_{2}\}) and two RISs is considered, where U1U_{1} is a WiFi user and U2U_{2} is a LTE-U user. A CNN model is trained via the proposed FSL framework and then deployed at each RIS controller to learn the features of RF traces. In particular, upon receiving the superimposed incident signals at each RIS, the well-trained CNN infers the set of requested users by performing feed-forward calculation. Since each user has a binary state, i.e., ‘active’ and ‘inactive’, in this case, there exist four combinations (i.e., classes) of signals from the perspective of each RIS:

  • Class-1: Idle. This indicates that both U1U_{1} and U2U_{2} are inactive, so the collected RF traces include only the noise.

  • Class-2: Only U1{U_{1}}. This indicates that only U1U_{1} is active, so the collected RF traces include only U1U_{1}.

  • Class-3: Only U2{U_{2}}. This indicates that only U2U_{2} is active, so the collected RF traces include only U2U_{2}.

  • Class-4: U1+U2{U_{1}\!+\!U_{2}}. This indicates that both U1U_{1} and U2U_{2} are active, so the collected RF traces include U1U_{1} and U2U_{2}.

Via inference, each RIS controller identifies the composition of the superimposed incident RF signals and sends the inferred result to the BS via a dedicated channel for data fusion. Note that the spectrum identification in the considered example boils down to a four-class classification problem. According to the inferred result, the BS can coordinate spectrum resources between the two systems appropriately. Also, according to the allocated resources, the requested users upload their local trained models to the BS via RISs-aided wireless links.

III System Model and Problem Formulation

III-A RIS-Aided Wireless Communication Model

By leveraging the presence of RISs, the users can upload the local gradients via the RIS-assisted wireless uplinks more reliably. For the local uploading of the model parameters, we consider an orthogonal-access schemes such as orthogonal frequency division multiple access (OFDMA) in an synchronous manner. We suppose that each RIS, denoted as RkR_{k}, k𝒦k\in{\cal K}, is equipped with NkN_{k} reflecting elements, which can be appropriately configured by the RIS controller to reflect the associated user’s signal effectively towards the BS through non-overlapping frequency band. In general, the RISs can be appropriately deployed so that line-of-sight (LoS) links can be established between them and the BS. Moreover, we assume that the channel state information (CSI) can be perfectly estimated at the BS by sending training symbols at the user and adjusting the reflection states of the RIS according to a predesigned training reflection pattern [42, 43]. Then, the estimated CSI is fed back to the RIS controller via a dedicated channel444Since channel estimation in RISs-aided wireless communications has been widely investigated, it is not explicitly considered in this paper., such as [16, 44]. Note that due to the movement of the mobile users, the received signals are sometimes subject to a multipath fading and Doppler effect, which can be effectively eliminated and/or mitigated by real-time tuneable RISs [45].

As for RkR_{k}, the amplitude reflection coefficient is assumed to be equal to one for all the NkN_{k} reflecting elements, so the phase reflection matrix is denoted by

𝚽k=diag(ejθ1k,ejθ2k,,ejθNkk),\mathbf{\Phi}_{k}={\rm{diag}}\left(e^{j\theta_{1}^{k}},e^{j\theta_{2}^{k}},...,e^{j\theta_{N_{k}}^{k}}\right), (7)

where 𝜽k=(θ1k,θ2k,,θNkk){\bm{\theta}}_{k}=\left(\theta_{1}^{k},\theta_{2}^{k},...,\theta_{N_{k}}^{k}\right) denotes the vector of phase shifts that need to be optimized.

In the considered FSL framework, the channels from the user UmU_{m} to RkR_{k} and from RkR_{k} to the BS are given by hm,kNk×1\textit{{h}}_{m,k}\in\mathbb{C}^{N_{k}\times 1} and gk1×Nk\textit{{g}}_{k}\in\mathbb{C}^{1\times N_{k}}, respectively. The channel gain of the direct link from UmU_{m} to the BS is denoted by hd,mh_{d,m}. Besides, the channels are assumed to be quasi-static and remain nearly-constant during the transmission [15]. Accordingly, the received local model parameters that are uploaded by the total MM users at the BS include the signals via the direct links and the links reflected by the RIS and the white Gaussian noise, i.e.,

z=m(hd,m+k𝒦rm,kgk𝚽khm,k)pmzm+𝒏,{z}=\sum_{m\in{\cal M}}\left(h_{d,m}+\sum_{k\in{\cal K}}r_{m,k}\ \textit{{g}}_{k}\mathbf{\Phi}_{k}\textit{{h}}_{m,k}\right)\sqrt{p_{m}}z_{m}+\bm{n}, (8)

where pmp_{m} denotes the transmit power of UmU_{m}, zmz_{m} is the unit-power information signals sent from UmU_{m}, and 𝒏=[n1,n2,,nM]T\bm{n}=[n_{1},n_{2},...,n_{M}]^{\rm T} denotes the white Gaussian noise vector.

Besides, the user-RIS association matrix 𝑹{\bm{R}} with dimension of K×M{K\times M} is given by

𝑹=[r1,1r1,2r1,Kr2,1r2,2r2,KrM,1rM,2rM,K],{\bm{R}}=\begin{bmatrix}r_{1,1}&r_{1,2}&\cdots\ &r_{1,K}\\ r_{2,1}&r_{2,2}&\cdots\ &r_{2,K}\\ \vdots&\vdots&\ddots&\vdots\\ r_{M,1}&r_{M,2}&\cdots\ &r_{M,K}\\ \end{bmatrix},

where rm,k{0,1}r_{m,k}\in\{0,1\}, rm,k=1r_{m,k}=1 indicates that RkR_{k} is allocated to UmU_{m}, and rm,k=0r_{m,k}=0, otherwise. We assume that only one RIS can be allocated to one user at most, so we have mrm,k1,k𝒦\sum_{m\in{\cal M}}r_{m,k}\leq 1,\ \forall k\in{\cal K}.

In conventional RIS-aided communication systems, it is known that each RIS reflects all the incident electromagnetic waves, and will steer them towards reflecting directions that depend on the direction of incidence and the phase shifts applied by the RIS elements. To achieve user-RIS association in the proposed FSL framework, we introduce Assumption 2.

Assumption 2.

Compared with the desired reflected signal, the interference power caused by the reflections via the remaining RISs on non-overlapping frequency bands are relatively low, which can be ignored [46]. Therefore, in this paper, we assume that each user will be associated with a certain RIS via a non-overlapping frequency band.

Therefore, the SNR at the BS for user UmU_{m} is given by

γm=pm|hd,m+k=1Krm,kgk𝚽khm,k|2Bm𝒩0,\gamma_{m}=\frac{{p_{m}}\left|h_{d,m}+\sum_{k=1}^{K}r_{m,k}\textit{{g}}_{k}\mathbf{\Phi}_{k}\textit{{h}}_{m,k}\right|^{2}}{B_{m}{\cal N}_{0}}, (9)

where BmB_{m} denotes the bandwidth allocated to UmU_{m}, and 𝒩0{\cal N}_{0} indicates the noise power spectral density.

Suppose that the total bandwidth between the users and the BS is BB, and let 𝜷={β1,β2,,βM}{\bm{\beta}}\!=\!\{\beta_{1},\beta_{2},...,\beta_{M}\} denote the wireless bandwidth allocation vector, so we have Bm=βmBB_{m}=\beta_{m}B and m=1Mβm1\sum_{m=1}^{M}\beta_{m}\!\leq\!1. Based on (9), the achievable data rate of UmU_{m} can be obtained as

ϕm=βmBlog2(1+pm|hd,m+k=1Krm,kgk𝚽khm,k|2βmB𝒩0).\phi_{m}\!=\!{\beta}_{m}B{\rm log}_{2}\!\left(\!1\!+\!\frac{{p_{m}}\!\left|\!h_{d,m}\!+\!\sum_{k\!=\!1}^{K}r_{m,k}\textit{{g}}_{k}\mathbf{\Phi}_{k}\textit{{h}}_{m,k}\!\right|^{2}\!}{{\beta}_{m}B{\cal N}_{0}}\!\right)\!. (10)

III-B FL Latency Model

III-B1 Latency for Local Model Training

Each user, Um,mU_{m},\forall m\in\cal M, independently trains the local model based on the available local data samples (𝒟m{\cal D}_{m}) with size sms_{m} (bits). Let θ[0,1]\theta\in[0,1] be the accuracy for the local FL model training. The computation time, in general, depends on the number of local iterations, which is upper bounded by 𝒪(log(1/θ)){\cal O}({\rm log}(1/\theta)) for different kinds of iterative algorithms [47]. In the following, we use this upper bound to approximate the number of iterations needed for the local computations by each user. Specifically, we introduce a positive constant vv that depends on the data size, and we denote the time of one local iteration of UmU_{m} by tcmpmt^{m}_{cmp}, so the upper bound of the computation time in one global iteration is

tGmpm=vlog(1/θ)tcmpm.t^{m}_{Gmp}=v{\rm log}(1/\theta)t^{m}_{cmp}. (11)

Since the computation delay (tcmpmt^{m}_{cmp}) mainly depends on the user computing capability (i.e., the on-board chip CPU) and the size of data samples, for the user UmU_{m}, we denote by cmc_{m} the number of CPU cycles to calculate the gradient with respect to one bit for each local iteration (cycles per bit), and by fmf_{m} the CPU frequency of UmU_{m} (cycles per second). Therefore, the local computing delay of UmU_{m} is calculated as

tcmpm=cmsmfm,m.t^{m}_{cmp}=\frac{c_{m}s_{m}}{f_{m}},\ \ \forall m\in\cal M. (12)

Substituting (12) into (11), the computation delay of the local FL model training in one global iteration is

tGmpm=vlog(1/θ)cmsmfm.t^{m}_{Gmp}=v{\rm log}(1/\theta)\frac{c_{m}s_{m}}{f_{m}}. (13)

III-B2 Latency for Local Model Uploading

After training the local FL model, all the users upload their model parameters to the BS via frequency domain-based multiple access, e.g., OFDMA. Given the uplink data rate in (10), the delay of uploading the local FL model parameters from UmU_{m} to the BS via RISs-aided uplink is

tComm\displaystyle t^{m}_{Com} =z(𝝎m)βmBlog2(1+γm)\displaystyle=\!\frac{z(\bm{\omega}_{m})}{{\beta}_{m}B{\rm log}_{2}\!\left(\!1\!+\!\gamma_{m}\right)} (14)
=z(𝝎m)βmBlog2(1+pm|hd,m+k=1Krm,kgk𝚽khm,k|2βmB𝒩0),\displaystyle=\!\frac{z(\bm{\omega}_{m})}{{\beta}_{m}B{\rm log}_{2}\!\left(\!1\!+\!\frac{{p_{m}}\left|h_{d,m}\!+\!\sum_{k=1}^{K}r_{m,k}\textit{{g}}_{k}\mathbf{\Phi}_{k}\textit{{h}}_{m,k}\!\right|^{2}\!}{{\beta}_{m}B{\cal N}_{0}}\right)},

where z(𝝎m)z(\bm{\omega}_{m}) indicates the data size (number of bits) of the local FL model that is sent from UmU_{m}.

III-B3 Latency for Global Model Broadcasting

In this step, the BS aggregates the received local FL models to a global FL model. Then the BS broadcasts the global FL model parameters to the users and the RIS controllers. Since the data rate of the wireless downlinks could be relatively large due to the high transmission power of the BS and the large available bandwidth, the model broadcasting latency is neglected555This is a common assumption also made by other works such as [47].. Note that this paper considers the synchronous aggregation case, so the edge server needs to wait for the local FL model gradients from of all the users before the global aggregation can take place. This leads to the so-called straggler’s effect issue, i.e., each training iteration only progresses as fast as the slowest user.

Based on the above analysis, we define and compute the completion latency for one FL global iteration. Consider an arbitrary communication round, the completion latency, denoted as TT, is composed of two parts: the local training latency and the wireless uploading latency. Since all the local FL model parameters need to be uploaded to the BS to perform aggregation at each iteration, the completion latency of one global iteration is calculated as

T\displaystyle T =maxm{tGmpm+tComm}\displaystyle=\underset{m\in{\cal M}}{\rm max}\left\{t^{m}_{Gmp}+t^{m}_{Com}\right\} (15)
=maxm{vlog(1/θ)cmsmfm+z(𝝎m)βmBlog2(1+γm)},\displaystyle=\underset{m\in{\cal M}}{\rm max}\left\{v{\rm log}(1/\theta)\frac{c_{m}s_{m}}{f_{m}}+\frac{z(\bm{\omega}_{m})}{{\beta}_{m}B{\rm log}_{2}\!\left(\!1\!+\!\gamma_{m}\right)}\right\},

where γm\gamma_{m} is given by (9).

III-C Problem Formulation

Having defined the latency model in the previous section, the problem is formulated to maximize the number of correctly received parameters of the local FL model per unit time at each iteration. Here, we define a metric for evaluating the FL performance at each iteration, called FL system utility, which is calculated as the ratio between the total number of correctly received local FL model parameters at the BS and the total delay at the considered iteration, i.e.,

ξ\displaystyle\xi QT=m=1MQ(𝝎m)maxm{tGmpm+tComm},\displaystyle\triangleq\frac{\rm Q}{T}=\frac{\sum_{m=1}^{M}Q(\bm{\omega}_{m})}{\underset{m\in{\cal M}}{\rm max}\left\{t^{m}_{Gmp}+t^{m}_{Com}\right\}}, (16)

where the binary variable Q(𝝎m)=1Q(\bm{\omega}_{m})=1 indicate that the local FL model parameter is correctly received at the BS, otherwise, Q(𝝎m)=0Q(\bm{\omega}_{m})=0.

In this paper, the objective is to maximize the FL system utility (𝚯={𝜽1,𝜽2,,𝜽K}T{\bm{\Theta}}=\{{\bm{\theta}}_{1},{\bm{\theta}}_{2},...,{\bm{\theta}}_{K}\}^{\rm T}) by jointly optimizing the RIS allocation matrix (𝑹{\bm{R}}), the wireless bandwidth activation vector (𝜷{\bm{\beta}}), and the phase shifts matrix of the RISs whose size is K×N{K\times N}666For simplicity, we assume that each RIS has the same number of reflecting elements, i.e., N=Nk1=Nk2N=N_{k_{1}}=N_{k_{2}}, where k1k2k_{1}\neq k_{2}.. To this end, a joint RIS phase shifts, user-RIS association and bandwidth allocation problem can be formulated as follows:

:\displaystyle\mathbb{P}: max{𝑹,𝚯,𝜷}ξ\displaystyle\;\;\;\;\underset{\{{\bm{R}},{\bm{\Theta}},{\bm{\beta}}\}}{\rm max}\;\;\xi (17)
s.t.rm,k{0,1},m,k𝒦,\displaystyle\;\;\;\;\;{\rm{s}}{\rm{.t}}{\rm{.}}\;\;r_{m,k}\in\left\{0,1\right\},\ \forall m\in{\cal M},\ \forall k\in{\cal K}, (17a)
m=1Mrm,k1,k𝒦,\displaystyle\;\;\;\;\;\;\;\;\;\;\;\sum_{m=1}^{M}r_{m,k}\leq 1,\ \forall k\in{\cal K}, (17b)
γmkγT,m,\displaystyle\;\;\;\;\;\;\;\;\;\;\;\;\gamma_{m}^{k}\geq\gamma_{T},\ \forall m\in{\cal M}, (17c)
|ejθnk|=1,n[1,Nk],k𝒦,\displaystyle\;\;\;\;\;\;\;\;\;\;\;\left|e^{j\theta_{n}^{k}}\right|=1,\ \forall n\in[1,N_{k}],\ \forall k\in{\cal K}, (17d)
m=1Mβm1.\displaystyle\;\;\;\;\;\;\;\;\;\;\;\sum_{m=1}^{M}\beta_{m}\leq 1. (17e)

In (17a), the binary value rm,k=1r_{m,k}=1 indicates that RkR_{k} is allocated to UmU_{m}, and rm,k=0r_{m,k}=0, otherwise. (17b) indicates that at most one RIS can be allocated to a user at a time. (17c) indicates that the achievable SNR needs to be larger than a threshold. (17d) indicates that each RIS reflecting element can only provide a phase shift θnk[0,2π)\theta_{n}^{k}\in[0,2\pi) without amplifying the signals. Finally, (17e) indicates that the sum of the wireless bandwidths that are allocated to the users cannot exceed the total bandwidth.

IV Joint Optimization of RISs Configurations and Wireless Bandwidth Allocation

We observe that the formulated problem in (17) is a mixed-integer nonlinear programming (MINLP), which is NP-hard and the globally optimal solution is, in general, difficult to obtain [48]. Specifically, due to the limited number of RISs available in practice, only a subset of users may be allowed to upload, at each iteration, their local FL model parameters to the BS with the aid of RISs. Moreover, since the data samples of each user are usually non-independent and identically distributed (non-IID), the BS generally prefers to include more users’ FL models to generate a converged FL model. Hence, the FL performance will be significantly affected by the user-RIS association and the wireless bandwidth allocation.

In the following, we decompose the original problem into two subproblems, which are then solved independently.

IV-A Problem Decomposition and Transformation

By exploiting the structure of the objective function and its constraints, we observe that the original problem in (17) has a high complexity. By using the Tammer decomposition method, we decompose the original problem into two subproblems with separated objective and constraints without changing the optimality of the solutions [49].

First, we rewrite the original problem as an equivalent problem:

~:\displaystyle\widetilde{\mathbb{P}}: max𝜷(max{𝐑,𝚯}ξ)\displaystyle\ \underset{\bm{\beta}}{\rm max}\ \left(\underset{\{{\bm{R}},{\bm{\Theta}}\}}{\rm max}\ \xi\right) (18)
s.t.(17a)(17e).\displaystyle{\rm{s}}{\rm{.t}}{\rm{.}}\;\;\;(\ref{problem}a)-(\ref{problem}e).

To solve the equivalent problem ~\widetilde{\mathbb{P}}, we further decompose it into two subproblems, as illustrated in Remark 1.

Remark 1.

Solving ~\widetilde{\mathbb{P}} is equivalent to solving two subproblems: i) the user-RIS association subproblem while keeping fixed the bandwidth allocation vector so as to maximize the number of correctly received local FL models, i.e.,

1:Q=max{𝑹,𝚯}Q\displaystyle\mathbb{P}_{1}:\ {\rm Q}^{*}=\underset{\{{\bm{R}},{\bm{\Theta}}\}}{\rm max}\;{\rm Q} (19)
s.t.(17a)(17d),\displaystyle{\rm{s}}{\rm{.t}}{\rm{.}}\;\;\;(\ref{problem}a)-(\ref{problem}d),

and, ii) the bandwidth allocation subproblem while assuming given the optimal user-RIS association to maximize the FL system utility, i.e.,

2:max𝜷ξ\displaystyle\mathbb{P}_{2}:\ \underset{\bm{\beta}}{\rm max}\;\xi^{*} (20)
s.t.(17e),\displaystyle{\rm{s}}{\rm{.t}}{\rm{.}}\;\;\;(\ref{problem}e),

where ξ=Q/T\xi^{*}={\rm Q^{*}}/{T}.

Since Q{\rm Q}^{*} in 2\mathbb{P}_{2} can be obtained by solving 1\mathbb{P}_{1}, 2\mathbb{P}_{2} can be rewritten as the bandwidth allocation subproblem (~2\widetilde{\mathbb{P}}_{2}) to minimize the FL training latency:

~2:min𝜷max{tGmpm+tComm}\displaystyle\widetilde{\mathbb{P}}_{2}:\ \underset{\bm{\beta}}{\rm min}\;{\rm max}\left\{t^{m}_{Gmp}+t^{m}_{Com}\right\} (21)
s.t.(17e).\displaystyle{\rm{s}}{\rm{.t}}{\rm{.}}\;\;\;(\ref{problem}e).

Before solving the subproblem 1\mathbb{P}_{1} in (19), Observation 1 is presented as follows.

Observation 1.

We observe from (19) that the optimal value of 𝚯{\bm{\Theta}} is the one that maximizes the channel gain via RISs, i.e., |hd,m+k=1Krm,kgk𝚽khm,k|2\left|h_{d,m}+\sum_{k=1}^{K}r_{m,k}\textit{{g}}_{k}\mathbf{\Phi}_{k}\textit{{h}}_{m,k}\right|^{2}. With this in mind, the optimal solution of 1\mathbb{P}_{1} can be obtained in two steps: obtaining the optimal value of 𝚯{\bm{\Theta}} that maximizes the channel gain in the first-step, and then calculating the optimal user-RIS association matrix in the second-step.

IV-B First-step: RISs Phase Shift Configuration

We first optimize the phase shift vector 𝚯{\bm{\Theta}} of problem 1\mathbb{P}_{1} in (19), where rm,k=1r_{m,k}=1. Accordingly, the optimal value of 𝚯{\bm{\Theta}} can be calculated by solving the following problem:

max𝚯|hd,m+gk𝚽khm,k|2\displaystyle\underset{{\bm{\Theta}}}{\rm max}\;{\left|h_{d,m}+\textit{{g}}_{k}\mathbf{\Phi}_{k}\textit{{h}}_{m,k}\right|^{2}} (22)
s.t.(17d).\displaystyle{\rm{s}}{\rm{.t}}{\rm{.}}\;\;\;(\ref{problem}d).

According to the triangle inequality, we have

|hd,m+gk𝚽khm,k||hd,m|+|gk𝚽khm,k|,{\left|h_{d,m}+\textit{{g}}_{k}\mathbf{\Phi}_{k}\textit{{h}}_{m,k}\right|}\leq{\left|h_{d,m}\right|}+{\left|\textit{{g}}_{k}\mathbf{\Phi}_{k}\textit{{h}}_{m,k}\right|}, (23)

where the equality holds when arg(hd,m)=arg(gk𝚽khm,k){\rm arg}\left(h_{d,m}\right)={\rm arg}\left(\textit{{g}}_{k}\mathbf{\Phi}_{k}\textit{{h}}_{m,k}\right) is fulfilled777This suggests that the phase of the signal reflected through the user-RIS-BS links is aligned with that of the user-BS direct link..

We let 𝒖k𝒗kgk𝚽khm,k{\bm{u}}_{k}{\bm{v}}_{k}\triangleq\textit{{g}}_{k}\mathbf{\Phi}_{k}\textit{{h}}_{m,k}, where,

𝒖k=[ejθ1k,ejθ2k,,ejθNkk]1×Nk,{\bm{u}}_{k}=\left[e^{j\theta_{1}^{k}},e^{j\theta_{2}^{k}},...,e^{j\theta_{N_{k}}^{k}}\right]\in\mathbb{C}^{1\times N_{k}},
𝒗k=diag(gk)hm,kNk×1.{\bm{v}}_{k}={\rm diag}(\textit{{g}}_{k})\textit{{h}}_{m,k}\in\mathbb{C}^{N_{k}\times 1}.

Then the problem in (22) is equivalent to:

max𝒖k|𝐮k𝐯k|2\displaystyle\;\;\;\;\;\;\;\;\underset{{\bm{u}}_{k}}{\rm max}\;{\left|{\bm{u}}_{k}{\bm{v}}_{k}\right|^{2}} (24)
s.t.|ukn|=1,n[1,Nk],k𝒦,\displaystyle{\rm{s}}{\rm{.t}}{\rm{.}}\;\;\;\left|{u}_{k}^{n}\right|=1,\ \forall n\in[1,N_{k}],\ \forall k\in{\cal K}, (24a)
arg(𝒖k𝒗k)=arg(hd,m),m,k𝒦.\displaystyle\;\;\;\;\;\;\;\;{\rm arg}\left({\bm{u}}_{k}{\bm{v}}_{k}\right)={\rm arg}\left(h_{d,m}\right),\ \forall m\in{\cal M},\forall k\in{\cal K}. (24b)

We observe that the optimal solution to the problem in (24) is 𝒖k=ej(arg(hd,m)arg(diag(gk)hm,k)){\bm{u}}_{k}^{*}=e^{j({\rm arg}\left(h_{d,m}\right)-{\rm arg}\left({\rm diag}(\textit{{g}}_{k})\textit{{h}}_{m,k}\right))}. Therefore, the nnth phase shift of the kkth RIS is calculated as

θnk=arg(hd,m)arg(gk)arg(hm,k),\theta_{n}^{k*}={\rm arg}\left(h_{d,m}\right)-{\rm arg}\left(\textit{g}_{k}\right)-{\rm arg}\left(\textit{h}_{m,k}\right), (25)

where gkn\textit{g}^{n}_{k} and hm,kn\textit{h}_{m,k}^{n} are the nnth element of gk\textit{{g}}_{k} and hm,k\textit{{h}}_{m,k}, respectively.

As a result, we have 𝜽k=(θ1k,θ2k,,θNkk){\bm{\theta}}_{k}^{*}=\left(\theta_{1}^{k*},\theta_{2}^{k*},...,\theta_{N_{k}}^{k*}\right). The optimal phase shifts matrix of the RISs is obtained as 𝚯={𝜽1,𝜽2,,𝜽K}T{\bm{\Theta}^{*}}=\{{\bm{\theta}}_{1}^{*},{\bm{\theta}}_{2}^{*},...,{\bm{\theta}}_{K}^{*}\}^{\rm T}. Having the optimal RISs phase shifts, we move to the second-step to compute the optimal user-RIS association via matching theory.

IV-C Second-step: User-RIS Association

Via the aggregated global FL model, each RIS controller infers the set of requested users at each iteration and then sends the estimated result to the BS. Based on the fusion result, the user-RIS association can be optimized. To tackle the combinatorial problem, we apply matching theory to map the user-RIS association subproblem into a matching game.

Specifically, we denote the set of the requested users whose signals over the direct links cannot be correctly received as {\cal M}^{\prime}, where {\cal M}^{\prime}\subseteq\cal M. Denote the total number of the requested users within {\cal M}^{\prime} as MM^{\prime}. We solve the user-RIS association subproblem in two cases: MKM^{\prime}\leq K (case-1) and M>KM^{\prime}>K (case-2). For these two cases, we first formulate the user-RIS association as a two-sided matching game, followed by the definition of the utility. Then, we present a multi-granularity based matching algorithm to achieve a stable matching.

Case-1: User-RIS Association via One-to-One Matching

In Case-1, the number of RISs is no smaller than the number of users in {\cal M}^{\prime}, i.e., KMK\geq{M}^{\prime}. In this case, each user can be served by one RIS at a time.

IV-C1 Matching Game Formulation

In this multiple-RISs matching game, we consider that each user can only be associated with one RIS and each RIS can only serve one user at a time, i.e., the constraint (17b). Thus, this matching game is a one-to-one matching for user-RIS association. Since the goal of matching theory is to optimally match elements of two different sets, in our case the users set {\cal M} and the RISs set 𝒦{\cal K}, by taking into account their individual preferences, as illustrated in Definition 1.

Definition 1.

Let {\cal M} and 𝒦{\cal K} be two sets of players, the matching game is given by the tuple (,𝒦,,𝒦)({\cal M},{\cal K},\succ_{\cal M},\succ_{\cal K}). Here, {m}m\succ_{\cal M}\triangleq\{\succ_{m}\}_{m\in\cal M} and 𝒦{k}k𝒦\succ_{\cal K}\triangleq\{\succ_{k}\}_{k\in\cal K} are defined as the set of preference relations of users and RISs, respectively.

More in depth, a matching game produces a matching function μ\mu, which is defined in Definition 2.

Definition 2.

A matching function μ\mu is defined by a function from the set 𝒦{\cal M}\cup{\cal K} into the set of elements of 𝒦{\cal M}\cup{\cal K} such that m=μ(k)m=\mu(k) if and only if k=μ(m)k=\mu(m).

From Definition 2, it is observed that the matching function μ()\mu(\cdot) defines a relation from a given user of the set \cal M to a given RIS of the set 𝒦\cal K on the basis of preference relations. It is noteworthy that the preference relations (e.g., ,𝒦\succ_{\cal M},\succ_{\cal K}) denote the level of satisfaction of the player of one set (e.g., the user set \cal M) in being matched with the player of the other set (e.g., the RISs set 𝒦\cal K) and vice versa.

IV-C2 Preference Lists of Users and RISs

In the proposed game, the matching is performed by the set of users and the set of RISs using preference lists. For each player, the preference list is used to rank the players of the other set. Generally, the preferences between players belonging to the two sets are formed on the basis of the evaluation of preference functions, as defined as below.

Definition 3.

Let 𝒰m(k){\cal U}_{m}(k) and 𝒰k(m){\cal U}_{k}(m) be the preference functions of the user mm and the RIS kk, respectively. We write 𝒰m(k1)>𝒰m(k2){\cal U}_{m}(k_{1})>{\cal U}_{m}(k_{2}) if the user mm prefers the RIS k1k_{1} to the RIS k2k_{2}, and thus this situation can be given by k1mk2k_{1}\succ_{m}k_{2}. Similarly, m1km2m_{1}\succ_{k}m_{2} indicates that the RIS kk prefers the user m1m_{1} to the user m2m_{2}, and thus 𝒰k(m1)>𝒰k(m2){\cal U}_{k}(m_{1})>{\cal U}_{k}(m_{2}) holds.

In the following, we describe in detail the preference functions 𝒰m(k){\cal U}_{m}(k) and 𝒰k(m){\cal U}_{k}(m), respectively.

  • Preference function of user mm: The preference function of user mm, 𝒰m(k){\cal U}_{m}(k), is evaluated by considering the achievable channel gains of the communication links between the user mm and the RIS kk with NkN_{k} elements, i.e.,

    𝒰m(k)=n=1Nk|hm,kn|,m,k𝒦.{\cal U}_{m}(k)=\sum_{n=1}^{N_{k}}|h^{n}_{m,k}|,\ \forall m\in{\cal M},\forall k\in{\cal K}. (26)

    The intuition for this preference function comes from the objective of the users, i.e., maximization of their achievable gain via the RIS k,k𝒦k,\forall k\in\cal K. Hence, based on (26), the generic user mm ranks all the RISs in a descending order of the expected SNR, so as to construct its preference list represented by m{\cal L}_{m}. Therefore, an RIS k1𝒦k_{1}\in\cal K that achieves a higher preference value (consequently the SNR achieved through the more preferred RIS is higher) based on (26) will be preferred over an RIS k2𝒦k_{2}\in\cal K by the user mm, i.e., k1mk2k_{1}\succ_{m}k_{2}. We note that channel gain between the user mm and the RIS kk (i.e., 𝒉m,k{\bm{h}}_{m,k}) can be estimated by the BS and sent back to the user.

  • Preference function of RIS kk: Likewise, the generic RIS kk also needs to generate a preference list that ranks the users according to its preference function, i.e.,

    𝒰k(m)=max(γmkγT, 0),m,k𝒦,{\cal U}_{k}(m)\!=\!{\rm max}\left(\gamma_{m}^{k}-\gamma_{T},\ 0\right),\ \forall m\in{\cal M}^{\prime},\forall k\in{\cal K}, (27)

    where {\cal M}^{\prime} is selected from the users in {\cal M} with γmd<γT{\gamma_{m}^{d}<\gamma_{T}}, so {\cal M}^{\prime}\subseteq\cal M holds. γmd=pm|hd,m|2βmB𝒩0\gamma_{m}^{d}=\frac{{p_{m}}\left|h_{d,m}\right|^{2}}{{\beta}_{m}B{\cal N}_{0}} is the SNR of the user mm via the direct link. According to this preference function, the RIS kk only gives preference to the users that belong to \cal M^{\prime} and gives more preference to a user mm\in\cal M^{\prime}, that results in a larger improvement of the SNR. Additionally, the users that violate (17d) receive a ‘zero’ preference value and thus are ranked at the bottom of the preference list. The users whose SNR via the RIS kk that do not exceed the SNR threshold γT\gamma_{T} will not be preferred by the RIS kk. By doing this, the constructed preference list of the RIS kk represented by k{\cal L}_{k}.

IV-C3 The Proposed User-RIS Association Algorithm

Based on these considerations, we present the user-RIS association algorithm based on the proposed one-to-one matching game, in order to find a stable matching association, which is defined as follows.

Definition 4.

A matching function μ\mu is stable if there exists no blocking pair (m,k)(m^{\prime},k^{\prime}), where mm^{\prime}\in{\cal M}, k𝒦k^{\prime}\in{\cal K}, such that kmμ(m)k^{\prime}\succ_{m}\mu(m) and mkμ(k)m^{\prime}\succ_{k}\mu(k), where μ(m)\mu(m) and μ(k)\mu(k) represent the current matched players of mm and kk, respectively.

According to Definition 4, we note that a stable solution of the proposed matching game ensures that no matched user would benefit from modifying the assigned RIS kk with a new RIS kk^{\prime}. The output of the proposed user-RIS association algorithm is the RISs allocation matrix 𝑹\bm{R} that maximizes the objective of the optimization problem 1\mathbb{P}_{1}. The pseudocode is given in Algorithm 1, which is guaranteed to converge to a stable matching via the well-known deferred acceptance algorithm.

The proposed algorithm is performed to ensure as the final result that the users are associated with the appropriate RISs. The matching procedure begins after the completion of the initialization, including the wireless channel estimation to achieve the CSI among the users, the RISs, and the BS. The estimated CSI can be used to calculate the preference function via (26) and (27), respectively. So each user that is interested in the user-RIS association can estimate the achievable SNR toward each possible RIS.

0:  pmp_{m}, hd,mh_{d,m}, 𝒉m,k{\bm{h}}_{m,k}, 𝒈k{\bm{g}}_{k}, 𝚽k\mathbf{\Phi}_{k}, γT\gamma_{T}, 𝒩0{\cal N}_{0}, t=1t=1, μ(1){μ(k)(1),μ(m)(1)}k𝒦,m=Ø\mu^{(1)}\triangleq\{\mu(k)^{(1)},\mu(m)^{(1)}\}_{k\in{\cal K},m\in{\cal M}}=\O; 1:  for user mm\in\cal M, constructs its preference list on all RISs according to (26), denoted as m{\cal L}_{m}; 2:  end for 3:  for RIS k𝒦k\in\cal K, constructs its preference list on all users according to (27), denoted as k{\cal L}_{k}; 4:  end for 5:  repeat: 6:    tt+1t\leftarrow t+1; 7:    for mm\in\cal M, proposes kk according to m{\cal L}_{m} do 8:        if γmk>γT\gamma_{m}^{k}>\gamma_{T} then 9:           RIS kk checks its preference list k{\cal L}_{k}; 10:          if mkμ(k)(t)m\succ_{k}\mu(k)^{(t)} then 11:             μ(k)(t)m\mu(k)^{(t)}\leftarrow m; 12:          else mm is rejected; 13:        else mm is rejected; 14:    end for 15:  until μ(t)=μ(t1)\mu^{(t)}=\mu^{(t-1)}. 115:  μ(t)\mu^{(t)}.
Algorithm 1 User-RIS Association Algorithm for One-to-one Matching

During the one-to-one matching, each unassigned user mm and RIS kk constructs their preference lists according to (26) and (27), respectively (lines 1-4 in Algorithm 1). As illustrated in lines 7-14 of Algorithm 1, the user mm proposes its most preferred RIS according to m{\cal L}_{m}. If (17d) is violated, the user mm is rejected. Otherwise, the RIS kk checks its preference list k{\cal L}_{k}. If ranked higher than the current match, i.e., mkμ(k)m\succ_{k}\mu(k), the user mm will be accepted. Otherwise, it will be rejected. This one-to-one matching process is carried out iteratively until a stable matching function μ\mu is found between both sets of users and RISs. The matching algorithm will converge when the matching of two consecutive iterations remains unchanged, i.e., μ(t)=μ(t1)\mu^{(t)}=\mu^{(t-1)}.

Case-2: User-RIS Association via One-to-Many Matching

In Case-2, the number of RISs is smaller than the number of users in M{M}^{\prime}, i.e., K<K<{\cal M}^{\prime}, so the elements of each RIS can be divided into multiple groups [50]. In this case, multiple users are allowed to reuse one RIS in such a manner that the association is no longer constrained by (17b), while does not violate the SNR constraint in (17c)888Since the elements within one group are associated with a certain user with an optimized phase shift and reflection amplitude, the impact of signal reflection via other element group mainly depends on the angle of incidence [51], which is ignored in this paper for simplicity.. Thus, this matching game is considered as a one-to-many matching with externalities for the user-RIS association.

The preference function of the user mm, i.e., 𝒰m(k){\cal U}_{m}(k), is defined as

𝒰m(k)=n=1NkR|hm,kn|,m,k𝒦,{\cal U}_{m}(k)=\sum_{n=1}^{N_{k}^{R}}|h^{n}_{m,k}|,\ \forall m\in{\cal M},\forall k\in{\cal K}, (28)

where NkR=NkNkON_{k}^{R}=N_{k}-N_{k}^{O} indicates the number of unoccupied elements of the RIS kk, and NkON_{k}^{O} indicates the number of elements of the RIS kk that have been occupied already.

We denote the number of users associated with the RIS kk as MkM_{k}, and we let the total number of elements of the RIS kk occupied by the associated user mm be nm,kn_{m,k}, which can be calculated by solving the equation γmk=γT\gamma_{m}^{k}=\gamma_{T}. So the number of elements of the RIS kk that are already occupied by the users is NkO=m=1Mknm,k,k𝒦N_{k}^{O}=\sum_{m=1}^{M_{k}}n_{m,k},\ \forall k\in{\cal K}. From NkON_{k}^{O}, NkRN_{k}^{R} can be obtained accordingly.

The preference function of the RIS kk, i.e., 𝒰k(m){\cal U}_{k}(m), is defined as

𝒰k(m)=max𝑖{|i|:γiγT},k𝒦.{\cal U}_{k}(m)\!=\!\underset{i}{\rm max}\left\{|{\cal M}_{i}^{\prime}|:\gamma_{{\cal M}_{i}^{\prime}}\geq\gamma_{T}\right\},\ \forall k\in{\cal K}. (29)
0:  pmp_{m}, hd,mh_{d,m}, 𝒉m,k{\bm{h}}_{m,k}, 𝒈k{\bm{g}}_{k}, 𝚽k\mathbf{\Phi}_{k}, nm,kn_{m,k}, γT\gamma_{T}, 𝒩0{\cal N}_{0}, t=1t=1, μ(1){μ(k)(1),μ(m)(1)}k𝒦,m=Ø\mu^{(1)}\triangleq\{\mu(k)^{(1)},\mu(m)^{(1)}\}_{k\in{\cal K},m\in{\cal M}}=\O; 1:  for user mm\in\cal M, constructs its preference list on all RISs according to (28), denoted as m{\cal L}_{m}; 2:  end for 3:  for RIS k𝒦k\in\cal K, constructs its preference list on all users according to (29), denoted as k{\cal L}_{k}; 4:  end for 5:  repeat: 6:    tt+1t\leftarrow t+1; 7:    for mm\in\cal M, proposes kk according to m{\cal L}_{m} do 8:        if γmk>γT\gamma_{m}^{k}>\gamma_{T} then 9:           RIS kk checks the number of unoccupied elements, NkRN_{k}^{R}; 10:           if NkRnm,kN_{k}^{R}\geq n_{m,k} then 11:             RIS kk accepts the proposal mm; 12:           else RIS kk checks its preference list k{\cal L}_{k}; 13:              if mkμ(k)(t)m\succ_{k}\mu(k)^{(t)} then 14:                μ(k)(t)m\mu(k)^{(t)}\leftarrow m; 15:             else mm is rejected; 16:        else mm is rejected; 17:    end for 18:    𝓇\cal M\leftarrow\cal M_{r}, where 𝓇{\cal M_{r}} is the set including the users that are not associated with RIS yet; 19:     for user mm\in\cal M, updates its preference list on all RISs according to (28); 20:    end for 21:  until μ(t)=μ(t1)\mu^{(t)}=\mu^{(t-1)}. 121:  μ(t)\mu^{(t)}.
Algorithm 2 User-RIS Association Algorithm for One-to-many Matching

According to (29), each RIS chooses a subset of users i{\cal M}_{i}^{\prime}, i{\cal M}_{i}^{\prime}\subseteq{\cal M}^{\prime}, such that the SNR of each user in the subset i{\cal M}_{i}^{\prime} is no smaller than a tolerable SNR threshold γT\gamma_{T}. The preference function defined in (29) aims to maximize the number of elements included in the subset i{\cal M}_{i}^{\prime}, i.e., |i||{\cal M}_{i}^{\prime}|. This allows the users that achieve the highest SNR to be preferred by the RIS kk. Therefore, the subset with the largest number of elements is the most preferred among all the feasible subsets and is ranked accordingly. The user-RIS association algorithm to find a stable matching association for the proposed one-to-many matching game is illustrated in Algorithm 2. Different from the previous one-to-one matching, in the proposed one-to-many matching problem, we have to take into account that the preference list of each user is dependent on the others users’ preferences, as highlighted in Remark 2.

Remark 2.

Due to the externalities in the proposed one-to-many matching problem, the user’s preference of choosing an RIS in (28) is mutually influenced by the number of RIS elements already utilized by other users. As a consequence, the preferences list of each user should be updated upon each association, as shown in lines 18-20 in Algorithm 2.

Then, we have obtained the phase shifts matrix of the RISs (denoted as 𝚯{\bm{\Theta}^{*}}) and the user-RIS association matrix (denoted as 𝑹{\bm{R}}^{*}), from which Q{\rm Q^{*}} can be calculated accordingly. Next, we solve ~2\widetilde{\mathbb{P}}_{2} to minimize the FL latency.

IV-D Bandwidth Allocation for FL Latency Minimization

We solve the subproblem ~2\widetilde{\mathbb{P}}_{2} to minimize the FL latency, as described in Theorem 1.

Theorem 1.

The solution to ~2\widetilde{\mathbb{P}}_{2} is as follows:

βm\displaystyle{\beta}_{m}^{*} =argmin𝜷T\displaystyle={\rm arg\underset{\bm{\beta}}{\rm min}}\ T (30)
=z(𝝎m)Blog2(1+γm)(Tvlog(1/θ)cmsmfm),\displaystyle=\frac{z(\bm{\omega}_{m})}{B{\rm log}_{2}\left(1\!+\!\gamma_{m}\right)\left(T^{*}-v{\rm log}(1/\theta)\frac{c_{m}s_{m}}{f_{m}}\right)},

where γm\gamma_{m} is defined in (9), and TT^{*} denotes the minimal completion latency that satisfies the following conditions:

m=1Mz(𝝎m)Blog2(1+γm)(Tvlog(1/θ)cmsmfm)1.\sum_{m=1}^{M}\frac{z(\bm{\omega}_{m})}{B{\rm log}_{2}\left(1\!+\!\gamma_{m}\right)\left(T^{*}-v{\rm log}(1/\theta)\frac{c_{m}s_{m}}{f_{m}}\right)}\leq 1. (31)
Proof.

In the proposed RIS-assisted FL structure, if the training and uploading of the local FL model of some users is slower than others, the BS will allocate more wireless bandwidth to the slower users to accelerate the FL procedure. As a result, the FL system completion latency can be shortened. Therefore, the optimal bandwidth allocation vector 𝜷\bm{\beta} can be achieved only when all the users finish the training of the local FL model and the wireless uploading at the same time (denoted as TT^{*}), i.e.,

T\displaystyle T =maxm{vlog(1/θ)cmsmfm+z(𝝎m)βmBlog2(1+γm)}\displaystyle=\underset{m\in{\cal M}}{\rm max}\left\{v{\rm log}(1/\theta)\frac{c_{m}s_{m}}{f_{m}}+\frac{z(\bm{\omega}_{m})}{{\beta}_{m}B{\rm log}_{2}\!\left(\!1\!+\!\gamma_{m}\right)}\right\} (32)
T.\displaystyle\triangleq T^{*}.

Substituting βm=βm\beta_{m}=\beta_{m}^{*} into (32), we have

vlog(1/θ)cmsmfm+z(𝝎m)βmBlog2(1+γm)=T.v{\rm log}(1/\theta)\frac{c_{m}s_{m}}{f_{m}}+\frac{z(\bm{\omega}_{m})}{{\beta}_{m}^{*}B{\rm log}_{2}\!\left(\!1\!+\!\gamma_{m}\right)}=T^{*}. (33)

By solving (33), βm\beta_{m}^{*} can be derived as (30). Note that TT^{*} fulfills (31) and can be obtained using the bisection search, e.g., through interval halving or binary search [52]. As a result, βm\beta_{m}^{*} can be calculated accordingly. ∎

In the proposed FSL framework, the deployment of RISs has a twofold contribution: 1) the RIS controllers help detecting the set of requested users in the resource allocation stage, and 2) the RISs can improve the data transmissions in the FL training stage. Based on this, the performance improvement given by deployment of RISs is presented in Theorem 2.

Theorem 2.

For a considered iteration in the proposed FSL framework, let ϵ\epsilon be the prediction accuracy of the FL model, and let KK be the number of RISs. The performance improvement brought by RISs in the first stage is given by χ1=1(1ϵ)Kϵ\chi_{1}=\frac{1-(1-\epsilon)^{K}}{\epsilon}, and the improvement brought by RISs in the second stage is χ2=eκ\chi_{2}=e^{\kappa}, where

κpmβmB𝒩0|k=1Krm,kgk𝚽khm,k|2\displaystyle\kappa\triangleq\frac{{{p_{m}}}}{{\beta}_{m}B{\cal N}_{0}}\left|\sum_{k=1}^{K}r_{m,k}\textit{{g}}_{k}\mathbf{\Phi}_{k}\textit{{h}}_{m,k}\right|^{2}
+2γmdpmβmB𝒩0|k=1Krm,kgk𝚽khm,k|,\displaystyle\;\;\;+\frac{2\sqrt{\gamma_{m}^{d}p_{m}}}{\sqrt{{\beta}_{m}B{\cal N}_{0}}}\left|\sum_{k=1}^{K}r_{m,k}\textit{{g}}_{k}\mathbf{\Phi}_{k}\textit{{h}}_{m,k}\right|,

and γmd=pm|hd,m|2βmB𝒩0\gamma_{m}^{d}=\frac{{p_{m}}\left|h_{d,m}\right|^{2}}{{\beta}_{m}B{\cal N}_{0}}.

Proof.

Please refer to Appendix A. ∎

From Theorem 2, we observe that the performance improvement brought by RISs in the proposed FSL framework is proportional to the number of RISs.

IV-E Feasibility Analysis

In this section, we demonstrate the feasibility of the proposed scheme by clarifying the RIS elements design, analyzing the signaling overhead, storage, as well as quantifying the computation complexity at the RIS controller.

IV-E1 RIS elements design

In our proposed RIS structure design, each RIS consists of two types of elements: the conventional reflecting elements for signal reflection, and the semi-active elements that are used for incident radio frequency (RF) signal processing. To be specific, for the semi-active elements in Fig. 3, only RF front-end, ADC, and down-conversion are required for obtaining I/Q sequences, and baseband processing such as signal decoding is not necessary. Different from the full-active RIS elements design for sensing and reflection [53, 54, 55], our proposed semi-active RIS elements involve lower power consumption and lower hardware complexity.

Refer to caption


Figure 3: RIS-aided spectrum sensing structure with semi-active RIS elements.

The existence of semi-active elements may lead to a loss of signal reflection[56], and thus the ratio/proportion of the semi-active elements need to be carefully chosen. In our case, deterioration of the signal reflection is not an issue since only a very small fraction of semi-active elements is required for obtaining the I/Q sequences without need for the baseband processing of the received RF signal999According to [53], the achievable rate can be maximized with only a small fraction of active elements (1%\% and 7%\% for a high-frequency 28 GHz scenario and for a low-frequency 3.5 GHz scenario). The received signal can also be well recovered by deploying about 10%\% of the sensing elements [55]..

IV-E2 Signaling overhead

Compared to the conventional FL procedure, the additional signaling overhead introduced in the proposed FSL framework includes the overhead for transmitting the CNN inference result and the updated model parameters via a dedicated channel. Due to the relatively small size of inference result and the high transmission power of the BS, the signaling overhead is very low and usually can be neglected.

IV-E3 Storage analysis

Due to the diversity of the input RF I/Q profile, the CNN model needs to be trained for a wide range of SNR to adapt to the dynamic wireless channel. After the FL training, the fully-trained CNN model is stored at each RIS controller for online inference. Since the size of the pre-trained CNN model is relatively small101010Because of the limited computational resources of the RIS controller, the well pre-trained CNN model, e.g., around 2 Mbytes with about 300 thousand parameters [57], can be further quantized and become much smaller, e.g., within the Kbytes range., the CNN model can be even directly cached into the memory of the RIS controller in advanced in order to perform the inference more efficiently.

IV-E4 Computational complexity

To implement the proposed FSL framework, the major computational complexity lies in solving the phase shift optimization problem, the wireless bandwidth allocation problem, user-RIS association, and spectrum sensing via CNN inference.

  • Complexity for solving the phase shift optimization problem at the BS: To calculate the optimal phase shift, the complexity lies in computing 𝒖k=ej(arg(hd,m)arg(diag(gk)hm,k)){\bm{u}}_{k}^{*}=e^{j({\rm arg}\left(h_{d,m}\right)-{\rm arg}\left({\rm diag}(\textit{{g}}_{k})\textit{{h}}_{m,k}\right))} for each RIS element. Denote the total number of elements of all the RISs as J=k=1KNkJ=\sum_{k=1}^{K}N_{k}, where NkN_{k} indicates the number of elements for the kkth RIS. Then, the resulting complexity is 𝒪(J){\cal O}(J).

  • Complexity for solving the wireless bandwidth allocation problem at the BS: By using the bisection search, the complexity lies in checking the feasibility condition (31). Therefore, the computational complexity is 𝒪(Mlog2(1/ϵ)){\cal O}(M{\rm log}_{2}(1/\epsilon)) with accuracy ϵ\epsilon.

  • Complexity for user-RIS association at the RIS controllers: Assume worst case when the preferences of all the users for all the RISs are the same, the complexity is linear in the size of the input preference profiles [58], i.e., 𝒪(MK){\cal O}(MK) with MM users and KK RISs.

  • Complexity for spectrum sensing via CNN inference at the RIS controllers: The trained CNN model has a quadratic time complexity during the inference process, i.e., 𝒪(n2c){\cal O}(n^{2}c), where cc denotes the number of layers and nn denotes the number of neurons at each layer. Then, the resulting complexity for spectrum sensing is 𝒪(n2cK){\cal O}(n^{2}cK) with KK RISs.

As a result, only a quadratic computational complexity, 𝒪(M+n2c){\cal O}(M+n^{2}c), is obtained at each RIS controller. Since there is no exponential computational complexity, large communication overhead, or megabyte of data storage, our proposed RIS-aided FSL framework appears to be feasible in practical implementations and deployments.

V Simulation Resutls and Discussions

V-A Testing Results

In this section, we present the testing results of the considered four-class inference example, by using real RF samples. In the considered example with two users and two RISs, the CNN model is trained through the proposed FSL framework to achieve RF signal classification. The testing results are illustrated in Table I.

TABLE I: Inference accuracy of the converged CNN model.
Inferring Class w=32w=32 w=128w=128 w=512w=512
Class-1 99.96%\% 100.00%\% 99.98%\%
Class-2 98.51%\% 98.10%\% 96.23%\%
Class-3 96.12%\% 96.24%\% 95.58%\%
Class-4 99.04%\% 99.62%\% 99.78%\%

For each user in the considered scenario, historical RF traces are collected using a universal software radio peripheral (USRP2) testbed, which is wired connected via Gigabit Ethernet to a host server with an implementation of the GNU Radio. To be specific, each user is emulated through a laptop that is responsible for baseband processing while a USRP2 platform is used for the up/down-conversion, the digital-to-analog/analog-to-digital conversion, and wireless transmission of the signals. Considering that each USRP2 testbed usually has one transmuting antenna, in order to collect the signals with USRP2, we let multiple USRP2 testbeds transmit RF signals simultaneously to a receiver. Then the RF signals can be received and stored as I/Q sequences for training the CNN model, by including the wireless channel, for a wide range of SNR values (from 0 to 2020 dB with interval of 55 dB) in order to account for different channel conditions. Besides, the window size ww (i.e., the number of time steps of the collected RF data) in Table I is 3232, 128128, and 512512, respectively.

In the considered example, we assume that the RIS1 and RIS2 assist the wireless transmissions of U1U_{1} and U2U_{2}, respectively, and the total wireless bandwidth is shared equally between the two users. For the local training, the users train the CNN with 80%80\% of RF dataset (i.e., I and Q samples), validate it by using 10%10\% of the dataset, and test it by using the remaining 10%10\% of the dataset. The trained CNN model consists of two convolutional (Conv) layers with ReLU activation functions, followed by two dense fully connected (FC) layers. The trained CNN model includes 256256 filters (1×\times3) in the first Conv layer, 128128 filters (1×\times3) in the second Conv layer, 256256 neurons in the first FC layer, and 99 neurons in the second FC layer (output). Within each FL round, the two users upload their local models once the local training ends. It is observed from Table I that the inference accuracy of the converged CNN model with two RISs is, in general, greater than 95%95\%. Compared to other classes, the ‘Idle’ class has the main characteristic that no user transmits and only background noise exists. Due to the distinguishable pattern compared to the other three classes, the CNN model predicts the ‘Idle’ class (i.e., the Class-1 in Table I) perfectly.

V-B Simulation Setting

In the considered simulation model, we consider MM users, KK RISs and one BS co-located with an edge server. The users are uniformly distributed in a square area of size 50×5050\times 50 (in meters) with the BS is located at (0, 0, 100100) in a three-dimensional Cartesian coordinates system. The location of the kkth RIS is given by (xkx_{k}, yky_{k}, zkz_{k}) = (100kcos(45o)\frac{100}{k}{\rm cos}(45^{o}), 100kcos(45o)\frac{100}{k}{\rm cos}(45^{o}), 5050), as illustrated in Fig. 4.

Refer to caption
Figure 4: Simulation setup of the proposed FSL framework with multiple RISs (top view).

Unless stated otherwise, other simulation parameters are set as follows. Each RIS is equipped with 128128 reflecting elements. The transmit power of each user is pm=100p_{m}=100 mW; the bandwidth is B=1B=1 MHz and the corresponding noise power density is 𝒩0=104{\cal N}_{0}=-104 dBm/Hz. The wireless channel gains are modeled using the 3GPP Urban Micro with a carrier frequency of 33 GHz. The local FL accuracy is θ=0.1\theta=0.1 and v=1v=1. The computation ability of each user is fm=2.0f_{m}=2.0 GHz and the data size is 200200 kbits. The proposed FSL framework is simulated by using the Matlab Deep Learning Toolbox for RF fingerprinting. For comparison, we consider a benchmark: an FL algorithm that randomly determines the user-RIS association and the wireless bandwidth is equally allocated to all users. All statistical results are averaged over 10410^{4} independent runs.

V-C Prediction Accuracy

V-C1 Prediction accuracy and training loss versus the number of iterations

The prediction accuracy and training loss of the proposed FSL framework versus the number of iterations are shown in Fig. 5(a) and Fig. 5(b), respectively, where the number of RISs is 11, 22, and 44, and the number of users is 2. From Fig. 5(a), it is observed that as the number of iterations increases, the prediction accuracy of all considered schemes increases first and, then remains stable. The figures show that the FL algorithm converges after more than 200200 iterations. Accordingly, the training loss of all schemes shown in Fig. 5(b) decreases as the number of iterations increases. Also we observe from Figs. 5(a)-(b) that, as the number of RISs increases, the proposed FSL framework with more RISs can achieve a higher prediction accuracy and lower training loss. This is because, as the number of RISs increases, cooperative spectrum sensing has a more pronounced effect and the number of local model parameters used for FL aggregation increases, thereby achieving better FL training.

Refer to caption
Refer to caption
Figure 5: The prediction accuracy of the proposed FSL versus the number of iterations is shown in (a), the training loss of the proposed FSL versus the number of iterations is shown in (b), where the number of RISs are 11, 22, and 44, respectively.
Refer to caption
Figure 6: The prediction accuracy vs. the percentage of data samples of each user, where the number of RISs is 44.

V-C2 Prediction accuracy versus the number of training samples

The prediction accuracy of three considered schemes as the number of training samples varies is illustrated in Fig. 6, where there exist two users and four RISs. From Fig. 6, we can observe that, as the percentage of training samples increases, the prediction accuracy of three schemes increases accordingly. This is because, as the number of training data samples increases, each user can use more data samples to train their local FL models, thereby improving the prediction accuracy of the FL. We also see that when each user has 100%100\% percentage of data samples for local training, the proposed FSL scheme can improve the prediction accuracy by up to 25%25\% and 43%43\%, respectively, compared to the benchmark and that with an optimized association. These gains stem from the fact that a matching scheme is developed for user-RIS association to maximize the number of users served by RISs. Meanwhile, to compensate for the loss of users that are not associated with RISs, the proposed FSL scheme allocates appropriate wireless bandwidth for each user to increase the received local FL model parameters hence improving the prediction accuracy.

Refer to caption
Figure 7: The system utility versus the number of users, where the number of elements of each RIS is 128128.
Refer to caption
Figure 8: The system utility versus the number of RISs, where the number of users is 256256.

V-D FL System Utility

V-D1 System utility versus number of users

The FL system utility of the two considered schemes versus the number of users is shown in Fig. 7, where the number of elements of each RIS is 128128. From this figure, we can see that, as the number of users increases, the system utility of all considered schemes increases first and then decays. This is because as the number of users increases, the number of local FL model parameters received at the edge server (denoted as Q=m=1MQ(m),m{\rm Q}=\sum_{m=1}^{M}Q(m),\ \forall m\in\cal M) used for FL aggregation increases with relatively low communication delay. As the number of users continues to increase by contrast, the system utility decreases slowly. This is mainly due to the fact that the allocated wireless bandwidth for each user decreases and the communication delay becomes large. However, there is no corresponding significant improvement on the number of received local FL model parameters at the edge server. Fig. 7 also shows that, for a network with 256256 users, the system utility gain achieved by the proposed FSL scheme with four RISs is up to 60%60\% better than that with one RIS. This is because, for a dense users deployment network, the wireless links with poor channel quality can be improved significantly by deploying a large number of RISs.

Refer to caption
(a) One RIS
Refer to caption
(b) One RIS
Refer to caption
(c) Two RISs
Refer to caption
(d) Two RISs
Refer to caption
(e) Four RISs
Refer to caption
(f) Four RISs
Figure 9: Prediction accuracy and training loss versus number of iterations under different learning rates.

V-D2 System utility versus number of RISs

The FL system utility of the two considered schemes versus the number of RISs is shown in Fig. 8, where the number of users is 256256. One can observe from Fig. 8 that the system utility of all the considered schemes first increases with the number of RISs and then remains stable. As the number of reflecting elements of each RIS increases, the system utility can be further improved. This is due to the fact that, with more RISs with a larger number of reflecting elements, the RIS can generate more accurate passive reflective beamforming for the incident signals, thereby effectively improving the propagation conditions. Therefore, the edge server is capable of allowing more users to participate in FL so as to improve the system utility. In addition, since the benchmark scheme has a relatively high probability of failing to choose the optimal user-RIS association, we observe that the gap between the benchmark and the proposed FSL schemes becomes significant, especially when the number of RISs is large.

V-E Impact of Learning Rate

The prediction accuracy and the training loss of the proposed FSL framework versus the number of iterations under different learning rates (i.e., 0.010.01, 0.0010.001, 0.00010.0001, and 0.000010.00001) is illustrated in Figs. 9(a)-(f), where the considered network is with only one RIS in (a) and (b), with two RISs in (c) and (d), and with four RISs in (e) and (f), respectively. To minimize the loss, the stochastic gradient descent with different learning rates is adopted at each iteration, where the size of each mini-batch is 256256. It is observed that the FL performance of the proposed FSL scheme is influenced by the learning rates. Specifically, with only one RIS available, Figs. 9(a)-(b) show a close performance of the FSL scheme with learning rates 0.010.01, 0.0010.001 and 0.00010.0001, while the smallest learning rate 0.000010.00001 has the worse performance. Interestingly, as the number of RISs increases, e.g., in Figs. 9(c)-(d) with two RISs, the FSL scheme with learning rate 0.0010.001 gradually outperforms the other three cases. This phenomenon is further demonstrated in Figs. 9(e)-(f), where a network with four RISs is considered. This is because a too large learning rate increases the oscillation while a too small learning rate leads to over-fitting. Therefore, an appropriate learning rate needs to be carefully selected in the proposed FSL framework based on the number of RISs.

VI Conclusion

In this article, we explored the symbiotic interplay between federated learning and RISs. To achieve wireless spectrum learning in RISs-aided wireless edge networks, we proposed a novel FSL framework by jointly optimizing the phase shifts, user-RIS association and wireless bandwidth allocation. Simulation results demonstrated the advantages of the proposed FSL framework in terms of spectrum prediction accuracy and system utility. The proposed FSL framework can be further explored to empower conventional RIS-aided networks with distributively-yet-intelligently ‘think-and-decide’ mechanisms.

Appendix A Proof of Theorem 2

Suppose that the FL model is deployed at a central monitor (e.g., the edge server) for the centralized spectrum sensing, the achieved inference accuracy is obtained as ϵ\epsilon. In the proposed FSL framework, each RIS controller is deployed with a FL model, which cooperatively infers the spectrum information and sends to the edge server for fusion. Let KK denote the number of RISs, the detection accuracy via cooperative spectrum sensing can be obtained as η=1(1ϵ)K\eta\!=\!1-(1-\epsilon)^{K} [59]. So the performance improvement brought by RISs in the first stage is achieved as

χ1=ηϵ=1(1ϵ)Kϵ.\chi_{1}=\frac{\eta}{\epsilon}=\frac{1-(1-\epsilon)^{K}}{\epsilon}. (34)

In the conventional FL system, the probability that the local model of the mmth user can be correctly received at the BS equals to the probability of γmdγT\gamma_{m}^{d}\geq\gamma_{T}, i.e.,

pc=Pr{γmdγT}=γTex𝑑x=eγT,p_{c}={\rm{Pr}}\left\{\gamma_{m}^{d}\geq\gamma_{T}\right\}=\int_{\gamma_{T}}^{\infty}e^{-x}dx=e^{-\gamma_{T}}, (35)

where γmd=pm|hd,m|2βmB𝒩0\gamma_{m}^{d}=\frac{{p_{m}}\left|h_{d,m}\right|^{2}}{{\beta}_{m}B{\cal N}_{0}} denotes the received SNR of the mmth user via the direct link.

In the proposed FSL framework, with the aid of RISs’ reflection, the received SNR of the mmth user is obtained as

γm=pm|hd,m+k=1Krm,kgk𝚽khm,k|2βmB𝒩0.\gamma_{m}=\frac{{p_{m}}\left|h_{d,m}+\sum_{k=1}^{K}r_{m,k}\textit{{g}}_{k}\mathbf{\Phi}_{k}\textit{{h}}_{m,k}\right|^{2}}{{\beta}_{m}B{\cal N}_{0}}. (36)

By rewriting (36), we have

γm\displaystyle\sqrt{\gamma_{m}} =pmβmB𝒩0|hd,m+k=1Krm,kgk𝚽khm,k|\displaystyle=\frac{{\sqrt{p_{m}}}}{\sqrt{{\beta}_{m}B{\cal N}_{0}}}\left|h_{d,m}+\sum_{k=1}^{K}r_{m,k}\textit{{g}}_{k}\mathbf{\Phi}_{k}\textit{{h}}_{m,k}\right| (37)
pmβmB𝒩0(|hd,m|+|k=1Krm,kgk𝚽khm,k|)\displaystyle\leq\frac{{\sqrt{p_{m}}}}{\sqrt{{\beta}_{m}B{\cal N}_{0}}}\left(\left|h_{d,m}\right|+\left|\sum_{k=1}^{K}r_{m,k}\textit{{g}}_{k}\mathbf{\Phi}_{k}\textit{{h}}_{m,k}\right|\right)
=γmd+pmβmB𝒩0|k=1Krm,kgk𝚽khm,k|.\displaystyle=\sqrt{\gamma_{m}^{d}}+\frac{{\sqrt{p_{m}}}}{\sqrt{{\beta}_{m}B{\cal N}_{0}}}\left|\sum_{k=1}^{K}r_{m,k}\textit{{g}}_{k}\mathbf{\Phi}_{k}\textit{{h}}_{m,k}\right|.

Based on (37), we have

γm\displaystyle\gamma_{m} (γmd+pmβmB𝒩0|k=1Krm,kgk𝚽khm,k|)2\displaystyle\leq\left(\sqrt{\gamma_{m}^{d}}+\frac{{\sqrt{p_{m}}}}{\sqrt{{\beta}_{m}B{\cal N}_{0}}}\left|\sum_{k=1}^{K}r_{m,k}\textit{{g}}_{k}\mathbf{\Phi}_{k}\textit{{h}}_{m,k}\right|\right)^{2} (38)
γmd+κ,\displaystyle\triangleq\gamma_{m}^{d}+\kappa,

where

κ\displaystyle\kappa pmβmB𝒩0|k=1Krm,kgk𝚽khm,k|2\displaystyle\triangleq\frac{{{p_{m}}}}{{\beta}_{m}B{\cal N}_{0}}\left|\sum_{k=1}^{K}r_{m,k}\textit{{g}}_{k}\mathbf{\Phi}_{k}\textit{{h}}_{m,k}\right|^{2}
+2γmdpmβmB𝒩0|k=1Krm,kgk𝚽khm,k|.\displaystyle+\frac{2\sqrt{\gamma_{m}^{d}p_{m}}}{\sqrt{{\beta}_{m}B{\cal N}_{0}}}\left|\sum_{k=1}^{K}r_{m,k}\textit{{g}}_{k}\mathbf{\Phi}_{k}\textit{{h}}_{m,k}\right|.

Therefore, the probability that the local models of the mmth user can be correctly received at the BS is calculated as

p\displaystyle p =Pr{γmγT}Pr{γmd+κγT}\displaystyle={\rm{Pr}}\left\{{\gamma_{m}}\geq{\gamma_{T}}\right\}\leq{\rm{Pr}}\left\{\gamma_{m}^{d}+\kappa\geq\gamma_{T}\right\} (39)
=Pr{γmdγTκ}=γTκex𝑑x=eγT+κ.\displaystyle={\rm{Pr}}\left\{\gamma_{m}^{d}\geq\gamma_{T}-\kappa\right\}=\int_{\gamma_{T}\!-\!\kappa}^{\infty}e^{-x}dx=e^{-\gamma_{T}+\kappa}.

Therefore, the performance improvement in the second stage is limited by

χ2=ppceκ.\chi_{2}=\frac{p}{p_{c}}\leq e^{\kappa}. (40)

References

  • [1] H. Yang, A. Alphones, Z. Xiong, D. Niyato, J. Zhao and K. Wu, “Artificial-intelligence-enabled intelligent 6G networks,” IEEE Network, vol. 34, no. 6, pp. 272-280, Dec. 2020.
  • [2] S. Dang, O. Amin, B. Shihada and M. S. Alouini, “What should 6G be?” Nature Electronics, 3(1), 20-29, 2020.
  • [3] X. Cao, Z. Song, B. Yang, L. Qian and Z. Han, “Full-duplex MAC in LAA/ Wi-Fi coexistence networks: design, modeling, and analysis,” IEEE Transactions on Wireless Communications, vol. 19, no. 8, pp. 5531-5546, Aug. 2020.
  • [4] X. Li, F. Dong, S. Zhang, and W. Guo, “A survey on deep learning techniques in wireless signal recognition,” Wireless Communications and Mobile Computing, vol. 2019, pp. 1-13, Feb. 2019.
  • [5] A. Zappone, M. Di Renzo, and M. Debbah, “Wireless networks design in the era of deep learning: Model-based, AI-based, or both?” IEEE Transactions on Communications, vol. 67, no. 10, pp. 7331-7376, Oct. 2019.
  • [6] B. Yang, X. Cao, Z. Han, and L. Qian, “A machine learning enabled MAC framework for heterogeneous internet-of-things networks,” IEEE Transactions on Wireless Communications, vol. 18, no. 7, pp. 3697-3712, Jul. 2019.
  • [7] J. Gao, X. Yi, C. Zhong, X. Chen, and Z. Zhang, “Deep learning for spectrum sensing,” IEEE Wireless Communications Letters, vol. 8, no. 6, pp. 1727-1730, Dec. 2019.
  • [8] B. Yang, X. Cao, O. Omotere, X. Li, Z. Han, and L. Qian, “Improving medium access efficiency with intelligent spectrum learning,” IEEE Access, vol. 8, pp. 94484-94498, 2020.
  • [9] K. Davaslioglu, S. Soltani, T. Erpek and Y. Sagduyu, “DeepWiFi: cognitive WiFi with deep learning,” IEEE Transactions on Mobile Computing, vol. 20, no. 2, pp. 429-444, Feb. 2021.
  • [10] K. Bonawitz, et al. “Towards federated learning at scale: system design,” in Proc. of Systems and Machine Learning Conference, Stanford, CA, USA, 2019.
  • [11] J. Park, S. Samarakoon, M. Bennis, and M. Debbah, “Wireless network intelligence at the edge,” Proceedings of the IEEE, vol. 107, no. 11, pp. 2204-2239, Nov. 2019.
  • [12] M. Di Renzo et al. “Smart radio environments empowered by reconfigurable AI meta-surfaces: an idea whose time has come,” EURASIP Journal on Wireless Communications and Networking, vol. 2019, no. 129, pp. 1-20, May 2019.
  • [13] M. Di Renzo, A. Zappone, M. Debbah, M. -S. Alouini, C. Yuen, J. d. Rosny, and S. Tretyakov, “Smart radio environments empowered by reconfigurable intelligent surfaces: how it works, state of research, and road ahead,” IEEE Journal on Selected Areas in Communications, vol. 38, pp. 2450-2525, Nov. 2020.
  • [14] C. Huang, A. Zappone, G. C. Alexandropoulos, M. Debbah, and C. Yuen, “Reconfigurable intelligent surfaces for energy efficiency in wireless communication,” IEEE Transactions on Wireless Communications, vol. 18, no. 8, pp. 4157-4170, Aug. 2019.
  • [15] Q. Wu, and R. Zhang, “Intelligent reflecting surface enhanced wireless network via joint active and passive beamforming,” IEEE Transactions on Wireless Communications, vol. 18, no. 11, pp. 5394-409, Aug. 2019.
  • [16] T. Bai, C. Pan, Y. Deng, M. Elkashlan, A. Nallanathan and L. Hanzo, “Latency minimization for intelligent reflecting surface aided mobile edge computing,” IEEE Journal on Selected Areas in Communications, vol. 38, no. 11, pp. 2666-2682, Nov. 2020.
  • [17] C. Chaccour, M. N. Soorki, W. Saad, M. Bennis and P. Popovski, “Risk-based optimization of virtual reality over terahertz reconfigurable intelligent surfaces,” in Proc. of IEEE ICC, Dublin, Ireland, 2020.
  • [18] W. Tang et al., “MIMO transmission through reconfigurable intelligent surface: system design, analysis, and implementation,” IEEE Journal on Selected Areas in Communications, vol. 38, no. 11, pp. 2683-2699, Nov. 2020.
  • [19] C. Huang, S. Hu, G. C. Alexandropoulos, A. Zappone, C. Yuen, R. Zhang, M. D. Renzo, M. Debbah, “Holographic MIMO surfaces for 6G wireless networks: opportunities, challenges, and trends,” IEEE Wireless Communications, vol. 27, no. 5, pp. 118-125, Oct. 2020.
  • [20] Z. Wan, Z. Gao, F. Gao, M. D. Renzo and M. -S. Alouini, “Terahertz Massive MIMO With Holographic Reconfigurable Intelligent Surfaces,” IEEE Transactions on Communications, vol. 69, no. 7, pp. 4732-4750, Jul. 2021.
  • [21] Z. Shi, W. Gao, S. Zhang, J. Liu and N. Kato, “AI-enhanced cooperative spectrum sensing for non-orthogonal multiple access,” IEEE Wireless Communications, vol. 27, no. 2, pp. 173-179, Apr. 2020.
  • [22] H. He and H. Jiang, “Deep learning based energy efficiency optimization for distributed cooperative spectrum sensing,” IEEE Wireless Communications, vol. 26, no. 3, pp. 32-39, Jun. 2019.
  • [23] Z. Luo, S. Zhao, Z. Lu, J. Xu and Y. Sagduyu, “When attackers meet AI: learning-empowered attacks in cooperative spectrum sensing,” IEEE Transactions on Mobile Computing, pp. 1-1, Oct. 2020.
  • [24] K. Yang, Y. Shi, Y. Zhou, Z. Yang, L. Fu and W. Chen, “Federated machine learning for intelligent IoT via reconfigurable intelligent surface,” IEEE Network, vol. 34, no. 5, pp. 16-22, Oct. 2020.
  • [25] Z. Wang, J. Qiu, Y. Zhou, Y. Shi, L. Fu, W. Chen, and K.B. Lataief, “Federated learning via intelligent reflecting surface,” IEEE Transactions on Wireless Communications, pp. 1-1, Nov. 2020.
  • [26] T. Jiang and Y. Shi, “Over-the-air computation via intelligent reflecting surfaces,” in Proc. of IEEE GLOBECOM, Waikoloa, HI, USA, Dec. 2019.
  • [27] W. Ni, Y. Liu, Z. Yang, H. Tian, and X. Shen, “Federated learning in multi-RIS aided systems,” IEEE Internet of Things Journal, early access, Nov. 2021.
  • [28] M. Chen, Z. Yang, W. Saad, C. Yin, H. V. Poor and S. Cui, “A joint learning and communications framework for federated learning over wireless networks,” IEEE Transactions on Wireless Communications, vol. 20, no. 1, pp. 269-283, Jan. 2021.
  • [29] S. Samarakoon, M. Bennis, W. Saad and M. Debbah, “Distributed federated learning for ultra-reliable low-latency vehicular communications,” IEEE Transactions on Communications, vol. 68, no. 2, pp. 1146-1159, Feb. 2020.
  • [30] K. Yang, T. Jiang, Y. Shi and Z. Ding, “Federated learning via over-the-air computation,” IEEE Transactions on Wireless Communications, vol. 19, no. 3, pp. 2022-2035, Mar. 2020.
  • [31] S. Wang et al., “Adaptive federated learning in resource constrained edge computing systems,” IEEE Journal on Selected Areas in Communications, vol. 37, no. 6, pp. 1205-1221, Jun. 2019.
  • [32] X. Cao, B. Yang, C. Huang, G. C. Alexandropoulos, C. Yuen, Z. Han, H. V. Poor, and L. Hanzo, “Massive access of static and mobile users via reconfigurable intelligent surfaces: protocol design and performance analysis,” IEEE Journal on Selected Areas in Communications, vol. 40, no. 4, pp. 1253-1269, April 2022.
  • [33] X. Cao, B. Yang, C. Huang, C. Yuen, M. Di Renzo, Z. Han, D. Niyato, H. V. Poor and L. Hanzo, “AI-assisted MAC for reconfigurable intelligent surface-aided wireless networks: challenges and opportunities,” IEEE Communication Magazine, vol. 59, no. 6, pp. 21-27, June 2021.
  • [34] J. Hu, H. Zhang, K. Bian, M. Di Renzo, Z. Han, and L. Song, “MetaSensing: intelligent metasurface assisted RF 3D sensing by deep reinforcement learning,” IEEE Journal on Selected Areas in Communications, vol. 39, no. 7, pp. 2182-2197, July 2021.
  • [35] C. Huang, R. Mo and C. Yuen, “Reconfigurable intelligent surface assisted multiuser MISO systems exploiting deep reinforcement learning,” IEEE Journal on Selected Areas in Communications, vol. 38, no. 8, pp. 1839-1850, Aug. 2020.
  • [36] X. Cao, B. Yang, C. Huang, C. Yuen, M. Di Renzo, D. Niyato and Z. Han, “Reconfigurable intelligent surface-assisted aerial-terrestrial communications via multi-task learning,” IEEE Journal on Selected Areas in Communications, vol. 39, no. 10, pp. 3035-3050, Oct. 2021.
  • [37] H. Yang, Z. Xiong, J. Zhao, D. Niyato, Q. Wu, HV Poor, and M. Tornatore, “Intelligent reflecting surface assisted anti-jamming communications: a fast reinforcement learning approach,” arXiv preprint arXiv:2004.12539. Apr. 2020.
  • [38] S. Liu, Z. Gao, J. Zhang, M. D. Renzo and M. -S. Alouini, “Deep denoising neural network assisted compressive channel estimation for mmWave intelligent reflecting surfaces,” IEEE Transactions on Vehicular Technology, vol. 69, no. 8, pp. 9223-9228, Aug. 2020.
  • [39] M. A. Aygul, M. Nazzal, and H. Arslan, “Deep learning-based optimal RIS interaction exploiting previously sampled channel correlations,” in Proc. of IEEE WCNC, Nanjing, China, May 2021.
  • [40] A. M. Elbir, et al., “Deep channel learning for large intelligent surfaces aided mm-wave massive MIMO systems,” IEEE Wireless Communications Letters, vol. 9, no. 9, pp. 1447-1451, Sept. 2020.
  • [41] X. Pei, et al., “RIS-aided wireless communications: prototyping, adaptive beamforming, and indoor/outdoor field trials,” IEEE Transactions on Communications, vol. 69, no. 12, pp. 8627-8640, Dec. 2021.
  • [42] D. Mishra and H. Johansson, “Channel estimation and low-complexity beamforming design for passive intelligent surface assisted MISO wireless energy transfer,” in Proc. of IEEE ICASSP, Brighton, United Kingdom, May 2019, pp. 4659-4663.
  • [43] C. You, B. Zheng, and R. Zhang, “Intelligent reflecting surface with discrete phase shifts: Channel estimation and passive beamforming,” in Proc. of IEEE ICC, Dublin, Ireland, July 2020.
  • [44] M. Jung, W. Saad, M. Debbah, and C.S. Hong, “On the optimality of reconfigurable intelligent surfaces (RISs): Passive beamforming, modulation, and resource allocation,” IEEE Transactions on Wireless Communications, vol. 20, no. 7, pp. 4347-4363, July 2021.
  • [45] Basar, E., “Reconfigurable intelligent surfaces for Doppler effect and multipath fading mitigation,” Frontiers in Communications and Networks, 14, May. 2021.
  • [46] S. Venkatesh, et al., “A high-speed programmable and scalable terahertz holographic metasurface based on tiled CMOS chips,” Nature Electronics, vol. 3, pp. 785-793, Dec. 2020.
  • [47] N. H. Tran, W. Bao, A. Zomaya, M. N. H. Nguyen and C. S. Hong, “Federated learning over wireless networks: optimization model design and analysis,” In Proc. of IEEE INFOCOM, Paris, France, May 2019.
  • [48] B. Yang, X. Cao, J. Bassey, X. Li and L. Qian, “Computation offloading in multi-access edge computing: a multi-task learning approach,” IEEE Transactions on Mobile Computing, pp. 1-1, April 2020.
  • [49] K. Tammer, “The application of parametric optimization and imbedding to the foundation and realization of a generalized primal decomposition approach,” Mathematical research, vol. 35, pp. 376-386, 1987.
  • [50] B. Zheng, C. You and R. Zhang, “Intelligent reflecting surface assisted multi-user OFDMA: channel estimation and training design,” IEEE Transactions on Wireless Communications, vol. 19, no. 12, pp. 8315-8329, Dec. 2020.
  • [51] B. Yang, X. Cao, C. Huang, C. Yuen, L. Qian and M. D. Renzo, “Intelligent spectrum learning for wireless networks with reconfigurable intelligent surfaces,” IEEE Transactions on Vehicular Technology, vol. 70, no. 4, pp. 3920-3925, Apr. 2021.
  • [52] J. S. Wilson, et al., “Test and measurement: know it all,” Newnes, Sep. 2008.
  • [53] A. Taha, M. Alrabeiah and A. Alkhateeb, “Enabling large intelligent surfaces with compressive sensing and deep learning,” IEEE Access, vol. 9, pp. 44304-44321, Mar. 2021.
  • [54] I. Alamzadeh, G. C. Alexandropoulos, N. Shlezinger, and M. F. Imani, “A reconfigurable intelligent surface with integrated sensing capability,” Scientific Reports, vol. 11, no. 1, pp. 1-10, 2021.
  • [55] G. C. Alexandropoulos, N. Shlezinger, I. Alamzadeh, M. F. Imani, H. Zhang, and Y. C. Eldar, “Hybrid reconfigurable intelligent metasurfaces: enabling simultaneous tunable reflections and sensing for 6G wireless communications,” arXiv preprint arXiv:2104.04690, Apr. 2021.
  • [56] G. C. Alexandropoulos and E. Vlachos, “A hardware architecture for reconfigurable intelligent surfaces with minimal active elements for explicit channel estimation,” in Proc. of IEEE ICASSP, May 2020, Barcelona, Spain.
  • [57] D. Adesina, J. Bassey, and L. Qian, “Robust deep radio frequency spectrum learning for future wireless communications systems,” IEEE Access, vol. 8, pp. 148528-148540, Aug. 2020.
  • [58] S. M. A. Kazmi et al., “Mode selection and resource allocation in device-to-device communications: a matching game approach,” IEEE Transactions on Mobile Computing, vol. 16, no. 11, pp. 3126-3141, Nov. 2017.
  • [59] W. Zhang and K. B. Letaief, “Cooperative spectrum sensing with transmit and relay diversity in cognitive radio networks,” IEEE Transactions on Wireless Communications, vol. 7, no. 12, pp. 4761-4766, Dec. 2008.