TY - GEN
T1 - Deployment of 5G networking infrastructure with machine type communication considerations
AU - Xu, Xiangxiang
AU - Saad, Walid
AU - Zhang, Xiujun
AU - Xiao, Limin
AU - Zhou, Shidong
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2016/7/12
Y1 - 2016/7/12
N2 - Designing optimal strategies to deploy small cell stations is crucial to meet the quality-of-service requirements in next-generation cellular networks with constrained deployment costs. In this paper, a general deployment framework is proposed to jointly optimize the locations of backhaul aggregate nodes, small base stations, machine aggregators, and multi-hop wireless backhaul links to accommodate both human-type and machine-type communications. The goal is to provide deployment solutions with best coverage performance under cost constraints. The formulated problem is shown to be a multi-objective integer programming for which it is challenging to obtain the optimal solutions. To solve the problem, a heuristic algorithm is proposed by combining Lagrangian relaxation, the weighted sum method, the e-constraint method and tabu search to obtain both the solutions and bounds, for the objective function. Simulation results show that the proposed framework can provide solutions with better performance compared with conventional deployment models in scenarios where available fiber connections are scarce. Furthermore, the gap between obtained solutions and the lower bounds is quite tight.
AB - Designing optimal strategies to deploy small cell stations is crucial to meet the quality-of-service requirements in next-generation cellular networks with constrained deployment costs. In this paper, a general deployment framework is proposed to jointly optimize the locations of backhaul aggregate nodes, small base stations, machine aggregators, and multi-hop wireless backhaul links to accommodate both human-type and machine-type communications. The goal is to provide deployment solutions with best coverage performance under cost constraints. The formulated problem is shown to be a multi-objective integer programming for which it is challenging to obtain the optimal solutions. To solve the problem, a heuristic algorithm is proposed by combining Lagrangian relaxation, the weighted sum method, the e-constraint method and tabu search to obtain both the solutions and bounds, for the objective function. Simulation results show that the proposed framework can provide solutions with better performance compared with conventional deployment models in scenarios where available fiber connections are scarce. Furthermore, the gap between obtained solutions and the lower bounds is quite tight.
UR - https://www.scopus.com/pages/publications/84981316258
U2 - 10.1109/ICC.2016.7511243
DO - 10.1109/ICC.2016.7511243
M3 - 会议稿件
AN - SCOPUS:84981316258
T3 - 2016 IEEE International Conference on Communications, ICC 2016
BT - 2016 IEEE International Conference on Communications, ICC 2016
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2016 IEEE International Conference on Communications, ICC 2016
Y2 - 22 May 2016 through 27 May 2016
ER -