Efficient and fast convergent consensus algorithms for faulty nodes tracking in distributed wireless sensor networks
Publisher© 2016 IEEE
MetadataShow full item record
CitationKhan, M. M. I., & Hossain, R. (2017). Efficient and fast convergent consensus algorithms for faulty nodes tracking in distributed wireless sensor networks. Paper presented at the 2016 3rd International Conference on Electrical Engineering and Information and Communication Technology, iCEEiCT 2016, 10.1109/CEEICT.2016.7873095
One of the challenging issues in a distributed computing system is to reach on a decision with the presence of so many faulty nodes. These faulty nodes may update the wrong information, provide misleading results and may be nodes with the depleted battery power. Consensus algorithms help to reach on a decision even with the faulty nodes. Every correct node decides some values by a consensus algorithm. If all correct nodes propose the same value then all the nodes decide on that. Every correct nodes must agree on the same value. Faulty nodes do not reach on the decision that correct nodes agreed on. Binary consensus algorithm and average consensus algorithm are the most widely used consensus algorithm in a distributed system. We apply binary consensus and average consensus algorithm in a distributed sensor network with the presence of some faulty nodes. We evaluate these algorithms for better convergence rate and error rate.