Routing algorithms for wireless sensor networks

Mark Hočevar (2018) Routing algorithms for wireless sensor networks. EngD thesis.

Preview

PDF Download (1940Kb)

Abstract

Wireless sensor networks consist of multiple smart devices which are capable of sensing various information from the environment, for example temperature. Nodes used in wireless sensor networks are powered by batteries which can lead to autonomy issues. The main reason for these issues is inefficient packet routing. Some routing algorithms do not load all nodes equally. This means that some of the nodes turn off sooner than others. In this thesis we made a survey of commonly used routing algorithms for wireless sensor networks. We used different simulations to compare algorithms. In our work we focused on three algorithms Energy Aware Routing (EAR), gradient routing and Low-energy adaptive clustering (LEACH). We checked those algorithms on different topologies and network size to check how it affects them. Based on our criteria algorithms are comparable in our simulations. We focused on comparison between time to first death of node, time to death of 10% of nodes and time to death of 50% of nodes. We found out that the LEACH algorithm is best, but it has a disadvantage that all nodes must be able to directly communicate with the gateway. With the EAR algorithm, and gradient routing we are not limited in network size.

Actions (login required)