Skip to Main content Skip to Navigation
Conference papers

Probabilistic Mobility Models for Mobile and Wireless Networks

Abstract : 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* [1]. Finally, we apply our calculus on a small example called the Zeroconf protocol [2].
Document type :
Conference papers
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/hal-01054442
Contributor : Hal Ifip <>
Submitted on : Wednesday, August 6, 2014 - 4:24:40 PM
Last modification on : Friday, March 22, 2019 - 4:46:03 PM
Long-term archiving on: : Wednesday, November 26, 2014 - 12:55:55 AM

File

03230086.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Lei Song, Jens Chr. Godskesen. Probabilistic Mobility Models for Mobile and Wireless Networks. 6th IFIP TC 1/WG 2.2 International Conference on Theoretical Computer Science (TCS) / Held as Part of World Computer Congress (WCC), Sep 2010, Brisbane, Australia. pp.86-100, ⟨10.1007/978-3-642-15240-5_7⟩. ⟨hal-01054442⟩

Share

Metrics

Record views

150

Files downloads

241