“…Since we consider a fully distributed network, it is sufficient to analyse the computational complexity imposed on a single agent during one time slot. Specifically, the proposed EKF-STDF has a complexity of O (N rel l max + log 2 (N rel l max )), while each of the particle-based schemes, e.g., the SPA-EKF [11], the particle-based SPAWN [1] and the NEBP [12], has a complexity of O (N rel N s l max + log 2 (N rel N s l max )). Here N rel is the number of neighbors of the agent considered, while N s denotes the number of particles required.…”