File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/TWC.2022.3181214
- Scopus: eid_2-s2.0-85132763388
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Article: Integrating Over-the-Air Federated Learning and Non-Orthogonal Multiple Access: What Role Can RIS Play?
Title | Integrating Over-the-Air Federated Learning and Non-Orthogonal Multiple Access: What Role Can RIS Play? |
---|---|
Authors | |
Keywords | Federated learning non-orthogonal multiple access over-the-air computation reconfigurable intelligent surface |
Issue Date | 2022 |
Citation | IEEE Transactions on Wireless Communications, 2022, v. 21, n. 12, p. 10083-10099 How to Cite? |
Abstract | With the aim of integrating over-the-air federated learning (AirFL) and non-orthogonal multiple access (NOMA) into an on-demand universal framework, this paper proposes a reconfigurable intelligent surface (RIS)-aided hybrid network by leveraging the RIS to flexibly adjust the decoding order of heterogeneous data. A new metric of computation rate is defined to measure the performance of AirFL users. Upon this, the objective of this work is to maximize the achievable hybrid rate by jointly optimizing the transmit power, controlling the receive scalar, and designing the reflection coefficients. Since the concurrent transmissions of all computation and communication signals are aided by the discrete phase-shifting elements at the RIS, the formulated problem (P0) is a challenging mixed-integer programming problem. To tackle this intractable issue, we decompose the original problem (P0) into a non-convex problem (P1) and a combinatorial problem (P2), which are characterized by the continuous and discrete variables, respectively. For the transceiver design problem (P1), the power allocation subproblem is first solved by difference-of-convex programming, and then the receive control subproblem is addressed by successive convex approximation, where the closed-form expressions of simplified cases are derived to obtain deep insights. For the reflection design problem (P2), a relaxation-then-quantization method is adopted to find a suboptimal solution for striking a trade-off between complexity and performance. Afterwards, an alternating optimization algorithm is developed to solve the non-linear non-convex problem (P0) iteratively. Finally, simulation results reveal that i) the proposed RIS-aided hybrid network can support on-demand communication and computation efficiently, ii) the system performance can be improved by properly selecting the location of the RIS, and iii) the designed algorithms are also applicable to conventional networks with only AirFL or NOMA users. |
Persistent Identifier | http://hdl.handle.net/10722/349739 |
ISSN | 2023 Impact Factor: 8.9 2023 SCImago Journal Rankings: 5.371 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ni, Wanli | - |
dc.contributor.author | Liu, Yuanwei | - |
dc.contributor.author | Yang, Zhaohui | - |
dc.contributor.author | Tian, Hui | - |
dc.contributor.author | Shen, Xuemin | - |
dc.date.accessioned | 2024-10-17T07:00:29Z | - |
dc.date.available | 2024-10-17T07:00:29Z | - |
dc.date.issued | 2022 | - |
dc.identifier.citation | IEEE Transactions on Wireless Communications, 2022, v. 21, n. 12, p. 10083-10099 | - |
dc.identifier.issn | 1536-1276 | - |
dc.identifier.uri | http://hdl.handle.net/10722/349739 | - |
dc.description.abstract | With the aim of integrating over-the-air federated learning (AirFL) and non-orthogonal multiple access (NOMA) into an on-demand universal framework, this paper proposes a reconfigurable intelligent surface (RIS)-aided hybrid network by leveraging the RIS to flexibly adjust the decoding order of heterogeneous data. A new metric of computation rate is defined to measure the performance of AirFL users. Upon this, the objective of this work is to maximize the achievable hybrid rate by jointly optimizing the transmit power, controlling the receive scalar, and designing the reflection coefficients. Since the concurrent transmissions of all computation and communication signals are aided by the discrete phase-shifting elements at the RIS, the formulated problem (P0) is a challenging mixed-integer programming problem. To tackle this intractable issue, we decompose the original problem (P0) into a non-convex problem (P1) and a combinatorial problem (P2), which are characterized by the continuous and discrete variables, respectively. For the transceiver design problem (P1), the power allocation subproblem is first solved by difference-of-convex programming, and then the receive control subproblem is addressed by successive convex approximation, where the closed-form expressions of simplified cases are derived to obtain deep insights. For the reflection design problem (P2), a relaxation-then-quantization method is adopted to find a suboptimal solution for striking a trade-off between complexity and performance. Afterwards, an alternating optimization algorithm is developed to solve the non-linear non-convex problem (P0) iteratively. Finally, simulation results reveal that i) the proposed RIS-aided hybrid network can support on-demand communication and computation efficiently, ii) the system performance can be improved by properly selecting the location of the RIS, and iii) the designed algorithms are also applicable to conventional networks with only AirFL or NOMA users. | - |
dc.language | eng | - |
dc.relation.ispartof | IEEE Transactions on Wireless Communications | - |
dc.subject | Federated learning | - |
dc.subject | non-orthogonal multiple access | - |
dc.subject | over-the-air computation | - |
dc.subject | reconfigurable intelligent surface | - |
dc.title | Integrating Over-the-Air Federated Learning and Non-Orthogonal Multiple Access: What Role Can RIS Play? | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/TWC.2022.3181214 | - |
dc.identifier.scopus | eid_2-s2.0-85132763388 | - |
dc.identifier.volume | 21 | - |
dc.identifier.issue | 12 | - |
dc.identifier.spage | 10083 | - |
dc.identifier.epage | 10099 | - |
dc.identifier.eissn | 1558-2248 | - |