Smooth Random Mobility

Chapter

Abstract

The characteristics of the smooth random mobility model are described through derivation of the analytical model. The model describes how the correlation between the speed and the direction is used to provide the smooth movement patterns that are more realistic to be used in the real-life scenarios of mobile nodes of the MANET . The concept of speed control based on the target speeds is also described. The analytical methodology for encounter -related statistics is derived for hitting time , meeting time , inter-meeting time, and contact duration for a general class of mobility models with applications to SRM and RWP .

Keywords

Transportation 

References

  1. 1.
    Chiang, C (1998) Wireless Network Multicasting. PhD Thesis. Department of Computer Science, University of California, Los AngelesGoogle Scholar
  2. 2.
    Campos, C A V et al (2004) Realistic Individual Mobility Markovian Models for Mobile Ad Hoc Networks. WCNCGoogle Scholar
  3. 3.
    Haas, Z (1997) A New Routing Protocol for Reconfigurable Wireless Networks. ICUPC, San DiegoGoogle Scholar
  4. 4.
    Liang, B and Haas, Z (1999) Predictive Distance-Based Mobility Management for PCS Networks. INFOCOMGoogle Scholar
  5. 5.
    Davies, V (2000) Evaluating Mobility Models Within an Ad Hoc Network. Master’s thesis. Colorado School of Mines, ColoradoGoogle Scholar
  6. 6.
    Bettstetter, C (2001) Smooth is Better than Sharp: A Random Mobility Model for Simulation of Wireless Networks. MSWiMGoogle Scholar
  7. 7.
    Spyropoulos, T et al (2008) An Analytical Study of Fundamental Mobility Properties for Encounter-based Protocols. IJAACSGoogle Scholar
  8. 8.
    Aldous, A and Fill, J. Reversible Markov Chains and Random Walk in Graphs (monograph in Preparation). http://stat-www.berkley.edu/users/aldous/RWG/book.html.
  9. 9.
    Durrett, R (1995) Probability: Theory and Examples, 2nd Edition, DuxburyGoogle Scholar
  10. 10.
    Randall, D and Tetalli, P (1999) Analyzing Glauber dynamics by comparison of Markov chains. Lecture Notes in Computer ScienceGoogle Scholar
  11. 11.
    Billingsley, P (1999) Convergence of Probability Measures, 2nd Edition, WileyGoogle Scholar
  12. 12.
    Boudec, J L and Vojnovic, M (2005) Perfect Simulation and Stationary of a Class of Mobility Models. INFOCOMGoogle Scholar
  13. 13.
    Jindal, A and Psounis, K (2007) Contention-Aware Performance Analysis of Mobility Assisted Routing. USC, Tech. Rep. CENG-2007-9, http://www-scf.usc.edu/apoorvaj/jsactech09.pdf
  14. 14.
    Spyropoulos, T et al (2004) Single-Copy ROUTING IN INTERMittently Connected Mobile Networks. SECONGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  1. 1.United States Army Research, Development and Engineering Command (RDECOM)Fort MonmouthUSA

Personalised recommendations