{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T04:06:35Z","timestamp":1754193995819,"version":"3.41.0"},"reference-count":42,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2019,2,10]],"date-time":"2019-02-10T00:00:00Z","timestamp":1549756800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100002463","name":"General Motors Corporation","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100002463","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Office of Naval Research under ONR Award","award":["N00014-17-2216"],"award-info":[{"award-number":["N00014-17-2216"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Sen. Netw."],"published-print":{"date-parts":[[2019,2,28]]},"abstract":"<jats:p>Applying wireless technologies in cyber-physical systems (CPSs) has received significant attention in recent years. In our previous work, a high-speed and flexible real-time wireless communication protocol called RT-WiFi was designed to support a wide range of CPSs, and we presented an implementation with a single access point (AP). To serve the CPS applications with communication nodes geographically distributed over a large area, multicluster RT-WiFi networks with multiple APs need to be deployed. Although effective scheduling algorithms have been designed to schedule tasks in RT-WiFi networks with a single AP, uncoordinated packet transmissions from multicluster RT-WiFi networks may suffer from cochannel interferences that cause performance degradation. The multicluster RT-WiFi network management problem is to resolve the cochannel interference through channel assignment for clusters and through phasing assignment for communication tasks. In this article, we first derive a conjunctive normal form encoding of the problem and design a TScheduler that searches feasible solutions through the SAT solver. A novel LRTree Scheduler is further designed to solve the problem in chain graphs while keeping the number of used channels small and the network management overhead low. A testbed of the multicluster RT-WiFi network is deployed to validate the design of the multicluster RT-WiFi network and evaluate the performance of the proposed scheduling algorithms compared to the contention-based methods in regular WiFi networks. Performance of these scheduling algorithms in large-scale networks is further evaluated through extensive simulations on both static and dynamic multicluster RT-WiFi networks.<\/jats:p>","DOI":"10.1145\/3283451","type":"journal-article","created":{"date-parts":[[2019,2,11]],"date-time":"2019-02-11T13:11:45Z","timestamp":1549890705000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Network Management of Multicluster RT-WiFi Networks"],"prefix":"10.1145","volume":"15","author":[{"given":"Quan","family":"Leng","sequence":"first","affiliation":[{"name":"The University of Texas at Austin"}]},{"given":"Wei-Ju","family":"Chen","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin"}]},{"given":"Pei-Chi","family":"Huang","sequence":"additional","affiliation":[{"name":"The University of Nebraska at Omaha"}]},{"given":"Yi-Hung","family":"Wei","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin"}]},{"given":"Aloysius K.","family":"Mok","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin"}]},{"given":"Song","family":"Han","sequence":"additional","affiliation":[{"name":"University of Connecticut"}]}],"member":"320","published-online":{"date-parts":[[2019,2,10]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Fieldbus Foundation. 2006. Fieldbus. Retrieved from http:\/\/www.fieldbus.org\/.  Fieldbus Foundation. 2006. Fieldbus. Retrieved from http:\/\/www.fieldbus.org\/."},{"key":"e_1_2_1_2_1","unstructured":"Microsoft. 2016. Intel Galileo Board. Retrieved from https:\/\/software.intel.com\/en-us\/iot\/hardware\/galileo.  Microsoft. 2016. Intel Galileo Board. Retrieved from https:\/\/software.intel.com\/en-us\/iot\/hardware\/galileo."},{"key":"e_1_2_1_3_1","unstructured":"ns developers. 2016. The ns-3 network simulator. Retrieved from http:\/\/www.nsnam.org.  ns developers. 2016. The ns-3 network simulator. Retrieved from http:\/\/www.nsnam.org."},{"key":"e_1_2_1_4_1","unstructured":"PTP project developers. 2016. Precision Time Protocol Daemon. Retrieved from http:\/\/sourceforge.net\/projects\/ptpd\/.  PTP project developers. 2016. Precision Time Protocol Daemon. Retrieved from http:\/\/sourceforge.net\/projects\/ptpd\/."},{"key":"e_1_2_1_5_1","volume-title":"International Joint Conference on Artificial Intelligence (IJCAI'09)","author":"Audemard Gilles","year":"2009","unstructured":"Gilles Audemard and Laurent Simon . 2009 . Predicting learnt clauses quality in modern SAT solvers . In International Joint Conference on Artificial Intelligence (IJCAI'09) . 399--404. Gilles Audemard and Laurent Simon. 2009. Predicting learnt clauses quality in modern SAT solvers. In International Joint Conference on Artificial Intelligence (IJCAI'09). 399--404."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2006.887290"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.1028"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ECRTS.2011.15"},{"volume-title":"Measurement, Control, and Communication Using IEEE 1588","author":"Eidson John C.","key":"e_1_2_1_9_1","unstructured":"John C. Eidson . 2010. Measurement, Control, and Communication Using IEEE 1588 . Springer . John C. Eidson. 2010. Measurement, Control, and Communication Using IEEE 1588. Springer."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-009-0183-0"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1574-6526(07)03002-7"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2502524.2502550"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2006.887288"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMECH.2008.2008803"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.6028\/jres.084.024"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2014.26"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2502524.2502549"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2497161"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/882482.883828"},{"volume-title":"2001 European Control Conference (ECC\u201901)","author":"Marti P.","key":"e_1_2_1_22_1","unstructured":"P. Marti , Ricard Villa , Josep M. Fuertes , and G. Fohle . 2001. On real-time control tasks schedulability . In 2001 European Control Conference (ECC\u201901) . IEEE, 2227--2232. P. Marti, Ricard Villa, Josep M. Fuertes, and G. Fohle. 2001. On real-time control tasks schedulability. In 2001 European Control Conference (ECC\u201901). IEEE, 2227--2232."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1002\/1097-0037(200009)36:2<114::AID-NET6>3.0.CO;2-G"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1094549.1094554"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/512321.512325"},{"volume-title":"International Computing and Combinatorics Conference. Springer, 328--337","author":"Narayanaswamy N. S.","key":"e_1_2_1_26_1","unstructured":"N. S. Narayanaswamy and C. E. Veni Madhavan . 2001. On assigning prefix free codes to the vertices of a graph . In International Computing and Combinatorics Conference. Springer, 328--337 . N. S. Narayanaswamy and C. E. Veni Madhavan. 2001. On assigning prefix free codes to the vertices of a graph. In International Computing and Combinatorics Conference. Springer, 328--337."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ECRTS.2015.21"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/1251086.1251114"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1019126406181"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1151659.1159921"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132905.1132927"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2015.23"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2010.41"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ECRTS.2011.12"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2014.2322609"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/1740954.1741111"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2010.42"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTAS.2008.15"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2015.29"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2006.07.016"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-007-9094-6"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1161089.1161119"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2013.22"},{"volume-title":"IEEE International Conference on Robotics and Biomimetics (ROBIO\u201902)","author":"Zhang W.","key":"e_1_2_1_44_1","unstructured":"W. Zhang , X. Zhu , S. Han , N. Byl , A. K. Mok , and M. Tomizuka . 2012. Design of a network-based mobile gait rehabilitation system . In IEEE International Conference on Robotics and Biomimetics (ROBIO\u201902) . 1773--1778. W. Zhang, X. Zhu, S. Han, N. Byl, A. K. Mok, and M. Tomizuka. 2012. Design of a network-based mobile gait rehabilitation system. In IEEE International Conference on Robotics and Biomimetics (ROBIO\u201902). 1773--1778."}],"container-title":["ACM Transactions on Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3283451","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3283451","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:58:06Z","timestamp":1750208286000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3283451"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,10]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,2,28]]}},"alternative-id":["10.1145\/3283451"],"URL":"https:\/\/doi.org\/10.1145\/3283451","relation":{},"ISSN":["1550-4859","1550-4867"],"issn-type":[{"type":"print","value":"1550-4859"},{"type":"electronic","value":"1550-4867"}],"subject":[],"published":{"date-parts":[[2019,2,10]]},"assertion":[{"value":"2017-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-02-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}