Mobile edge computing(MEC)provides services to devices and reduces latency in cellular internet of things(IoT)networks.However,the challenging problem is how to deploy MEC servers economically and efficiently.This pap...Mobile edge computing(MEC)provides services to devices and reduces latency in cellular internet of things(IoT)networks.However,the challenging problem is how to deploy MEC servers economically and efficiently.This paper investigates the deployment problem of MEC servers of the real-world road network by employing an improved genetic algorithm(GA)scheme.We first use the threshold-based K-means algorithm to form vehicle clusters according to their locations.We then select base stations(BSs)based on clustering center coordinates as the deployment locations set for potential MEC servers.We further select BSs using a combined simulated annealing(SA)algorithm and GA to minimize the deployment cost.The simulation results show that the improved GA deploys MEC servers effectively.In addition,the proposed algorithm outperforms GA and SA algorithms in terms of convergence speed and solution quality.展开更多
To reduce fetching cost from a remote source,it is natural to cache information near the users who may access the information later.However,with development of 5 G ultra-dense cellular networks andmobile edge computin...To reduce fetching cost from a remote source,it is natural to cache information near the users who may access the information later.However,with development of 5 G ultra-dense cellular networks andmobile edge computing(MEC),a reasonable selection among edge servers for content delivery becomes a problem when the mobile edge obtaining sufficient replica servers.In order to minimize the total cost accounting for both caching and fetching process,we study the optimal resource allocation for the content replica servers’ deployment.We decompose the total cost as the superposition of cost in several coverages.Particularly,we consider the criterion for determining the coverage of a replica server and formulate the coverage as a tradeoff between caching cost and fetching cost.According to the criterion,a coverage isolation(CI) algorithm is proposed to solve the deployment problem.The numerical results show that the proposed CI algorithm can reduce the cost and obtain a higher tolerance for different centrality indices.展开更多
基金supported in part by National Key Research and Development Project (2020YFB1807204)in part by the National Natural Science Foundation of China (U2001213 and 61971191)+1 种基金in part by the Beijing Natural Science Foundation under Grant L201011in part by Jiangxi Key Laboratory of Artificial Intelligence Transportation Information Transmission and Processing (20202BCD42010)
文摘Mobile edge computing(MEC)provides services to devices and reduces latency in cellular internet of things(IoT)networks.However,the challenging problem is how to deploy MEC servers economically and efficiently.This paper investigates the deployment problem of MEC servers of the real-world road network by employing an improved genetic algorithm(GA)scheme.We first use the threshold-based K-means algorithm to form vehicle clusters according to their locations.We then select base stations(BSs)based on clustering center coordinates as the deployment locations set for potential MEC servers.We further select BSs using a combined simulated annealing(SA)algorithm and GA to minimize the deployment cost.The simulation results show that the improved GA deploys MEC servers effectively.In addition,the proposed algorithm outperforms GA and SA algorithms in terms of convergence speed and solution quality.
文摘在车联网中,任务卸载可以有效地解决车辆的存储资源和计算资源不足的问题,单个的MEC(mobile edge computing)服务器通常无法满足车辆密集区域的任务卸载需求。针对上述不足,设计了一种多MEC服务器的联合卸载方案(joint offloading method based on task urgency,JOMTU)。车辆递交任务卸载请求给本地MEC服务器时,后者在负载严重的情况下,会根据任务的紧急性和服务器负载情况等因素,将任务发送给附近MEC服务器处理以满足任务的截止日期要求。仿真实验结果表明,与传统的方案相比,所提出的方案将系统的整体任务失败率降低17%,并且优化了整个网络的服务器负载情况、增加了网络的可靠性。
基金supported by NSFC(61571055)fund of SKL of MMW(K201815)Important National Science and Technology Specific Projects(2017ZX03001028)
文摘To reduce fetching cost from a remote source,it is natural to cache information near the users who may access the information later.However,with development of 5 G ultra-dense cellular networks andmobile edge computing(MEC),a reasonable selection among edge servers for content delivery becomes a problem when the mobile edge obtaining sufficient replica servers.In order to minimize the total cost accounting for both caching and fetching process,we study the optimal resource allocation for the content replica servers’ deployment.We decompose the total cost as the superposition of cost in several coverages.Particularly,we consider the criterion for determining the coverage of a replica server and formulate the coverage as a tradeoff between caching cost and fetching cost.According to the criterion,a coverage isolation(CI) algorithm is proposed to solve the deployment problem.The numerical results show that the proposed CI algorithm can reduce the cost and obtain a higher tolerance for different centrality indices.