Abstract—Security of routing protocols is one of the crucial and emerging issues in Mobile Ad-hoc Networks. A lot of secure versions of routing protocols in Mobile Ad-hoc Networks have already been proposed by eminent researchers. But most of them are tested by means of simulation. Simulation techniques have their limitations as they can only find presence of error rather than absence of error. To overcome this situation, formal methods are used that can verify systems using theorem proving or automated model checking techniques. We are the first who propose a calculi for Intrusion Detection System (IDS) to secure routing in Mobile Ad-hoc Networks in a process algebraic framework. The proposed calculi is basically an extension of distributed pi calculus (Dpi). The novelty of the proposed calculi is to model stand-alone IDS covering both network & host-based IDSs. The calculi has two syntactic categories: one for nodes and another for processes. We justify our model by providing its reduction equivalence, after abstracting away the details of IDS (implementation), to its specification calculus for energy-aware broadcast, unicast and multicast communications of MANETs (E-BUM). We believe that such modelling helps in detecting intrusion(s) in Mobile Ad-hoc Networks and that in turn will provide secure and energy efficient route.
 

Index Terms—Process algebra for IDS, calculus for intrusion detection system in MANETs, formal framework for security in MANETs

Cite: Parul Yadav and Manish Gaur, "Process Calculi for Intrusion Detection System in Mobile Ad-hoc Networks," Journal of Communications, vol. 13, no. 11, pp. 635-647, 2018. Doi: 10.12720/jcm.13.11.635-647