A Process Calculus for Dynamic Networks

In this paper we propose a process calculus framework for dynamic networks in which the network topology may change as computation proceeds. The proposed calculus allows one to abstract away from neighborhood-discovery computations and it contains features for broadcasting at multiple transmission ranges and for viewing networks at different levels of abstraction. We develop a theory of confluence for the calculus and we use the machinery developed towards the verification of a leader-election algorithm for mobile ad hoc networks.

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

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

[3]  Anna Philippou,et al.  Verification Techniques for Distributed Algorithms , 2006, OPODIS.

[4]  Donald F. Towsley,et al.  Design and analysis of a leader election algorithm for mobile ad hoc networks , 2004, Proceedings of the 12th IEEE International Conference on Network Protocols, 2004. ICNP 2004..

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

[6]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[7]  Chris M. N. Tofts,et al.  Proof methods and pragmatics for parallel programming , 1990 .

[8]  Farhad Arbab,et al.  Coordination Models and Languages , 1998, Adv. Comput..

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

[10]  David Walker,et al.  Confluence of Processes and Systems of Objects , 1995, TAPSOFT.

[11]  Wan Fokkink,et al.  Equational Reasoning on Mobile Ad Hoc Networks , 2010, Fundam. Informaticae.

[12]  Massimo Merro,et al.  An Observational Theory for Mobile Ad Hoc Networks (full version) , 2009, Inf. Comput..

[13]  Jens Chr. Godskesen.  A Calculus for Mobile Ad-hoc Networks with Static Location Binding , 2009, EXPRESS.

[14]  Chryssis Georgiou,et al.  On the Application of Formal Methods for Specifying and Verifying Distributed Protocols , 2008, 2008 Seventh IEEE International Symposium on Network Computing and Applications.

[15]  Jan Friso Groote,et al.  Confluence for Process Verification , 1995, CONCUR.

[16]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[17]  Michael Thomas Sanderson,et al.  Proof techniques for CCS , 1983 .

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

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

[20]  ROBIN MILNER,et al.  Edinburgh Research Explorer A Calculus of Mobile Processes, I , 2003 .

[21]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[22]  David Walker,et al.  On Transformations of Concurrent-Object Programs , 1996, Theor. Comput. Sci..

[23]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[24]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[25]  Anna Philippou,et al.  On Confluence in the pi-Calculus , 1997, ICALP.

[26]  Davide Sangiorgi,et al.  Towards a Calculus For Wireless Systems , 2006, MFPS.