基于網(wǎng)格劃分的位置隱私保護算法研究
發(fā)布時間：2019-04-12 12:03
【摘要】：隨著智能移動設備的流行與普及,基于位置的服務應用深入各行各業(yè),改變了人們的生產(chǎn)和生活方式�；谖恢玫姆⻊諔孟蛴脩籼峁┓⻊盏那疤崾怯脩籼峤蛔约旱木_位置。由于位置信息本身具有的敏感特征,位置信息泄露會引起嚴重的隱私泄露問題,位置隱私問題日益引起人們的重視。位置信息隱私保護方法主要包括假位置、區(qū)域匿名、空間加密技術。其中,區(qū)域匿名是一種應用廣泛,性能高效的方法。區(qū)域匿名主要采用位置k匿名模型泛化用戶的位置信息達到隱私保護的效果。區(qū)域匿名方法目前主要有兩大類方法,一類是鄰接用戶擴展方法,典型算法有:中心偽裝算法、最近鄰算法和希爾伯特偽裝算法、團偽裝算法等;另一類是區(qū)域擴展方法,典型算法有:四分網(wǎng)格算法、間隔偽裝算法、Casper偽裝算法、鄰接網(wǎng)格擴展算法。Grid-divide算法是一種鄰接網(wǎng)格擴展匿名算法。該方法將空間區(qū)域依據(jù)一定的規(guī)律劃分成若干個網(wǎng)格,所有網(wǎng)格處于同一層上,用戶根據(jù)一定策略進行水平或垂直方向上的空間擴展,直至生成的空間區(qū)域能滿足用戶的匿名要求。但是這種算法并不太適合用戶分布稀疏或者匿名度要求較高的情況。在Grid-divide算法的基礎上提出了一種改進的網(wǎng)格劃分位置隱私保護算法。該算法和Grid-divide算法一樣采用網(wǎng)格結(jié)構(gòu)劃分位置空間,使所有網(wǎng)格處于同一層上,不對其進行層次劃分。不同的是進行空間擴展時,采用四周擴展的方式,保證擴展的有效性和擴展粒度較小。此外,引入最大匿名區(qū)間參數(shù)限制最終形成的匿名區(qū)域的大小,借鑒鄰接用戶擴展的思想采用延遲等待更多用戶進入候選匿名區(qū)的方式,提高算法的成功率。引入最長可容忍時間參數(shù)限制服務延遲的時間,以促進算法更快形成滿足條件的較小的匿名區(qū)域。采用C語言實現(xiàn)了改進的網(wǎng)格劃分空間位置隱私保護算法,使用Brinkhoff基于網(wǎng)絡的移動對象生成器生成的數(shù)據(jù)集進行仿真實驗,對比了原始算法和改進算法的匿名時間和匿名效果,并對比了不同參數(shù)取值下算法執(zhí)行情況,證明了改進算法的有效性。
[Abstract]:With the popularity and popularization of intelligent mobile devices, location-based service applications go deep into various industries and change people's production and life style. Location-based service applications provide services to users on the premise that users submit their exact location. Because of the sensitive characteristics of location information, location information disclosure will cause serious privacy disclosure, and the location privacy problem has attracted more and more attention. The privacy protection methods of location information mainly include false location, area anonymity and space encryption technology. Among them, area anonymity is a widely used and efficient method. Regional anonymity mainly uses location k anonymity model to generalize user's location information to achieve privacy protection. At present, there are two main methods of region anonymity, one is adjacency user extension, the typical algorithms are: central camouflage algorithm, nearest neighbor algorithm and Hilbert camouflage algorithm, regiment camouflage algorithm and so on. The other is region extension. The typical algorithms are quartile mesh algorithm, interval camouflage algorithm, Casper masquerading algorithm and adjacent mesh extension algorithm. Grid-divide algorithm is a kind of adjacent mesh extended anonymous algorithm. In this method, the spatial region is divided into several meshes according to a certain rule, all grids are on the same layer, and the user expands the space horizontally or vertically according to a certain strategy. Until the generated space area can meet the user's anonymous requirements. However, this algorithm is not suitable for users with sparse distribution or high anonymity requirements. Based on the Grid-divide algorithm, an improved mesh location privacy protection algorithm is proposed. In the same way as the Grid-divide algorithm, the grid structure is used to partition the position space, so that all meshes are on the same layer and are not hierarchical. In order to ensure the efficiency and granularity of the expansion, the four-dimensional expansion is adopted when the spatial expansion is carried out. In addition, the maximum anonymous interval parameter is introduced to limit the size of the final anonymous region, and the extension of adjacent users is used to delay waiting for more users to enter the candidate anonymous area, so as to improve the success rate of the algorithm. The maximum tolerable time parameter is introduced to limit the time of service delay in order to promote the algorithm to form smaller anonymous regions which satisfy the conditions more quickly. In this paper, an improved privacy protection algorithm for spatial location of mesh partition is implemented in C language. The simulation experiment is carried out with the data set generated by Brinkhoff network-based mobile object generator, and the anonymous time and anonymous effect of the original algorithm and the improved algorithm are compared. The performance of the algorithm with different parameters is compared, and the effectiveness of the improved algorithm is proved.
【學位授予單位】：海南大學
【學位級別】：碩士
【學位授予年份】：2016
【分類號】：TP309
[Abstract]:With the popularity and popularization of intelligent mobile devices, location-based service applications go deep into various industries and change people's production and life style. Location-based service applications provide services to users on the premise that users submit their exact location. Because of the sensitive characteristics of location information, location information disclosure will cause serious privacy disclosure, and the location privacy problem has attracted more and more attention. The privacy protection methods of location information mainly include false location, area anonymity and space encryption technology. Among them, area anonymity is a widely used and efficient method. Regional anonymity mainly uses location k anonymity model to generalize user's location information to achieve privacy protection. At present, there are two main methods of region anonymity, one is adjacency user extension, the typical algorithms are: central camouflage algorithm, nearest neighbor algorithm and Hilbert camouflage algorithm, regiment camouflage algorithm and so on. The other is region extension. The typical algorithms are quartile mesh algorithm, interval camouflage algorithm, Casper masquerading algorithm and adjacent mesh extension algorithm. Grid-divide algorithm is a kind of adjacent mesh extended anonymous algorithm. In this method, the spatial region is divided into several meshes according to a certain rule, all grids are on the same layer, and the user expands the space horizontally or vertically according to a certain strategy. Until the generated space area can meet the user's anonymous requirements. However, this algorithm is not suitable for users with sparse distribution or high anonymity requirements. Based on the Grid-divide algorithm, an improved mesh location privacy protection algorithm is proposed. In the same way as the Grid-divide algorithm, the grid structure is used to partition the position space, so that all meshes are on the same layer and are not hierarchical. In order to ensure the efficiency and granularity of the expansion, the four-dimensional expansion is adopted when the spatial expansion is carried out. In addition, the maximum anonymous interval parameter is introduced to limit the size of the final anonymous region, and the extension of adjacent users is used to delay waiting for more users to enter the candidate anonymous area, so as to improve the success rate of the algorithm. The maximum tolerable time parameter is introduced to limit the time of service delay in order to promote the algorithm to form smaller anonymous regions which satisfy the conditions more quickly. In this paper, an improved privacy protection algorithm for spatial location of mesh partition is implemented in C language. The simulation experiment is carried out with the data set generated by Brinkhoff network-based mobile object generator, and the anonymous time and anonymous effect of the original algorithm and the improved algorithm are compared. The performance of the algorithm with different parameters is compared, and the effectiveness of the improved algorithm is proved.
【學位授予單位】：海南大學
【學位級別】：碩士
【學位授予年份】：2016
【分類號】：TP309
【參考文獻】
相關期刊論文 前10條
1 劉佳;方賢進;康佳;;社交網(wǎng)絡中的位置隱私保護研究[J];電腦知識與技術;2014年28期
2 楊珍;鐘誠;杜曉靜;;淺析大數(shù)據(jù)環(huán)境下的隱私保護問題[J];電子世界;2014年18期
3 韓建民;林瑜;于娟;賈l，
本文編號：2456995
本文鏈接：http://www.sikaile.net/kejilunwen/ruanjiangongchenglunwen/2456995.html
最近更新
教材專著
