Probabilistic Mobility Models for Mobile and Wireless Networks

Research output: Conference Article in Proceeding or Book/Report chapterArticle in proceedingsResearchpeer-review


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.
Original languageEnglish
Title of host publicationIFIP Advances in Information and Communication Technology
Number of pages15
Publication date2010
Publication statusPublished - 2010
Event6th IFIP International Conference on Theoretical Computer Science - Brisbane, Australia
Duration: 20 Sept 201023 Sept 2010


Conference6th IFIP International Conference on Theoretical Computer Science
Internet address


Dive into the research topics of 'Probabilistic Mobility Models for Mobile and Wireless Networks'. Together they form a unique fingerprint.

Cite this