Please wait a minute...
Front. Inform. Technol. Electron. Eng.  2013, Vol. 14 Issue (5): 356-373    DOI: 10.1631/jzus.C1200267
    
EDA: an enhanced dual-active algorithm for location privacy preservation in mobile P2P networks
Yan-zhe Che, Kevin Chiew, Xiao-yan Hong, Qiang Yang, Qin-ming He
College of Computer Science and Technology, Zhejiang University, Hangzhou 310027, China; School of Engineering, Tan Tao University, Duc Hoa, Long An Province, Vietnam; Department of Computer Science, University of Alabama, Tuscaloosa, AL 35487, USA; College of Electrical Engineering, Zhejiang University, Hangzhou 310027, China
Download:   PDF(0KB)
Export: BibTeX | EndNote (RIS)      

Abstract  Various solutions have been proposed to enable mobile users to access location-based services while preserving their location privacy. Some of these solutions are based on a centralized architecture with the participation of a trustworthy third party, whereas some other approaches are based on a mobile peer-to-peer (P2P) architecture. The former approaches suffer from the scalability problem when networks grow large, while the latter have to endure either low anonymization success rates or high communication overheads. To address these issues, this paper deals with an enhanced dual-active spatial cloaking algorithm (EDA) for preserving location privacy in mobile P2P networks. The proposed EDA allows mobile users to collect and actively disseminate their location information to other users. Moreover, to deal with the challenging characteristics of mobile P2P networks, e.g., constrained network resources and user mobility, EDA enables users (1) to perform a negotiation process to minimize the number of duplicate locations to be shared so as to significantly reduce the communication overhead among users, (2) to predict user locations based on the latest available information so as to eliminate the inaccuracy problem introduced by using some out-of-date locations, and (3) to use a latest-record-highest-priority (LRHP) strategy to reduce the probability of broadcasting fewer useful locations. Extensive simulations are conducted for a range of P2P network scenarios to evaluate the performance of EDA in comparison with the existing solutions. Experimental results demonstrate that the proposed EDA can improve the performance in terms of anonymity and service time with minimized communication overhead.

Key wordsLocation-based service      Privacy preservation      Spatial cloaking      Mobile peer-to-peer networks     
Received: 20 September 2012      Published: 30 April 2013
CLC:  TP393  
Cite this article:

Yan-zhe Che, Kevin Chiew, Xiao-yan Hong, Qiang Yang, Qin-ming He. EDA: an enhanced dual-active algorithm for location privacy preservation in mobile P2P networks. Front. Inform. Technol. Electron. Eng., 2013, 14(5): 356-373.

URL:

http://www.zjujournals.com/xueshu/fitee/10.1631/jzus.C1200267     OR     http://www.zjujournals.com/xueshu/fitee/Y2013/V14/I5/356


EDA: an enhanced dual-active algorithm for location privacy preservation in mobile P2P networks

Various solutions have been proposed to enable mobile users to access location-based services while preserving their location privacy. Some of these solutions are based on a centralized architecture with the participation of a trustworthy third party, whereas some other approaches are based on a mobile peer-to-peer (P2P) architecture. The former approaches suffer from the scalability problem when networks grow large, while the latter have to endure either low anonymization success rates or high communication overheads. To address these issues, this paper deals with an enhanced dual-active spatial cloaking algorithm (EDA) for preserving location privacy in mobile P2P networks. The proposed EDA allows mobile users to collect and actively disseminate their location information to other users. Moreover, to deal with the challenging characteristics of mobile P2P networks, e.g., constrained network resources and user mobility, EDA enables users (1) to perform a negotiation process to minimize the number of duplicate locations to be shared so as to significantly reduce the communication overhead among users, (2) to predict user locations based on the latest available information so as to eliminate the inaccuracy problem introduced by using some out-of-date locations, and (3) to use a latest-record-highest-priority (LRHP) strategy to reduce the probability of broadcasting fewer useful locations. Extensive simulations are conducted for a range of P2P network scenarios to evaluate the performance of EDA in comparison with the existing solutions. Experimental results demonstrate that the proposed EDA can improve the performance in terms of anonymity and service time with minimized communication overhead.

