Affiliations: Faculty of Electrical Engineering and Computer
Science, University of Maribor, Smetanova ul. 17, SI-2000 Maribor, Slovenia.
Tel.: +386 2 220 7213; Fax: +386 2 220 7272; E-mail: [email protected]
Abstract: This paper concerns the formal modelling of medium access control in
nonbeacon-enabled IEEE 802.15.4 wireless personal area networks with
probabilistic timed automata supported by the PRISM probabilistic model
checker. In these networks, the devices contend for the medium by executing an
unslotted carrier sense multiple access with collision avoidance algorithm. In
the literature, a model of a network which consists of two stations sending
data to two different destination stations is introduced. We have improved this
model and, based on it, we propose two ways of modelling a network with an
arbitrary number of sending stations, each having its own destination. We show
that the same models are valid representations of a star-shaped network with an
arbitrary number of stations which send data to the same destination station.
We also propose how to model such a network if some of the sending stations are
not within radio range of the others, i.e. if they are hidden. We present some
results obtained for these models by probabilistic model checking using
PRISM.
Keywords: Wireless personal area networks, medium access control, hidden stations, formal specification, probabilistic model checking