Distributed adaptive filtering with reduced communication load

We propose novel algorithms for distributed processing in applications constrained by available communication resources, using diffusion strategies that achieve up to three orders-of-magnitude reduction in communication load on the network, while delivering equal performance with respect to the state of the art. After computation of local estimates, the information is diffused among processing elements (or nodes) non-uniformly in time by conditioning the information transfer on level-crossings of the diffused parameter, resulting in a greatly reduced communication requirement. We provide the mean stability analysis of our algorithms, and illustrate the gain in communication efficiency compared to other reducedcommunication distributed estimation schemes. © 2016 IEEE

Resource-aware event triggered distributed estimation over adaptive networks

We propose a novel algorithm for distributed processing applications constrained by the available communication resources using diffusion strategies that achieves up to a 103 fold reduction in the communication load over the network, while delivering a comparable performance with respect to the state of the art. After computation of local estimates, the information is diffused among the processing elements (or nodes) non-uniformly in time by conditioning the information transfer on level-crossings of the diffused parameter, resulting in a greatly reduced communication requirement. We provide the mean and mean-square stability analyses of our algorithms, and illustrate the gain in communication efficiency compared to other reduced-communication distributed estimation schemes. © 2017 Elsevier Inc

Communication efficient distributed estimation [Iletisim Verimli Dagltlk Kestirim]

In this paper, we consider the problem of distributed estimation over adaptive networks with reduced load on communication resources. Novel diffusion strategies are presented that achieve up to three orders-of-magnitude reduction in the communication load on the network, while matching the state-of-the-art in performance. Specifically, the information transfer between the nodes of the network is conditioned on the level-crossings of the diffused parameter. We perform the mean stability analysis of the proposed algorithm, and provide numerical examples to verify the theoretical results. © 2016 IEEE