基于Dempster-Shafer证据理论的边缘计算任务卸载联合隐私保护算法

IF 2.2 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC
Tian Chen , Wanming Hao , Wencong Yang , Shouyi Yang , Xuandi Sun , Zhiqing Tang
{"title":"基于Dempster-Shafer证据理论的边缘计算任务卸载联合隐私保护算法","authors":"Tian Chen ,&nbsp;Wanming Hao ,&nbsp;Wencong Yang ,&nbsp;Shouyi Yang ,&nbsp;Xuandi Sun ,&nbsp;Zhiqing Tang","doi":"10.1016/j.phycom.2025.102813","DOIUrl":null,"url":null,"abstract":"<div><div>Edge computing reduces system latency by offloading tasks from cloud servers to Internet of Things (IoT) devices. This architecture decreases network congestion, improves system efficiency, and enables real-time processing. However, in consideration of resource efficiency, user devices tend to select the nearest cloud servers, which may enable potential malicious eavesdropping devices to infer user location through intercepted communication information. Existing research has used privacy entropy to measure user location privacy, and assigned different privacy entropy values to various types of cloud servers. However, user privacy protection in real-world scenarios depends on multiple factors, not just the classification of edge cloud servers. To solve this problem, we propose a joint privacy protection algorithm (JPPA), which introduces a novel metric for user location privacy guarantee called belief, this metric combines two key factors: task caching status and the geographical location of edge cloud servers. We formulate the problem as a constrained Markov decision process (CMDP), aiming to minimize the average network traffic subject to constraints on belief levels and energy outage probability. By transforming the CMDP into a linear programming problem, computational feasibility is ensured. Simulation results demonstrate that compared to traditional privacy entropy-constrained methods, JPPA reduces average network traffic overhead more effectively while ensuring user location privacy.</div></div>","PeriodicalId":48707,"journal":{"name":"Physical Communication","volume":"72 ","pages":"Article 102813"},"PeriodicalIF":2.2000,"publicationDate":"2025-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A joint privacy protection algorithm for edge computing task offloading based on Dempster–Shafer evidence theory\",\"authors\":\"Tian Chen ,&nbsp;Wanming Hao ,&nbsp;Wencong Yang ,&nbsp;Shouyi Yang ,&nbsp;Xuandi Sun ,&nbsp;Zhiqing Tang\",\"doi\":\"10.1016/j.phycom.2025.102813\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Edge computing reduces system latency by offloading tasks from cloud servers to Internet of Things (IoT) devices. This architecture decreases network congestion, improves system efficiency, and enables real-time processing. However, in consideration of resource efficiency, user devices tend to select the nearest cloud servers, which may enable potential malicious eavesdropping devices to infer user location through intercepted communication information. Existing research has used privacy entropy to measure user location privacy, and assigned different privacy entropy values to various types of cloud servers. However, user privacy protection in real-world scenarios depends on multiple factors, not just the classification of edge cloud servers. To solve this problem, we propose a joint privacy protection algorithm (JPPA), which introduces a novel metric for user location privacy guarantee called belief, this metric combines two key factors: task caching status and the geographical location of edge cloud servers. We formulate the problem as a constrained Markov decision process (CMDP), aiming to minimize the average network traffic subject to constraints on belief levels and energy outage probability. By transforming the CMDP into a linear programming problem, computational feasibility is ensured. Simulation results demonstrate that compared to traditional privacy entropy-constrained methods, JPPA reduces average network traffic overhead more effectively while ensuring user location privacy.</div></div>\",\"PeriodicalId\":48707,\"journal\":{\"name\":\"Physical Communication\",\"volume\":\"72 \",\"pages\":\"Article 102813\"},\"PeriodicalIF\":2.2000,\"publicationDate\":\"2025-08-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Physical Communication\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1874490725002162\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"ENGINEERING, ELECTRICAL & ELECTRONIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Physical Communication","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1874490725002162","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

摘要

边缘计算通过将任务从云服务器卸载到物联网(IoT)设备来减少系统延迟。该架构减少了网络拥塞,提高了系统效率,实现了实时处理。然而,出于资源效率的考虑,用户设备倾向于选择最近的云服务器,这可能会使潜在的恶意窃听设备通过截获的通信信息推断出用户的位置。已有研究利用隐私熵度量用户位置隐私,并对不同类型的云服务器分配不同的隐私熵值。然而,在现实场景中,用户隐私保护取决于多种因素,而不仅仅是边缘云服务器的分类。为了解决这一问题,我们提出了一种联合隐私保护算法(JPPA),该算法引入了一种新的用户位置隐私保证度量,称为信念,该度量结合了任务缓存状态和边缘云服务器的地理位置两个关键因素。我们将该问题描述为约束马尔可夫决策过程(CMDP),其目标是在受信度和能量中断概率约束的情况下最小化平均网络流量。通过将CMDP问题转化为线性规划问题,保证了计算的可行性。仿真结果表明,与传统的隐私熵约束方法相比,JPPA在保证用户位置隐私的同时,更有效地降低了平均网络流量开销。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A joint privacy protection algorithm for edge computing task offloading based on Dempster–Shafer evidence theory
Edge computing reduces system latency by offloading tasks from cloud servers to Internet of Things (IoT) devices. This architecture decreases network congestion, improves system efficiency, and enables real-time processing. However, in consideration of resource efficiency, user devices tend to select the nearest cloud servers, which may enable potential malicious eavesdropping devices to infer user location through intercepted communication information. Existing research has used privacy entropy to measure user location privacy, and assigned different privacy entropy values to various types of cloud servers. However, user privacy protection in real-world scenarios depends on multiple factors, not just the classification of edge cloud servers. To solve this problem, we propose a joint privacy protection algorithm (JPPA), which introduces a novel metric for user location privacy guarantee called belief, this metric combines two key factors: task caching status and the geographical location of edge cloud servers. We formulate the problem as a constrained Markov decision process (CMDP), aiming to minimize the average network traffic subject to constraints on belief levels and energy outage probability. By transforming the CMDP into a linear programming problem, computational feasibility is ensured. Simulation results demonstrate that compared to traditional privacy entropy-constrained methods, JPPA reduces average network traffic overhead more effectively while ensuring user location privacy.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Physical Communication
Physical Communication ENGINEERING, ELECTRICAL & ELECTRONICTELECO-TELECOMMUNICATIONS
CiteScore
5.00
自引率
9.10%
发文量
212
审稿时长
55 days
期刊介绍: PHYCOM: Physical Communication is an international and archival journal providing complete coverage of all topics of interest to those involved in all aspects of physical layer communications. Theoretical research contributions presenting new techniques, concepts or analyses, applied contributions reporting on experiences and experiments, and tutorials are published. Topics of interest include but are not limited to: Physical layer issues of Wireless Local Area Networks, WiMAX, Wireless Mesh Networks, Sensor and Ad Hoc Networks, PCS Systems; Radio access protocols and algorithms for the physical layer; Spread Spectrum Communications; Channel Modeling; Detection and Estimation; Modulation and Coding; Multiplexing and Carrier Techniques; Broadband Wireless Communications; Wireless Personal Communications; Multi-user Detection; Signal Separation and Interference rejection: Multimedia Communications over Wireless; DSP Applications to Wireless Systems; Experimental and Prototype Results; Multiple Access Techniques; Space-time Processing; Synchronization Techniques; Error Control Techniques; Cryptography; Software Radios; Tracking; Resource Allocation and Inference Management; Multi-rate and Multi-carrier Communications; Cross layer Design and Optimization; Propagation and Channel Characterization; OFDM Systems; MIMO Systems; Ultra-Wideband Communications; Cognitive Radio System Architectures; Platforms and Hardware Implementations for the Support of Cognitive, Radio Systems; Cognitive Radio Resource Management and Dynamic Spectrum Sharing.
×
引用
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学术官方微信