Skip to main content

Mobility Models and Behavioural Equivalence for Wireless Networks

  • Conference paper
Coordination Models and Languages (COORDINATION 2009)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 5521))

Included in the following conference series:

Abstract

In protocol development for wireless systems, the choice of appropriate mobility models describing the movement patterns of devices has long been recognised as a crucial factor for the successful evaluation of protocols. More recently, wireless protocols have also come into the focus of formal approaches to the modelling and verification of concurrent systems. While in these approaches mobility is also given a central role, the actual mobility modelling remains simplistic since arbitrary node movements are allowed. This leads to a huge behavioural overapproximation that might prevent a successful reasoning about protocol properties. In this paper we describe how to extend a process calculus by realistic mobility models in an orthogonal way. The semantics of our calculus incorporates a notion of global time passing that allows us to express a wide range of mobility models currently used in protocol development practice. Using the behavioural equivalence and pre-order of our calculus, we are furthermore able to compare the strength of these models in our approach.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baeten, J.C.M., Bergstra, J.A.: Real time process algebra. Formal Aspects of Computing 3(2), 142–188 (1991)

    Article  MATH  Google Scholar 

  2. Camp, T., Boleng, J., Davies, V.: A survey of mobility models for ad hoc network research. Wireless Communications and Mobile Computing 2(5), 483–502 (2002)

    Article  Google Scholar 

  3. Ene, C., Muntean, T.: A broadcast-based calculus for communicating systems. In: Proc. FMPPTA 2003 (2001)

    Google Scholar 

  4. Godskesen, J.C.: A calculus for mobile ad hoc networks. In: Murphy, A.L., Vitek, J. (eds.) COORDINATION 2007. LNCS, vol. 4467, pp. 132–150. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  5. Godskesen, J.C.: A calculus for mobile ad hoc networks with static location binding. In: Proc. EXPRESS 2008 (2008)

    Google Scholar 

  6. Hermanns, H., Herzog, U., Katoen, J.-P.: Process algebra for performance evaluation. Theoretical Computer Science 274(1-2), 43–87 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  7. Merro, M.: An observational theory for mobile ad hoc networks. In: Proc. MFPS 2007. ENTCS, vol. 173, pp. 275–293 (2007)

    Google Scholar 

  8. Mezzetti, N., Sangiorgi, D.: Towards a calculus for wireless systems. In: Proc. MFPS 2006. ENTCS, vol. 158, pp. 331–353 (2006)

    Google Scholar 

  9. Nanz, S.: Specification and Security Analysis of Mobile Ad-Hoc Networks. Ph.D thesis, Imperial College London (2006)

    Google Scholar 

  10. Nanz, S., Hankin, C.: A framework for security analysis of mobile wireless networks. Theoretical Computer Science 367(1-2), 203–227 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  11. Nanz, S., Nielson, F., Nielson, H.R.: Topology-dependent abstractions of broadcast networks. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 226–240. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  12. The Network Simulator ns-2, http://www.isi.edu/nsnam/ns/

  13. Prasad, K.V.S.: A calculus of broadcasting systems. Science of Computer Programming 25(2-3), 285–327 (1995)

    Article  MathSciNet  Google Scholar 

  14. Reed, G.M., Roscoe, A.W.: A timed model for communicating sequential processes. Theoretical Computer Science 58, 249–261 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  15. Singh, A., Ramakrishnan, C.R., Smolka, S.A.: A process calculus for mobile ad hoc networks. In: Lea, D., Zavattaro, G. (eds.) COORDINATION 2008. LNCS, vol. 5052, pp. 296–314. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  16. Yi, W.: Real-time behaviour of asynchronous agents. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 502–520. Springer, Heidelberg (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 IFIP International Federation for Information Processing

About this paper

Cite this paper

Godskesen, J.C., Nanz, S. (2009). Mobility Models and Behavioural Equivalence for Wireless Networks. In: Field, J., Vasconcelos, V.T. (eds) Coordination Models and Languages. COORDINATION 2009. Lecture Notes in Computer Science, vol 5521. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02053-7_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02053-7_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02052-0

  • Online ISBN: 978-3-642-02053-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics