The University of Southampton
University of Southampton Institutional Repository

Multi-objective optimization of space-air-ground integrated network slicing relying on a pair of central and distributed learning algorithms

Multi-objective optimization of space-air-ground integrated network slicing relying on a pair of central and distributed learning algorithms
Multi-objective optimization of space-air-ground integrated network slicing relying on a pair of central and distributed learning algorithms
As an attractive enabling technology for next-generation wireless communications, network slicing supports diverse customized services in the global space-air-ground integrated network (SAGIN) with diverse resource constraints. In this paper, we dynamically consider three typical classes of radio access network (RAN) slices, namely high-throughput slices, low-delay slices and wide-coverage slices, under the same underlying physical SAGIN. The throughput, the service delay and the coverage area of these three classes of RAN slices are jointly optimized in a non-scalar form by considering the distinct channel features and service advantages of the terrestrial, aerial and satellite components of SAGINs. A joint central and distributed multi-agent deep deterministic policy gradient (CDMADDPG) algorithm is proposed for solving the above problem to obtain the Pareto optimal solutions. The algorithm first determines the optimal virtual unmanned aerial vehicle (vUAV) positions and the inter-slice sub-channel and power sharing by relying on a centralized unit. Then it optimizes the intra-slice sub-channel and power allocation, and the virtual base station (vBS)/vUAV/virtual low earth orbit (vLEO) satellite deployment in support of three classes of slices by three separate distributed units. Simulation results verify that the proposed method approaches the Paretooptimal exploitation of multiple RAN slices, and outperforms the benchmarkers.
Delays, hierarchical and distributed deep reinforcement learning, multi-objective optimization, non-scalarization, Optimization, Pareto optimization, Radio access network slicing, Resource management, Satellites, space-air-ground integrated network, Space-air-ground integrated networks, Throughput
2327-4662
1
Zhou, Guorong
2a26e632-11e9-46c6-86a4-99db357f4c05
Zhao, Liqiang
6f028499-c197-4765-9666-c0105afa5b9c
Zheng, Gan
c8a84e25-660c-4adc-87c2-36cdf9d1a0cb
Song, Shenghui
140406d9-dc78-4e57-9968-b62364c8cf32
Zhang, Jiankang
c6c025b3-6576-4f9d-be95-57908e61fa88
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1
Zhou, Guorong
2a26e632-11e9-46c6-86a4-99db357f4c05
Zhao, Liqiang
6f028499-c197-4765-9666-c0105afa5b9c
Zheng, Gan
c8a84e25-660c-4adc-87c2-36cdf9d1a0cb
Song, Shenghui
140406d9-dc78-4e57-9968-b62364c8cf32
Zhang, Jiankang
c6c025b3-6576-4f9d-be95-57908e61fa88
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1

Zhou, Guorong, Zhao, Liqiang, Zheng, Gan, Song, Shenghui, Zhang, Jiankang and Hanzo, Lajos (2023) Multi-objective optimization of space-air-ground integrated network slicing relying on a pair of central and distributed learning algorithms. IEEE Internet of Things Journal, 1. (doi:10.1109/JIOT.2023.3319130). (In Press)

Record type: Article

Abstract

As an attractive enabling technology for next-generation wireless communications, network slicing supports diverse customized services in the global space-air-ground integrated network (SAGIN) with diverse resource constraints. In this paper, we dynamically consider three typical classes of radio access network (RAN) slices, namely high-throughput slices, low-delay slices and wide-coverage slices, under the same underlying physical SAGIN. The throughput, the service delay and the coverage area of these three classes of RAN slices are jointly optimized in a non-scalar form by considering the distinct channel features and service advantages of the terrestrial, aerial and satellite components of SAGINs. A joint central and distributed multi-agent deep deterministic policy gradient (CDMADDPG) algorithm is proposed for solving the above problem to obtain the Pareto optimal solutions. The algorithm first determines the optimal virtual unmanned aerial vehicle (vUAV) positions and the inter-slice sub-channel and power sharing by relying on a centralized unit. Then it optimizes the intra-slice sub-channel and power allocation, and the virtual base station (vBS)/vUAV/virtual low earth orbit (vLEO) satellite deployment in support of three classes of slices by three separate distributed units. Simulation results verify that the proposed method approaches the Paretooptimal exploitation of multiple RAN slices, and outperforms the benchmarkers.

Text
FINAL_VERSION (1) - Accepted Manuscript
Available under License Creative Commons Attribution.
Download (1MB)

More information

Accepted/In Press date: 19 September 2023
Additional Information: Publisher Copyright: IEEE
Keywords: Delays, hierarchical and distributed deep reinforcement learning, multi-objective optimization, non-scalarization, Optimization, Pareto optimization, Radio access network slicing, Resource management, Satellites, space-air-ground integrated network, Space-air-ground integrated networks, Throughput

Identifiers

Local EPrints ID: 482929
URI: http://eprints.soton.ac.uk/id/eprint/482929
ISSN: 2327-4662
PURE UUID: c77d2348-a63b-42cc-a7f4-24fa965e2ddd
ORCID for Lajos Hanzo: ORCID iD orcid.org/0000-0002-2636-5214

Catalogue record

Date deposited: 17 Oct 2023 16:47
Last modified: 18 Mar 2024 02:36

Export record

Altmetrics

Contributors

Author: Guorong Zhou
Author: Liqiang Zhao
Author: Gan Zheng
Author: Shenghui Song
Author: Jiankang Zhang
Author: Lajos Hanzo ORCID iD

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×