{"id":196,"date":"2023-05-23T14:41:58","date_gmt":"2023-05-23T12:41:58","guid":{"rendered":"https:\/\/www.kth.se\/blogs\/nslab\/?p=196"},"modified":"2023-05-23T14:56:17","modified_gmt":"2023-05-23T12:56:17","slug":"daniels-presentation-at-ipsn-23-deepgantt-a-scalable-deep-learning-scheduler-for-backscatter-networks","status":"publish","type":"post","link":"https:\/\/www.kth.se\/blogs\/nslab\/2023\/05\/daniels-presentation-at-ipsn-23-deepgantt-a-scalable-deep-learning-scheduler-for-backscatter-networks\/","title":{"rendered":"Daniel&#8217;s presentation at IPSN &#8217;23 &#8220;DeepGANTT: A Scalable Deep Learning Scheduler for Backscatter Networks&#8221;"},"content":{"rendered":"<div class=\"post-content-wrapper\"><p>At ACM IPSN &#8217;23 Daniel presented our work on <a href=\"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3583120.3586957\"><b>DeepGANTT,<\/b><\/a> a scheduler which demonstrates our ability to apply transformers to graph neural networks for scaling up an IoT scheduling problem 6X-11X beyond what a constraint optimization solver can solve in a reasonable time. Full abstract is below.<\/p>\n<p>This is joint work with<\/p>\n<p>Daniel F. Perez-Ramirez, Carlos P\u00e9rez-Penichet, Nicolas Tsiftes (RISE), Thiemo Voigt (Uppsala University and RISE), Dejan Kosti\u0107, and Magnus Boman (KTH).<\/p>\n<p>Novel backscatter communication techniques enable battery-free sensor tags to interoperate with unmodified standard IoT devices, extending a sensor network\u2019s capabilities in a scalable manner. Without requiring additional dedicated infrastructure, the battery-free tags harvest energy from the environment, while the IoT devices provide them with the unmodulated carrier they need to communicate. A schedule coordinates the provision of carriers for the communications of battery-free devices with IoT nodes. Optimal carrier scheduling is an NP-hard problem that limits the scalability of network deployments. Thus, existing solutions waste energy and other valuable resources by scheduling the carriers suboptimally. We present DeepGANTT, a deep learning scheduler that leverages graph neural networks to efficiently provide near-optimal carrier scheduling. We train our scheduler with optimal schedules of relatively small networks obtained from a constraint optimization solver, achieving a performance within 3% of the optimum. Without the need to retrain, our scheduler generalizes to networks 6 \u00d7 larger in the number of nodes and 10 \u00d7 larger in the number of tags than those used for training. DeepGANTT breaks the scalability limitations of the optimal scheduler and reduces carrier utilization by up to compared to the state-of-the-art heuristic. As a consequence, our scheduler efficiently reduces energy and spectrum utilization in backscatter networks.<\/p>\n<\/div>","protected":false},"excerpt":{"rendered":"<p>At ACM IPSN &#8217;23 Daniel presented our work on DeepGANTT, a scheduler which demonstrates our ability to apply transformers to graph neural networks for scaling up an IoT scheduling problem 6X-11X beyond what a constraint optimization solver can solve in a reasonable time. Full abstract is below. This is joint work with Daniel F. Perez-Ramirez, [&hellip;]<\/p>\n","protected":false},"author":621,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"inline_featured_image":false,"footnotes":""},"categories":[1],"tags":[],"class_list":["post-196","post","type-post","status-publish","format-standard","hentry","category-okategoriserat"],"jetpack_featured_media_url":"","_links":{"self":[{"href":"https:\/\/www.kth.se\/blogs\/nslab\/wp-json\/wp\/v2\/posts\/196","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.kth.se\/blogs\/nslab\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.kth.se\/blogs\/nslab\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.kth.se\/blogs\/nslab\/wp-json\/wp\/v2\/users\/621"}],"replies":[{"embeddable":true,"href":"https:\/\/www.kth.se\/blogs\/nslab\/wp-json\/wp\/v2\/comments?post=196"}],"version-history":[{"count":2,"href":"https:\/\/www.kth.se\/blogs\/nslab\/wp-json\/wp\/v2\/posts\/196\/revisions"}],"predecessor-version":[{"id":198,"href":"https:\/\/www.kth.se\/blogs\/nslab\/wp-json\/wp\/v2\/posts\/196\/revisions\/198"}],"wp:attachment":[{"href":"https:\/\/www.kth.se\/blogs\/nslab\/wp-json\/wp\/v2\/media?parent=196"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.kth.se\/blogs\/nslab\/wp-json\/wp\/v2\/categories?post=196"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.kth.se\/blogs\/nslab\/wp-json\/wp\/v2\/tags?post=196"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}