Achieving efficient and accurate privacy-preserving localization for internet of things: A quantization-based approach

IF 6.2 2区 计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS
Guanghui Wang , Xueyuan Zhang , Lingfeng Shen , Shengbo Chen , Fei Tong , Xin He , Wenyao Li
{"title":"Achieving efficient and accurate privacy-preserving localization for internet of things: A quantization-based approach","authors":"Guanghui Wang ,&nbsp;Xueyuan Zhang ,&nbsp;Lingfeng Shen ,&nbsp;Shengbo Chen ,&nbsp;Fei Tong ,&nbsp;Xin He ,&nbsp;Wenyao Li","doi":"10.1016/j.future.2025.107740","DOIUrl":null,"url":null,"abstract":"<div><div>Privacy-preserving localization is an important enabling technology for location-based applications on the Internet of Things (IoT). Existing work utilizes encryption or noise-adding mechanism to develop privacy-preserving methods during the localization process. However, these methods still face the challenge of simultaneously achieve localization accuracy, privacy preservation and communication efficiency. To address the challenge, in this paper, a novel quantization-based privacy-preserving localization (QPPL) algorithm is proposed to estimate the target’s location with accuracy, privacy preservation and communication efficiency at the same time. Firstly, the location information is quantized, i.e., deviate the location data, to preserve the private location information during the localization process. With the quantization on the location information, the data scale is compressed to reduce communication cost and improve localization efficiency. Then, to improve the localization accuracy, an optimal weight allocation scheme is designed to aggregate the location estimates from the heterogeneous anchor devices. By minimizing the weighted sum of squared quantization errors of all anchor devices, a closed form optimal weight allocation scheme is derived by using convex optimization theory. Finally, through theoretical analysis, we prove the accuracy, privacy preservation and efficiency of the QPPL algorithm. Experimental evaluation demonstrates that QPPL has superior performance compared with existing methods.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"167 ","pages":"Article 107740"},"PeriodicalIF":6.2000,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Future Generation Computer Systems-The International Journal of Escience","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167739X25000354","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

Privacy-preserving localization is an important enabling technology for location-based applications on the Internet of Things (IoT). Existing work utilizes encryption or noise-adding mechanism to develop privacy-preserving methods during the localization process. However, these methods still face the challenge of simultaneously achieve localization accuracy, privacy preservation and communication efficiency. To address the challenge, in this paper, a novel quantization-based privacy-preserving localization (QPPL) algorithm is proposed to estimate the target’s location with accuracy, privacy preservation and communication efficiency at the same time. Firstly, the location information is quantized, i.e., deviate the location data, to preserve the private location information during the localization process. With the quantization on the location information, the data scale is compressed to reduce communication cost and improve localization efficiency. Then, to improve the localization accuracy, an optimal weight allocation scheme is designed to aggregate the location estimates from the heterogeneous anchor devices. By minimizing the weighted sum of squared quantization errors of all anchor devices, a closed form optimal weight allocation scheme is derived by using convex optimization theory. Finally, through theoretical analysis, we prove the accuracy, privacy preservation and efficiency of the QPPL algorithm. Experimental evaluation demonstrates that QPPL has superior performance compared with existing methods.
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
19.90
自引率
2.70%
发文量
376
审稿时长
10.6 months
期刊介绍: Computing infrastructures and systems are constantly evolving, resulting in increasingly complex and collaborative scientific applications. To cope with these advancements, there is a growing need for collaborative tools that can effectively map, control, and execute these applications. Furthermore, with the explosion of Big Data, there is a requirement for innovative methods and infrastructures to collect, analyze, and derive meaningful insights from the vast amount of data generated. This necessitates the integration of computational and storage capabilities, databases, sensors, and human collaboration. Future Generation Computer Systems aims to pioneer advancements in distributed systems, collaborative environments, high-performance computing, and Big Data analytics. It strives to stay at the forefront of developments in grids, clouds, and the Internet of Things (IoT) to effectively address the challenges posed by these wide-area, fully distributed sensing and computing systems.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信