• Complex
  • Title
  • Keyword
  • Abstract
  • Scholars
  • Journal
  • ISSN
  • Conference
成果搜索

author:

Zhang, P.-F. (Zhang, P.-F..) [1] | Zhai, R.-C. (Zhai, R.-C..) [2] | Cheng, X. (Cheng, X..) [3] | Zhang, Z.-K. (Zhang, Z.-K..) [4] | Liu, X.-M. (Liu, X.-M..) [5] | Wang, J. (Wang, J..) [6]

Indexed by:

Scopus

Abstract:

In spatial crowdsourcing, task allocation is a crucial prerequisite for subsequent location-aware data collection. To tackle potential location privacy breaches, researchers often adopt geo-indistinguishability. Existing approaches that satisfy Geo-I are often designed for one-to-one scenarios, while implicitly assume that workers can perform any task, and they often focus on minimizing the average travel distance, rather than maximizing the number of task allocation. Furthermore, these studies often incorporate the planar laplacian mechanism to achieve Geo-I. However, due to the randomness and unbounded nature of PL, it can result in excessive noise in the location data uploaded by workers, significantly deteriorating the utility of task allocation. This can lead to either long distances or unassigned tasks. To address these problems, we propose MONITOR (Many-to-many task allOcation under geo-iNdIsTinguishability for spatial crOwdsouRcing), a new privacy-preserving task allocation approach for many-to-many scenario. The general idea of MONITOR is to upload the distances from each worker’s true location to the obfuscated preferred tasks’ locations instead of uploading each obfuscated worker’s location. In MONITOR, to collect the distances for subsequent task allocation, we design an obfuscated distance collection method, called GroCol (Group-based obfuscated distance Collection). To improve the utility for task allocation, we develop a parameter independent obfuscated distance comparison method called ParCom (Parameter-free obfuscated distance Comparison). To illustrate the effectiveness of MONITOR, we first theoretically analyze its privacy guarantee, task utility, and computational complexity. We then empirically show on two real-world datasets and one synthetic dataset that MONITOR share similar results to that of non-private task allocation about the number of assigned tasks, and reduce the average travel distance by more than 20% compared to the baseline approaches. © 2025 Chinese Institute of Electronics. All rights reserved.

Keyword:

average travel distance geo-indistinguishability privacy protection spatial crowdsourcing task allocation

Community:

  • [ 1 ] [Zhang P.-F.]School of Computer Science and Engineering, Anhui University of Science and Technology, Anhui, Huainan, 232001, China
  • [ 2 ] [Zhai R.-C.]School of Computer Science and Engineering, Anhui University of Science and Technology, Anhui, Huainan, 232001, China
  • [ 3 ] [Cheng X.]National Pilot Software Engineering School, Beijing University of Posts and Telecommunications, Beijing, 100876, China
  • [ 4 ] [Cheng X.]The State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, 100876, China
  • [ 5 ] [Zhang Z.-K.]College of Computer Science and Technology, Zhejiang University, Zhejiang, Hangzhou, 310058, China
  • [ 6 ] [Liu X.-M.]College of Computer and Data Science, Fuzhou University, Fujian, Fuzhou, 350108, China
  • [ 7 ] [Wang J.]School of Safety Science and Engineering, Anhui University of Science and Technology, Anhui, Huainan, 232001, China

Reprint 's Address:

Email:

Show more details

Related Keywords:

Source :

Acta Electronica Sinica

ISSN: 0372-2112

Year: 2025

Issue: 3

Volume: 53

Page: 878-894

Cited Count:

WoS CC Cited Count:

SCOPUS Cited Count:

ESI Highly Cited Papers on the List: 0 Unfold All

WanFang Cited Count:

Chinese Cited Count:

30 Days PV: 0

Affiliated Colleges:

Online/Total:112/11139681
Address:FZU Library(No.2 Xuyuan Road, Fuzhou, Fujian, PRC Post Code:350116) Contact Us:0591-22865326
Copyright:FZU Library Technical Support:Beijing Aegean Software Co., Ltd. 闽ICP备05005463号-1