4.7 Article

Federated Learning Over Multihop Wireless Networks With In-Network Aggregation

Journal

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS
Volume 21, Issue 6, Pages 4622-4634

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TWC.2022.3168538

Keywords

Computational modeling; Training; Data models; Servers; Resource management; Spread spectrum communication; Wireless networks; Federated learning; multi-hop wireless network; wireless mesh network; edge computing; in-network aggregation

Funding

  1. U.S. National Science Foundation [CNS-2106589, IIS-1722791]

Ask authors/readers for more resources

This paper investigates the problem of federated learning over wireless mesh networks and proposes a framework for in-network model aggregation to reduce outgoing data traffic and improve model aggregation under limited communication resources. The optimization problem is formulated by considering model aggregation, routing, and spectrum allocation, and a solution approach based on mixed-integer linear programming is developed. Simulation results demonstrate the effectiveness of the proposed solution and the superiority of the in-network aggregation scheme.
Communication limitation at the edge is widely recognized as a major bottleneck for federated learning (FL). Multi-hop wireless networking provides a cost-effective solution to enhance service coverage and spectrum efficiency at the edge, which could facilitate large-scale and efficient machine learning (ML) model aggregation. However, FL over multi-hop wireless networks has rarely been investigated. In this paper, we optimize FL over wireless mesh networks by taking into account the heterogeneity in communication and computing resources at mesh routers and clients. We present a framework that each intermediate router performs in-network model aggregation before sending the data to the next hop, so as to reduce the outgoing data traffic and hence aggregate more models under limited communication resources. To accelerate model training, we formulate our optimization problem by jointly considering model aggregation, routing, and spectrum allocation. Although the problem is a non-convex mixed-integer nonlinear programming, we transform it into a mixed-integer linear programming (MILP), and develop a coarse-grained fixing procedure to solve it efficiently. Simulation results demonstrate the effectiveness of the solution approach, and the superiority of the in-network aggregation scheme over the counterpart without in-network aggregation.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available