| In recent years,with the rapid development of smart mobile Internet technology,handheld mobile devices has gradually become a dependency on people's travel life,which uses relatively common is the location-based services(LBS).The users need to provide their location to the LBS provider in order to obtain the location service.Along with various services provided by the enterprises,the location service is convenient for the customers.However,if the location information is maliciously stolen or misused by some location service provider,the user's real location information is compromised,which can cause immeasurable losses.In order to protect the user location information is not disclosed,location privacy protection issues have been widely concerned by the academic community.Currently,most research methods focus on concealing research using k-anonymous,pseudonym,fuzzy location and encryption,the main system structure there are two: one is based on trusted third-party central server architecture,one is based on distributed P2 P structure.The former third-party servers are likely to cause bottlenecks in the entire system,while the latter most studies are based on the assumption that the collaborative user in the surrounding environment under the conditions of all credible research.According to the reality of the situation,the cooperative users may not credible in P2 P based distributed,the main purpose of this paper is to prevent malicious attackers through frequently initiated location request service acquisition collaborative user location information.At the same time,a k-anonymous method is constructed to protect the privacy of users and provide accurate location services.In this paper,we propose a binary tree model incremental neighborhood query algorithm(BTINQ)based on third party trusted detection.The main works are as following:(1)Anonymous stage: we propose the structure of the BTINQ,and an anonymous BTINQ location method based on third party trust detection.The addition of the trusted-detection third party mechanism based on the distributed structure,used to feedback the user whether there is an exception,if the user is abnormal,then the surrounding users choose not to cooperate with it.In order to avoid the central attack,we use the binary tree traversal collaborative users.And use the outer circle of the smallest rectangle covers all the cooperating users as an anonymous area.Then use the centroid of the anonymous area as the anchor to send location query.(2)Query phase: we propose the incremental nearest neighbor query method of the BTINQ.With the help of the incremental nearest neighbor query algorithm,makes the query at the end of the supply space covering both demand space and meet the minimum radius of anonymous requirements,in order to provide users with accurate location query while better protection of the location of privacy.(3)Experimental analysis: the experiment shows that the method proposed in this paper has a good application in the environment of untrusted users.It can protect the privacy of users. |