关键词: Location-based service,  Privacy preservation,  Spatial cloaking,  Mobile peer-to-peer networks 
[1] Mei-juan Jia, Hui-qiang Wang, Jun-yu Lin, Guang-sheng Feng, Hai-tao Yu. DGTM: a dynamic grouping based trust model for mobile peer-to-peer networks[J]. Front. Inform. Technol. Electron. Eng., 2017, 18(4): 559-569.
[2] Dong-wei Xu, Yong-dong Wang, Li-min Jia, Yong Qin, Hong-hui Dong. Real-time road traffic state prediction based on ARIMA and Kalman filter[J]. Front. Inform. Technol. Electron. Eng., 2017, 18(2): 287-302.
[3] Shuo Wang, Jiao Zhang, Tao Huang, Jiang Liu, Yun-jie Liu, F. Richard Yu. FlowTrace: measuring round-trip time and tracing path in software-defined networking with low communication overhead[J]. Front. Inform. Technol. Electron. Eng., 2017, 18(2): 206-219.
[4] Reza Sookhtsaraei, Javad Artin, Ali Ghorbani, Ahmad Faraahi, Hadi Adineh. A locality-based replication manager for data cloud[J]. Front. Inform. Technol. Electron. Eng., 2016, 17(12): 1275-1286.
[5] Jun-feng Xie, Ren-chao Xie, Tao Huang, Jiang Liu, F. Richard Yu, Yun-jie Liu. Caching resource sharing in radio access networks: a game theoretic approach[J]. Front. Inform. Technol. Electron. Eng., 2016, 17(12): 1253-1265.
[6] Da-fang Zhang, Dan Chen, Yan-biao Li, Kun Xie, Tong Shen. A splitting-after-merging approach to multi-FIB compression and fast refactoring in virtual routers[J]. Front. Inform. Technol. Electron. Eng., 2016, 17(12): 1266-1274.
[7] Gui-lin CAI, Bao-sheng WANG, Wei HU, Tian-zuo WANG. Moving target defense: state of the art and characteristics[J]. Front. Inform. Technol. Electron. Eng., 2016, 17(11): 1122-1153.
[8] Guang-jia Song, Zhen-zhou Ji. Anonymous-address-resolution model[J]. Front. Inform. Technol. Electron. Eng., 2016, 17(10): 1044-1055.
[9] Adel Khosravi, Yousef Seifi Kavian. Autonomous fault-diagnosis and decision-making algorithm for determining faulty nodes in distributed wireless networks[J]. Front. Inform. Technol. Electron. Eng., 2016, 17(9): 885-896.
[10] Vignesh Renganathan Raja, Chung-Horng Lung, Abhishek Pandey, Guo-ming Wei, Anand Srinivasan. A subtree-based approach to failure detection and protection for multicast in SDN[J]. Front. Inform. Technol. Electron. Eng., 2016, 17(7): 682-700.
[11] Huan-zhao Wang, Peng Zhang, Lei Xiong, Xin Liu, Cheng-chen Hu. A secure and high-performance multi-controller architecture for software-defined networking[J]. Front. Inform. Technol. Electron. Eng., 2016, 17(7): 634-646.
[12] Peng Xiao, Zhi-yang Li, Song Guo, Heng Qi, Wen-yu Qu, Hai-sheng Yu. A K self-adaptive SDN controller placement for wide area networks[J]. Front. Inform. Technol. Electron. Eng., 2016, 17(7): 620-633.
[13] Mingjie Feng, Shiwen Mao, Tao Jiang. Enhancing the performance of future wireless networks with software-defined networking[J]. Front. Inform. Technol. Electron. Eng., 2016, 17(7): 606-619.
[14] Gang Xiong, Yu-xiang Hu, Le Tian, Ju-long Lan, Jun-fei Li, Qiao Zhou. A virtual service placement approach based on improved quantum genetic algorithm[J]. Front. Inform. Technol. Electron. Eng., 2016, 17(7): 661-671.
[15] En-zhong Yang, Lin-kai Zhang, Zhen Yao, Jian Yang. A video conferencing system based on SDN-enabled SVC multicast[J]. Front. Inform. Technol. Electron. Eng., 2016, 17(7): 672-681.