A Calculus for Mobile Ad-hoc Networks with Static Location Binding

Jens Chr. Godskesen
2009 Electronical Notes in Theoretical Computer Science  
We present a process calculus for mobile ad hoc networks which is a natural continuation of our earlier work on the process calculus CMAN [6]. Essential to the new calculus is the novel restricted treatment of node mobility imposed by hiding of location names using a static binding operator, and we introduce the more general notion of unidirectional links instead of bidirectional links. We define a natural weak reduction semantics and a reduction congruence and prove our weak contextual
more » ... tion equivalence to be a sound and complete co-inductive characterization of the reduction congruence. The two changes to the calculus in [6] yields a much simpler bisimulation semantics, and importantly and in contrast to [6] we manage to provide a non-contextual weak bisimulation congruence facilitating ease of proofs and being strictly contained in the contextual bisimulation.
doi:10.1016/j.entcs.2009.06.018 fatcat:sl2xt4fwinfzzougn5lbsoymsi