As a foundational protocol in wireless sensor networks (WSNs), LEACH has long contended with the dual challenges of energy load balancing and security defense. To clarify the protocol’s evolutionary trajectory within the modern IoT context, this paper presents a systematic review and restructuring of LEACH’s optimization mechanisms. The core contributions of this study are threefold: First, it establishes a taxonomy for energy optimization in LEACH. It provides an in-depth analysis of how intelligent algorithms—such as fuzzy logic and meta-heuristics—reshape cluster head election and data transmission paths in heterogeneous network environments, thereby resolving the inherent blindness of traditional mechanisms. Second, it elucidates the evolutionary patterns of LEACH security mechanisms. The paper details the transition of defense strategies from early static encryption and authentication to dynamic countermeasure mechanisms, offering a clear framework for understanding the protocol’s defensive boundaries. Finally, addressing the bottleneck where high security levels often incur high energy costs, the paper explores the feasibility of incorporating zero-trust architecture (ZTA) into WSNs within the future outlook section. This discussion aims to provide a new theoretical perspective for future research on balancing enhanced defense capabilities with energy efficiency.
In this paper, we present a more general approach based on a Picard integral scheme for nonlinear partial differential equations with a variable time-fractional derivative of order and space-fractional order , where is introduced as the new unknown function and u is recovered using the quadrature. In order to get rid of the constraints of traditional plans considering the half-time situation, integration by parts and the regularity process are introduced on the variable v. The convergence order can reach , different from the common schemes with convergence rate under the infinite norm. In each integer time step, the stability, solvability and convergence of this scheme are proved. Several error results and convergence rates are calculated using numerical simulations to evidence the theoretical values of the proposed method.
In industrial internet of things (IIoT) deployments, condition monitoring data is rarely complete. Labeled samples are scarce, sensors drop out, signals are corrupted by noise, and what reaches the edge is often a sparse, distorted fragment of the ideal dataset. Federated learning preserves privacy, yet its standard formulations assume clients can train locally on adequate labeled data-an assumption that seldom holds on the factory floor. This paper proposes prompt transfer, a distinct federated learning paradigm that replaces conventional gradient or prototype exchange with the transfer of small, curated sets of labeled examples (prompts) as the sole medium of knowledge flow. Unlike federated distillation, which shares model outputs, or meta-learning, which requires local gradient adaptation, prompt transfer leverages the in-context learning capability of a frozen tabular foundation model to achieve zero-gradient, parameter-free knowledge transfer across clients. Experiments on the Southeast University bearing dataset show that under 5-shot settings, our method FedICL achieves 94.0% accuracy, in contrast to FedAvg’s random-guessing performance of 20.1% while requiring zero gradient computation and reducing communication rounds by 95% and data transfer by 87%. The approach remains effective under non-IID distributions ( vs random). This work directly addresses the special issue themes of incomplete data and federated learning, offering a practical solution for label-scarce, resource-constrained IIoT scenarios.