{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:14:09Z","timestamp":1740100449569,"version":"3.37.3"},"reference-count":9,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T00:00:00Z","timestamp":1637107200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T00:00:00Z","timestamp":1637107200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T00:00:00Z","timestamp":1637107200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2019YFB1803103,2018YFB1800501"],"award-info":[{"award-number":["2019YFB1803103,2018YFB1800501"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,11,17]]},"DOI":"10.1109\/ic-nidc54101.2021.9660472","type":"proceedings-article","created":{"date-parts":[[2022,1,4]],"date-time":"2022-01-04T20:36:16Z","timestamp":1641328576000},"page":"200-204","source":"Crossref","is-referenced-by-count":1,"title":["A Tunable Routing Algorithm for Integerated Terrestrial-Satellite Networks Based on the Space-Time Graph"],"prefix":"10.1109","author":[{"given":"Yingjie","family":"Deng","sequence":"first","affiliation":[]},{"given":"Yu","family":"Liu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Contact Graph Routing","year":"0","author":"lt","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TAES.2019.2938447"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SMC-IT.2019.00009"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/WiSEE.2018.8637330"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/WCSP.2018.8555699"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CITS.2017.8035308"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.17487\/rfc5050"},{"key":"ref9","article-title":"An event-driven graph-based min-cost delivery algorithm in earth observation DTN networks[C]","author":"peng","year":"0","journal-title":"Wireless Communications and Signal Processing (WCSP) Conference"},{"key":"ref1","article-title":"Delay-Tolerant Networking Architecture[J]","author":"netze","year":"0","journal-title":"Heise Zeitschriften Verlag"}],"event":{"name":"2021 7th IEEE International Conference on Network Intelligence and Digital Content (IC-NIDC)","start":{"date-parts":[[2021,11,17]]},"location":"Beijing, China","end":{"date-parts":[[2021,11,19]]}},"container-title":["2021 7th IEEE International Conference on Network Intelligence and Digital Content (IC-NIDC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9660393\/9660398\/09660472.pdf?arnumber=9660472","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:56:39Z","timestamp":1652201799000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9660472\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,17]]},"references-count":9,"URL":"https:\/\/doi.org\/10.1109\/ic-nidc54101.2021.9660472","relation":{},"subject":[],"published":{"date-parts":[[2021,11,17]]}}}