{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T03:20:09Z","timestamp":1778901609130,"version":"3.51.4"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031067877","type":"print"},{"value":"9783031067884","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-06788-4_49","type":"book-chapter","created":{"date-parts":[[2022,7,3]],"date-time":"2022-07-03T23:03:27Z","timestamp":1656889407000},"page":"587-612","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Adaptive Optimization of Dynamic Heterogeneous Network Topologies: A Simulated Annealing Methodology"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7554-1408","authenticated-orcid":false,"given":"Ming","family":"Zhuo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8301-3223","authenticated-orcid":false,"given":"Peng","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0390-0747","authenticated-orcid":false,"given":"Junyi","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1179-4769","authenticated-orcid":false,"given":"Leyuan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenrui","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,4]]},"reference":[{"issue":"1","key":"49_CR1","doi-asserted-by":"publisher","first-page":"1815","DOI":"10.32604\/cmc.2022.018455","volume":"70","author":"AV Krishna","year":"2022","unstructured":"Krishna, A.V., Leema, A.A.: Etm-iot: energy-aware threshold model for heterogeneous com- munication in the internet of things. Comput. Mater. Continua 70(1), 1815\u20131827 (2022)","journal-title":"Comput. Mater. Continua"},{"key":"49_CR2","doi-asserted-by":"publisher","first-page":"22261","DOI":"10.1038\/s41598-021-01638-z","volume":"11","author":"M Zhuo","year":"2021","unstructured":"Zhuo, M., Liu, L., Zhou, S.: Survey on security issues of routing and anomaly detection for space information networks. Sci. Rep. 11, 22261 (2021)","journal-title":"Sci. Rep."},{"issue":"1","key":"49_CR3","doi-asserted-by":"publisher","first-page":"413","DOI":"10.32604\/cmc.2022.018773","volume":"70","author":"N Lutsiv","year":"2022","unstructured":"Lutsiv, N., Maksymyuk, T., Beshley, M., Lavriv, O., Andrushchak, V.: Deep semisupervised learning-based network anomaly detection in heterogeneous information systems. Comput. Mater. Continua 70(1), 413\u2013431 (2022)","journal-title":"Comput. Mater. Continua"},{"issue":"2","key":"49_CR4","doi-asserted-by":"publisher","first-page":"2579","DOI":"10.32604\/cmc.2021.016623","volume":"68","author":"J Zuo","year":"2021","unstructured":"Zuo, J., Lu, Y., Gao, H., Peng, T., Guo, Z.: Security-critical components recognition algorithm for complex heterogeneous information systems. Comput. Mater. Continua 68(2), 2579\u20132595 (2021)","journal-title":"Comput. Mater. Continua"},{"issue":"21","key":"49_CR5","first-page":"24","volume":"57","author":"Z Wu","year":"2021","unstructured":"Wu, Z., Zhou, S., Liu, Q.: Review on object tracking methods for restricted computing resources. Comput. Eng. Appl. 57(21), 24\u201340 (2021)","journal-title":"Comput. Eng. Appl."},{"key":"49_CR6","volume-title":"Research on survivalbility routing and anti-attack technology in space information networks","author":"XW Hao","year":"2013","unstructured":"Hao, X.W.: Research on survivalbility routing and anti-attack technology in space information networks. Xidian University Xi\u2019an, China (2013)"},{"key":"49_CR7","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/j.ast.2017.07.003","volume":"69","author":"Y Zheng","year":"2017","unstructured":"Zheng, Y., Zhao, S., Liu, Y., Tan, Q., Li, Y., Jiang, Y.: Topology control in self-organized optical satellite networks based on minimum weight spanning tree. Aerosp. Sci. Technol. 69, 449\u2013457 (2017)","journal-title":"Aerosp. Sci. Technol."},{"key":"49_CR8","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.actaastro.2019.09.011","volume":"165","author":"X Liu","year":"2019","unstructured":"Liu, X., Chen, X., Yang, L., Chen, Q., Guo, J., Wu, S.: Dynamic topology control in optical satellite networks based on algebraic connectivity. Acta Astronaut. 165, 287\u2013297 (2019)","journal-title":"Acta Astronaut."},{"issue":"12","key":"49_CR9","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1109\/JSAC.2006.258219","volume":"24","author":"F Liu","year":"2006","unstructured":"Liu, F., Vishkin, U., Milner, S.: Bootstrapping free-space optical networks. IEEE J. Sel. Areas Commun. 24(12), 13\u201322 (2006)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"3","key":"49_CR10","doi-asserted-by":"publisher","first-page":"1467","DOI":"10.32604\/iasc.2022.020625","volume":"32","author":"E Elamaran","year":"2022","unstructured":"Elamaran, E., Sudhakar, B.: Greedy-genetic algorithm based video data scheduling over 5g networks. Intelligent Automation & Soft Computing 32(3), 1467\u20131477 (2022)","journal-title":"Intelligent Automation & Soft Computing"},{"issue":"1","key":"49_CR11","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF02124742","volume":"5","author":"RA Devore","year":"1996","unstructured":"Devore, R.A., Temlyakov, V.: Some remarks on greedy algorithms. Adv. Comput. Math. 5(1), 173\u2013187 (1996)","journal-title":"Adv. Comput. Math."},{"key":"49_CR12","doi-asserted-by":"crossref","unstructured":"Woeginger, G.: Exact algorithms for NP-hard problems: a survey. In: Combinatorial optimization-eureka, you shrink! Springer, Heidelberg (2003)","DOI":"10.1007\/3-540-36478-1_17"},{"issue":"1","key":"49_CR13","doi-asserted-by":"publisher","first-page":"903","DOI":"10.32604\/cmc.2020.012255","volume":"66","author":"G Keerthana","year":"2021","unstructured":"Keerthana, G., Anandan, P., Nachimuthu, N.: Robust hybrid artificial fish swarm simulated annealing optimization algorithm for secured free scale networks against malicious attacks. Comput. Mater. Continua 66(1), 903\u2013917 (2021)","journal-title":"Comput. Mater. Continua"},{"issue":"2","key":"49_CR14","first-page":"78","volume":"11","author":"SL Scott","year":"2016","unstructured":"Scott, S.L., Blocker, A.W., Bonassi, F.V.: Bayes and big data: the consensus Monte Carlo algorithm. Int. J. Manage. Sci. Eng. Manage. 11(2), 78\u201388 (2016)","journal-title":"Int. J. Manage. Sci. Eng. Manage."},{"issue":"3","key":"49_CR15","doi-asserted-by":"publisher","first-page":"671","DOI":"10.5194\/angeo-26-671-2008","volume":"26","author":"BJ Anderson","year":"2008","unstructured":"Anderson, B.J., Korth, H., Waters, C.L.: Statistical birkeland current distributions from magnetic field observations by the Iridium constellation. Annales Geophysicae. Copernicus GmbH 26(3), 671\u2013687 (2008)","journal-title":"Annales Geophysicae. Copernicus GmbH"},{"key":"49_CR16","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.actaastro.2019.03.040","volume":"159","author":"D Portillo","year":"2019","unstructured":"Portillo, D., Inigo, B.G., Cameron, E.F.: Crawley: a technical comparison of three low earth orbit satellite constellation systems to provide global broadband. Acta Astronaut. 159, 123\u2013135 (2019)","journal-title":"Acta Astronaut."}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06788-4_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T12:29:21Z","timestamp":1657715361000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06788-4_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031067877","9783031067884"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06788-4_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"4 July 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors declare that they have no conflicts of interest to report regarding the present study.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}},{"value":"ICAIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Artificial Intelligence and Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Qinghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"incodldos2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.icaisconf.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1124","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"115","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}