A Mobile Terminal Based Trajectory Preserving Strategy for Continuous Querying LBS Users Yunxia Feng, Peng Liu, Jianhui Zhang May 16 - 18, 2012 Hangzhou,

Slides:



Advertisements
Similar presentations
IEEE INFOCOM 2004 MultiNet: Connecting to Multiple IEEE Networks Using a Single Wireless Card.
Advertisements

Location Based Services and Privacy Issues
VSMC MIMO: A Spectral Efficient Scheme for Cooperative Relay in Cognitive Radio Networks 1.
BY PAYEL BANDYOPADYAY WHAT AM I GOING TO DEAL ABOUT? WHAT IS AN AD-HOC NETWORK? That doesn't depend on any infrastructure (eg. Access points, routers)
Location Based Service Aloizio P. Silva Researcher at Federal University Of Minas Gerais, Brazil Copyright © 2003 Aloizio Silva, All rights reserved. School.
Application of Bayesian Network in Computer Networks Raza H. Abedi.
GrooveSim: A Topography- Accurate Simulator for Geographic Routing in Vehicular Networks 簡緯民 P
Location Based Trust for Mobile User – Generated Content : Applications, Challenges and Implementations Presented By : Anand Dipakkumar Joshi USC.
1 Location Privacy. 2 Context Better localization technology + Pervasive wireless connectivity = Location-based applications.
Source-Location Privacy Protection in Wireless Sensor Network Presented by: Yufei Xu Xin Wu Da Teng.
Constructing Popular Routes from Uncertain Trajectories Ling-Yin Wei 1, Yu Zheng 2, Wen-Chih Peng 1 1 National Chiao Tung University, Taiwan 2 Microsoft.
An Approach to Evaluate Data Trustworthiness Based on Data Provenance Department of Computer Science Purdue University.
A Mobile Infrastructure Based VANET Routing Protocol in the Urban Environment School of Electronics Engineering and Computer Science, PKU, Beijing, China.
--Presented By Sudheer Chelluboina. Professor: Dr.Maggie Dunham.
CSCE 715 Ankur Jain 11/16/2010. Introduction Design Goals Framework SDT Protocol Achievements of Goals Overhead of SDT Conclusion.
1 A Vehicle Route Management Solution Enabled by Wireless Vehicular Networks Kevin Collins and Gabriel-Miro Muntean IEEE INFOCOM 2008.
© 2005 Prentice Hall7-1 Stumpf and Teague Object-Oriented Systems Analysis and Design with UML.
Dissemination protocols for large sensor networks Fan Ye, Haiyun Luo, Songwu Lu and Lixia Zhang Department of Computer Science UCLA Chien Kang Wu.
© 2005 Prentice Hall4-1 Stumpf and Teague Object-Oriented Systems Analysis and Design with UML.
A Hierarchical Energy-Efficient Framework for Data Aggregation in Wireless Sensor Networks IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 55, NO. 3, MAY.
An Authentication Service Against Dishonest Users in Mobile Ad Hoc Networks Edith Ngai, Michael R. Lyu, and Roland T. Chin IEEE Aerospace Conference, Big.
Component-Based Routing for Mobile Ad Hoc Networks Chunyue Liu, Tarek Saadawi & Myung Lee CUNY, City College.
Handouts Software Testing and Quality Assurance Theory and Practice Chapter 11 System Test Design
TOWARDS IDENTITY ANONYMIZATION ON GRAPHS. INTRODUCTION.
1 Content Distribution Networks. 2 Replication Issues Request distribution: how to transparently distribute requests for content among replication servers.
Sensys 2009 Speaker:Lawrence.  Introduction  Overview & Challenges  Algorithm  Travel Time Estimation  Evaluation  Conclusion.
Trust Management in Mobile Ad Hoc Networks Using a Scalable Maturity-Based Model Authors: Pedro B. Velloso, Rafael P. Laufer, Daniel de O. Cunha, Otto.
Location Privacy Location privacy in mobile systems: A personalized Anonymization Model Burga Gedik, Ling Liu.
S/W Project Management
Implementation Yaodong Bi. Introduction to Implementation Purposes of Implementation – Plan the system integrations required in each iteration – Distribute.
Mirco Nanni, Roberto Trasarti, Giulio Rossetti, Dino Pedreschi Efficient distributed computation of human mobility aggregates through user mobility profiles.
Demo. Overview Overall the project has two main goals: 1) Develop a method to use sensor data to determine behavior probability. 2) Use the behavior probability.
Presented By: Vasantha Lakshmi Gutha Graduate student (CS) Course: CENG 5931 University of Houston-Clear Lake Spring 2011.
Tracking with Unreliable Node Sequences Ziguo Zhong, Ting Zhu, Dan Wang and Tian He Computer Science and Engineering, University of Minnesota Infocom 2009.
Improving Capacity and Flexibility of Wireless Mesh Networks by Interface Switching Yunxia Feng, Minglu Li and Min-You Wu Presented by: Yunxia Feng Dept.
Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and David H.C. Du Dept. of.
Hiding in the Mobile Crowd: Location Privacy through Collaboration.
Presenter: Mathias Jahnke Authors: M. Zhang, M. Mustafa, F. Schimandl*, and L. Meng Department of Cartography, TU München *Chair of Traffic Engineering.
Threshold Phenomena and Fountain Codes Amin Shokrollahi EPFL Joint work with M. Luby, R. Karp, O. Etesami.
ECO-DNS: Expected Consistency Optimization for DNS Chen Stephanos Matsumoto Adrian Perrig © 2013 Stephanos Matsumoto1.
ACOMP 2011 A Novel Framework for LBS Privacy Preservation in Dynamic Context Environment.
13 Step Approach to Network Design Steps A Systems Approach 8Conduct a feasibility Study 8Prepare a plan 8Understand the current system 8Design.
Exploiting Context Analysis for Combining Multiple Entity Resolution Systems -Ramu Bandaru Zhaoqi Chen Dmitri V.kalashnikov Sharad Mehrotra.
NGMAST 2008 A Proactive and Distributed QoS Negotiation Approach for Heterogeneous environments Anis Zouari, Lucian Suciu, Jean Marie Bonnin, and Karine.
Cmpe 589 Spring 2006 Lecture 2. Software Engineering Definition –A strategy for producing high quality software.
SR: A Cross-Layer Routing in Wireless Ad Hoc Sensor Networks Zhen Jiang Department of Computer Science West Chester University West Chester, PA 19335,
1 Utilizing Shared Vehicle Trajectories for Data Forwarding in Vehicular Networks IEEE INFOCOM MINI-CONFERENCE Fulong Xu, Shuo Gu, Jaehoon Jeong, Yu Gu,
Copyright © 2011, Scalable and Energy-Efficient Broadcasting in Multi-hop Cluster-Based Wireless Sensor Networks Long Cheng ∗ †, Sajal K. Das†,
Node Reclamation and Replacement for Long-lived Sensor Networks Bin Tong, Wensheng Zhang, and Chuang Wang Department of Computer Science, Iowa State University.
Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,
Data Transmission Mechanism for Multiple Gateway System Xuan He, Yuanchen Ma and Mika Mizutani, 6th International Conference on New Trends in Information.
Big traffic data processing framework for intelligent monitoring and recording systems 學生 : 賴弘偉 教授 : 許毅然 作者 : Yingjie Xia a, JinlongChen a,b,n, XindaiLu.
An Improved Vehicular Ad Hoc Routing Protocol for City Environments Moez Jerbi, Sidi-Mohammed Senouci, and Rabah Meraihi France Telecom R&D, Core Network.
Evaluating Mobility Support in ZigBee Networks
Location Privacy Protection for Location-based Services CS587x Lecture Department of Computer Science Iowa State University.
Efficient Resource Allocation for Wireless Multicast De-Nian Yang, Member, IEEE Ming-Syan Chen, Fellow, IEEE IEEE Transactions on Mobile Computing, April.
U of Minnesota DIWANS'061 Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and.
FERMA: An Efficient Geocasting Protocol for Wireless Sensor Networks with Multiple Target Regions Young-Mi Song, Sung-Hee Lee and Young- Bae Ko Ajou University.
Wireless Cache Invalidation Schemes with Link Adaptation and Downlink Traffic Presented by Ying Jin.
Peter Pham and Sylvie Perreau, IEEE 2002 Mobile and Wireless Communications Network Multi-Path Routing Protocol with Load Balancing Policy in Mobile Ad.
Hardware/Software Co-Design of Complex Embedded System NIKOLAOS S. VOROS, LUIS SANCHES, ALEJANDRO ALONSO, ALEXIOS N. BIRBAS, MICHAEL BIRBAS, AHMED JERRAYA.
VANETs. Agenda System Model → What is VANETs? → Why VANETs? Threats Proposed Protocol → AOSA → SPCP → PARROTS Evaluation → Entropy → Anonymity Set → Tracking.
Optimal Relay Placement for Indoor Sensor Networks Cuiyao Xue †, Yanmin Zhu †, Lei Ni †, Minglu Li †, Bo Li ‡ † Shanghai Jiao Tong University ‡ HK University.
1 Anonymity. 2 Overview  What is anonymity?  Why should anyone care about anonymity?  Relationship with security and in particular identification 
Analysis the performance of vehicles ad hoc network simulation based
VANET.
Feeling-based location privacy protection for LBS
Location Cloaking for Location Safety Protection of Ad Hoc Networks
System Control based Renewable Energy Resources in Smart Grid Consumer
Presentation transcript:

