Monte Carlo Based Wireless Node Localization
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F14%3A86092132" target="_blank" >RIV/61989100:27240/14:86092132 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.5755/j01.eee.20.6.7260" target="_blank" >http://dx.doi.org/10.5755/j01.eee.20.6.7260</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.5755/j01.eee.20.6.7260" target="_blank" >10.5755/j01.eee.20.6.7260</a>
Alternative languages
Result language
angličtina
Original language name
Monte Carlo Based Wireless Node Localization
Original language description
In this paper we propose the WNMCL algorithm that allows iteratively locate unknown wireless nodes. The algorithm requires only one mobile node, which collects RSS signal from other nodes with unknown position and approximates their distance by path-lossmodel. These data are used for the probability occurrence correction of the nodes in the space modelled by Monte Carlo. The WNMCL algorithm was validated using simulations and the results are presented in this paper.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
JB - Sensors, detecting elements, measurement and regulation
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Elektronika ir elektrotechnika
ISSN
1392-1215
e-ISSN
—
Volume of the periodical
20
Issue of the periodical within the volume
6
Country of publishing house
LT - LITHUANIA
Number of pages
4
Pages from-to
12-16
UT code for WoS article
000340682600003
EID of the result in the Scopus database
—