Calder, M. and Sevegnani, M. (2014) Modelling IEEE 802.11 CSMA/CA RTS/CTS with stochastic bigraphs with sharing. Formal Aspects of Computing, 26(3), pp. 537-561. (doi: 10.1007/s00165-012-0270-3)
|
Text
74312.pdf - Published Version 1MB |
Publisher's URL: http://dx.doi.org/10.1007/s00165-012-0270-3
Abstract
Stochastic bigraphical reactive systems (SBRS) is a recent formalism for modelling systems that evolve in time and space. However, the underlying spatial model is based on sets of trees and thus cannot represent spatial locations that are shared among several entities in a simple or intuitive way. We adopt an extension of the formalism, SBRS with sharing, in which the topology is modelled by a directed acyclic graph structure. We give an overview of SBRS with sharing, we extend it with rule priorities, and then use it to develop a model of the 802.11 CSMA/CA RTS/CTS protocol with exponential backoff, for an arbitrary network topology with possibly overlapping signals. The model uses sharing to model overlapping connectedness areas, instantaneous prioritised rules for deterministic computations, and stochastic rules with exponential reaction rates to model constant and uniformly distributed timeouts and constant transmission times. Equivalence classes of model states modulo instantaneous reactions yield states in a CTMC that can be analysed using the model checker PRISM. We illustrate the model on a simple example wireless network with three overlapping signals and we present some example quantitative properties.
| Item Type: | Articles |
|---|---|
| Status: | Published |
| Refereed: | Yes |
| Glasgow Author(s) Enlighten ID: | Sevegnani, Dr Michele and Calder, Professor Muffy |
| Authors: | Calder, M., and Sevegnani, M. |
| College/School: | College of Science and Engineering > School of Computing Science |
| Journal Name: | Formal Aspects of Computing |
| Publisher: | Springer Verlag |
| ISSN: | 0934-5043 |
| ISSN (Online): | 1433-299X |
| Published Online: | 08 January 2013 |
| Copyright Holders: | Copyright © 2013 BCS |
| First Published: | First published in Formal Aspects of Computing |
| Publisher Policy: | Reproduced in accordance with the copyright policy of the publisher |
University Staff: Request a correction | Enlighten Editors: Update this record
Funder and Project Information
Funder and Project Information