Yung-Chih Chen Jim Kurose and Don Towsley Computer Science Department University of Massachusetts Amherst A Mixed Queueing Network Model of Mobility in.

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

IEEE INFOCOM 2004 MultiNet: Connecting to Multiple IEEE Networks Using a Single Wireless Card.
Supporting Cooperative Caching in Disruption Tolerant Networks
Stochastic optimization of service provision with selfish users C.F. Chiasserini, P. Giaccone, E.Leonardi Department of Electronics and Telecommunications.
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.
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
IEEE PIMRC A Comparative Measurement Study of the Workload of Wireless Access Points in Campus Networks Maria Papadopouli Assistant Professor Department.
Delay Tolerant and Opportunistic Networks Past, current and future work
1 William Lee Duke University Department of Electrical and Computer Engineering Durham, NC Analysis of a Campus-wide Wireless Network February 13,
Analysis of a Campus-wide Wireless Network David Kotz Kobby Essien Dartmouth College September 2002.
A Peer-to-Peer On-Demand Streaming Service and Its Performance Evaluation Presenter: Nera Liu Author: Yang Guo, Kyoungwon Suh, Jim Kurose and Don Towsley.
A New Approach for Accurate Modelling of Medium Access Control (MAC) Protocols Presenter: Moshe Zukerman ARC Centre for Ultra Broadband Information Networks.
By Libo Song and David F. Kotz Computer Science,Dartmouth College.
An Authentication Service Based on Trust and Clustering in Wireless Ad Hoc Networks: Description and Security Evaluation Edith C.H. Ngai and Michael R.
Sociological Orbit based Mobility Profiling Lab for Advanced Network Design, Evaluation and Research Exploiting Sociological Orbits in Mobile Users’ Mobility.
IEEE OpComm 2006, Berlin, Germany 18. September 2006 A Study of On-Off Attack Models for Wireless Ad Hoc Networks L. Felipe Perrone Dept. of Computer Science.
Opportunistic Networking (aka Pocket Switched Networking)
Variance of Aggregated Web Traffic Robert Morris MIT Laboratory for Computer Science IEEE INFOCOM 2000’
Component-Based Routing for Mobile Ad Hoc Networks Chunyue Liu, Tarek Saadawi & Myung Lee CUNY, City College.
UNDERSTANDING PERIODICITY AND REGULARITY OF NODAL ENCOUNTERS IN MOBILE NETWORKS: A SPECTRAL ANALYSIS Sungwook Moon, Ahmed Helmy Dept. of Computer and Information.
1 Research Highlights Power-Saving Issues. 2 Outline E. S. Jung and N. Vaidya, “ An Energy Efficient MAC Protocol for Wireless LANs ”, INFOCOM E.
CHINACOM 2006, Beijing, China26 Oct 2006 Osmosis in Pocket Switched Network Pan (Ben) Hui University of Cambridge Computer Laboratory
Modeling client arrivals at access points in wireless campus-wide networks Maria Papadopouli Assistant Professor Department of Computer Science University.
1 Assessing The Real Impact of WLANs: A Large-Scale Comparison of Wired and Wireless Traffic Maria Papadopouli * Assistant Professor Department.
Slide 1 Comparison of Inter-Area Rekeying Algorithms for Secure Mobile Group Communication C. Zhang*, B. DeCleene +, J. Kurose*, D. Towsley* * Dept. Computer.
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.
U NIVERSITY OF M ASSACHUSETTS, A MHERST School of Computer Science Measurement and Modeling of User Transitioning among Networks Sookhyun Yang, Jim Kurose,
Ahmed Helmy Computer and Information Science and Engineering (CISE) Department University of Florida Founder.
Detecting Node encounters through WiFi By: Karim Keramat Jahromi Supervisor: Prof Adriano Moreira Co-Supervisor: Prof Filipe Meneses Oct 2013.
Dartmouth’s Wireless Network May 16, 2005 David W. Bourque.
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.
A Cooperative MAC Protocol for Wireless LAN Pei Liu, Zhifeng Tao, Shivendra S. Panwar Motivation: In the legacy system, source station transmits.
EXTRACT: MINING SOCIAL FEATURES FROM WLAN TRACES: A GENDER-BASED CASE STUDY By Udayan Kumar Ahmed Helmy University of Florida Presented by Ahmed Alghamdi.
Stochastic sleep scheduling (SSS) for large scale wireless sensor networks Yaxiong Zhao Jie Wu Computer and Information Sciences Temple University.
BY MOHAMMED ALQAHTANI (802.11) Security. What is ? IEEE is a set of standards carrying out WLAN computer communication in frequency bands.
Your Friends Have More Friends Than You Do: Identifying Influential Mobile Users Through Random Walks Bo Han, Aravind Srinivasan University of Maryland.
On QoS Guarantees with Reward Optimization for Servicing Multiple Priority Class in Wireless Networks YaoChing Peng Eunyoung Chang.
Find regular encounter pattern from mobile users. Regular encounter indicates an encounter trend that is repetitive and consistent. Using this metric can.
Socially-aware pub-sub system for human networks Yaxiong Zhao Jie Wu Department of Computer and Information Sciences Temple University Philadelphia
1 Delay Tolerant Network Routing Sathya Narayanan, Ph.D. Computer Science and Information Technology Program California State University, Monterey Bay.
Spatio-Temporal Modeling of Traffic Workload in a Campus WLAN Felix Hernandez-Campos 3 Merkouris Karaliopoulos 2 Maria Papadopouli 1,2,3 Haipeng Shen 2.
On Exploiting Transient Contact Patterns for Data Forwarding in Delay Tolerant Networks Wei Gao and Guohong Cao Dept. of Computer Science and Engineering.
A Power Saving MAC Protocol for Wireless Networks Technical Report July 2002 Eun-Sun Jung Texas A&M University, College Station Nitin H. Vaidya University.
Hybrid OFDMA/CSMA Based Medium Access Control for Next- Generation Wireless LANs Yaser Pourmohammadi Fallah, Salman Khan, Panos Nasiopoulos, Hussein Alnuweiri.
Peer Pressure: Distributed Recovery in Gnutella Pedram Keyani Brian Larson Muthukumar Senthil Computer Science Department Stanford University.
Universität Stuttgart Institute of Parallel and Distributed Systems (IPVS) Universitätsstraße 38 D Stuttgart Contact-Based Mobility Metrics for Delay-
IEEE PIMRC Short-term Traffic Forecasting in a Campus-Wide Wireless Network Maria Papadopouli Assistant Professor Department of Computer Science.
PRoPHET+: An Adaptive PRoPHET- Based Routing Protocol for Opportunistic Network Ting-Kai Huang, Chia-Keng Lee and Ling-Jyh Chen.
Characterising the Use of a Campus Wireless Network 徐 志 賢 Paper From: D. Schwab and R.B. Bunt, "Characterising the Use of a Campus Wireless Network", Proc.
NextPlace: A Spatio-Temporal Prediction Framework for Pervasive Systems Salvatore Scellato1, Micro Musolesi, Cecilia Mascolo1, Vito Latora, and Andrew.
TCP with Variance Control for Multihop IEEE Wireless Networks Jiwei Chen, Mario Gerla, Yeng-zhong Lee.
The Changing Usage of a Mature Campus-wide Wireless Network CS525m – Mobile and Ubiquitous Computing Andrew Stone.
ELECTIONEL ECTI ON ELECTION: Energy-efficient and Low- latEncy sCheduling Technique for wIreless sensOr Networks Shamim Begum, Shao-Cheng Wang, Bhaskar.
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,
Chih-Min Chao and Kuo-Hsiang Lu Department of Computer Science and Engineering National Taiwan Ocean University IEEE Sensor Networks, Ubiquitous and Trustworthy.
Efficient Group Key Management in Wireless LANs Celia Li and Uyen Trang Nguyen Computer Science and Engineering York University.
Development of a QoE Model Himadeepa Karlapudi 03/07/03.
Energy Efficient Data Management for Wireless Sensor Networks with Data Sink Failure Hyunyoung Lee, Kyoungsook Lee, Lan Lin and Andreas Klappenecker †
A Low Interference Channel Assignment Algorithm for Wireless Mesh Networks Can Que 1,2, Xinming Zhang 1, and Shifang Dai 1 1.Department of Computer Science.
Weighted Waypoint Mobility Model and Its Impact on Ad Hoc Networks Electrical Engineering Department UNIVERSITY OF SOUTHERN CALIFORNIA USC Kashyap Merchant,
COMP2322 Lab 1 Introduction to Wireless LAN Weichao Li Apr. 8, 2016.
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks Zhao, J.; Cao, G. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 鄭宇辰
National Taiwan University Department of Computer Science and Information Engineering Vinod Namboodiri and Lixin Gao University of Massachusetts Amherst.
Jon Crowcroft Pan Hui Computer Laboratory University of Cambridge
Place Identification in Location Based Urban VANETs
Recognizing Exponential Inter-Contact Time in VANETs
IEEE in the Large: Observations at the IETF Meeting
Dhruv Gupta EEC 273 class project Prof. Chen-Nee Chuah
Ling-Jyh Chen and Ting-Kai Huang
Presentation transcript:

Yung-Chih Chen Jim Kurose and Don Towsley Computer Science Department University of Massachusetts Amherst A Mixed Queueing Network Model of Mobility in a Campus Wireless Network

Motivation Mobility modeling (till now) – Theoretical models Random WayPoint/Walk – Real world user mobility modeling Mobility pattern [Kim’07, Hsu’06] – Contact-based mobility [Chaintreau’06, Hsu’10] – Group-based mobility [Hong’99, Wang’02, Chen’10] Merge/split process [Heimlicher’10] Modeling becomes complicated…. 2

Simple model to capture user behavior – Users moving from AP to AP – Predict system level performance AP occupancy distribution – Predict user level performance Time stay in network Number of visited APs Network dimensioning 3 Goal

4 User Behavior: Campus Network Focus on modeling the period when network more active and heavily used A closer look of this stable period Midnight Early Morning Evening

User Behavior: Campus Network Stay Transition Depart AP i AP j Some “arrive and depart” Some “always” in the network Transitions between APs Stay times at AP Some “arrive and depart” Some “always” in the network Transitions between APs Stay times at AP AP M 5 Arrive

Model 6 AP i AP j AP k AP i AP j AP k M/G/∞ queues

Trace Mobility – User moving from AP to AP – User/AP association/disassociation messages Dartmouth Trace* – 17 weeks on Dartmouth College campus users 550+ Cisco APs – Simple Network Management Protocol (SNMP) Central controller polls each AP every 5 minutes AP replies which clients (MAC addresses) are with it – Know when a user joins network, how long he stays – Infer departure by a user’s absence in the subsequent poll *CRAWDAD archive: 7

