TY - GEN
T1 - Minimum Latency Aggregation Scheduling in Internet of Things
AU - An, Min Kyung
AU - Cho, Hyuk
AU - Zhou, Bing
AU - Chen, Lei
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/4/8
Y1 - 2019/4/8
N2 - The Minimum Latency Aggregation Scheduling (MLAS) problem in Wireless Sensor Networks (WSNs) targets to attain aggregation schedules that satisfy the two desirable properties: minimum latency and no collisions. Researchers adapt the conventional homogeneous and heterogeneous WSNs to address the MLAS problem in Internet of Things (IoTs) as WSN technology is an essential component of an IoT. However, usual WSNs assume devices to use one single protocol, while some IoTs require heterogeneous devices to use different protocols. Therefore, calling a WSN an IoT is a misnomer and accordingly existing approaches may not properly realize broader IoT environments. In this paper, we clarify the distinction between WSNs and IoTs in terms of types of devices and protocols. Then, we provide a constant-factor approximation algorithm that can fully address the MLAS problem in IoTs. To the best of our knowledge, it is the first constant factor algorithm that addresses the NP-hard problem.
AB - The Minimum Latency Aggregation Scheduling (MLAS) problem in Wireless Sensor Networks (WSNs) targets to attain aggregation schedules that satisfy the two desirable properties: minimum latency and no collisions. Researchers adapt the conventional homogeneous and heterogeneous WSNs to address the MLAS problem in Internet of Things (IoTs) as WSN technology is an essential component of an IoT. However, usual WSNs assume devices to use one single protocol, while some IoTs require heterogeneous devices to use different protocols. Therefore, calling a WSN an IoT is a misnomer and accordingly existing approaches may not properly realize broader IoT environments. In this paper, we clarify the distinction between WSNs and IoTs in terms of types of devices and protocols. Then, we provide a constant-factor approximation algorithm that can fully address the MLAS problem in IoTs. To the best of our knowledge, it is the first constant factor algorithm that addresses the NP-hard problem.
UR - http://www.scopus.com/inward/record.url?scp=85062092927&partnerID=8YFLogxK
U2 - 10.1109/ICCNC.2019.8685660
DO - 10.1109/ICCNC.2019.8685660
M3 - Conference article
AN - SCOPUS:85062092927
T3 - 2019 International Conference on Computing, Networking and Communications, ICNC 2019
SP - 395
EP - 401
BT - 2019 International Conference on Computing, Networking and Communications, ICNC 2019
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2019 International Conference on Computing, Networking and Communications, ICNC 2019
Y2 - 18 February 2019 through 21 February 2019
ER -