Deterministic communication in radio networks with large labels

Gasieniec, L; Pagourtzis, A; Potapov, I; Radzik, T

dc.contributor.author	Gasieniec, L	en
dc.contributor.author	Pagourtzis, A	en
dc.contributor.author	Potapov, I	en
dc.contributor.author	Radzik, T	en
dc.date.accessioned	2014-03-01T01:26:06Z
dc.date.available	2014-03-01T01:26:06Z
dc.date.issued	2007	en
dc.identifier.issn	0178-4617	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/17926
dc.subject	Ad hoc radio networks	en
dc.subject	Communication protocols	en
dc.subject	Gossiping	en
dc.subject	Selective families of sets	en
dc.subject.classification	Computer Science, Software Engineering	en
dc.subject.classification	Mathematics, Applied	en
dc.subject.other	Ad hoc radio networks	en
dc.subject.other	Broadcasting algorithm	en
dc.subject.other	Gossiping	en
dc.subject.other	Undirected networks	en
dc.subject.other	Algorithms	en
dc.subject.other	Identification (control systems)	en
dc.subject.other	Network protocols	en
dc.subject.other	Polynomials	en
dc.subject.other	Problem solving	en
dc.subject.other	Telecommunication networks	en
dc.subject.other	Radio systems	en
dc.title	Deterministic communication in radio networks with large labels	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/s00453-006-1212-3	en
heal.identifier.secondary	http://dx.doi.org/10.1007/s00453-006-1212-3	en
heal.language	English	en
heal.publicationDate	2007	en
heal.abstract	We study deterministic gossiping in aid hoc radio networks with large node labels. The labels (identifiers) of the nodes come from a domain of size N which may be much larger than the size a of the network (the number of nodes). Most of the work on deterministic communication has been done for the model with small labels which assumes N = O(n). A notable exception is Peleg's paper [32]. where the problem of deterministic communication in ad hoc radio networks with large labels is raised and a deterministic broadcasting algorithm is proposed, which runs in O(n(2) log n) time for N polynomially large in n. The O(n log(2) n)-time deterministic broadcasting algorithm for networks with small labels given by Chrobak et al. [11] implies deterministic O (n log N log n)-time broadcasting and O(n(2) log(2) N log n)-time gossiping in networks with large labels. We propose two new deterministic gossiping algorithms for ad hoc radio networks with large labels, which are the first Such algorithms with subquadratic time for polynomially large N. More specifically, we propose: - a deterministic O(n(3/2) log(2) N log n)-time gossiping algorithm for directed networks; and - a deterministic O(n log(2) N log(2) n)-time gossiping algorithm for undirected networks.	en
heal.publisher	SPRINGER	en
heal.journalName	Algorithmica (New York)	en
dc.identifier.doi	10.1007/s00453-006-1212-3	en
dc.identifier.isi	ISI:000243363900005	en
dc.identifier.volume	47	en
dc.identifier.issue	1	en
dc.identifier.spage	97	en
dc.identifier.epage	117	en