A Process Algebra for Link Layer Protocols

We propose a process algebra for link layer protocols, featuring a unique mechanism for modelling frame collisions. We also formalise suitable liveness properties for link layer protocols specified in this framework. To show applicability we model and analyse two versions of the Carrier-Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol. Our analysis confirms the hidden station problem for the version without virtual carrier sensing. However, we show that the version with virtual carrier sensing not only overcomes this problem, but also the exposed station problem with probability 1. Yet the protocol cannot guarantee packet delivery, not even with probability 1.

[1]  Carroll Morgan,et al.  Remarks on Testing Probabilistic Processes , 2007, Computation, Meaning, and Logic.

[2]  Annabelle McIver,et al.  A Process Algebra for Wireless Mesh Networks used for Modelling, Verifying and Analysing AODV , 2013, ArXiv.

[3]  Carroll Morgan,et al.  Scalar Outcomes Suffice for Finitary Probabilistic Testing , 2007, ESOP.

[4]  Rocco De Nicola,et al.  Three logics for branching bisimulation , 1995, JACM.

[5]  Gilbert Held.  Understanding Data Communications , 1991 .

[6]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

[7]  Muffy Calder,et al.  Modelling IEEE 802.11 CSMA/CA RTS/CTS with stochastic bigraphs with sharing , 2012, Formal Aspects of Computing.

[8]  Robert de Simone,et al.  Higher-Level Synchronising Devices in Meije-SCCS , 1985, Theor. Comput. Sci..

[9]  Guoliang Zheng,et al.  Removing Irrelevant Atomic Formulas for Checking Timed Automata Efficiently , 2003, FORMATS.

[10]  C. R. Ramakrishnan,et al.  A process calculus for Mobile Ad Hoc Networks , 2010, Sci. Comput. Program..

[11]  Sanjay Gupta,et al.  Performance modeling of asynchronous data transfer methods of IEEE 802.11 MAC protocol , 1997, Wirel. Networks.

[12]  Douglas E. Comer.  Computer Networks and Internets -5/E. , 2013 .

[13]  Rob J. van Glabbeek,et al.  A Timed Process Algebra for Wireless Networks with an Application in Routing - (Extended Abstract) , 2016, ESOP.

[14]  Marie Duflot,et al.  Practical Applications of Probabilistic Model Checking to Communication Protocols , 2012 .

[15]  Matthias Fruth,et al.  Probabilistic Model Checking of Contention Resolution in the IEEE 802.15.4 Low-Rate Wireless Personal Area Network Protocol , 2006, Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (isola 2006).

[16]  William A. Shay.  Understanding Data Communications and Networks, Third Edition , 2003 .

[17]  Thomas Hérault,et al.  Probabilistic Model Checking of the CSMA/CD Protocol Using PRISM and APMC , 2005, AVoCS.

[18]  William Allen Simpson,et al.  The Point-to-Point Protocol (PPP) , 1993, RFC.

[19]  Amir Pnueli,et al.  The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[20]  Arne Skou,et al.  Modelling and analysis of a collision avoidance protocol using Spin and Uppaal , 1996, The Spin Verification System.

[21]  Sjoerd Cranen,et al.  A Rule Format for Associativity , 2008, CONCUR.

[22]  A. Girotra,et al.  Performance Analysis of the IEEE 802 . 11 Distributed Coordination Function , 2005 .

[23]  Annabelle McIver,et al.  A Process Algebra for Wireless Mesh Networks , 2012, ESOP.