ČVUT DSpace
  • Search DSpace
  • Čeština
  • Login
  • Čeština
  • Čeština
View Item 
  •   ČVUT DSpace
  • Czech Technical University in Prague
  • Faculty of Information Technology
  • Doctoral Theses - 18000
  • View Item
  • Czech Technical University in Prague
  • Faculty of Information Technology
  • Doctoral Theses - 18000
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Vylepšení směrování v oportunistických sítích pomocí metod strojového učení s učitelem a bez učitele

Improvement of the Routing in Opportunistic Networks by the Application of Unsupervised and Supervised Machine Learning Techniques

Type of document
disertační práce
doctoral thesis
Author
Ladislava Smítková Janků
Supervisor
Hyniová Kateřina
Opponent
Borgia Eleonora
Field of study
Informatika
Study program
Informatika
Institutions assigning rank
katedra číslicového návrhu



Rights
A university thesis is a work protected by the Copyright Act. Extracts, copies and transcripts of the thesis are allowed for personal use only and at one?s own expense. The use of thesis should be in compliance with the Copyright Act http://www.mkcr.cz/assets/autorske-pravo/01-3982006.pdf and the citation ethics http://knihovny.cvut.cz/vychova/vskp.html
Vysokoškolská závěrečná práce je dílo chráněné autorským zákonem. Je možné pořizovat z něj na své náklady a pro svoji osobní potřebu výpisy, opisy a rozmnoženiny. Jeho využití musí být v souladu s autorským zákonem http://www.mkcr.cz/assets/autorske-pravo/01-3982006.pdf a citační etikou http://knihovny.cvut.cz/vychova/vskp.html
Metadata
Show full item record
Abstract
The dissertation thesis deals with the issue of special routing algorithms designed for com-munication in opportunistic networks. We proposed three extended routing algorithms combining unsupervised or supervised learning and existing routing methods. The oppor-tunistic communication networks are the ad-hoc networks where no assumption is made on the existence of a complete physical path between two nodes wishing to communicate. In opportunistic networks, the messages are transmitted when the node opportunistically meets another node; the characteristics of node movement can improve message transmis-sion. In practice, the network nodes can be mobile robots, wireless equipments carried by people, vehicles, wild animals, unmanned aerial vehicles. We have chosen three mutually independent problems to be solved. The rst problem is related to the applicability of unsu-pervised learning to the analysis of the data of node movements including implementation of the routing algorithm using the results of unsupervised learning. The second problem is related to the applicability of supervised learning and implementation of supervised learn-ing into a routing algorithm. The third problem is related to the enhancement of routing algorithms using unsupervised learning (statistical node mobility models) and the active node behavior. The active node behavior means that the node itself actively changes the route in order to move to the location more suitable for forwarding the message. In order to solve the rst problem, we proposed the Routing with Clustering algorithm. This method extends the standard epidemic routing with the limited message buer using knowledge extracted from the training data using clustering. In order to solve the second problem, we proposed a method combining the collection of labeled training data on message deliv-ery, a two class classier and an implementation of this classier into routing algorithm. In order to solve the third problem, we proposed the Active node movement algorithm (ANMA). Two versions of ANMA were designed. The rst version of the algorithm uses node densities in sectors. The second version of ANMA models data using GMRFs. Both versions of the algorithms make decisions about message forwarding and active node devi-ation from its planned route. All the proposed algorithms were tested on simulated data in the simulation environment. The experimental results were compared to the results obtained by the existing standard routing methods: Epidemic routing with the limited iii message buer and PRoPHET routing. All methods show a slight improvement in routing in opportunistic network from the viewpoint of a number of delivered messages or of the number of delivered messages in limited time. The signicant improvement was observed only in experiments using active node movement algorithm (ANMA), where nodes can improve routing using deviation from their planned routes.
 
