Basic Computations in Wireless Networks | Zendy

Ioannis Caragiannis | Zendy; Clemente Galdi | Zendy; Christos Kaklamanis | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Basic Computations in Wireless Networks

Author(s) -

Ioannis Caragiannis,

Clemente Galdi,

Christos Kaklamanis

Publication year - 2005

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-30935-7

DOI - 10.1007/11602613_54

Subject(s) - computer science , computation , wireless network , node (physics) , binary logarithm , wireless , value (mathematics) , factor (programming language) , algorithm , real time computing , computer network , discrete mathematics , telecommunications , mathematics , structural engineering , machine learning , engineering , programming language

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(log2n) 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(log2n).

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research