A Double Auction Mechanism for Mobile Crowd Sensing with Data Reuse

08/28/2017
by   Xiaoru Zhang, et al.
0

Mobile Crowd Sensing (MCS) is a new paradigm of sensing, which can achieve a flexible and scalable sensing coverage with a low deployment cost, by employing mobile users/devices to perform sensing tasks. In this work, we propose a novel MCS framework with data reuse, where multiple tasks with common data requirement can share (reuse) the common data with each other through an MCS platform. We study the optimal assignment of mobile users and tasks (with data reuse) systematically, under both information symmetry and asymmetry, depending on whether the user cost and the task valuation are public information. In the former case, we formulate the assignment problem as a generalized Knapsack problem and solve the problem by using classic algorithms. In the latter case, we propose a truthful and optimal double auction mechanism, built upon the above Knapsack assignment problem, to elicit the private information of both users and tasks and meanwhile achieve the same optimal assignment as under information symmetry. Simulation results show by allowing data reuse among tasks, the social welfare can be increased up to 100 380 without data reuse. We further show that the proposed double auction is not budget balance for the auctioneer, mainly due to the data reuse among tasks. To this end, we further introduce a reserve price into the double auction (for each data item) to achieve a desired tradeoff between the budget balance and the social efficiency.

READ FULL TEXT

page 1

page 7

research
10/25/2018

COUSTIC: Combinatorial Double auction for Task Assignment in Device-to-Device Clouds

With the emerging technologies of Internet of Things (IOTs), the capabil...
research
04/16/2018

Efficient Auctions With Common Values

Consider the problem of allocating goods to buyers through an auction. A...
research
10/08/2018

The equivalence between two classic algorithms for the assignment problem

We give a detailed review of two algorithms that solve the minimization ...
research
10/18/2018

Differentially Private Double Spectrum Auction with Approximate Social Welfare Maximization

Spectrum auction is an effective approach to improving spectrum utilizat...
research
05/30/2019

Maximizing Clearance Rate by Penalizing Redundant Task Assignment in Mobile Crowdsensing Auctions

This research is concerned with the effectiveness of auctions-based task...
research
11/02/2022

Holographic-Type Communication for Digital Twin: A Learning-based Auction Approach

Digital Twin (DT) technologies, which aim to build digital replicas of p...
research
05/22/2018

Social-Network-Assisted Worker Recruitment in Mobile Crowd Sensing

Worker recruitment is a crucial research problem in Mobile Crowd Sensing...

Please sign up or login with your details

Forgot password? Click here to reset