Skip to main content

A Methodology for Model-Checking Ad-hoc Networks

  • Conference paper
  • First Online:
Model Checking Software (SPIN 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2648))

Included in the following conference series:

  • 488 Accesses

Abstract

Wireless networks, specifically ad-hoc networks, are characterised by rapidly changing network topologies. The dynamic nature of ad-hoc networks makes protocol design and assessment particularly challenging. We present a methodology, based on CSP and the FDR model-checker, to validate critical properties of ad-hoc networks, properties like self-stabilisation. Our work started by applying CSP/FDR to a tactical internet (a military mobile network). The techniques developed there were generalised to our methodology for model-checking ad-hoc networks, and more general self-configuring systems. We first give an overview of the results of model-checking the tactical internet, then we describe the methodology on an ad-hoc network case study, namely the Cluster-Based Routing Protocol. The methodology is quite generic, but it enables the complex dynamic properties of ad-hoc networks to be captured quickly and easily, in models that are ususally readily tractable. We end with a brief discussion of some of its other applications.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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.

Similar content being viewed by others

References

  1. Perlman, R. Interconnections: Bridges, Switches and Routers. Addison-Wesley, 1999.

    Google Scholar 

  2. http://www.cs.uiowa.edu/ftp/selfstab/bibliography/

  3. http://www.ietf.org/html.charters/manet-charter.html

  4. Roscoe, A. W. The Theory and Practice of Concurrency. Prentice-Hall, 1998.

    Google Scholar 

  5. http://www.comp.nus.edu.sg/~tayyc/cbrp/

  6. Rodeh, O., K. Birman, D. Dolev. Optimized Group Rekey for Group Communication Systems. Network and Distributed System Security, 2000.

    Google Scholar 

  7. Creese, S. Data Independent Induction: CSP Model-checking of Arbitrary Sized Networks. DPhil thesis, University of Oxford, Computing Laboratory, 2001.

    Google Scholar 

  8. Milner, R. Communicating and Mobile Systems: The Pi-Calculus. Cambridge University Press, May 1999.

    Google Scholar 

  9. Khurshid, S., D. Jackson. Exploring the Design of an Intentional Naming Scheme with an Automatic Constraint Analyzer. In Proceedings of 15th IEEE International Conference on Automated Software Engineering, Grenoble, France, September 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zakiuddin, I., Goldsmith, M., Whittaker, P., Gardiner, P. (2003). A Methodology for Model-Checking Ad-hoc Networks. In: Ball, T., Rajamani, S.K. (eds) Model Checking Software. SPIN 2003. Lecture Notes in Computer Science, vol 2648. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44829-2_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-44829-2_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40117-9

  • Online ISBN: 978-3-540-44829-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy