TY - JOUR
T1 - Time-Varying Resource Graph Based Processing on the Way for Space-Terrestrial Integrated Vehicle Networks
AU - Chen, Long
AU - Tang, Feilong
AU - Liu, Jiacheng
AU - Li, Xu
AU - Zhu, Yanmin
AU - Yu, Jiadi
AU - Yang, Laurence T.
AU - Li, Zhetao
AU - Yao, Bin
AU - Yu, Yichuan
N1 - Publisher Copyright:
© 2002-2012 IEEE.
PY - 2024/2/1
Y1 - 2024/2/1
N2 - Desirable information processing in space-terrestrial integrated vehicle networks (STINs) handles data distributed in different satellites while transmitting, where efficient modeling time-varying resources is critical. Existing works are not applicable to STINs, however, because they lack the joint consideration of different movement patterns and fluctuating loads. In this paper, we propose the Time-Varying Resource Graph (TVRG) to model dynamic resources in STINs, by leveraging the advantages of software-defined networking in flexible resource management. First, we propose the STIN mobility model to uniformly model different movement patterns in STINs. Then, we propose a layered Resource Modeling and Abstraction (RMA) approach, where evolutions of node resources are modeled as Markov processes, by encoding predictable topologies and influences of fluctuating loads as states. Besides, we propose the low-complexity domain resource abstraction algorithm by defining two mobility-based and load-aware partial orders on resource abilities. Finally, we formulate the TVRG-based Processing on the Way (TPoW) problem for data flows with processing requirements and multiple sources. We propose a Multi-level Processing on the Way (MPoW) approach with a bounded approximation ratio, realizing adaptive matching of resources and demands of processing and transmission. To evaluate the RMA approach, we propose a TVRG-based Routing (TR) algorithm for time-sensitive and bandwidth-intensive data flows, with the multi-level on-demand scheduling ability. Comprehensive simulation results demonstrate that our RMA-TR and MPoW outperform most related schemes by decreasing nearly 40% bandwidth consumption with the shortest end-to-end delay.
AB - Desirable information processing in space-terrestrial integrated vehicle networks (STINs) handles data distributed in different satellites while transmitting, where efficient modeling time-varying resources is critical. Existing works are not applicable to STINs, however, because they lack the joint consideration of different movement patterns and fluctuating loads. In this paper, we propose the Time-Varying Resource Graph (TVRG) to model dynamic resources in STINs, by leveraging the advantages of software-defined networking in flexible resource management. First, we propose the STIN mobility model to uniformly model different movement patterns in STINs. Then, we propose a layered Resource Modeling and Abstraction (RMA) approach, where evolutions of node resources are modeled as Markov processes, by encoding predictable topologies and influences of fluctuating loads as states. Besides, we propose the low-complexity domain resource abstraction algorithm by defining two mobility-based and load-aware partial orders on resource abilities. Finally, we formulate the TVRG-based Processing on the Way (TPoW) problem for data flows with processing requirements and multiple sources. We propose a Multi-level Processing on the Way (MPoW) approach with a bounded approximation ratio, realizing adaptive matching of resources and demands of processing and transmission. To evaluate the RMA approach, we propose a TVRG-based Routing (TR) algorithm for time-sensitive and bandwidth-intensive data flows, with the multi-level on-demand scheduling ability. Comprehensive simulation results demonstrate that our RMA-TR and MPoW outperform most related schemes by decreasing nearly 40% bandwidth consumption with the shortest end-to-end delay.
KW - Time-varying resource graph
KW - processing on the way
KW - space-terrestrial integrated networks
UR - https://www.scopus.com/pages/publications/85149421411
U2 - 10.1109/TMC.2023.3248376
DO - 10.1109/TMC.2023.3248376
M3 - 文章
AN - SCOPUS:85149421411
SN - 1536-1233
VL - 23
SP - 1985
EP - 2002
JO - IEEE Transactions on Mobile Computing
JF - IEEE Transactions on Mobile Computing
IS - 2
ER -