TY - GEN
T1 - From social trust assisted reciprocity (STAR) to utility-optimal mobile crowdsensing
AU - Gong, Xiaowen
AU - Chen, Xu
AU - Zhang, Junshan
AU - Poor, H. Vincent
N1 - Publisher Copyright:
© 2014 IEEE.
PY - 2014/2/5
Y1 - 2014/2/5
N2 - Crowdsensing has been widely recognized as a promising paradigm for numerous applications in mobile networks. To realize the full benefit of crowdsensing, one fundamental challenge is to incentivize users to participate. In this paper, we leverage social trust assisted reciprocity (STAR), a synergistic marriage of social trust and reciprocity, to develop an incentive mechanism in order to stimulate users' participation. We investigate thoroughly the efficacy of STAR for satisfying users' sensing requests, for a given social tie structure among users. Specifically, we first show that all requests can be satisfied if and only if sufficient social credit can be transferred from users who request more sensing services than what they can provide to users who can provide more than what they request. Then we investigate utility maximization for sensing services, and show that it boils down to maximizing the utility of a circulation flow in the combined graph of the social graph and request graph. Accordingly, we develop an algorithm that iteratively cancels cycles of positive weights in the residual graph, and thereby finds the optimal solution efficiently.
AB - Crowdsensing has been widely recognized as a promising paradigm for numerous applications in mobile networks. To realize the full benefit of crowdsensing, one fundamental challenge is to incentivize users to participate. In this paper, we leverage social trust assisted reciprocity (STAR), a synergistic marriage of social trust and reciprocity, to develop an incentive mechanism in order to stimulate users' participation. We investigate thoroughly the efficacy of STAR for satisfying users' sensing requests, for a given social tie structure among users. Specifically, we first show that all requests can be satisfied if and only if sufficient social credit can be transferred from users who request more sensing services than what they can provide to users who can provide more than what they request. Then we investigate utility maximization for sensing services, and show that it boils down to maximizing the utility of a circulation flow in the combined graph of the social graph and request graph. Accordingly, we develop an algorithm that iteratively cancels cycles of positive weights in the residual graph, and thereby finds the optimal solution efficiently.
UR - http://www.scopus.com/inward/record.url?scp=84949926533&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84949926533&partnerID=8YFLogxK
U2 - 10.1109/GlobalSIP.2014.7032217
DO - 10.1109/GlobalSIP.2014.7032217
M3 - Conference contribution
AN - SCOPUS:84949926533
T3 - 2014 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2014
SP - 742
EP - 745
BT - 2014 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2014
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2014 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2014
Y2 - 3 December 2014 through 5 December 2014
ER -