Probabilistic Mobility Models for Mobile and Wireless Networks
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 nodes 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 furthermore 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 .
- 5.Merro, M.: An Observational Theory for Mobile Ad-hoc Networks. Electronic Notes in Theoretical Computer Scienc, vol. 173, pp. 275–293. Elsevier, Amsterdam (2007)Google Scholar
- 8.Godskesen, J.C.: A Calculus for Mobile Ad-hoc Networks with Static Location Binding. In: 15th International Workshop on Expressiveness in Concurrency (2008)Google Scholar
- 11.Merro, M., Sibilio, E.: A Timed Calculus for Wireless Systems. In: Arbab, F., Sirjani, M. (eds.) FSEN 2009. LNCS, vol. 5961, pp. 228–243. Springer, Heidelberg (2010)Google Scholar