Broadcast Abstraction in a Stochastic Calculus for Mobile Networks

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


    We introduce a continuous time stochastic broadcast calculus for mobile and wireless networks. The mobility between nodes in a network is modeled by a stochastic mobility function which allows to change part of a network topology depending on an exponentially distributed delay and a network topology constraint. We allow continuous time stochastic behavior of processes running at network nodes, e.g. in order to be able to model randomized protocols. The introduction of group broadcast and an operator to help avoid flooding allows us to define a novel notion of broadcast abstraction. Finally, we define a weak bisimulation congruence and apply our theory on an example of a leader election protocol.
    Original languageEnglish
    Title of host publicationTheoretical Computer Science : Proceedings of the 7th IFIP TC 1/WG 2.2 International Conference, TCS 2012, Amsterdam, The Netherlands, September 26-28, 2012
    Number of pages15
    Publication dateSep 2012
    ISBN (Print) 978-3-642-33474-0
    Publication statusPublished - Sep 2012
    EventIFIP Theoretical Computer Science 2012 - Amsterdam, Netherlands
    Duration: 26 Sep 201228 Sep 2012


    ConferenceIFIP Theoretical Computer Science 2012
    Internet address
    SeriesLecture Notes in Computer Science


    • Stochastic Calculus
    • Broadcast Abstraction
    • Mobility


    Dive into the research topics of 'Broadcast Abstraction in a Stochastic Calculus for Mobile Networks'. Together they form a unique fingerprint.

    Cite this