Time-Efficient Neural-Network-Based Dynamic Area Optimization Algorithm for High-Altitude Platform Station Mobile Communications

Wataru Takabatake (), Yohei Shibata, Kenji Hoshino () and Tomoaki Ohtsuki
Additional contact information
Wataru Takabatake: Technology Research Laboratory, SoftBank Corp., Koto-ku, Tokyo 135-0064, Japan
Yohei Shibata: Technology Research Laboratory, SoftBank Corp., Koto-ku, Tokyo 135-0064, Japan
Kenji Hoshino: Technology Research Laboratory, SoftBank Corp., Koto-ku, Tokyo 135-0064, Japan
Tomoaki Ohtsuki: Department of Information and Computer Science, Faculty of Science and Technology, Keio University, Yokohama 223-8522, Japan

Future Internet, 2024, vol. 16, issue 9, 1-20

Abstract: There is a growing interest in high-altitude platform stations (HAPSs) as potential telecommunication infrastructures in the stratosphere, providing direct communication services to ground-based smartphones. Enhanced coverage and capacity can be realized in HAPSs by adopting multicell configurations. To improve the communication quality, previous studies have investigated methods based on search algorithms, such as genetic algorithms (GAs), which dynamically optimize antenna parameters. However, these methods face hurdles in swiftly adapting to sudden distribution shifts from natural disasters or major events due to their high computational requirements. Moreover, they do not utilize the previous optimization results, which require calculations each time. This study introduces a novel optimization approach based on a neural network (NN) model that is trained on GA solutions. The simple model is easy to implement and allows for instantaneous adaptation to unexpected distribution changes. However, the NN faces the difficulty of capturing the dependencies among neighboring cells. To address the problem, a classifier chain (CC), which chains multiple classifiers to learn output relationships, is integrated into the NN. However, the performance of the CC depends on the output sequence. Therefore, we employ an ensemble approach to integrate the CCs with different sequences and select the best solution. The results of simulations based on distributions in Japan indicate that the proposed method achieves a total throughput whose cumulative distribution function (CDF) is close to that obtained by the GA solutions. In addition, the results show that the proposed method is more time-efficient than GA in terms of the total time required to optimize each user distribution.

Keywords: HAPS; cell configuration; self-organizing network; dynamic area optimization; machine learning; supervised learning; neural network (search for similar items in EconPapers)
JEL-codes: O3 (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/1999-5903/16/9/332/pdf (application/pdf)
https://www.mdpi.com/1999-5903/16/9/332/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jftint:v:16:y:2024:i:9:p:332-:d:1475700

Access Statistics for this article

Future Internet is currently edited by Ms. Grace You

More articles in Future Internet from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().