当前位置: X-MOL 学术Peer-to-Peer Netw. Appl. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Downlink aware data scheduling with delay guarantees in resource-limited leo satellite networks
Peer-to-Peer Networking and Applications ( IF 4.2 ) Pub Date : 2021-04-13 , DOI: 10.1007/s12083-021-01128-z
Ying Wan , Jun Long , Limin Liu , Zheman Qian , Siwei Zhong

In recent years, data scheduling in satellite networks has drawn much attention. The nodes in the satellite network change dynamically, and there is no continuous connectivity between nodes. Due to the intermittent connection between satellites, data transmission is based on a storage-carry-forward mode. In such a network, it will inevitably result in transmission delay. It is challenging to schedule a large amount of observation data with delay guarantees in resource-limited satellite networks. In this paper, we propose a downlink aware data scheduling algorithm based on a decomposition strategy of rolling horizon mechanism. The data flows with deadlines are allocated to ground stations orderly through feasible routes during each sliding horizon. Considering the issues of time-varying node centrality and downlink capacity, a link metric is provided to solve the problem of downlink contact conflict. Then a heuristic routing algorithm is exploited to design inter-satellite link contact. Further simulation results demonstrate the effectiveness of the proposed algorithms in network profit improvement while ensuring the transmission delay demand.



中文翻译:

资源受限的leo卫星网络中具有延迟保证的下行链路感知数据调度

近年来,卫星网络中的数据调度已经引起了广泛的关注。卫星网络中的节点动态变化,并且节点之间没有连续的连接。由于卫星之间的连接是间歇性的,因此数据传输基于存储转发模式。在这样的网络中,不可避免地会导致传输延迟。在资源有限的卫星网络中调度具有延迟保证的大量观测数据是一项挑战。本文提出了一种基于滚动层机制分解策略的下行感知数据调度算法。带有截止日期的数据流在每个滑动范围内通过可行的路径有序地分配给地面站。考虑到时变节点的中心性和下行链路容量的问题,提供链路度量以解决下行链路接触冲突的问题。然后,采用启发式路由算法设计星际链路联系。进一步的仿真结果证明了所提算法在保证传输延迟需求的同时,在提高网络利润方面的有效性。

更新日期:2021-04-13
down
wechat
bug