Skip to main content

Obstacle Mobility Model Based on Activity Area in Ad Hoc Networks

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4706))

Abstract

The study of mobile ad hoc networks depends on understanding protocols from simulations, before applying on a real world setting. To produce a real-world environment within which an ad hoc network can be formed among a set of nodes, there is a need for the development of a realistic, generic and comprehensive mobility model instead of random-based models. Previously, realistic mobility models such as obstacle mobility and pathway mobility model, etc, has been proposed. In these mobility models, there are movement paths and obstacles that constrain the movements and signals of the nodes. In this paper, we propose a new Obstacle Mobility Model Based On Activity Area. In this model our focus is on the movement pattern of the nodes, first we constructed environment simulation that included predefined pathways and obstacles. Then, we consider several clusters each of which has a given geographic activity area, speed and capacity. The nodes become member of clusters. In our model similar to real world, each node belongs to a particular activity area that its existence probability, in this area, is more than other places. This paper shows that various MANET environments can be modeled based on this work. A sample environment is also simulated and the result is compared with the Obstacle Mobility and Random Waypoint model. The results show that movement pattern and speed of the nodes have a significant influence on the performance of MANET protocols.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. The Network Simulator 2: http://www.isi.edu/nsnam/ns

  2. Bajaj, L., Takai, M., Ahuja, R., Tang, K., Bagrodia, R., Gerla, M.: GlomoSim: A Scalable Network Simulation Environment. Technical Report CSD, #990027, UCLA (1997)

    Google Scholar 

  3. Hong, X., Gerla, M., Pei, G., Chiang, C.-C.: A Group Mobility Model for Ad hoc Wireless Networks. In: Proceedings of the ACWIEEE MSWIM’99, Seattle, WA, pp. 53–60 (August 1999)

    Google Scholar 

  4. Kristoffersson, J.: Obstacle Constrained Group Mobility Model. Master’s thesis, Department of Computer Science and Electrical Engineering Lulea University of Technology Sweden (December 2005)

    Google Scholar 

  5. Zheng, Q., Hong, X., Ray, S.: Recent Advances in Mobility Modeling for Mobile ad Hoc Network Research. In: ACMSE ’04, Huntsville, Alabama, USA (April 2-3, 2004)

    Google Scholar 

  6. Bai, F., Helmy, A.: A Survey of Mobility Modeling and Analysis in Wireles Adhoc Networks. In: Wireless Ad Hoc and Sensor Networks. Kluwer Academic Publishers, Dordrecht (2004)

    Google Scholar 

  7. Camp, J.T., Boleng, Davies, V.: A survey of mobility models for ad hoc network research. Wireless Communications & Mobile Computing (WCMC). Special issue on Mobile Ad Hoc Networking, Research, Trends and Applications 2(5), 483–502 (2002)

    Google Scholar 

  8. Bai, F., Sadagopan, N., Helmy, A.: The IMPORTANT Framework For Analyzing The Impact of Mobility on Performance of RouTing protocols for Adhoc NeTworks. In: Proceedings of IEEE INFOCOM, pp. 825–835. IEEE Computer Society Press, Los Alamitos (2003)

    Google Scholar 

  9. Broch, J., Maltz, D.A., Johnson, D., Hu, Y.-C., Jetcheva, J.: A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols. In: Proceedings of the 4th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), Dallas, Texas, pp. 85–97 (October 1998)

    Google Scholar 

  10. Yoon, J., Liu, M., Noble, B.: Random waypoint Considered Harmful. In: Proceedings of INFOCOM. IEEE Computer Society Press, Los Alamitos (2003)

    Google Scholar 

  11. Tian, J., Hahner, J., Becker, C., Stepanov, I., Rothermel, K.: Graph-based Mobility Model for Mobile Ad Hoc Network Simulation. In: The Proceedings of 35th Annual Simulation Symposium, in cooperation with the IEEE Computer Society and ACM, San Diego, California. IEEE Computer Society Press, Los Alamitos (2002)

    Google Scholar 

  12. Jardosh, A.P., Belding-Royer, E., Almeroth, M.K.C., Suri, S.: Towards Realistic Mobility Models for Mobile Ad hoc Networks. In: Proceedings of ACM MOBICOM, San Diego, CA (September 2003)

    Google Scholar 

  13. Lu, G., Manson, G., Belis, D.: Mobility Modeling in Mobile Ad Hoc Networks with Environment- Aware. Journal of Networks 1(1) (September 2006)

    Google Scholar 

  14. Bai, F., Sadagopan, N., Helmy, A.: Important: a framework to systematically analyze the impact of mobility on performance of routing protocols for ad hoc networks. In: Proceedings of IEEE Information Communications Conference (INFOCOM 2003). IEEE Computer Society Press, Los Alamitos (2003)

    Google Scholar 

  15. Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications. Springer, Heidelberg (2000)

    MATH  Google Scholar 

  16. Jardosh, A.P., Belding-Royer, E., Almeroth, K., Suri, S.: Real-world Environment Models For Mobile Network Evaluation. The IEEE Journal on special Areas in Communications – Special Issue on Wireless Ad-Hoc Networks (2005)

    Google Scholar 

  17. Dijkstra, E.W.: A Note on Two Problems in Connection with Graphs. Num. Mathematik 1, 269–271 (1959)

    Article  Google Scholar 

  18. Perkins. C.E, Belding-Royer. M.E. Chakeres Ian. : Ad Hoc On Demand Distance Vector (AODV) Routing. IETF Internet draft, draft-perkins-manet-aodvbis-00.txt (Oct 2003)

    Google Scholar 

  19. http://moment.cs.ucsb.edu/mobility/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Osvaldo Gervasi Marina L. Gavrilova

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Babaei, H., Fathi, M., Romoozi, M. (2007). Obstacle Mobility Model Based on Activity Area in Ad Hoc Networks. In: Gervasi, O., Gavrilova, M.L. (eds) Computational Science and Its Applications – ICCSA 2007. ICCSA 2007. Lecture Notes in Computer Science, vol 4706. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74477-1_72

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74477-1_72

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74475-7

  • Online ISBN: 978-3-540-74477-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics