Incentivizing Crowdsourced Data for Indoor Localization

Incentivizing Crowdsourced Data
for Indoor Localization
Presented by ZHANG Qi
1
Indoor Positioning System(IPS)
Indoor location with a smart phone
2
RFID Tags
• RFID: Radio-frequency identification
3
RFID Tags
• RFID: Radio-frequency identification
4
RSS Vector
• Assume there are totally m RFID tags.
• Each position p has its received signal strength
(RSS) vector
x  (x1,x2 ,...,xm )
• We can incentivize crowd users determine RSS
vectors.
5
Collecting Data from the Crowd
• Users report positions, RSS vectors x , and
bids bi
• Select winner users according to their
contributions,  (x )
• Determine the payment for winners, such that
pi  bi,
p
i
B
6
Determine the Winners
• Let Winner Set, S, be an empty set
• Pick the next user ,w*,with maximal unit margin
w*  arg max
(x i )
bi
• If (1) and (2) hold, add w* to S
bw*  B   bi
(1)
iS
bw* 
• Else, exclude w*
 w*
   i   w*
B
(2)
iS
7
Determine the Winners
•   1 , the algorithm runs on a reduced budget,
B/ to ensure that  pi  B
bw*  B   bi
(1)
 w*
b 
   i   w*
(2)
iS
*
w
B
iS
8
Determine the Payment
• If pi = bi, the system is suspicious to malicious
bid
• Payment pi is the largest bid user i can declare
before being removed from the winners
(Myerson 1981)
pi  inf{ bi' : i   (bi' , bi )}
9
Determine the Payment
• S={1,…,i,…k}, winners selected from users W
S’={1,…,j,…k’}, winners selected from W’=W/ i
• bi(j) : bid that i can declare to replace j in S’
• pi = max { bi(j), j = 1,…,k’ }
bi(i)  bi
pi  inf{ bi' : i   (bi' , bi )}
10
A probability Vector
• View RSS vector as probability vector
x  (x1,x2 ,...,xm )
xi  [0,1]  Prbobility that tag i is detected
xi ~ Beta (a, b)
• Each position is characterized by on-off RFID
tags
11
User’s Contribution
• Degree of Certainty for a probability vector:
m
C   max(Pr( xi  0.5), Pr( xi  0.5))
i 1
max C s.t.  p  B
• User’s contribution:
i
(x)  C
12
Future Work
• In indoor environments, interference, multipath
propagation, and the presence of obstacles lead
to a complex spatial distribution of the RSS
• Probability vector model is thus far from enough..
13
Thanks for your time!!
Q&A
14