Modelling probabilistic wireless networks

DOI10.2168/LMCS-9(3:26)2013MaRDI QIDQ2848371zbMATH OpenOpenAlexFDO

Authors Andrea Cerone, Matthew Hennessy

Publication date 26 September 2013

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1309.4693

zbMATH Keywords

probabilistic systemsprocess algebratesting preorderswireless networks

Mathematics Subject Classification ID

Network protocols (68M12) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Graph theory (including graph drawing) in computer science (68R10)

Abstract: We propose a process calculus to model high level wireless systems, where the topology of a network is described by a digraph. The calculus enjoys features which are proper of wireless networks, namely broadcast communication and probabilistic behaviour. We first focus on the problem of composing wireless networks, then we present a compositional theory based on a probabilistic generalisation of the well known may-testing and must-testing pre- orders. Also, we define an extensional semantics for our calculus, which will be used to define both simulation and deadlock simulation preorders for wireless networks. We prove that our simulation preorder is sound with respect to the may-testing preorder; similarly, the deadlock simulation pre- order is sound with respect to the must-testing preorder, for a large class of networks. We also provide a counterexample showing that completeness of the simulation preorder, with respect to the may testing one, does not hold. We conclude the paper with an application of our theory to probabilistic routing protocols.

Recommendations

• Probabilistic mobility models for mobile and wireless networks
• Modelling MAC-layer communications in wireless systems
• A process calculus for mobile ad hoc networks
• A process algebra for wireless mesh networks
• A timed calculus for wireless systems

Cited in

(14)

• A Markov renewal based model for wireless networks
• Modeling local area computer networks with consideration for time probabilistic characteristics
• Depletable channels: dynamics, behaviour, and efficiency in network design
• Characterising testing preorders for broadcasting distributed systems
• \textsf{Tarzan}: communicating and moving in wireless jungles
• A process algebra for wireless mesh networks
• Semantic analysis of gossip protocols for wireless sensor networks
• Broadcast psi-calculi with an application to wireless protocols
• Probabilistic mobility models for mobile and wireless networks
• A Random Graph Model of Mobile Wireless Networks
• Topology-Dependent Abstractions of Broadcast Networks
• Equational reasonings in wireless network gossip protocols
• Assertion-based reasoning method for calculus of wireless system
• Modelling MAC-layer communications in wireless systems

This page was built for publication: Modelling probabilistic wireless networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848371)