Multi-type service placement for joint transmission and processing in mobile augmented reality

IF 4.4 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Fuyu Liu , Jingbo Ji , Xuejian Chi
{"title":"Multi-type service placement for joint transmission and processing in mobile augmented reality","authors":"Fuyu Liu ,&nbsp;Jingbo Ji ,&nbsp;Xuejian Chi","doi":"10.1016/j.adhoc.2025.103939","DOIUrl":null,"url":null,"abstract":"<div><div>Augmented Reality (AR) technology can achieve real-time responsiveness and efficient processing by leveraging Edge Computing. Deploying mobile AR applications on edge servers significantly reduces service latency and enhances system quality of service (QoS). However, existing studies primarily focus on service placement on edge servers, while often neglecting the critical impact of network access points on service latency. In this study, we propose a joint transmission and processing multi-type service placement framework. This framework first determines the user’s access point and then identifies the optimal location for deploying the application serving that user, aiming to minimize the total system service latency. The framework faces two key challenges: user mobility and the diversity of service demands. To address these challenges, this paper designs a heuristic approach based on Block Coordinate Descent (HBCD). This algorithm dynamically selects the optimal access point and edge server for users during each epoch, effectively reducing total system service latency. Theoretical analysis demonstrates that the discrepancy in performance between the proposed algorithm and the optimal solution is tightly bounded. Furthermore, extensive simulations driven by real-world data demonstrate that the HBCD algorithm reaches near-optimal performance and markedly surpasses existing methods.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"178 ","pages":"Article 103939"},"PeriodicalIF":4.4000,"publicationDate":"2025-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ad Hoc Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1570870525001878","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Augmented Reality (AR) technology can achieve real-time responsiveness and efficient processing by leveraging Edge Computing. Deploying mobile AR applications on edge servers significantly reduces service latency and enhances system quality of service (QoS). However, existing studies primarily focus on service placement on edge servers, while often neglecting the critical impact of network access points on service latency. In this study, we propose a joint transmission and processing multi-type service placement framework. This framework first determines the user’s access point and then identifies the optimal location for deploying the application serving that user, aiming to minimize the total system service latency. The framework faces two key challenges: user mobility and the diversity of service demands. To address these challenges, this paper designs a heuristic approach based on Block Coordinate Descent (HBCD). This algorithm dynamically selects the optimal access point and edge server for users during each epoch, effectively reducing total system service latency. Theoretical analysis demonstrates that the discrepancy in performance between the proposed algorithm and the optimal solution is tightly bounded. Furthermore, extensive simulations driven by real-world data demonstrate that the HBCD algorithm reaches near-optimal performance and markedly surpasses existing methods.
移动增强现实中联合传输与处理的多类型服务放置
增强现实(AR)技术可以利用边缘计算实现实时响应和高效处理。在边缘服务器上部署移动增强现实应用,可以显著降低服务延迟,提高系统服务质量(QoS)。然而,现有的研究主要集中在边缘服务器上的服务放置,而往往忽略了网络接入点对服务延迟的关键影响。在本研究中,我们提出了一个联合传输和处理的多类型服务放置框架。该框架首先确定用户的访问点,然后确定部署为该用户服务的应用程序的最佳位置,旨在最大限度地减少总系统服务延迟。该框架面临两个关键挑战:用户移动性和服务需求的多样性。为了解决这些问题,本文设计了一种基于块坐标下降(HBCD)的启发式方法。该算法在每个时间段内为用户动态选择最优的接入点和边缘服务器,有效地降低了系统的总服务延迟。理论分析表明,所提算法与最优解之间的性能差异是紧密有界的。此外,由现实世界数据驱动的大量模拟表明,HBCD算法达到了近乎最佳的性能,明显优于现有的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Ad Hoc Networks
Ad Hoc Networks 工程技术-电信学
CiteScore
10.20
自引率
4.20%
发文量
131
审稿时长
4.8 months
期刊介绍: The Ad Hoc Networks is an international and archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in ad hoc and sensor networking areas. The Ad Hoc Networks considers original, high quality and unpublished contributions addressing all aspects of ad hoc and sensor networks. Specific areas of interest include, but are not limited to: Mobile and Wireless Ad Hoc Networks Sensor Networks Wireless Local and Personal Area Networks Home Networks Ad Hoc Networks of Autonomous Intelligent Systems Novel Architectures for Ad Hoc and Sensor Networks Self-organizing Network Architectures and Protocols Transport Layer Protocols Routing protocols (unicast, multicast, geocast, etc.) Media Access Control Techniques Error Control Schemes Power-Aware, Low-Power and Energy-Efficient Designs Synchronization and Scheduling Issues Mobility Management Mobility-Tolerant Communication Protocols Location Tracking and Location-based Services Resource and Information Management Security and Fault-Tolerance Issues Hardware and Software Platforms, Systems, and Testbeds Experimental and Prototype Results Quality-of-Service Issues Cross-Layer Interactions Scalability Issues Performance Analysis and Simulation of Protocols.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信