5 June 2018 in IEEE Communications Letters
Dynamic resource allocation (DRA) is the key technology to improve the network performance in resource-limited multibeam satellite (MBS) systems. The aim is to find a policy that maximizes the expected long-term resource utilization. Existing iterative metaheuristics DRA optimization algorithms are not practical due to the high computational complexity. To solve the problem of unknown dynamics and prohibitive computation, a deep reinforcement learning-based framework (DRLF) is proposed for DRA problems in MBS systems. A novel image-like tensor reformulation on the system environments is adopted to extract traffic spatial and temporal features. A use case of dynamic channel allocation in DRLF is simulated and shows the effectiveness of the proposed DRLF in time-varying scenarios.
27 February 2018 in IEEE Access
Dynamic channel allocation (DCA) is the key technology to efficiently utilize the spectrum resources and decrease the co-channel interference for multibeam satellite systems. Most works allocate the channel on the basis of the beam traffic load or the user terminal distribution of the current moment. These greedy-like algorithms neglect the intrinsic temporal correlation among the sequential channel allocation decisions, resulting in the spectrum resources underutilization. To solve this problem, a novel deep reinforcement learning (DRL)-based DCA (DRL-DCA) algorithm is proposed. Specifically, the DCA optimization problem, which aims at minimizing the service blocking probability, is formulated in the multibeam satellite systems. Due to the temporal correlation property, the DCA optimization problem is modeled as the Markov decision process (MDP) which is the dominant analytical approach in DRL. In modeled MDP, the system state is reformulated into an image-like fashion, and then, convolutional neural network is used to extract useful features. Simulation results show that the DRL-DCA algorithm can decrease the blocking probability and improve the carried traffic and spectrum efficiency compared with other channel allocation algorithms.
9 November 2017 in IEEE Communications Letters
With the rapid development of low earth orbit (LEO) constellation satellite networks and on-board processing (OBP), in-network content caching becomes feasible which can further improve system performance. In order to minimize user terminals content access delay, a novel caching algorithm by optimizing content placement in LEO satellite constellation networks is proposed in this letter. The formulated problem is proved to be NP-Complete (NPC) by reducing it to the 2-Disjoint Set Cover (2DSC) problem which is a known NPC problem. This paper considers the interactions among distributed satellites for making individual content decisions. Then, this paper adopts an exchange-stable matching (ESM) algorithm based on many-to-many matching game with externalities. Simulation results show ESM algorithm can improve the system performance in terms of content access delay.
16 June 2020 in IEEE Wireless Communications Letters
With the rapid development of low earth orbit (LEO) satellite and onboard multibeam antennas, the low earth orbit multibeam satellite constellation network (LEO-MSCN) is developing rapidly. However, there exists a mount of overlap for some coverage as the satellites progress from the equator to polar regions, which may cause heavy inter-beam interference (IBI). To solve this problem, the beam shut off technique is needed to shut off the unnecessary beams to avoid IBI and save onboard power. In this letter, the dynamic beam shut off (DBSO) optimization problem of LEO-MSCN is formulated to minimize the number of active beams. The formulated optimization problem is equivalent to Set Cover Problem (SCP) which is known as NP-Complete. A heuristic beam shut off algorithm is adopted to achieve the sub-optimal solution with fast convergence, considering the time-varying characteristics of LEO-MSCN topology. The Oneweb constellation network is used as the simulation scenario. It turns out that average number of 7062 beams are required with 38.7% beam resource reduction.
1 October 2019 in IET Communications
Beam hopping (BH) is the key technology to improve the system throughput and decrease the transmission delay in multibeam satellite systems. The objective of this study is to find a policy to maximise the expected long‐term resource utilisation. The BH illumination plan (BHIP) optimisation problem aimed at minimising the transmission delay is formulated and modelled as a partially observable Markov decision process. To tackle the issue of unknown dynamics and prohibitive computation, an artificial intelligence method named deep reinforcement learning (DRL) is first proposed to solve the BHIP problem in multibeam satellite systems. The proposed DRL‐BHIP algorithm considers a series of realistic conditions, including the traffic demands in spatial distribution and temporal variation, ModCod constraints, antenna radiation pattern and inter‐beam interference. The state reformulation concept is adopted to characterise the traffic spatial and temporal features. Simulation results show that the proposed DRL‐BHIP algorithm can decrease the transmission delay and improve the system throughput compared with existing algorithms.
8 June 2020 in International Journal of Satellite Communications and Networking