Author : Jun Ye Yu
Publisher :
ISBN 13 :
Total Pages : pages
Book Rating : 4.:/5 (88 download)
Book Synopsis Performance Comparison of Randomized Gossip, Broadcast Gossip and Collection Tree Protocol for Distributed Averaging in Wireless Sensor Networks by : Jun Ye Yu
Download or read book Performance Comparison of Randomized Gossip, Broadcast Gossip and Collection Tree Protocol for Distributed Averaging in Wireless Sensor Networks written by Jun Ye Yu and published by . This book was released on 2014 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: "Wireless sensor networks consisting of low cost and battery-powered sensors are used for a multitude of applications from environmental monitoring to target tracking. The large number of sensors deployed in often inaccessible or hostile environments generates the need for fault-tolerant, asynchronous distributed systems and protocols. The problem of distributed averaging, in which nodes communicate with only their neighbors to calculate the network-wide average of their data value, is a basic building block for many more complex applications such as distributed optimization and compression. Gossip algorithms and tree-based aggregation are two popular paradigms for solving distributed averaging. In this thesis, we present and compare the performance of three algorithms: broadcast gossip, randomized gossip and the collection tree protocol. We first present algorithm implementations that address several issues in current literature such as lack of self-termination. This makes our implementations more suitable for practical deployment. We then optimize individual parameter values and investigate the performance of the three algorithms in terms of efficiency (communication overhead, latency and energy consumption) and accuracy (error and standard deviation) in wireless networks modeled as random geometric graphs. We show through simulations that increasing network size degrades the performance of all three algorithms and that uni-directional links degrade the performance of randomized gossip and the collection tree protocol, but they have a limited impact on broadcast gossip. We also compare the three algorithms side by side and show that broadcast gossip has the highest efficiency, but lowest accuracy. Finally, we show through simulations the impact of value initializations and node transmission power." --