Dummy Location Generation Algorithm for User Density

With the development of the Internet, location-Based Services have become an indispensable part of people's lives. However, the issue of user location security has also gained significant attention. To address this issue, this article proposes a user density-based location privacy protection algorithm. The algorithm utilizes the distribution density of surrounding users to determine suitable anonymous areas and divides the areas into multiple anonymous sub-areas. Additionally, it combines probability distribution to generate dummy locations, thereby protecting the privacy of user locations. Experimental verification shows that under the same conditions, the algorithm only requires awareness of 3 to 4 jumps to determine anonymous areas. Furthermore, when the anonymity degree is set at 40 , the relative area ratio and relative anonymity degree remain in a balanced state. This algorithm not only effectively controls the area of anonymous regions and reduces algorithm costs but also protects user location privacy. It demonstrates practicality and feasibility.

Publication Details

Journal
SHILAP Revista de lepidopterología
Published
2024-12-01
DOI
https://doi.org/10.15938/j.jhust.2024.06.008
Primary Topic
Privacy-Preserving Technologies in Data
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dummy Location Generation Algorithm for User Density

SHILAP Revista de lepidopterología
Privacy-Preserving Technologies in Data
article

Dummy Location Generation Algorithm for User Density

article en

Abstract

With the development of the Internet, location-Based Services have become an indispensable part of people's lives. However, the issue of user location security has also gained significant attention. To address this issue, this article proposes a user density-based location privacy protection algorithm. The algorithm utilizes the distribution density of surrounding users to determine suitable anonymous areas and divides the areas into multiple anonymous sub-areas. Additionally, it combines probability distribution to generate dummy locations, thereby protecting the privacy of user locations. Experimental verification shows that under the same conditions, the algorithm only requires awareness of 3 to 4 jumps to determine anonymous areas. Furthermore, when the anonymity degree is set at 40 , the relative area ratio and relative anonymity degree remain in a balanced state. This algorithm not only effectively controls the area of anonymous regions and reduces algorithm costs but also protects user location privacy. It demonstrates practicality and feasibility.

SHILAP Revista de lepidopterología
Peace, Justice and strong institutions
Openalex Percentile: Top 67%
Privacy-Preserving Technologies in Data
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.