{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T20:34:04Z","timestamp":1773002044404,"version":"3.50.1"},"reference-count":39,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T00:00:00Z","timestamp":1749168000000},"content-version":"vor","delay-in-days":156,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2022YFB2902705"],"award-info":[{"award-number":["2022YFB2902705"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Intelligent Systems"],"published-print":{"date-parts":[[2025,1]]},"abstract":"<jats:p>The extensive coverage of satellite constellations has rendered the satellite\u2013terrestrial integrated network (STIN) a pivotal solution for communication and computation services in internet of vehicles (IoVs) rescuing in remote or disaster areas with limited terrestrial networks. To optimise network resource utilisation and service quality, the integration of the service function chain (SFC) into STIN\u2010enabled IoV rescuing systems has become essential. However, traditional SFC\u2010based STIN systems encounter challenges in flow scheduling flexibility, stemming from the sequential execution of subtasks on satellites equipped with virtual network functions (VNFs). This leads to a trade\u2010off between data volume reduction and the additional communication and computation energy costs incurred in the orbit. To address this issue, this paper introduces a space ground collaborative SFC (SGC\u2010SFC) flow scheduling strategy. This strategy enables the execution of subtasks on either VNF\u2010equipped satellites or the ground vehicle formation, contingent on network conditions. Firstly, we carry out a computation\u2013space\u2013time graph (CSTG) model specifically for the STIN\u2010enabled IoV rescuing system with SFC. This model integrates the computational layer into the space\u2013time graph (STG), accurately capturing the data volume reduction characteristics and sequential execution constraints of SFC in the STIN\u2010enabled IoV rescuing system. Secondly, a SGC\u2010SFC flow scheduling algorithm is designed to identify a set of feasible paths with minimal energy cost and maximum processable data volume. Simulation results validate the effectiveness and robustness of our proposed SGC\u2010SFC under diverse conditions.<\/jats:p>","DOI":"10.1155\/int\/9914571","type":"journal-article","created":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T05:19:32Z","timestamp":1749187172000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Space Ground Collaborative SFC Flow Scheduling Strategy in Satellite\u2013Terrestrial Integrated Network\u2013Enabled Internet of Vehicles Rescuing Based on Computation\u2013Space\u2013Time Graph"],"prefix":"10.1155","volume":"2025","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-1283-5868","authenticated-orcid":false,"given":"Yingjie","family":"Deng","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7957-2487","authenticated-orcid":false,"given":"Yu","family":"Liu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2450-6252","authenticated-orcid":false,"given":"Yumei","family":"Wang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7671-311X","authenticated-orcid":false,"given":"Konglin","family":"Zhu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1227-6819","authenticated-orcid":false,"given":"Peng","family":"Wu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0002-2056-7867","authenticated-orcid":false,"given":"Lu","family":"Cao","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7086-4910","authenticated-orcid":false,"given":"Wen","family":"Sun","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0008-7174-437X","authenticated-orcid":false,"given":"Jingwen","family":"Xu","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2025,6,6]]},"reference":[{"key":"e_1_2_11_1_2","doi-asserted-by":"publisher","DOI":"10.1002\/sat.1495"},{"key":"e_1_2_11_2_2","doi-asserted-by":"publisher","DOI":"10.1155\/2022\/5883770"},{"key":"e_1_2_11_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/3422604.3425937"},{"key":"e_1_2_11_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2020.3039499"},{"key":"e_1_2_11_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2014.012214.00180"},{"key":"e_1_2_11_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2014.6963800"},{"key":"e_1_2_11_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/comst.2018.2884835"},{"key":"e_1_2_11_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/mcom.2016.1600219rp"},{"key":"e_1_2_11_9_2","first-page":"1","article-title":"Adaptive Online Servizce Function Chain Deployment in Large-Scale LEO Satellite Networks","author":"Han C.","year":"2023","journal-title":"IEEE 34th Annuals"},{"key":"e_1_2_11_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3058250"},{"key":"e_1_2_11_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICC45041.2023.10279545"},{"key":"e_1_2_11_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/secon58729.2023.10287471"},{"key":"e_1_2_11_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/jiot.2024.3350072"},{"key":"e_1_2_11_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/twc.2023.3239080"},{"key":"e_1_2_11_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/PIMRC56721.2023.10293826"},{"key":"e_1_2_11_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/twc.2021.3116983"},{"key":"e_1_2_11_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/tnse.2022.3178771"},{"key":"e_1_2_11_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/jsac.2022.3233533"},{"key":"e_1_2_11_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/taes.2019.2938447"},{"key":"e_1_2_11_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2018.1700038"},{"key":"e_1_2_11_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/mwc.017.2200089"},{"key":"e_1_2_11_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-021-02712-0"},{"key":"e_1_2_11_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/taes.2023.3323922"},{"key":"e_1_2_11_24_2","doi-asserted-by":"publisher","DOI":"10.1155\/2022\/1514437"},{"key":"e_1_2_11_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/jsyst.2020.3017710"},{"key":"e_1_2_11_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/mnet.003.2200401"},{"key":"e_1_2_11_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/VTC2022-Spring54318.2022.9860361"},{"key":"e_1_2_11_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/icc45855.2022.9838943"},{"key":"e_1_2_11_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/jiot.2021.3065583"},{"key":"e_1_2_11_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/tcad.2023.3314388"},{"key":"e_1_2_11_31_2","doi-asserted-by":"publisher","DOI":"10.1364\/josaa.22.000708"},{"key":"e_1_2_11_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/8.633864"},{"key":"e_1_2_11_33_2","volume-title":"A Procedure for Determining a Family of Minimal-Cost Network Flow Patterns","author":"Busaker R. G.","year":"1961"},{"key":"e_1_2_11_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/naecon.1998.710110"},{"key":"e_1_2_11_35_2","doi-asserted-by":"publisher","DOI":"10.1002\/sat.1361"},{"key":"e_1_2_11_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.001.2100810"},{"key":"e_1_2_11_37_2","doi-asserted-by":"publisher","DOI":"10.1002\/sat.1471"},{"key":"e_1_2_11_38_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.opelre.2018.11.002"},{"key":"e_1_2_11_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/tsc.2024.3359233"}],"container-title":["International Journal of Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/int\/9914571","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1155\/int\/9914571","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/int\/9914571","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T18:09:25Z","timestamp":1772993365000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/int\/9914571"}},"subtitle":[],"editor":[{"given":"Vasudevan","family":"Rajamohan","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["10.1155\/int\/9914571"],"URL":"https:\/\/doi.org\/10.1155\/int\/9914571","archive":["Portico"],"relation":{},"ISSN":["0884-8173","1098-111X"],"issn-type":[{"value":"0884-8173","type":"print"},{"value":"1098-111X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1]]},"assertion":[{"value":"2024-07-06","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-04-30","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-06-06","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"9914571"}}