Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Theesid Sriprasert"'
Autor:
Amir Parnianifard, Theesid Sriprasert, Pruk Sasithong, Muhammad Saadi, Warakorn Srichavengsup, Pisit Vanichchanunt, Rafee Al Ahsan, Lunchakorn Wuttisittikulkij, Varanya Plodchinda
Publikováno v:
2021 36th International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC).
The hidden station is a major problem in Wireless Local Area Network (WLAN). As the hidden stations obstruct the perception of transmitting packets, this results in a collision during transmission. In this paper, a discrete-time simulation for IEEE80
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::86fc746ddeca28b2ab802c776423967a
https://doi.org/10.1109/itc-cscc52171.2021.9501431
https://doi.org/10.1109/itc-cscc52171.2021.9501431
Autor:
Theesid Sriprasert, Manus Pengnoo, Pruk Sasithong, K. Panyim, Muhammad Saadi, Sanika K. Wijayasekara, Lunchakorn Wuttisittikulkij
Publikováno v:
2020 International Conference on Electronics, Information, and Communication (ICEIC).
This paper describes a frame-based anti-collision algorithm which is compatible with the current RFID standard of EPCglobal Gen-2 that employs a frame slotted ALOHA approach to detect the tags. The proposed algorithm is derived from the existing tree
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::97d824ec2283a7db4a0a0f7a7d20645c
https://doi.org/10.1109/iceic49074.2020.9051190
https://doi.org/10.1109/iceic49074.2020.9051190
Autor:
Pruk Sasithong, Lunchakorn Wuttisittikulkij, Sanika K. Wijayasekara, Theesid Sriprasert, Vitawat Sittakul, Hung-Yun Hsieh
Publikováno v:
2019 16th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON).
More recently, a centralized traffic-aware scheduling algorithm(TASA)for IEEE 802. 15.4e time slotted channel hopping (TSCH) has been proposed that yields a low latency scheduling mechanism compared to existing scheduling algorithms. TASA employs an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::09748347accc6aac6ae1f05ee3b345db
https://doi.org/10.1109/ecti-con47248.2019.8955329
https://doi.org/10.1109/ecti-con47248.2019.8955329