Vystyti mikrosensorinio tinklo duomenų perdavimą racionalaus maršrutizavimo sistemoje. Minimizuoti perdavimų skaičių, sudarant bevielį mikrosensorinį tinklą. Taip pat, trumpinti skaičiavimo procesus, kai mazgai turi atlikti racionalų maršrutizavimą. Bevielio mikrosensorinio tinklo trumpiausio kelio radimas turi būti paprastai realizuojamas ir skaičiuojamas. / In this paper it is described a method of creation of the shortest path algorithm for wireless sensor networks. Algorithm computes optimal shortest path and works on any wireless sensor networks topology. One of the limitations of wireless sensor nodes is their inherent limited energy resource. The limited available energy of sensor nodes is mainly problem making communication and computational processing. An energy efficient routing protocol can limit the number of nodes transmissions and the computational complexity of finding the shortest routing path. In the experimental part, the correct functionality of the algorithm is evaluated and the results are analized.
Identifer | oai:union.ndltd.org:LABT_ETD/oai:elaba.lt:LT-eLABa-0001:E.02~2007~D_20070816_143810-31661 |
Date | 16 August 2007 |
Creators | Gaudėšius, Rolandas |
Contributors | Telksnys, Laimutis, Maciulevičius, Stasys, Barauskas, Rimantas, Jasinevičius, Raimundas, Mockus, Jonas, Plėštys, Rimantas, Pranevičius, Henrikas, Kazanavičius, Egidijus, Kanapeckas, Pranas, Kaunas University of Technology |
Publisher | Lithuanian Academic Libraries Network (LABT), Kaunas University of Technology |
Source Sets | Lithuanian ETD submission system |
Language | Lithuanian |
Detected Language | English |
Type | Master thesis |
Format | application/pdf |
Source | http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2007~D_20070816_143810-31661 |
Rights | Unrestricted |
Page generated in 0.0021 seconds