关键词: 移动计算,位置服务,隐私保护,博弈,动态规划

Abstract: With the development of mobile computing and location equipment technologies,location privacy protection receives extensive attention from academia in recent years.A lot of anonymity algorithm has been put forward to protect users’ privacy information.However,the existing methods is either not suitable for mobile environment,or do not consider the untrusted environment.In light of these problems,this paper put forward Dynamic_p which is dynamic planning anonymity algorithm based on game theory.This method is proposed on the basic of Privacy_1[8] solving the privacy protection in the suspect environment.First it turns anonymous group into anonymous tree,and then child node cooperates with the parent node to calculate the anchor through game from the tree’s bottom to top,finally it calculates the entire anchors of anonymous group through layers of recursive.After that,users initiate location neighbor query through using anchor of anonymous group instead of actual location,then select candidate locations by probability statistics,finally calculate the final ideal location through computation.Simulation results show that this method has better performance,and can be applied to mobile untrusted environment.

Key words: Mobile computing,Location services,Privacy protection,Game,Dynamic planning