A mobile ad-hoc network (MANET) is an infrastructureless network established by a set of mobile devices using wireless communication. The Dynamic MANET On-demand (DYMO) protocol is a routing protocol for multi-hop communication in MANETs currently under development by the Internet Engineering Task Force (IETF). This paper presents a Coloured Petri Net (CPN) model of the mandatory parts of the DYMO protocol, and shows how scenario-based state space exploration has been used to validate key properties of the protocol. Our CPN modelling and verification work has spanned two revisions of the DYMO protocol specification and have had direct impact on the most recent version of the protocol specification.

An Abstract Model of Routing in Mobile Ad Hoc Networks

Modelling and Initial Validation of the DYMO Routing Protocol for Mobile Ad-Hoc Networks

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.

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

We propose an ad-hoc routing protocol using unicast-based route discovery in a hybrid wireless network, ECCA, which combines ad-hoc networking scheme with a centralized hierarchical network. The network aims to collect damage assessment information in disaster circumstances, maintaining connections between a base station (BS) and nodes by way of multihopping. In the event that a direct link between BS and a node disconnects, the node switches the mode from a cellular to an ad-hoc mode in order to access BS via neighboring nodes. A routing protocol proposed builds a route by way of monitoring neighbors' communications instead of broadcasting a route request packet. Experiments show that approximately 90% of nodes can discover a route within a few hops, even if only 20% of nodes are able to access BS directly. Even in a low node density, the network is capable of transferring data within three hops.

An ad-hoc routing protocol in hybrid wireless networks for emergency communications

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 investigated 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 property, 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.

Formal Verification of Routing Protocols for Wireless Ad Hoc Networks

NORA (Network rOle-based Routing Algorithm) is a novel routing algorithm for WSNs which combines various effective techniques in order to reduce energy consumption and improves data routes. There is a clear need for the use of formal methods to validate system performance and functionality prior to the deployment of such algorithms in a real environment. This paper presents a formal study of NORA. Coloured Petri Nets (CPNs) have been chosen as an appropriate modelling language. CPNs have been used to obtain complete and unambiguous specifications of system behaviour as well as CPNTools to evaluate the correctness of the protocol, using state space exploration, and performance evaluation.

An Abstract Model of Routing in Mobile Ad Hoc Networks

Citations

Modelling and Initial Validation of the DYMO Routing Protocol for Mobile Ad-Hoc Networks

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

An ad-hoc routing protocol in hybrid wireless networks for emergency communications

Formal Verification of Routing Protocols for Wireless Ad Hoc Networks

Formal modelling and performance evaluation of a novel role-based Routing Algorithm for wireless sensor networks

Related Papers (5)

A framework for routing in mobile ad hoc networks

Agent-Based Routing in Mobile Ad Hoc Networks

Multispanners for robust routing in mobile ad hoc networks.

Routing in Ad Hoc Networks

Routing for Ad-Hoc Networks

An Abstract Model of Routing in Mobile Ad Hoc Networks

Citations

Modelling and Initial Validation of the DYMO Routing Protocol for Mobile Ad-Hoc Networks

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

An ad-hoc routing protocol in hybrid wireless networks for emergency communications

Formal Verification of Routing Protocols for Wireless Ad Hoc Networks

Formal modelling and performance evaluation of a novel role-based Routing Algorithm for wireless sensor networks

Related Papers (5)

A framework for routing in mobile ad hoc networks

Agent-Based Routing in Mobile Ad Hoc Networks

Multispanners for robust routing in mobile ad hoc networks.

Routing in Ad Hoc Networks

Routing for Ad-­Hoc Networks

Routing for Ad-Hoc Networks