Přístupnostní navigace
E-přihláška
Vyhledávání Vyhledat Zavřít
Detail publikace
KENYERES, M. KENYERES, J. RUPP, M. FARKAŠ, P.
Originální název
Iterative timing for wireless sensor networks
Typ
článek ve sborníku ve WoS nebo Scopus
Jazyk
angličtina
Originální abstrakt
The synchronization and timing are considered as one of the major issues in WSNs. In this paper, we propose a simple concept that allows the nodes to synchronize and to establish a notion of global time throughout the sensors. Owing to this, the nodes are able to maintain a TDMA based access to the shared channel and coexist in a collision-free environment. We achieve this without the need of a physical clock synchronization. While we focus on relatively simple applications in our lab experiments, we demonstrate that the proposed method fundamentally improves the timing situation and thus offers a great potential for future applications.
Klíčová slova
clocks, synchronisation, telecommunication channels, time division multiple access, wireless sensor networks, TDMA, WSN, collision-free, environment, iterative timing, physical clock synchronization, shared channel, timing situation, wireless sensor networks, TDMA, WSN, synchronization, timing
Autoři
KENYERES, M.; KENYERES, J.; RUPP, M.; FARKAŠ, P.
Rok RIV
2012
Vydáno
11. 4. 2012
Nakladatel
IEEE
Místo
Vienna
ISBN
978-3-200-02328-4
Kniha
Systems, Signals and Image Processing (IWSSIP), 2012 19th International Conference on
ISSN
2157-8672
Periodikum
International Conference on Systems, Signals, and Image Processing
Ročník
19
Stát
neuvedeno
Strany od
97
Strany do
103
Strany počet
7
BibTex
@inproceedings{BUT109554, author="Martin {Kenyeres} and Jozef {Kenyeres} and Markus {Rupp} and Peter {Farkaš}", title="Iterative timing for wireless sensor networks", booktitle="Systems, Signals and Image Processing (IWSSIP), 2012 19th International Conference on", year="2012", journal="International Conference on Systems, Signals, and Image Processing", volume="19", pages="97--103", publisher="IEEE", address="Vienna", isbn="978-3-200-02328-4", issn="2157-8672" }