From Social Group Utility Maximization to Personalized Location Privacy in Mobile Networks

被引:32
作者
Gong, Xiaowen [1 ]
Chen, Xu [4 ,5 ]
Xing, Kai [6 ]
Shin, Dong-Hoon [2 ]
Zhang, Mengyuan [3 ]
Zhang, Junshan [3 ]
机构
[1] Auburn Univ, Dept Elect & Comp Engn, Auburn, AL 36849 USA
[2] AT&T Labs, San Ramon, CA 94583 USA
[3] Arizona State Univ, Sch Elect Comp & Energy Engn, Tempe, AZ 85287 USA
[4] Sun Yat Sen Univ, Sch Data & Comp Sci, Guangzhou 510275, Guangdong, Peoples R China
[5] Minist Educ, Key Lab Machine Intelligence & Adv Comp, Guangzhou 510275, Guangdong, Peoples R China
[6] Univ Sci & Technol China, Sch Comp Sci & Technol, Hefei 230027, Peoples R China
基金
美国国家科学基金会; 中国国家自然科学基金;
关键词
Personalized location privacy; pseudonym change game; social group utility maximization; K-ANONYMITY; GAME;
D O I
10.1109/TNET.2017.2653102
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
With increasing popularity of location-based services (LBSs), there have also been growing concerns for location privacy. To protect location privacy in an LBS, mobile users in physical proximity can work in concert to collectively change their pseudonyms, in order to hide spatial-temporal correlation in their location traces. In this paper, we leverage mobile users' social tie structure to motivate them to participate in pseudonym change. Drawing on a social group utility maximization framework, we cast users' decision making of whether to change pseudonyms as a socially aware pseudonym change game (SA-PCG). The SA-PCG further assumes a general anonymity model that allows a user to have its specific anonymity set for personalized location privacy. For the SA-PCG, we show that there exists a socially aware Nash equilibrium (SNE), and quantify the system efficiency of SNEs with respect to the optimal social welfare. Then, we develop a greedy algorithm that myopically determines users' strategies, based on the social group utility derived from only the users whose strategies have already been determined. We show that this algorithm efficiently finds an SNE that enjoys desirable properties: 1) it is socially aware coalition-proof, and thus is also Pareto-optimal; 2) it achieves higher social welfare than any SNE for the socially oblivious pseudonym change game. We further quantify the system efficiency of this SNE with respect to the optimal social welfare. We also show that this SNE can be achieved in a distributed manner. Numerical results using real data corroborate that social welfare can be significantly improved by exploiting social ties.
引用
收藏
页码:1703 / 1716
页数:14
相关论文
共 25 条
[1]  
[Anonymous], 2014, DISCRETE DYN NAT SOC, DOI [DOI 10.1155/2014/964654, DOI 10.1109/CISS.2014.6814138]
[2]  
[Anonymous], 2013, P 12 INT ACM WORKSHO
[3]   Location privacy in pervasive computing [J].
Beresford, AR ;
Stajano, F .
IEEE PERVASIVE COMPUTING, 2003, 2 (01) :46-55
[4]   From Technological Networks to Social Networks [J].
Chen, Kwang-Cheng ;
Chiang, Mung ;
Poor, H. Vincent .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2013, 31 (09) :548-572
[5]  
Chen XQ, 2013, CHIN CONTR CONF, P187
[6]  
Chen X, 2014, IEEE INFOCOM SER, P1959, DOI 10.1109/INFOCOM.2014.6848136
[7]   Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks [J].
Costa, Paolo ;
Mascolo, Cecilia ;
Musolesi, Mirco ;
Picco, Gian Pietro .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2008, 26 (05) :748-760
[8]  
ERDOS P, 1960, B INT STATIST INST, V38, P343
[9]  
Freudiger J, 2009, CCS'09: PROCEEDINGS OF THE 16TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, P324
[10]  
Gao W, 2009, MOBIHOC'09 PROCEEDINGS OF THE TENTH ACM INTERNATIONAL SYMPOSIUM ON MOBILE AD HOC NETWORKING AND COMPUTING, P299, DOI 10.1145/1530748.1530790