|
||||||
|
||||||
| Undergraduate Honours Projects | ||||||
|
Carleton University - School of Computer Science Undergraduate Honours Project Summer 2010 Protecting Location Privacy in Wireless Sensor Networks Qiuliang Tang 
ABSTRACT Protecting location privacy in wireless sensor networks has become an important issue with the wide application of WSNs. This project reviews the current techniques for protecting source location privacy and base station location privacy against local adversaries and global adversaries. Motivated by the k-anonymity scheme used by Vogt et al. to protect the receiver's location privacy and realize the weaknesses of using the random choice algorithm for choosing the k-1 fake receiver locations, we develop better algorithms called GC and GD which disperse the k receiver locations throughout the WSN to minimize the leakage of the sender's AOI without exposing the real receiver's location, based on the greedy construction heuristic and greedy deletion heuristic solutions to the discrete p-dispersion problem described by Erkut et al.. We simulate the GC and GD algorithms under Euclidean distance metric and hop distance metric respectively. The simulation results show that GC and GD perform consistently better than the random choice algorithm in quality of dispersion. Also, the deterministic solution of GC and GD guarantees that for the same receiver, either algorithm generates the same set of k locations each time, while for different receivers, either algorithm generates a unique set of k locations for each receiver. GC performs better than GD in quality of dispersion, difference between sets of k locations for different receivers, and computation efficiency. There is no definitive difference between the Euclidean distance metric and the hop distance metric except that the hop distance metric is a more convenient way to obtain the distance matrix of a real WSN. |
||||||
|
