Crowdsourcing to Smartphones: Incentive Mechanism Design for Mobile Phone Sensing
Dejun Yang, Guoliang (Larry) Xue, Xi Fang and Jian Tang
Mechanism Design for Mobile Phone Sensing Dejun Yang, Guoliang - - PowerPoint PPT Presentation
Crowdsourcing to Smartphones: Incentive Mechanism Design for Mobile Phone Sensing Dejun Yang, Guoliang (Larry) Xue, Xi Fang and Jian Tang Arizona State University Syracuse University Global Smartphone Users >2B 1.08B 500M 2010 2012
Dejun Yang, Guoliang (Larry) Xue, Xi Fang and Jian Tang
Date Source: IDC http://www.idc.com/getdoc.jsp?containerId=233553, Go-Gulf http://www.go-gulf.com/blog/smartphone Image source: http://www.foxshop.seeon.com/images/smartphone_shadow-group.jpg
2/36
Image source: http://www.mynewplace.com/blog/files/2011/05/smart-phone-user.jpg, http://serc.carleton.edu/images/sp/library/google_earth/google_maps_new_york.v2.jpg, http://media.treehugger.com/assets/images/2011/10/nextfest-peir-001.jpg
3/36
CPU Memory Power
4/36
incentive design
auction
considered
price incentive mechanism
J-S. Lee and B. Hoh; “Sell Your Experiences: Market Mechanism based Participation Incentive for Participatory Sensing” in PERCOM 2010
J-S. Lee
5/36
Energy Saving MAUI (MobiSys 2010) Application Development PRISM (MobiSys 2010) Privacy PEPSI (WiSec 2011) TP (HotNets 2011)
6/36
7/36
8/36
𝑘∈𝑉
𝑗∈𝑉
9/36
𝑘 > 0.
1, 𝑐1 , …, Γ𝑜, 𝑐𝑜
𝑗∈𝑇
𝑘 𝜐𝑘∈∪𝑗∈𝑇Γ𝑗
10/36
Sensing Task Desc. Sensing Plan Sensed Data Smartphone Users Platform
11/36
12/36
Leader Followers
13/36
Leader Followers
𝑢𝑗 𝑢𝑘
𝑘∈𝑉
14/36
Sort users according to their unit costs, 𝜆1 ≤ 𝜆2 ≤ ⋯ ≤ 𝜆𝑜. 𝑇 ← {1, 2}, 𝑗 ← 3; while 𝑗 ≤ 𝑜 𝑏𝑜𝑒 𝜆𝑗 <
𝜆𝑗+ 𝜆𝑘
𝑘∈𝑇
|𝑇|
𝑇 ← 𝑇 ∪ 𝑗 , 𝑗 ← 𝑗 + 1; end for each 𝑗 ∈ 𝑉 if 𝑗 ∈ 𝑇 then 𝑢𝑗
𝑜𝑓 = 𝑇 −1 𝑆 𝜆𝑘
𝑘∈𝑇
1 −
𝑇 −1 𝜆𝑗 𝜆𝑘
𝑘∈𝑇
; else 𝑢𝑗
𝑜𝑓 = 0;
return 𝑢1
𝑜𝑓, 𝑢2 𝑜𝑓, … , 𝑢𝑜 𝑜𝑓
𝑜𝑓, 𝑢2 𝑜𝑓, … , 𝑢𝑜 𝑜𝑓 is
Leader Followers
15/36
𝑣 0 = 𝜇 log 1 + log 1 + 𝑌𝑗𝑆
𝑗∈𝑇
− 𝑆 where 𝑌𝑗 =
𝑇 −1 𝜆𝑘
𝑘∈𝑇
1 −
𝑇 −1 𝜆𝑗 𝜆𝑘
𝑘∈𝑇
Leader Followers
𝑣 0 = 𝜇 log 1 + log 1 + 𝑢𝑗
𝑗∈𝑉
− 𝑆
16/36
17/36
𝑇 ← 𝑗 , where 𝑗 ← arg max
i∈𝑉 𝑔
𝑗 ; ⋇while ∃𝑗 ∈ 𝑉 ∖ 𝑇 such that 𝑔 𝑇 ∪ 𝑗 > 1 +
𝜗 𝑜2 𝑔 𝑇
𝑇 ← 𝑇 ∪ {𝑗}; if ∃𝑗 ∈ 𝑇 such that 𝑔 𝑇 ∖ 𝑗 > 1 +
𝜗 𝑜2 𝑔 𝑇
𝑇 ← 𝑇 ∖ {𝑗}; go to ⋇; if 𝑔 𝑉 ∖ 𝑇 > 𝑔 𝑇 then 𝑇 ← 𝑉 ∖ 𝑇; for each 𝑗 ∈ 𝑉 if 𝑗 ∈ 𝑇 then 𝑞𝑗 ← 𝑐𝑗; else 𝑞𝑗 ← 0; return (𝑇, 𝑞)
𝑔 𝑇 = 𝑣 0 𝑇 + 𝑐𝑗
𝑗∈𝑉
is 𝑡𝑣𝑐𝑛𝑝𝑒𝑣𝑚𝑏𝑠 and nonnegative
18/36
19/36
𝑘∈𝑉 𝑤𝑘 𝑇 − 𝑐 𝑘 ;
𝑘∈𝑉∖𝑇 𝑤𝑘 𝑇 − 𝑐 𝑘 ;
20/36
𝑞𝑗 ← 0 for all 𝑗 ∈ 𝑉; for each 𝑗 ∈ 𝑇 𝑉′ ← 𝑉 ∖ {𝑗}, 𝑈 ← ∅; repeat 𝑗𝑘 ← arg max
j∈𝑉′∖𝑈(𝑤𝑘 𝑈 − 𝑐 𝑘);
𝑞𝑗 ← max 𝑞𝑗, min 𝑤𝑗 𝑈 − 𝑤𝑗𝑘 𝑈 − 𝑐𝑗𝑘 , 𝑤𝑗 𝑈 ; 𝑈 ← 𝑈 ∪ {𝑗𝑘}; until 𝑐𝑗𝑘 ≥ 𝑤𝑗𝑘 or 𝑈 = 𝑉′; if 𝑐𝑗𝑘 < 𝑤𝑗𝑘 then 𝑞𝑗 ← max 𝑞𝑗, 𝑤𝑗 𝑈 ;
21/36
𝑇 = ∅: 𝑤1 ∅ − 𝑐1 = 𝑤 ∅ ∪ 1 − 𝑤 ∅ − 𝑐1 = 19, 𝑤2 ∅ − 𝑐2 = 18, 𝑤3 ∅ − 𝑐2 = 17 𝑤4 ∅ − 𝑐4 = 1. 𝑇 = {1}: 𝑤2 1 − 𝑐2 = 𝑤 1 ∪ {2} − 𝑤 1 − 𝑐2 = 2, 𝑤3 1 − 𝑐3 = 3, 𝑤4 1 − 𝑐4 = −5. 𝑇 = {1,3}: 𝑤2 1,3 − 𝑐2 = 𝑤 1,3 ∪ {2} − 𝑤 1,3 − 𝑐2 = 2, 𝑤4 1 − 𝑐4 = −5. 𝑇 = {1,3,2}: 𝑤4 1,3,2 − 𝑐4 = −5. Winner Selection:
22/36
𝑞1: Winners are {2,3}. 𝑤1 ∅ − 𝑤2 ∅ − 𝑐2 = 9, 𝑤1 {2} − 𝑤3 2 − 𝑐3 = 0, 𝑤1 2,3 = 3. 𝑞1 = 9 ≥8. Payment Determination: 𝑞2: Winners are {1,3}. 𝑤2 ∅ − 𝑤1 ∅ − 𝑐1 = 5, 𝑤2 {1} − 𝑤3 1 − 𝑐3 = 5, 𝑤2 1,3 = 8. 𝑞2 = 8 ≥6. 𝑞3: Winners are {1,2}. 𝑤3 ∅ − 𝑤1 ∅ − 𝑐1 = 4, 𝑤3 {1} − 𝑤2 1 − 𝑐2 = 7, 𝑤3 1,2 = 9. 𝑞3 = 9 ≥6.
23/36
24/36
25/36
26/36
Running Time
27/36
Number of Participating Users
28/36
Platform Utility
29/36
User Utility
30/36
31/36
Running Time
32/36
Platform Utility
33/36
𝑑333 = 3 𝑑851 = 18 Verification of Truthfulness
34/36
35/36
computed efficiently
and truthfulness
36/36