 A Cluster-Based Consensus Algorithm in a Wireless Sensor NetworkYanwei Li, Zhenyu Zhou and Takuro Sato International Journal of Distributed Sensor Networks, 2013, vol. 9, issue 3, 547124 Abstract: In this paper, we propose an average connectivity degree cluster (ACDC) scheme gossip algorithm to improve the convergence speed and the accuracy of the consensus, when a common decision is needed for a certain phenomenon in a distributed network. We analyze the effects of the initial value, the network topology (regular and irregular), and the number of clusters on the algorithm convergence rate as well as the accuracy of the value when reaching consensus. A utility function is developed based on two parameters, iteration and relative error, to help the network designers make an optimal decision based on their requirements. An irregular sensor model which is based on the degree of irregular (DOI) radius is introduced to evaluate the robustness of the algorithm. The simulation results demonstrate that for any initial value and network topology, the proposed ACDC gossip algorithm can yield results that are 50% closer to the real average value than the referenced standard gossip and grid cluster gossip algorithms. With different DOI values, our ACDC gossip algorithm can still reach lower relative error compared with other gossip algorithms, which demonstrates that our algorithm is robust enough to be executed in the network. Date: 2013 Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:sae:intdis:v:9:y:2013:i:3:p:547124 DOI: 10.1155/2013/547124 Access Statistics for this article More articles in International Journal of Distributed Sensor Networks |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.