A distributed algorithm with dynamic event-triggered mechanism for resource allocation problems

Distributed algorithms have continued to attract attention due to their decentralized nature, strong robustness, and ease of scalability. However, as the scale of networks expands, the implementation of distributed algorithms also increases the demand for communication resources. In this study, we introduce a distributed algorithm incorporating a dynamic event-triggered communication mechanism to address the widespread issue of resource allocation in numerous engineering disciplines. The proposed algorithm significantly reduces communication frequency while maintaining competitive convergence speed. We prove that under the condition of strongly convex and smoothness local cost functions, by selecting appropriate parameters, the algorithm can attain linear convergence. The efficacy and benefits of our method are confirmed through several simulation experiments.