Formal methods for the analysis of wireless network protocols

<p>In this thesis, we present novel software technology for the analysis of wireless networks, an emerging area of computer science. To address the widely acknowledged lack of formal foundations in this field, probabilistic model checking, a formal method for verification and performance analy...

Full description

Bibliographic Details
Main Author: Fruth, M
Other Authors: Kwiatkowska, MZ
Format: Thesis
Language:English
Published: 2011
Subjects:
_version_ 1826300743799275520
author Fruth, M
author2 Kwiatkowska, MZ
author_facet Kwiatkowska, MZ
Fruth, M
author_sort Fruth, M
collection OXFORD
description <p>In this thesis, we present novel software technology for the analysis of wireless networks, an emerging area of computer science. To address the widely acknowledged lack of formal foundations in this field, probabilistic model checking, a formal method for verification and performance analysis, is used. Contrary to test and simulation, it systematically explores the full state space and therefore allows reasoning about all possible behaviours of a system.</p><p>This thesis contributes to design, modelling, and analysis of ad-hoc networks and randomised distributed coordination protocols.</p><p>First, we present a new hybrid approach that effectively combines probabilistic model checking and state-of-the-art models from the simulation community in order to improve the reliability of design and analysis of wireless sensor networks and their protocols. We describe algorithms for the automated generation of models for both analysis methods and their implementation in a tool.</p><p>Second, we study spatial properties of wireless sensor networks, mainly with respect to Quality of Service and energy properties.</p><p>Third, we investigate the contention resolution protocol of the networking standard ZigBee. We build a generic stochastic model for this protocol and analyse Quality of Service and energy properties of it. Furthermore, we assess the applicability of different interference models.</p><p>Fourth, we explore slot allocation protocols, which serve as a bandwidth allocation mechanism for ad-hoc networks. We build a generic model for this class of protocols, study real-world protocols, and optimise protocol parameters with respect to Quality of Service and energy constraints. We combine this with the novel formalisms for wireless communication and interference models, and finally we optimise local (node) and global (network) routing policies.</p><p>This is the first application of probabilistic model checking both to protocols of the ZigBee standard and protocols for slot allocation.</p>
first_indexed 2024-03-07T05:21:49Z
format Thesis
id oxford-uuid:df2c08f4-001c-42d3-a2f4-9922f081fb49
institution University of Oxford
language English
last_indexed 2024-03-07T05:21:49Z
publishDate 2011
record_format dspace
spelling oxford-uuid:df2c08f4-001c-42d3-a2f4-9922f081fb492022-03-27T09:37:35ZFormal methods for the analysis of wireless network protocolsThesishttp://purl.org/coar/resource_type/c_db06uuid:df2c08f4-001c-42d3-a2f4-9922f081fb49Computer science (mathematics)Program development and toolsTheory and automated verificationEnglishOxford University Research Archive - Valet2011Fruth, MKwiatkowska, MZ<p>In this thesis, we present novel software technology for the analysis of wireless networks, an emerging area of computer science. To address the widely acknowledged lack of formal foundations in this field, probabilistic model checking, a formal method for verification and performance analysis, is used. Contrary to test and simulation, it systematically explores the full state space and therefore allows reasoning about all possible behaviours of a system.</p><p>This thesis contributes to design, modelling, and analysis of ad-hoc networks and randomised distributed coordination protocols.</p><p>First, we present a new hybrid approach that effectively combines probabilistic model checking and state-of-the-art models from the simulation community in order to improve the reliability of design and analysis of wireless sensor networks and their protocols. We describe algorithms for the automated generation of models for both analysis methods and their implementation in a tool.</p><p>Second, we study spatial properties of wireless sensor networks, mainly with respect to Quality of Service and energy properties.</p><p>Third, we investigate the contention resolution protocol of the networking standard ZigBee. We build a generic stochastic model for this protocol and analyse Quality of Service and energy properties of it. Furthermore, we assess the applicability of different interference models.</p><p>Fourth, we explore slot allocation protocols, which serve as a bandwidth allocation mechanism for ad-hoc networks. We build a generic model for this class of protocols, study real-world protocols, and optimise protocol parameters with respect to Quality of Service and energy constraints. We combine this with the novel formalisms for wireless communication and interference models, and finally we optimise local (node) and global (network) routing policies.</p><p>This is the first application of probabilistic model checking both to protocols of the ZigBee standard and protocols for slot allocation.</p>
spellingShingle Computer science (mathematics)
Program development and tools
Theory and automated verification
Fruth, M
Formal methods for the analysis of wireless network protocols
title Formal methods for the analysis of wireless network protocols
title_full Formal methods for the analysis of wireless network protocols
title_fullStr Formal methods for the analysis of wireless network protocols
title_full_unstemmed Formal methods for the analysis of wireless network protocols
title_short Formal methods for the analysis of wireless network protocols
title_sort formal methods for the analysis of wireless network protocols
topic Computer science (mathematics)
Program development and tools
Theory and automated verification
work_keys_str_mv AT fruthm formalmethodsfortheanalysisofwirelessnetworkprotocols