A Mobile Terminal Based Trajectory Preserving Strategy for Continuous Querying LBS Users Yunxia Feng, Peng Liu, Jianhui Zhang May , 2012 Hangzhou, China IEEE DCOSS '12 ———

Introduction Problem Description and Assumptions Overview of Virtual Avatar (VAvatar) Performance Evaluation Conclusion Contents

 Privacy Threats in Location-based Services Introduction  In order to enjoy location based services (LBS), messages sent by a user should include his current location information.  Without safeguards, query messages pose a severe privacy risk exposing users to constant identification and tracking throughout the day. For LBS users: Real-time anonymity of location/trajectory is essential

Introduction CCentral; CComplicated; CCan not be implemented on mobile terminals; NNeed a third party server to implement. Shortcomings of Current Approaches

Typical Architecture of Current Resolutions Location-based Database Server Location Anonymization Server End Users Complicated; Third part

Introduction Problem Description and Assumptions Overview of Virtual Avatar (VAvatar) Performance Evaluation Conclusion Contents

Problem Description and Assumptions Our purpose: protect users from being tracked by linking the user with his trajectory information. The problem of mobile terminal based trajectory preserving for continuous query users in LBS systems. Problem Description

 Architecture of the LBS system Components of the system:  LBS server  Routers/Wireless Access Points (APs)  Mobile Terminals Problem Description and Assumptions

 There is no third part server to provide privacy anonymity;  Users send location-related queries periodically to LBS servers;  Communications (queries/replies) are relayed by AP & routers.  Communication links (both wireless and wired links) are safe.  LBS server has a map, which precision is fine enough to accurately locate any place queried by users.  The attacker  Can only access data from the LBS server consistently.  Can achieve all communication records from the LBS server.  Can deduce location/trajectory of users by analyzing spatial- time relationships between communication records. Assumptions:

Introduction Problem Description and Assumptions Overview of Virtual Avatar (VAvatar) Performance Evaluation Conclusion Contents

Basic Idea of VAvator  Users sends both true and fake queries to the LBS server.  Fake queries are selected and scheduled carefully so that multiple reliable trajectories are achieved from the view point of a third part.

An Example The Corresponding Map taken in this example:

Possible paths established by the attacker in each phase Phase 1Phase 2Phase 3Phase 4 1, 25, 3, 74, 9, 6D1, D, 5, 8, D2 Queries are sent in each phases (time period): Basic Idea of VAvator Suppose that the trajectory of the user is: S D

 Reasons  Attacker may distinguish noisy data from true position data if they are chosen arbitrary by analyzing spatio-temporal relationships among communication records.  The trajectory is affected by multiple factors, such as type of the, the trip purpose, real-time traffic condition and etc.  Problems that Vavatar should resolve  Interrupt spatial temporal relationships among locations (included in both true queries and fake queries).  Consider impacts of several factors such as type of query time, the vehicle, the trip purpose, real-time traffic condition of the specific road, and etc. Challenges Vavatar Faces

Resolutions Vavatar Adopts A. Noisy Location Selection Strategy(Rules) (a) Public Locations Near (Within) Markable Places (b) Independent Selection (c) Places with Real-time Traffic Information (d) Redundant Inquiries Metrics: real and reachable

