Joint User Grouping and Resource Allocation for LEO Satellite Multicast

Similar to the dilemma encountered by terrestrial wireless networks, low Earth orbit (LEO) satellite networks are also facing the problem of increasing pressure caused by the growth of wireless traffic. Wireless multicast technology is an effective technique on improving the spectrum efficiency by s...

Full description

Saved in:
Bibliographic Details
Published in:IEEE systems journal 2023-09, Vol.17 (3), p.1-8
Main Authors: Li, Yuwei, Zhu, Shibing, Dai, Jianmei
Format: Article
Language:English
Subjects:
Algorithms
Clustering algorithms
Doppler effect
Improved k-means
joint resource allocation
low Earth orbit (LEO) satellite networks
Low earth orbit satellites
Low earth orbits
multicast
Multicast algorithms
Multicasting
Resource allocation
Resource management
Satellite broadcasting
Satellite networks
Satellite transmission
Satellites
Wireless networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Similar to the dilemma encountered by terrestrial wireless networks, low Earth orbit (LEO) satellite networks are also facing the problem of increasing pressure caused by the growth of wireless traffic. Wireless multicast technology is an effective technique on improving the spectrum efficiency by sending the same signal to multiple users who request the same service. In this article, the LEO satellite transmission system is considered and a maximum system capacity problem is formulated. To solve the original nonconvex problem efficiently, a joint user grouping and resource allocation scheme is proposed. There are two parts in the scheme: on the one hand, we propose an improved K-means++ algorithm for user grouping; on the other hand, we proposed a joint power and bandwidth allocation algorithm using the two stage iteration method. Compared with the baseline approach, our proposed scheme can improve the capacity 10% higher at least.
ISSN:1932-8184
1937-9234
DOI:10.1109/JSYST.2023.3237783