{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T17:12:59Z","timestamp":1780765979858,"version":"3.54.1"},"reference-count":54,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T00:00:00Z","timestamp":1624233600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["U2001204 and 61672131"],"award-info":[{"award-number":["U2001204 and 61672131"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"crossref","award":["2019YFB1703601"],"award-info":[{"award-number":["2019YFB1703601"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Sen. Netw."],"published-print":{"date-parts":[[2021,8,31]]},"abstract":"<jats:p>The Internet of Things (IoT) has been extensively deployed in smart cities. However, with the expanding scale of networking, the failure of some nodes in the network severely affects the communication capacity of IoT applications. Therefore, researchers pay attention to improving communication capacity caused by network failures for applications that require high quality of services (QoS). Furthermore, the robustness of network topology is an important metric to measure the network communication capacity and the ability to resist the cyber-attacks induced by some failed nodes. While some algorithms have been proposed to enhance the robustness of IoT topologies, they are characterized by large computation overhead, and lacking a lightweight topology optimization model. To address this problem, we first propose a novel robustness optimization using evolution learning (ROEL) with a neural network. ROEL dynamically optimizes the IoT topology and intelligently prospects the robust degree in the process of evolutionary optimization. The experimental results demonstrate that ROEL can represent the evolutionary process of IoT topologies, and the prediction accuracy of network robustness is satisfactory with a small error ratio. Our algorithm has a better tolerance capacity in terms of resistance to random attacks and malicious attacks compared with other algorithms.<\/jats:p>","DOI":"10.1145\/3446937","type":"journal-article","created":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T20:19:31Z","timestamp":1624306771000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":23,"title":["Robust Networking: Dynamic Topology Evolution Learning for Internet of Things"],"prefix":"10.1145","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6806-4287","authenticated-orcid":false,"given":"Ning","family":"Chen","sequence":"first","affiliation":[{"name":"Tianjin University, Tianjin, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2324-2523","authenticated-orcid":false,"given":"Tie","family":"Qiu","sequence":"additional","affiliation":[{"name":"Tianjin University, Tianjin, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mahmoud","family":"Daneshmand","sequence":"additional","affiliation":[{"name":"Stevens Institute of Technology, Hoboken, NJ"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dapeng Oliver","family":"Wu","sequence":"additional","affiliation":[{"name":"University of Florida, Gainesville, FL"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,6,21]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366021"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/IWCMC.2015.7289313"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2017.2740929"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2014.2320099"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2017.08.005"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2767023"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2240116.2240123"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/INCOS.2010.24"},{"key":"e_1_2_1_9_1","volume-title":"Emergence of scaling in random networks. Science 286, 5439","author":"Barab\u00e1si Albert L\u00e1szl\u00f3","year":"1999","unstructured":"Albert L\u00e1szl\u00f3 Barab\u00e1si and R\u00e9ka Albert . 1999. Emergence of scaling in random networks. Science 286, 5439 ( 1999 ), 509\u2013512. Albert L\u00e1szl\u00f3 Barab\u00e1si and R\u00e9ka Albert. 1999. Emergence of scaling in random networks. Science 286, 5439 (1999), 509\u2013512."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1907375117"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3306147"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1997005.1997025"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2019.2953364"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2020.02.079"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.001.1900094"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2016.2612041"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3365838"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2013.06.063"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186058"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2011\/01\/P01027"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.65.056109"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2020.04.007"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0059613"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2016.2545559"},{"key":"e_1_2_1_25_1","volume-title":"Improving interdependent networks robustness by adding connectivity links. Physica A: Statistical Mechanics and its Applications 444","author":"Ji Xingpei","year":"2016","unstructured":"Xingpei Ji , Bo Wang , Dichen Liu , Guo Chen , Fei Tang , Daqian Wei , and Lian Tu. 2016. Improving interdependent networks robustness by adding connectivity links. Physica A: Statistical Mechanics and its Applications 444 ( 2016 ), 9\u201319. Xingpei Ji, Bo Wang, Dichen Liu, Guo Chen, Fei Tang, Daqian Wei, and Lian Tu. 2016. Improving interdependent networks robustness by adding connectivity links. Physica A: Statistical Mechanics and its Applications 444 (2016), 9\u201319."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3373417"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2016.2605623"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3166069"},{"key":"e_1_2_1_29_1","volume-title":"Deep learning. Nature 521, 7553","author":"LeCun Yann","year":"2015","unstructured":"Yann LeCun , Yoshua Bengio , and Geoffrey Hinton . 2015. Deep learning. Nature 521, 7553 ( 2015 ), 436. Yann LeCun, Yoshua Bengio, and Geoffrey Hinton. 2015. Deep learning. Nature 521, 7553 (2015), 436."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3234463"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2398463"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186062"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnt010"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2018.2873492"},{"key":"e_1_2_1_35_1","volume-title":"International Conference on Machine Learning. PMLR, 6765\u20136774","author":"Marx Charles","year":"2020","unstructured":"Charles Marx , Flavio Calmon , and Berk Ustun . 2020 . Predictive multiplicity in classification . In International Conference on Machine Learning. PMLR, 6765\u20136774 . Charles Marx, Flavio Calmon, and Berk Ustun. 2020. Predictive multiplicity in classification. In International Conference on Machine Learning. PMLR, 6765\u20136774."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.2977196"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2019.2941458"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2020.3009103"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2019.2907243"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2017.2713530"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2018.02.173"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2019.03.009"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1038\/323533a0"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.3390\/s20020539"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2019.2898174"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2952644"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2011.248"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1009440108"},{"key":"e_1_2_1_49_1","volume-title":"Exploring complex networks. Nature 410, 6825","author":"Strogatz Steven H.","year":"2001","unstructured":"Steven H. Strogatz . 2001. Exploring complex networks. Nature 410, 6825 ( 2001 ), 268. Steven H. Strogatz. 2001. Exploring complex networks. Nature 410, 6825 (2001), 268."},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2011.2116117"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2013.2250910"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2017.2689019"},{"key":"e_1_2_1_53_1","volume-title":"A memetic algorithm for enhancing the robustness of scale-free networks against malicious attacks. Physica A: Statistical Mechanics and its Applications 410","author":"Zhou Mingxing","year":"2014","unstructured":"Mingxing Zhou and Jing Liu . 2014. A memetic algorithm for enhancing the robustness of scale-free networks against malicious attacks. Physica A: Statistical Mechanics and its Applications 410 ( 2014 ), 131\u2013143. Mingxing Zhou and Jing Liu. 2014. A memetic algorithm for enhancing the robustness of scale-free networks against malicious attacks. Physica A: Statistical Mechanics and its Applications 410 (2014), 131\u2013143."},{"key":"e_1_2_1_54_1","first-page":"539","article-title":"A two-phase multiobjective evolutionary algorithm for enhancing the robustness of scale-free networks against multiple malicious attacks","volume":"47","author":"Zhou Mingxing","year":"2017","unstructured":"Mingxing Zhou and Jing Liu . 2017 . A two-phase multiobjective evolutionary algorithm for enhancing the robustness of scale-free networks against multiple malicious attacks . IEEE Transactions on Cybernetics 47 , 2 (2017), 539 \u2013 552 . Mingxing Zhou and Jing Liu. 2017. A two-phase multiobjective evolutionary algorithm for enhancing the robustness of scale-free networks against multiple malicious attacks. IEEE Transactions on Cybernetics 47, 2 (2017), 539\u2013552.","journal-title":"IEEE Transactions on Cybernetics"}],"container-title":["ACM Transactions on Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3446937","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3446937","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:28:26Z","timestamp":1750195706000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3446937"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,21]]},"references-count":54,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,8,31]]}},"alternative-id":["10.1145\/3446937"],"URL":"https:\/\/doi.org\/10.1145\/3446937","relation":{},"ISSN":["1550-4859","1550-4867"],"issn-type":[{"value":"1550-4859","type":"print"},{"value":"1550-4867","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,21]]},"assertion":[{"value":"2020-06-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-01-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-06-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}