论文标题
狮子座卫星网络的计算意见路由:传输和计算方法
Computing-Aware Routing for LEO Satellite Networks: A Transmission and Computation Integration Approach
论文作者
论文摘要
遥感(RS)的进步对计算和传输资源的需求越来越高。将大量原始数据传输到地面的常规地面卸载技术会遭受较差的卫星链接质量。此外,现有的卫星卸载技术将计算任务卸载到位于RS卫星可见范围内的低地球轨道(LEO)卫星进行处理,因此无法利用网络的完整计算能力,因为可见的LEO卫星的计算资源有限。在热点地区,这种情况甚至更糟。 在本文中,为了通过LEO卫星网络有效地卸载,我们提出了一种新颖的计算方式路由方案。它融合了传输和计算过程,并优化了两者的总体延迟。具体而言,我们首先将Leo卫星网络建模为无快照的动态网络,其节点和边缘都具有时间变化的权重。通过利用时变网络参数来表征网络动力学,提出的方法建立了一个连续的时间模型,该模型在大型网络上很好地扩展并提高了准确性。接下来,我们建议按照模型的计算感知路由方案。它在路由过程中处理任务,而不是将原始数据卸载到地面站,从而减少了整体延迟并避免了网络拥塞。最后,我们在动态网络中提出计算感知的路由问题,作为多个动态单源最短路径(DSSSP)问题的组合,并提出了一种基于遗传算法(GA)的方法,以合理的时间近似结果。仿真结果表明,与将原始数据卸载到地面进行处理相比,计算感知的路由方案将总体延迟减少多达78.31%。
The advancements of remote sensing (RS) pose increasingly high demands on computation and transmission resources. Conventional ground-offloading techniques, which transmit large amounts of raw data to the ground, suffer from poor satellite-to-ground link quality. In addition, existing satellite-offloading techniques, which offload computational tasks to low earth orbit (LEO) satellites located within the visible range of RS satellites for processing, cannot leverage the full computing capability of the network because the computational resources of visible LEO satellites are limited. This situation is even worse in hotspot areas. In this paper, for efficient offloading via LEO satellite networks, we propose a novel computing-aware routing scheme. It fuses the transmission and computation processes and optimizes the overall delay of both. Specifically, we first model the LEO satellite network as a snapshot-free dynamic network, whose nodes and edges both have time-varying weights. By utilizing time-varying network parameters to characterize the network dynamics, the proposed method establishes a continuous-time model which scales well on large networks and improves the accuracy. Next, we propose a computing-aware routing scheme following the model. It processes tasks during the routing process instead of offloading raw data to ground stations, reducing the overall delay and avoiding network congestion consequently. Finally, we formulate the computing-aware routing problem in the dynamic network as a combination of multiple dynamic single source shortest path (DSSSP) problems and propose a genetic algorithm (GA) based method to approximate the results in a reasonable time. Simulation results show that the computing-aware routing scheme decreases the overall delay by up to 78.31% compared with offloading raw data to the ground to process.