CAJ | 학술논문

Bottom-Upgrid算法和Top-Downgrid算法都是基于网格划分空间的高效匿名算法，不同的算法其最终需要查询的迭代次数、形成的匿名区大小、用户得到的相对匿名度都有可能不同，这些因素之间的关系是矛盾的，但对查询质量都有着重要的影响。不同的移动用户在不同情况下发送位置服务请求时，对影响查询质量的迭代次数、匿名区域、相对匿名度这3个准则都有着自己的个性化要求。为了解决这个问题，文章在Bottom-Up grid算法和Top-Down grid算法的基础上提出了一种基于个性化需求的最优化算法选择方法。该方法首先根据层析分析法(AHP)对3个准则进行数学建模，然后根据用户对这3个准则的评估构造正互反矩阵并进行一致性检验，最后通过对两种算法的实验模拟，计算两种算法的权重，最终选择权重值较大的算法。此最优化选择方法在满足匿名度k的条件下也符合用户针对不同情况的个性化需求。
Bottom-Upgrid산법화Top-Downgrid산법도시기우망격화분공간적고효닉명산법，불동적산법기최종수요사순적질대차수、형성적닉명구대소、용호득도적상대닉명도도유가능불동，저사인소지간적관계시모순적，단대사순질량도유착중요적영향。불동적이동용호재불동정황하발송위치복무청구시，대영향사순질량적질대차수、닉명구역、상대닉명도저3개준칙도유착자기적개성화요구。위료해결저개문제，문장재Bottom-Up grid산법화Top-Down grid산법적기출상제출료일충기우개성화수구적최우화산법선택방법。해방법수선근거층석분석법(AHP)대3개준칙진행수학건모，연후근거용호대저3개준칙적평고구조정호반구진병진행일치성검험，최후통과대량충산법적실험모의，계산량충산법적권중，최종선택권중치교대적산법。차최우화선택방법재만족닉명도k적조건하야부합용호침대불동정황적개성화수구。
The algorithms of Bottom-Up grid and Top-Down grid are all high-performance anonymous algorithms based on grid-partitioning space. Different algorithm needs different parameter criteria, such as iterations, the size of anonymous area, and the users’ degree of anonymity. These parameters have great impacts on query quality, but they are conflicting. When mobile users transmit location service requests under different situations, they may have their own individual requirements about these parameters. To solve the problem, on the basis of the algorithms of Bottom-Up grid and Top-Down grid, this paper gives a method of optimization selection based on personalized space anonymous algorithm. Firstly, the method constructs a mathematical model of these parameters according to the AHP. Secondly, it structures a straight reciprocal matrix based on the user’s review of these parameters and checks the consistency. Lastly, it performs experiments and simulations to calculate the weights of algorithms of Bottom-Up grid and Top-Down grid, then choses the algorithm with bigger weight. The method of optimization selection not only satisifes the demand of k-degree, but also conforms to the users’ needs in different situations.