A Calculus for Mobile Ad Hoc Networks from a Group Probabilistic Perspective

Mobile Ad hoc Networks (MANETs) are networks dynamically formed by mobile nodes without the support of prior stationary infrastructures. The essential features of such a network are local broadcast, mobility and probability. In our earlier work, we proposed the pw-calculus to formally model and reason about MANTEs from a group probabilistic perspective, in which a MANET node can locally broadcast messages to a group of nodes within its physical transmission range with a certain probability. The group probabilities depend on the network topology which can evolve with the mobility of nodes. In this paper, to capture the behavior equivalence of networks, the structural congruence is investigated and the operational semantics is refined. Moreover, we define the notion of open bisimulation and prove it to be a congruence relation. Based on this, we discuss several nontrivial properties of MANETs such as mobile node equivalence and replacement. Finally, we by a case study illustrate our calculus and use it to analyze the probability of a transmission via routines.

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

[2]  Tracy Camp,et al.  A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..

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

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

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

[6]  Fatemeh Ghassemi,et al.  Restricted Broadcast Process Theory , 2008, 2008 Sixth IEEE International Conference on Software Engineering and Formal Methods.

[7]  Lei Song,et al.  Probabilistic Mobility Models for Mobile and Wireless Networks , 2010, IFIP TCS.

[8]  Qin Li,et al.  Towards a Probabilistic Calculus for Mobile Ad Hoc Networks , 2011, 2011 Fifth International Conference on Theoretical Aspects of Software Engineering.

[9]  Davide Sangiorgi,et al.  A Theory of Bisimulation for the pi-Calculus , 1993, CONCUR.

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

[11]  Sebastian Nanz,et al.  Mobility Models and Behavioural Equivalence for Wireless Networks , 2009, COORDINATION.

[12]  Chris Hankin,et al.  Formal Security Analysis for Ad-Hoc Networks , 2006, Electron. Notes Theor. Comput. Sci..

[13]  Davide Sangiorgi,et al.  A theory of bisimulation for the π-calculus , 2009, Acta Informatica.

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