http://www.colloquiam.com/wd/index.php?action=history&feed=atom&title=Song_et_al_2012aSong et al 2012a - Revision history2026-05-11T07:20:40ZRevision history for this page on the wikiMediaWiki 1.27.0-wmf.10http://www.colloquiam.com/wd/index.php?title=Song_et_al_2012a&diff=174670&oldid=prevScipediacontent: Scipediacontent moved page Draft Content 435586299 to Song et al 2012a2020-10-14T12:50:29Z<p>Scipediacontent moved page <a href="/public/Draft_Content_435586299" class="mw-redirect" title="Draft Content 435586299">Draft Content 435586299</a> to <a href="/public/Song_et_al_2012a" title="Song et al 2012a">Song et al 2012a</a></p>
<table class="diff diff-contentalign-left" data-mw="interface">
<tr style='vertical-align: top;' lang='en'>
<td colspan='1' style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan='1' style="background-color: white; color:black; text-align: center;">Revision as of 12:50, 14 October 2020</td>
</tr><tr><td colspan='2' style='text-align: center;' lang='en'><div class="mw-diff-empty">(No difference)</div>
</td></tr></table>Scipediacontenthttp://www.colloquiam.com/wd/index.php?title=Song_et_al_2012a&diff=174669&oldid=prevScipediacontent: Created page with " == Abstract == International audience We introduce a continuous time stochastic broadcast calculus for mobile and wireless networks. The mobility between nodes in a network..."2020-10-14T12:50:26Z<p>Created page with " == Abstract == International audience We introduce a continuous time stochastic broadcast calculus for mobile and wireless networks. The mobility between nodes in a network..."</p>
<p><b>New page</b></p><div><br />
== Abstract ==<br />
<br />
International audience 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 a leader election protocol.<br />
<br />
Document type: Part of book or chapter of book<br />
<br />
== Full document ==<br />
<pdf>Media:Draft_Content_435586299-beopen642-4891-document.pdf</pdf><br />
<br />
<br />
== Original document ==<br />
<br />
The different versions of the original document can be found in:<br />
<br />
* [https://link.springer.com/content/pdf/10.1007%2F978-3-642-33475-7_24.pdf https://link.springer.com/content/pdf/10.1007%2F978-3-642-33475-7_24.pdf]</div>Scipediacontent