Human Mobility and Location Privacy in Wireless Sensor Networks

  • Author / Creator
    Vogt, Ryan A
  • By eavesdropping on a user's query in a sensor network, an adversary can deduce both the user's current location and his/her location of interest. Issuing k queries instead of one (our "k-query" scheme) protects the privacy of the user's location of interest, but facilitates the adversary determining the user's current location. We propose a formal method for measuring how well issuing k queries to locations dispersed throughout the network protects the privacy of the user's location of interest, as well as a quantitative measure of how much information the k queries leak about the user's current location. Experiments reveal that how physically dispersed the k queries are has no meaningful effect on the user's privacy. However, there is a direct trade-off between the user's location-of-interest privacy and his/her current-location privacy, controlled by the value of k the user chooses. User interactions with sensor networks do not occur in featureless, uniform environments. To facilitate the study of our k-query scheme in a rich environment characterized by realistically mobile users, we developed a new generative mobility model to produce mobility data for simulated agents. Existing generative mobility models suffer from a number of limitations. Most significantly, existing models are not representative of actual human movement. Our new mobility model is based on state-of-the-art work in understanding pedestrian mobility patterns in urban areas, known as Space Syntax. Under our model, agents move in a meaningful fashion in terms of destination selection and pathfinding, constrained by their surroundings in an outdoor urban environment. Results obtained from our publicly available Destination-Based Space Syntax Simulator (DBS3), independent from our k-query experiments, demonstrate which mobility model parameters affect wireless network simulations in general: the pathfinding metric in grid-based urban centres and centrality bias in other urban centres. We combined DBS3 with our k-query scheme in order to study how long in advance a user should issue the k queries if travelling from some current location to his/her location of interest. While the exact threshold depends on the urban environment and speed of the agents in question, the typical threshold is very low, e.g., 10 minutes when using k=3 in downtown Edmonton, Canada.

  • Subjects / Keywords
  • Graduation date
  • Type of Item
  • Degree
    Doctor of Philosophy
  • DOI
  • License
    This thesis is made available by the University of Alberta Libraries with permission of the copyright owner solely for non-commercial purposes. This thesis, or any portion thereof, may not otherwise be copied or reproduced without the written consent of the copyright owner, except to the extent permitted by Canadian copyright law.
  • Language
  • Institution
    University of Alberta
  • Degree level
  • Department
    • Department of Computing Science
  • Supervisor / co-supervisor and their department(s)
    • Nascimento, Mario (Computing Science)
    • Nikolaidis, Ioanis (Computing Science)
  • Examining committee members and their departments
    • Ravi, S. S. (Computer Science, University of Pittsburgh)
    • Ardakani, Masoud (Electrical and Computer Engineering)
    • Elmallah, Ehab (Computing Science)
    • Harms, Janelle (Computing Science)