TY - JOUR
T1 - Sensory Data Aggregation in Internet of Things
T2 - Period-Driven Pipeline Scheduling Approach
AU - Nguyen, Tien Dung
AU - Le, Duc Tai
AU - Choo, Hyunseung
N1 - Publisher Copyright:
© 2002-2012 IEEE.
PY - 2022/9/1
Y1 - 2022/9/1
N2 - The Smart City contexts and the adoption of Industry 4.0 are being upgraded with the latest technologies throughout all systems. New data are continuously collected in huge amounts; therefore, an efficient data aggregation scheduling scheme is highly demanded. This paper addresses the minimum time aggregation scheduling problem in duty-cycled sensor networks. Existing solutions schedule the sensory data through predefined routing structures, which limit the utilization of diverse active time slots of sensors. We propose a period-driven pipeline scheduling approach, namely PDA, that simultaneously grows the aggregation tree and assigns a transmission schedule for each node being added to the tree. Particularly, this process is performed in a top-down manner. In each iteration, corresponding to a time slot, PDA uses a multi-level ranking strategy to schedule several sender, receiver 〈sender,receiver〉 pairs, so that in a working period ahead, the possibility to pipeline as many transmissions as possible is high. Intensive simulation results show that the proposed scheme notably works better than the best known recent algorithms by having up to 35 percent shorter aggregation time, as well as having a significantly improved network throughput and time utilization.
AB - The Smart City contexts and the adoption of Industry 4.0 are being upgraded with the latest technologies throughout all systems. New data are continuously collected in huge amounts; therefore, an efficient data aggregation scheduling scheme is highly demanded. This paper addresses the minimum time aggregation scheduling problem in duty-cycled sensor networks. Existing solutions schedule the sensory data through predefined routing structures, which limit the utilization of diverse active time slots of sensors. We propose a period-driven pipeline scheduling approach, namely PDA, that simultaneously grows the aggregation tree and assigns a transmission schedule for each node being added to the tree. Particularly, this process is performed in a top-down manner. In each iteration, corresponding to a time slot, PDA uses a multi-level ranking strategy to schedule several sender, receiver 〈sender,receiver〉 pairs, so that in a working period ahead, the possibility to pipeline as many transmissions as possible is high. Intensive simulation results show that the proposed scheme notably works better than the best known recent algorithms by having up to 35 percent shorter aggregation time, as well as having a significantly improved network throughput and time utilization.
KW - Data aggregation
KW - Internet of Things
KW - minimum time
KW - wireless sensor networks
UR - https://www.scopus.com/pages/publications/85099723444
U2 - 10.1109/TMC.2021.3052803
DO - 10.1109/TMC.2021.3052803
M3 - Article
AN - SCOPUS:85099723444
SN - 1536-1233
VL - 21
SP - 3326
EP - 3341
JO - IEEE Transactions on Mobile Computing
JF - IEEE Transactions on Mobile Computing
IS - 9
ER -