Premium
AG‐DPA: Assignment game–based dynamic power allocation in multibeam satellite systems
Author(s) -
Liu Shuaijun,
Fan Yuanyuan,
Hu Yuemei,
Wang Dapeng,
Liu Lixiang,
Gao Longfei
Publication year - 2019
Publication title -
international journal of satellite communications and networking
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.388
H-Index - 39
eISSN - 1542-0981
pISSN - 1542-0973
DOI - 10.1002/sat.1310
Subject(s) - computer science , key (lock) , computational complexity theory , throughput , mathematical optimization , power (physics) , satellite , distributed computing , algorithm , telecommunications , wireless , physics , quantum mechanics , engineering , aerospace engineering , computer security , mathematics
Summary Dynamic power allocation is the key technology to maintain the link quality and improve the system throughput in multibeam satellite systems. Many numerical optimization algorithms have been proposed to optimize the power allocation schemes among beams. However, current metaheuristic algorithms, most of which are off‐line iterative methods, are not appropriate in nonuniform traffic demands and time‐varying channels due to the high computational complexity. To solve this problem, an assignment game–based dynamic power allocation (AG‐DPA) is proposed to achieve the suboptimality with low complexity in multibeam satellite systems. The key idea of the proposed AG‐DPA is to model the DPA problem into an assignment game model where the competitive equilibrium is achieved. Further, an adaptive price factor is introduced to make a trade‐off between algorithm performance and complexity. Simulation results show the effectiveness of the proposed AG‐DPA algorithm.