Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе: https://open.uns.ac.rs/handle/123456789/11597
Nаziv: Scheduling in 6TiSCH Networks via Max-Product Message-Passing
Аutоri: Devaja, Tijana 
Bajović, Dragana 
Vukobratović, Dejan 
Gardašević G.
Dаtum izdаvаnjа: 1-јул-2019
Čаsоpis: EUROCON 2019 - 18th International Conference on Smart Technologies
Sažetak: © 2019 IEEE. Industrial Internet of Things (IoT) wireless solutions are getting increased attention both in research and industry due to proliferation of low cost IoT solutions and benefits of massive data collection and analysis. One of the recently proposed solutions for IIoT is the 6TiSCH (IPv6 over the TSCH mode of IEEE 802. 15.4e) protocol stack. However, efficient design of 6TiSCH protocol, and in particular, scheduling strategies that would maintain both high throughput and network reliability, is an open problem. In this paper, we provide an initial study of how this problem can be modelled and solved using the probabilistic graphical models framework and adjoined message-passing methods. In particular, we represent the scheduling problem as the maximum weighted independent set (MWIS) problem, which is generally known to be NP-hard, and solve it approximately but efficiently using the message-passing max-product belief propagation (BP) method. The proposed method is described in detail and demonstrated on a toy example of an IEEE 802. 15.4e network.
URI: https://open.uns.ac.rs/handle/123456789/11597
ISBN: 9781538693018
DOI: 10.1109/EUROCON.2019.8861979
Nаlаzi sе u kоlеkciјаmа:FTN Publikacije/Publications

Prikаzаti cеlоkupаn zаpis stаvki

SCOPUSTM   
Nаvоđеnjа

2
prоvеrеnо 14.09.2022.

Prеglеd/i stаnicа

30
Prоtеklа nеdеljа
7
Prоtеkli mеsеc
0
prоvеrеnо 10.05.2024.

Google ScholarTM

Prоvеritе

Аlt mеtrikа


Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.