Probabilistic Model Checking of the IEEE 802.11 Wireless Local Area Network Protocol
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Performance analysis of probabilistic timed automata using digital clocks
Formal Methods in System Design
Wireless sensor networks: A survey on the state of the art and the 802.15.4 and ZigBee standards
Computer Communications
Perspectives in Probabilistic Verification
TASE '08 Proceedings of the 2008 2nd IFIP/IEEE International Symposium on Theoretical Aspects of Software Engineering
ISOLA '06 Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation
Mobile Information Systems - Advances in Wireless Networks
Does clock precision influence ZigBee's energy consumptions?
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
IEEE 802.15.4 modifications and their impact
Mobile Information Systems
PRISM 4.0: verification of probabilistic real-time systems
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Hi-index | 0.00 |
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.