The dissertation thesis deals with the issue of special routing algorithms designed for communication in opportunistic networks. We proposed three extended routing algorithms combining unsupervised or supervised learning and existing routing methods. The opportunistic communication networks are the ad-hoc networks where no assumption is made on the existence of a complete physical path between two nodes wishing to communicate. In opportunistic networks, the messages are transmitted when the node opportunistically meets another node; the characteristics of node movement can improve message transmission. In practice, the network nodes can be mobile robots, wireless equipments carried by people, vehicles, wild animals, unmanned aerial vehicles. We have chosen three mutually independent problems to be solved. The rst problem is related to the applicability of unsupervised learning to the analysis of the data of node movements including implementation of the routing algorithm using the results of unsupervised learning. The second problem is related to the applicability of supervised learning and implementation of supervised learning into a routing algorithm. The third problem is related to the enhancement of routing algorithms using unsupervised learning (statistical node mobility models) and the active node behavior. The active node behavior means that the node itself actively changes the route in order to move to the location more suitable for forwarding the message. In order to solve the rst problem, we proposed the Routing with Clustering algorithm. This method extends the standard epidemic routing with the limited message buer using knowledge extracted from the training data using clustering. In order to solve the second problem, we proposed a method combining the collection of labeled training data on message delivery, a two class classier and an implementation of this classier into routing algorithm. In order to solve the third problem, we proposed the Active node movement algorithm (ANMA). Two versions of ANMA were designed. The rst version of the algorithm uses node densities in sectors. The second version of ANMA models data using GMRFs. Both versions of the algorithms make decisions about message forwarding and active node deviation from its planned route. All the proposed algorithms were tested on simulated data in the simulation environment. The experimental results were compared to the results obtained by the existing standard routing methods: Epidemic routing with the limited iii message buer and PRoPHET routing. All methods show a slight improvement in routing in opportunistic network from the viewpoint of a number of delivered messages or of the number of delivered messages in limited time. The signicant improvement was observed only in experiments using active node movement algorithm (ANMA), where nodes can improve routing using deviation from their planned routes.
 
URI
http://hdl.handle.net/10467/81943
View/Open
PLNY_TEXT (6.208Mb)
Collections
  • Disertační práce - 18000 [37]

Related items

Showing items related by title, author, creator and subject.

  • Network Channel State Estimation for WPNC Radio Networks 

    Author: Matěj Červený; Supervisor: Sýkora Jan; Opponent: Hekrdla Miroslav
    (České vysoké učení technické v Praze. Vypočetní a informační centrum.Czech Technical University in Prague. Computing and Information Centre., 2021-06-09)
    Tématem této práce je zpracování stochastických signálů MAC fáze jednoduchých WPNC rádiových sítí. Čtenáři se nejprve seznámí se základy digitální komunikace, estimace a kódování na fyzické vrstvě sítě (WPNC). Práce je ...
  • Rozšíření síťového simulátoru o připojení do reálné sítě 

    Author: Mach Václav; Supervisor: Kubalík Pavel; Opponent: Čejka Tomáš
    (České vysoké učení technické v Praze. Vypočetní a informační centrum., 2014-06-27)
  • Structural optimization applying neural networks 

    Author: Müller Jacob; Supervisor: Křístek Vladimír; Opponent: Procházka Petr
    (České vysoké učení technické v Praze. Vypočetní a informační centrum., 2013-05-24)
    Structures are designed to fulfill requirements established in numerous design codes or standards. After the design and construction phase is completed, only a few - sophisticated or important structures, such as bridges ...

České vysoké učení technické v Praze copyright © 2016 

DSpace software copyright © 2002-2016  Duraspace

Contact Us | Send Feedback
Theme by 
@mire NV
 

 

Useful links

CTU in PragueCentral library of CTUAbout CTU Digital LibraryResourcesStudy and library skillsResearch support

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

České vysoké učení technické v Praze copyright © 2016 

DSpace software copyright © 2002-2016  Duraspace

Contact Us | Send Feedback
Theme by 
@mire NV