Usmerjevalni algoritmi v brezžičnih senzorskih omrežjih

Hočevar, Mark (author), Bulić, Patricio (mentor)

Brezžična senzorska omrežja so omrežja, sestavljena iz več naprav za zajem podatkov iz okolice, na primer temperature. Običajno so senzorske naprave baterijsko napajane, zato morajo algoritmi za usmerjanje paketov enakomerno obremenjevati vse naprave, da ne pride do predhodnega ugašanja le-teh. V delu smo naredili pregled obstoječih algoritmov za usmerjanje v brezžičnih senzorskih omrežjih in simulacije časa odpovedi ter primerjavo treh algoritmov: algoritma energetsko učinkovitega usmerjanja (EAR), algoritma gradientnega usmerjanja in algoritma usmerjanja na principu nizkoenergetske adaptivne hierarhije gruče (LEACH). Simulacije smo izvedli na omrežjih, ki so se razlikovala po topologiji in velikosti. Po naših primerjalnih kriterijih so algoritmi medsebojno konkurenčni. Osredotočili smo se na primerjavo časa odpovedi posameznih vozlišč in sicer prvo odpoved, odpoved 10% omrežja in odpoved polovice omrežja. Najbolje se je odrezal algoritem LEACH, njegova slabost pa je potreba po neposredni komunikaciji vseh vozlišč s prehodom. Pri algoritmu EAR in algoritmu gradientnega usmerjanja nismo omejeni z velikostjo nadzorovanega območja, vendar moramo zagotoviti dovolj vmesnih vozlišč za pot do prehoda.

• Language: Slovenian
• Keywords: internet stvari, usmerjanje v omrežju, brezžični senzorji, topologija omrežja
• Work type: Master's thesis/paper
• Organization: FRI - Faculty of Computer and Information Science
• Year: 2018
• PID: 20.500.12556/RUL-103093
• Publication date in RUL: 13.09.2018

Secondary language

• Language: English
• Title: Routing algorithms for wireless sensor networks

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.

• Keywords: internet of things, network routing, wireless sensors, network topology