Broadcast Psi-calculi with an Application to Wireless Protocols

Borgström, Johannes; Huang, Shuqin; Johansson, Magnus; Raabjerg, Palle; Victor, Björn; Pohjola, Johannes Åman; Parrow, Joachim

doi:10.1007/978-3-642-24690-6_7

Cited by 16 publications

(11 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Ad hoc On-Demand Distance Vector (AODV) routing protocol [39] is a widely-used routing protocol designed for MANETs, and is one of the four protocols currently standardised by the IETF MANET working group 5 . It also forms the basis of new WMN routing protocols, including the Hybrid Wireless Mesh Protocol (HWMP) in the IEEE 802.11s wireless mesh network standard [27].…”

Section: The Aodv Routing Protocolmentioning

confidence: 99%

“…Several process algebras modelling broadcast communication have been proposed before: the Calculus of Broadcasting Systems (CBS) [45], the bπ-calculus [13], CBS # [36], the Calculus of Wireless Systems (CWS) [33], the Calculus of Mobile Ad Hoc Networks (CMAN) [21], the Calculus for Mobile Ad Hoc Networks (CMN) [32], the ω-calculus [49], restricted branching process theory (RBPT) [19], bAπ [22] and the broadcast psi-calculi [5]. The latter eight of these were specifically designed to model MANETs.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Modelling and verifying the AODV routing protocol

et al. 2016

View full text Add to dashboard Cite

This paper presents a formal specification of the Ad hoc On-Demand Distance Vector (AODV) routing protocol using AWN (Algebra for Wireless Networks), a recent process algebra which has been tailored for the modelling of Mobile Ad Hoc Networks and Wireless Mesh Network protocols. Our formalisation models the exact details of the core functionality of AODV, such as route discovery, route maintenance and error handling. We demonstrate how AWN can be used to reason about critical protocol properties by providing detailed proofs of loop freedom and route correctness.

show abstract

Section: The Aodv Routing Protocolmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Modelling and verifying the AODV routing protocol

et al. 2016

View full text Add to dashboard Cite

show abstract

“…Our calculus takes inspiration from algebraic models for wireless systems [21,29,23,14,13,24,25,19,22,35,12,8,5]. All these models adopt broadcast communication on partial topologies, while we consider point-to-point communication, as in [20].…”

Section: Conclusion Related and Future Workmentioning

confidence: 99%

A Semantic Theory of the Internet of Things

Castiglioni¹,

Lanotte²,

Merro³

2015

Preprint

View full text Add to dashboard Cite

We propose a process calculus for modelling systems in the Internet of Things paradigm. Our systems interact both with the physical environment, via sensors and actuators, and with smart devices, via short-range and Internet channels. The calculus is equipped with a standard notion of bisimilarity which is a fully abstract characterisation of a well-known contextual equivalence. We use our semantic proof-methods to prove run-time properties as well as system equalities of non-trivial IoT systems. * The contribution of this author is limited to an early writing of some of the proofs in the Appendix.

show abstract

“…Related Work. The UBSC follows the principles of [19], we provided semantics to a syntax for an unreliable broadcasting session calculus through an encoding into the psicalculus [4]. The work also provides with a sound session type system for the aforementioned syntax.…”

Section: Introductionmentioning

confidence: 99%

A Session Type System for Asynchronous Unreliable Broadcast Communication

Kouzapas,

Gutkovas,

Voinea

et al. 2019

Preprint

View full text Add to dashboard Cite

Session types are formal specifications of communication protocols, allowing protocol implementations to be verified by typechecking. Up to now, session type disciplines have assumed that the communication medium is reliable, with no loss of messages. However, unreliable broadcast communication is common in a wide class of distributed systems such as ad-hoc and wireless sensor networks. Often such systems have structured communication patterns that should be amenable to analysis by means of session types, but the necessary theory has not previously been developed. We introduce the Unreliable Broadcast Session Calculus, a process calculus with unreliable broadcast communication, and equip it with a session type system that we show is sound. We capture two common operations, broadcast and gather, inhabiting dual session types. Message loss may lead to non-synchronised session endpoints. To further account for unreliability we provide with an autonomous recovery mechanism that does not require acknowledgements from session participants Our type system ensures soundness, safety, and progress between the synchronised endpoints within a session. We demonstrate the expressiveness of our framework by implementing Paxos, the textbook protocol for reaching consensus in an unreliable, asynchronous network.

show abstract

Broadcast Psi-calculi with an Application to Wireless Protocols

Cited by 16 publications

References 21 publications

Modelling and verifying the AODV routing protocol

Modelling and verifying the AODV routing protocol

A Semantic Theory of the Internet of Things

A Session Type System for Asynchronous Unreliable Broadcast Communication

Contact Info

Product

Resources

About