skip to main content
10.1145/1163610.1163628acmconferencesArticle/Chapter ViewAbstractPublication PagesmswimConference Proceedingsconference-collections
Article

Analytical modeling of random waypoint mobility patterns

Published: 06 October 2006 Publication History

Abstract

Mobility, in its various forms, is one of the sources of several technical challenges being addressed in the last years to achieve a more flexible computing and communication infrastructure. In this context, the study and characterization of node mobility in wireless networks is extremely important to foresee the node distribution in the network, thus enabling the creation of suitable models and a more accurate prediction of performance and dependability levels.In this paper we adopt a Markovian formalism, namely SAN (Stochastic Automata Networks), to model and analyze various aspects of the Random Waypoint mobility pattern. We first show the compatibility of our results with existing continuous state studies and then we extend the analysis of the Random Waypoint by addressing different specific, but far from irrelevant, aspects of the mobility pattern. In this sense, this contribution shows both results for this mobility pattern as well as the suitability of the SAN formalism to detailed description of such pattern

References

[1]
M. Ajmone-Marsan, G. Conte, and G. Balbo. A Class of Generalized Stochastic Petri Nets fo the Performance Evaluation of Multiprocesso Systems. ACM Transactions on Computer Systems 2(2):93--122, 1984.
[2]
N. Bansal and Z. Liu. Capacity, delay and mobility in wireless ad-hoc networks. In IEEE Infocom 2003, 2003.
[3]
A. Benoit, L. Brenner, P. Fernandes, B. Plateau, and W. J. Stewart. The PEPS Software Tool. In Computer Performance Evaluation / TOOLS 2003 volume 2794 of LNCS pages 98--115, Urbana, IL, USA, 2003. Springer-Verlag Heidelberg.
[4]
C. Bettstetter. Mobility modeling in wireless networks: Categorization, smooth movement, and border effects. ACM SIGMOBILE Mobile Computing and Communications 5:55--66, 2001.
[5]
C. Bettstetter. Smooth is better than sharp: a random mobility model for simulation of wireless networks. In Proceedings of the 4th ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems pages 19--27, Rome, Italy, 2001.
[6]
C. Bettstetter, H. Hartenstein, and X. Perez-Cost. Stochastic properties of the andom waypoint mobility model. ACM/Kluwer Wireless Networks 10(5):555--567, 2004.
[7]
C. Bettstetter, G. Resta, and P. Santi. The node distribution of the random waypoint mobility model for wireless ad hoc networks. In IEEE Transactions on Mobile Computing volume 2, July?September 2003.
[8]
J. Boch, D. A. Maltz, D. B. Johnson, Y. Hu, and J. Jetcheva. Aperfo mance comparison of multi-hop wireless ad hoc network routing protocols. In Proceedings of the Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), October 1998.
[9]
T. Camp, J. Boleng, and V. Davies. Asurvey of mobility models for ad hoc network research. Wireless Communication & Mobile Computing (WCMC): Special issue on Mobile Ad Hoc Networking: Research, Trends and Applications 2(5):483--502, 2002.
[10]
C. A. V. Campos, D. C. Otero, and L. F. M. de Moraes. Realistic individual mobility markovian models for mobile ad hoc networks. IEEE Wireless Communications and Networking Conference 2004.
[11]
C.-C. Chiang. Wireless Network Multicasting PhD thesis, University of California, Los Angeles, 1998.
[12]
P. Fernandes, B. Plateau, and W. J. Stewart. Efficient descriptor - Vector multiplication in Stochastic Automata Networks. Journal of the ACM 45(3):381--414, 1998.
[13]
P. G. Fuggeta, A. and G. Vigna. Understanding code mobility. IEEE Trans. On Software Engineering 24:342--361, 1998.
[14]
J. Garcia-Luna-Aceves and M. Spohn. Source-tree routing in wireless networks. In Proceedings of the 7th International Conference on Network Protocols (ICNP), 1999.
[15]
A. Jardosh, E. M. BeldingRoyer, K. C. Almeroth, and S. Suri. Towards ealistic mobility models for mobile ad hoc networks. MobiCom 2003.
[16]
L. Kleinrock and J. Silvester. Optimum transmission radii for packet radio networks or why six is a magic number. In Proceedings of the IEEE National Telecommunications Conference 1978.
[17]
B. L., F. P., and S. A. The need for and the advantages of generalized tensor algebra for kronecke structured representations. International Journal of Simulation: Systems, Science & Technology 6(3--4):52--60, February 2005.
[18]
G. Lin, G. oubir, and R. Rajaraman. Mobility models for ad hoc network simulation. In Proceedings of the Conference on Computer Communications (IEEE Infocom), 2004.
[19]
R. Milner. Communicating and mobile systems: the π-calculus Cambridge University Press, USA, 1999.
[20]
A. Nilsson. Performance analysis of traffic load and node density in ad hoc networks. Proceedings of the 5th European Wireless 2004: Mobile and Wireless Systems beyond 3G 2004.
[21]
B. Plateau and K. Atif. Stochastic Automata Networks for modelling parallel systems. IEEE Transactions on Software Engineering 17(10):1093--1108, 1991.
[22]
G. Resta and P. Santi. An analysis of the node spatial distribution of the random waypoint mobility model for ad hoc networks. ACM Workshop On Principles of Mobile Computing 2002.
[23]
E. M. Royer, P. M. Melliar-Smith, and L. E. Moser. An Analysis of the Optimum Node Density fo Ad hoc Mobile Networks. IEEE International Conference on Communications 3:857--861, 2001.
[24]
I. Rubin and C. Choi. Impact of the location area structure on the performance of signaling channels in wireless cellular networks. IEEE Communications Magazine pages 108--115, 1997.
[25]
W. J. Stewart. Introduction to the numerical solution of Markov chains Princeton University Press, 1994.
[26]
M. Zonoozi and P. Dassanayake. User mobility modeling and characterization of mobility pattern. IEEE Journal on Selected Areas in Communications 15(7):1239--1252, 1997.

