Abstract
SummaryDynamic 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Satellite Communications and Networking
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
