{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/105267"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/105267","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Scheduling shared data acquisition for real-time decision making","abstract":"This work 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 needed to make multiple decisions. For example, data from several cameras in a contested city might be needed to decide where targets of interest are. This work is based on the assumption that network bandwidth is limited, creating a significant resource bottleneck (perhaps between the sensors and the command center where decisions are made). This might be the case, for example, due to active interference by a determined adversary. A relieved sub-problem is first discussed with a corresponding optimal algorithm. Then, an improved heuristic algorithm based on the insights from the optimal algorithm of the sub-problem is presented. Finally, the new algorithm is evaluated with multiple scheduling parameters and is compared with previous heuristics, demonstrating an improved performance of our solution.","abstract_html":"This work 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 needed to make multiple decisions. For example, data from several cameras in a contested city might be needed to decide where targets of interest are. This work is based on the assumption that network bandwidth is limited, creating a significant resource bottleneck (perhaps between the sensors and the command center where decisions are made). This might be the case, for example, due to active interference by a determined adversary. A relieved sub-problem is first discussed with a corresponding optimal algorithm. Then, an improved heuristic algorithm based on the insights from the optimal algorithm of the sub-problem is presented. Finally, the new algorithm is evaluated with multiple scheduling parameters and is compared with previous heuristics, demonstrating an improved performance of our solution.","abstract_has_math":false,"creators":["Cheng, Tai-Sheng"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Abdelzaher, Tarek"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2019,"date_issued":"2019-08-23T20:48:27Z","date_published":"2019-08-23T20:48:27Z","updated_at":"2026-07-22T22:24:44Z","subjects":["Real-time Scheduling","Data Freshness"],"languages":["en"],"rights":["Copyright 2019 Tai-Sheng Cheng"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/105267","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Abdelzaher, Tarek"]},{"key":"dc:creator","label":"Author","values":["Cheng, Tai-Sheng"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2019-08-23T20:48:27Z","2021-08-24T09:15:28Z","2019-04-25","2019-05"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Real-time Scheduling","Data Freshness"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2019 Tai-Sheng Cheng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/105267"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["This work 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 needed to make multiple decisions. For example, data from several cameras in a contested city might be needed to decide where targets of interest are. This work is based on the assumption that network bandwidth is limited, creating a significant resource bottleneck (perhaps between the sensors and the command center where decisions are made). This might be the case, for example, due to active interference by a determined adversary. A relieved sub-problem is first discussed with a corresponding optimal algorithm. Then, an improved heuristic algorithm based on the insights from the optimal algorithm of the sub-problem is presented. Finally, the new algorithm is evaluated with multiple scheduling parameters and is compared with previous heuristics, demonstrating an improved performance of our solution.","Submission published under a 24 month embargo labeled 'Closed Access', the embargo will last until 2021-05-01","The student, Tai-Sheng Cheng, accepted the attached license on 2019-04-25 at 13:56.","The student, Tai-Sheng Cheng, submitted this Thesis for approval on 2019-04-25 at 13:57.","This Thesis was approved for publication on 2019-04-25 at 16:15.","DSpace SAF Submission Ingestion Package generated from Vireo submission #13919 on 2019-08-22 at 16:23:58","Made available in DSpace on 2019-08-23T20:48:27Z (GMT). No. of bitstreams: 2 CHENG-THESIS-2019.pdf: 395566 bytes, checksum: d8ddd83ce8457d15574c36fd8fed9681 (MD5) LICENSE.txt: 4212 bytes, checksum: c9cdcc16f73ea264ce516b259ecf5952 (MD5) Previous issue date: 2019-04-25","Embargo set by: Seth Robbins for item 112389 Lift date: 2021-08-23T20:48:32Z Reason: Author requested closed access (OA after 2yrs) in Vireo ETD system","Limited Restriction Lifted for Item 112389 on 2021-08-24T09:15:28Z."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Scheduling shared data acquisition for real-time decision making"]}]}],"canonical_facts":{"dc:contributor":["Abdelzaher, Tarek"],"dc:creator":["Cheng, Tai-Sheng"],"dc:date":["2019-08-23T20:48:27Z","2021-08-24T09:15:28Z","2019-04-25","2019-05"],"dc:description":["This work 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 needed to make multiple decisions. For example, data from several cameras in a contested city might be needed to decide where targets of interest are. This work is based on the assumption that network bandwidth is limited, creating a significant resource bottleneck (perhaps between the sensors and the command center where decisions are made). This might be the case, for example, due to active interference by a determined adversary. A relieved sub-problem is first discussed with a corresponding optimal algorithm. Then, an improved heuristic algorithm based on the insights from the optimal algorithm of the sub-problem is presented. Finally, the new algorithm is evaluated with multiple scheduling parameters and is compared with previous heuristics, demonstrating an improved performance of our solution.","Submission published under a 24 month embargo labeled 'Closed Access', the embargo will last until 2021-05-01","The student, Tai-Sheng Cheng, accepted the attached license on 2019-04-25 at 13:56.","The student, Tai-Sheng Cheng, submitted this Thesis for approval on 2019-04-25 at 13:57.","This Thesis was approved for publication on 2019-04-25 at 16:15.","DSpace SAF Submission Ingestion Package generated from Vireo submission #13919 on 2019-08-22 at 16:23:58","Made available in DSpace on 2019-08-23T20:48:27Z (GMT). No. of bitstreams: 2 CHENG-THESIS-2019.pdf: 395566 bytes, checksum: d8ddd83ce8457d15574c36fd8fed9681 (MD5) LICENSE.txt: 4212 bytes, checksum: c9cdcc16f73ea264ce516b259ecf5952 (MD5) Previous issue date: 2019-04-25","Embargo set by: Seth Robbins for item 112389 Lift date: 2021-08-23T20:48:32Z Reason: Author requested closed access (OA after 2yrs) in Vireo ETD system","Limited Restriction Lifted for Item 112389 on 2021-08-24T09:15:28Z."],"dc:format":["application/pdf"],"dc:identifier":["http://hdl.handle.net/2142/105267"],"dc:language":["en"],"dc:rights":["Copyright 2019 Tai-Sheng Cheng"],"dc:subject":["Real-time Scheduling","Data Freshness"],"dc:title":["Scheduling shared data acquisition for real-time decision making"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:24:44Z"}