Delay-bounded and minimal energy broadcast in satellite networks with multi-power levels

摘要

There has been explosive growth of satellite applications in the past decades. Broadcast is a fundamental operation in satellite networks, which is required for satellites self-organization, routing discovery, coordination and collaborations. In this paper, we study the problem of delay bounded and energy efficient broadcast in satellite networks. Broadcast routing is a challenging issue in satellite networks due to highly dynamic change and intermittent connectivity of the network. We propose a method that is based on a Multi-power Level Multi-Transmission (MLMT) Space-Time Graph. The algorithm repeatedly finds the most energy efficient `caterpillars' in the graph, and merges caterpillars into an energy efficient broadcast tree. Simulations have been conducted in the real satellite constellations and the results show our proposed scheme has achieved good performance compared with other broadcast algorithms.