The Cost of Parameterized Reachability in Mobile Ad Hoc Networks

We investigate the impact of spontaneous movement in the complexity of verification problems for an automata-based protocol model of networks with selective broadcast communication. We first consider reachability of an error state and show that parameterized verification is decidable with polynomial complexity. We then move to richer queries and show how the complexity changes when considering properties with negation or cardinality constraints.

[1]  Chris Hankin,et al.  A framework for security analysis of mobile wireless networks , 2006, Theor. Comput. Sci..

[2]  R. Ladner.  The circuit value problem is log space complete for P , 1975, SIGA.

[3]  Jens Palsberg,et al.  Complexity Results for 1-Safe Nets , 1993, Theor. Comput. Sci..

[4]  Bengt Jonsson,et al.  Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols , 2008, TACAS.

[5]  Giorgio Delzanno,et al.  On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks , 2011, FoSSaCS.

[6]  Giorgio Delzanno,et al.  Parameterized Verification of Ad Hoc Networks , 2010, CONCUR.

[7]  Massimo Merro,et al.  An Observational Theory for Mobile Ad Hoc Networks , 2007, MFPS.

[8]  Massimo Merro,et al.  A timed calculus for wireless systems , 2011, Theor. Comput. Sci..

[9]  Ivan Lanese,et al.  An operational semantics for a calculus for wireless systems , 2010, Theor. Comput. Sci..

[10]  C. R. Ramakrishnan,et al.  A process calculus for Mobile Ad Hoc Networks , 2008, Sci. Comput. Program..

[11]  C. R. Ramakrishnan,et al.  Query-Based Model Checking of Ad Hoc Network Protocols , 2009, CONCUR.

[12]  K. V. S. Prasad.  A Calculus of Broadcasting Systems , 1991, Sci. Comput. Program..

[13]  L.F.W. van Hoesel,et al.  Modelling and Verification of the LMAC Protocol for Wireless Sensor Networks , 2007, IFM.

[14]  Traian Muntean,et al.  A broadcast-based calculus for communicating systems , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[15]  Charles Rackoff,et al.  The Covering and Boundedness Problems for Vector Addition Systems , 1978, Theor. Comput. Sci..

[16]  Parosh Aziz Abdulla,et al.  Verifying Programs with Unreliable Channels , 1996, Inf. Comput..

[17]  Alain Finkel,et al.  On the verification of broadcast protocols , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[18]  Jens Chr.  A Calculus for Mobile Ad Hoc Networks , 2007 .

[19]  Jens Chr. Godskesen.  A Calculus for Mobile Ad Hoc Networks , 2007, COORDINATION.