Broadcasting in UDG Radio Networks with Missing and Inaccurate Information [chapter]

Emanuele G. Fusco, Andrzej Pelc
<i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
when optimal time is O(D). Nevertheless, under our very weak scenario, we construct a broadcasting algorithm that maintains optimal time O min D + g 2 , D log g for all networks with at least 2 nodes, of diameter D and granularity g (previously obtained with exact positions and known density), if each node perceives its position with error margin ε = αd, for any (unknown) constant α < 1/2. Rather surprisingly, the minimum time of an algorithm working correctly for all networks, and hence
more &raquo; ... g if the source is alone, turns out to be Θ (D + g 2 ). Thus, the mere stopping requirement for the special case of the lonely source causes an exponential increase in broadcasting time, for networks of any density and any small diameter. Finally, if ε ≥ d/2, then broadcasting is impossible.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="">doi:10.1007/978-3-540-87779-0_18</a> <a target="_blank" rel="external noopener" href="">fatcat:o46d7xaayzfyff2aix53squyma</a> </span>
<a target="_blank" rel="noopener" href="" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href=""> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> </button> </a>