This chapter has briefly discussed the need of the DKF and introduced the literature work of the DKF. Most DKF methods proposed in the literature rely on consensus filters algorithm. The convergence rate of such distributed consensus algorithms typically depends on the network topology and the weights given to the edges between neighboring sensors. The next chapter proposes a low power DKF. The proposed DKF is based on a fast polynomial filter to accelerate distributed average consensus in static network topologies. The idea is to apply a polynomial filter on the network matrix that will shape its spectrum in order to increase the convergence rate by minimizing its second largest eigenvalue. Fast convergence can contribute to significant energy saving.