Trace (Con’t) Interested in periods most active – Remove weekends/holidays/inter-session breaks – Stable network traffic 9 AM to 5 PM 544 APs with 5,715 distinct MAC addresses 8

Validation: User Occupancy at APs Example: The most heavily loaded AP How about other APs?

Validation: Mean Network Stay Time, #Visited APs Only 5% difference ! Only 1.4% difference ! 10

Network Dimensioning 11

Network Dimensioning -Open 12

Increase of closed population (N ) Network Dimensioning - Closed 13 Must double capacity if N  5N to maintain the same QoS

Conclusion Proposed simple queueing model of mobility – open and closed class users Validated against empirical traces Good predictions of metrics of interest – System-level % accuracy on user occupancy distribution – User-level Mean network stay time: 8 minutes difference # visited APs: 1.4% difference The model can be used for network dimensioning – Increase of arrival rate to each AP – Increase of always active population 14

References W.-j. Hsu, D. Dutta, and A. Helmy. ”Mining behavioral groups in large wireless lans,” Mobicom’07 M. Kim and D. Kotz. “Extracting a mobility model from real user traces,” Infocom’06 A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott. “Impact of human mobility on the design of opportunistic forwarding algorithms,” Infocom’06 W.-j. Hsu and A. Helmy. “On nodal encounter patterns in wireless lan traces,” IEEE Transactions on Mobile Computing’10 S. Heimlicher and K. Salamatian. “Globs in the primordial soup: the emergence of connected crowds in mobile wireless networks” MobiHoc’10. Y.-C. Chen, E. Rosensweig, J. Kurose, and D. Towsley. “Group detection in mobility traces,” IWCMC’10 X. Hong, M. Gerla, G. Pei, C-C. Chiang. “A Group Mobility Model for Ad Hoc Wireless Networks,” IEEE MSWiM’99 K. H. Wang, and B. Li. “Group Mobility and Partition Prediction in Wireless Ad-Hoc Networks,” ICC’02 15

Thanks! ?? || /**/ 16

Departure threshold – User did leave the system and returned – User was in motion, moving from AP 1 to AP 2 – Missing SNMP reports Trace Pre-Processing (Con’t) Session: start w/ first AP association; end w/ disassociating w/ all campus APs S1S1 S2S2 ∆ S’=S 1 + ∆ +S 2 <threshold 17

Multiple associations – In the same 5-minute window, more than 1 AP report a specific user is associated with it – User is in motion, moving from 1 AP to another AP(s) – Keep the last associated AP, and remove all the rest Ping-Pong effect – User associates with a fixed set of AP, one after one but only with very short amount of time – Mainly due to weak Wi-Fi signal – Hard to tell when this happens/ how many APs involved – Treat as regular transitions Trace Pre-Processing (Con’t) 18

Verifying Poisson Assumption 19

User Occupancy at APs 20