Comparison of consensus algorithms in wireless sensor networks

Wireless sensor networks are utilized to monitor data from a wide range of application types. One of the most important problems of these networks, which will have even wider application areas with the wide acceptance of the Internet of Things phenomenon in the near future, is having the sensors agree on the monitored data. To this end, various consensus algorithms have been developed. These algorithms aim to meet various criteria such as low computational complexity, rapid convergence and low energy consumption. Furthermore, consensus algorithms have also been used in areas such as having mobile autonomous devices meet at a rendezvous point. In this thesis, our aim is to compare, by means of simulations, different consensus algorithms developed to meet different criteria and provide advantages and disadvantages of each depending on the usage area.