TY - GEN
T1 - A Minimum Task-Based End-To-end Delivery Delay Routing Strategy with Updated Discrete Graph for Satellite Disruption-Tolerant Networks
AU - Yuan, Peng
AU - Yang, Zhihua
AU - Zhang, Qinyu
AU - Wang, Ye
N1 - Publisher Copyright:
© 2018 IEEE.
PY - 2018/7/2
Y1 - 2018/7/2
N2 - Recently, a variety of time-varying graphs, such as space-Time graph and event-driven graph, are widely employed for modelling the dynamic topologies of satellite Disruption-Tolerant Networking (DTN) network with periodic orbital motions of satellite platforms. As the major criterion of delivering a file of targeted data, however, Task-based End-To-end Delivery Delay (TEDD) is hardly evaluated by using the current methods of graphs due to their intrinsic incapability in precision. In this paper, a topology-driven Updated Discrete Graph (UDG) is proposed for confining the low bound of TEDD with a given delivery task by using a tailored edges capacity. In particular, a Minimum TEDD Routing Strategy (MTRS) is designed through solving a correspondingly integral Min-Max optimization problem. The simulation results verifies the advantage of MTRS for TEDD compared with two typical graph algorithms under a group of specific satellite network scenarios.
AB - Recently, a variety of time-varying graphs, such as space-Time graph and event-driven graph, are widely employed for modelling the dynamic topologies of satellite Disruption-Tolerant Networking (DTN) network with periodic orbital motions of satellite platforms. As the major criterion of delivering a file of targeted data, however, Task-based End-To-end Delivery Delay (TEDD) is hardly evaluated by using the current methods of graphs due to their intrinsic incapability in precision. In this paper, a topology-driven Updated Discrete Graph (UDG) is proposed for confining the low bound of TEDD with a given delivery task by using a tailored edges capacity. In particular, a Minimum TEDD Routing Strategy (MTRS) is designed through solving a correspondingly integral Min-Max optimization problem. The simulation results verifies the advantage of MTRS for TEDD compared with two typical graph algorithms under a group of specific satellite network scenarios.
KW - Disruption-Tolerant Networking
KW - Graph Model
KW - Satellite network
UR - https://www.scopus.com/pages/publications/85063102537
U2 - 10.1109/ICCChina.2018.8641200
DO - 10.1109/ICCChina.2018.8641200
M3 - 会议稿件
AN - SCOPUS:85063102537
T3 - 2018 IEEE/CIC International Conference on Communications in China, ICCC 2018
SP - 293
EP - 297
BT - 2018 IEEE/CIC International Conference on Communications in China, ICCC 2018
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2018 IEEE/CIC International Conference on Communications in China, ICCC 2018
Y2 - 16 August 2018 through 18 August 2018
ER -