Communication-Efficient Distributed Learning in Massive IoT: A Graph-Based Perspective
Lindong Zhao, Jingyue Tang, Mingzhe Chen, Liang Zhou, Weihua Zhuang · 2025
Various distributed learning approaches emerge for enabling ubiquitous intelligence in Internet of Things (IoT) without sacrificing data privacy. To improve communication efficiency in frequent knowledge exchange over resource-constrained IoT, different techniques for client selection have been proposed. However, the intractable scalability issues remain to be addressed in massive IoT, since highly-coupled co-channel interference adds exponential complexity to combinatorial client selection. In this work, we develop a client selection framework highly-scalable to large-scale networks with thousands of devices, which exploits the inherent graph structure derived from knowledge exchange and co-channel interference. Specifically, we first model a client selection problem for jointly optimizing learning performance and system cost under volatile network conditions. The formulated problem is encoded into a node classification problem by a directed graph. Subsequently, a general yet simple solver is designed based on graph neural networks, which selects clients by classifying node status with recursive neighborhood aggregation of node representations. Finally, extensive experimental results demonstrate that the proposed approach can perform on par with state-of-the-art methods, while scaling to networks whose size is orders of magnitude larger than they can handle.