Research On Anonymous Location Privacy Protection In Wireless Sensor Networks

The integration of wireless sensor network and global positioning technology promotes location based service to develop. Location based service is quickly spreaded to many fields, such as entertainment query, children caring, traffic navigation and cars tracing and so on. However, while the location based service brings human convenience, location privacy security issues are increasingly prominent and becoming hot research topic for scholars. Therefore, how to seek a balance between providing accurate service and location privacy protection is the main content of the research, which will not affect location based service quality and provide protection for users' location privacy. The specific research work is as follows:(1)The basic concepts and characteristics of wireless sensor network is summarized, the difference between the traditional network and the wireless sensor network is compared mainly in the design?application?maintenance and so on. It also describes two kinds of wireless sensor network positioning technology, introduces systematically three kinds of attacks and privacy protection mechanisms of location privacy protection in wireless sensor network, recommends the location based service and the existing problems deeply.(2) A kind of algorithm based on grid-dived space location privacy protection-the improved Bottom-Up grid alrotithm is proposed for users'privacy, service quality and server communication overhead that location privacy protection technology relates to. Because the original algorithm's anonymous route is solid and oneness to expand cell grid, in order to reduce the anonymous area to make the final cell grid number less as far as possible under the condition of meeting the users' anonymous degree k, the improved method compares the number of the expanding cell grid each time and the cell grid which includes the largest number of users is selected to expand. The algorithm can reduce anonymous area effectively, shorten the query time and improve users'query quality. Finally, the experimental results prove the feasibility of the improved algorithm by a group of users who use the same anonymous device to query.(3) In order to choose an optimal algorithm between the two algorithms, a kind of selection mechanism based on the grid-dived space effective algorithms which are Bottom-Up grid and Top-Down grid anonymous algorithm is proposed for the problem that the anonymous area they form eventually is not same, the consequence of a larger anonymous area that results in are the waste of communication cost and the delay of anonymous time. Firstly the number of iterations is calculated according to the anonymous degree k, then the number of cell grids included by the two algorithms is computed according to the relationship between the number of iterations and the cell grids, finally the number of cell grids is compared and the algorithm which forms the minimum number of cell grids is selected. Compared with Hybrid algorithm, the selection mechanism improves a little no matter the anonymous time or the relative anonymity degree and overcomes the disadvantage of complex calculation process of Hybrid algorithm, shrinks the range of the query anonymous sets and improves user's query quality eventually.