Research On The Problems Of Location Privacy Protection In Mobile Social Network

With the popularity of mobile devices, the development of electronic information technology, mobile positioning technology and data mining techno logy, as well as the demand for location-based service (LBS), the application of location service is more and more extensive. The application of location services to social networks has spawned mobile social networks, enabling users to discover potential friends around them, and thus many location-based applications have been developed, but trigger the risk of location privacy disclosure..Therefore, the privacy protection technology research of location has been widespread. Domestic and foreign research scholars have proposed a lot of location-based privacy protection technology. Location privacy protection is not only including protecting privacy of a single location,but also the trajectory of the query request by the user at different locations in the moving state. Aiming at the problem of single location protection and track privacy protection in mobile social network, this paper makes the following research and discussion:(1) This paper proposes a location privacy protection algorithm based on anonymous region re-split. Anonymous regions are divided into several decentralized sub-anonymous regions, and replace the sub-anonymous area with the sub-region center position to request the LBS to server. As for the anonymous area that split, if the sum of anonymous area is greater than the minimum area that user defined,anonymous areas is re-split; if there are redundant users, they will be distributed in the sub-anonymous area in accordance with the nearest neighbor rule, so that the user numbers in each sub-anonymous regional is similar, so the accuracy of the query is similar. In this paper, the entropy-based evaluation method is used to evaluate the algorithm.Finally, the experimental results show that the method proposed in this paper can effectively reduce the area of anonymous area and greatly reduce the traffic(2) This paper presents a privacy protection algorithm based on R-constraint dummy trajectory. By constraining the generation range R of the dummy location, the generated dummy locations are within a certain range near the real location. Dummy trajectories that similar to the real trajectory are generated to reduce the probability of the attacker to identify the real trajectory by the constraint of single position exposure risk and trajectory exposure risk, thereby improving the trajectory privacy protection. Finally, the simulation results show that the R-constraint dummy trajectory method proposed in this paper can improve the probability of generating similar dummy trajectories.