research-article

Joint Differentially Private Gale–Shapley Mechanisms for Location Privacy Protection in Mobile Traffic Offloading Systems

Authors:

Sheng ZhongAuthors Info & Claims

IEEE Journal on Selected Areas in Communications, Volume 34, Issue 10

Pages 2738 - 2749

https://doi.org/10.1109/JSAC.2016.2605798

Published: 01 October 2016 Publication History

Abstract

Being an important application of spectrum sharing in cellular networks, mobile traffic offloading, which advocates third-party owners of network resource on unlicensed/licensed spectrum to share their spectrum and provide data offloading services, is considered a promising solution to severe spectrum shortage faced by cellular network service providers. In this paper, we consider a general mobile traffic offloading system that adopts the widely used Gale–Shapley algorithm to optimize its mobile phone users (MUs) to offloading stations allocation plan. We notice that without careful protection, such a system could cause serious threat to MUs’ location privacy, and thus design effective countermeasures based on the powerful state-of-the-art differential privacy concept. Specifically, we have proposed two joint differentially private Gale–Shapley mechanisms with strong privacy protections for mobile traffic offloading systems. The first mechanism is able to protect each user’s location privacy even when all other users collude against this user assuming the system administrator can be trusted. The second mechanism is able to achieve the same privacy guarantee against colluding users, and moreover against an untrusted semi-honest system administrator. We perform extensive experiments to evaluate our mechanisms, and the results show that our mechanisms have good efficiency, accuracy, and privacy protection.

References

[1]

W. Saad, Z. Han, R. Zheng, M. Debbah, and H. V. Poor, “ A college admissions game for uplink user association in wireless small cell networks,” in Proc. IEEE Conf. Comput. Commun. (INFOCOM), Toronto, ON, Canada, Apr./May 2014, pp. 1096–1104.

[2]

W. Wang, X. Wu, L. Xie, and S. Lu, “ Femto-matching: Efficient traffic offloading in heterogeneous cellular networks,” in Proc. IEEE Conf. Comput. Commun. (INFOCOM), Hong Kong, Apr./May 2015, pp. 325–333.

[3]

D. Gale and L. S. Shapley, “ College admissions and the stability of marriage,” Amer. Math. Monthly, vol. Volume 69, no. Issue 1, pp. 9–15, 1962.

[4]

C. Dwork, F. McSherry, K. Nissim, and A. Smith, “<chapter-title>Calibrating noise to sensitivity in private data analysis</chapter-title>,” in Theory of Cryptography . Berlin, Germany: Springer, 2006, pp. 265–284.

Digital Library

[5]

F. McSherry and K. Talwar, “ Mechanism design via differential privacy,” in Proc. 48th Annu. IEEE Symp. Found. Comput. Sci. (FOCS), Oct. 2007, pp. 94–103.

Digital Library

[6]

J. Hsu, Z. Huang, A. Roth, T. Roughgarden, and Z. S. Wu, “ Private matchings and allocations,” in Proc. 46th Annu. ACM Symp. Theory Comput., 2014, pp. 21–30.

Digital Library

[7]

O. Goldreich, Foundations of Cryptography: Basic Applications . New York, NY, USA: Cambridge Univ. Press, vol. Volume 2 . 2009, pp. 619–625.

Digital Library

[8]

L. E. Dubins and D. A. Freedman, “ Machiavelli and the Gale–Shapley algorithm,” Amer. Math. Monthly, vol. Volume 88, no. Issue 7, pp. 485–494, 1981.

[9]

C. Dwork, “ Differential privacy,” in Proc. 33rd Int. Colloq. Automata, Lang. Program. II (ICALP), vol. Volume 4052 . Venice, Italy, Jul. 2006, pp. 1–12.

Digital Library

[10]

F. D. McSherry, “ Privacy integrated queries: An extensible platform for privacy-preserving data analysis,” in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2009, pp. 19–30.

Digital Library

[11]

M. Kearns, M. Pai, A. Roth, and J. Ullman, “ Mechanism design in large games: Incentives and privacy,” in Proc. 5th Conf. Innov. Theor. Comput. Sci., 2014, pp. 403–410.

Digital Library

[12]

F. McSherry and I. Mironov, “ Differentially private recommender systems: Building privacy into the net,” in Proc. 15th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2009, pp. 627–636.

Digital Library

[13]

