Presentation is loading. Please wait.

Presentation is loading. Please wait.

A New Class of Mobility Models for Wireless Mobile Communication Networks Joshua Gabet Advisor: Carl Baum Clemson University SURE 2005.

Similar presentations


Presentation on theme: "A New Class of Mobility Models for Wireless Mobile Communication Networks Joshua Gabet Advisor: Carl Baum Clemson University SURE 2005."— Presentation transcript:

1 A New Class of Mobility Models for Wireless Mobile Communication Networks Joshua Gabet Advisor: Carl Baum Clemson University SURE 2005

2 Random Waypoint Model Choose a point (waypoint) uniformly over the area Choose a random velocity for that segment Move from one point to the next v1v1 v3v3 v2v2 0 3 1 2

3 Motivation Random Waypoint Model inadequacies Ping pong movement Non-uniform steady-state distribution Non-ideal velocity model

4 New Model Chooses waypoints based upon two criteria Smaller area around circle Previous direction Velocity changes independently of waypoints

5 New Model Description R and Θ are independent Θ generated using acceptance rejection method a=0, no memory a>0, has memory R generated using IDF method b, radius of movement size

6 Variable Distributions

7 Example Paths a=0, b/R=2 a=0, b/R=0.2 a=1, b/R=0.2

8 Steady-state Density New model closer to uniform distribution Allows for more realistic coverage of area Parameters provide adjustability

9 Settling Time Ping pong behavior exhibited, if a or b is large

10 Markov Velocity Model Time spent at velocity v is exponential with mean c v Velocity changes are unrelated to direction changes at waypoints

11 Velocity Model Comparison Random waypoint average velocity below v c because most time spent on long, slow segments

12 Markov Chain Velocity Model Our model easily allows for v=0. Velocity steps allow for acceleration modeling, if desired

13 Network Partitions Partition The inability of any one node to be able to connect to any other node for a given distribution The maximum hop distance used was ½R R=1000 m

14 Dijkstra Routing Algorithm

15 Required Power Required power to use Dijkstra routes Assumes perfect knowledge of network state R=1000 m

16 Effects of Imperfect State Knowledge v=20 m/s v={0,40 m/s} c=20 s N=128, R=1000 m

17 Conclusions New mobility model presented for mobile communication networks The model matters

18 Questions

19 Nearest Neighbor Distance 32 nodes Random waypoint underestimates NN distance

20 Effects of Population a=1 b=600 m c=20 s v={0,40 m/s} R=1000 m

21 Effects of Population v=20 m/s v={0,40 m/s} c=20 N=128, R=1000 m


Download ppt "A New Class of Mobility Models for Wireless Mobile Communication Networks Joshua Gabet Advisor: Carl Baum Clemson University SURE 2005."

Similar presentations


Ads by Google