An Efficient Cloudlet Deployment Method Based on Approximate Graph Cut in Large-scale WMANs

被引:0
|
作者
Huang, Longxia [1 ]
Huo, Changzhi [1 ]
Zhang, Xing [1 ]
Jia, Hongjie [1 ,2 ]
机构
[1] Jiangsu Univ, Sch Comp Sci & Commun Engn, Zhenjiang 212013, Peoples R China
[2] Jiangsu Engn Res Ctr Big Data Ubiquitous Percept &, Zhenjiang 212013, Peoples R China
基金
中国国家自然科学基金;
关键词
Mobile edge computing; Cloudlet deployment; Graph cut; Approximate kernel optimization; SERVICE PLACEMENT; EDGE;
D O I
10.1007/s10489-023-04672-8
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Mobile edge computing provides a low-latency, high-bandwidth cloud computing environment for resource-constrained mobile devices by allowing mobile devices to offload tasks, but user task migration causes greater transmission delays. Cloudlets, a new component of mobile edge computing, can perform tasks offloaded by mobile users nearby to reduce the access latency and meet users' requirements for system response time. However, deploying cloudlets in large-scale wireless metropolitan area networks (WMANs) to improve the service quality of mobile applications is currently still difficult. To resolve this issue, we design a cloudlet deployment model based on approximate graph cut, which abstracts the wireless communication network into an undirected weighted graph, divides the graph according to the access point location attributes, and minimizes the user access delay of subgraphs to obtain optimal network area segmentation and cloudlet deployment locations. We also develop an efficient kernel method to optimize the objective function of graph cuts. The simulation experimental results demonstrate that our model has low time and space complexity; thus, it is suitable for large-scale cloudlet deployment and has valuable application prospects.
引用
收藏
页码:22635 / 22647
页数:13
相关论文
共 50 条
  • [1] An Efficient Cloudlet Deployment Method Based on Approximate Graph Cut in Large-scale WMANs
    Longxia Huang
    Changzhi Huo
    Xing Zhang
    Hongjie Jia
    Applied Intelligence, 2023, 53 : 22635 - 22647
  • [2] Large-scale UAV image stitching based on global registration optimization and graph-cut method
    Wang, Zhongxing
    Fu, Zhizhong
    Xu, Jin
    JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION, 2025, 107
  • [3] An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization
    Liu, Zexian
    Liu, Hongwei
    NUMERICAL ALGORITHMS, 2018, 78 (01) : 21 - 39
  • [4] An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization
    Zexian Liu
    Hongwei Liu
    Numerical Algorithms, 2018, 78 : 21 - 39
  • [5] Approximate diagonalization method for large-scale Hamiltonians
    Amin, Mohammad H.
    Smirnov, Anatoly Yu.
    Dickson, Neil G.
    Drew-Brook, Marshall
    PHYSICAL REVIEW A, 2012, 86 (05):
  • [6] LKAQ: Large-scale knowledge graph approximate query algorithm
    Wan, Xiaolong
    Wang, Hongzhi
    Li, Jianzhong
    INFORMATION SCIENCES, 2019, 505 : 306 - 324
  • [7] Large-Scale Multilabel Propagation Based on Efficient Sparse Graph Construction
    Chen, Xiangyu
    Mu, Yadong
    Liu, Hairong
    Yan, Shuicheng
    Rui, Yong
    Chua, Tat-Seng
    ACM TRANSACTIONS ON MULTIMEDIA COMPUTING COMMUNICATIONS AND APPLICATIONS, 2013, 10 (01)
  • [8] Approximate nearest neighbor graph provides fast and efficient embedding with applications for large-scale biological data
    Zhao, Jianshu
    Both, Jean Pierre
    Konstantinidis, Konstantinos T.
    NAR GENOMICS AND BIOINFORMATICS, 2024, 6 (04)
  • [9] JF-Cut: A Parallel Graph Cut Approach for Large-Scale Image and Video
    Peng, Yi
    Chen, Li
    Ou-Yang, Fang-Xin
    Chen, Wei
    Yong, Jun-Hai
    IEEE TRANSACTIONS ON IMAGE PROCESSING, 2015, 24 (02) : 1 - 12
  • [10] Optimal deployment of large-scale wireless sensor networks based on graph clustering and matrix factorization
    Gao, Hefei
    Zhu, Qianwen
    Wang, Wei
    EURASIP JOURNAL ON ADVANCES IN SIGNAL PROCESSING, 2023, 2023 (01)