Treffer: A randomized algorithm for gossiping in radio networks
Title:
A randomized algorithm for gossiping in radio networks
Authors:
Source:
Networks (New York, NY). 43(2):119-124
Publisher Information:
New York, NY: John Wiley & Sons, 2004.
Publication Year:
2004
Physical Description:
print, 27 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Telecommunications et theorie de l'information, Telecommunications and information theory, Télécommunications, Telecommunications, Radiocommunications, Algorithme déterministe, Deterministic algorithms, Algorithme randomisé, Randomized algorithm, Algoritmo aleatorizado, Echange total, Gossiping(all to all), Todos a todos, Optimisation, Optimization, Optimización, Radiocommunication, Radio communication, Radiocomunicación, Réseau radio, Radio networks, Topologie circuit, Network topology, gossiping, radio networks, randomized algorithms
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
Department of Computer Science, University of California, Riverside, California 92521, United States
Department of Computer Science, University of Liverpool, Liverpool L69 7ZF, United Kingdom
Instytut Informatyki, Uniwersytet Warszawski, Banacha 2, 02-097, Warszawa, Poland
Department of Computer Science, University of Liverpool, Liverpool L69 7ZF, United Kingdom
Instytut Informatyki, Uniwersytet Warszawski, Banacha 2, 02-097, Warszawa, Poland
ISSN:
0028-3045
Rights:
Copyright 2005 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Telecommunications and information theory
Accession Number:
edscal.16950805
Database:
PASCAL Archive
Weitere Informationen
We present an O(n log4n)-time randomized algorithm for gossiping in radio networks with unknown topology. This is the first algorithm for gossiping in this model whose running time is only a polylogarithmic factor away from the optimum. The fastest previously known (deterministic) algorithm for this problem works in time O(n3/2log2n).