C. Dwork, M. Naor, and S. Vadhan, “ The privacy of the analyst and the power of the state,” in Proc. IEEE 53rd Annu. Symp. Found. Comput. Sci. (FOCS), Oct. 2012, pp. 400–409.

Digital Library

[14]

T.-H. H. Chan, E. Shi, and D. Song, “ Private and continual release of statistics,” ACM Trans. Inf. Syst. Secur., vol. Volume 14, no. Issue 3, 2011, Art. no. .

Digital Library

[15]

C. Dwork, M. Naor, T. Pitassi, and G. N. Rothblum, “ Differential privacy under continual observation,” in Proc. 42nd ACM Symp. Theory Comput., 2010, pp. 715–724.

Digital Library

[16]

R. Zhu and K. G. Shin, “ Differentially private and strategy-proof spectrum auction with approximate revenue maximization,” in Proc. IEEE Conf. Comput. Commun. (INFOCOM), Apr./May 2015, pp. 918–926.

[17]

I. F. Akyildiz, W.-Y. Lee, M. C. Vuran, and S. Mohanty, “ A survey on spectrum management in cognitive radio networks,” IEEE Commun. Mag., vol. Volume 46, no. Issue 4, pp. 40–48, 2008.

Digital Library

[18]

Y. Zou, Y.-D. Yao, and B. Zheng, “ Cooperative relay techniques for cognitive radio systems: Spectrum sensing and secondary user transmissions,” IEEE Commun. Mag., vol. Volume 50, no. Issue 4, pp. 98–103, 2012.

[19]

G. Ding, J. Wang, Q. Wu, Y.-D. Yao, F. Song, and T. A. Tsiftsis, “ Cellular-base-station-assisted device-to-device communications in TV white space,” IEEE J. Sel. Areas Commun., vol. Volume 34, no. Issue 1, pp. 107–121, 2016.

[20]

B. Han, P. Hui, V. S. A. Kumar, M. V. Marathe, J. Shao, and A. Srinivasan, “ Mobile data offloading through opportunistic communications and social participation,” IEEE Trans. Mobile Comput., vol. Volume 11, no. Issue 5, pp. 821–834, 2012.

Digital Library

[21]

D. Xu and Q. Li, “ Effective capacity region and power allocation for two-way spectrum sharing cognitive radio networks,” Sci. China Inf. Sci., vol. Volume 58, no. Issue 6, pp. 1–10, 2015.

[22]

G. Zhang, P. Liu, K. Yang, Y. Du, and Y. Hu, “ Orthogonal resource sharing scheme for device-to-device communication overlaying cellular networks: A cooperative relay based approach,” Sci. China Inf. Sci., vol. Volume 58, no. Issue 10, pp. 1–9, 2015.

[23]

Q. Huang, Y. Tao, and F. Wu, “ Spring: A strategy-proof and privacy preserving spectrum auction mechanism,” in Proc. IEEE INFOCOM, Apr. 2013, pp. 827–835.

[24]

R. Zhu, Z. Li, F. Wu, K. Shin, and G. Chen, “ Differentially private spectrum auction with approximate revenue maximization,” in Proc. 15th ACM Int. Symp. Mobile Ad Hoc Netw. Comput., 2014, pp. 185–194.

Digital Library

[25]

C. Wu, Z. Wei, F. Wu, G. Chen, and S. Tang, “ Designing differentially private spectrum auction mechanisms,” Wireless Netw., vol. Volume 22, no. Issue 1, pp. 105–117, 2016.

Digital Library

[26]

W. Zhao and S. Wang, “ Cell planning for heterogeneous cellular networks,” in Proc. IEEE Wireless Commun. Netw. Conf. (WCNC), Apr. 2013, pp. 1032–1037.

[27]

E. Aryafar, A. Keshavarz-Haddad, M. Wang, and M. Chiang, “ Rat selection games in HetNets,” in Proc. IEEE INFOCOM, Apr. 2013, pp. 998–1006.

[28]

S. Singh and J. G. Andrews, “ Joint resource partitioning and offloading in heterogeneous cellular networks,” IEEE Trans. Wireless Commun., vol. Volume 13, no. Issue 2, pp. 888–901, 2014.

[29]

Y. Zhao, J. Wu, F. Li, and S. Lu, “ On maximizing the lifetime of wireless sensor networks using virtual backbone scheduling,” IEEE Trans. Parallel Distrib. Syst., vol. Volume 23, no. Issue 8, pp. 1528–1535, 2012.

