Advertisement

Graph-Based Mobility

  • Radhika Ranjan Roy
Chapter

Abstract

The graph-based (or graph walk) mobility model that reflects the constraints of movement of mobile nodes in real-world mobile ad hoc networks is described. The area graph-based mobility model, a variation of the graph walk, which uses a graph-like structure of connected areas to build up scenarios, is also analyzed. The performance of this model is simulation results of the graph walk model is provided. The performances of both mobility models are discussed in analyzing the simulation results of the graph walk model are provided. It is shown that more intelligent routing protocols need to be devised to overcome the adverse effects of these mobility models.

Keywords

Mobile Node Delivery Ratio Mobility Model Random Walk Model Dynamic Source Rout 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Tian, J et al (2002) Graph-Based Mobility Model for Mobile Ad Hoc Network Simulation. SIMSYMGoogle Scholar
  2. 2.
    Bittner, S et al (2005) The Area Graph-based Mobility Model and its Impact on Data Dissemination. PERCOMWGoogle Scholar
  3. 3.
    Zhou, B et al (2004) Group and Swarm Mobility Models for Ad Hoc Network Scenarios using Virtual Tracks. MILCOMGoogle Scholar
  4. 4.
    Perkins, C and Bhagwat, P (1994) Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers. SIGCOMGoogle Scholar
  5. 5.
    Johnson, D B and Maltz, D A (1996) Dynamic Source Routing in Ad Hoc Wireless Networks. Mobile ComputingGoogle Scholar
  6. 6.
    Perkins, C (1997) Ad-hoc On-demand Distance Vector Routing. MILCOMGoogle Scholar
  7. 7.
    Ni, S-Y et al (1999) The Broadcast Storm Problem in a Mobile Ad Hoc Network. MOBICOMGoogle Scholar
  8. 8.
    Williams, B and Camp, T (2002) Comparison of Broadcasting Techniques for Mobile Ad Hoc Networks. MOBIHOCGoogle Scholar
  9. 9.
    Ho, C et al (1999) Flooding for Reliable Multicast in Multi-Hop Ad Hoc Networks. DIAL-MGoogle Scholar
  10. 10.
    Lim, H and Kim, C (2000) Multicast Tree Construction and Flooding in Wireless Ad Hoc Networks. MSWIMGoogle 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