Sociological Orbit based Mobility Profiling Lab for Advanced Network Design, Evaluation and Research On Profiling Mobility and Predicting Locations of.

Slides:



Advertisements
Similar presentations
BreadCrumbs: Forecasting Mobile Connectivity Presented by Dhruv Kshatriya Paper by Anthony J. Nicholson Brian D. Noble.
Advertisements

Supporting Cooperative Caching in Disruption Tolerant Networks
An Interactive-Voting Based Map Matching Algorithm
Markov Chain Monte Carlo Convergence Diagnostics: A Comparative Review By Mary Kathryn Cowles and Bradley P. Carlin Presented by Yuting Qi 12/01/2006.
Application of Bayesian Network in Computer Networks Raza H. Abedi.
A Survey on Tracking Methods for a Wireless Sensor Network Taylor Flagg, Beau Hollis & Francisco J. Garcia-Ascanio.
Spatiotemporal Pattern Mining For Travel Behavior Prediction UIC IGERT Seminar 02/14/2007 Chad Williams.
Yoshiharu Ishikawa (Nagoya University) Yoji Machida (University of Tsukuba) Hiroyuki Kitagawa (University of Tsukuba) A Dynamic Mobility Histogram Construction.
Generated Waypoint Efficiency: The efficiency considered here is defined as follows: As can be seen from the graph, for the obstruction radius values (200,
Using Probabilistic Methods for Localization in Wireless Networks Presented by Adam Kariv May, 2005.
SLAW: A Mobility Model for Human Walks Lee et al..
What is Statistical Modeling
Forwarding Redundancy in Opportunistic Mobile Networks: Investigation and Elimination Wei Gao 1, Qinghua Li 2 and Guohong Cao 3 1 The University of Tennessee,
By Libo Song and David F. Kotz Computer Science,Dartmouth College.
1 In-Network PCA and Anomaly Detection Ling Huang* XuanLong Nguyen* Minos Garofalakis § Michael Jordan* Anthony Joseph* Nina Taft § *UC Berkeley § Intel.
IEEE Infocom 2007 On a Routing Problem within Probabilistic Graphs and its application to Intermittently Connected Networks Joy Ghosh Hung Q. Ngo, Seokhoon.
Report on Intrusion Detection and Data Fusion By Ganesh Godavari.
Sociological Orbit based Mobility Profiling Lab for Advanced Network Design, Evaluation and Research Exploiting Sociological Orbits in Mobile Users’ Mobility.
Instructor: Vincent Duffy, Ph.D. Associate Professor Lecture 10: Research, Design & Evaluation Tues. Feb. 20, 2007 IE 486 Work Analysis & Design II.
Sociological Influences on Mobile Wireless Networks Chunming Qiao, Ph.D., Professor University at Buffalo (SUNY) Director, Laboratory for Advanced Network.
School of Computer Science and Information Systems
Role and Place of Statistical Data Analysis and very simple applications Simplified diagram of a scientific research When you know the system: Estimation.
Radial Basis Function Networks
Presented by Tao HUANG Lingzhi XU. Context Mobile devices need exploit variety of connectivity options as they travel. Operating systems manage wireless.
Rutgers: Gayathri Chandrasekaran, Tam Vu, Marco Gruteser, Rich Martin,
Ubiquitous Advertising: the Killer Application for the 21st Century Author: John Krumm Presenter: Anh P. Nguyen
Learning Significant Locations and Predicting User Movement with GPS Daniel Ashbrook and Thad Starner Learning Significant Locations and Predicting User.
Intrusion and Anomaly Detection in Network Traffic Streams: Checking and Machine Learning Approaches ONR MURI area: High Confidence Real-Time Misuse and.
Lucent Technologies – Proprietary Use pursuant to company instruction Learning Sequential Models for Detecting Anomalous Protocol Usage (work in progress)
1. Introduction Generally Intrusion Detection Systems (IDSs), as special-purpose devices to detect network anomalies and attacks, are using two approaches.
BreadCrumbs: Forecasting Mobile Connectivity Presented by Hao He Slides adapted from Dhruv Kshatriya Anthony J. Nicholson and Brian D. Noble.
6 am 11 am 5 pm Fig. 5: Population density estimates using the aggregated Markov chains. Colour scale represents people per km. Population Activity Estimation.
EXTRACT: MINING SOCIAL FEATURES FROM WLAN TRACES: A GENDER-BASED CASE STUDY By Udayan Kumar Ahmed Helmy University of Florida Presented by Ahmed Alghamdi.
APT: Accurate Outdoor Pedestrian Tracking with Smartphones TsungYun
Comparison of Data-driven Link Estimation Methods in Low-power Wireless Networks Hongwei Zhang Lifeng Sang Anish Arora.
CS380y Junior Thesis1 The Performance of TCP/IP over Bluetooth Chris Snow Supervisors: Serguei Primak, Electrical Engineering Hanan Lutfiyya, Computer.
Mirco Nanni, Roberto Trasarti, Giulio Rossetti, Dino Pedreschi Efficient distributed computation of human mobility aggregates through user mobility profiles.
Lab for Advanced Network Design, Evaluation and Research “Sociological Orbits” Mobility Profiling and Routing for Mobile Wireless Networks Joy Ghosh Ph.D.
Wei Gao1 and Qinghua Li2 1The University of Tennessee, Knoxville
1 Energy-efficient Localization Via Personal Mobility Profiling Ionut Constandache Co-authors: Shravan Gaonkar, Matt Sayler, Romit Roy Choudhury and Landon.
Tracking with Unreliable Node Sequences Ziguo Zhong, Ting Zhu, Dan Wang and Tian He Computer Science and Engineering, University of Minnesota Infocom 2009.
Bayesian networks Classification, segmentation, time series prediction and more. Website: Twitter:
Inferring High-Level Behavior from Low-Level Sensors Don Peterson, Lin Liao, Dieter Fox, Henry Kautz Published in UBICOMP 2003 ICS 280.
“Sociological Orbits” Mobility Profiling and Routing for Mobile Wireless Networks Hung Q. Ngo Computer Science & Engineering State University of New York.
Lab for Advanced Network Design, Evaluation and Research Mobility Profile based Routing Within Intermittently Connected Mobile Ad hoc Networks (ICMAN)
Report on Intrusion Detection and Data Fusion By Ganesh Godavari.
Who Is Peeping at Your Passwords at Starbucks? To Catch an Evil Twin Access Point DSN 2010 Yimin Song, Texas A&M University Chao Yang, Texas A&M University.
Evaluation of Non-Uniqueness in Contaminant Source Characterization based on Sensors with Event Detection Methods Jitendra Kumar 1, E. M. Zechman 1, E.
Distributed Maintenance of Cache Freshness in Opportunistic Mobile Networks Wei Gao and Guohong Cao Dept. of Computer Science and Engineering Pennsylvania.
Learning and Inferring Transportation Routines By: Lin Liao, Dieter Fox and Henry Kautz Best Paper award AAAI’04.
Copyright © 2012, SAS Institute Inc. All rights reserved. ANALYTICS IN BIG DATA ERA ANALYTICS TECHNOLOGY AND ARCHITECTURE TO MANAGE VELOCITY AND VARIETY,
User Fingerprinting Jeffrey Pang 1 Ben Greenstein 2 Ramakrishna Gummadi 3 Srinivasan Seshan 1 David Wetherall 2,4 Presenter: Nan Jiang Most Slides:
User-Centric Data Dissemination in Disruption Tolerant Networks Wei Gao and Guohong Cao Dept. of Computer Science and Engineering Pennsylvania State University.
Pre-GDB 2014 Infrastructure Analysis Christian Nieke – IT-DSS Pre-GDB 2014: Christian Nieke1.
NextPlace: A Spatio-Temporal Prediction Framework for Pervasive Systems Salvatore Scellato1, Micro Musolesi, Cecilia Mascolo1, Vito Latora, and Andrew.
How Others Compromise Your Location Privacy: The Case of Shared Public IPs at Hotspots N. Vratonjic, K. Huguenin, V. Bindschaedler, and J.-P. Hubaux PETS.
Orbital Mobility Profile based Routing in Intermittently Connected Mobile Ad hoc Networks (ICMAN) Joy Ghosh, Hung Ngo, Chunming Qiao ([joyghosh, hungngo,
Chapter 8 Evaluating Search Engine. Evaluation n Evaluation is key to building effective and efficient search engines  Measurement usually carried out.
Dual-Region Location Management for Mobile Ad Hoc Networks Yinan Li, Ing-ray Chen, Ding-chau Wang Presented by Youyou Cao.
Performance of Adaptive Beam Nulling in Multihop Ad Hoc Networks Under Jamming Suman Bhunia, Vahid Behzadan, Paulo Alexandre Regis, Shamik Sengupta.
1 Jong Hee Kang, William Welbourne, Benjamin Stewart, Gaetano Borriello, October 2004, Proceedings of the 2nd ACM international workshop on Wireless mobile.
Identifying “Best Bet” Web Search Results by Mining Past User Behavior Author: Eugene Agichtein, Zijian Zheng (Microsoft Research) Source: KDD2006 Reporter:
Optimizing the Location Obfuscation in Location-Based Mobile Systems Iris Safaka Professor: Jean-Pierre Hubaux Tutor: Berker Agir Semester Project Security.
EASE: An Energy-Efficient In-Network Storage Scheme for Object Tracking in Sensor Networks Jianliang Xu Department of Computer Science Hong Kong Baptist.
Data Mining Practical Machine Learning Tools and Techniques By I. H. Witten, E. Frank and M. A. Hall Chapter 5: Credibility: Evaluating What’s Been Learned.
SOLAR Joy Ghosh, Sumesh J. Philip, Chunming Qiao {joyghosh, sumeshjp, Sociological Orbit aware Location Approximation and Routing.
Using the Fisher kernel method to detect remote protein homologies Tommi Jaakkola, Mark Diekhams, David Haussler ISMB’ 99 Talk by O, Jangmin (2001/01/16)
Outline Sensys SensMetrics Solution SensMetrics Performance Measures
WP2 INERTIA Distributed Multi-Agent Based Framework
A survey of network anomaly detection techniques
Presentation transcript:

Sociological Orbit based Mobility Profiling Lab for Advanced Network Design, Evaluation and Research On Profiling Mobility and Predicting Locations of Wireless Users Joy Ghosh Matthew J. Beal Hung Q. Ngo Chunming Qiao

Sociological Orbit based Mobility Profiling LANDER SOLAR: Outline Introduction Mobility Traces Orbital Mobility Profiling Location Prediction Performance Results Comparison with contemporary work Other Applications of Mobility Profiling Future Directions

Sociological Orbit based Mobility Profiling LANDER SOLAR: Mobile Users influenced by social routines visit a few “hubs” / places (outdoor/indoor) regularly “orbit” around (fine to coarse grained) hubs at several levels

Sociological Orbit based Mobility Profiling LANDER SOLAR: Hub Based Mobility Profiles and Prediction On any given day, a user may regularly visit a small number of “hubs” (e.g., locations A and B) Each mobility profile is a weighted list of hubs, where weight = hub visit probability (e.g., 70% A and 50% B) In any given period (e.g., week), a user may follow a few such “mobility profiles” (e.g., P1 and P2) Each profile is in turn associated with a (daily) probability (e.g., 60% P1 and 40% P2) Example: P1={A=0.7, B=0.5} and P2={B=0.9, C=0.6}  On an ordinary day, a user may go to locations A, B and C with the following probabilities, resp.: 0.42 (=0.6x0.7), 0.66 (= 0.6x ) and 0.24 (=0.4x0.6)  20% more accurate than simple visit-frequency based prediction  Knowing exactly which profile a user will follow on a given day can result in even more accurate prediction On any given day, a user may regularly visit a small number of “hubs” (e.g., locations A and B) Each mobility profile is a weighted list of hubs, where weight = hub visit probability (e.g., 70% A and 50% B) In any given period (e.g., week), a user may follow a few such “mobility profiles” (e.g., P1 and P2) Each profile is in turn associated with a (daily) probability (e.g., 60% P1 and 40% P2) Example: P1={A=0.7, B=0.5} and P2={B=0.9, C=0.6} On an ordinary day, a user may go to locations A, B & C with the following probabilities: 0.42 (=0.6x0.7), 0.66 (= 0.6x ), 0.24 (=0.4x0.6) 20% more accurate than simple visit-frequency based prediction Knowing exactly which profile a user will follow on a given day can result in even more accurate prediction

Sociological Orbit based Mobility Profiling LANDER SOLAR: Applications of Orbital Mobility Profiles Location Predictions and Routing within MANET and ICMAN Anomaly based intrusion detection  unexpected movement (in time or space) sets off an alarm Customizable traffic alerts  alert only the individuals who might be affected by a specific traffic condition Targeted inspection  examine only the persons who have routinely visited specific regions Environmental/health monitoring  identify travelers who can relay data sensed at remote locations with no APs

Sociological Orbit based Mobility Profiling LANDER SOLAR: Categories of Mobility Traces AP-based traces (system logs) collected by APs: MAC ID, AP ID, Time, AP Events  Traces from Dartmouth, ETH Zurich, UNC AP-based traces (system logs) collected by user devices (laptops, PDAs, etc.) and uploaded periodically to central server  Traces from UCSD Pair wise wireless user contact based traces without any location information  HAGGLE project by Intel Research User location traces collected by user devices (based on GPS or other location tracking devices)  Recently available UMassDieselNet traces AP-based traces (system logs) collected by APs: MAC ID, AP ID, Time, AP Events  Traces from Dartmouth, ETH Zurich, UNC AP-based traces (system logs) collected by user devices (laptops, PDAs, etc.) and uploaded periodically to central server  Traces from UCSD Pair wise wireless user contact based traces without any location information  HAGGLE project by Intel Research User location traces collected by user devices (based on GPS or other location tracking devices)  Recently available UMassDieselNet traces The last category is most appropriate for our study, but we started our work with the first category, which was more accessible

Sociological Orbit based Mobility Profiling LANDER SOLAR: Traces Used Profiling techniques applied to ETH Zurich traces  Duration of 1 year from 4/1/04 till 3/31/05  13,620 wireless users, 391 APs, 43 buildings  Grouped users into 6 groups based on degree of activity  Selected one sample (most active) user from each group Mapped APs into buildings based on AP’s coordinates, and each building becomes a “hub”  Converted AP-based traces into hub-based traces Other traces  Expect similar results from Dartmouth’s traces  No sufficient AP location info from other traces  UMass’s traces are for buses, more predictable than users  Need to obtain actual users’ traces with GPS

Sociological Orbit based Mobility Profiling LANDER SOLAR: Orbital Mobility Profiling Obtain each user’s daily hub lists as binary vectors Represent each hub list (binary vector) as a point in a n-dimensional space (n = total number of hubs) Cluster these points into multiple clusters, each with a mean  Using the Expectation-Maximization (EM) algorithm based on a Mixture of Bernoulli’s distribution  Probe other classification methods: Bayesian-Bernoulli’s Each cluster mean represents a mobility profile, described as a probabilistic hub visitation list User’s mobility is aptly modeled using a mixture of mobility profiles with certain “mixing proportions”

Sociological Orbit based Mobility Profiling LANDER SOLAR: Profiling illustration Obtain daily hub stay durations Translate to binary hub visitation vectors Apply clustering algorithm to find mixture of profiles

Sociological Orbit based Mobility Profiling LANDER SOLAR: Profile parameters for all sample users

Sociological Orbit based Mobility Profiling LANDER SOLAR: Hub-based Location Predictions - I Unconditional Hub-visit Prediction  Prediction Error = Incorrect hubs predicted over Total hubs  SPE – Statistical based Prediction Error SPE-ALL: (n+1) th day prediction based on hub-visit frequency from day 1 through day n SPE-W7 : (n+1) th day prediction based on hub-visit frequency within last week, i.e., day (n-7) through day n  PPE – Profile based Prediction Error PPE-W7 : (n+1) th day prediction based on profiles of the last week, i.e., day (n-7) through day n  Prediction Improvement Ration (PIR) PIR-ALL = (SPE-ALL – PPE-W7) / SPE-ALL PIR-W7 = (SPE-W7 – PPE-W7) / SPE-W7

Sociological Orbit based Mobility Profiling LANDER SOLAR: Unconditional Prediction Results The profile mixing proportions vary with every window of n days

Sociological Orbit based Mobility Profiling LANDER SOLAR: Hub-based Location Predictions - II Conditional Hub-visit Prediction  Improvement given current profile is known/identifiable  It is possible sometimes to infer profile from current hub information alone  Our method effectively leverages information when available Sample user categories Target Hub ID: will the user visit this hub?The current day in questionPredicted probability using visit frequency Indicator (Current) HubCurrent ProfilePredicted probability based on profile Actually visited H t on day D or not

Sociological Orbit based Mobility Profiling LANDER SOLAR: Hub-based Location Predictions - III Hub sequence prediction based on hub transitional probability Prediction Accuracy = 1 – (incorrect predictions / total predictions) Scenario 1: only starting hub is known for sequence prediction Scenario 2: hub prediction is corrected at every hub in sequence Better performance with increasing knowledge – intuitive Statistical based Prediction Accuracy (SPA) – no profile informationProfile based Prediction Accuracy (PPA) – no time informationTime based Prediction Accuracy (TPA) – temporal profiles

Sociological Orbit based Mobility Profiling LANDER SOLAR: Comparison with contemporary work Dartmouth – Infocom’06  AP vs hub sequence of visit prediction  Both built directed weighted graph based on AP/hub transition data  AP/hub sequence prediction based on Markov Chain, Moving Average, CDF vs. Profile based in our case  A comparison of these methods would be interesting MobySpace – Infocom 2006  Each axis in the MobySpace can be a location (instead of an AP)  Each location is given a weight based on the frequency of visits  Each user is represented by a point in MobySpace, called MobyPoint, which is like the “cluster mean” (weighted hub list) in our case  We have a mixture of profiles, enabling us to make better predictions

Sociological Orbit based Mobility Profiling LANDER SOLAR: Comparison with contemporary work Intel HAGGLE projects – Infocom’05  May augment contact information with location information. But, every location where a pair come in contact (corridors, stairs) may have no significance later  In our case, we give importance to social behavior and end up with fixed number of sociologically important hubs and only are interested in contacts within them.  It is possible to determine contact probability based on hub movement with a Continuous Time Markov Chain (CTMC) that is provided with hub stay times (that follow a power law distribution) and the hub transitional probabilities  If hubs are equipped with storage, two users sharing a hub in their profile can exchange messages UCL – MSWiM ‘04  Actual mobility modeling based on social network theory  Results from time series analysis will be useful for comparison with our profile based predictions

Sociological Orbit based Mobility Profiling LANDER SOLAR: Future Directions Work with other types of traces Design other clustering/profiling techniques Optimize techniques for mobility profile information dissemination, lifetime, maintenance and query Compare location predictions with other methods based on e.g., time series analysis Study efficient routing algorithms

Sociological Orbit based Mobility Profiling Lab for Advanced Network Design, Evaluation and Research Thank You ! Questions?