Demand-Based Dynamic Bandwidth Allocation in Multi-Beam Satellites Using Machine Learning Concepts

被引:0
作者
Kashyap, Shwet [1 ]
Gupta, Nisha [1 ]
机构
[1] Birla Institute of Technology Mesra, Department of Electronics and Communication Engineering, Ranchi
来源
Intelligent and Converged Networks | 2024年 / 5卷 / 02期
关键词
knee-elbow method; machine learning; multi-beam satellites; satellite communications; Voronoi tessellation; weighted k-means clustering;
D O I
10.23919/ICN.2024.0011
中图分类号
学科分类号
摘要
In the realm of satellite communication, where the importance of efficient spectrum utilization is growing day by day due to the increasing significance of this technology, dynamic resource management has emerged as a pivotal consideration in the design of contemporary multi-beam satellites, facilitating the flexible allocation of resources based on user demand. This research paper delves into the pivotal role played by machine learning and artificial intelligence within the domain of satellite communication, particularly focusing on spot beam satellites. The study encompasses an evaluation of machine learning's application, whereby an extensive dataset capturing user demand across a specific geographical area is subjected to analysis. This analysis involves determining the optimal number of beams/clusters, achieved through the utilization of the knee-elbow method predicated on within-cluster sum of squares. Subsequently, the demand data are equitably segmented employing the weighted k-means clustering technique. The proposed solution introduces a straightforward yet efficient model for bandwidth allocation, contrasting with conventional fixed beam illumination models. This approach not only enhances spectrum utilization but also leads to noteworthy power savings, thereby addressing the growing importance of efficient resource management in satellite communication. © 2020 Tsinghua University Press.
引用
收藏
页码:147 / 166
页数:19
相关论文
共 30 条
[21]  
Ortiz-Gomez F.G., Salas-Natera M.A., Martinez R., Landeros-Ayala S., Optimization in VHTS satellite system design with irregular beam coverage for non-uniform traffic distribution, Remote. Sens., 13, 13, (2021)
[22]  
Honnaiah P.J., Maturo N., Chatzinotas S., Kisseleff S., Krause J., Demand-based adaptive multi-beam pattern and footprint planning for high throughput GEO satellite systems, IEEE Open J. Commun. Soc., 2, pp. 1526-1540, (2021)
[23]  
Arthur D., Vassilvitskii S., K-means++: The advantages of careful seeding, Proc. 18th Annu. ACMSIAM Symp. Discr. Algorithms, pp. 1027-1035, (2007)
[24]  
Zhang Y., Zhang D., Shi H., K-means clustering based on self-adaptive weight, Proc. 2012 2nd Int. Conf. Computer Science and Network Technology, pp. 1540-1544, (2012)
[25]  
Rahman M.M., Masud M.A., Improved k-means Algorithm using Weight Estimation, Proc. Int. Conf. Automation, Control and Mechatronics for Industry 4.0 (ACMI), pp. 1-6, (2021)
[26]  
Bezdek J.C., Objective function clustering, Pattern Recognition with Fuzzy Objective Function Algorithms, pp. 43-93, (1981)
[27]  
Du Q., Faber V., Gunzburger M., Centroidal Voronoi tessellations: Applications and algorithms, SIAM Rev., 41, 4, pp. 637-676, (1999)
[28]  
Moriguchi M., Sugihara K., Constructing centroidal Voronoi tessellations on surface meshes, Generalized Voronoi Diagram: A Geometry-Based Approach to Computational Intelligence, pp. 235-245, (2009)
[29]  
Reem D., An algorithm for computing Voronoi diagrams of general generators in general normed spaces, Proc. Sixth Int. Symp. on Voronoi Diagrams, pp. 144-152, (2009)
[30]  
Parker W.V., Pryor J.E., Polygons of greatest area inscribed in an ellipse, Am. Math. Mon., 51, 4, pp. 205-209, (1944)