1 Programming, Logic and Semantics, Software & Systems, The Department2 The Department3 Management, IT University of Copenhagen
In this paper we present a probabilistic broadcast calculus for mobile and wireless networks whose connections are unreliable. In our calculus broadcasted messages can be lost with a certain probability, and due to mobility the connection probabilities may change. If a network broadcasts a message from a location it will evolve to a network distribution depending on whether nodes at other locations receive the message or not. Mobility of locations is not arbitrary but guarded by a probabilistic mobility function (PMF) and we also define the notion of a weak bisimulation given a PMF. It is possible to have weak bisimular networks which have different probabilistic connectivity information. We also examine the relation between our weak bisimulation and a minor variant of PCTL*. Finally we apply our calculus on a small example called the ZeroConf protocol.
Ifip Advances in Information and Communication Technology, 2010
Main Research Area:
6th IFIP International Conference on Theoretical Computer Science, 2010