Bringing Order to Chaos Clustering in Wireless Sensor Networks
Examensarbete för masterexamen
Computer systems and networks (MPCSN), MSc
Wireless Sensor Networks are becoming more and more popular with the decrease in cost to manufacture sensor nodes and the increased popularity of cyber-physical systems. One of the most significant challenges for Wireless Sensor Networks is to minimise the energy consumption of the nodes, as their battery capacity is often limited, and they are expected to work without human intervention for several years at a time. Another challenge for Wireless Sensor Networks is scalability since they may scale to thousands of nodes. Clustering is a widely used technique to both decrease energy consumption and increase scalability. In this thesis, we aim to increase the network lifetime and the scalability of the A2 system, by integrating clustering with it. Our starting point, A2, is a system which brings distributed consensus to multi-hop networks implemented on ContikiOS. Our work consists of designing and implementing a clustering scheme, based on the HEED clustering algorithm, to partition the network and create a hierarchical communication medium. We evaluate our work in the Cooja simulator and on the Flocklab testbed, and compare it to the original implementation of A2 using the metrics stability, reliability, latency, and energy usage. Our evaluation shows that we achieve similar reliability to the A2 system but lower stability. However, for the largest network we evaluated, with 200 nodes, we achieve both better latency and lower energy consumption.
Data- och informationsvetenskap , Computer and Information Science