Deterministic Communication in Radio Networks with Large Labels

We study deterministic gossiping in ad-hoc radio networks, where labels of the nodes are large, i.e., they are polynomially large in the size n of the network. A label-free model was introduced in the context of randomized broadcasting in ad-hoc radio networks, see [2]. Most of the work on deterministic communication in ad-hoc networks was done for the model with labels of size O(n), with few exceptions; Peleg [19] raised the problem of deterministic communication in ad-hoc radio networks with large labels and proposed the first deterministic O(n2 log n)- time broadcasting algorithm. In [11] Chrobak et al. proved that deterministic radio broadcasting can be performed in time O(n log2 n); their result holds for large labels.Here we propose two new deterministic gossiping algorithms for ad-hoc radio networks with large labels. In particular: - a communication procedure giving an O(n5/3 log3 n)-time deterministic gossiping algorithm for directed networks and an O(n4/3 log3 n)- time algorithm for undirected networks; - a gossiping procedure designed particularly for undirected networks resulting in an almost linear O(n log3 n)-time algorithm.

[1]  Imrich Chlamtac,et al.  The wave expansion approach to broadcasting in multihop radio networks , 1991, IEEE Trans. Commun..

[2]  Sami Tabbane.  Handbook Of Mobile Radio Networks , 2000 .

[3]  Suresh Singh,et al.  Asymptotically optimal Gossiping in Radio Networks , 1995, Discret. Appl. Math..

[4]  Andrzej Lingas,et al.  Oblivious gossiping in ad-hoc radio networks , 2001, DIALM '01.

[5]  Andrzej Pelc,et al.  Faster broadcasting in unknown radio networks , 2001, Inf. Process. Lett..

[6]  Anna Pagh,et al.  Deterministic Radio Broadcasting , 2000, ICALP.

[7]  Eyal Kushilevitz,et al.  An Omega(D log (N/D)) Lower Bound for Broadcast in Radio Networks , 1998, SIAM J. Comput..

[8]  Danilo Bruschi,et al.  Lower bounds for the broadcast problem in mobile radio networks , 1997, Distributed Computing.

[9]  Piotr Indyk,et al.  Explicit constructions of selectors and related combinatorial structures, with applications , 2002, SODA '02.

[10]  Igor Potapov,et al.  Gossiping with Unit Messages in Known Radio Networks , 2002, IFIP TCS.

[11]  Noga Alon,et al.  A Lower Bound for Radio Broadcast , 1991, J. Comput. Syst. Sci..

[12]  Reuven Bar-Yehuda,et al.  On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization , 1992, J. Comput. Syst. Sci..

[13]  Andrea E. F. Clementi,et al.  Round Robin is optimal for fault-tolerant broadcasting on wireless networks , 2001, J. Parallel Distributed Comput..

[14]  Reuven Bar-Yehuda,et al.  Multiple Communication in Multihop Radio Networks , 1993, SIAM J. Comput..

[15]  Andrzej Lingas,et al.  Gossiping with Bounded Size Messages in ad hoc Radio Networks , 2002, ICALP.

[16]  Andrea E. F. Clementi,et al.  Distributed multi-broadcast in unknown radio networks , 2001, PODC '01.

[17]  Wojciech Rytter,et al.  Fast broadcasting and gossiping in radio networks , 2002, J. Algorithms.

[18]  Andrzej Lingas,et al.  On adaptive deterministic gossiping in ad hoc radio networks , 2002, SODA '02.

[19]  Wojciech Rytter,et al.  Deterministic broadcasting in unknown radio networks , 2000, SODA '00.

[20]  Suresh Singh,et al.  Gossiping on a Ring with Radios , 1996, Parallel Process. Lett..

[21]  Andrea E. F. Clementi,et al.  Selective families, superimposed codes, and broadcasting on unknown radio networks , 2001, SODA '01.

[22]  Reuven Bar-Yehuda,et al.  Multiple communication in multi-hop radio networks , 1989, PODC '89.