Interconnections: bridges and routers
Interconnections: bridges and routers
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Exploring the Design of an Intentional Naming Scheme with an Automatic Constraint Analyzer
ASE '00 Proceedings of the 15th IEEE international conference on Automated software engineering
Testing methodology for an ad hoc routing protocol
Proceedings of the ACM international workshop on Performance monitoring, measurement, and evaluation of heterogeneous wireless and wired networks
A framework for security analysis of mobile wireless networks
Theoretical Computer Science - Automated reasoning for security protocol analysis
Extending Formal Methods for Software-Intensive Systems
Software-Intensive Systems and New Computing Paradigms
Formal modeling and verification of high-availability protocol for network security appliances
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Formal security analysis of Ariadne secure routing protocol using model checking
International Journal of Ad Hoc and Ubiquitous Computing
| Hi-index | 0.00 |
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.