Skip to main content

Deterministic Mobility

  • Chapter
  • First Online:
Handbook of Mobile Ad Hoc Networks for Mobility Models
  • 1834 Accesses

Abstract

The characteristics of the deterministic mobility model, purposeful deterministic mobility model, and deterministic mobility model with attractive points are described. These mobility models that are rarely used in the MANET are described for completeness in order to differentiate their behaviors with respect to the random mobility models.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 249.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Turgut, D et al (2001) Longevity of Routes in Mobile Ad hoc Networks. VTC

    Google Scholar 

  2. Peebles, P Z (1990) Probability Random Variables and Random Signal Principles. McGraw-Hill, New York

    Google Scholar 

  3. Liu, T et al (1998) Mobility modeling, location tracking, and trajectory prediction in wireless ATM networks. IEEE Journal on SAC 16(6)

    Google Scholar 

  4. Rao, R and Kesidis G (2004) Purposeful mobility for relaying and surveillance in mobile ad-hoc sensor networks October 30, 2004. IEEE Transactions on Mobile Computing 3(3)

    Google Scholar 

  5. Holland, J H (1973) Generic algorithms and the optimal allocation of trials. SIAM Journal of Computing 2(2):88–1005

    Article  MathSciNet  MATH  Google Scholar 

  6. Holland, J H (1975) Adaptation in Natural and Artificial Systems. University of Michigan

    Google Scholar 

  7. Glover, F (1986) Future paths for integer programming and links to artificial intelligence. Computer and Operation Research 13:533–549

    Article  MathSciNet  MATH  Google Scholar 

  8. Bellman, R E and Dreyfus, S E (1962) Applied Dynamic Programming. Princeton University

    Google Scholar 

  9. Lambert, T J and Wang, H. Fictitious Play Approach to a Mobile Unit Situation Awareness Problem. Department of Industrial and Operations Engineering and Department of Electrical Engineering and Computer Science, Ann Arbor, Michigan. URL: http://www.gtcenter.org/Archive/Conf03/FictMuri.pdf

  10. Jamieson, M (2002) A Continuous Gibbs Annealer for Contour Estimation. Thesis for Master of Applied Science in System Design Engineering, Waterloo, Ontario

    Google Scholar 

  11. Mauve, M et al (2001) A survey on position-based routing in mobile ad-hoc networks. IEEE Network Magazine 15(6):3039

    Article  Google Scholar 

  12. Murray, K and Pesch, D (2004) Mobility Modeling using Attraction Points for Cellular Network Environments. IT&T

    Google Scholar 

  13. Murray, K and Pesch, D (2004) Policy Based Access Management and Handover Control in Heterogeneous Wireless Networks. Vehicular Technology Conference

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Radhika Ranjan Roy .

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Roy, R.R. (2011). Deterministic Mobility. In: Handbook of Mobile Ad Hoc Networks for Mobility Models. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-6050-4_8

Download citation

  • DOI: https://doi.org/10.1007/978-1-4419-6050-4_8

  • Published:

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-6048-1

  • Online ISBN: 978-1-4419-6050-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics