Hsieh H.-YSu C.-Y.HUNG-YUN HSIEH2021-09-022021-09-022019https://www.scopus.com/inward/record.uri?eid=2-s2.0-85081979153&doi=10.1109%2fGLOBECOM38437.2019.9013619&partnerID=40&md5=3691663814000de304f853bb99f1df6bhttps://scholars.lib.ntu.edu.tw/handle/123456789/580930In this paper, we consider the problem of minimizing the queue length of wireless sensors involved in data gathering. Unlike conventional approaches, we focus on the received data quality at the collector for optimizing scheduling design. While meeting the minimum data fidelity requirement from the application, we leverage correlation among gathered data to allow proactive data dropping before queue is full and reduce radio resource usage. We first formulate the problem and then transform the time-average resource allocation problem into a scheduling problem based on the Lyapunov optimization framework. To solve the problem, we investigate two heuristic algorithms called allocation-first and drop-first algorithms in addition to the optimal algorithm. Evaluation results show that data-centric algorithms can effectively reduce resource usage and support more sensors compared to the conventional scheduling algorithm while meeting the requirement on data quality. ? 2019 IEEE.Heuristic algorithms; Optimization; Queueing theory; Scheduling; Scheduling algorithms; Conventional approach; Data centric algorithms; Evaluation results; Machine to machines; Optimal algorithm; Optimization framework; Resource allocation problem; Scheduling problem; Machine-to-machine communication[SDGs]SDG8conference paper10.1109/GLOBECOM38437.2019.90136192-s2.0-85081979153