计算机科学
资源配置
数学优化
最优化问题
凸优化
指针(用户界面)
电信线路
信道分配方案
基站
频道(广播)
整数规划
算法
无线
正多边形
计算机网络
人工智能
电信
数学
几何学
作者
Xiufeng Sui,Ziqi Jiang,Yifeng Lyu,Rongfei Fan,Han Hu,Zhi Liu
标识
DOI:10.1109/tccn.2024.3361071
摘要
This paper investigates the satellite communication network (SCN) to optimize the channel allocation of the fixed ground base station and the transmission power allocation of the Low Earth orbit (LEO) satellites jointly while considering the freshness of the information. We present a mathematical model for the problem and formulate it as a mixed-integer programming (MIP) problem, which is NP-hard. To tackle this challenge, we propose a two-step approach that decomposes the problem into a channel allocation problem and a power allocation problem. For the power allocation problem, we propose a convex optimization algorithm termed as Opt. For the channel allocation problem, we introduce two learning-based schemes, Ptr and DNN-Ptr. Combining these two steps together, we develop two novel algorithms, i.e., Opt-Ptr and Opt-DNN-Ptr. In particular, the Opt-Ptr algorithm devises a novel Pointer Network to obtain the channel allocation decision and then solves the remaining power allocation problem using convex optimization algorithms. To further improve the performance, the Opt-DNN-Ptr algorithm utilizes a DNN to predict a transmission power allocation, which is then combined with the channel allocation decision obtained from the pointer network to solve the remaining power allocation problem. The simulation results verify the superiority of the proposed algorithm.
科研通智能强力驱动
Strongly Powered by AbleSci AI