Digital Library

[30]

X. Ma, M. Sheng, J. Li, and J. Xin, “ Interference migration using concurrent transmission for energy-efficient HetNets,” Sci. China Inf. Sci., vol. Volume 59, no. Issue 2, pp. 1–10, 2016.

[31]

B. Gedik and L. Liu, “ Protecting location privacy with personalized k-anonymity: Architecture and algorithms,” IEEE Trans. Mobile Comput., vol. Volume 7, no. Issue 1, pp. 1–18, 2008.

Digital Library

[32]

H. Kido, Y. Yanagisawa, and T. Satoh, “ Protection of location privacy using dummies for location-based services,” in Proc. 21st Int. Conf. Data Eng. Workshops, Apr. 2005, p. pp.1248.

Digital Library

[33]

P. Golle, “<chapter-title>A private stable matching algorithm</chapter-title>,” in Financial Cryptography and Data Security . Berlin, Germany: Springer, 2006, pp. 65–80.

Digital Library

[34]

M. Franklin, M. Gondree, and P. Mohassel, “<chapter-title>Improved efficiency for private stable matching</chapter-title>,” in Topics in Cryptology . Berlin, Germany: Springer, 2006, pp. 163–177.

Digital Library

Cited By

Wang LYang LZhang MZhang JCao ZWu Q(2022)Private Computing Offloading in Edge Cloud via Collaborative Online LearningWireless Communications & Mobile Computing10.1155/2022/74449162022Online publication date: 1-Jan-2022
https://dl.acm.org/doi/10.1155/2022/7444916
Li THe XJiang SLiu J(2022)A survey of privacy-preserving offloading methods in mobile-edge computingJournal of Network and Computer Applications10.1016/j.jnca.2022.103395203:COnline publication date: 1-Jul-2022
https://dl.acm.org/doi/10.1016/j.jnca.2022.103395
Zhang LZhu TXiong PZhou WYu P(2021)More than PrivacyACM Computing Surveys10.1145/346077154:7(1-37)Online publication date: 18-Jul-2021
https://dl.acm.org/doi/10.1145/3460771
Show More Cited By

Recommendations

A differentially private algorithm for location data release

The rise of mobile technologies in recent years has led to large volumes of location information, which are valuable resources for knowledge discovery such as travel patterns mining and traffic analysis. However, location dataset has been confronted ...
Resilient Privacy Protection for Location-Based Services through Decentralization

Location-Based Services (LBSs) provide valuable services, with convenient features for mobile users. However, the location and other information disclosed through each query to the LBS erodes user privacy. This is a concern especially because LBS ...
Differentially private regression analysis with dynamic privacy allocation
Abstract
In recent years, machine learning has reaped huge fruits in the domain of artificial intelligence. However, during the process of model training, machine learning models may be afflicted with the risk of disclosing sensitive ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image IEEE Journal on Selected Areas in Communications

IEEE Journal on Selected Areas in Communications Volume 34, Issue 10

October 2016

268 pages

ISSN:0733-8716

Issue’s Table of Contents

Copyright © 2016.

Publisher

IEEE Press

Publication History

Published: 01 October 2016

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 14 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Wang LYang LZhang MZhang JCao ZWu Q(2022)Private Computing Offloading in Edge Cloud via Collaborative Online LearningWireless Communications & Mobile Computing10.1155/2022/74449162022Online publication date: 1-Jan-2022
https://dl.acm.org/doi/10.1155/2022/7444916
Li THe XJiang SLiu J(2022)A survey of privacy-preserving offloading methods in mobile-edge computingJournal of Network and Computer Applications10.1016/j.jnca.2022.103395203:COnline publication date: 1-Jul-2022
https://dl.acm.org/doi/10.1016/j.jnca.2022.103395
Zhang LZhu TXiong PZhou WYu P(2021)More than PrivacyACM Computing Surveys10.1145/346077154:7(1-37)Online publication date: 18-Jul-2021
https://dl.acm.org/doi/10.1145/3460771
Tong WHua JZhong S(2017)A Jointly Differentially Private Scheduling Protocol for Ridesharing ServicesIEEE Transactions on Information Forensics and Security10.1109/TIFS.2017.270733412:10(2444-2456)Online publication date: 19-Jul-2017
https://dl.acm.org/doi/10.1109/TIFS.2017.2707334

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents