1 Perfect Simulation and Stationarity of a Class of Mobility Models Jean-Yves Le Boudec (EPFL) Milan Vojnovic (Microsoft Research Cambridge)

Slides:



Advertisements
Similar presentations
1 Perfect Simulation and Stationarity of a Class of Mobility Models Jean-Yves Le Boudec (EPFL) & Milan Vojnovic (Microsoft Research Cambridge) IEEE Infocom.
Advertisements

Random Trip Mobility Models Jean-Yves Le Boudec EPFL Tutorial ACM Mobicom 2006 Milan Vojnović Microsoft Research Cambridge.
Milan Vojnović Joint work with: Jean-Yves Le Boudec Workshop on Clean Slate Network Design, Cambridge, UK, Sept 18, 2006 On the Origins of Power Laws in.
Part VI NP-Hardness. Lecture 23 Whats NP? Hard Problems.
Impact of Interference on Multi-hop Wireless Network Performance Kamal Jain, Jitu Padhye, Venkat Padmanabhan and Lili Qiu Microsoft Research Redmond.
1 Analysis of Random Mobility Models with PDE's Michele Garetto Emilio Leonardi Politecnico di Torino Italy MobiHoc Firenze.
Solving Problem by Searching
Alternative Simulation Core for Material Reliability Assessments Speculation how to heighten random character of probability calculations (concerning the.
CSE 380 – Computer Game Programming Pathfinding AI
CHAPTER 2 D IRECT M ETHODS FOR S TOCHASTIC S EARCH Organization of chapter in ISSO –Introductory material –Random search methods Attributes of random search.
Generated Waypoint Efficiency: The efficiency considered here is defined as follows: As can be seen from the graph, for the obstruction radius values (200,
SLAW: A Mobility Model for Human Walks Lee et al..
Understanding The Simulation Of Mobility Models with Palm Calculus Jean-Yves Le Boudec EPFL UMD-ISR- February 2007 Milan Vojnović Microsoft Research Cambridge.
ODE and Discrete Simulation or Mean Field Methods for Computer and Communication Systems Jean-Yves Le Boudec EPFL MLQA, Aachen, September
Simulation Where real stuff starts. ToC 1.What, transience, stationarity 2.How, discrete event, recurrence 3.Accuracy of output 4.Monte Carlo 5.Random.
1 The Random Trip Mobility Model Milan Vojnovic (Microsoft Research) Computer Lab Seminar, University of Cambridge, UK, Nov 2004 with Jean-Yves Le Boudec.
Evaluate IEEE e EDCA Performance Tyler Ngo CMPE 257.
Stable mobility models for MANETS Kim Blackmore Roy Timo (DE/NICTA) Leif Hanlen (NICTA)
Sampling from Large Graphs. Motivation Our purpose is to analyze and model social networks –An online social network graph is composed of millions of.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Mobile Ad Hoc Networks Mobility (II) 11th Week
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Mobile Ad Hoc Networks Mobility (III) 12th Week
1 Random Trip Stationarity, Perfect Simulation and Long Range Dependence Jean-Yves Le Boudec (EPFL) joint work with Milan Vojnovic (Microsoft Research.
Palm Calculus Made Easy The Importance of the Viewpoint JY Le Boudec Illustration : Elias Le Boudec.
1 Simulation de modèles de mobilité : paradoxes et étrangetés Jean-Yves Le Boudec EPFL En collaboration avec Milan Vojnović Microsoft Research.
Performance Comparison of Existing Leader Election Algorithms for Dynamic Networks Mobile Ad Hoc (Dynamic) Networks: Collection of potentially mobile computing.
General Ripple Mobility Model Chun-Hung Chen Dept. of CSIE National Taipei University of Technology.
Mobility Models in Mobile Ad Hoc Networks Chun-Hung Chen 2005 Mar 8 th Dept. of Computer Science and Information Engineering National Taipei University.
1 A Class Of Mean Field Interaction Models for Computer and Communication Systems Jean-Yves Le Boudec EPFL – I&C – LCA Joint work with Michel Benaïm.
Optimal Channel Choice for Collaborative Ad-Hoc Dissemination Liang Hu Technical University of Denmark Jean-Yves Le Boudec EPFL Milan Vojnović Microsoft.
1 Uniform Sampling from the Web via Random Walks Ziv Bar-Yossef Alexander Berg Steve Chien Jittat Fakcharoenphol Dror Weitz University of California at.
1 Modeling and Simulating Networking Systems with Markov Processes Tools and Methods of Wide Applicability ? Jean-Yves Le Boudec
Correctness of Gossip-Based Membership under Message Loss Maxim Gurevich, Idit Keidar Technion.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces Lydia E. Kavraki Petr Švetka Jean-Claude Latombe Mark H. Overmars Presented.
Mean Field Methods for Computer and Communication Systems Jean-Yves Le Boudec EPFL ACCESS Distinguished Lecture Series, Stockholm, May 28,
Routing Protocol Evaluation David Holmer
Neural Networks Ellen Walker Hiram College. Connectionist Architectures Characterized by (Rich & Knight) –Large number of very simple neuron-like processing.
WALKING IN FACEBOOK: A CASE STUDY OF UNBIASED SAMPLING OF OSNS junction.
Materials Process Design and Control Laboratory MULTISCALE MODELING OF ALLOY SOLIDIFICATION LIJIAN TAN NICHOLAS ZABARAS Date: 24 July 2007 Sibley School.
Pending Interest Table Sizing in Named Data Networking Luca Muscariello Orange Labs Networks / IRT SystemX G. Carofiglio (Cisco), M. Gallo, D. Perino (Bell.
Game-Theoretic Analysis of Mobile Network Coverage David K.Y. Yau.
Simulation Tutorial By Bing Wang Assistant professor, CSE Department, University of Connecticut Web site.
Adrian Treuille, Seth Cooper, Zoran Popović 2006 Walter Kerrebijn
Palm Calculus Made Easy The Importance of the Viewpoint JY Le Boudec 1.
1 On the Levy-walk Nature of Human Mobility Injong Rhee, Minsu Shin and Seongik Hong NC State University Kyunghan Lee and Song Chong KAIST.
UNIVERSITY OF SOUTHERN CALIFORNIA PATHS: Analysis of PATH Duration Statistics and their Impact on Reactive MANET Routing Protocols Narayanan Sadagopan.
Seminar on random walks on graphs Lecture No. 2 Mille Gandelsman,
© 2008 Frans Ekman Mobility Models for Mobile Ad Hoc Network Simulations Frans Ekman Supervisor: Jörg Ott Instructor: Jouni Karvo.
Kun-chan Lan and Chien-Ming Chou National Cheng Kung University
PRIN WOMEN PROJECT Research Unit: University of Naples Federico II G. Ferraiuolo
Mobility Models for Wireless Ad Hoc Network Research EECS 600 Advanced Network Research, Spring 2005 Instructor: Shudong Jin March 28, 2005.
Chapter 14 : Modeling Mobility Andreas Berl. 2 Motivation  Wireless network simulations often involve movements of entities  Examples  Users are roaming.
A Standard Measure of Mobility for Evaluating Mobile Ad Hoc Network Performance By Joseph Charboneau Karthik Raman.
V.M. Sliusar, V.I. Zhdanov Astronomical Observatory, Taras Shevchenko National University of Kyiv Observatorna str., 3, Kiev Ukraine
1 Random Walks on the Click Graph Nick Craswell and Martin Szummer Microsoft Research Cambridge SIGIR 2007.
A New Class of Mobility Models for Wireless Mobile Communication Networks Joshua Gabet Advisor: Carl Baum Clemson University SURE 2005.
1 HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity Christian Schindelhauer Algorithms for Radio Networks Winter Term 2005/2006.
Kevin Stevenson AST 4762/5765. What is MCMC?  Random sampling algorithm  Estimates model parameters and their uncertainty  Only samples regions of.
Copyright © 2002 OPNET Technologies, Inc. 1 Random Waypoint Mobility Model Empirical Analysis of the Mobility Factor for the Random Waypoint Model 1542.
A New Class of Mobility Models for Ad Hoc Wireless Networks Rahul Amin Advisor: Dr. Carl Baum Clemson University SURE 2006.
Random Sampling Algorithms with Applications Kyomin Jung KAIST Aug ERC Workshop.
Mean Field Methods for Computer and Communication Systems Jean-Yves Le Boudec EPFL Network Science Workshop Hong Kong July
Krishnendu ChatterjeeFormal Methods Class1 MARKOV CHAINS.
Node Distribution of a New Scalable Mobility Model for Ad Hoc Wireless Networks Sheeraz Ahmad.
SLAW: A Mobility Model for Human Walks
Jérôme Härri, Fethi Filali, Christian Bonnet
What is Mobile Network? Why is it called Ad Hoc?
Floating Content in Vehicular Ad-hoc Networks
Haim Kaplan and Uri Zwick
Slides for Sampling from Posterior of Shape
Where real stuff starts
Presentation transcript:

1 Perfect Simulation and Stationarity of a Class of Mobility Models Jean-Yves Le Boudec (EPFL) Milan Vojnovic (Microsoft Research Cambridge)

2 Contents 1.Issues with mobility models 2.The random Trip Model 3.Stability 4.Perfect Simulation

3 Mobility models are used to evaluate system designs  Simplest example: random waypoint: Mobile picks next waypoint M n uniformly in area, independent of past and present Mobile picks next speed V n uniformly in [v min ; v max ] independent of past and present Mobile moves towards M n at constant speed V n M n-1 MnMn

4 Issues with this simple Model  Distributions of speed, location, distances, etc change with simulation time: Distributions of speeds at times 0 s and 2000 s Samples of location at times 0 s and 2000 s Sample of instant speed for one and average of 100 users

5 Why does it matter ?  A (true) example: Compare impact of mobility on a protocol: Experimenter places nodes uniformly for static case, according to random waypoint for mobile case Finds that static is better  Q. Find the bug !  A. In the mobile case, the nodes are more often towards the center, distance between nodes is shorter, performance is better  The comparison is flawed. Should use for static case the same distribution of node location as random waypoint. Is there such a distribution to compare against ? Random waypoint Static

6 Issues with Mobility Models  Is there a stable distribution of the simulation state ( = Stationary regime) reached if we run the simulation long enough ?  If so, how long is long enough ? If it is too long, is there a way to get to the stable distribution without running long simulations (perfect simulation)

7 Contents 1.Issues with mobility models 2.The random Trip Model 3.Stability 4.Perfect Simulation

8 The Random Trip model  Goals: define mobility models 1.That are feature rich, more realistic 2.For which we can solve the issues mentioned earlier  Random Trip [L-Vojnovic-Infocom05] is one such model mobile picks a path in a set of paths and a speed at end of path, mobile picks a new path and speed evolution is a Markov process  Random Waypoint is a special case of Random Trip  Examples of random trip models in the next slides

9 RWP with pauses on general connected domain

10 City Section

11 Space graphs are readily available from road-map databases Example: Houston section, from US Bureau’s TIGER database (S. PalChaudhuri et al, 2004)

12 Restricted RWP ( Blažević et al, 2004)

13 Random Walk with Reflection

14 The Issues remain with Random Trip Models  Samples of node locations after 2000 s of simulated time (At t=0 node location is uniformly distributed)

15 Contents 1.Issues with mobility models 2.The random Trip Model 3.Stability 4.Perfect Simulation

16 Solving the Issue 1. Is there a stationary regime ?  Answer: there is a stationary regime for random trip iff the expected trip time is finite.  Application to random waypoint with speed chosen uniformly in [v min,v max ] Yes if v min >0, no if v min =0 Solves a long-standing issue on random waypoint.

17 A Fair Comparison  If there is a stationary regime, we can compare different mobility patterns provided that 1.They are in the stationary regime 2.They have the same stationary distributions of locations  Example: we revisit the comparison by sampling the static case from the stationary regime of the random waypoint Run the simulation long enough, then stop the mobility pattern Random waypoint Static, from uniform Static, same node location as RWP

18 Contents 1.Issues with mobility models 2.The random Trip Model 3.Stability 4.Perfect Simulation

19 Solving the Issue 2. How long is long enough ?  It can be very long Initial transient longs at least as large as typical simulation runs

20 But we do not need to wait that long…  There is an alternative to running the simulation long enough  Perfect simulation is possible (stationary regime at time 0) thanks to a perfect sampling algorithm of random trip Computationally simple sampling algorithm Obtained by using Palm Calculus Example for random waypoint:

21 The stationary distribution of random waypoint is obtained in closes form Contour plots of density of stationary distribution

22  The random trip model provides a rich set of mobility models for single node mobility  Using Palm calculus, the issues of stability and perfect simulation are solved  Random Trip is implemented in ns2 (by S. PalChaudhuri) and is available at Conclusion