A timed model for communicating sequential processes
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
A calculus of broadcasting systems
ESOP '94 Selected papers of ESOP '94, the 5th European symposium on Programming
Process algebra for performance evaluation
Theoretical Computer Science
A Broadcast-based Calculus for Communicating Systems
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Real-Time Behaviour of Asynchronous Agents
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
A framework for security analysis of mobile wireless networks
Theoretical Computer Science - Automated reasoning for security protocol analysis
An Observational Theory for Mobile Ad Hoc Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards a Calculus For Wireless Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
A calculus for mobile ad hoc networks
COORDINATION'07 Proceedings of the 9th international conference on Coordination models and languages
A process calculus for mobile ad hoc networks
COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
Topology-dependent abstractions of broadcast networks
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
A calculus for the analysis of wireless network security protocols
FAST'10 Proceedings of the 7th International conference on Formal aspects of security and trust
A timed calculus for wireless systems
Theoretical Computer Science
A calculus of trustworthy ad hoc networks
FAST'09 Proceedings of the 6th international conference on Formal Aspects in Security and Trust
Observables for mobile and wireless broadcasting systems
COORDINATION'10 Proceedings of the 12th international conference on Coordination Models and Languages
A semantic analysis of key management protocols for wireless sensor networks
Science of Computer Programming
| Hi-index | 0.00 |
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.