Abstract

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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call