Anzeige
Erschienen in:
2005 | OriginalPaper | Buchkapitel
Basic Computations in Wireless Networks
verfasst von : Ioannis Caragiannis, Clemente Galdi, Christos Kaklamanis
Erschienen in: Algorithms and Computation
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In this paper we address the problem of estimating the number of stations in a wireless network. Under the assumption that each station can detect collisions, we show that it is possible to estimate the number stations in the network within a factor 2 from the correct value in time
O
(log
n
log log
n
). We further show that if no station can detect collisions, the same task can be accomplished within a factor of 3 in time
O
(log
2
n
) and maximum energy
O
(log
n
) per node, with high probability. Finally, we present an algorithm that computes the minimum value held by the stations in the wireless network in time
O
(log
2
n
).