A Novel Network Planning Algorithm of Three-Dimensional Dense Networks Based on Adaptive Variable-Length Particle Swarm Optimization

A Novel Network Planning Algorithm of Three-Dimensional Dense Networks Based on Adaptive Variable-Length Particle Swarm Optimization

Small base stations (SBSs) deployed in hotspots are formed into dense networks to improve network coverage and system capacity. However, the deployment of SBSs becomes a great challenge owing to the high density of small cells and the uneven distribution of traffic. In this paper, we propose a three...

Full description

Bibliographic Details
Main Authors: Yue Wang, Xiaorong Zhu
Format: Article
Language:English
Published: IEEE 2019-01-01
Series:IEEE Access
Subjects:
Three-dimensional dense networks
network planning
coverage
capacity
AVLPSO
Online Access:https://ieeexplore.ieee.org/document/8681164/
id doaj-b6e821de186b4916880f1236b9c4e81a
record_format Article
spelling doaj-b6e821de186b4916880f1236b9c4e81a2021-03-29T22:40:00ZengIEEEIEEE Access2169-35362019-01-017459404595010.1109/ACCESS.2019.29089808681164A Novel Network Planning Algorithm of Three-Dimensional Dense Networks Based on Adaptive Variable-Length Particle Swarm OptimizationYue Wang0https://orcid.org/0000-0003-1997-7113Xiaorong Zhu1Nanjing University of Posts and Telecommunications, Nanjing, ChinaNanjing University of Posts and Telecommunications, Nanjing, ChinaSmall base stations (SBSs) deployed in hotspots are formed into dense networks to improve network coverage and system capacity. However, the deployment of SBSs becomes a great challenge owing to the high density of small cells and the uneven distribution of traffic. In this paper, we propose a three-dimensional (3D) dense network planning method to deploy SBSs in hotspots. First, considering the propagation characteristics of 3D indoor deployment environment and the hybrid distribution of traffic, we estimate the network dimension to obtain the approximate number of SBSs that need to cover the entire area and meet the rate requirements of all users in a given space. Then, we formulate network planning as an optimization problem with the objective of minimizing the number of SBSs while satisfying both coverage and capacity constraints. Finally, in order to solve the optimization problem, we propose an adaptive variable-length particle swarm optimization (AVLPSO) algorithm. Simulation results indicate that compared with the traditional algorithms, the proposed algorithm can significantly achieve higher service ratio and reduce the costs of deployment.https://ieeexplore.ieee.org/document/8681164/Three-dimensional dense networksnetwork planningcoveragecapacityAVLPSO
collection DOAJ
language English
format Article
sources DOAJ
author Yue Wang
Xiaorong Zhu
spellingShingle Yue Wang
Xiaorong Zhu
A Novel Network Planning Algorithm of Three-Dimensional Dense Networks Based on Adaptive Variable-Length Particle Swarm Optimization
IEEE Access
Three-dimensional dense networks
network planning
coverage
capacity
AVLPSO
author_facet Yue Wang
Xiaorong Zhu
author_sort Yue Wang
title A Novel Network Planning Algorithm of Three-Dimensional Dense Networks Based on Adaptive Variable-Length Particle Swarm Optimization
title_short A Novel Network Planning Algorithm of Three-Dimensional Dense Networks Based on Adaptive Variable-Length Particle Swarm Optimization
title_full A Novel Network Planning Algorithm of Three-Dimensional Dense Networks Based on Adaptive Variable-Length Particle Swarm Optimization
title_fullStr A Novel Network Planning Algorithm of Three-Dimensional Dense Networks Based on Adaptive Variable-Length Particle Swarm Optimization
title_full_unstemmed A Novel Network Planning Algorithm of Three-Dimensional Dense Networks Based on Adaptive Variable-Length Particle Swarm Optimization
title_sort novel network planning algorithm of three-dimensional dense networks based on adaptive variable-length particle swarm optimization
publisher IEEE
series IEEE Access
issn 2169-3536
publishDate 2019-01-01
description Small base stations (SBSs) deployed in hotspots are formed into dense networks to improve network coverage and system capacity. However, the deployment of SBSs becomes a great challenge owing to the high density of small cells and the uneven distribution of traffic. In this paper, we propose a three-dimensional (3D) dense network planning method to deploy SBSs in hotspots. First, considering the propagation characteristics of 3D indoor deployment environment and the hybrid distribution of traffic, we estimate the network dimension to obtain the approximate number of SBSs that need to cover the entire area and meet the rate requirements of all users in a given space. Then, we formulate network planning as an optimization problem with the objective of minimizing the number of SBSs while satisfying both coverage and capacity constraints. Finally, in order to solve the optimization problem, we propose an adaptive variable-length particle swarm optimization (AVLPSO) algorithm. Simulation results indicate that compared with the traditional algorithms, the proposed algorithm can significantly achieve higher service ratio and reduce the costs of deployment.
topic Three-dimensional dense networks
network planning
coverage
capacity
AVLPSO
url https://ieeexplore.ieee.org/document/8681164/
work_keys_str_mv AT yuewang anovelnetworkplanningalgorithmofthreedimensionaldensenetworksbasedonadaptivevariablelengthparticleswarmoptimization
AT xiaorongzhu anovelnetworkplanningalgorithmofthreedimensionaldensenetworksbasedonadaptivevariablelengthparticleswarmoptimization
AT yuewang novelnetworkplanningalgorithmofthreedimensionaldensenetworksbasedonadaptivevariablelengthparticleswarmoptimization
AT xiaorongzhu novelnetworkplanningalgorithmofthreedimensionaldensenetworksbasedonadaptivevariablelengthparticleswarmoptimization
_version_ 1724191195879440384

Similar Items