Ad Hoc Routing Protocol Verification Through Broadcast Abstraction (original) (raw)

Automatized Verification of Ad Hoc Routing Protocols

Lecture Notes in Computer Science, 2004

Numerous specialized ad hoc routing protocols are currently proposed for use, or being implemented. Few of them have been subjected to formal verification. This paper evaluates two model checking tools, SPIN and UPPAAL, using the verification of the Lightweight Underlay Network Ad hoc Routing protocol (LUNAR) as a case study. Insights are reported in terms of identifying important modeling considerations and the types of ad hoc protocol properties that can realistically be verified.

Formal Verification of Routing Protocols for Wireless Ad Hoc Networks

Computer Communications and Networks, 2009

Routing is one of the most basic and important tasks in a collaborative computer network. Having a correct, robust and efficient routing protocol is fundamental to any wireless network. However, a difficult problem is how to guarantee these desirable qualities. Neither simulations nor testbed implementations can ensure the quality required for these protocols. As an alternative to these methods some researchers have successfully investigate the use of formal verification as a mean to guarantee the quality of routing protocols. Formal verification is a technique that assures a system has, or has not, a given propriety, based on a formal specification of the system under evaluation. This technique has proved to be a valuable tool, even contradicting some authors' claims and informal proofs. This chapter presents the main tools, proposals and techniques available to perform formal verification of routing algorithms for wireless ad hoc networks.

Methodology for Formal Verification of Routing Protocols for Ad Hoc Wireless Networks

2007

This paper describes a technique to apply formal methods to verify protocols for mobile ad hoc networks. In contrast to other related proposals, our solution does not attempt to model any particular network configuration. Instead, our solution focuses on the possible implications caused by network configurations to the behavior of a routing protocol for MANETs. Following this strategy we were able to find design errors in some well established protocols. The proposed technique uses formal verification, more specifically model checking, to detect, in a simple way, problems such as routing loops, delivery message failures and errors in the protocol state machine.

A More Realistic Model for Verifying Route Validity in Ad-Hoc Networks

Lecture Notes in Computer Science, 2014

Many cryptographic protocols aim at ensuring the route validity in ad-hoc networks, i.e. the established route representing an exists path in the network. However, flaws have been found in some protocols that are claimed secure (e.g. the attack on SRP applied to DSR). Some formal models and reduction proofs have been proposed to give more guarantees when verifying route validity and facilitate verification process. The existing approaches assume the cooperative attacker model. In this paper, we consider the non-cooperative attacker model, and we show that verifying the route validity under the non-cooperative model requires to verify only five topologies, each containing four nodes, and to consider only three malicious (compromised) nodes. Furthermore, we prove that a protocol is secure for any topology under the non-cooperative model, if and only if, it is secure for any topology under the cooperative model.

Mobile Networking and Ad hoc routing protocols validation

IOSR Journal of Computer Engineering, 2012

In this paper we describe mobile network and efficient routing protocol for wireless ad hoc networks. We report on its implementation, on performance comparisons and on a formal validation result. Moreover we discuss Cellular system design, global System for mobile Communication, Formal Protocol Verification and operating over infrared or Bluetooth. This paper evaluates two model checking tools, SPIN and UPPAAL, using the verification of the Ad hoc Routing protocol as a case study. Insights are reported in terms of identifying important modeling considerations and the types of ad hoc protocol properties that can realistically be verified.

Model checking mobile ad hoc networks

Formal Methods in System Design, 2016

Modeling arbitrary connectivity changes within mobile ad hoc networks (MANETs) makes application of automated formal verification challenging. We use constrained labeled transition systems as a semantic model to represent mobility. To model check MANET protocols with respect to the underlying topology and connectivity changes, we introduce a branching-time temporal logic. The path quantifiers are parameterized by multi-hop constraints over topologies, to discriminate the paths over which the temporal behavior should be investigated; the paths that violate the multi-hop constraints are not considered. A model checking algorithm is presented to verify MANETs that allow arbitrary mobility, under the assumption of reliable communication. It is applied to analyze a leader election protocol. 1 Introduction In mobile ad hoc networks (MANETs), nodes are equipped with wireless transceivers to communicate with each other. Wireless communication is restricted; only nodes located in the range of a transmitter receive data. Therefore, nodes rely on their neighbors to communicate with others along multi-hop connections. Due to e.g. noise from the environment, interferences, and temporary communication link errors, wireless communication is inherently unreliable, which together with mobility of nodes complicates the design of MANET protocols. Formal methods provide valuable tools to design, evaluate and verify MANET protocols. Restricted Broadcast Process Theory (RBPT) [17] is a process algebra that targets the specification and verification of MANETs, taking into account mobility. RBPT

Formal Verification of Route Request Procedure for AODV Routing Protocol

Many protocols have been designed for routing the packets from a source to destination. In Ad hoc on-demand routing protocol (AODV) the routing table maintains only one route to the specified node. The route is rediscovered by the source node when the earlier route fails. This paper aims to study the characteristics of Ad hoc networks and employ formal methods to model, investigate and analyze the routing protocol. The Z notation is used as a formal technique because of its abstract properties. In the proposed approach, it is specified how a source node can request for a route to the destination in AODV routing protocol. It is investigated how formal methods can be applied to the route discovery process in the AODV routing protocol. Finally, the formal specification is analyzed and validated using Z Eves tool.

Formal Verification of a New Version of AOMDV in ad hoc Network

Procedia Computer Science, 2014

In ad hoc networks like MANET the topology change frequently and interferences problems are inevitable in many cases, as a result link failures can arise. Unfortunately, traditional routing algorithms are no more suitable for this kind of networks especially in case of using a single path routing schemes. In order to overcome this problem, multipath routing approach is proposed where in some cases as an extension of the traditional routing algorithms. Our aim in this paper is to propose a formal study based on model checking to formally verify an enhancement version of AOMDV. In this new version we have added new functionalities in ROUTE DISCOVERY and ROUTE MAINTENANCE to achieve energy efficiency, packet overhead minimization and latency reduction.

Simulation validation using direct execution of wireless ad-hoc routing protocols

Proceedings of the …, 2004

Computer simulation is the most common approach to studying wireless ad-hoc routing algorithms. The results, however, are only as good as the models the simulation uses. One should not underestimate the importance of validation, as inaccurate models can lead to wrong conclusions. In this paper, we use direct-execution simulation to validate radio models used by ad-hoc routing protocols, against real-world experiments. This paper documents a common testbed that supports direct execution of a set of ad-hoc routing protocol implementations in a wireless network simulator. The testbed reads traces generated from real experiments, and uses them to drive direct-execution implementations of the routing protocols. Doing so we reproduce the same network conditions as in real experiments. By comparing routing behavior measured in real experiments with behavior computed by the simulation, we are able to validate the models of radio behavior upon which protocol behavior depends. We conclude that it is possible to have fairly accurate results using a simple radio model, but the