Distributed Aggregate Function Estimation by Biphasically Configured Metropolis-Hasting Weight Model
MetadataShow full item record
An energy-efficient estimation of an aggregate function can significantly optimize a global event detection or monitoring in wireless sensor networks. This is probably the main reason why an optimization of the complementary consensus algorithms is one of the key challenges of the lifetime extension of the wireless sensor networks on which the attention of many scientists is paid. In this paper, we introduce an optimized weight model for the average consensus algorithm. It is called the Biphasically configured Metropolis-Hasting weight model and is based on a modification of the Metropolis-Hasting weight model by rephrasing the initial configuration into two parts. The first one is the default configuration of the Metropolis-Hasting weight model, while, the other one is based on a recalculation of the weights allocated to the adjacent nodes’ incoming values at the cost of decreasing the value of the weights of the inner states. The whole initial configuration is executed in a fully-distributed manner. In the experimental section, it is proven that our optimized weight model significantly optimizes the Metropolis-Hasting weight model in several aspects and achieves better results compared with other concurrent weight models.
KeywordsDistributed computing, aggregate function, average consensus algorithm, metropolis-hasting weight model, wireless sensor networks
Document typePeer reviewed
Document versionFinal PDF
SourceRadioengineering. 2017 vol. 26, č. 2, s. 479-495. ISSN 1210-2512
- 2017/2