Scalable Mobile Crowdsensing via Peer-to-Peer Data Sharing

TL;DR

This paper introduces a peer-to-peer mobile crowdsensing architecture that reduces server costs by enabling local data processing and sharing among users, incentivized through a quality-aware data market, with proven game-theoretic equilibrium and improved social welfare.

Contribution

It proposes a novel P2P-based MCS system with a market mechanism, analyzes user behavior via game theory, and develops algorithms for equilibrium convergence.

Findings

P2P data sharing significantly reduces server costs.

The system achieves a unique game equilibrium.

Social welfare improves with high transmission costs and low trading prices.

Abstract

Mobile crowdsensing (MCS) is a new paradigm of sensing by taking advantage of the rich embedded sensors of mobile user devices. However, the traditional server-client MCS architecture often suffers from the high operational cost on the centralized server (e.g., for storing and processing massive data), hence the poor scalability. Peer-to-peer (P2P) data sharing can effectively reduce the server's cost by leveraging the user devices' computation and storage resources. In this work, we propose a novel P2P-based MCS architecture, where the sensing data is saved and processed in user devices locally and shared among users in a P2P manner. To provide necessary incentives for users in such a system, we propose a quality-aware data sharing market, where the users who sense data can sell data to others who request data but not want to sense the data by themselves. We analyze the user behavior dynamics from the game-theoretic perspective, and characterize the existence and uniqueness of the game equilibrium. We further propose best response iterative algorithms to reach the equilibrium with provable convergence. Our simulations show that the P2P data sharing can greatly improve the social welfare, especially in the model with a high transmission cost and a low trading price.