Modelling and modular supervisory control for the AODV routing protocol

Abstract

The model of the Ad-hoc on Demand Distance Vector (AODV) routing protocol, being favorable in several wireless networks (Vehicular Ad-Hoc Networks (VANET), ZigBee etc.) is presented for a network with parametric number of nodes in the Ramadge Wonham (RW) framework of discrete event systems (DES). For a generic network, consisting of n nodes, the first goal is to introduce two specification rules, per node. The first rule guarantees the hierarchy of the requests of the nodes and the routing paths. The second rule offers a first level security regarding requests’ replies. The two rules are expressed as two regular languages. Each regular language is realized by a supervisor automaton. The two supervisor automata of each node compose the local controllers of a distributed supervisory control architecture controlling the total network. The physical realizability of the local controlled automaton is proved. Also, the nonblocking property and the satisfactory marked behavior of the total controlled automaton are proved. The complexity of the proposed distributed architecture is computed. To illustrate the effectiveness of the present control scheme, a four-node network simulation of the controlled automaton of the protocol is presented.