TY - GEN
T1 - Gateway Placement for Reliability Optimization in 5G-Satellite Hybrid Networks
AU - Cao, Yurui
AU - Zhao, Lei
AU - Shi, Yongpeng
AU - Liu, Jiajia
N1 - Publisher Copyright:
© 2018 IEEE.
PY - 2018/6/19
Y1 - 2018/6/19
N2 - The placement of satellite gateways, as critical devices for data transmission between terrestrial networks and satellites, is of fundamental importance for the design of 5G-satellite hybrid networks, especially for the network reliability since the satellite links are prone to failing due to poor meteorological conditions. To the best of our knowledge, this problem almost remains untouched. Existing works in this line mainly focused on gateway placement in wireless mesh networks and sensor networks, which have totally different network topologies and optimization targets, and thus cannot be readily adopted. In light of this, two algorithms are proposed as our solutions, i.e., an optimal enumeration algorithm (OEA) and a cluster based approximation placement algorithm (CAPA). Extensive experiments based on real world online network topologies have been conducted and as validated by our numerical results, OEA can obtain an optimal result with computational complexity of O(kn$C-{n}^{k}$) and CAPA can achieve a near-optimal solution with much lower computational complexity of O(n2).
AB - The placement of satellite gateways, as critical devices for data transmission between terrestrial networks and satellites, is of fundamental importance for the design of 5G-satellite hybrid networks, especially for the network reliability since the satellite links are prone to failing due to poor meteorological conditions. To the best of our knowledge, this problem almost remains untouched. Existing works in this line mainly focused on gateway placement in wireless mesh networks and sensor networks, which have totally different network topologies and optimization targets, and thus cannot be readily adopted. In light of this, two algorithms are proposed as our solutions, i.e., an optimal enumeration algorithm (OEA) and a cluster based approximation placement algorithm (CAPA). Extensive experiments based on real world online network topologies have been conducted and as validated by our numerical results, OEA can obtain an optimal result with computational complexity of O(kn$C-{n}^{k}$) and CAPA can achieve a near-optimal solution with much lower computational complexity of O(n2).
UR - http://www.scopus.com/inward/record.url?scp=85050094273&partnerID=8YFLogxK
U2 - 10.1109/ICCNC.2018.8390422
DO - 10.1109/ICCNC.2018.8390422
M3 - 会议稿件
AN - SCOPUS:85050094273
T3 - 2018 International Conference on Computing, Networking and Communications, ICNC 2018
SP - 372
EP - 376
BT - 2018 International Conference on Computing, Networking and Communications, ICNC 2018
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2018 International Conference on Computing, Networking and Communications, ICNC 2018
Y2 - 5 March 2018 through 8 March 2018
ER -