2020
DOI: 10.1109/access.2020.3011472
|View full text |Cite
|
Sign up to set email alerts
|

Optimization of the Deployment of Relay Nodes in Cellular Networks

Abstract: Significant and continuous contributions related to 4G/5G cellular networks are still accelerating the investigation of the approaches that can boost the cell characteristics following the new aspirations of the users. The challenge of achieving sufficient coverage at the cell edge; represents a constant concern for both users and operators; in addition to ensuring a reasonable cost, are the most important search fields and in our scope of interest. As relay nodes can provide a solution, a scenario for a plan … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 41 publications
0
1
0
Order By: Relevance
“…Although the genetic algorithm works well for solution searches on the discrete potential solution set composed of finite points [27], [28], it has limitations in searching station selection solutions in a continuous space for solving the CMCP. The particle swarm optimization (PSO) algorithm [29] supports searching for the optimal solution in the continuous feasible solution space [30], [31], which provides a strong support for solving the location model [32]. It can greatly improve the computability of the CMCP, because the positions of particles in PSO can move throughout the entire spatially-continuous demand space, rather than appearing only on a fixed set of points.…”
Section: Related Workmentioning
confidence: 99%
“…Although the genetic algorithm works well for solution searches on the discrete potential solution set composed of finite points [27], [28], it has limitations in searching station selection solutions in a continuous space for solving the CMCP. The particle swarm optimization (PSO) algorithm [29] supports searching for the optimal solution in the continuous feasible solution space [30], [31], which provides a strong support for solving the location model [32]. It can greatly improve the computability of the CMCP, because the positions of particles in PSO can move throughout the entire spatially-continuous demand space, rather than appearing only on a fixed set of points.…”
Section: Related Workmentioning
confidence: 99%