Improved Spread Spectrum Aloha Protocol and Beam-Hopping Approach for Return Channel in Satellite Internet of Things

Abstract

This paper examines potential performances of the Spread Spectrum-based random access technique and proposes an Improved Spread Spectrum Aloha (ISSA) protocol for the return channel in satellite Internet of Things (IoT) based on the beam-hopping technique. The key design driver and detailed solution of ISSA protocol are presented in this work and it is shown that the proposed protocol achieves high throughput and low collision probability. To match user/traffic distribution, delay requirement and channel condition with beam allocation better, a low-complexity heuristic beam scheduling algorithm and a more effective Maximum-Weighted Clique (MWC) algorithm have been proposed. The heuristic algorithm considers the user/traffic distribution, inter-beam interference, and fairness primarily. However, the MWC algorithm gives considerations not only on above factors, but also on delay requirement and channel condition (path loss and rain attenuation) to maximize system capacity. The beam angle and interference avoidance threshold are proposed to measure the inter-beam interference, and the link propagation loss and rain attenuation are considered meanwhile in the channel condition. In the MWC algorithm, we construct an auxiliary graph to find the maximum-weighted clique and derive the weighting approach to be applied in different application scenarios. The performance evaluation of our ISSA protocol compared with the SSA protocol is presented, which achieves a gain of 16.7%. The simulation of the ISSA protocol combined with round robin, heuristic, and MWC beam scheduling for the return link in beam-hopping satellite IoTs is also provided. The results indicate that the throughput in nonuniform user distribution is much lower than in the uniform case without the beam scheduling algorithm. Through the application of the scheduling algorithm, the throughput performance can approach the uniform distribution. Finally, the degree of user satisfaction with different scheduling approaches is presented, which validates the effectiveness of heuristic and MWC algorithms.