Font Size: a A A

Design On Location Privacy Protection Model & Algorithm For Road Networks

Posted on:2016-08-28Degree:MasterType:Thesis
Country:ChinaCandidate:X L YuFull Text:PDF
GTID:2348330542475886Subject:Engineering
Abstract/Summary:PDF Full Text Request
With the rapid development of mobile communications technology and positioning technology,location-based service(Location-based service,LBS)has been widely used in the worldwide.Especially in recent years,a variety of commercial LBS products constantly emerging,enrich the user's daily life and entertainment but also promote the development of the peripheral industry.And it already has an important role in People's Daily.However,with LBS giving users convenience,the privacy leakage problem also gradually appears.Especially once the problem of location privacy leakage cannot be well resolved;it will be a great threat to the user's life and property safety.Researchers have proposed a variety of related location privacy protection method so far,to protect the user's location privacy.One of the most studied approaches is location k-anonymity.The existed researches on location privacy preserving mainly focused on Euclidean space.Their model and algorithm can not be directly used to solve the leakage of user location privacy problems in road network.To solve the problem,this paper proposed a improved CCF-based privacy protection scheme and an algorithm based on the partition of node's depth for protecting location privacy in road network,and the specific contents are as follows:(1)Summarizes the existing location privacy protection technologies and system architecture,and highlights the location k-anonymity and location l-diversity.(2)Firstly,system model and data structure is designed in this paper.Among them,the system model is center server structure,center server structure can reduce the burden of mobile terminal,based on the LBS server,and can prevent LBS server leakage privacy of users.The storage structure mainly adopts the hash and array to organization and storage of data,based on the anonymous server's main job is CPU intensive,second highway road network the relative are fixed,so rarely involve insert,delete operations,and the query operation will be more.(3)Then the cloaking ring and cloaking tree(CRF)are introducd and base them a im7 provement scheme is presented,mainly include a improved scoring function and a algorithm to optimize edge weights,throuth spatio-temporal anonymous to meet users' s privacy requirements.This method gives full consideration on road network's structuralfeatures,which meets users' s demands of Qos and Privacy requirements.And the security of this method is proved through theoretical analysis and experiments.
Keywords/Search Tags:highway network, LBS, Location privacy, Location k-anonymity, Location ldiversity
PDF Full Text Request
Related items