Enhanced routing algorithm for opportunistic networking: On the improvement of the basic opportunistic networking routing algorithm by the application of machine learning

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F14%3A00240678" target="_blank" >RIV/68407700:21240/14:00240678 - isvavai.cz</a>
Result on the web
<a href="http://www.scopus.com/record/display.uri?eid=2-s2.0-84902310407&origin=resultslist&sort=plf-f&src=s&st1=Enhanced+routing+algorithm+for+opportunistic&st2=&sid=615D962B926000A023237CA84D4A95DA.FZg2ODcJC9ArCe8WOZPvA%3a130&sot=b&sdt=b&sl=59&s=TITLE-ABS-KEY%2" target="_blank" >http://www.scopus.com/record/display.uri?eid=2-s2.0-84902310407&origin=resultslist&sort=plf-f&src=s&st1=Enhanced+routing+algorithm+for+opportunistic&st2=&sid=615D962B926000A023237CA84D4A95DA.FZg2ODcJC9ArCe8WOZPvA%3a130&sot=b&sdt=b&sl=59&s=TITLE-ABS-KEY%2</a>
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Enhanced routing algorithm for opportunistic networking: On the improvement of the basic opportunistic networking routing algorithm by the application of machine learning
Original language description
The opportunistic communication networks are special communication networks where no assumption is made on the existence of a complete path between two nodes wishing to communicate; the source and destination nodes needn't be connected to the same network at the same time. This assumption makes the routing in these networks extremely difficult. We proposed the novel opportunistic networking routing algorithm, which improves the basic opportunistic networking routing algorithm by application of machine learning. The HMM Autonomous Robot Mobility Models and Node Reachability Model are constructed from the observed data and used in a proposed routing scheme in order to compute the combined probabilities of message delivery to the destination node. In theproposed routing scheme, the messages are coppied between two nodes only if the combined probability of the message delivery to the destination node is higher than the preliminary defined limit value. The routing scheme was developed for
Czech name
—
Czech description
—

Project
<a href="/en/project/LG14005" target="_blank" >LG14005: Active membership in IFAC Technical Committee 4.2 on Mechatronic Systems.</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
ICPRAM 2014 - Proceedings of the 3rd International Conference on Pattern Recognition Applications and Methods
ISBN
978-989-758-018-5
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
771-776
Publisher name
Academic Science Research
Place of publication
Paris
Event location
Loire Valley; France
Event date
Mar 6, 2014
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)