Modelling of AODV Routing Protocol using Timed Coloured Petri Nets

Abstract

Due to the nondeterministic nature of concurrent systems it is very challenging to design and develop the system. The most feasible way to handle the unavoidable and undetected errors of constructing any concurrent system is to build a model of that system before its actual development. Among various modelling technique, Petri net model has been proved to be a best technique for modelling and validating concurrent systems. One major application area of Petri nets is modelling routing protocols which ensures that it is unambiguous and functionality correct. In this paper Timed CPN is used to model and validate the process of Adhoc On-Demand Distance vector (AODV) routing protocol in the concurrent environment. AODV protocol is modelled in which an efficient packet transmission is done in the network with the node movement and frequent topology changes. Aimed to detect and maintain the routes in the dynamic environment and validate the key properties of AODV protocol.