TY - GEN
T1 - Scheduling shared data acquisition for real-time decision making
AU - Cheng, Tai Sheng
AU - Abdelzaher, Tarek
N1 - Funding Information:
ACKNOWLEDGEMENT Research reported in this paper was sponsored in part by the Army Research Laboratory under Cooperative Agreement W911NF-09-2-0053 and W911NF-17-2-0196, and in part by NSF under grants CNS 16-18627, CNS 13-45266 and CNS 13-20209. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the Army Research Laboratory, NSF, or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation here on. REFERENCES
Funding Information:
Research reported in this paper was sponsored in part by the Army Research Laboratory under Cooperative Agreement W911NF-09-2-0053 and W911NF-17-2-0196, and in part by NSF under grants CNS 16-18627, CNS 13-45266 and CNS 13-20209.
Publisher Copyright:
© 2019 IEEE.
PY - 2019/8
Y1 - 2019/8
N2 - This paper investigates scheduling policies for the acquisition of possibly overlapping sets of data items required to make multiple decisions by different deadlines. The work is motivated by military IoT applications in which a large number of sensors must collect intelligence data to make multiple decisions. For example, data from several cameras in a large city might be needed to decide where targets of interest are. We assume that network bandwidth is limited, creating a significant resource bottleneck (perhaps between sensors and the command center where decisions are made). This might be the case, for example, due to active interference by an adversary. We begin by introducing some of the observations and properties of the data acquisition scheduling problem followed by a heuristic algorithm based on the insights gained from these observations. Finally, we evaluate the new algorithm across multiple parameters and compare the results with previous heuristics, demonstrating improved performance of our solution.
AB - This paper investigates scheduling policies for the acquisition of possibly overlapping sets of data items required to make multiple decisions by different deadlines. The work is motivated by military IoT applications in which a large number of sensors must collect intelligence data to make multiple decisions. For example, data from several cameras in a large city might be needed to decide where targets of interest are. We assume that network bandwidth is limited, creating a significant resource bottleneck (perhaps between sensors and the command center where decisions are made). This might be the case, for example, due to active interference by an adversary. We begin by introducing some of the observations and properties of the data acquisition scheduling problem followed by a heuristic algorithm based on the insights gained from these observations. Finally, we evaluate the new algorithm across multiple parameters and compare the results with previous heuristics, demonstrating improved performance of our solution.
UR - http://www.scopus.com/inward/record.url?scp=85074197090&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85074197090&partnerID=8YFLogxK
U2 - 10.1109/RTCSA.2019.8864560
DO - 10.1109/RTCSA.2019.8864560
M3 - Conference contribution
AN - SCOPUS:85074197090
T3 - Proceedings - 2019 IEEE 25th International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2019
BT - Proceedings - 2019 IEEE 25th International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2019
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 25th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2019
Y2 - 18 August 2019 through 21 August 2019
ER -