1 / 16

General Ripple Mobility Model

General Ripple Mobility Model. Chun-Hung Chen 2006.05.16 Dept. of CSIE National Taipei University of Technology. Introduction. RMM-Previous Work. The problem with RMM. It can be described as the combination of two RWP mobility patterns The average speed can not be spread wide

eadoin
Download Presentation

General Ripple Mobility Model

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. General Ripple Mobility Model Chun-Hung Chen 2006.05.16 Dept. of CSIE National Taipei University of Technology

  2. Introduction

  3. RMM-Previous Work

  4. The problem with RMM • It can be described as the combination of two RWP mobility patterns • The average speed can not be spread wide • Uniform Index (UI) is not a good index for spatial distribution • There is a limitation for extension

  5. Procedure of GRMM • Given Vmin, Vmax, Rmin, and Rmax • Randomly choose a speed v within [Vmin, Vmax] • r = f(v, λ, Vmin, Vmax) • Uniformly pick up a destination within the disk of radius r and the disk centering at the node position • The node moves toward the destination, and if it reaches the wall or boundary, it will bounce off and maintain the same speed. Bouncing action is set according to the rule that incidence angle is equal to the reflection angle.

  6. Flexible Average Speed (FAS) • In RMM, Vmin<VLS<Vmax • g(λ,v) = 0 if v ≦ VLS • g(λ,v) = 1 if v > VLS • If we want the lower speed node with shorter distance, we can assign g(λ,v) as a monotone increasing function. • g(λ,v)=vλ is proposed here and it is an instance of GRMM

  7. Vmin=1, Vmax=20, Rmin=50, Rmax=1000 and g(λ,v)=vλ

  8. Evaluation Metrics • Average Speed • Results of Flexible Average Speed • Average Number of Links • Given Effective Range D, if there exists a link between A and B, Distance from A to B is smaller than or equal to D • Average Duration of Links • Once the link is established, we observe how long it lasts • Spatial Distribution • Moving area is divided into several 100x100 sections. Accumulating how many nodes being in the sections. • Spatial Entropy

  9. Simulation Parameters

  10. Flexible Average Speed

  11. Average Number of Links

  12. Average Duration of Links

  13. Spatial Distribution

  14. Spatial Entropy

  15. Conclusions • GRMM maintains the simplicity and the understandable of RWP • It is the first time of Flexible Average Speed (FAS) mentioned in mobility models. • There are still some analytic works which can be done

More Related