Deterministic communication in radio networks with large labels

Gasieniec, L; Pagourtzis, A; Potapov, I

dc.contributor.author	Gasieniec, L	en
dc.contributor.author	Pagourtzis, A	en
dc.contributor.author	Potapov, I	en
dc.date.accessioned	2014-03-01T01:17:42Z
dc.date.available	2014-03-01T01:17:42Z
dc.date.issued	2002	en
dc.identifier.issn	0302-9743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/14629
dc.subject	Ad Hoc Network	en
dc.subject	Radio Networks	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.other	BROADCAST	en
dc.title	Deterministic communication in radio networks with large labels	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/3-540-45749-6_46	en
heal.identifier.secondary	http://dx.doi.org/10.1007/3-540-45749-6_46	en
heal.language	English	en
heal.publicationDate	2002	en
heal.abstract	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(n(2) log n)time broadcasting algorithm. In [11] Chrobak et al. proved that deterministic radio broadcasting can be performed in time O(n log(2) 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(n(5/3) log(3) n)-time deterministic gossiping algorithm for directed networks and an O(n(4/3) log(3) n)time algorithm for undirected networks; - a gossiping procedure designed particularly for undirected networks resulting in an almost linear O(n log(3) n)-time algorithm.	en
heal.publisher	SPRINGER-VERLAG BERLIN	en
heal.journalName	ALGORITHMS-ESA 2002, PROCEEDINGS	en
heal.bookName	LECTURE NOTES IN COMPUTER SCIENCE	en
dc.identifier.doi	10.1007/3-540-45749-6_46	en
dc.identifier.isi	ISI:000181470400042	en
dc.identifier.volume	2461	en
dc.identifier.spage	512	en
dc.identifier.epage	524	en