Joint Forecasting-Scheduling for the Internet of Things
dc.authorscopusid | 57212473263 | |
dc.authorscopusid | 6602651842 | |
dc.authorscopusid | 55937768800 | |
dc.authorscopusid | 14521079300 | |
dc.contributor.author | Nakip, Mert | |
dc.contributor.author | Rodoplu, Volkan | |
dc.contributor.author | Güzeliş, C. | |
dc.contributor.author | Eliiyi, Deniz Türsel | |
dc.date.accessioned | 2022-02-15T16:58:11Z | |
dc.date.available | 2022-02-15T16:58:11Z | |
dc.date.issued | 2019 | |
dc.department | Bakırçay Üniversitesi | en_US |
dc.description | 2019 IEEE Global Conference on Internet of Things, GCIoT 2019 -- 4 December 2019 through 7 December 2019 -- -- 159114 | en_US |
dc.description.abstract | We present a joint forecasting-scheduling (JFS) system, to be implemented at an IoT Gateway, in order to alleviate the Massive Access Problem of the Internet of Things. The existing proposals to solve the Massive Access Problem model the traffic generation pattern of each IoT device via random arrivals. In contrast, our JFS system forecasts the traffic generation pattern of each IoT device and schedules the transmissions of these devices in advance. The comparison of the network throughput of Autoregressive Integrated Moving Average (ARIMA), Multi-Layer Perceptron (MLP) and Long-Short Term Memory (LSTM) forecasting models reveals that the optimal choice of the forecasting model for JFS depends heavily on the proportions of distinct IoT device classes that are present in the network. Simulations show that our JFS system scales up to 1000 devices while achieving a total execution time under 1 second. This work opens the way to the design of scalable joint forecasting-scheduling solutions at IoT Gateways. © 2019 IEEE. | en_US |
dc.description.sponsorship | Türkiye Bilimsel ve Teknolojik Araştirma Kurumu, TÜBITAK: 118E277 | en_US |
dc.description.sponsorship | ACKNOWLEDGMENT This work was supported by TÜBITAK (Scientific and Technological Research Council of Turkey) under the 1001 Program Grant # 118E277. | en_US |
dc.description.sponsorship | This work was supported by TUBITAK (Scientific and Technological Research Council of Turkey) under the 1001 Program Grant # 118E277. | en_US |
dc.identifier.doi | 10.1109/GCIoT47977.2019.9058408 | |
dc.identifier.isbn | 9781728148731 | |
dc.identifier.scopus | 2-s2.0-85084119422 | en_US |
dc.identifier.scopusquality | N/A | en_US |
dc.identifier.uri | https://doi.org/10.1109/GCIoT47977.2019.9058408 | |
dc.identifier.uri | https://hdl.handle.net/20.500.14034/361 | |
dc.indekslendigikaynak | Scopus | en_US |
dc.language.iso | en | en_US |
dc.publisher | Institute of Electrical and Electronics Engineers Inc. | en_US |
dc.relation.journal | 2019 IEEE Global Conference on Internet of Things, GCIoT 2019 | en_US |
dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Anomaly Detection | en_US |
dc.subject | Concept Drift | en_US |
dc.subject | Internet of Things | en_US |
dc.subject | Intrusion Detection | en_US |
dc.subject | Online Machine Learning | en_US |
dc.subject | Autoregressive moving average model | en_US |
dc.subject | Forecasting | en_US |
dc.subject | Gateways (computer networks) | en_US |
dc.subject | Long short-term memory | en_US |
dc.subject | Scheduling | en_US |
dc.subject | Auto-regressive integrated moving average | en_US |
dc.subject | Forecasting modeling | en_US |
dc.subject | Forecasting models | en_US |
dc.subject | Multi layer perceptron | en_US |
dc.subject | Network throughput | en_US |
dc.subject | Optimal choice | en_US |
dc.subject | Problem modeling | en_US |
dc.subject | Traffic generation | en_US |
dc.subject | Internet of things | en_US |
dc.title | Joint Forecasting-Scheduling for the Internet of Things | en_US |
dc.type | Conference Object | en_US |
Dosyalar
Orijinal paket
1 - 1 / 1
Küçük Resim Yok
- İsim:
- Joint_Forecasting-Scheduling_for_the_Internet_of_Things.pdf
- Boyut:
- 1.21 MB
- Biçim:
- Adobe Portable Document Format
- Açıklama:
- Tam Metin / Full Text