TY - GEN
T1 - Density-Based Data Selection and Management for Edge Computing
AU - Oikawa, Hiroki
AU - Kondo, Masaaki
N1 - Funding Information:
ACKNOWLEDGMENT This work was supported, in part, by JST CREST Grant Number JPMJCR18K1 and JPMJCR20F2, Japan.
Publisher Copyright:
© 2021 IEEE.
PY - 2021/3/22
Y1 - 2021/3/22
N2 - Wide spread of IoT devices has made it possible to acquire enormous amounts of realtime sensor information. Due to the explosive increase in the sensing data volume, it becomes difficult to collect and process all the data in one central place. On one hand, storing and processing data on edge devices, so called edge computing, is becoming important. On the other hand, edge devices usually have only limited computing and memory resources, and hence it is not practical to process and save all the acquired data. There is a great demand of effectively selecting data to process on an edge device or to transfer it to a cloud server. In this paper, we propose an efficient density-based data selection and management method called O-D2M by which edge devices store the data representing inherent data distribution. We use a low cost graph algorithm to analyze input data trend and its density. We evaluate effectiveness of the proposed O-D2M comparing to other methods in terms of the accuracy of machine learning models trained by the selected data. Throughout the evaluation, we confirm that O-D2M obtains higher accuracy and lower computation cost while it can reduce the amount of data to be processed or transferred by up to 20 points.
AB - Wide spread of IoT devices has made it possible to acquire enormous amounts of realtime sensor information. Due to the explosive increase in the sensing data volume, it becomes difficult to collect and process all the data in one central place. On one hand, storing and processing data on edge devices, so called edge computing, is becoming important. On the other hand, edge devices usually have only limited computing and memory resources, and hence it is not practical to process and save all the acquired data. There is a great demand of effectively selecting data to process on an edge device or to transfer it to a cloud server. In this paper, we propose an efficient density-based data selection and management method called O-D2M by which edge devices store the data representing inherent data distribution. We use a low cost graph algorithm to analyze input data trend and its density. We evaluate effectiveness of the proposed O-D2M comparing to other methods in terms of the accuracy of machine learning models trained by the selected data. Throughout the evaluation, we confirm that O-D2M obtains higher accuracy and lower computation cost while it can reduce the amount of data to be processed or transferred by up to 20 points.
KW - edge computing, data management
UR - http://www.scopus.com/inward/record.url?scp=85108081169&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85108081169&partnerID=8YFLogxK
U2 - 10.1109/PERCOM50583.2021.9439127
DO - 10.1109/PERCOM50583.2021.9439127
M3 - Conference contribution
AN - SCOPUS:85108081169
T3 - 2021 IEEE International Conference on Pervasive Computing and Communications, PerCom 2021
BT - 2021 IEEE International Conference on Pervasive Computing and Communications, PerCom 2021
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 19th IEEE International Conference on Pervasive Computing and Communications, PerCom 2021
Y2 - 22 March 2021 through 26 March 2021
ER -