Multiobjective Placement of Edge Servers in MEC Environment Using a Hybrid Algorithm Based on NSGA-II and MOPSO
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F24%3A10257075" target="_blank" >RIV/61989100:27240/24:10257075 - isvavai.cz</a>
Result on the web
<a href="https://ieeexplore.ieee.org/document/10547537" target="_blank" >https://ieeexplore.ieee.org/document/10547537</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/JIOT.2024.3409569" target="_blank" >10.1109/JIOT.2024.3409569</a>
Alternative languages
Result language
angličtina
Original language name
Multiobjective Placement of Edge Servers in MEC Environment Using a Hybrid Algorithm Based on NSGA-II and MOPSO
Original language description
In a mobile edge computing (MEC) environment, latency and energy consumption can be reduced by offloading tasks from mobile devices to edge servers (ESs) instead of remote cloud servers. The placement of ESs closest to end users can improve Quality of Experience and Quality of Service. Additionally, the deployment of additional servers to cover each user will ensure that user requirements are met even if the designated ES is unable to provide service. Therefore, the use of additional ESs can improve network robustness. However, edge service providers tend to cover all areas of a city with a minimum number of servers to save costs. Since the coverage zones of ESs can overlap, fewer additional ESs need to be deployed to support overlapping areas, resulting in cost savings. This article examines the problem of ES placement and proposes a new model to simultaneously optimize network latency, coverage with overlap control, and operational expenditures (OPEXs) of the MEC. In addition, a binary version of the hybrid NSGA II-MOPSO algorithm called BHNM is proposed to obtain the approximated Pareto front. Results based on the real-world data set from Shanghai Telecom show that the BHNM algorithm outperforms the binary MOPSO with turbulence (BMOPSO-T) and NSGA-II algorithms in terms of Pareto front diversity.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
O - Projekt operacniho programu
Others
Publication year
2024
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
IEEE Internet of Things Journal
ISSN
2327-4662
e-ISSN
—
Volume of the periodical
11
Issue of the periodical within the volume
18
Country of publishing house
US - UNITED STATES
Number of pages
19
Pages from-to
29819-29837
UT code for WoS article
001316227800045
EID of the result in the Scopus database
—