1 Simulation de modèles de mobilité : paradoxes et étrangetés Jean-Yves Le Boudec EPFL En collaboration avec Milan Vojnović Microsoft Research.

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.
Power law and exponential decay Milan Vojnović Microsoft Research Cambridge Collaborators: T. Karagiannis and J.-Y. Le Boudec Hynet colloquium series,
1 On the Capacity of Ad Hoc Wireless Networks Under General Node Mobility Michele Garetto – Università di Torino Paolo Giaccone - Politecnico di Torino.
1 Analysis of Random Mobility Models with PDE's Michele Garetto Emilio Leonardi Politecnico di Torino Italy MobiHoc Firenze.
Queuing Network Models for Delay Analysis of Multihop Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute.
Queuing Theory For Dummies Jean-Yves Le Boudec 1.
Generated Waypoint Efficiency: The efficiency considered here is defined as follows: As can be seen from the graph, for the obstruction radius values (200,
Routing in WSNs through analogies with electrostatics December 2005 L. Tzevelekas I. Stavrakakis.
Flows and Networks (158052) Richard Boucherie Stochastische Operations Research -- TW wwwhome.math.utwente.nl/~boucherierj/onderwijs/158052/ html.
1 Perfect Simulation and Stationarity of a Class of Mobility Models Jean-Yves Le Boudec (EPFL) Milan Vojnovic (Microsoft Research Cambridge)
Understanding The Simulation Of Mobility Models with Palm Calculus Jean-Yves Le Boudec EPFL UMD-ISR- February 2007 Milan Vojnović Microsoft Research Cambridge.
Kuang-Hao Liu et al Presented by Xin Che 11/18/09.
ODE and Discrete Simulation or Mean Field Methods for Computer and Communication Systems Jean-Yves Le Boudec EPFL MLQA, Aachen, September
Queuing Theory For Dummies
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.
Stable mobility models for MANETS Kim Blackmore Roy Timo (DE/NICTA) Leif Hanlen (NICTA)
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
Network Bandwidth Allocation (and Stability) In Three Acts.
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.
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
ICNP'061 Benefit-based Data Caching in Ad Hoc Networks Bin Tang, Himanshu Gupta and Samir Das Department of Computer Science Stony Brook University.
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 Mean Field Interaction Models for Computer and Communication Systems and the Decoupling Assumption Jean-Yves Le Boudec EPFL – I&C – LCA Joint work with.
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.
Maximizing Path Durations in Mobile Ad- Hoc Networks Yijie Han and Richard J. La Department of ECE & ISR University of Maryland, College Park CISS, Princeton.
Impact of Different Mobility Models on Connectivity Probability of a Wireless Ad Hoc Network Tatiana K. Madsen, Frank H.P. Fitzek, Ramjee Prasad [tatiana.
1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)
Exposure In Wireless Ad-Hoc Sensor Networks S. Megerian, F. Koushanfar, G. Qu, G. Veltri, M. Potkonjak ACM SIG MOBILE 2001 (Mobicom) Journal version: S.
Social Networks Based Ad Hoc Mobility Models Mirco Musolesi Stephen Hailes Cecilia Mascolo University College London 3 rd UK-Ubinet Workshop Bath, 9-11.
1 Modeling and Simulating Networking Systems with Markov Processes Tools and Methods of Wide Applicability ? Jean-Yves Le Boudec
STOCHASTIC GEOMETRY AND RANDOM GRAPHS FOR THE ANALYSIS AND DESIGN OF WIRELESS NETWORKS Haenggi et al EE 360 : 19 th February 2014.
On the Construction of Data Aggregation Tree with Minimum Energy Cost in Wireless Sensor Networks: NP-Completeness and Approximation Algorithms National.
Mean Field Methods for Computer and Communication Systems Jean-Yves Le Boudec EPFL ACCESS Distinguished Lecture Series, Stockholm, May 28,
Diffusion approximation for billiards models 1. Presentation of billiards models 2. The dynamic system approach 2.1 Notations and definitions 2.2 Fundamental.
Decentralised load balancing in closed and open systems A. J. Ganesh University of Bristol Joint work with S. Lilienthal, D. Manjunath, A. Proutiere and.
1 1 Quantifying Impact of Mobility on Data Availability in Mobile Ad Hoc Networks Takahiro Hara IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 9, NO. 2, FEBRUARY.
Function Computation over Heterogeneous Wireless Sensor Networks Xuanyu Cao, Xinbing Wang, Songwu Lu Department of Electronic Engineering Shanghai Jiao.
1 Objective and Secure Reputation-Based Incentive Scheme for Ad-Hoc Networks Dapeng Oliver Wu Electrical and Computer Engineering University of Florida.
Queuing Networks Jean-Yves Le Boudec 1. Contents 1.The Class of Multi-Class Product Form Networks 2.The Elements of a Product-Form Network 3.The Product-Form.
On the Age of Pseudonyms in Mobile Ad Hoc Networks Julien Freudiger, Mohammad Hossein Manshaei, Jean-Yves Le Boudec and Jean-Pierre Hubaux Infocom 2010.
Project funded by the Future and Emerging Technologies arm of the IST Programme Analytical Insights into Immune Search Niloy Ganguly Center for High Performance.
Universität Stuttgart Institute of Parallel and Distributed Systems (IPVS) Universitätsstraße 38 D Stuttgart Contact-Based Mobility Metrics for Delay-
Pending Interest Table Sizing in Named Data Networking Luca Muscariello Orange Labs Networks / IRT SystemX G. Carofiglio (Cisco), M. Gallo, D. Perino (Bell.
Converge-Cast: On the Capacity and Delay Tradeoffs Xinbing Wang Luoyi Fu Xiaohua Tian Qiuyu Peng Xiaoying Gan Hui Yu Jing Liu Department of Electronic.
Palm Calculus Made Easy The Importance of the Viewpoint JY Le Boudec 1.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Competitive Scheduling in Wireless Networks with Correlated Channel State Ozan.
© 2008 Frans Ekman Mobility Models for Mobile Ad Hoc Network Simulations Frans Ekman Supervisor: Jörg Ott Instructor: Jouni Karvo.
Mobility Models for Wireless Ad Hoc Network Research EECS 600 Advanced Network Research, Spring 2005 Instructor: Shudong Jin March 28, 2005.
Palm Calculus Part 1 The Importance of the Viewpoint JY Le Boudec 1 May 2015.
Flows and Networks (158052) Richard Boucherie Stochastische Operations Research -- TW wwwhome.math.utwente.nl/~boucherierj/onderwijs/158052/ html.
1 HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity Christian Schindelhauer Algorithms for Radio Networks Winter Term 2005/2006.
Using Delaunay Triangulation to Construct Obstacle Detour Mobility Model Dijiang Huang Computer Science and Electrical Engineering University of Missouri.
Copyright © 2002 OPNET Technologies, Inc. 1 Random Waypoint Mobility Model Empirical Analysis of the Mobility Factor for the Random Waypoint Model 1542.
Analytical Model for Connectivity in Vehicular Ad Hoc Networks Published in IEEE TVT vol. 57, no. 6, November 2008 Authors: Saleh Yousefi, Eitan Altman,
Mean Field Methods for Computer and Communication Systems Jean-Yves Le Boudec EPFL Network Science Workshop Hong Kong July
Node Distribution of a New Scalable Mobility Model for Ad Hoc Wireless Networks Sheeraz Ahmad.
Power law and exponential decay
Outline Introduction Signal, random variable, random process and spectra Analog modulation Analog to digital conversion Digital transmission through baseband.
What is Mobile Network? Why is it called Ad Hoc?
Analysis of Link Reversal Routing Algorithms
Jean-Yves Le Boudec EPFL – I&C – LCA Joint work with Michel Benaïm
Where real stuff starts
Presentation transcript:

1 Simulation de modèles de mobilité : paradoxes et étrangetés Jean-Yves Le Boudec EPFL En collaboration avec Milan Vojnović Microsoft Research

2 Résumé Les ingénieurs qui développent des systèmes de communication mobile ont souvent recours à la simulation dans les phases de conception et de simulation. Bien que conceptuellement très simple, la simulation peut poser des problèmes parfois déroutants. Par exemple, des simulations de durées différentes donnent des résultats différents, et plus la simulation est longue, plus les résultats sont différents. Ces phénomènes peuvent être expliqués, et quelque fois entièrement évités, par la théorie des probabilités, et en particulier le calcul de Palm pour les processus ponctuels stationnaires – une théorie initialement développée dans le cadre des files d’attente. [LV06] The Random Trip Model: Stability, Stationary Regime, and Perfect Simulation, J.-Y. Le Boudec and Milan Vojnović, ACM/IEEE Trans. on Networking, Dec 06 [L04] Understanding the simulation of mobility models with Palm calculus, J.-Y. Le Boudec, Performance Evaluation, 2007

3 Outline Simulation Issues with mobility models Palm calculus Stability Stationary distributions and Perfect Simulation

Random Waypoint (Johnson and Maltz`96) Used at IETF to evaluate performance of ad-hoc routing protocols Node picks next waypoint X n+1 uniformly in area Picks speed V n uniformly in [v min,v max ] Moves to X n+1 with speed V n 4 XnXn X n+1

5 Path P n XnXn X n+1 Swiss Flag [LV05] Non convex domain Random Waypoint on Non Convex Area

6 City- section, Camp et al [CBD02] More Realistic Model

7 Issue about speed Distributions of node speed, position, distances, etc change with time Node speed: 100 users average 1 user Time (s) Speed (m/s) 900 s

8 Node Position Distributions of node speed, position, distances, etc change with time Distribution of node position: Time = 0 sec Time = 2000 sec

9 Why does it matter ? 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 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 !

10 Issues with Mobility Models Is there a stable distribution of the simulation state (time-stationary distribution), 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) ?

11 Outline Simulation Issues with mobility models Palm calculus Stability Stationary distributions and Perfect Simulation

12 Palm Calculus Relates time averages versus event averages An old topic in queueing theory Now well understood by mathematicians under the name Palm Calculus

13 Palm Calculus Framework A stationary process (simulation) with state S t. Some quantity X t measured at time t. Assume that (S t ;X t ) is jointly stationary I.e., S t is in a stationary regime and X t depends on the past, present and future state of the simulation in a way that is invariant by shift of time origin. Examples S t = current position of mobile, speed, and next waypoint Jointly stationary with S t : X t = current speed at time t; X t = time to be run until next waypoint Not jointly stationary with S t : X t = time at which last waypoint occurred

14 Palm Expectation Consider some selected transitions of the simulation, occurring at times T n. Example: T n = time of n th trip end Definition : the Palm Expectation is E t (X t ) = E (X t | a selected transition occurred at time t) By stationarity: E t (X t ) = E 0 (X 0 ) Example: T n = time of n th trip end, X t = instant speed at time t E t (X t ) = E 0 (X 0 ) = average speed observed at a waypoint

15 Event versus Time Averages E ( X t ) = E (X 0 ) expresses the time average viewpoint. E t (X t ) = E 0 (X 0 ) expresses the event average viewpoint. Example: T n = time of n th trip end, X t = instant speed at time t E t (X t ) = E 0 (X 0 ) = average speed observed at trip end E ( X t )= E (X 0 ) = average speed observed at an arbitrary point in time

16 Formal Definition In discrete time, we have an elementary conditional probability E t (X t ) = E (X t 1 9 n 2 Z such that Tn=t ) / P ( 9 n 2 Z such that T n =t) In continuous time, the definition is a little more sophisticated uses Radon Nikodym derivative– [L04] for details Also see [BaccelliBremaud87] for a formal treatment Palm probability is defined similarly P t ( X t 2 W) = E t (1 Xt 2 W )

17 Ergodic Interpretation Assume simulation is stationary + ergodic, i.e. sample path averages converge to expectations; then we can estimate time and event averages by: In terms of probabilities:

18 Two Palm Calculus Formulas Intensity of selected transitions: := expected number of transitions per time unit Intensity Formula: where by convention T 0 · 0 < T 1 Inversion Formula The proofs are simple in discrete time – see [L04]

19 A Classical Example

20 Outline Simulation Issues with mobility models Palm calculus Stability Stationary distributions and Perfect Simulation

21 Necessary Condition for Existence of a Stationary Regime Apply the intensity formula to T n = trip end times Thus: if the random trip has a stationary regime it must be that the mean trip duration sampled at trip end times is finite On bounded area, means: mean of inverse of speed is finite Converse is true [LV06]

22 A Random waypoint model that has no stationary regime ! Assume that at trip transitions, node speed is sampled uniformly on [v min,v max ] Take v min = 0 and v max > 0 Mean trip duration = (mean trip distance) Mean trip duration is infinite ! Was often used in practice Speed decay: “considered harmful” [YLN03]

What happens when the model does not have a stationary regime ? The simulation becomes old

24 Outline Simulation Issues with mobility models Palm calculus Stability Stationary distributions and Perfect Simulation

Stationary Distribution of Speed

Closed Form Assume a stationary regime exists and simulation is run long enough Apply inversion formula and obtain distribution of instantaneous speed V(t)

27 Removing Transient Matters 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 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 !

28 Removing Transients May Take Long If model is stable and initial state is drawn from distribution other than time-stationary distribution The distribution of node state converges to the time-stationary distribution Naïve: so, let’s simply truncate an initial simulation duration The problem is that initial transience can last very long Example [space graph]: node speed = 1.25 m/s bounding area = 1km x 1km

29 Perfect simulation is highly desirable (2) Distribution of path: Time = 100s Time = 50s Time = 300s Time = 500s Time = 1000s Time = 2000s

Solution: Perfect Simulation Def: a simulation that starts with stationary distribution Usually difficult except for specific models Possible if we know the stationary distribution Sample Prev and Next waypoints from their joint stationary distribution Sample M uniformly on segment [Prev,Next] Sample speed V from stationary distribution

Stationary Distrib of Prev and Next

Stationary Distribution of Location

There is a closed form for stationary distribution of location but it is ugly and hard to sample from – not to be used in practice [LV04]

A Fair Comparison We revisit the comparison by sampling the static case from the stationary regime of the random waypoint Random waypoint Static, from uniform Static, same node location as RWP

No Speed Decay

Conclusions Les simulations peuvent ne pas avoir de régime stationaire par vieillissement plutôt qu’explosion Si régime stationaire existe, il faut éliminer les transitoires ou faire une simulation parfaite Le calcul de Palm permet de faire une simulation parfaite pour ce type de modèles

37 References [ARMA02] Scale-free dynamics in the movement patterns of jackals, R. P. D. Atkinson, C. J. Rhodes, D. W. Macdonald, R. M. Anderson, OIKOS, Nordic Ecological Society, A Journal of Ecology, 2002 [CBD02] A survey of mobility models for ad hoc network research, T. Camp, J. Boleng, V. Davies, Wireless Communication & Mobile Computing, vol 2, no 5, 2002 [CHC+06] Impact of Human Mobility on the Design of Opportunistic Forwarding Algorithms, A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, J. Scott, IEEE Infocom 2006 [E01] Stochastic billiards on general tables, S. N. Evans, The Annals of Applied Probability, vol 11, no 2, 2001 [GL06] Analysis of random mobility models with PDE’s, M. Garetto, E. Leonardi, ACM Mobihoc 2006 [JBAS+02] Towards realistic mobility models for mobile ad hoc networks, A. Jardosh, E. M. Belding-Royer, K. C. Almeroth, S. Suri, ACM Mobicom 2003 [KS05] Anomalous diffusion spreads its wings, J. Klafter and I. M. Sokolov, Physics World, Aug 2005

38 References (2) [L04] Understanding the simulation of mobility models with Palm calculus, J.-Y. Le Boudec, accepted to Performance Evaluation, 2006 [LV05] Perfect simulation and stationarity of a class of mobility models, J.-Y. Le Boudec and M. Vojnovic, IEEE Infocom 2005 [LV06] The random trip model: stability, stationary regime, and perfect Simulation, J.-Y. Le Boudec and M. Vojnovic, MSR-TR , Microsoft Research Technical Report, 2006 [M87] Routing in the Manhattan street network, N. F. Maxemchuk, IEEE Trans. on Comm., Vol COM-35, No 5, May 1987 [NT+05] Properties of random direction models, P. Nain, D. Towsley, B. Liu, and Z. Liu, IEEE Infocom 2005 [PLV05] Palm stationary distributions of random trip models, S. PalChaudhuri, J.-Y. Le Boudec, M. Vojnovic, 38 th Annual Simulation Symposium, April 2005

39 References (3) [RMM01] An analysis of the optimum node density for ad hoc mobile networks, ICC 2001 [S64] Principles of random walk, F. Spitzer, 2 nd Edt, Springer, 1976 [SMS06] Delay and capacity trade-offs in mobile ad hoc networks: a global perspective, G. Sharma, R. Mazumdar, N. Shroff, IEEE Infocom 2006 [SZK93] Strange kinetics (review article), M. F. Shlesinger, G. M. Zaslavsky, J. Klafter, Nature, May 1993 [YLN03] Random waypoint considered harmful, J. Yoon, M. Liu, B. Noble, IEEE Infocom 2003