TY - JOUR

T1 - Fast radio broadcasting with advice

AU - Ilcinkas, David

AU - Kowalski, Dariusz R.

AU - Pelc, Andrzej

N1 - Funding Information:
This work was done during the stay of David Ilcinkas at the Research Chair in Distributed Computing of the Université du Québec en Outaouais and at the University of Ottawa, as a postdoctoral fellow. First author’s research partially supported by the ANR project ‘‘ALADDIN’’, and the INRIA project ‘‘CEPAGE’’. Second author’s work was supported by the Engineering and Physical Sciences Research Council [grant number EP/G023018/1]. Third author’s research partially supported by NSERC discovery grant and by the Research Chair in Distributed Computing at the Université du Québec en Outaouais.
Copyright:
Copyright 2010 Elsevier B.V., All rights reserved.

PY - 2010/3/17

Y1 - 2010/3/17

N2 - We study deterministic broadcasting in radio networks in the recently introduced framework of network algorithms with advice. We concentrate on the problem of trade-offs between the number of bits of information (size of advice) available to nodes and the time in which broadcasting can be accomplished. In particular, we ask what is the minimum number of bits of information that must be available to nodes of the network, in order to broadcast very fast. For networks in which constant time broadcast is possible under a complete knowledge of the network we give a tight answer to the above question: O (n) bits of advice are sufficient but o (n) bits are not, in order to achieve constant broadcasting time in all these networks. This is in sharp contrast with geometric radio networks of constant broadcasting time: we show that in these networks a constant number of bits suffices to broadcast in constant time. For arbitrary radio networks we present a broadcasting algorithm whose time is inverse-proportional to the size of the advice.

AB - We study deterministic broadcasting in radio networks in the recently introduced framework of network algorithms with advice. We concentrate on the problem of trade-offs between the number of bits of information (size of advice) available to nodes and the time in which broadcasting can be accomplished. In particular, we ask what is the minimum number of bits of information that must be available to nodes of the network, in order to broadcast very fast. For networks in which constant time broadcast is possible under a complete knowledge of the network we give a tight answer to the above question: O (n) bits of advice are sufficient but o (n) bits are not, in order to achieve constant broadcasting time in all these networks. This is in sharp contrast with geometric radio networks of constant broadcasting time: we show that in these networks a constant number of bits suffices to broadcast in constant time. For arbitrary radio networks we present a broadcasting algorithm whose time is inverse-proportional to the size of the advice.

KW - Advice

KW - Deterministic broadcasting

KW - Distributed algorithm

KW - Radio network

UR - http://www.scopus.com/inward/record.url?scp=76849099272&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=76849099272&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2010.01.004

DO - 10.1016/j.tcs.2010.01.004

M3 - Article

AN - SCOPUS:76849099272

VL - 411

SP - 1544

EP - 1557

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 14-15

ER -