Resolutions Vavatar Adopts (cont.) (a) The Normal Scheduling Strategy B. Query Scheduling Strategy : a small positive number, which is decided by both V and v. μ : a positive number, which value is: < μ < p∙v. P: a positive pure decimal fraction. Δt: an experiential parameter to denote impacts of other factors (eg: trip goal and the location type) Both and μ are used here to adjust the value of v. d: distance between two noisy locations; V: upper velocity; v: the real-time velocity of the path δt: possible additional traveling time. Meanings of Inputs: T: time period between two fake queries. Meanings of Outputs Values of other Parameters:

(b) The Disordered Scheduling Strategy  It is especially suitable when  virtual paths have intersections with true path.  path segments near intersections where there are multiple entrances and exits of alternative paths. The query sequence is disordered purposely to interrupt spatio-temporal relationships between communication data. Resolutions Vavatar Adopts (cont.) B. Query Scheduling Strategy

Introduction Problem Description and Assumptions Overview of Virtual Avatar (VAvatar) Performance Evaluation Conclusion Contents

Performance Evaluation A. Analysis of Trajectory Preservation Degree TPD (Trajectory Preservation Degree): the number of feasible paths achieved from the viewpoint of attacker. N C (N C > 1) : the total number of distinct candidate paths at that time. p r (0 ≤ p r ≤ 1): the trajectory risk possibility faced by the user at time t c. δ (0 ≤ δ ≤ 1): an empirical parameter. The more the spatial-time complexity of nodes is, the larger the value of δ will be. Evaluation Matric:

Performance Evaluation B. Experiments & Results  Consider the scenario where users keep moving.  Select candidate paths of true paths and virtual paths from a digital map from a publicly accessible portal.  Every user uses 3-5 virtual paths independently.  Implement two modes:  All virtual paths start at the same time;  Starting time of virtual paths are independent from each other.  Users are divided into two groups  Users in the first group do not adopts VAvatar; Data are used as metrics to find candidate paths for attackers.  Users in the second group adopts Vavatar.

Performance Evaluation All candidate paths taken by 3 users in the experiments:

Performance Evaluation TABLE Detailed Paths Information of 3 Users:

Results and Analysis Results achieved by user 1 Candidate trajectories analysis Relationships between time and distance The starting time of users impacts the average velocity of the same road. This makes it more difficult for the attacker to distinguish true trajectory from false paths.

Results and Analysis: Energy consumption under different scheduling strategies (n=4) n : the ratio between true queries and false queries random_i and syn_i (i = 1, 2) denotes the average energy consumption results of user i when he adopts distinct and continuous scheduling strategy, respectively.

Introduction Problem Description and Assumptions Overview of Virtual Avatar (VAvatar) Performance Evaluation Conclusions Contents

Conclusions PProposed a trajectory preservation scheme DDoes not need additional third part servers. CCan be implemented on the smart mobile terminals. DDoes not need multiple number of users. AAchieves efficient location & trajectory protection with endurable overheads.

Thanks Q&A ?