{"title":"User Preference Oriented Service Caching and Task Offloading for UAV-Assisted MEC Networks","authors":"Ruiting Zhou;Yifeng Huang;Yufeng Wang;Lei Jiao;Haisheng Tan;Renli Zhang;Libing Wu","doi":"10.1109/TSC.2025.3536319","DOIUrl":null,"url":null,"abstract":"Unmanned aerial vehicles (UAVs) have emerged as a new and flexible paradigm to offer low-latency and diverse mobile edge computing (MEC) services for user equipment (UE). To minimize the service delay, caching is introduced in UAV-assisted MEC networks to bring service contents closer to UEs. However, UAV-assisted MEC is challenged by the heavy communication overhead introduced by service caching and UAV’s limited energy capacity. In this article, we propose an online algorithm, <italic>OOA</i>, that jointly optimizes caching and offloading decisions for UAV-assisted MEC networks, to minimize the overall service delay. Specifically, to improve the caching effectiveness and reduce the caching overhead, <italic>OOA</i> employs a greedy algorithm to dynamically make caching decisions based on UEs’ preferences on services and UAVs’ historical trajectories, with the goal of maximizing the probability of successful offloading. To realize the rational utilization of energy from a long-term perspective, <italic>OOA</i> decomposes the online problem into a series of single-slot problems by scaling the UAV’s energy constraint into the objective, and iteratively optimizes UAV trajectory and task offloading at each time slot. Theoretical analysis proves that <italic>OOA</i> converges to a suboptimal solution with polynomial time complexity. Extensive simulations based on real world data further show that <italic>OOA</i> can reduce the service delay by up to 33% while satisfying the UAV’s energy constraint, compared to three state-of-the-art algorithms.","PeriodicalId":13255,"journal":{"name":"IEEE Transactions on Services Computing","volume":"18 2","pages":"1097-1109"},"PeriodicalIF":5.5000,"publicationDate":"2025-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Services Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10886975/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
Unmanned aerial vehicles (UAVs) have emerged as a new and flexible paradigm to offer low-latency and diverse mobile edge computing (MEC) services for user equipment (UE). To minimize the service delay, caching is introduced in UAV-assisted MEC networks to bring service contents closer to UEs. However, UAV-assisted MEC is challenged by the heavy communication overhead introduced by service caching and UAV’s limited energy capacity. In this article, we propose an online algorithm, OOA, that jointly optimizes caching and offloading decisions for UAV-assisted MEC networks, to minimize the overall service delay. Specifically, to improve the caching effectiveness and reduce the caching overhead, OOA employs a greedy algorithm to dynamically make caching decisions based on UEs’ preferences on services and UAVs’ historical trajectories, with the goal of maximizing the probability of successful offloading. To realize the rational utilization of energy from a long-term perspective, OOA decomposes the online problem into a series of single-slot problems by scaling the UAV’s energy constraint into the objective, and iteratively optimizes UAV trajectory and task offloading at each time slot. Theoretical analysis proves that OOA converges to a suboptimal solution with polynomial time complexity. Extensive simulations based on real world data further show that OOA can reduce the service delay by up to 33% while satisfying the UAV’s energy constraint, compared to three state-of-the-art algorithms.
期刊介绍:
IEEE Transactions on Services Computing encompasses the computing and software aspects of the science and technology of services innovation research and development. It places emphasis on algorithmic, mathematical, statistical, and computational methods central to services computing. Topics covered include Service Oriented Architecture, Web Services, Business Process Integration, Solution Performance Management, and Services Operations and Management. The transactions address mathematical foundations, security, privacy, agreement, contract, discovery, negotiation, collaboration, and quality of service for web services. It also covers areas like composite web service creation, business and scientific applications, standards, utility models, business process modeling, integration, collaboration, and more in the realm of Services Computing.