UNDERSTANDING PERIODICITY AND REGULARITY OF NODAL ENCOUNTERS IN MOBILE NETWORKS: A SPECTRAL ANALYSIS Sungwook Moon, Ahmed Helmy Dept. of Computer and Information.

Slides:



Advertisements
Similar presentations
Exploring User Social Behavior in Mobile Social Applications Konglin Zhu *, Pan Hui $, Yang Chen *, Xiaoming Fu *, Wenzhong Li + * University of Goettingen,
Advertisements

Supporting Cooperative Caching in Disruption Tolerant Networks
Preference-based Mobility Model and the Case for Congestion Relief in WLANs using Ad hoc Networks Wei-jen Hsu, Kashyap Merchant, Haw-wei Shu, Chih-hsin.
Worm Origin Identification Using Random Moonwalks Yinglian Xie, V. Sekar, D. A. Maltz, M. K. Reiter, Hui Zhang 2005 IEEE Symposium on Security and Privacy.
STAT 497 APPLIED TIME SERIES ANALYSIS
Forwarding Redundancy in Opportunistic Mobile Networks: Investigation and Elimination Wei Gao 1, Qinghua Li 2 and Guohong Cao 3 1 The University of Tennessee,
A Mobile Infrastructure Based VANET Routing Protocol in the Urban Environment School of Electronics Engineering and Computer Science, PKU, Beijing, China.
By Libo Song and David F. Kotz Computer Science,Dartmouth College.
UNDERSTANDING VISIBLE AND LATENT INTERACTIONS IN ONLINE SOCIAL NETWORK Presented by: Nisha Ranga Under guidance of : Prof. Augustin Chaintreau.
A Framework for Classifying Denial of Service Attacks Alefiya Hussain, John Heidemann and Christos Papadopoulos presented by Nahur Fonseca NRG, June, 22.
Report on Intrusion Detection and Data Fusion By Ganesh Godavari.
Muhammad Mahmudul Islam Ronald Pose Carlo Kopp School of Computer Science & Software Engineering Monash University, Australia.
Imperial College LondonFebruary 2007 Bubble Rap: Forwarding in Small World DTNs in Ever Decreasing Circles Part 2 - People Are the Network Jon Crowcroft.
Opportunistic Networking (aka Pocket Switched Networking)
1 Random Trip Stationarity, Perfect Simulation and Long Range Dependence Jean-Yves Le Boudec (EPFL) joint work with Milan Vojnovic (Microsoft Research.
University of Minnesota
1 Drafting Behind Akamai (Travelocity-Based Detouring) AoJan Su, David R. Choffnes, Aleksandar Kuzmanovic, and Fabian E. Bustamante Department of Electrical.
Data Mining By Archana Ketkar.
Optimal Channel Choice for Collaborative Ad-Hoc Dissemination Liang Hu Technical University of Denmark Jean-Yves Le Boudec EPFL Milan Vojnović Microsoft.
10/21/20031 Framework For Classifying Denial of Service Attacks Alefiya Hussain, John Heidemann, Christos Papadopoulos Kavita Chada & Viji Avali CSCE 790.
Choosing an Accurate Network Model using Domain Analysis Almudena Konrad, Mills College Ben Y. Zhao, UC Santa Barbara Anthony Joseph, UC Berkeley The First.
CS401 presentation1 Effective Replica Allocation in Ad Hoc Networks for Improving Data Accessibility Takahiro Hara Presented by Mingsheng Peng (Proc. IEEE.
Yung-Chih Chen Jim Kurose and Don Towsley Computer Science Department University of Massachusetts Amherst A Mixed Queueing Network Model of Mobility in.
Modeling client arrivals at access points in wireless campus-wide networks Maria Papadopouli Assistant Professor Department of Computer Science University.
Mobile App Monetization: Understanding the Advertising Ecosystem Vaibhav Rastogi.
9. Demo Scenario #1 Behavioral profile upon discovering friends/enemies 1)No friends and enemies: search for friends.  Turn by 90 degree and go forward.
Detecting Node encounters through WiFi By: Karim Keramat Jahromi Supervisor: Prof Adriano Moreira Co-Supervisor: Prof Filipe Meneses Oct 2013.
Extracting Places and Activities from GPS Traces Using Hierarchical Conditional Random Fields Yong-Joong Kim Dept. of Computer Science Yonsei.
Pocket Switched Networks: Real-world Mobility and its Consequences for Opportunistic Forwarding Jon Crowcroft,Pan Hui (Ben) Augustin Chaintreau, James.
1 CIS 6930: Workshop III Encounter-based Networks Presenter: Sapon Tanachaiwiwat Instructor: Dr. Helmy 2/5/2007.
TIME SERIES by H.V.S. DE SILVA DEPARTMENT OF MATHEMATICS
EXTRACT: MINING SOCIAL FEATURES FROM WLAN TRACES: A GENDER-BASED CASE STUDY By Udayan Kumar Ahmed Helmy University of Florida Presented by Ahmed Alghamdi.
UNIVERSITY of NOTRE DAME COLLEGE of ENGINEERING Preserving Location Privacy on the Release of Large-scale Mobility Data Xueheng Hu, Aaron D. Striegel Department.
Gender based analysis Udayan Kumar Computer and Information Science and Engineering (CISE) Department, University Of Florida, Gainesville, FL.
Wei Gao1 and Qinghua Li2 1The University of Tennessee, Knoxville
Location Management in Cellular Networks: Classification of the Most Important Paradigms, Realistic Simulation Framework, and Relative Performance Analysis.
Power Save Mechanisms for Multi-Hop Wireless Networks Matthew J. Miller and Nitin H. Vaidya University of Illinois at Urbana-Champaign BROADNETS October.
Extract: Mining Social Features from WLAN Traces A Gender-Based Case Study Udayan Kumar and Ahmed Helmy Computer and Information Sciences and Engineering,
Find regular encounter pattern from mobile users. Regular encounter indicates an encounter trend that is repetitive and consistent. Using this metric can.
IEEE Globecom 2010 Tan Le Yong Liu Department of Electrical and Computer Engineering Polytechnic Institute of NYU Opportunistic Overlay Multicast in Wireless.
Prediction Assisted Single-copy Routing in Underwater Delay Tolerant Networks Zheng Guo, Bing Wang and Jun-Hong Cui Computer Science & Engineering Department,
1 Mobility Increases the Capacity of Ad-hoc Wireless Networks Matthias Grossglauser, David Tse IEEE Infocom 2001 (Best paper award) Oct 21, 2004 Som C.
Report on Intrusion Detection and Data Fusion By Ganesh Godavari.
INTERACTIVE ANALYSIS OF COMPUTER CRIMES PRESENTED FOR CS-689 ON 10/12/2000 BY NAGAKALYANA ESKALA.
Distributed Maintenance of Cache Freshness in Opportunistic Mobile Networks Wei Gao and Guohong Cao Dept. of Computer Science and Engineering Pennsylvania.
On Exploiting Transient Contact Patterns for Data Forwarding in Delay Tolerant Networks Wei Gao and Guohong Cao Dept. of Computer Science and Engineering.
How Small Labels create Big Improvements April Chan-Myung Kim
Wide-scale Botnet Detection and Characterization Anestis Karasaridis, Brian Rexroad, David Hoeflin In First Workshop on Hot Topics in Understanding Botnets,
Exploiting Context Analysis for Combining Multiple Entity Resolution Systems -Ramu Bandaru Zhaoqi Chen Dmitri V.kalashnikov Sharad Mehrotra.
User-Centric Data Dissemination in Disruption Tolerant Networks Wei Gao and Guohong Cao Dept. of Computer Science and Engineering Pennsylvania State University.
A Framework for Classifying Denial of Service Attacks Alefiya Hussain, John Heidemann, Christos Papadopoulos Reviewed by Dave Lim.
The Changing Usage of a Mature Campus-wide Wireless Network CS525m – Mobile and Ubiquitous Computing Andrew Stone.
Sungwook Moon, Ahmed Helmy 1 Mobile Testbeds with an Attitude Thanks to all the NOMAD group members for their great helps (U. Kumar, Y. Wang, G. Thakur,
1 Utilizing Shared Vehicle Trajectories for Data Forwarding in Vehicular Networks IEEE INFOCOM MINI-CONFERENCE Fulong Xu, Shuo Gu, Jaehoon Jeong, Yu Gu,
Frequency Analysis of Protocols Dr. Craig Partridge BBN Technologies.
© 2008 Frans Ekman Mobility Models for Mobile Ad Hoc Network Simulations Frans Ekman Supervisor: Jörg Ott Instructor: Jouni Karvo.
KAIS T Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua MobiCom ‘05 Presentation by.
Brief Announcement : Measuring Robustness of Superpeer Topologies Niloy Ganguly Department of Computer Science & Engineering Indian Institute of Technology,
On Exploiting Transient Social Contact Patterns for Data Forwarding in Delay-Tolerant Networks 1 Wei Gao Guohong Cao Tom La Porta Jiawei Han Presented.
Speaker : Yu-Hui Chen Authors : Dinuka A. Soysa, Denis Guangyin Chen, Oscar C. Au, and Amine Bermak From : 2013 IEEE Symposium on Computational Intelligence.
Identifying “Best Bet” Web Search Results by Mining Past User Behavior Author: Eugene Agichtein, Zijian Zheng (Microsoft Research) Source: KDD2006 Reporter:
Distinguishing humans from robots in web search logs preliminary results using query rates and intervals Omer Duskin Dror G. Feitelson School of Computer.
1 Patterns of Cascading Behavior in Large Blog Graphs Jure Leskoves, Mary McGlohon, Christos Faloutsos, Natalie Glance, Matthew Hurst SDM 2007 Date:2008/8/21.
Weighted Waypoint Mobility Model and Its Impact on Ad Hoc Networks Electrical Engineering Department UNIVERSITY OF SOUTHERN CALIFORNIA USC Kashyap Merchant,
Jon Crowcroft Pan Hui Computer Laboratory University of Cambridge
1 Exploiting Friendship Relations for Efficient Routing in Mobile Social Networks Eyuphan Bulut, Student Member, IEEE, and Boleslaw K Szymanski, Fellow,
Advanced Wireless Networks
Wireless Epidemic The wireless epidemic (Nature 449, ; 2007) by Jon Kleinberg ‘Digital traffic flows not only over the wired backbone of the Internet,
Feifei Li, Ching Chang, George Kollios, Azer Bestavros
Ling-Jyh Chen and Ting-Kai Huang
Presentation transcript:

UNDERSTANDING PERIODICITY AND REGULARITY OF NODAL ENCOUNTERS IN MOBILE NETWORKS: A SPECTRAL ANALYSIS Sungwook Moon, Ahmed Helmy Dept. of Computer and Information Science and Engineering University of Florida 1

Contents 2  Introduction  Data sets  Methodology  Time Series Representation  Auto Correlation  Spectral Analysis  Periodicity in Nodal Encounter  Regular Encounters  Applications & Related Work  Conclusions & Future Work

Introduction  Network Environment  Mobile networks Communication via wireless signal between the mobile nodes  Basic Definitions  Mobile Nodes An entity that can move around with wireless communication devices (e.g. PDA, smartphone)  Encounter (contact) [2][3] Two mobile nodes present within the wireless communication range. (e.g. Bluetooth discovery) Encounter and contact are used interchangeably in literatures 3

Introduction  Assumption  Encounter in WLAN Mobile users using the same access points at the same time. Commonly used assumption in other literatures [1][3]  Bluetooth encounter Detected by Bluetooth beacon signal. 4 [1] Augustin Chaintreau, Pan Hui, Jon Crowcroft, Christophe Diot, Richard Gass, and James Scott. Impact of human mobility on the design of opportunistic forwarding algorithms. In Proc. IEEE INFOCOM, Apr [3] W. Hsu, D. Dutta, and A. Helmy. Mining behavioral groups in large wireless lans. In Proc. ACM MobiCom, Sep 2007.

Introduction  Motivations  Efficient and intelligent deployment of mobile networks requires deep knowledge on behavioral pattern of mobile nodes.  Yet, our understanding about the behavioral pattern of mobile nodes is mainly limited to mobility and aggregate information analysis of encounter.  Challenges  Identifying the important spaces to explore among multiple dimensions of variables to understand the behavior of mobile nodes.  Processing different forms of data sets to derive generic encounter behavior of mobile nodes. 5

Overview 6  Problem Statement  Can we identify encounter pattern of mobile users? What are the important dimensional spaces to explore? How to analyze periodicity of mobile encounter? Can we utilize the identified characteristics of encounter pattern?

Introduction 7  Encounter Pattern  Critical information for mobile networking that directly transfers data in the event of encounter. (e.g. Bluetooth data transfer between two nodes).  No need of location information.  Type of analysis  Encountered pairs (i, j) Encounter of two mobile nodes, i and j  Individual nodal encounter Aggregate encounter information for each mobile node

Data Sets Trace SourceTrace DurationAnalyzed Duration Collecting Devices Encounter Pairs USC2006 Jan-May 2007 Jan-May 2008 Jan-May 128 days28,173 35,274 42,587 25,359,454 19,057,089 31,289,100 UF2007 Aug-Dec 2008 Jan-May 128 days46,115 50,549 12,493,403 16,807,427 Montreal2004 Aug-Dec128 days4552,512 Bluetooth2008 Feb-Mar 2008 Nov 256 hours ,277 1,655 8

Data Sets 9  Example trace format  Processed WLAN trace format  Encounter trace format for pair (i, j) MAC *APStartDuration 00:aa:bb:3a:4b:5clbw343-win-ap MAC (i)MAC (j)StartDuration 00:aa:bb:3a:4b:5c3c:5a:4b:de:a2:f * MAC address is anonymized before processing.

Contents 10  Introduction  Data sets  Methodology  Time Series Representation  Auto Correlation  Spectral Analysis  Periodicity in Nodal Encounter  Regular Encounters  Applications & Related Work  Conclusions & Future Work

Periodicity  Methodology  Transform a variety of network traces to encounter trace in a form of time series data.  Analyze periodicity by applying power spectral analysis (autocorrelation(ACF) + Fourier transform).  Practice of power spectral analysis Analysis of stock market [7] Analysis of Network traffic [4] 11 [4] Alefiya Hussain, John Heidemann, and Christos Papadopoulos. Identification of repeated denial of service attacks. In Proc. IEEE INFOCOM, Apr [7] C. Chatfield. Analysis of Time Series, pages 18–24, 105–134. Chapman and Hall, 1989.

Periodicity  Time Domain Representation of Encountered Pattern  Daily encounter Binary process, = 1, for each encounter count on time d, where d = day (1,2,…T); otherwise = 0  In our extended report, we analyze about the encounter frequency and encounter duration as well.  Example time series data of daily encounter for an encounter pair (i, j) 12 * Sungwook Moon and Ahmed Helmy. Understanding periodicity and regularity of nodal encounters in mobile networks. Technical report, Aug 2010, arxXv: d (days)

Periodicity 13  Example time series data of daily encounter for an encountered pair (i, j) 0 1 d (days)

Periodicity 14  Daily encounter rate  Let be a daily encounter for a pair (i, j), such that where T is the observed period.  Analyzing by the encounter rate  Rarely encountering pattern takes up majority of encounter pairs; thus, may hinder other patterns in overall observation if analyzed together.  Therefore, we analyze the encounter pairs by the groups of different encounter rate. Rarely encountering pairs: (0.1 ≤ D rate < 0.2) Frequently encountering pairs: (0.5 ≤ D rate < 0.6)

 Auto Correlation Function (ACF)  Apply ACF to the time-domain representation of encounter data to find repetitive patterns.  ACF (Auto Correlation Function): a measure of how similar the stream of data is to itself shifted in time by lag k. k: lag, d: day; T: overall time; λ: avg. encounter rate Periodicity 15

Periodicity (encounter pairs) 16  Various encounter pattern is showing but weekly encounter pattern (lag = 7) shows the strongest pattern.  Some of other lags (i.e. lag =14 and 21) are artifacts of a smaller lag (i.e. lag=7) Figure. Autocorrelation coefficient for each lag at USC encounter trace.

Periodicity  Conversion to frequency domain representation  Converting from time domain to frequency domain shows dominant repetitive pattern more clearly while filtering out the artifacts.  Apply Fourier transform to convert time series data to the frequency domain. c: frequency component 17

Periodicity 18  Frequency domain graph  X axis: frequency component number of replicas over the observed period of time e.g. peak observed at 18 of the X-axis indicates that certain pattern has repeated for 18 times over the observed period of time (128 days).  Y axis: normalized frequency magnitude in probability density.

Contents 19  Introduction  Data sets  Methodology  Time Series Representation  Auto Correlation  Spectral Analysis  Periodicity in Nodal Encounter  Regular Encounters  Applications & Related Work  Conclusions & Future Work

Periodicity (encounter pairs) 20  Weekly encounter pattern is very strong. (see around 18 at frequency component) Figure. Normalized frequency magnitude for the rarely encountering pairs (0.1 ≤ D rate < 0.2) 18

Periodicity (encounter pairs) 21 Figure. Normalized frequency magnitude for the frequently encountering pairs (0.5 ≤ D rate < 0.6)  Weekly encounter pattern is still strong but weaker than rarely encountering pairs.  This frequency of different periodicities can be used for profiling mobile nodes.

Periodicity (individual node) 22  Weekly encounter pattern is stronger than encounter pairs. (see around 18 at frequency component) Figure. Normalized frequency magnitude for the rarely encountering nodes (0.1 ≤ D rate < 0.2)

Periodicity (individual node) 23  Weekly encounter pattern is stronger than encounter pairs. (see around 18 at frequency component) Figure. Normalized frequency magnitude for the frequently encountering nodes (0.5 ≤ D rate < 0.6)

Periodicity (individual node) 24  Bluetooth Encounter  Daily encounter pattern is observed. Figure. Individual Bluetooth encounter pattern for the encountered pairs at UF Bluetooth trace (hourly encounter rate)

Contents 25  Introduction  Data sets  Methodology  Time Series Representation  Auto Correlation  Spectral Analysis  Periodicity in Nodal Encounter  Regular Encounters  Applications & Related Work  Conclusions & Future Work

Regularity  Preliminary investigation.  Utilize periodic properties of encounter pairs.  Regular encounter pattern is stable and consistent pattern over the period of observed time.  E.g. consistent repetition of certain pattern over time.  Discover the pairs showing regular encounter pattern from the periodicity analysis.  Trace analyzed: USC 2006 spring d (days) 128

Regularity  Knee appears in the 0.8 area  Approaches to find regularly encountering pairs:  If peak frequency magnitude is in the top 20% in the group.  Regularly encountering pairs show distinctly stronger periodicity with higher frequency magnitude for their top frequency component. 27  Figure. Empirical CDF of the top peaks by daily encounter rate USC 2006 trace

Regularity  Empirical heuristic approaches (preliminary)  Approach #1: Extracting regularly encountering pairs. Choose the pairs whose peak frequency magnitude (top peak) is in the top 20% for peak frequency magnitude of all the pairs. Max 1 = max( ) ≥ θ, where θ is threshold for the top 20 % peak frequency magnitude where  Approach #2: Extracting regularly encountering pairs. Pick top three magnitudes whose sum of frequency magnitudes takes over 30% of overall sum of frequency magnitudes. Max 1 + Max2+Max3 ≥ 0.3 * sum( ), where 28

Regularity 29  Behavioral pattern of regularly encountering pairs (on-going investigation )  Different location access pattern is observed among regularly encounter pairs and normal pairs.  Each of approach #1 and #2 show similar location access pattern.  Figure. Location (AP) access preference by general pairs vs regular pairs (approach #1 = top 20 percent, approach #2 = top 3 frequency magnitudes)

Contents 30  Introduction  Data sets  Methodology  Time Series Representation  Auto Correlation  Spectral Analysis  Periodicity in Nodal Encounter  Regular Encounters  Applications & Related Work  Conclusions & Future Work

Application 31  Develop realistic encounter model.  Profiling mobile nodes based on periodic property and embed profile to simulated node or robot node to emulate human behavior. * * Sungwook Moon and Ahmed Helmy. Mobile Testbeds with an Attitude. IEEE GlobeCom, Demo session, Dec 2010.

Application 32  Classify the mobile users by regularity to create a stable overlay networks. A D B C E F ε (BD) ε (BE) ε (EF) ε (BC) ε (AB) ε (AC) ε (CD) ε (CF) Regular encounter Non-Regular encounter ε: regularity metric

Related Work 33  Periodicity  Spectral analysis is used in network traffic analysis to discover similar footprints of DDOS attack. [4]  Periodicity study for activities at APs discovers strong periodicity from aggregate APs access pattern and mobility diameter of mobile nodes. [5] [4] Alefiya Hussain, John Heidemann, and Christos Papadopoulos. Identification of repeated denial of service attacks. In Proc. IEEE INFOCOM, Apr [5] Minkyong Kim and David F. Kotz. Periodic properties of user mobility and access- point popularity. Personal and Ubiquitous Computing, Springer-Verlag, 11, Aug Our work is unique in that we use spectral analysis to analyze encounter pairs and individual encounter pattern.

Related Work 34  Encounter: Inter-contact time follows power- law distribution from an analysis of 200 mobile users. [2]  Regularity: Researchers indicate that discovering regular pattern can be useful in predicting behaviors to help routing decision. [6] [2] Thomas Karagiannis, Jean-Yves Le Boudec, and Milan Vojnovic. Power law and exponential decay of inter contact times between mobile devices. In Proc. ACM MobiCom, Sep [6] Pan Hui and Jon Crowcroft. Human mobility models and opportunistic communication system design. Royal Society Philosophical Transactions, (366):1872, Jun We analyze the extensive network trace with diverse set of mobile users. Our regularity analysis can help to make an informed decision in predicting encounter behavior.

Contents 35  Introduction  Data sets  Methodology  Time Series Representation  Auto Correlation  Spectral Analysis  Periodicity in Nodal Encounter  Regular Encounters  Applications & Related Work  Conclusions & Future Work

Conclusions 36  Contribution  Analyze the encounter pattern for extensive network traces for more than 50,000 mobile users and find mathematical methodology to study periodicity of encounter pattern.  Observe strong periodicity, particularly weekly encounter pattern, for rarely encountering pairs and individual encounter pattern.  Propose two empirical heuristic approaches to discover regularly encounter pattern, and discover regularly encountering pairs show different location visiting behavior than normal pairs.

Future Work  Analyze periodicity of inter-contact time and location access pattern.  Investigation and validation of the methods to discover regular encounter pattern on the diverse set of traces.  Classifying the encountered pairs by periodicity to use in profiling and modeling encounter pattern. 37

References 38 [1] Augustin Chaintreau, Pan Hui, Jon Crowcroft, Christophe Diot, Richard Gass, and James Scott. Impact of human mobility on the design of opportunistic forwarding algorithms. In Proc. IEEE INFOCOM, Apr [2] Thomas Karagiannis, Jean-Yves Le Boudec, and Milan Vojnovic. Power law and exponential decay of inter contact times between mobile devices. In Proc. ACM MobiCom, Sep [3] W. Hsu, D. Dutta, and A. Helmy. Mining behavioral groups in large wireless lans. In Proc. ACM MobiCom, Sep [4] Alefiya Hussain, John Heidemann, and Christos Papadopoulos. Identification of repeated denial of service attacks. In Proc. IEEE INFOCOM, Apr [5] Minkyong Kim and David F. Kotz. Periodic properties of user mobility and access-point popularity. Personal and Ubiquitous Computing, Springer-Verlag, 11, Aug [6] Pan Hui and Jon Crowcroft. Human mobility models and opportunistic communication system design. Royal Society Philosophical Transactions, (366):1872, Jun [7] C. Chatfield. Analysis of Time Series, pages 18–24, 105–134. Chapman and Hall, [8] Sungwook Moon and Ahmed Helmy. Understanding periodicity and regularity of nodal encounters in mobile networks. Technical report, Aug 2010, arxXv: [9] Sungwook Moon and Ahmed Helmy. Mobile Testbeds with an Attitude. IEEE GlobeCom, Demo session, Dec 2010.

Questions  Thank you. 39