Blue Data Computation Maximization in 6G Space-Air-Sea Non-Terrestrial Networks

被引：16

作者：

Hassan, Sheikh Salman ^{[1
]}

Tun, Yan Kyaw ^{[1
]}

Saad, Walid ^{[2
]}

Han, Zhu ^{[3
]}

Hong, Choong Seon ^{[1
]}

机构：

[1] Kyung Hee Univ, Dept Comp Sci & Engn, Yongin 17104, South Korea

[2] Virginia Tech, Bradley Dept Elect & Comp Engn, Wireless VT, Blacksburg, VA 24061 USA

[3] Univ Houston, Dept Elect & Comp Engn, Houston, TX 77004 USA

来源：

2021 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM) | 2021年

基金：

新加坡国家研究基金会;

关键词：

Sixth-generation networking; non-terrestrial networks; satellite access networks; maritime data computation; maritime Internet-of-Things; Bender decomposition;

D O I：

10.1109/GLOBECOM46510.2021.9685488

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Non-terrestrial networks (NTN), encompassing space and air platforms, are a key component of the upcoming sixth-generation (6G) cellular network. Meanwhile, maritime network traffic has grown significantly in recent years due to sea transportation used for national defense, research, recreational activities, domestic and international trade. In this paper, the seamless and reliable demand for communication and computation in maritime wireless networks is investigated. Two types of marine user equipment (UEs), i.e., low-antenna gain and high-antenna gain UEs, are considered. A joint task computation and time allocation problem for weighted sum-rate maximization is formulated as mixed-integer linear programming (MILP). The goal is to design an algorithm that enables the network to efficiently provide backhaul resources to an unmanned aerial vehicle (UAV) and offload HUEs tasks to LEO satellite for blue data (i.e., marine user's data). To solve this MILP, a solution based on the Bender and primal decomposition is proposed. The Bender decomposes MILP into the master problem for binary task decision and subproblem for continuous-time resource allocation. Moreover, primal decomposition deals with a coupling constraint in the subproblem. Finally, numerical results demonstrate that the proposed algorithm provides the maritime UEs coverage demand in polynomial time computational complexity and achieves a near-optimal solution.

引用

页数：6