Location-Aware Crowdsensing: Dynamic Task Assignment and Truth Inference

被引:47
作者
Wang, Xiong [1 ]
Jia, Riheng [2 ]
Tian, Xiaohua [1 ]
Gan, Xiaoying [1 ,3 ]
Fu, Luoyi [1 ]
Wang, Xinbing [1 ]
机构
[1] Shanghai Jiao Tong Univ, Sch Elect Informat & Elect Engn, Shanghai 200240, Peoples R China
[2] Zhejiang Normal Univ, Dept Comp Sci & Engn, Jinhua 321004, Zhejiang, Peoples R China
[3] Southeast Univ, Natl Mobile Commun Res Lab, Nanjing 211189, Peoples R China
基金
国家重点研发计划;
关键词
Task analysis; Sensors; Optimization; Location awareness; Resource management; Mobile computing; Gallium nitride; Crowdsensing; dynamic task assignment; truth inference; Lyapunov optimization; DISCOVERY; DIVERSITY;
D O I
10.1109/TMC.2018.2878821
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Crowdsensing paradigm facilitates a wide range of data collection, where great efforts have been made to address its fundamental issues of matching workers to their assigned tasks and processing the collected data. In this paper, we reexamine these issues by considering the spatio-temporal worker mobility and task arrivals, which more fit the actual situation. Specifically, we study the location-aware and location diversity based dynamic crowdsensing system, where workers move over time and tasks arrive stochastically. We first exploit offline crowdsensing by proposing a combinatorial algorithm, for efficiently distributing tasks to workers. After that, we mainly study the online crowdsensing, and further consider an indispensable aspect of worker's fair allocation. Apart from the stochastic characteristics and discontinuous coverage, the non-linear expectation is incurred as a new challenge concerning fairness issue. Based on Lyapunov optimization with perturbation parameters, we propose online control policy to overcome those challenges. Hereby, we can maintain system stability and achieve a time average sensing utility arbitrarily close to the optimum. Finally, we propose an optimization framework to aggregate the sensing data which can estimate worker expertise and task truth simultaneously. Performance evaluations on real and synthetic data set validate the proposed algorithm, where 80 percent gain of fairness is achieved at the expense of 12 percent loss of sensing value on average.
引用
收藏
页码:362 / 375
页数:14
相关论文
共 34 条
[1]  
[Anonymous], 2012, P 20 INT C ADV GEOGR
[2]  
[Anonymous], [No title captured]
[3]  
[Anonymous], 2009, CRAWDAD dataset ncsu/mobilitymodels
[4]  
Bertsekas D., 1999, NONLINEAR PROGRAMMIN
[5]   Reliable Diversity-Based Spatial Crowdsourcing by Moving Workers [J].
Cheng, Peng ;
Lian, Xiang ;
Chen, Zhao ;
Fu, Rui ;
Chen, Lei ;
Han, Jinsong ;
Zhao, Jizhong .
PROCEEDINGS OF THE VLDB ENDOWMENT, 2015, 8 (10) :1022-1033
[6]   An efficient approximation for the Generalized Assignment Problem [J].
Cohen, Reuven ;
Katzir, Liran ;
Raz, Danny .
INFORMATION PROCESSING LETTERS, 2006, 100 (04) :162-166
[7]  
Cranshaw J, 2010, UBICOMP 2010: PROCEEDINGS OF THE 2010 ACM CONFERENCE ON UBIQUITOUS COMPUTING, P119
[8]  
Elhamshary M., 2016, P 14 ANN INT C MOB S, DOI DOI 10.1145/2906388.2906395
[9]  
Feng ZN, 2014, IEEE INFOCOM SER, P1231, DOI 10.1109/INFOCOM.2014.6848055
[10]   MAP: Multiauctioneer Progressive Auction for Dynamic Spectrum Access [J].
Gao, Lin ;
Xu, Youyun ;
Wang, Xinbing .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2011, 10 (08) :1144-1161