A distributed algorithm for maximizing utility of data collection in a crowd sensing system
Mobile crowd sensing harnesses the data sensing capability of individual smartphones, underpinning a variety of valuable knowledge discovery, environment monitoring, and decision-making applications. It is a central issue for a mobile crowd sensing system to maximize the utility of sensing data coll...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2016-09-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1177/1550147716668083 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Mobile crowd sensing harnesses the data sensing capability of individual smartphones, underpinning a variety of valuable knowledge discovery, environment monitoring, and decision-making applications. It is a central issue for a mobile crowd sensing system to maximize the utility of sensing data collection at a given cost of resource consumption at each smartphone. However, it is particularly challenging. On the one hand, the utility of sensing data from a smartphone is usually dependent on its context which is random and varies over time. On the other hand, because of the marginal effect, the sensing decision of a smartphone is also dependent on decisions of other smartphones. Little work has explored the utility maximization problem of sensing data collection. This article proposes a distributed algorithm for maximizing the utility of sensing data collection when the smartphone cost is constrained. The design of the algorithm is inspired by stochastic network optimization technique and distributed correlated scheduling. It does not require any prior knowledge of smartphone contexts in the future, and hence sensing decisions can be made by individual smartphone. Rigorous theoretical analysis shows that the proposed algorithm can achieve a time average utility that is within O (1/ V ) of the theoretical optimum. |
|---|---|
| ISSN: | 1550-1477 |