Optimal edge gateway deployment in internet of things based on simulated annealing with adaptive external penalty

Abstract In the large scale Internet of things, edge gateway (EG) deployment is used to find the minimal number of gateways required in the network and their optimal locations under the design constraints to meet different service requirements, which is one significant issue for improving network pe...

Full description

Bibliographic Details
Main Authors: Xiaorong Zhu, Fang Xiao, Yue Wang, Yong Wang
Format: Article
Language:English
Published: Wiley 2021-10-01
Series:IET Communications
Online Access:https://doi.org/10.1049/cmu2.12244
id doaj-268c66563bac466fb49452ae6b8ccba4
record_format Article
spelling doaj-268c66563bac466fb49452ae6b8ccba42021-10-01T08:39:39ZengWileyIET Communications1751-86281751-86362021-10-0115162111212410.1049/cmu2.12244Optimal edge gateway deployment in internet of things based on simulated annealing with adaptive external penaltyXiaorong Zhu0Fang Xiao1Yue Wang2Yong Wang3Nanjing University of Posts & Telecommunications Nanjing ChinaNanjing University of Posts & Telecommunications Nanjing ChinaNanjing University of Posts & Telecommunications Nanjing ChinaNanjing Vocational University of Industry Technology Nanjing ChinaAbstract In the large scale Internet of things, edge gateway (EG) deployment is used to find the minimal number of gateways required in the network and their optimal locations under the design constraints to meet different service requirements, which is one significant issue for improving network performances. We formulate the EG deployment problem as a k‐median problem with some constraints, which is known as a NP‐hard problem. For that, we propose a new heuristic based on simulated annealing with external penalty function (SA‐AEP) for its solution. The external penalty function is used to transform the multi‐constrained optimization problem into a single constraint one. Also the complexity of proposed heuristic algorithm is analyzed. In addition, in order to evaluate the proposed algorithm, we compare it with an adaptive variable‐length particle swarm optimization algorithm with varying lengths. Simulation results show that the proposed SA‐AEP algorithm has much better performances on network cost and efficiency than other algorithms when the higher service rate is required.https://doi.org/10.1049/cmu2.12244
collection DOAJ
language English
format Article
sources DOAJ
author Xiaorong Zhu
Fang Xiao
Yue Wang
Yong Wang
spellingShingle Xiaorong Zhu
Fang Xiao
Yue Wang
Yong Wang
Optimal edge gateway deployment in internet of things based on simulated annealing with adaptive external penalty
IET Communications
author_facet Xiaorong Zhu
Fang Xiao
Yue Wang
Yong Wang
author_sort Xiaorong Zhu
title Optimal edge gateway deployment in internet of things based on simulated annealing with adaptive external penalty
title_short Optimal edge gateway deployment in internet of things based on simulated annealing with adaptive external penalty
title_full Optimal edge gateway deployment in internet of things based on simulated annealing with adaptive external penalty
title_fullStr Optimal edge gateway deployment in internet of things based on simulated annealing with adaptive external penalty
title_full_unstemmed Optimal edge gateway deployment in internet of things based on simulated annealing with adaptive external penalty
title_sort optimal edge gateway deployment in internet of things based on simulated annealing with adaptive external penalty
publisher Wiley
series IET Communications
issn 1751-8628
1751-8636
publishDate 2021-10-01
description Abstract In the large scale Internet of things, edge gateway (EG) deployment is used to find the minimal number of gateways required in the network and their optimal locations under the design constraints to meet different service requirements, which is one significant issue for improving network performances. We formulate the EG deployment problem as a k‐median problem with some constraints, which is known as a NP‐hard problem. For that, we propose a new heuristic based on simulated annealing with external penalty function (SA‐AEP) for its solution. The external penalty function is used to transform the multi‐constrained optimization problem into a single constraint one. Also the complexity of proposed heuristic algorithm is analyzed. In addition, in order to evaluate the proposed algorithm, we compare it with an adaptive variable‐length particle swarm optimization algorithm with varying lengths. Simulation results show that the proposed SA‐AEP algorithm has much better performances on network cost and efficiency than other algorithms when the higher service rate is required.
url https://doi.org/10.1049/cmu2.12244
work_keys_str_mv AT xiaorongzhu optimaledgegatewaydeploymentininternetofthingsbasedonsimulatedannealingwithadaptiveexternalpenalty
AT fangxiao optimaledgegatewaydeploymentininternetofthingsbasedonsimulatedannealingwithadaptiveexternalpenalty
AT yuewang optimaledgegatewaydeploymentininternetofthingsbasedonsimulatedannealingwithadaptiveexternalpenalty
AT yongwang optimaledgegatewaydeploymentininternetofthingsbasedonsimulatedannealingwithadaptiveexternalpenalty
_version_ 1716861916078407680