10 research outputs found
A mechanized proof of loop freedom of the (untimed) AODV routing protocol
The Ad hoc On-demand Distance Vector (AODV) routing protocol allows the nodes
in a Mobile Ad hoc Network (MANET) or a Wireless Mesh Network (WMN) to know
where to forward data packets. Such a protocol is 'loop free' if it never leads
to routing decisions that forward packets in circles. This paper describes the
mechanization of an existing pen-and-paper proof of loop freedom of AODV in the
interactive theorem prover Isabelle/HOL. The mechanization relies on a novel
compositional approach for lifting invariants to networks of nodes. We exploit
the mechanization to analyse several improvements of AODV and show that
Isabelle/HOL can re-establish most proof obligations automatically and identify
exactly the steps that are no longer valid.Comment: The Isabelle/HOL source files, and a full proof document, are
available in the Archive of Formal Proofs, at
http://afp.sourceforge.net/entries/AODV.shtm
Mechanizing a Process Algebra for Network Protocols
This paper presents the mechanization of a process algebra for Mobile Ad hoc
Networks and Wireless Mesh Networks, and the development of a compositional
framework for proving invariant properties. Mechanizing the core process
algebra in Isabelle/HOL is relatively standard, but its layered structure
necessitates special treatment. The control states of reactive processes, such
as nodes in a network, are modelled by terms of the process algebra. We propose
a technique based on these terms to streamline proofs of inductive invariance.
This is not sufficient, however, to state and prove invariants that relate
states across multiple processes (entire networks). To this end, we propose a
novel compositional technique for lifting global invariants stated at the level
of individual nodes to networks of nodes.Comment: This paper is an extended version of arXiv:1407.3519. The
Isabelle/HOL source files, and a full proof document, are available in the
Archive of Formal Proofs, at http://afp.sourceforge.net/entries/AWN.shtm
Key Perspectives in Power Aware Ad-hoc Internet of Things with Advanced Networks and Real Time Scenarios
Smart gadgets with integrated power optimization segments are the key perspectives that use Internet of Things (IoT) enabled technology to promote lifestyle advancements. It has an influence on a number of sectors in academia and/or business thanks to its strong integration with the current Cloud architecture. Recently, the Internet of Things has been acknowledged as a disruptive technology for the aerial ad hoc network. IoT may be thought of as a network inside a network. IoT-based networks rely heavily on the so-called self-organizing capability working in a dispersed manner in ad hoc networks, with users travelling at speeds ranging from walking pace to automobile, rail, or airline speed. IoT applications that assist logistics and the administration of ad hoc networks may be found in a broad variety. Utility companies are under pressure now to produce ever more enormous amounts of electricity. In megacities, there is an exponential rise in the number of people and energy users. Thus, the need for energy conservation is growing significantly on a global scale. The best way to optimise the rising energy demands and consumptions is as a consequence of the development of energy-monitoring systems. These solutions can cut current utilisation levels, stop energy waste, and make better use of our resources
Split, Send, Reassemble: A Formal Specification of a CAN Bus Protocol Stack
We present a formal model for a fragmentation and a reassembly protocol
running on top of the standardised CAN bus, which is widely used in automotive
and aerospace applications. Although the CAN bus comes with an in-built
mechanism for prioritisation, we argue that this is not sufficient and provide
another protocol to overcome this shortcoming.Comment: In Proceedings MARS 2017, arXiv:1703.0581
Formalising the Optimised Link State Routing Protocol
Routing protocol specifications are traditionally written in plain English.
Often this yields ambiguities, inaccuracies or even contradictions. Formal
methods techniques, such as process algebras, avoid these problems, thus
leading to more precise and verifiable descriptions of protocols. In this paper
we use the timed process algebra T-AWN for modelling the Optimised Link State
Routing protocol (OLSR) version 2.Comment: In Proceedings MARS 2020, arXiv:2004.1240
Reliable Restricted Process Theory
Malfunctions of a mobile ad hoc network (MANET) protocol caused by a conceptual mistake in the protocol design, rather than unreliable communication, can often be detected only by considering communication among the nodes in the network to be reliable. In Restricted Broadcast Process Theory, which was developed for the specification and verification of MANET protocols, the communication operator is lossy. Replacing unreliable with reliable communication invalidates existing results for this process theory. We examine the effects of this adaptation on the semantics of the framework with regard to the non-blocking property of communication in MANETs, the notion of behavioral equivalence relation and its axiomatization. To utilize our complete axiomatization for analyzing the correctness of protocols at the syntactic level, we introduce a precongruence relation which abstracts away from a sequence of multi-hop communications, leading to an application-level action preconditioned by a multi-hop constraint over the topology. We illustrate the applicability of our framework through a simple routing protocol. To prove its correctness, we introduce a novel proof process, based on our precongruence relation
Loop freedom of the (untimed) AODV routing protocol
Entry in the Archive of Formal Proofs (ISSN: 2150-914x)The Ad hoc On-demand Distance Vector (AODV) routing protocol allows the nodes in a Mobile Ad hoc Network (MANET) or a Wireless Mesh Network (WMN) to know where to forward data packets. Such a protocol is ‘loop free’ if it never leads to routing decisions that forward packets in circles.This development mechanises an existing pen-and-paper proof of loop freedom of AODV. The protocol is modelled in the Algebra of Wireless Networks (AWN), which is the subject of an earlier paper and AFP mechanization. The proof relies on a novel compositional approach for lifting invariants to networks of nodes.We exploit the mechanization to analyse several variants of AODV and show that Isabelle/HOL can re-establish most proof obligations automatically and identify exactly the steps that are no longer valid
Formal Modeling and Analysis of Mobile Ad hoc Networks
Fokkink, W.J. [Promotor]Luttik, S.P. [Copromotor