Cited By

View all
  • (2021)Using Overhearing and Rateless Coding in Disseminating Various Messages in Vehicular AdHoc NetworksIEEE Access10.1109/ACCESS.2021.31109459(125052-125064)Online publication date: 2021
  • (2011)Structured Markovian models for discrete spatial mobile node distributionJournal of the Brazilian Computer Society10.1007/s13173-010-0026-y17:1(31-52)Online publication date: 12-Jan-2011
  • (2010)Secure three-party key distribution protocol for fast network access in EAP-based wireless networksComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2010.04.01454:15(2651-2673)Online publication date: 1-Oct-2010
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
PE-WASUN '06: Proceedings of the 3rd ACM international workshop on Performance evaluation of wireless ad hoc, sensor and ubiquitous networks
October 2006
176 pages
ISBN:1595934871
DOI:10.1145/1163610
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 06 October 2006

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. mobility patterns
  2. stochastic automata networks
  3. stochastic models
  4. wireless networks

Qualifiers

  • Article

Conference

MSWiM06
Sponsor:

Acceptance Rates

PE-WASUN '06 Paper Acceptance Rate 16 of 50 submissions, 32%;
Overall Acceptance Rate 70 of 240 submissions, 29%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 07 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2021)Using Overhearing and Rateless Coding in Disseminating Various Messages in Vehicular AdHoc NetworksIEEE Access10.1109/ACCESS.2021.31109459(125052-125064)Online publication date: 2021
  • (2011)Structured Markovian models for discrete spatial mobile node distributionJournal of the Brazilian Computer Society10.1007/s13173-010-0026-y17:1(31-52)Online publication date: 12-Jan-2011
  • (2010)Secure three-party key distribution protocol for fast network access in EAP-based wireless networksComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2010.04.01454:15(2651-2673)Online publication date: 1-Oct-2010
  • (2009)A novel data dissemination method for vehicular networks with rateless codesProceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference10.5555/1688345.1688851(2903-2908)Online publication date: 5-Apr-2009
  • (2009)Evaluating the impact of an acknowledgment strategy for APRPProceedings of the 5th International Latin American Networking Conference10.1145/1636682.1636695(77-86)Online publication date: 24-Sep-2009
  • (2009)A Novel Data Dissemination Method for Vehicular Networks with Rateless Codes2009 IEEE Wireless Communications and Networking Conference10.1109/WCNC.2009.4917521(1-6)Online publication date: Apr-2009
  • (2009)CORP: Cooperative rateless code protocol for vehicular content dissemination2009 8th IFIP Annual Mediterranean Ad Hoc Networking Workshop10.1109/MEDHOCNET.2009.5205197(1-7)Online publication date: Jun-2009

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media